Studies on contact problems such as shape recovery from tactile sensing involve complex geometrics and kinematics. In the rst part of the paper we introduce a convenient matrix expression of 3-D surfaces, which can be easily applied to manipulate contact constraints and kinematics equations using homogeneous transformation. In the second part of the paper we apply the notation introduced in the...

We propose a multiperiod model in which competitive arbitrageurs exploit discrepancies between the prices of two identical risky assets traded in segmented markets. Arbitrageurs need to collateralize separately their positions in each asset, and this implies a financial constraint limiting positions as a function of wealth. In our model, arbitrage activity benefits all investors because arbitra...

This work presents the idea and a prototype of workflow systems defined through constraints. We think that in many domain areas, such as health care, workflow systems are too inflexible. One does not know in advance what activities does the patient has to go through. Actually a new form of interaction with the workflow is needed, in which a controller asks the systems which precondition activit...

the realization optimality theory is a recent development in the original optimality theory which is proposed to deal with morphological issues especially the inflectional ones. its main idea is to consider the morphological realization rules as ranked violable language-specific constraints that control the realization processes and provide phonological information of grammatical morphemes. thi...

train energy saving problem investigates how to control train's velocity such that the quantity of energy consumption is minimized and some system constraints are satis ed. on the assumption that the train's weights on different links are estimated by fuzzy variables when making the train scheduling strategy, we study the fuzzy train energy saving problem. first, we propose a fuzzy energy ...

this study set out to investigate the distribution of the syntactic properties associatedwith the prodrop parameter by persian-speaking l2 learners of english in an attemptto examine the (un)attainability of native-like knowledge and (in)accessibility of ugin adult sla. to do so, 92 participants were assigned into different levels of l2knowledge based on their performances on the oxford placeme...

This paper investigates Constraint Satisfaction Problems (CSPs) that axe distributed by nature, i.e., there is a division of the CSP into sub components (agents) that axe connected via constraints, where each subcomponent includes several of the CSP variables with the constraints between them. We call such a problem a Distributed CSP (DCSP). In this paper we give a formal definition of DCSPs an...

We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronous Forward Checking (AFC). The second algorithm, Asynchronous Inter-Level Forward-Checking (AILFC), is based on the AFC-ng algorithm and is performed on a pseudo-tree ordering of the constraint graph. AFC-ng and AILFC ...