An exact hidden sphere algorithm that operates in linear time " , Comput

A tiling by triangles of an orientable surfaces is called kaleidoscopic if the local reflection in any edge of a triangle extends to a global isometry of the surface. Given such a global reflection the fixed point subset of the reflection consists of embedded circles (ovals) whose union is called the mirror of the reflection. The reflection is called separating if removal of the mirror disconne...

In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several graph families having such path separability, and we show that this property is closed under minor taking. In particular we establish a list of forbidden minors for 1-path separable graphs.

The design and implementation of environmental policy often involves more than one pollutant, and must consider pollution as a byproduct of the production of marketable output. In this paper, we test the implicit assumption in the empirical literature that (1) production of marketable output, pollution, and abatement are separable, and (2) different pollutants can be abated separately. Using un...

We introduce a separability criterion based on the positive map #:$ ̃(Tr $)!$ , where $ is a trace-class Hermitian operator. Any separable state is mapped by the tensor product of # and the identity into a nonnegative operator, which provides a simple necessary condition for separability. This condition is generally not sufficient because it is vulnerable to the dilution of entanglement. In the ...

Finding a logical formula that separates positive and negative examples given in the form of labeled data items is fundamental applications such as concept learning, reverse engineering database queries, generating referring expressions, entity comparison knowledge graphs. In this paper, we investigate existence separating for presence an ontology. Both ontology language separation language, co...

A new decomposition form is introduced in this report to establish a criterion for the bi-partite separability of Bell diagonal states. A such criterion takes a quadratic inequality of the coefficients of a given Bell diagonal states and can be derived via a simple algorithmic calculation of its invariants. In addition, the criterion can be extended to a quantum system of higher dimension. Keyw...

The unique ecosystems of the Hawaiian Islands are progressively being threatened following the introduction of exotic species. Operational implementation of remote sensing for the detection, mapping and monitoring of these biological invasions is currently hampered by a lack of knowledge on the spectral separability between native and invasive species. We used spaceborne imaging spectroscopy to...

In this paper an attempt has been made to develop a decision tree classification algorithm for remotely sensed satellite data using the separability matrix of the spectral distributions of probable classes in respective bands. The spectral distance between any two classes is calculated from the difference between the minimum spectral value of a class and maximum spectral value of its preceding ...

The piecewise testable separability problem asks, given two input languages, whether there exists a piecewise testable language that contains the first input language and is disjoint from the second. We prove a general characterisation of piecewise testable separability on languages in a well-quasiorder, in terms of ideals of the ordering. This subsumes the known characterisations in the case o...