There is nothing mysterious about computer viruses. A working, but easily observable, virus can be written in a few lines of code. Although particular virus attacks may be guarded against, no general defense within one domain of reference is possible; viruses are a natural consequence of stored-program computation. Like other hazards of technology, their threat may be mitigated by cautious beha...

In this paper, we introduce the notion of super finitely separating functions which gives a characterization of RB-domains. Then we prove that FS-domains and RB-domains are equivalent in some special cases by the following three claims: a dcpo is an RB-domain if and only if there exists an approximate identity for it consisting of super finitely separating functions; a consistent join-semilatti...

Applying learning techniques to acquire action models is an area of intense research interest. Most previous works in this area have assumed that there is a significant amount of training data available in a planning domain of interest, which we call target domain, where action models are to be learned. However, it is often difficult to acquire sufficient training data to ensure that the learne...

In many machine learning algorithms, a major assumption is that the training and the test samples are in the same feature space and have the same distribution. However, for many real applications this assumption does not hold. In this paper, we survey the problem where the training samples and the test samples are from different distributions. This problem can be referred as domain adaptation. ...

The problem of active shielding (AS) for a multiply connected domain consists of constructing additional sources of the field (e.g., acoustic) so that all individual subdomains can either communicate freely with one another or otherwise be shielded from their peers. This problem can be interpreted as a special inverse source problem for the differential equation (or system) that governs the fie...

We show that the first author’s QRB-domains coincide with Li and Xu’s QFS-domains, and also with Lawson-compact quasi-continuous dcpos, with stably-compact locally finitary compact spaces, with sober QFSspaces, and with sober QRB-spaces. The first three coincidences were discovered independently by Lawson and Xi. The equivalence with sober QFS-spaces is then applied to give a novel, direct proo...

We present two characterisations of FS domains, using the upper and the lower power domain construction, respectively. These characterisations have a common structure and thus can be generalised from the two power constructions to arbitrary premonads. The resulting classes of domains are considered in general, and some special instances are studied in greater detail. They form classes of domain...