objectives: hemiplegia is a non-progressive damage in premature growing brain which causes movement disorders in one side of the body. the objective of present research is to study the method of modified constraints induced movement therapy (cimt) which can be appropriate on unimanual and bimanual functions of children with hemiplegia. methods: this single-blinded, randomized, control trial stu...

this paper argues that a risk averse of workers after-tax reservation wage the difference between her reservation wage and the tax needed to fund the unemployment insurance system when liquidity constraint binds exists and it is unique. the optimality of unemployment insurance based on the responsiveness of reservation wage to unemployment benefit shows the disincentive effect, i.e. higher unem...

this paper aims at describing the mechanism of german loanwords adaptation with respect to constraints of persian language and within ot framework. consequently the adaptation of consonant clusters and diphthongs as well as the phonemes substituted in loanwords will be examined. prince and smolensky’s (1993) optimality theory with its key notions of faithfulness and markedness constraints is su...

inventory control problem is one of the problems in decision making and management that contains non-crisp parameters in real world. economic production quantity (epq) model in fuzzy environment has been studied so far by many researchers. one of the main assumptions in all previous researches was neglecting the inventory shortage. in this research, a new multi-item epq model with fuzzy random ...

the trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. a common way to create trajectories is to deal with polynomials which have independent coefficients. this paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...

Abstract The AllDifferent constraint is a fundamental tool in Constraint Programming. It naturally arises many problems, from puzzles to scheduling and routing applications. Such popularity has prompted an extensive literature on filtering propagation for this constraint. This paper investigates the use of General Processing Units (GPUs) accelerate propagation. In particular, presents efficient...

nonlinear knapsack problems (nkp) are the alternative formulation for the multiple-choice knapsack problems. a powerful approach for solving nkp is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

Recently constraint satisfaction has been embedded in various high-level declarative programming environments, like the Constraint Logic Programming framework, and even more recently such environments have been extended with concurrency, like in the Concurrent Constraint Programming paradigm. The merging of diierent areas of research is always an exciting event, and proliic of new ideas. We bel...

this paper presents a new bi-objective mathematical model for a permutation flowshop scheduling problem with availability constraint in case of preventive maintenance operations on machines. in this paper, preventive maintenance is flexible and there is not a certain time for the maintenance operation; however, time between two consecutive maintenance operations for each machine should not be g...