This is an expository note on the Lascar group. We also study the Lascar group over hyperimaginaries, and make some new observations on the strong types over those. In particular we show that in a simple theory, Ltp ≡ stp in real context implies that for hyperimaginary context. The Lascar group introduced by Lascar [8], and related subjects have been studied by many authors ([9][1][7][6][3] and...

We have presented a classification framework that combines multiple heterogeneous classifiers in the presence of class label noise. An extension of m-Mediods based modeling is presented that generates model of various classes whilst identifying and filtering noisy training data. This noise free data is further used to learn model for other classifiers such as GMM and SVM. A weight learning meth...

Suppose κ is λ-supercompact witnessed by an elementary embedding j : V →M with critical point κ, and further suppose that F is a function from the class of regular cardinals to the class of cardinals satisfying the requirements of Easton’s theorem: (1) ∀α α < cf(F (α)) and (2) α < β =⇒ F (α) ≤ F (β). In this article we address the question: assuming GCH, what additional assumptions are necessar...

The concept of occupationalther­ apy as a "science of adaptive responses," as proposed by King in her 7978 Eleanor Clarke Slagle Lecture, is explored and expanded on in this article. The authors pos­ tulate an adaptation continuum consIsting of homeostatzc reac­ tions, adaptive responses, adaptIVe skills, and adaptive patterns-a continuum that places the adap­ tive response in a sequential and ...

In a repeated-interaction public goods economy, dynamic behavior may affect the efficiency of various mechanisms thought to be efficient in one-shot games. Inspired by results obtained in previous experiments, the current paper proposes a simple best response model in which players’ beliefs are functions of previous strategy profiles. The predictions of the model are found to be highly consiste...

We present an algorithm that computes the structure of a finite abelian group G from a generating system M . The algorithm executes O(|M | √ |G|) group operations and stores O( √ |G|) group elements.