We present a novel ordinal co-occurrence matrix framework for the purpose of content-based texture retrieval. Several particularizations of the framework will be derived and tested for retrieval purposes. Features obtained using the framework represent the occurrence frequency of certain ordinal relationships at different distances and orientations. In the ordinal co-occurrence matrix framework...

To realize quick and robust fire detection with image information of real scenes, smoke is a key feature information in detection methods. Since smoke does not keep stationary shape, it is difficult apply ordinal image processing techniques such as the edge or contour detection directly. Image information of smoke is also affected from its environmental conditions such as illumination changes a...

Let α be an ordinal. Then α­1, the set of all ordinals equal to or preceding α, is a compact Hausdorff topological space. The space of all real-valued continuous functions on α­1 is commonly denoted by C(α). In this paper, we study the symmetric sequence spaces which are isomorphic to subspaces of C(α) for some countable ordinal α. In the next section, we prove a general result which shows that...

Most discussions of ordinal variables in the sociological literature debate the suitability of linear regression and structural equation methods when some variables are ordinal. Largely ignored in these discussions are methods for ordinal variables that are natural extensions of probit and logit models for dichotomous variables. If ordinal variables are discrete realizations of unmeasured conti...

We studied whether temporal sequences can be learned implicitly using a process dissociation procedure (PDP). Participants performed repeated serial recalls of sequential stimuli with a random ordinal structure and fixed temporal structure. Explicit knowledge was evaluated through verbal questions and PDP analysis of two generation tasks (inclusion and exclusion). Participants were divided into...

This is the second of two papers establishing structural properties of R2, the structure giving rise to pure patterns of resemblance of order two, which partially underly the results in [2] and [3] as well as other work in the area. For the entire paper, we will assume ρ is an arbitrary additively indecomposable ordinal and α is an epsilon number greater than ρ. By Lemma 5.8 of [4], κα is addit...

If α is an ordinal, then the space of all ordinals less than or equal to α is a compact Hausdorff space when endowed with the order topology. Let C(α) be the space of all continuous real-valued functions defined on the ordinal interval [0, α]. We characterize the symmetric sequence spaces which embed into C(α) for some countable ordinal α. A hierarchy (Eα) of symmetric sequence spaces is constr...

Ordinal computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines, where α and β bound the time axis and the space axis of some machine model. The spectrum ranges from classical Turing computability to ∞-∞-computability which corresponds to Gödel’s model of constructible sets. ...

envelopment analysis (dea) is a very eective method to evaluate the relative eciency of decision-making units (dmus). dea models divided all dmus in two categories: ecient and inecientdmus, and don't able to discriminant between ecient dmus. on the other hand, the observedvalues of the input and output data in real-life problems are sometimes imprecise or vague, suchas interval data, ...