Service interaction manifest itself as an unexpected behaviour of multiple services used together either simultaneously or in sequence. The paper describes a policy based approach to web service interaction management. Parlay X web services for call control, mobility, user interaction and policy management are studied. Web service behaviour is described as a set of policy rules. Rules are gener...

A multiple quantifier is a quantifier having inference rules that introduce or eliminate arbitrary number of quantifiers by one inference. This paper introduces the lambda calculus with negation, conjunction, and multiple existential quantifiers, and the lambda calculus with implication and multiple universal quantifiers. Their type checking and type inference are proved to be undecidable. This...

We define a sound and complete logic, called FO⊃, which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of intuitionistic implication, the semantics of FO⊃ is based on structures over a partially ordered set of worlds. In these structures, classical quantifiers and connectives (in particular, implication) are interpreted wi...

This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related data values. We show that CINDs are useful not only in data cleaning, but are also in contextual schema matching [7]. To make effective use of CINDs in practice, it is often necessary to reason about them. The most imp...

this paper presents a reduce roll vibration of the full vehicle model with passive suspension systems using vibration absorber to change the dynamic system matrix stat’s eigenvalue. since using the controller system has been splurged and required to energy consuming, in this research the vehicle body roll vibration has been reduced and supplied vehicle stability using a vibration absorber for t...

An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...

The wish to automatically construct correct systems from specifications has been around for about half a century. Church was the first one to describe this idea in 1962. Our work is closely related to this idea. We will consider systems which react to the environment denoted as open modules and our specification language is linear temporal logic (LTL). Synthesis is the problem of automatically ...

A method to integrate an (in principle) unlimited number of molecular logic gates to construct complex circuits is presented. Logic circuits, such as half- or full-adders, can be reinterpreted by using the functional completeness of the implication function (IMP) and the trivial FALSE operation. The molecular gate IMP is represented by a fluorescent boronic acid sugar probe. An external wiring ...

We study the implication problem of measure-based constraints. These constraints are formulated in a framework for measures generalizing that for mathematical measures. Measures arise naturally in a wide variety of domains. We show that measure constraints, for particular measures, correspond to constraints that occur in relational databases, data mining applications, cooperative game theory, a...

We define binary equality implication constraints (BEICs) in relational databases and study the implication problem of these constraints, in particular, we provide a sound and complete set of inference rules for a common subset of BEICs. Two normal forms with respect to BEICs are defined and shown to be necessary and sufficient to prevent different types of data redundancies that may be caused ...