India and China face the same challenge of having too few trained psychiatric personnel to manage effectively the substantial burden of mental illness within their population. At the same time, both countries have many practitioners of traditional, complementary, and alternative medicine who are a potential resource for delivery of mental health care. In our paper, part of The Lancet and Lancet...

A half century of empirical work attempting to predict the factor content of trade in goods has failed to bring theory and data into congruence. Our study shows how the Heckscher-Ohlin-Vanek theory, when modified to permit technical differences, a breakdown in factor price equalization, the existence of nontraded goods, and costs of trade, is consistent with data from ten OECD countries and a r...

Flat iteration is a variation on the original binary version of the Kleene star operation P Q, obtained by restricting the rst argument to be a sum of atomic actions. It generalizes pre x iteration, in which the rst argument is a single action. Complete nite equational axiomatizations are given for ve notions of bisimulation congruence over basic CCS with at iteration, viz. strong congruence, b...

the aim of the present research was to investigate the relationship between the components of organizational intelligence and organizational culture in physical education general office and offices in east azerbaijan province. the present research was a descriptive – correlation one and performed as a field. the statistical population consisted of the staff of physical education general office ...

Nearly twenty years ago, two of the authors wrote a paper on congruence lattices of semilattices [9]. The problem of finding a really useful characterization of congruence lattices of finite semilattices seemed too hard for us, so we went on to other things. Thus when Steve Seif asked one of us at the October 1990 meeting of the AMS in Amherst what we had learned in the meantime, the answer was...

Congruence Closure and Applications Congruence closure algorithms for solving word problems for finitely pre-sented algebras have also been used in combining decision procedures. Onthe other hand, congruence closure can itself be looked upon as a combina-tion problem. Taking this view leads us to define the notion of an abstractcongruence closure. We present a completion based d...

A congruence relation θ on an algebra A is fully invariant if every endomorphism of A preserves θ. A congruence θ is verbal if there exists a variety V such that θ is the least congruence of A such that A/θ ∈ V. Every verbal congruence relation is known to be fully invariant. This paper investigates fully invariant congruence relations that are verbal, algebras whose fully invariant congruences...