In a pervasive environment, prior knowledge of tasks is not always possible owing to the characteristic uncertainty of the tasks. Moreover, we may not be able to define any tasktemplate at all that can be modeled as a goal for a service composition process. In this paper, we have modeled a service composition process as an event-handling process in the domain of pervasive computing. We have als...

BACKGROUND Assessment of blood compatibility, typically by tube agglutination (TUBE) and hemolysis crossmatch or, less commonly, by blood typing and alloantibody screening, often is performed before blood transfusion in horses. In contrast, gel column (GEL) and immunochromatographic strip (STRIP) techniques are preferred for compatibility testing in dogs and cats. OBJECTIVE To determine the a...

Geographically, men and women share the same space, but everywhere in the world, women are accorded a lower status than men. The North Eastern Region of India has been considered as a backward region in terms of growth in per capita income. However, there is a perception that the status of women is higher in the North Eastern Region of the country in comparison with the status of women in all I...

zinc oxide nano-particles with the average diameter of about 25 nm were modified with different mole ratios of trimetoxyvinyl silane (tmvs) and oleic acid, as coupling agents, in order to modify their surface properties and render them more hydrophobic. then, dispersibility of the surface modified nano-particles was examined in some monomers with different levels of hydrophobicity, including me...

Example Output • Type Strength – A language characteristic based on the amount of coercion (casting) permitted and performed among its data types  Less coercions = stronger typing – Coercion is generally performed during compile time to insure compatibility of operator and operand types – C integer coercions are rule based  Integer ranking  Integer promotion rules  Usual arithmetic conversi...

Let G be a connected reductive algebraic group over the algebraic closure of a finite field Fq of good characteristic. In this paper, we demonstrate a remarkable compatibility between the Springer correspondence for G and the parametrization of unipotent characters of G(Fq). In particular, we show that in a suitable sense, “large” portions of these two assignments in fact coincide. This extends...

In this paper a procedure is shown to modify a finite state machine in such a way that an OneShot-Coding of their states is possible. The characteristic of One-Shot-Codes for finite state machines result in some properties of the realized sequential networks. The main advantage is less power dissipation, better electromagnetic compatibility and very fast circuits because only one bit changes be...