Nonparametric tests for investigating the separability of a spatial-temporal marked point process are described and compared. It is shown that a Cramer-von Mises-type test is very powerful at detecting gradual departures from separability, and that a residual test based on randomly rescaling the process is powerful at detecting nonseparable clustering or inhibition of the marks. An application ...

Due to the importance of quantum entangled states in quantum information and computation [1, 2, 3], much effort has been done recently towards an operational characterization of separable states [4, 5, 6]. The manifestations of mixed-state entanglement can be very subtle [7]. Till now there is no general efficient criterion in judging the separability. The Bell inequalities [8], Peres PPT crite...

It has been proposed (see, specifically, M. J. Farah, K. D. Wilson, M. Drain, & J. N. Tanaka, 1998) that human faces are used in cognition as undifferentiated wholes. General recognition theory (GRT; F. G. Ashby & J. T. Townsend, 1986) is used to represent hypotheses regarding the possible sources for the behavioral evidence supporting holistic representation. Specifically, it is suggested that...

Benders decomposition is a well-known procedure for solving a combinatorial optimization problem by defining it in terms of a master problem and a subproblem. Its effectiveness relies on the possibility of synthethising Benders cuts (or nogoods) that rule out not only one, but a large class of trial values for the master problem. In turns, this depends on the possibility of separating the subpr...

We study a model of group identification in which individuals’ opinions as to the membership of a group are aggregated to form a list of the group’s members. Potential aggregation rules are studied through the axiomatic approach. We introduce two axioms, meet separability and join separability, each of which requires the list of members generated by the aggregation rule to be independent of whe...

In the last decade, some illumination preprocessing approaches were proposed to eliminate the lighting variation in face images for lighting-invariant face recognition. However, we find surprisingly that existing preprocessing methods were seldom modeled to directly enhance the separability of different faces, which should have been the essential goal. To address the issue, we propose to explic...

In this paper we study the separability of two disjoint sets of objects in the plane according to two criteria: wedge separability and strip separability. We give algorithms for computing all the separating wedges and strips, the wedges with the maximum and minimum angle, and the narrowest and the widest strip. The objects we consider are points, segments, polygons and circles. As applications,...

Using approximations, we give several characterizations of separability of bimodules. We also discuss how separability properties can be used to transfer some representation theoretic properties from one ring to another one: contravariant finiteness of the subcategory of (finitely generated) left modules with finite projective dimension, finitistic dimension, finite representation type, Ausland...

There are three key dimensions by which revealed preference bounds on consumer demand responses to price variation can be improved. The first relates to the improvements that arise from using expansion paths for given relative prices, E-bounds. The second concerns the addition of new price information. Thirdly, there are improvements due to assuming separability. Our previous research has exami...

Given a set P of n points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate n points, picked randomly (and uniformly) in the unit square, is Θ̃(n), where Θ̃ hides polylogarithmic factors. In addition, we provide a fast approximation algorithm for computing the separa...