the value of good X (x-axis) and such that the response is menu dependent (red when X is offered against Y, blue when X is offered against Z). Transitivity violations (i.e., cases where x-axis orderings are not conserved on the y-axis) are possible, as for X1, X2, X3. However, if the representation is menu invariant (i.e., if red and blue lines coincide), transitivity violations cannot occur. I...

Abstract: In this paper an application of the adaptive neuro-fuzzy inference system has been introduced to predict the behavior of a chaotic robot. The chaotic mobile robot implies a mobile robot with a controller that ensures chaotic motions. Chaotic motion is characterized by the topological transitivity and the sensitive dependence on initial conditions. We have used the controller such that...

In this paper we prove two new results about closed semigroups in the family of solvable groups Hmn := R nφ R where φ, the structure homomorphism, maps nontrivially into the center of Aut(Rn). The rst result states that the closure of a semigroup generated by a set in Hmn that is not included in a maximal semigroup with nonempty interior is actually a group. The second result states that among ...

This paper introduces fundamental ideas of bitopological dynamical systems. Here, notions transitivity, point pairwise iterated compactness, weakly etc. are introduced. Later, it is shown that under homeomorphism, transitivity implies transitivity. Moreover, homeomorphism; compactness and found to be equivalent. we apply our results in the development process a human embryo from zygote until bi...

nonnative english-speaking scholars have often been reported to be at a disadvantage vis-à-vis their english native counterparts when it comes to writing a publishable research article (ra). when they submit their manuscripts to english-language journals, they sometimes receive comments criticizing their faulty english. one area of difficulty for these authors is the grammaticalization of neutr...

We build a theoretical framework that enables to extend the concept of transitive closure to the class of complete crisp relations, the class of reciprocal 3-valued relations and the class of reciprocal [0, 1]valued relations. We present algorithms to compute the transitive closure of reciprocal [0, 1]-valued relations, where the type of transitivity is either weak stochastic transitivity or st...

This paper discusses strategies for pre-processing spatial queries before executing them in a geographic database. A computational method has been devised, which is capable of assessing whether or not a spatial query is consistent, i.e., that its constraints are free of any selfcontradictions. If the query is inconsistent, it can be rejected immediately without a need to process it in the datab...

We prove that in the space of all Cr (r ≥ 1) partially hyperbolic diffeomorphisms, there is a C1 open and dense set of accessible diffeomorphisms. This settles the C1 case of a conjecture of Pugh and Shub. The same result holds in the space of volume preserving or symplectic partially hyperbolic diffeomorphisms. Combining this theorem with results in [Br], [Ar] and [PugSh3], we obtain several c...

Natural languages vary widely in the degree to which they make use of hierarchical composition in their grammars, in particular, the degree to which syntactic versus morphological means of composition are utilized. Languages historically spoken in small communities develop much deeper levels of morphological embedding than those spoken by larger groups, an observation confirmed by a statistical...

A distributional model of the relation between judgments on transitivity tasks and memory for premise comparisons is proposed, according to which a total population of children solving a transitivity task can be divided into two subpopulations: (a) The operational subpopulation consists of all children who infer their transitivity judgments (e.g., stick A is longer than stick C) from a composit...