We propose a variation of the notion of Segre class, by forcing a naive `inclusion-exclusion' principle to hold. The resulting class is computationally tractable, and is closely related to Chern-Schwartz-MacPherson classes. We deduce several general properties of the new class from this relation, and obtain an expression for the Milnor class of an arbitrary scheme in terms of this class.

This paper discusses information systems in community development contexts through the perspective of social exclusion. The discussion is situated within a particular geographical community in London and is based on initiatives to address healthcare needs within the context of a connected community initiative. The discussion considers the relation of information systems to social development an...

We focus on L(A), the filter of supersets of A in the structure of the computably enumerable sets under the inclusion relation, where A is an atomless r-maximal set. We answer a long standing question by showing that there are infinitely many pairwise non-isomorphic filters of this type.

Informed by insights from quantum chaos theory, three approaches for estimating finite-Larmor-radius (FLR) stabilization of ideal magnetohydrodynamic (MHD) instabilities are discussed: phase space criteria based on the Weyl formula, “pseudo-FLR” modifications of MHD to suppress large perpendicular wavenumbers, and inclusion of drift corrections to the dispersion relation. PACS numbers: 52.35.Bj...

-----------------------------We show that the (interim) fine core of an atomless exchange economy with differential information is a subset of the ex-post core of the economy. Moreover, the interim fine core may be empty, and therefore it may be a proper subset of the ex-post core. The inclusion relation does not hold for economies with a finite number of traders.

Let H be a separable complex Hilbert space. Denote by G∞(H) the Grassmannian consisting of closed linear subspaces with infinite dimension and codimension. This Grassmannian is partially ordered by the inclusion relation. We show that every continuous order preserving bijective transformation of G∞(H) is induced by an invertible bounded semi-linear operator.

In this article we introduce the difference sequence spacesW0[ f ,∆m],W1[ f ,∆m], W∞[ f ,∆m] and S[ f ,∆m], defined by a modulus function f . We obtain a relation between W1[ f ,∆m]∩ l∞[ f ,∆m] and S[ f ,∆m]∩ l∞[ f ,∆m] and prove some inclusion results.

The enumeration of pseudo-intents is a long-standing problem in which the order plays a major role. In this paper, we present new algorithms that enumerate pseudo-intents in orders that do not necessarily respect the inclusion relation. We show that, confirming established results, this enumeration is equivalent to computing minimal transversals in hypergraphs a bounded number of times.

The enumeration of pseudo-intents is a long-standing problem in which the order plays a major role. In this paper, we present new algorithms that enumerate pseudo-intents in orders that do not necessarily respect the inclusion relation. We show that, confirming established results, this enumeration is equivalent to computing minimal transversals in hypergraphs a bounded number of times.

Information retrieval is the essential task for Traffic Information Service System in Intelligent Transportation Systems (ITS). There a lot of fuzzy traffic information derived from human factor. To achieve fuzzy semantic retrieval, this paper proposes an approach using Resource Description Framework (RDF) and fuzzy ontology. First, we apply RDF data model to represent traffic information on th...