background: job satisfaction is an emotional and positive feeling which results from job assessment or experiences. it is always considered as a problem in some organizations. despite the important role of nutrition therapy in patients care, dietitians’ job satisfaction is less taken into account. the aim of the present study was to determine the amount of job satisfaction among dietitians in f...

introduction: satisfaction of the students as educational institutions’ customers plays a major role in the performance and activities of the university. the aim of this study was to evaluate the degree of satisfaction of pharmacy students and their educational status in kermanshah university of medical sciences in the year 2014. methods: 48 pharmacy students at 9th to 11th semesters participat...

employees’ satisfaction based on their physical environment is an important factor that can improve employees’ performance, job satisfaction, and organizational productivity in office buildings. occupants’ environmental satisfaction are related to 10 different characteristics, including thermal comfort, air quality, lighting, acoustic quality, office layout, workspace furnishing, cleanliness an...

Building on a result of Larose and Tesson for constraint satisfaction problems (CSPs), we uncover a dichotomy for the quantified constraint satisfaction problem QCSP(B), where B is a finite structure that is a core. Specifically, such problems are either in ALogtime or are L-hard. This involves demonstrating that if CSP(B) is first-order expressible, and B is a core, then QCSP(B) is in ALogtime...

This paper describes a model for temporal reasoning that handles both quantitative and qualitative information affected by vagueness and uncertainty. Starting from two existing models, namely the Meiri’s system [9] and IA fuz [2, 3], the proposed approach generalizes the first to a fuzzy framework and extends the second in order to handle qualitative constraints. The system uses the Fuzzy Const...

For a large number of random Boolean constraint satisfaction problems, such as random k-SAT, we study how the number of locally maximal solutions evolves when constraints are added. We give the exponential order of the expected number of these distinguished solutions and prove it depends on the sensitivity of the allowed constraint functions only. As a by-product we provide a general tool for c...

A distributed MPC approach for linear uncertain systems sharing convex constraints is presented. The systems, which are dynamically decoupled but share constraints on state and/or inputs, optimize once, in parallel, at each time step and exchange plans with neighbours thereafter. Coupled constraint satisfaction is guaranteed, despite the simultaneous decision making, by extra constraint tighten...

Bang-Jensen and Hell conjectured in 1990 (using the language of graph homomorphisms) a CSP dichotomy for digraphs with no sources or sinks. The conjecture states that the constraint satisfaction problem for such a digraph is tractable if each component of its core is a circle and is NP-complete otherwise. In this paper we prove this conjecture, and, as a consequence, a conjecture of Bang-Jensen...

Constraint programming is the study of system which is based on constraints. The solution of a constraint satisfaction problem is a set of variable value assignments, which satisfies all members of the set of constraints in the CSP. In this paper the application of constraint satisfaction programming is used in predicting the path loss of various indoor propagation models using chronological ba...

The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of service composition have been recently made. We present an approach, based on modelling the problem as a CSP (Constraint Satisfaction Problem), that accommodates for the use of numeric variables, sensing and incomplete ...