suppose that  is a finite group. then the set of all prime divisors of  is denoted by  and the set of element orders of  is denoted by . suppose that . then the number of elements of order  in  is denoted by  and the sizes of the set of elements with the same order is denoted by ; that is, . in this paper, we prove that if  is a group such that , where , then . here  denotes the family of suzuk...

(57) Disclosed is a system and method for computing out of plane motion between tWo ultrasound images. The method identi ?es regions of fully developed speckle that are common to the tWo images, computes a correlation coe?icient corresponding to the tWo fully developed speckle image regions, and then computing an elevation distance corresponding to the corre lation coe?icient. The method exploi...

Message passing is one of the primary modes of interprocess communication in a distributed system. In this paper we investigate the possibility of characterizing and axiomatizing different message passing systems in temporal logic. Specifically, we consider FIFO buffers (queues), LIFO buffers (stacks) and unordered buffers (bags). We show that all bounded buffers are characterizable in proposit...

let l = u3(9) be the simple projective unitary group in dimension 3 over a eld with 92 elements. in this article, we classify groups with the same order and degree pattern as an almost simple group related to l. since aut(l) = z4 hence almost simple groups related to l are l, l : 2 or l : 4. in fact, we prove that l, l : 2 and l : 4 are od-characterizable.

In this paper, we describe a new region-based approach to active contours for segmenting images composed of two or three types of regions characterizable by a given statistic. The essential idea is to derive curve evolutions which separate two or more values of a predetermined set of statistics computed over geometrically determined subsets of the image. Both global and local image information ...

We investigate the extent of second order characterizable structures by extending Shelah’s Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T . We show that all sufficiently large models of T have a characterization up to isomorphism in the extension of second order logic obtained by adding a little bit of infinitary logic if and only if...

Since 1969, the superstructure has been the usual approach to nonstandard analysis. The method used to measure the strength of a GDmodel Divine attribute, which is comparable to a human attribute, is, at least, partially expressible in terms of cardinality. In this paper, it is shown that for the non-atomic approach to superstructure construction such a cardinality does not have a set-theologic...

Global-as-view (GAV) constraints form a class of database constraints that has been widely used in the study of data exchange and data integration. Specifically, relationships between different database schemas are commonly described by a schema mapping consisting of a finite set of GAV constraints. Such schema mappings can be viewed as representations of an infinite set of data examples. We st...

The class of threshold functions is known to be characterizable by functional equations or, equivalently, by pairs of relations, which are called relational constraints. It was shown by Hellerstein that this class cannot be characterized by a finite number of such objects. In this paper, we investigate classes of threshold functions which arise as intersections of the class of all threshold fun...