Entropy landscape and non-Gibbs solutions in constraint satisfaction problems

International Nuclear Information System (INIS)

Dall'Asta, L.; Ramezanpour, A.; Zecchina, R.

2008-05-01

We study the entropy landscape of solutions for the bicoloring problem in random graphs, a representative difficult constraint satisfaction problem. Our goal is to classify which type of clusters of solutions are addressed by different algorithms. In the first part of the study we use the cavity method to obtain the number of clusters with a given internal entropy and determine the phase diagram of the problem, e.g. dynamical, rigidity and SAT-UNSAT transitions. In the second part of the paper we analyze different algorithms and locate their behavior in the entropy landscape of the problem. For instance we show that a smoothed version of a decimation strategy based on Belief Propagation is able to find solutions belonging to sub-dominant clusters even beyond the so called rigidity transition where the thermodynamically relevant clusters become frozen. These non-equilibrium solutions belong to the most probable unfrozen clusters. (author)

A message-passing approach to random constraint satisfaction problems with growing domains

International Nuclear Information System (INIS)

Zhao, Chunyan; Zheng, Zhiming; Zhou, Haijun; Xu, Ke

2011-01-01

Message-passing algorithms based on belief propagation (BP) are implemented on a random constraint satisfaction problem (CSP) referred to as model RB, which is a prototype of hard random CSPs with growing domain size. In model RB, the number of candidate discrete values (the domain size) of each variable increases polynomially with the variable number N of the problem formula. Although the satisfiability threshold of model RB is exactly known, finding solutions for a single problem formula is quite challenging and attempts have been limited to cases of N ∼ 10 2 . In this paper, we propose two different kinds of message-passing algorithms guided by BP for this problem. Numerical simulations demonstrate that these algorithms allow us to find a solution for random formulas of model RB with constraint tightness slightly less than p cr , the threshold value for the satisfiability phase transition. To evaluate the performance of these algorithms, we also provide a local search algorithm (random walk) as a comparison. Besides this, the simulated time dependence of the problem size N and the entropy of the variables for growing domain size are discussed

Generalizing Backtrack-Free Search: A Framework for Search-Free Constraint Satisfaction

Science.gov (United States)

Jonsson, Ari K.; Frank, Jeremy

2000-01-01

Tractable classes of constraint satisfaction problems are of great importance in artificial intelligence. Identifying and taking advantage of such classes can significantly speed up constraint problem solving. In addition, tractable classes are utilized in applications where strict worst-case performance guarantees are required, such as constraint-based plan execution. In this work, we present a formal framework for search-free (backtrack-free) constraint satisfaction. The framework is based on general procedures, rather than specific propagation techniques, and thus generalizes existing techniques in this area. We also relate search-free problem solving to the notion of decision sets and use the result to provide a constructive criterion that is sufficient to guarantee search-free problem solving.

Asymmetric continuous-time neural networks without local traps for solving constraint satisfaction problems.

Directory of Open Access Journals (Sweden)

Botond Molnár

Full Text Available There has been a long history of using neural networks for combinatorial optimization and constraint satisfaction problems. Symmetric Hopfield networks and similar approaches use steepest descent dynamics, and they always converge to the closest local minimum of the energy landscape. For finding global minima additional parameter-sensitive techniques are used, such as classical simulated annealing or the so-called chaotic simulated annealing, which induces chaotic dynamics by addition of extra terms to the energy landscape. Here we show that asymmetric continuous-time neural networks can solve constraint satisfaction problems without getting trapped in non-solution attractors. We concentrate on a model solving Boolean satisfiability (k-SAT, which is a quintessential NP-complete problem. There is a one-to-one correspondence between the stable fixed points of the neural network and the k-SAT solutions and we present numerical evidence that limit cycles may also be avoided by appropriately choosing the parameters of the model. This optimal parameter region is fairly independent of the size and hardness of instances, this way parameters can be chosen independently of the properties of problems and no tuning is required during the dynamical process. The model is similar to cellular neural networks already used in CNN computers. On an analog device solving a SAT problem would take a single operation: the connection weights are determined by the k-SAT instance and starting from any initial condition the system searches until finding a solution. In this new approach transient chaotic behavior appears as a natural consequence of optimization hardness and not as an externally induced effect.

Medical image segmentation by a constraint satisfaction neural network

International Nuclear Information System (INIS)

Chen, C.T.; Tsao, E.C.K.; Lin, W.C.

1991-01-01

This paper proposes a class of Constraint Satisfaction Neural Networks (CSNNs) for solving the problem of medical image segmentation which can be formulated as a Constraint Satisfaction Problem (CSP). A CSNN consists of a set of objects, a set of labels for each object, a collection of constraint relations linking the labels of neighboring objects, and a topological constraint describing the neighborhood relationship among various objects. Each label for a particular object indicates one possible interpretation for that object. The CSNN can be viewed as a collection of neurons that interconnect with each other. The connections and the topology of a CSNN are used to represent the constraints in a CSP. The mechanism of the neural network is to find a solution that satisfies all the constraints in order to achieve a global consistency. The final solution outlines segmented areas and simultaneously satisfies all the constraints. This technique has been applied to medical images and the results show that this CSNN method is a very promising approach for image segmentation

Medical image segmentation by means of constraint satisfaction neural network

International Nuclear Information System (INIS)

Chen, C.T.; Tsao, C.K.; Lin, W.C.

1990-01-01

This paper applies the concept of constraint satisfaction neural network (CSNN) to the problem of medical image segmentation. Constraint satisfaction (or constraint propagation), the procedure to achieve global consistency through local computation, is an important paradigm in artificial intelligence. CSNN can be viewed as a three-dimensional neural network, with the two-dimensional image matrix as its base, augmented by various constraint labels for each pixel. These constraint labels can be interpreted as the connections and the topology of the neural network. Through parallel and iterative processes, the CSNN will approach a solution that satisfies the given constraints thus providing segmented regions with global consistency

Cognitive Dissonance Reduction as Constraint Satisfaction.

Science.gov (United States)

Shultz, Thomas R.; Lepper, Mark R.

1996-01-01

It is argued that the reduction of cognitive dissonance can be viewed as a constraint satisfaction problem, and a computational model of the process of consonance seeking is proposed. Simulations from this model matched psychological findings from the insufficient justification and free-choice paradigms of cognitive dissonance theory. (SLD)

Solving Constraint Satisfaction Problems with Networks of Spiking Neurons.

Science.gov (United States)

Jonke, Zeno; Habenschuss, Stefan; Maass, Wolfgang

2016-01-01

Network of neurons in the brain apply-unlike processors in our current generation of computer hardware-an event-based processing strategy, where short pulses (spikes) are emitted sparsely by neurons to signal the occurrence of an event at a particular point in time. Such spike-based computations promise to be substantially more power-efficient than traditional clocked processing schemes. However, it turns out to be surprisingly difficult to design networks of spiking neurons that can solve difficult computational problems on the level of single spikes, rather than rates of spikes. We present here a new method for designing networks of spiking neurons via an energy function. Furthermore, we show how the energy function of a network of stochastically firing neurons can be shaped in a transparent manner by composing the networks of simple stereotypical network motifs. We show that this design approach enables networks of spiking neurons to produce approximate solutions to difficult (NP-hard) constraint satisfaction problems from the domains of planning/optimization and verification/logical inference. The resulting networks employ noise as a computational resource. Nevertheless, the timing of spikes plays an essential role in their computations. Furthermore, networks of spiking neurons carry out for the Traveling Salesman Problem a more efficient stochastic search for good solutions compared with stochastic artificial neural networks (Boltzmann machines) and Gibbs sampling.

Solving constraint satisfaction problems with networks of spiking neurons

Directory of Open Access Journals (Sweden)

Zeno eJonke

2016-03-01

Full Text Available Network of neurons in the brain apply – unlike processors in our current generation ofcomputer hardware – an event-based processing strategy, where short pulses (spikes areemitted sparsely by neurons to signal the occurrence of an event at a particular point intime. Such spike-based computations promise to be substantially more power-efficient thantraditional clocked processing schemes. However it turned out to be surprisingly difficult todesign networks of spiking neurons that can solve difficult computational problems on the levelof single spikes (rather than rates of spikes. We present here a new method for designingnetworks of spiking neurons via an energy function. Furthermore we show how the energyfunction of a network of stochastically firing neurons can be shaped in a quite transparentmanner by composing the networks of simple stereotypical network motifs. We show that thisdesign approach enables networks of spiking neurons to produce approximate solutions todifficult (NP-hard constraint satisfaction problems from the domains of planning/optimizationand verification/logical inference. The resulting networks employ noise as a computationalresource. Nevertheless the timing of spikes (rather than just spike rates plays an essential rolein their computations. Furthermore, networks of spiking neurons carry out for the Traveling Salesman Problem a more efficient stochastic search for good solutions compared with stochastic artificial neural networks (Boltzmann machines and Gibbs sampling.

Multi-Objective Constraint Satisfaction for Mobile Robot Area Defense

Science.gov (United States)

2010-03-01

David A. Van Veldhuizen . Evo- lutionary Algorithms for Solving Multi-Objective Problems. Springer, New York, NY, 2nd edition, 2007. [9] Dean, Thomas...J.I. van Hemert, E. Marchiori, and A. G. Steenbeek. “Solving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive

The dose-volume constraint satisfaction problem for inverse treatment planning with field segments

International Nuclear Information System (INIS)

Michalski, Darek; Xiao, Ying; Censor, Yair; Galvin, James M

2004-01-01

The prescribed goals of radiation treatment planning are often expressed in terms of dose-volume constraints. We present a novel formulation of a dose-volume constraint satisfaction search for the discretized radiation therapy model. This approach does not rely on any explicit cost function. Inverse treatment planning uses the aperture-based approach with predefined, according to geometric rules, segmental fields. The solver utilizes the simultaneous version of the cyclic subgradient projection algorithm. This is a deterministic iterative method designed for solving the convex feasibility problems. A prescription is expressed with the set of inequalities imposed on the dose at the voxel resolution. Additional constraint functions control the compliance with selected points of the expected cumulative dose-volume histograms. The performance of this method is tested on prostate and head-and-neck cases. The relationships with other models and algorithms of similar conceptual origin are discussed. The demonstrated advantages of the method are: the equivalence of the algorithmic and prescription parameters, the intuitive setup of free parameters, and the improved speed of the method as compared to similar iterative as well as other techniques. The technique reported here will deliver approximate solutions for inconsistent prescriptions

Local entropy as a measure for sampling solutions in constraint satisfaction problems

International Nuclear Information System (INIS)

Baldassi, Carlo; Ingrosso, Alessandro; Lucibello, Carlo; Saglietti, Luca; Zecchina, Riccardo

2016-01-01

We introduce a novel entropy-driven Monte Carlo (EdMC) strategy to efficiently sample solutions of random constraint satisfaction problems (CSPs). First, we extend a recent result that, using a large-deviation analysis, shows that the geometry of the space of solutions of the binary perceptron learning problem (a prototypical CSP), contains regions of very high-density of solutions. Despite being sub-dominant, these regions can be found by optimizing a local entropy measure. Building on these results, we construct a fast solver that relies exclusively on a local entropy estimate, and can be applied to general CSPs. We describe its performance not only for the perceptron learning problem but also for the random K-satisfiabilty problem (another prototypical CSP with a radically different structure), and show numerically that a simple zero-temperature Metropolis search in the smooth local entropy landscape can reach sub-dominant clusters of optimal solutions in a small number of steps, while standard Simulated Annealing either requires extremely long cooling procedures or just fails. We also discuss how the EdMC can heuristically be made even more efficient for the cases we studied. (paper: disordered systems, classical and quantum)

Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems

Directory of Open Access Journals (Sweden)

Gabriel A. Fonseca Guerra

2017-12-01

Full Text Available Constraint satisfaction problems (CSP are at the core of numerous scientific and technological applications. However, CSPs belong to the NP-complete complexity class, for which the existence (or not of efficient algorithms remains a major unsolved question in computational complexity theory. In the face of this fundamental difficulty heuristics and approximation methods are used to approach instances of NP (e.g., decision and hard optimization problems. The human brain efficiently handles CSPs both in perception and behavior using spiking neural networks (SNNs, and recent studies have demonstrated that the noise embedded within an SNN can be used as a computational resource to solve CSPs. Here, we provide a software framework for the implementation of such noisy neural solvers on the SpiNNaker massively parallel neuromorphic hardware, further demonstrating their potential to implement a stochastic search that solves instances of P and NP problems expressed as CSPs. This facilitates the exploration of new optimization strategies and the understanding of the computational abilities of SNNs. We demonstrate the basic principles of the framework by solving difficult instances of the Sudoku puzzle and of the map color problem, and explore its application to spin glasses. The solver works as a stochastic dynamical system, which is attracted by the configuration that solves the CSP. The noise allows an optimal exploration of the space of configurations, looking for the satisfiability of all the constraints; if applied discontinuously, it can also force the system to leap to a new random configuration effectively causing a restart.

Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems.

Science.gov (United States)

Fonseca Guerra, Gabriel A; Furber, Steve B

2017-01-01

Constraint satisfaction problems (CSP) are at the core of numerous scientific and technological applications. However, CSPs belong to the NP-complete complexity class, for which the existence (or not) of efficient algorithms remains a major unsolved question in computational complexity theory. In the face of this fundamental difficulty heuristics and approximation methods are used to approach instances of NP (e.g., decision and hard optimization problems). The human brain efficiently handles CSPs both in perception and behavior using spiking neural networks (SNNs), and recent studies have demonstrated that the noise embedded within an SNN can be used as a computational resource to solve CSPs. Here, we provide a software framework for the implementation of such noisy neural solvers on the SpiNNaker massively parallel neuromorphic hardware, further demonstrating their potential to implement a stochastic search that solves instances of P and NP problems expressed as CSPs. This facilitates the exploration of new optimization strategies and the understanding of the computational abilities of SNNs. We demonstrate the basic principles of the framework by solving difficult instances of the Sudoku puzzle and of the map color problem, and explore its application to spin glasses. The solver works as a stochastic dynamical system, which is attracted by the configuration that solves the CSP. The noise allows an optimal exploration of the space of configurations, looking for the satisfiability of all the constraints; if applied discontinuously, it can also force the system to leap to a new random configuration effectively causing a restart.

A Selfish Constraint Satisfaction Genetic Algorithms for Planning a Long-Distance Transportation Network

Science.gov (United States)

Onoyama, Takashi; Maekawa, Takuya; Kubota, Sen; Tsuruta, Setuso; Komoda, Norihisa

To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints are imposed on this type of problem. To solve these strict-constraint problems, a selfish constraint satisfaction genetic algorithm (GA) is proposed. In this GA, each gene of an individual satisfies only its constraint selfishly, disregarding the constraints of other genes in the same individuals. Moreover, a constraint pre-checking method is also applied to improve the GA convergence speed. The experimental result shows the proposed method can obtain an accurate solution in a practical response time.

Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.

Science.gov (United States)

Yang, S; Wang, D

2000-01-01

This paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems. The proposed neural network can be easily constructed and can adaptively adjust its weights of connections and biases of units based on the sequence and resource constraints of the job-shop scheduling problem during its processing. Several heuristics that can be combined with the neural network are also presented. In the combined approaches, the neural network is used to obtain feasible solutions, the heuristic algorithms are used to improve the performance of the neural network and the quality of the obtained solutions. Simulations have shown that the proposed neural network and its combined approaches are efficient with respect to the quality of solutions and the solving speed.

Constraint-based solver for the Military unit path finding problem

CSIR Research Space (South Africa)

Leenen, L

2010-04-01

Full Text Available -based approach because it requires flexibility in modelling. The authors formulate the MUPFP as a constraint satisfaction problem and a constraint-based extension of the search algorithm. The concept demonstrator uses a provided map, for example taken from Google...

From near to eternity: Spin-glass planting, tiling puzzles, and constraint-satisfaction problems

Science.gov (United States)

Hamze, Firas; Jacob, Darryl C.; Ochoa, Andrew J.; Perera, Dilina; Wang, Wenlong; Katzgraber, Helmut G.

2018-04-01

We present a methodology for generating Ising Hamiltonians of tunable complexity and with a priori known ground states based on a decomposition of the model graph into edge-disjoint subgraphs. The idea is illustrated with a spin-glass model defined on a cubic lattice, where subproblems, whose couplers are restricted to the two values {-1 ,+1 } , are specified on unit cubes and are parametrized by their local degeneracy. The construction is shown to be equivalent to a type of three-dimensional constraint-satisfaction problem known as the tiling puzzle. By varying the proportions of subproblem types, the Hamiltonian can span a dramatic range of typical computational complexity, from fairly easy to many orders of magnitude more difficult than prototypical bimodal and Gaussian spin glasses in three space dimensions. We corroborate this behavior via experiments with different algorithms and discuss generalizations and extensions to different types of graphs.

Nonlinear Model Predictive Control with Constraint Satisfactions for a Quadcopter

Science.gov (United States)

Wang, Ye; Ramirez-Jaime, Andres; Xu, Feng; Puig, Vicenç

2017-01-01

This paper presents a nonlinear model predictive control (NMPC) strategy combined with constraint satisfactions for a quadcopter. The full dynamics of the quadcopter describing the attitude and position are nonlinear, which are quite sensitive to changes of inputs and disturbances. By means of constraint satisfactions, partial nonlinearities and modeling errors of the control-oriented model of full dynamics can be transformed into the inequality constraints. Subsequently, the quadcopter can be controlled by an NMPC controller with the updated constraints generated by constraint satisfactions. Finally, the simulation results applied to a quadcopter simulator are provided to show the effectiveness of the proposed strategy.

Logic-based methods for optimization combining optimization and constraint satisfaction

CERN Document Server

Hooker, John

2011-01-01

A pioneering look at the fundamental role of logic in optimization and constraint satisfaction While recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible

Learning and Parallelization Boost Constraint Search

Science.gov (United States)

Yun, Xi

2013-01-01

Constraint satisfaction problems are a powerful way to abstract and represent academic and real-world problems from both artificial intelligence and operations research. A constraint satisfaction problem is typically addressed by a sequential constraint solver running on a single processor. Rather than construct a new, parallel solver, this work…

Constraint-based scheduling applying constraint programming to scheduling problems

CERN Document Server

Baptiste, Philippe; Nuijten, Wim

2001-01-01

Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...

Distributed constraint satisfaction for coordinating and integrating a large-scale, heterogenous enterprise

CERN Document Server

Eisenberg, C

2003-01-01

Market forces are continuously driving public and private organisations towards higher productivity, shorter process and production times, and fewer labour hours. To cope with these changes, organisations are adopting new organisational models of coordination and cooperation that increase their flexibility, consistency, efficiency, productivity and profit margins. In this thesis an organisational model of coordination and cooperation is examined using a real life example; the technical integration of a distributed large-scale project of an international physics collaboration. The distributed resource constraint project scheduling problem is modelled and solved with the methods of distributed constraint satisfaction. A distributed local search method, the distributed breakout algorithm (DisBO), is used as the basis for the coordination scheme. The efficiency of the local search method is improved by extending it with an incremental problem solving scheme with variable ordering. The scheme is implemented as cen...

Connectionism, parallel constraint satisfaction processes, and gestalt principles: (re) introducing cognitive dynamics to social psychology.

Science.gov (United States)

Read, S J; Vanman, E J; Miller, L C

1997-01-01

We argue that recent work in connectionist modeling, in particular the parallel constraint satisfaction processes that are central to many of these models, has great importance for understanding issues of both historical and current concern for social psychologists. We first provide a brief description of connectionist modeling, with particular emphasis on parallel constraint satisfaction processes. Second, we examine the tremendous similarities between parallel constraint satisfaction processes and the Gestalt principles that were the foundation for much of modem social psychology. We propose that parallel constraint satisfaction processes provide a computational implementation of the principles of Gestalt psychology that were central to the work of such seminal social psychologists as Asch, Festinger, Heider, and Lewin. Third, we then describe how parallel constraint satisfaction processes have been applied to three areas that were key to the beginnings of modern social psychology and remain central today: impression formation and causal reasoning, cognitive consistency (balance and cognitive dissonance), and goal-directed behavior. We conclude by discussing implications of parallel constraint satisfaction principles for a number of broader issues in social psychology, such as the dynamics of social thought and the integration of social information within the narrow time frame of social interaction.

Constraint Programming Approach to the Problem of Generating Milton Babbitt's All-partition Arrays

DEFF Research Database (Denmark)

Tanaka, Tsubasa; Bemman, Brian; Meredith, David

2016-01-01

elements and corresponding to a distinct integer partition of 12. Constraint programming (CP) is a tool for solving such combinatorial and constraint satisfaction problems. In this paper, we use CP for the first time to formalize this problem in generating an all-partition array. Solving the whole...... of this problem is difficult and few known solutions exist. Therefore, we propose solving two sub-problems and joining these to form a complete solution. We conclude by presenting a solution found using this method. Our solution is the first we are aware of to be discovered automatically using a computer......Milton Babbitt (1916–2011) was a composer of twelve-tone serial music noted for creating the all-partition array. One part of the problem in generating an all-partition array requires finding a covering of a pitch-class matrix by a collection of sets, each forming a region containing 12 distinct...

Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions.

Science.gov (United States)

Wijesinghe, Parami; Liyanagedera, Chamika; Roy, Kaushik

2018-05-02

Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic Tunnel Junctions (MTJs). The inherent physics of MTJs, enhanced by device level modifications, is harnessed here to emulate the intricate dynamics of an analog satisfiability (SAT) solver. In the presence of thermal noise, the MTJ based system can successfully solve Boolean satisfiability problems. Most importantly, our results exhibit that, the proposed MTJ based hardware SAT solver is capable of finding a solution to a significant fraction (at least 85%) of hard 3-SAT problems, within a time that has a polynomial relationship with the number of variables(<50).

Principals' Self-Efficacy: Relations with Job Autonomy, Job Satisfaction, and Contextual Constraints

Science.gov (United States)

Federici, Roger A.

2013-01-01

The purpose of the present study was to explore relations between principals' self-efficacy, perceived job autonomy, job satisfaction, and perceived contextual constraints to autonomy. Principal self-efficacy was measured by a multidimensional scale called the Norwegian Principal Self-Efficacy Scale. Job autonomy, job satisfaction, and contextual…

Fuzzy Constraint-Based Agent Negotiation

Institute of Scientific and Technical Information of China (English)

Menq-Wen Lin; K. Robert Lai; Ting-Jung Yu

2005-01-01

Conflicts between two or more parties arise for various reasons and perspectives. Thus, resolution of conflicts frequently relies on some form of negotiation. This paper presents a general problem-solving framework for modeling multi-issue multilateral negotiation using fuzzy constraints. Agent negotiation is formulated as a distributed fuzzy constraint satisfaction problem (DFCSP). Fuzzy constrains are thus used to naturally represent each agent's desires involving imprecision and human conceptualization, particularly when lexical imprecision and subjective matters are concerned. On the other hand, based on fuzzy constraint-based problem-solving, our approach enables an agent not only to systematically relax fuzzy constraints to generate a proposal, but also to employ fuzzy similarity to select the alternative that is subject to its acceptability by the opponents. This task of problem-solving is to reach an agreement that benefits all agents with a high satisfaction degree of fuzzy constraints, and move towards the deal more quickly since their search focuses only on the feasible solution space. An application to multilateral negotiation of a travel planning is provided to demonstrate the usefulness and effectiveness of our framework.

Ant colony optimization and constraint programming

CERN Document Server

Solnon, Christine

2013-01-01

Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search

Optimizing Concurrent M3-Transactions: A Fuzzy Constraint Satisfaction Approach

Directory of Open Access Journals (Sweden)

Peng LI

2004-10-01

Full Text Available Due to the high connectivity and great convenience, many E-commerce application systems have a high transaction volume. Consequently, the system state changes rapidly and it is likely that customers issue transactions based on out-of-date state information. Thus, the potential of transaction abortion increases greatly. To address this problem, we proposed an M3-transaction model. An M3-transaction is a generalized transaction where users can issue their preferences in a request by specifying multiple criteria and optional data resources simultaneously within one transaction. In this paper, we introduce the transaction grouping and group evaluation techniques. We consider evaluating a group of M3-transactions arrived to the system within a short duration together. The system makes optimal decisions in allocating data to transactions to achieve better customer satisfaction and lower transaction failure rate. We apply the fuzzy constraint satisfaction approach for decision-making. We also conduct experimental studies to evaluate the performance of our approach. The results show that the M3-transaction with group evaluation is more resilient to failure and yields much better performance than the traditional transaction model.

[Problem-solving strategies and marital satisfaction].

Science.gov (United States)

Kriegelewicz, Olga

2006-01-01

This study investigated the relation between problem-solving strategies in the marital conflict and marital satisfaction. Four problem-solving strategies (Dialogue, Loyalty, Escalation of conflict and Withdrawal) were measured by the Problem-Solving Strategies Inventory, in two versions: self-report and report of partners' perceived behaviour. This measure refers to the concept of Rusbult, Johnson and Morrow, and meets high standards of reliability (alpha Cronbach from alpha = 0.78 to alpha = 0.94) and validity. Marital satisfaction was measured by Marriage Success Scale. The sample was composed of 147 marital couples. The study revealed that satisfied couples, in comparison with non-satisfied couples, tend to use constructive problem-solving strategies (Dialogue and Loyalty). They rarely use destructive strategies like Escalation of conflict or Withdrawal. Dialogue is the strategy connected with satisfaction in a most positive manner. These might be very important guidelines to couples' psychotherapy. Loyalty to oneself is a significant positive predictor of male satisfaction is also own Loyalty. The study shows that constructive attitudes are the most significant predictors of marriage satisfaction. It is therefore worth concentrating mostly on them in the psychotherapeutic process instead of eliminating destructive attitudes.

Bidirectional Associations Between Newlyweds' Marital Satisfaction and Marital Problems over Time.

Science.gov (United States)

Lavner, Justin A; Karney, Benjamin R; Williamson, Hannah C; Bradbury, Thomas N

2017-12-01

Prevailing views of marital functioning generally adopt the view that marital problems predict decreases in marital satisfaction, but alternative theoretical perspectives raise the possibility that lowered satisfaction can also predict increases in problems. The current study sought to integrate and compare these perspectives by examining the bidirectional cross-lagged associations between newlyweds' reports of their marital satisfaction and marital problems over the first 4 years of marriage. Using annual assessments from 483 heterosexual newlywed couples, we find evidence for problem-to-satisfaction linkages as well as satisfaction-to-problem linkages. Satisfaction was a stronger predictor of marital problems early in marriage but not as time passed; by Year 4 only problem-to-satisfaction linkages remained significant. These findings are consistent with the idea that couples with more problems go on to report lower levels of satisfaction and couples with lower levels of satisfaction go on to report more marital problems. This dynamic interplay between global judgments about relationship satisfaction and ongoing specific relationship difficulties highlights the value of examining bidirectional effects to better understand marital functioning over time. © 2016 Family Process Institute.

Life satisfaction and mental health problems (18 to 35 years).

Science.gov (United States)

Fergusson, D M; McLeod, G F H; Horwood, L J; Swain, N R; Chapple, S; Poulton, R

2015-08-01

Previous research has found that mental health is strongly associated with life satisfaction. In this study we examine associations between mental health problems and life satisfaction in a birth cohort studied from 18 to 35 years. Data were gathered during the Christchurch Health and Development Study, which is a longitudinal study of a birth cohort of 1265 children, born in Christchurch, New Zealand, in 1977. Assessments of psychiatric disorder (major depression, anxiety disorder, suicidality, alcohol dependence and illicit substance dependence) using DSM diagnostic criteria and life satisfaction were obtained at 18, 21, 25, 30 and 35 years. Significant associations (p life satisfaction and the psychiatric disorders major depression, anxiety disorder, suicidality, alcohol dependence and substance dependence. After adjustment for non-observed sources of confounding by fixed effects, statistically significant associations (p life satisfaction and major depression, anxiety disorder, suicidality and substance dependence. Overall, those reporting three or more mental health disorders had mean life satisfaction scores that were nearly 0.60 standard deviations below those without mental health problems. A structural equation model examined the direction of causation between life satisfaction and mental health problems. Statistically significant (p life satisfaction and mental health problems. After adjustment for confounding, robust and reciprocal associations were found between mental health problems and life satisfaction. Overall, this study showed evidence that life satisfaction influences mental disorder, and that mental disorder influences life satisfaction.

Localization of a Vehicle: A Dynamic Interval Constraint Satisfaction Problem-Based Approach

Directory of Open Access Journals (Sweden)

Kangni Kueviakoe

2018-01-01

Full Text Available This paper introduces a new interval constraint propagation (ICP approach dealing with the real-time vehicle localization problem. Bayesian methods like extended Kalman filter (EKF are classically used to achieve vehicle localization. ICP is an alternative which provides guaranteed localization results rather than probabilities. Our approach assumes that all models and measurement errors are bounded within known limits without any other hypotheses on the probability distribution. The proposed algorithm uses a low-level consistency algorithm and has been validated with an outdoor vehicle equipped with a GPS receiver, a gyro, and odometers. Results have been compared to EKF and other ICP methods such as hull consistency (HC4 and 3-bound (3B algorithms. Both consistencies of EKF and our algorithm have been experimentally studied.

What is adaptive about adaptive decision making? A parallel constraint satisfaction account.

Science.gov (United States)

Glöckner, Andreas; Hilbig, Benjamin E; Jekel, Marc

2014-12-01

There is broad consensus that human cognition is adaptive. However, the vital question of how exactly this adaptivity is achieved has remained largely open. Herein, we contrast two frameworks which account for adaptive decision making, namely broad and general single-mechanism accounts vs. multi-strategy accounts. We propose and fully specify a single-mechanism model for decision making based on parallel constraint satisfaction processes (PCS-DM) and contrast it theoretically and empirically against a multi-strategy account. To achieve sufficiently sensitive tests, we rely on a multiple-measure methodology including choice, reaction time, and confidence data as well as eye-tracking. Results show that manipulating the environmental structure produces clear adaptive shifts in choice patterns - as both frameworks would predict. However, results on the process level (reaction time, confidence), in information acquisition (eye-tracking), and from cross-predicting choice consistently corroborate single-mechanisms accounts in general, and the proposed parallel constraint satisfaction model for decision making in particular. Copyright © 2014 Elsevier B.V. All rights reserved.

Problems militating against job satisfaction among librarians in ...

African Journals Online (AJOL)

The research work examined the problems militating against job satisfaction among librarians in academic libraries in Niger State , Nigeria. The aim is to identify the problems associated with job satisfaction among librarians in academic libraries in Niger State. the population of the study was 58 librarians in Niger State.

L∞ Variational Problems with Running Costs and Constraints

International Nuclear Information System (INIS)

Aronsson, G.; Barron, E. N.

2012-01-01

Various approaches are used to derive the Aronsson–Euler equations for L ∞ calculus of variations problems with constraints. The problems considered involve holonomic, nonholonomic, isoperimetric, and isosupremic constraints on the minimizer. In addition, we derive the Aronsson–Euler equation for the basic L ∞ problem with a running cost and then consider properties of an absolute minimizer. Many open problems are introduced for further study.

The constraints satisfaction problem approach in the design of an architectural functional layout

Science.gov (United States)

Zawidzki, Machi; Tateyama, Kazuyoshi; Nishikawa, Ikuko

2011-09-01

A design support system with a new strategy for finding the optimal functional configurations of rooms for architectural layouts is presented. A set of configurations satisfying given constraints is generated and ranked according to multiple objectives. The method can be applied to problems in architectural practice, urban or graphic design-wherever allocation of related geometrical elements of known shape is optimized. Although the methodology is shown using simplified examples-a single story residential building with two apartments each having two rooms-the results resemble realistic functional layouts. One example of a practical size problem of a layout of three apartments with a total of 20 rooms is demonstrated, where the generated solution can be used as a base for a realistic architectural blueprint. The discretization of design space is discussed, followed by application of a backtrack search algorithm used for generating a set of potentially 'good' room configurations. Next the solutions are classified by a machine learning method (FFN) as 'proper' or 'improper' according to the internal communication criteria. Examples of interactive ranking of the 'proper' configurations according to multiple criteria and choosing 'the best' ones are presented. The proposed framework is general and universal-the criteria, parameters and weights can be individually defined by a user and the search algorithm can be adjusted to a specific problem.

Solving Large-Scale Computational Problems Using Insights from Statistical Physics

Energy Technology Data Exchange (ETDEWEB)

Selman, Bart [Cornell University

2012-02-29

Many challenging problems in computer science and related fields can be formulated as constraint satisfaction problems. Such problems consist of a set of discrete variables and a set of constraints between those variables, and represent a general class of so-called NP-complete problems. The goal is to find a value assignment to the variables that satisfies all constraints, generally requiring a search through and exponentially large space of variable-value assignments. Models for disordered systems, as studied in statistical physics, can provide important new insights into the nature of constraint satisfaction problems. Recently, work in this area has resulted in the discovery of a new method for solving such problems, called the survey propagation (SP) method. With SP, we can solve problems with millions of variables and constraints, an improvement of two orders of magnitude over previous methods.

About some types of constraints in problems of routing

Science.gov (United States)

Petunin, A. A.; Polishuk, E. G.; Chentsov, A. G.; Chentsov, P. A.; Ukolov, S. S.

2016-12-01

Many routing problems arising in different applications can be interpreted as a discrete optimization problem with additional constraints. The latter include generalized travelling salesman problem (GTSP), to which task of tool routing for CNC thermal cutting machines is sometimes reduced. Technological requirements bound to thermal fields distribution during cutting process are of great importance when developing algorithms for this task solution. These requirements give rise to some specific constraints for GTSP. This paper provides a mathematical formulation for the problem of thermal fields calculating during metal sheet thermal cutting. Corresponding algorithm with its programmatic implementation is considered. The mathematical model allowing taking such constraints into account considering other routing problems is discussed either.

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

Science.gov (United States)

Chien, S.; Gratch, J.

1994-01-01

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

Iterative Schemes for Convex Minimization Problems with Constraints

Directory of Open Access Journals (Sweden)

Lu-Chuan Ceng

2014-01-01

Full Text Available We first introduce and analyze one implicit iterative algorithm for finding a solution of the minimization problem for a convex and continuously Fréchet differentiable functional, with constraints of several problems: the generalized mixed equilibrium problem, the system of generalized equilibrium problems, and finitely many variational inclusions in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another implicit iterative algorithm for finding a fixed point of infinitely many nonexpansive mappings with the same constraints, and derive its strong convergence under mild assumptions.

All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables

DEFF Research Database (Denmark)

Gutin, Gregory; Van Iersel, Leo; Mnich, Matthias

2010-01-01

A ternary Permutation-CSP is specified by a subset Π of the symmetric group S3. An instance of such a problem consists of a set of variables V and a multiset of constraints, which are ordered triples of distinct variables of V. The objective is to find a linear ordering α of V that maximizes...... the number of triples whose rearrangement (under α) follows a permutation in Π. We prove that all ternary Permutation-CSPs parameterized above average have kernels with quadratic numbers of variables....

Stochastic programming problems with generalized integrated chance constraints

Czech Academy of Sciences Publication Activity Database

Branda, Martin

2012-01-01

Roč. 61, č. 8 (2012), s. 949-968 ISSN 0233-1934 R&D Projects: GA ČR GAP402/10/1610 Grant - others:SVV(CZ) 261315/2010 Institutional support: RVO:67985556 Keywords : chance constraints * integrated chance constraints * penalty functions * sample approximations * blending problem Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.707, year: 2012 http://library.utia.cas.cz/separaty/2012/E/branda-stochastic programming problems with generalized integrated.pdf

Multi-dimensional Bin Packing Problems with Guillotine Constraints

DEFF Research Database (Denmark)

Amossen, Rasmus Resen; Pisinger, David

2010-01-01

The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while satisfying the requirement that the packing should be guillotine cuttable. That is, there should exist a series of face...... parallel straight cuts that can recursively cut the bin into pieces so that each piece contains a box and no box has been intersected by a cut. The unrestricted problem is known to be NP-hard. In this paper we present a generalization of a constructive algorithm for the multi-dimensional bin packing...... problem, with and without the guillotine constraint, based on constraint programming....

Research on engineering-oriented constraints conflict detection in collaborative design of wire harness technology

Institute of Scientific and Technical Information of China (English)

LIU Xiaoping; HE Honglin; XU Benzhu

2012-01-01

Engineering-oriented constraint of harness technology has much information and project information presents progressive changes along with the design. Therefore, how to handle conflict resolution quickly is a problem to be solved. Process model of con- flict detection is put forward according to characteristics of harness technology design engineering-oriented constraint, and then two problems of how to conduct conflict positioning and judgment of constraint rules are introduced in this paper. Afterwards in this pa- per, constraint information directed acyclic graph is established by classified project constraint information to solve the conflict posi- tioning problem; solution of constraint satisfaction problem is applied to realize judgment problem of constraint rules. Finally, exam- ple is used to analyze the method in this paper to further verify the correctness and effectiveness of this method.

Sexual Distress and Sexual Problems During Pregnancy: Associations With Sexual and Relationship Satisfaction.

Science.gov (United States)

Vannier, Sarah A; Rosen, Natalie O

2017-03-01

Sexual problems are common during pregnancy, but the proportion of pregnant women who experience sexual distress is unknown. In non-pregnant samples, sexual distress is associated with lower sexual and relationship satisfaction. To identify the proportion of women experiencing sexual distress during pregnancy and to compare the sexual and relationship satisfaction of women who report sexual distress during pregnancy with that of women without distress. Two-hundred sixty-one pregnant women completed a cross-sectional online survey. Women completed validated measurements of sexual functioning (Female Sexual Function Index; score sexual problem), sexual distress (Female Sexual Distress Scale; score ≥ 15 indicates clinically significant distress), sexual satisfaction (Global Measure of Sexual Satisfaction), and relationship satisfaction (Couples Satisfaction Index). Overall, 42% of women met the clinical cutoff for sexual distress. Of sexually active women (n = 230), 26% reported concurrent sexual problems and distress and 14% reported sexual distress in the absence of sexual problems. Sexual distress and/or problems in sexual functioning were linked to lower sexual and relationship satisfaction compared with pregnant women with lower sexual distress and fewer sexual problems. Sexual distress is common during pregnancy and associated with lower sexual and relationship satisfaction. Health care providers should ask pregnant women about feelings of sexual distress. Identifying pregnant women who experience sexual distress and referring them to appropriate resources could help minimize sexual and relationship problems during pregnancy. Vannier SA, Rosen NO. Sexual Distress and Sexual Problems During Pregnancy: Associations With Sexual and Relationship Satisfaction. J Sex Med 2017;14:387-395. Copyright © 2017 International Society for Sexual Medicine. Published by Elsevier Inc. All rights reserved.

L{sup {infinity}} Variational Problems with Running Costs and Constraints

Energy Technology Data Exchange (ETDEWEB)

Aronsson, G., E-mail: gunnar.aronsson@liu.se [Linkoeping University, Department of Mathematics (Sweden); Barron, E. N., E-mail: enbarron@math.luc.edu [Loyola University of Chicago, Department of Mathematics and Statistics (United States)

2012-02-15

Various approaches are used to derive the Aronsson-Euler equations for L{sup {infinity}} calculus of variations problems with constraints. The problems considered involve holonomic, nonholonomic, isoperimetric, and isosupremic constraints on the minimizer. In addition, we derive the Aronsson-Euler equation for the basic L{sup {infinity}} problem with a running cost and then consider properties of an absolute minimizer. Many open problems are introduced for further study.

Constraint-Based Local Search for Constrained Optimum Paths Problems

Science.gov (United States)

Pham, Quang Dung; Deville, Yves; van Hentenryck, Pascal

Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algorithms, which are often hard to extend with side constraints and to apply widely. This paper proposes a constraint-based local search (CBLS) framework for COP applications, bringing the compositionality, reuse, and extensibility at the core of CBLS and CP systems. The modeling contribution is the ability to express compositional models for various COP applications at a high level of abstraction, while cleanly separating the model and the search procedure. The main technical contribution is a connected neighborhood based on rooted spanning trees to find high-quality solutions to COP problems. The framework, implemented in COMET, is applied to Resource Constrained Shortest Path (RCSP) problems (with and without side constraints) and to the edge-disjoint paths problem (EDP). Computational results show the potential significance of the approach.

Least Squares Problems with Absolute Quadratic Constraints

Directory of Open Access Journals (Sweden)

R. Schöne

2012-01-01

Full Text Available This paper analyzes linear least squares problems with absolute quadratic constraints. We develop a generalized theory following Bookstein's conic-fitting and Fitzgibbon's direct ellipse-specific fitting. Under simple preconditions, it can be shown that a minimum always exists and can be determined by a generalized eigenvalue problem. This problem is numerically reduced to an eigenvalue problem by multiplications of Givens' rotations. Finally, four applications of this approach are presented.

Parallel constraint satisfaction in memory-based decisions.

Science.gov (United States)

Glöckner, Andreas; Hodges, Sara D

2011-01-01

Three studies sought to investigate decision strategies in memory-based decisions and to test the predictions of the parallel constraint satisfaction (PCS) model for decision making (Glöckner & Betsch, 2008). Time pressure was manipulated and the model was compared against simple heuristics (take the best and equal weight) and a weighted additive strategy. From PCS we predicted that fast intuitive decision making is based on compensatory information integration and that decision time increases and confidence decreases with increasing inconsistency in the decision task. In line with these predictions we observed a predominant usage of compensatory strategies under all time-pressure conditions and even with decision times as short as 1.7 s. For a substantial number of participants, choices and decision times were best explained by PCS, but there was also evidence for use of simple heuristics. The time-pressure manipulation did not significantly affect decision strategies. Overall, the results highlight intuitive, automatic processes in decision making and support the idea that human information-processing capabilities are less severely bounded than often assumed.

New Boundary Constraints for Elliptic Systems used in Grid Generation Problems

Science.gov (United States)

Kaul, Upender K.; Clancy, Daniel (Technical Monitor)

2002-01-01

This paper discusses new boundary constraints for elliptic partial differential equations as used in grid generation problems in generalized curvilinear coordinate systems. These constraints, based on the principle of local conservation of thermal energy in the vicinity of the boundaries, are derived using the Green's Theorem. They uniquely determine the so called decay parameters in the source terms of these elliptic systems. These constraints' are designed for boundary clustered grids where large gradients in physical quantities need to be resolved adequately. It is observed that the present formulation also works satisfactorily for mild clustering. Therefore, a closure for the decay parameter specification for elliptic grid generation problems has been provided resulting in a fully automated elliptic grid generation technique. Thus, there is no need for a parametric study of these decay parameters since the new constraints fix them uniquely. It is also shown that for Neumann type boundary conditions, these boundary constraints uniquely determine the solution to the internal elliptic problem thus eliminating the non-uniqueness of the solution of an internal Neumann boundary value grid generation problem.

Implicit Motives and Men's Perceived Constraint in Fatherhood.

Science.gov (United States)

Ruppen, Jessica; Waldvogel, Patricia; Ehlert, Ulrike

2016-01-01

Research shows that implicit motives influence social relationships. However, little is known about their role in fatherhood and, particularly, how men experience their paternal role. Therefore, this study examined the association of implicit motives and fathers' perceived constraint due to fatherhood. Furthermore, we explored their relation to fathers' life satisfaction. Participants were fathers with biological children ( N = 276). They were asked to write picture stories, which were then coded for implicit affiliation and power motives. Perceived constraint and life satisfaction were assessed on a visual analog scale. A higher implicit need for affiliation was significantly associated with lower perceived constraint, whereas the implicit need for power had the opposite effect. Perceived constraint had a negative influence on life satisfaction. Structural equation modeling revealed significant indirect effects of implicit affiliation and power motives on life satisfaction mediated by perceived constraint. Our findings indicate that men with a higher implicit need for affiliation experience less constraint due to fatherhood, resulting in higher life satisfaction. The implicit need for power, however, results in more perceived constraint and is related to decreased life satisfaction.

Statistical physics of hard optimization problems

International Nuclear Information System (INIS)

Zdeborova, L.

2009-01-01

Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a cost function depending on these variables. Optimization problems in the non-deterministic polynomial (NP)-complete class are particularly difficult, it is believed that the number of operations required to minimize the cost function is in the most difficult cases exponential in the system size. However, even in an NP-complete problem the practically arising instances might, in fact, be easy to solve. The principal question we address in this article is: How to recognize if an NP-complete constraint satisfaction problem is typically hard and what are the main reasons for this? We adopt approaches from the statistical physics of disordered systems, in particular the cavity method developed originally to describe glassy systems. We describe new properties of the space of solutions in two of the most studied constraint satisfaction problems - random satisfy ability and random graph coloring. We suggest a relation between the existence of the so-called frozen variables and the algorithmic hardness of a problem. Based on these insights, we introduce a new class of problems which we named ”locked” constraint satisfaction, where the statistical description is easily solvable, but from the algorithmic point of view they are even more challenging than the canonical satisfy ability.

Statistical physics of hard optimization problems

International Nuclear Information System (INIS)

Zdeborova, L.

2009-01-01

Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a cost function depending on these variables. Optimization problems in the non-deterministic polynomial-complete class are particularly difficult, it is believed that the number of operations required to minimize the cost function is in the most difficult cases exponential in the system size. However, even in an non-deterministic polynomial-complete problem the practically arising instances might, in fact, be easy to solve. The principal the question we address in the article is: How to recognize if an non-deterministic polynomial-complete constraint satisfaction problem is typically hard and what are the main reasons for this? We adopt approaches from the statistical physics of disordered systems, in particular the cavity method developed originally to describe glassy systems. We describe new properties of the space of solutions in two of the most studied constraint satisfaction problems - random satisfiability and random graph coloring. We suggest a relation between the existence of the so-called frozen variables and the algorithmic hardness of a problem. Based on these insights, we introduce a new class of problems which we named 'locked' constraint satisfaction, where the statistical description is easily solvable, but from the algorithmic point of view they are even more challenging than the canonical satisfiability (Authors)

Statistical physics of hard optimization problems

Science.gov (United States)

Zdeborová, Lenka

2009-06-01

Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a cost function depending on these variables. Optimization problems in the non-deterministic polynomial (NP)-complete class are particularly difficult, it is believed that the number of operations required to minimize the cost function is in the most difficult cases exponential in the system size. However, even in an NP-complete problem the practically arising instances might, in fact, be easy to solve. The principal question we address in this article is: How to recognize if an NP-complete constraint satisfaction problem is typically hard and what are the main reasons for this? We adopt approaches from the statistical physics of disordered systems, in particular the cavity method developed originally to describe glassy systems. We describe new properties of the space of solutions in two of the most studied constraint satisfaction problems - random satisfiability and random graph coloring. We suggest a relation between the existence of the so-called frozen variables and the algorithmic hardness of a problem. Based on these insights, we introduce a new class of problems which we named "locked" constraint satisfaction, where the statistical description is easily solvable, but from the algorithmic point of view they are even more challenging than the canonical satisfiability.

A General Connectionist Model of Attitude Structure and Change: The ACS (Attitudes as Constraint Satisfaction) Model

Science.gov (United States)

Monroe, Brian M.; Read, Stephen J.

2008-01-01

A localist, parallel constraint satisfaction, artificial neural network model is presented that accounts for a broad collection of attitude and attitude-change phenomena. The network represents the attitude object and cognitions and beliefs related to the attitude, as well as how to integrate a persuasive message into this network. Short-term…

Implicit Motives and Men’s Perceived Constraint in Fatherhood

Science.gov (United States)

Ruppen, Jessica; Waldvogel, Patricia; Ehlert, Ulrike

2016-01-01

Research shows that implicit motives influence social relationships. However, little is known about their role in fatherhood and, particularly, how men experience their paternal role. Therefore, this study examined the association of implicit motives and fathers’ perceived constraint due to fatherhood. Furthermore, we explored their relation to fathers’ life satisfaction. Participants were fathers with biological children (N = 276). They were asked to write picture stories, which were then coded for implicit affiliation and power motives. Perceived constraint and life satisfaction were assessed on a visual analog scale. A higher implicit need for affiliation was significantly associated with lower perceived constraint, whereas the implicit need for power had the opposite effect. Perceived constraint had a negative influence on life satisfaction. Structural equation modeling revealed significant indirect effects of implicit affiliation and power motives on life satisfaction mediated by perceived constraint. Our findings indicate that men with a higher implicit need for affiliation experience less constraint due to fatherhood, resulting in higher life satisfaction. The implicit need for power, however, results in more perceived constraint and is related to decreased life satisfaction. PMID:27933023

Implicit Motives and Men’s Perceived Constraint in Fatherhood

Directory of Open Access Journals (Sweden)

Jessica Ruppen

2016-11-01

Full Text Available Research shows that implicit motives influence social relationships. However, little is known about their role in fatherhood and, particularly, how men experience their paternal role. Therefore, this study examined the association of implicit motives and fathers’ perceived constraint due to fatherhood. Furthermore, we explored their relation to fathers’ life satisfaction. Participants were fathers with biological children (N = 276. They were asked to write picture stories, which were then coded for implicit affiliation and power motives. Perceived constraint and life satisfaction were assessed on a visual analog scale. A higher implicit need for affiliation was significantly associated with lower perceived constraint, whereas the implicit need for power had the opposite effect. Perceived constraint had a negative influence on life satisfaction. Structural equation modeling revealed significant indirect effects of implicit affiliation and power motives on life satisfaction mediated by perceived constraint. Our findings indicate that men with a higher implicit need for affiliation experience less constraint due to fatherhood, resulting in higher life satisfaction. The implicit need for power, however, results in more perceived constraint and is related to decreased life satisfaction.

Cognitive constraints on high school students' representations of real environmental problems

Science.gov (United States)

Barnes, Ervin Kenneth

One class of juniors and seniors was studied through one semester in the investigation of how students think about, learn from, and solve real environmental problems. The intention was to listen to student voices while researching the features of their representations of these problems, the beliefs they held (tenets), the cognitive processes they employed, and the principles of science, ecology, problem solving, and ethics they held as tenets. The focus was upon two self-selected groups as they perceived, engaged, analyzed, and proposed solutions for problems. Analysis of the student representations involved interpretation of the features to include both the perspective tenets and the envisioning processes. These processes included the intentive and attentive constraints as tenet acquisition and volitive and agential constraints as tenet affirmation. The perspective tenets included a variety of conceptual (basic science, ecological, ethical, and problem-solving) constraints as well as ontological, epistemological, and other cultural (role, status, power, and community) constraints. The perspective tenets were interpreted thematically including the ways populations of people cause and care about environmental problems, the magnitude of environmental problems and the science involved, the expectations and limitations students perceive for themselves, and the importance of community awareness and cooperation to addressing these problems. Some of these tenets were interpreted to be principles in that they were rules that were accepted by some people as true. The perspective tenets, along with the envisioning processes, were perceived to be the constraints that determined the environmental problems and limited the solution possibilities. The students thought about environmental problems in mature and principled ways using a repertoire of cognitive processes. They learned from them as they acquired and affirmed tenets. They solved them through personal choices and

Computing group cardinality constraint solutions for logistic regression problems.

Science.gov (United States)

Zhang, Yong; Kwon, Dongjin; Pohl, Kilian M

2017-01-01

We derive an algorithm to directly solve logistic regression based on cardinality constraint, group sparsity and use it to classify intra-subject MRI sequences (e.g. cine MRIs) of healthy from diseased subjects. Group cardinality constraint models are often applied to medical images in order to avoid overfitting of the classifier to the training data. Solutions within these models are generally determined by relaxing the cardinality constraint to a weighted feature selection scheme. However, these solutions relate to the original sparse problem only under specific assumptions, which generally do not hold for medical image applications. In addition, inferring clinical meaning from features weighted by a classifier is an ongoing topic of discussion. Avoiding weighing features, we propose to directly solve the group cardinality constraint logistic regression problem by generalizing the Penalty Decomposition method. To do so, we assume that an intra-subject series of images represents repeated samples of the same disease patterns. We model this assumption by combining series of measurements created by a feature across time into a single group. Our algorithm then derives a solution within that model by decoupling the minimization of the logistic regression function from enforcing the group sparsity constraint. The minimum to the smooth and convex logistic regression problem is determined via gradient descent while we derive a closed form solution for finding a sparse approximation of that minimum. We apply our method to cine MRI of 38 healthy controls and 44 adult patients that received reconstructive surgery of Tetralogy of Fallot (TOF) during infancy. Our method correctly identifies regions impacted by TOF and generally obtains statistically significant higher classification accuracy than alternative solutions to this model, i.e., ones relaxing group cardinality constraints. Copyright © 2016 Elsevier B.V. All rights reserved.

Minimal investment risk of a portfolio optimization problem with budget and investment concentration constraints

Science.gov (United States)

Shinzato, Takashi

2017-02-01

In the present paper, the minimal investment risk for a portfolio optimization problem with imposed budget and investment concentration constraints is considered using replica analysis. Since the minimal investment risk is influenced by the investment concentration constraint (as well as the budget constraint), it is intuitive that the minimal investment risk for the problem with an investment concentration constraint can be larger than that without the constraint (that is, with only the budget constraint). Moreover, a numerical experiment shows the effectiveness of our proposed analysis. In contrast, the standard operations research approach failed to identify accurately the minimal investment risk of the portfolio optimization problem.

Feed Forward Neural Network and Optimal Control Problem with Control and State Constraints

Science.gov (United States)

Kmet', Tibor; Kmet'ová, Mária

2009-09-01

A feed forward neural network based optimal control synthesis is presented for solving optimal control problems with control and state constraints. The paper extends adaptive critic neural network architecture proposed by [5] to the optimal control problems with control and state constraints. The optimal control problem is transcribed into a nonlinear programming problem which is implemented with adaptive critic neural network. The proposed simulation method is illustrated by the optimal control problem of nitrogen transformation cycle model. Results show that adaptive critic based systematic approach holds promise for obtaining the optimal control with control and state constraints.

An empirical study on collective intelligence algorithms for video games problem-solving

OpenAIRE

González-Pardo, Antonio; Palero, Fernando; Camacho, David

2015-01-01

Computational intelligence (CI), such as evolutionary computation or swarm intelligence methods, is a set of bio-inspired algorithms that have been widely used to solve problems in areas like planning, scheduling or constraint satisfaction problems. Constrained satisfaction problems (CSP) have taken an important attention from the research community due to their applicability to real problems. Any CSP problem is usually modelled as a constrained graph where the edges represent a set of restri...

Quadratic third-order tensor optimization problem with quadratic constraints

Directory of Open Access Journals (Sweden)

Lixing Yang

2014-05-01

Full Text Available Quadratically constrained quadratic programs (QQPs problems play an important modeling role for many diverse problems. These problems are in general NP hard and numerically intractable. Semidenite programming (SDP relaxations often provide good approximate solutions to these hard problems. For several special cases of QQP, e.g., convex programs and trust region subproblems, SDP relaxation provides the exact optimal value, i.e., there is a zero duality gap. However, this is not true for the general QQP, or even the QQP with two convex constraints, but a nonconvex objective.In this paper, we consider a certain QQP where the variable is neither vector nor matrix but a third-order tensor. This problem can be viewed as a generalization of the ordinary QQP with vector or matrix as it's variant. Under some mild conditions, we rst show that SDP relaxation provides exact optimal solutions for the original problem. Then we focus on two classes of homogeneous quadratic tensor programming problems which have no requirements on the constraints number. For one, we provide an easily implemental polynomial time algorithm to approximately solve the problem and discuss the approximation ratio. For the other, we show there is no gap between the SDP relaxation and itself.

CONSTRAINTS AND PROBLEMS OF INTERNET SERVICES IN ...

African Journals Online (AJOL)

In spite of the benefits of the Internet to learning, teaching and research a number of difficulties still bedevil the provision of services in Nigeria. The objective of this study was to examine the constraints and problems of Internet Services at the Obafemi Awolowo University, Ile-Ife. Questionnaires were administered to ...

Bin-packing problems with load balancing and stability constraints

DEFF Research Database (Denmark)

Trivella, Alessio; Pisinger, David

apper in a wide range of disciplines, including transportation and logistics, computer science, engineering, economics and manufacturing. The problem is well-known to be N P-hard and difficult to solve in practice, especially when dealing with the multi-dimensional cases. Closely connected to the BPP...... realistic constraints related to e.g. load balancing, cargo stability and weight limits, in the multi-dimensional BPP. The BPP poses additional challenges compared to the CLP due to the supplementary objective of minimizing the number of bins. In particular, in section 2 we discuss how to integrate bin......-packing and load balancing of items. The problem has only been considered in the literature in simplified versions, e.g. balancing a single bin or introducing a feasible region for the barycenter. In section 3 we generalize the problem to handle cargo stability and weight constraints....

Introducing radiality constraints in capacitated location-routing problems

Directory of Open Access Journals (Sweden)

Eliana Mirledy Toro Ocampo

2017-03-01

Full Text Available In this paper, we introduce a unified mathematical formulation for the Capacitated Vehicle Routing Problem (CVRP and for the Capacitated Location Routing Problem (CLRP, adopting radiality constraints in order to guarantee valid routes and eliminate subtours. This idea is inspired by formulations already employed in electric power distribution networks, which requires a radial topology in its operation. The results show that the proposed formulation greatly improves the convergence of the solver.

1-Skeletons of the Spanning Tree Problems with Additional Constraints

Directory of Open Access Journals (Sweden)

V. A. Bondarenko

2015-01-01

Full Text Available In this paper, we study polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less than or equal to a given value. In the second problem, an additional constraint is the assumption that the degree of all nodes of the spanning tree does not exceed a given value. The recognition versions of both problems are NP-complete. We consider polytopes of these problems and their 1-skeletons. We prove that in both cases it is a NP-complete problem to determine whether the vertices of 1-skeleton are adjacent. Although it is possible to obtain a superpolynomial lower bounds on the clique numbers of these graphs. These values characterize the time complexity in a broad class of algorithms based on linear comparisons. The results indicate a fundamental difference between combinatorial and geometric properties of the considered problems from the classical minimum spanning tree problem.

Life Satisfaction among High School Students with Social, Emotional, and Behavioral Problems

Science.gov (United States)

State, Talida M.; Kern, Lee

2017-01-01

Over the last decade, there has been increased interest in measuring life satisfaction among children and adolescents as an indicator of broad well-being and happiness. Although limited, existing research with students with social, emotional, and behavioral (SEB) problems indicates they experience lower life satisfaction compared with their…

Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Optimization Problem with Entropy Diversity Constraint

Science.gov (United States)

2014-01-01

Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results. PMID:24991645

Firefly algorithm for cardinality constrained mean-variance portfolio optimization problem with entropy diversity constraint.

Science.gov (United States)

Bacanin, Nebojsa; Tuba, Milan

2014-01-01

Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results.

Optimal consumption—portfolio problem with CVaR constraints

International Nuclear Information System (INIS)

Zhang, Qingye; Gao, Yan

2016-01-01

The optimal portfolio selection is a fundamental issue in finance, and its two most important ingredients are risk and return. Merton's pioneering work in dynamic portfolio selection emphasized only the expected utility of the consumption and the terminal wealth. To make the optimal portfolio strategy be achievable, risk control over bankruptcy during the investment horizon is an indispensable ingredient. So, in this paper, we consider the consumption-portfolio problem coupled with a dynamic risk control. More specifically, different from the existing literature, we impose a dynamic relative CVaR constraint on it. By the stochastic dynamic programming techniques, we derive the corresponding Hamilton–Jacobi–Bellman (HJB) equation. Moreover, by the Lagrange multiplier method, the closed form solution is provided when the utility function is a logarithmic one. At last, an illustrative empirical study is given. The results show the distinct difference of the portfolio strategies with and without the CVaR constraints: the proportion invested in the risky assets is reduced over time with CVaR constraint instead of being constant without CVaR constraints. This can provide a good decision-making reference for the investors.

A mixed integer programming model for a continuous move transportation problem with service constraints

Directory of Open Access Journals (Sweden)

J. Fabian Lopez

2010-01-01

Full Text Available We consider a Pickup and Delivery Vehicle Routing Problem (PDP commonly encountered in real-world logistics operations. The problem involves a set of practical complications that have received little attention in the vehicle routing literature. In this problem, there are multiple vehicle types available to cover a set of pickup and delivery requests, each of which has pickup time windows and delivery time windows. Transportation orders and vehicle types must satisfy a set of compatibility constraints that specify which orders cannot be covered by which vehicle types. In addition we include some dock service capacity constraints as is required on common real world operations. This problem requires to be attended on large scale instances (orders ≥ 500, (vehicles ≥ 150. As a generalization of the traveling salesman problem, clearly this problem is NP-hard. The exact algorithms are too slow for large scale instances. The PDP-TWDS is both a packing problem (assign order to vehicles, and a routing problem (find the best route for each vehicle. We propose to solve the problem in three stages. The first stage constructs initials solutions at aggregate level relaxing some constraints on the original problem. The other two stages imposes time windows and dock service constraints. Our results are favorable finding good quality solutions in relatively short computational times.

Design and Evaluation of the User-Adapted Program Scheduling system based on Bayesian Network and Constraint Satisfaction

Science.gov (United States)

Iwasaki, Hirotoshi; Sega, Shinichiro; Hiraishi, Hironori; Mizoguchi, Fumio

In recent years, lots of music content can be stored in mobile computing devices, such as a portable digital music player and a car navigation system. Moreover, various information content like news or traffic information can be acquired always anywhere by a cellular communication and a wireless LAN. However, usability issues arise from the simple interfaces of mobile computing devices. Moreover, retrieving and selecting such content poses safety issues, especially while driving. Thus, it is important for the mobile system to recommend content automatically adapted to user's preference and situation. In this paper, we present the user-adapted program scheduling that generates sequences of content (Program) suiting user's preference and situation based on the Bayesian network and the Constraint Satisfaction Problem (CSP) technique. We also describe the design and evaluation of its realization system, the Personal Program Producer (P3). First, preference such as a genre ratio of content in a program is learned as a Bayesian network model using simple operations such as a skip behavior. A model including each content tends to become large-scale. In order to make it small, we present the model separation method that carries out losslessly compression of the model. Using the model, probabilistic distributions of preference to generate constraints are inferred. Finally satisfying the constraints, a program is produced. This kind of CSP has an issue of which the number of variables is not fixedness. In order to make it variable, we propose a method using metavariables. To evaluate the above methods, we applied them to P3 on a car navigation system. User evaluations helped us clarify that the P3 can produce the program that a user prefers and adapt it to the user.

Multiobjective Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Customer Satisfaction

Directory of Open Access Journals (Sweden)

Jingling Zhang

2012-01-01

Full Text Available The multiobjective vehicle routing problem considering customer satisfaction (MVRPCS involves the distribution of orders from several depots to a set of customers over a time window. This paper presents a self-adaptive grid multi-objective quantum evolutionary algorithm (MOQEA for the MVRPCS, which takes into account customer satisfaction as well as travel costs. The degree of customer satisfaction is represented by proposing an improved fuzzy due-time window, and the optimization problem is modeled as a mixed integer linear program. In the MOQEA, nondominated solution set is constructed by the Challenge Cup rules. Moreover, an adaptive grid is designed to achieve the diversity of solution sets; that is, the number of grids in each generation is not fixed but is automatically adjusted based on the distribution of the current generation of nondominated solution set. In the study, the MOQEA is evaluated by applying it to classical benchmark problems. Results of numerical simulation and comparison show that the established model is valid and the MOQEA is effective for MVRPCS.

The theory of reasoned action as parallel constraint satisfaction: towards a dynamic computational model of health behavior.

Directory of Open Access Journals (Sweden)

Mark G Orr

Full Text Available The reasoned action approach, although ubiquitous in health behavior theory (e.g., Theory of Reasoned Action/Planned Behavior, does not adequately address two key dynamical aspects of health behavior: learning and the effect of immediate social context (i.e., social influence. To remedy this, we put forth a computational implementation of the Theory of Reasoned Action (TRA using artificial-neural networks. Our model re-conceptualized behavioral intention as arising from a dynamic constraint satisfaction mechanism among a set of beliefs. In two simulations, we show that constraint satisfaction can simultaneously incorporate the effects of past experience (via learning with the effects of immediate social context to yield behavioral intention, i.e., intention is dynamically constructed from both an individual's pre-existing belief structure and the beliefs of others in the individual's social context. In a third simulation, we illustrate the predictive ability of the model with respect to empirically derived behavioral intention. As the first known computational model of health behavior, it represents a significant advance in theory towards understanding the dynamics of health behavior. Furthermore, our approach may inform the development of population-level agent-based models of health behavior that aim to incorporate psychological theory into models of population dynamics.

The theory of reasoned action as parallel constraint satisfaction: towards a dynamic computational model of health behavior.

Science.gov (United States)

Orr, Mark G; Thrush, Roxanne; Plaut, David C

2013-01-01

The reasoned action approach, although ubiquitous in health behavior theory (e.g., Theory of Reasoned Action/Planned Behavior), does not adequately address two key dynamical aspects of health behavior: learning and the effect of immediate social context (i.e., social influence). To remedy this, we put forth a computational implementation of the Theory of Reasoned Action (TRA) using artificial-neural networks. Our model re-conceptualized behavioral intention as arising from a dynamic constraint satisfaction mechanism among a set of beliefs. In two simulations, we show that constraint satisfaction can simultaneously incorporate the effects of past experience (via learning) with the effects of immediate social context to yield behavioral intention, i.e., intention is dynamically constructed from both an individual's pre-existing belief structure and the beliefs of others in the individual's social context. In a third simulation, we illustrate the predictive ability of the model with respect to empirically derived behavioral intention. As the first known computational model of health behavior, it represents a significant advance in theory towards understanding the dynamics of health behavior. Furthermore, our approach may inform the development of population-level agent-based models of health behavior that aim to incorporate psychological theory into models of population dynamics.

An integrated model to measure service management and physical constraints' effect on food consumption in assisted-living facilities.

Science.gov (United States)

Huang, Hui-Chun; Shanklin, Carol W

2008-05-01

The United States is experiencing remarkable growth in the elderly population, which provides both opportunities and challenges for assisted-living facilities. The objective of this study was to explore how service management influences residents' actual food consumption in assisted-living facilities. Physical factors influencing residents' service evaluation and food consumption also were investigated. A total of 394 questionnaires were distributed to assisted-living residents in seven randomly selected facilities. The questionnaire was developed based on an in-depth literature review and pilot study. Residents' perceived quality evaluations, satisfaction, and physical constraints were measured. Residents' actual food consumption was measured using a plate waste technique. A total of 118 residents in five facilities completed both questionnaires and food consumption assessments. Descriptive, multivariate analyses and structural equation modeling techniques were employed. Service management, including food and service quality and customer satisfaction, was found to significantly influence residents' food consumption. Physical constraints associated with aging, including a decline in health status, chewing problems, sensory loss, and functional disability, also significantly influenced residents' food consumption. A significant relationship was found between physical constraints and customer satisfaction. Foodservice that provides good food and service quality increases customer satisfaction and affects residents' actual food consumption. Physical constraints also influence residents' food consumption directly, or indirectly through satisfaction. The findings suggest that food and nutrition professionals in assisted-living should consider the physical profiles of their residents to enhance residents' satisfaction and nutrient intake. Recommendations for exploring residents' perspectives are discussed.

A green vehicle routing problem with customer satisfaction criteria

Science.gov (United States)

Afshar-Bakeshloo, M.; Mehrabi, A.; Safari, H.; Maleki, M.; Jolai, F.

2016-12-01

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers' satisfaction have been taken into account. Meanwhile, the introduced model prepares an effective dashboard for decision-makers that determines appropriate routes, the best mixed fleet, speed and idle time of vehicles. Additionally, some new factors evaluate the greening of each decision based on three criteria. This model applies piecewise linear functions (PLFs) to linearize a nonlinear fuzzy interval for incorporating customers' satisfaction into other linear objectives. We have presented a mixed integer linear programming formulation for the S-GVRP. This model enriches managerial insights by providing trade-offs between customers' satisfaction, total costs and emission levels. Finally, we have provided a numerical study for showing the applicability of the model.

Marital Satisfaction, Parental Stress, and Child Behavior Problems among Parents of Young Children with Developmental Delays

Science.gov (United States)

Robinson, Merideth; Neece, Cameron L.

2015-01-01

Studies have found that low marital satisfaction, parenting stress, and child behavior problems are linked in families of children with developmental delays (DD). However, previous investigations examining the relationships between parenting stress, child behavior problems, and marital satisfaction rarely examine the interrelationships of these…

Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows

Science.gov (United States)

Yurtkuran, Alkın

2014-01-01

The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle's boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms. PMID:24723834

Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows

Directory of Open Access Journals (Sweden)

Alkın Yurtkuran

2014-01-01

Full Text Available The traveling salesman problem with time windows (TSPTW is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle’s boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms.

F John's stability conditions versus A Carasso's SECB constraint for backward parabolic problems

International Nuclear Information System (INIS)

Lee, Jinwoo; Sheen, Dongwoo

2009-01-01

In order to solve backward parabolic problems John (1960 Commun. Pure. Appl. Math.13 551–85) introduced the two constraints ||u(T)|| ≤ M and ||u(0) − g|| ≤ δ where u(t) satisfies the backward heat equation for t in (0, T) with the initial data u(0). The slow evolution from the continuation boundary (SECB) constraint was introduced by Carasso (1994 SIAM J. Numer. Anal. 31 1535–57) to attain continuous dependence on data for backward parabolic problems even at the continuation boundary t = T. The additional 'SECB constraint' guarantees a significant improvement in stability up to t = T. In this paper, we prove that the same type of stability can be obtained by using only two constraints among the three. More precisely, we show that the a priori boundedness condition ||u(T)|| ≤ M is redundant. This implies that Carasso's SECB condition can be used to replace the a priori boundedness condition of John with an improved stability estimate. Also, a new class of regularized solutions is introduced for backward parabolic problems with an SECB constraint. The new regularized solutions are optimally stable and we also provide a constructive scheme to compute. Finally, numerical examples are provided

The Effect of Some Constraints on Mathematics Instructors' Problem ...

African Journals Online (AJOL)

This study was designed to examine the effect of perceived constraints on four universities mathematics department instructors' classroom practices of problem solving in teaching mathematics. To this end, the target population of the study includes mathematics instructors in the Amhara Regional state universities. From a ...

Evaluation of uranium resources. Problems and constraints

International Nuclear Information System (INIS)

Williams, R.M.

1979-01-01

Growing awareness that the era of cheap energy is over has led to current efforts by governments and international organizations to examine the question of the adequacy of energy resources on a global scale. Despite the relative success of the NEA and the IAEA efforts in the study of world uranium supply, there is a need for such studies to become still more comprehensive and broader in scope. A basic problem exists with respect to the lack of a universally accepted set of resource terms by which to classify resource estimates once they are made. Often voids exist in international assessments because of insufficient data with respect to known resources and occasionally because of a lack of expertise to make the required estimates. With respect to the assessment of undiscovered uranium resources, major constraints are the relatively embryonic state of methodology for assessment of undiscovered resources and the fact that the inventory of basic geology, geochemical, and geophysical data is either incomplete or non-existent in many parts of the world. Finally, once resource estimates are made, there is often an unclear understanding about when and at what rate the resources can be made available. Hopefully, current efforts will lead to a solution to some of the principal problems and constraints which may be impeding progress toward an expansion and improvement of world uranium resource assessments. (author)

Genetic programming over context-free languages with linear constraints for the knapsack problem: first results.

Science.gov (United States)

Bruhn, Peter; Geyer-Schulz, Andreas

2002-01-01

In this paper, we introduce genetic programming over context-free languages with linear constraints for combinatorial optimization, apply this method to several variants of the multidimensional knapsack problem, and discuss its performance relative to Michalewicz's genetic algorithm with penalty functions. With respect to Michalewicz's approach, we demonstrate that genetic programming over context-free languages with linear constraints improves convergence. A final result is that genetic programming over context-free languages with linear constraints is ideally suited to modeling complementarities between items in a knapsack problem: The more complementarities in the problem, the stronger the performance in comparison to its competitors.

A Hybrid Method for Modeling and Solving Supply Chain Optimization Problems with Soft and Logical Constraints

Directory of Open Access Journals (Sweden)

Paweł Sitek

2016-01-01

Full Text Available This paper presents a hybrid method for modeling and solving supply chain optimization problems with soft, hard, and logical constraints. Ability to implement soft and logical constraints is a very important functionality for supply chain optimization models. Such constraints are particularly useful for modeling problems resulting from commercial agreements, contracts, competition, technology, safety, and environmental conditions. Two programming and solving environments, mathematical programming (MP and constraint logic programming (CLP, were combined in the hybrid method. This integration, hybridization, and the adequate multidimensional transformation of the problem (as a presolving method helped to substantially reduce the search space of combinatorial models for supply chain optimization problems. The operation research MP and declarative CLP, where constraints are modeled in different ways and different solving procedures are implemented, were linked together to use the strengths of both. This approach is particularly important for the decision and combinatorial optimization models with the objective function and constraints, there are many decision variables, and these are summed (common in manufacturing, supply chain management, project management, and logistic problems. The ECLiPSe system with Eplex library was proposed to implement a hybrid method. Additionally, the proposed hybrid transformed model is compared with the MILP-Mixed Integer Linear Programming model on the same data instances. For illustrative models, its use allowed finding optimal solutions eight to one hundred times faster and reducing the size of the combinatorial problem to a significant extent.

Constraint-based Student Modelling in Probability Story Problems with Scaffolding Techniques

Directory of Open Access Journals (Sweden)

Nabila Khodeir

2018-01-01

Full Text Available Constraint-based student modelling (CBM is an important technique employed in intelligent tutoring systems to model student knowledge to provide relevant assistance. This paper introduces the Math Story Problem Tutor (MAST, a Web-based intelligent tutoring system for probability story problems, which is able to generate problems of different contexts, types and difficulty levels for self-paced learning. Constraints in MAST are specified at a low-level of granularity to allow fine-grained diagnosis of the student error. Furthermore, MAST extends CBM to address errors due to misunderstanding of the narrative story. It can locate and highlight keywords that may have been overlooked or misunderstood leading to an error. This is achieved by utilizing the role of sentences and keywords that are defined through the Natural Language Generation (NLG methods deployed in the story problem generation. MAST also integrates CBM with scaffolding questions and feedback to provide various forms of help and guidance to the student. This allows the student to discover and correct any errors in his/her solution. MAST has been preliminary evaluated empirically and the results show the potential effectiveness in tutoring students with a decrease in the percentage of violated constraints along the learning curve. Additionally, there is a significant improvement in the results of the post–test exam in comparison to the pre-test exam of the students using MAST in comparison to those relying on the textbook

Problem-based learning in laboratory medicine resident education: a satisfaction survey.

Science.gov (United States)

Lepiller, Quentin; Solis, Morgane; Velay, Aurélie; Gantner, Pierre; Sueur, Charlotte; Stoll-Keller, Françoise; Barth, Heidi; Fafi-Kremer, Samira

2017-04-01

Theoretical knowledge in biology and medicine plays a substantial role in laboratory medicine resident education. In this study, we assessed the contribution of problem-based learning (PBL) to improve the training of laboratory medicine residents during their internship in the department of virology, Strasbourg University Hospital, France. We compared the residents' satisfaction regarding an educational program based on PBL and a program based on lectures and presentations. PBL induced a high level of satisfaction (100%) among residents compared to lectures and presentations (53%). The main advantages of this technique were to create a situational interest regarding virological problems, to boost the residents' motivation and to help them identify the most relevant learning objectives in virology. However, it appears pertinent to educate the residents in appropriate bibliographic research techniques prior to PBL use and to monitor their learning by regular formative assessment sessions.

Alcohol-related problems and life satisfaction predict motivation to change among mandated college students.

Science.gov (United States)

Diulio, Andrea R; Cero, Ian; Witte, Tracy K; Correia, Christopher J

2014-04-01

The present study investigated the role specific types of alcohol-related problems and life satisfaction play in predicting motivation to change alcohol use. Participants were 548 college students mandated to complete a brief intervention following an alcohol-related policy violation. Using hierarchical multiple regression, we tested for the presence of interaction and quadratic effects on baseline data collected prior to the intervention. A significant interaction indicated that the relationship between a respondent's personal consequences and his/her motivation to change differs depending upon the level of concurrent social consequences. Additionally quadratic effects for abuse/dependence symptoms and life satisfaction were found. The quadratic probes suggest that abuse/dependence symptoms and poor life satisfaction are both positively associated with motivation to change for a majority of the sample; however, the nature of these relationships changes for participants with more extreme scores. Results support the utility of using a multidimensional measure of alcohol related problems and assessing non-linear relationships when assessing predictors of motivation to change. The results also suggest that the best strategies for increasing motivation may vary depending on the types of alcohol-related problems and level of life satisfaction the student is experiencing and highlight potential directions for future research. Copyright © 2014. Published by Elsevier Ltd.

Quantization of (2 + 1)-spinning particles and bifermionic constraint problem

Energy Technology Data Exchange (ETDEWEB)

Fresneda, R [Instituto de FIsica, Universidade de Sao Paulo, Caixa Postal 66318-CEP, 05315-970 Sao Paulo, SP (Brazil); Gavrilov, S P [Instituto de FIsica, Universidade de Sao Paulo, Caixa Postal 66318-CEP, 05315-970 Sao Paulo, SP (Brazil); Gitman, D M [Instituto de FIsica, Universidade de Sao Paulo, Caixa Postal 66318-CEP, 05315-970 Sao Paulo, SP (Brazil); Moshin, P Yu [Instituto de FIsica, Universidade de Sao Paulo, Caixa Postal 66318-CEP, 05315-970 Sao Paulo, SP (Brazil)

2004-03-21

This work is a natural continuation of our recent study in quantizing relativistic particles. There it was demonstrated that, by applying a consistent quantization scheme to the classical model of a spinless relativistic particle as well as to the Berezin-Marinov model of a 3 + 1 Dirac particle, it is possible to obtain a consistent relativistic quantum mechanics of such particles. In the present paper, we apply a similar approach to the problem of quantizing the massive 2 + 1 Dirac particle. However, we stress that such a problem differs in a nontrivial way from the one in 3 + 1 dimensions. The point is that in 2 + 1 dimensions each spin polarization describes different fermion species. Technically this fact manifests itself through the presence of a bifermionic constant and of a bifermionic first-class constraint. In particular, this constraint does not admit a conjugate gauge condition at the classical level. The quantization problem in 2 + 1 dimensions is also interesting from the physical viewpoint (e.g., anyons). In order to quantize the model, we first derive a classical formulation in an effective phase space, restricted by constraints and gauges. Then the condition of preservation of the classical symmetries allows us to realize the operator algebra in an unambiguous way and construct an appropriate Hilbert space. The physical sector of the constructed quantum mechanics contains spin-1/2 particles and antiparticles without an infinite number of negative-energy levels, and exactly reproduces the one-particle sector of the 2 + 1 quantum theory of a spinor field.

A LONGITUDINAL ANALYSIS OF PARENTING PRACTICES, COUPLE SATISFACTION, AND CHILD BEHAVIOR PROBLEMS

OpenAIRE

Linville, Deanna; Chronister, Krista; Dishion, Tom; Todahl, Jeff; Miller, John; Shaw, Daniel; Gardner, Francis; Wilson, Melvin

2010-01-01

This longitudinal study examined the relationship between couple relationship satisfaction, parenting practices, parent depression, and child problem behaviors. The study participants (n = 148) were part of a larger experimental study that examined the effectiveness of a brief family-centered intervention, the Family Check-Up model. Regression analysis results indicated that our proposed model accounted for 38% of the variance in child problem behavior at Time 2, with child problem behavior a...

Topology optimization problems with design-dependent sets of constraints

DEFF Research Database (Denmark)

Schou, Marie-Louise Højlund

Topology optimization is a design tool which is used in numerous fields. It can be used whenever the design is driven by weight and strength considerations. The basic concept of topology optimization is the interpretation of partial differential equation coefficients as effective material...... properties and designing through changing these coefficients. For example, consider a continuous structure. Then the basic concept is to represent this structure by small pieces of material that are coinciding with the elements of a finite element model of the structure. This thesis treats stress constrained...... structural topology optimization problems. For such problems a stress constraint for an element should only be present in the optimization problem when the structural design variable corresponding to this element has a value greater than zero. We model the stress constrained topology optimization problem...

Introducing Problem-Based Learning to Undergraduate IT Service Management Course: Student Satisfaction and Work Performance

Science.gov (United States)

Anicic, Katarina Pažur; Mekovec, Renata

2016-01-01

This paper describes the implementation of problem-based learning (PBL) principles in an undergraduate IT service management course, followed by the results about student satisfaction and work performance. The results indicate the students' general satisfaction with the course implementation, as well as some challenges regarding the…

Solving quantum optimal control problems using Clebsch variables and Lin constraints

Science.gov (United States)

Delgado-Téllez, M.; Ibort, A.; Rodríguez de la Peña, T.

2018-01-01

Clebsch variables (and Lin constraints) are applied to the study of a class of optimal control problems for affine-controlled quantum systems. The optimal control problem will be modelled with controls defined on an auxiliary space where the dynamical group of the system acts freely. The reciprocity between both theories: the classical theory defined by the objective functional and the quantum system, is established by using a suitable version of Lagrange’s multipliers theorem and a geometrical interpretation of the constraints of the system as defining a subspace of horizontal curves in an associated bundle. It is shown how the solutions of the variational problem defined by the objective functional determine solutions of the quantum problem. Then a new way of obtaining explicit solutions for a family of optimal control problems for affine-controlled quantum systems (finite or infinite dimensional) is obtained. One of its main advantages, is the the use of Clebsch variables allows to compute such solutions from solutions of invariant problems that can often be computed explicitly. This procedure can be presented as an algorithm that can be applied to a large class of systems. Finally, some simple examples, spin control, a simple quantum Hamiltonian with an ‘Elroy beanie’ type classical model and a controlled one-dimensional quantum harmonic oscillator, illustrating the main features of the theory, will be discussed.

The effects of similarity in sexual excitation, inhibition, and mood on sexual arousal problems and sexual satisfaction in newlywed couples.

Science.gov (United States)

Lykins, Amy D; Janssen, Erick; Newhouse, Sarah; Heiman, Julia R; Rafaeli, Eshkol

2012-05-01

Despite the importance of sexuality for romantic relationships, there has been little research attention to individual differences and dyadic variables, including couple similarity, and their association with sexual problems and satisfaction. The current study examined the effects of the propensity for sexual inhibition and sexual excitation scales (SIS/SES) and the effects of different mood states on sexuality (Mood and Sexuality Questionnaire [MSQ]), at both the individual and the dyad level, on sexual arousal problems and sexual satisfaction. Similarity in SIS/SES and MSQ was measured in a nonclinical sample of 35 newlywed couples and operationally defined as the within-couple, z-transformed correlations between the two partners' item responses. Sexual arousal problems were assessed using self-report measures (Demographic and Sexual History Questionnaire) and focused on the past 3 months. Sexual satisfaction was assessed using the Global Measure of Sexual Satisfaction. Regression analyses revealed that greater similarity in the effects of anxiety and stress on sexuality was associated with more reported sexual arousal problems of wives. In contrast, the husbands' sexual arousal problems were related only to their own higher SIS1 scores. Higher SES scores predicted lower sexual satisfaction for both husbands and wives. Wives who reported strong positive mood effects on their sexuality indicated greater sexual satisfaction, while husbands who were more similar to their wives in the effect of positive moods on sexuality indicated greater sexual satisfaction. The findings show that, above and beyond one's own sexual propensities, similarity in various aspects of sexuality predicts sexual problems (more so in women) and sexual satisfaction (in both men and women). © 2012 International Society for Sexual Medicine.

A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM

Directory of Open Access Journals (Sweden)

Román Anselmo Mora Gutiérrez

2016-08-01

Full Text Available A hybridalgorithm which combines mathematical programming techniques (Kruskal’s algorithm and the strategy of maintaining arc consistency to solve constraint satisfaction problem “CSP” and heuristic methods (musical composition method and DSATUR to resolve the robust graph coloring problem (RGCP is proposed in this paper. Experimental result shows that this algorithm is better than the other algorithms presented on the literature.

Procedural Design of Exterior Lighting for Buildings with Complex Constraints

KAUST Repository

Schwarz, Michael

2014-10-01

We present a system for the lighting design of procedurally modeled buildings. The design is procedurally specified as part of the ordinary modeling workflow by defining goals for the illumination that should be attained and locations where luminaires may be installed to realize these goals. Additionally, constraints can be modeled that make the arrangement of the installed luminaires respect certain aesthetic and structural considerations. From this specification, the system automatically generates a lighting solution for any concrete model instance. The underlying, intricate joint optimization and constraint satisfaction problem is approached with a stochastic scheme that operates directly in the complex subspace where all constraints are observed. To navigate this subspace efficaciously, the actual lighting situation is taken into account. We demonstrate our system on multiple examples spanning a variety of architectural structures and lighting designs. Copyright held by the Owner/Author.

Improvement of DC Optimal Power Flow Problem Based on Nodal Approximation of Transmission Losses

Directory of Open Access Journals (Sweden)

M. R. Baghayipour

2012-03-01

3-\tIts formulation is simple and easy to understand. Moreover, it can simply be realized in the form of Lagrange representation, makes it possible to be considered as some constraints in the body of any bi-level optimization problem, with its internal level including the OPF problem satisfaction.

Mothers and Sons: A Look at the Relationship between Child Behavior Problems, Marital Satisfaction, Maternal Depression, and Family Cohesion.

Science.gov (United States)

Henderson, A. Davis; Sayger, Thomas V.; Horne, Arthur M.

2003-01-01

Assesses the interacting relationship between child behavior problems, marital satisfaction, maternal depression, and family cohesion in 43 mothers and school-aged boys. Results suggest that mothers with depressive symptoms report lower levels of marital satisfaction and higher levels of child behavior problems. Findings also suggest that maternal…

Solving the Frequency Assignment Problem by Site Availability and Constraint Programming

OpenAIRE

Linhares, Andrea Carneiro; Torres-Moreno, Juan-Manuel; Peinl, Peter; Michelon, Philippe

2010-01-01

The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of Constraint Programming and integrate the site availability concept. Numerical simulations conducted ...

An efficient method for generalized linear multiplicative programming problem with multiplicative constraints.

Science.gov (United States)

Zhao, Yingfeng; Liu, Sanyang

2016-01-01

We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.

A Hybrid Soft Computing Approach for Subset Problems

Directory of Open Access Journals (Sweden)

Broderick Crawford

2013-01-01

Full Text Available Subset problems (set partitioning, packing, and covering are formal models for many practical optimization problems. A set partitioning problem determines how the items in one set (S can be partitioned into smaller subsets. All items in S must be contained in one and only one partition. Related problems are set packing (all items must be contained in zero or one partitions and set covering (all items must be contained in at least one partition. Here, we present a hybrid solver based on ant colony optimization (ACO combined with arc consistency for solving this kind of problems. ACO is a swarm intelligence metaheuristic inspired on ants behavior when they search for food. It allows to solve complex combinatorial problems for which traditional mathematical techniques may fail. By other side, in constraint programming, the solving process of Constraint Satisfaction Problems can dramatically reduce the search space by means of arc consistency enforcing constraint consistencies either prior to or during search. Our hybrid approach was tested with set covering and set partitioning dataset benchmarks. It was observed that the performance of ACO had been improved embedding this filtering technique in its constructive phase.

Multi-objective problem of the modified distributed parallel machine and assembly scheduling problem (MDPMASP) with eligibility constraints

Science.gov (United States)

Amallynda, I.; Santosa, B.

2017-11-01

This paper proposes a new generalization of the distributed parallel machine and assembly scheduling problem (DPMASP) with eligibility constraints referred to as the modified distributed parallel machine and assembly scheduling problem (MDPMASP) with eligibility constraints. Within this generalization, we assume that there are a set non-identical factories or production lines, each one with a set unrelated parallel machine with different speeds in processing them disposed to a single assembly machine in series. A set of different products that are manufactured through an assembly program of a set of components (jobs) according to the requested demand. Each product requires several kinds of jobs with different sizes. Beside that we also consider to the multi-objective problem (MOP) of minimizing mean flow time and the number of tardy products simultaneously. This is known to be NP-Hard problem, is important to practice, as the former criterions to reflect the customer's demand and manufacturer's perspective. This is a realistic and complex problem with wide range of possible solutions, we propose four simple heuristics and two metaheuristics to solve it. Various parameters of the proposed metaheuristic algorithms are discussed and calibrated by means of Taguchi technique. All proposed algorithms are tested by Matlab software. Our computational experiments indicate that the proposed problem and fourth proposed algorithms are able to be implemented and can be used to solve moderately-sized instances, and giving efficient solutions, which are close to optimum in most cases.

Application of constraint satisfaction algorithms for conditioning and packing activated control rod assemblies in MOSAIK"R-casks. Application of constraint satisfaction algorithms for conditioning and packaging 160 control rod assemblies

International Nuclear Information System (INIS)

Harding, P.J.

2017-01-01

In the wake of the decommissioning of numerous nuclear power plants in Germany, techniques to reduce the number of costly waste casks or containers are sought after. The large bandwidth of limits (dose rate, mass, individual nuclide activities, chemical composition...) the waste packages have to comply with for both interim storage facilities and the repository Konrad render the manual planning of packaging concepts prohibitive. However, in the past, the planning for packaging has been performed in this way, albeit on the basis of several facilitating assumptions. Surprisingly, to the best of our knowledge, the automated computer-assisted generation of packaging plans for radioactive waste has not been demonstrated previously. In this talk we demonstrate how the conditioning and packing of 160 control rod assemblies was optimised using constraint satisfaction algorithms. These algorithms can be executed by a computer in a few minutes, thus considerably accelerating the generation of packaging plans, while optimising the utilisation of the waste casks and containers with respect to mass, activity, dose rate, etc. This automated and computer-assisted procedure took into account complex logistical boundary conditions present during decommissioning, such as space requirements, the sequence of the waste and the (lack of) availability of suitable waste casks. In addition, packaging concepts based on several scenarios (cask availability, space requirements,...) were easily and automatically generated once the packaging rules had been coded. We demonstrate the successful application of these algorithms to a real packaging campaign of control rod assemblies of a boiling water reactor, for which excellent results were achieved. We also present an outlook of a much larger scale project, in which the logistics and storage of radioactive waste packages is mathematically optimised. Finally, we give prospects on these techniques to others, similar logistical problems currently

On computation of C-stationary points for equilibrium problems with linear complementarity constraints via homotopy method

Czech Academy of Sciences Publication Activity Database

Červinka, Michal

2010-01-01

Roč. 2010, č. 4 (2010), s. 730-753 ISSN 0023-5954 Institutional research plan: CEZ:AV0Z10750506 Keywords : equilibrium problems with complementarity constraints * homotopy * C-stationarity Subject RIV: BC - Control Systems Theory Impact factor: 0.461, year: 2010 http://library.utia.cas.cz/separaty/2010/MTR/cervinka-on computation of c-stationary points for equilibrium problems with linear complementarity constraints via homotopy method.pdf

Nurses Returning to School: Motivators, Inhibitors and Job Satisfaction.

Science.gov (United States)

Harris, Patrick W; Burman, Mary E

2016-01-01

Health care employers and national nursing organizations are placing increased emphasis on nurses earning a baccalaureate degree or higher. This study examines the impact of motivators (professional and personal motivation), inhibitors (time constraints and employer discouragement), and job satisfaction on intent to return to school. Approximately half of the employed nurses in Wyoming were surveyed using a mailed questionnaire in the summer of 2013. Perceived employer discouragement and time constraints continued to play a direct role on intent to return to school regardless of nurse motivation or job satisfaction. However, motivation and job satisfaction also contributed to a nurse's intent to return to school. These results suggest that motivation and job satisfaction are significant regarding intent to return to school but can be limited by both perceived discouragement of one's employer and perceived time constraints. In order to meet the increasing demands of a better-educated nursing workforce, a shift in workplace dynamics may be warranted. Copyright © 2016 Elsevier Inc. All rights reserved.

Variations Method to Solve Terminal Problems for the Second Order Systems of Canonical Form with State Constraints

Directory of Open Access Journals (Sweden)

T. S. Kasatkina

2015-01-01

Full Text Available Terminal control problem with fixed finite time for the second order affine systems with state constraints is considered. A solution of such terminal problem is suggested for the systems with scalar control of regular canonical form.In this article it is shown that the initial terminal problem is equivalent to the problem of auxiliary function search. This function should satisfy some conditions. Such function design consists of two stages. The first stage includes search of function which corresponds the solution of the terminal control problem without state constraints. This function is designed as polynom of the fifth power which depends on time variable. Coefficients of the polynom are defined by boundary conditions. The second stage includes modification of designed function if corresponding to that function trajectory is not satisfied constraints. Modification process is realized by adding to the current function supplementary polynom. Influence of that polynom handles by variation of a parameter value. Modification process can include a few iterations. After process termination continuous control is found. This control is the solution of the initial terminal prUsing presented scheme the terminal control problem for system, which describes oscillations of the mathematical pendulum, is solved. This approach can be used for the solution of terminal control problems with state constraints for affine systems with multi-dimensional control.

Controlled neural network application in track-match problem

International Nuclear Information System (INIS)

Baginyan, S.A.; Ososkov, G.A.

1993-01-01

Track-match problem of high energy physics (HEP) data handling is formulated in terms of incidence matrices. The corresponding Hopfield neural network is developed to solve this type of constraint satisfaction problems (CSP). A special concept of the controlled neural network is proposed as a basis of an algorithm for the effective CSP solution. Results of comparable calculations show the very high performance of this algorithm against conventional search procedures. 8 refs.; 1 fig.; 1 tab

Level of satisfaction of older persons with their general practitioner and practice: role of complexity of health problems.

Science.gov (United States)

Poot, Antonius J; den Elzen, Wendy P J; Blom, Jeanet W; Gussekloo, Jacobijn

2014-01-01

Satisfaction is widely used to evaluate and direct delivery of medical care; a complicated relationship exists between patient satisfaction, morbidity and age. This study investigates the relationships between complexity of health problems and level of patient satisfaction of older persons with their general practitioner (GP) and practice. This study is embedded in the ISCOPE (Integrated Systematic Care for Older Persons) study. Enlisted patients aged ≥75 years from 59 practices received a written questionnaire to screen for complex health problems (somatic, functional, psychological and social). For 2664 randomly chosen respondents (median age 82 years; 68% female) information was collected on level of satisfaction (satisfied, neutral, dissatisfied) with their GP and general practice, and demographic and clinical characteristics including complexity of health problems. Of all participants, 4% was dissatisfied with their GP care, 59% neutral and 37% satisfied. Between these three categories no differences were observed in age, gender, country of birth or education level. The percentage of participants dissatisfied with their GP care increased from 0.4% in those with 0 problem domains to 8% in those with 4 domains, i.e. having complex health problems (ppatient characteristic influencing the perception of care, or whether the care is unable to handle the demands of these patients. Prospective studies are needed to investigate the causal associations between care organization, patient characteristics, indicators of quality, and patient perceptions.

A Kind of Nonlinear Programming Problem Based on Mixed Fuzzy Relation Equations Constraints

Science.gov (United States)

Li, Jinquan; Feng, Shuang; Mi, Honghai

In this work, a kind of nonlinear programming problem with non-differential objective function and under the constraints expressed by a system of mixed fuzzy relation equations is investigated. First, some properties of this kind of optimization problem are obtained. Then, a polynomial-time algorithm for this kind of optimization problem is proposed based on these properties. Furthermore, we show that this algorithm is optimal for the considered optimization problem in this paper. Finally, numerical examples are provided to illustrate our algorithms.

On a Nonstationary Route Problem with Constraints

Directory of Open Access Journals (Sweden)

A. G. Chentsov

2012-01-01

Full Text Available The extremal route problem of permutations under constraints in the form of preceding conditions is investigated. It is supposed that an executer leaves the initial point (the base after which he visits a system of megalopolises (finite goal sets and performs some work on each megalopolis. The cost functions for executor permutations and interior works depend on the “visiting moment” that can correspond to the real time or can also correspond to the natural regular succession (the first visiting, the second visiting, and so on. An economic variant of the widely interpreted dynamic programming method (DPM is constructed. On this basis an optimal computer realized algorithm is constructed. A variant of a greed algorithm is proposed.

An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints

Directory of Open Access Journals (Sweden)

Jinmo Sung

2014-01-01

Full Text Available Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments.

Solving an inverse eigenvalue problem with triple constraints on eigenvalues, singular values, and diagonal elements

Science.gov (United States)

Wu, Sheng-Jhih; Chu, Moody T.

2017-08-01

An inverse eigenvalue problem usually entails two constraints, one conditioned upon the spectrum and the other on the structure. This paper investigates the problem where triple constraints of eigenvalues, singular values, and diagonal entries are imposed simultaneously. An approach combining an eclectic mix of skills from differential geometry, optimization theory, and analytic gradient flow is employed to prove the solvability of such a problem. The result generalizes the classical Mirsky, Sing-Thompson, and Weyl-Horn theorems concerning the respective majorization relationships between any two of the arrays of main diagonal entries, eigenvalues, and singular values. The existence theory fills a gap in the classical matrix theory. The problem might find applications in wireless communication and quantum information science. The technique employed can be implemented as a first-step numerical method for constructing the matrix. With slight modification, the approach might be used to explore similar types of inverse problems where the prescribed entries are at general locations.

Solving an inverse eigenvalue problem with triple constraints on eigenvalues, singular values, and diagonal elements

International Nuclear Information System (INIS)

Wu, Sheng-Jhih; Chu, Moody T

2017-01-01

An inverse eigenvalue problem usually entails two constraints, one conditioned upon the spectrum and the other on the structure. This paper investigates the problem where triple constraints of eigenvalues, singular values, and diagonal entries are imposed simultaneously. An approach combining an eclectic mix of skills from differential geometry, optimization theory, and analytic gradient flow is employed to prove the solvability of such a problem. The result generalizes the classical Mirsky, Sing–Thompson, and Weyl-Horn theorems concerning the respective majorization relationships between any two of the arrays of main diagonal entries, eigenvalues, and singular values. The existence theory fills a gap in the classical matrix theory. The problem might find applications in wireless communication and quantum information science. The technique employed can be implemented as a first-step numerical method for constructing the matrix. With slight modification, the approach might be used to explore similar types of inverse problems where the prescribed entries are at general locations. (paper)

A balancing domain decomposition method by constraints for advection-diffusion problems

Energy Technology Data Exchange (ETDEWEB)

Tu, Xuemin; Li, Jing

2008-12-10

The balancing domain decomposition methods by constraints are extended to solving nonsymmetric, positive definite linear systems resulting from the finite element discretization of advection-diffusion equations. A pre-conditioned GMRES iteration is used to solve a Schur complement system of equations for the subdomain interface variables. In the preconditioning step of each iteration, a partially sub-assembled finite element problem is solved. A convergence rate estimate for the GMRES iteration is established, under the condition that the diameters of subdomains are small enough. It is independent of the number of subdomains and grows only slowly with the subdomain problem size. Numerical experiments for several two-dimensional advection-diffusion problems illustrate the fast convergence of the proposed algorithm.

Applying ant colony optimization metaheuristic to solve forest transportation planning problems with side constraints

Science.gov (United States)

Marco A. Contreras; Woodam Chung; Greg Jones

2008-01-01

Forest transportation planning problems (FTPP) have evolved from considering only the financial aspects of timber management to more holistic problems that also consider the environmental impacts of roads. These additional requirements have introduced side constraints, making FTPP larger and more complex. Mixed-integer programming (MIP) has been used to solve FTPP, but...

Calculation of Pareto-optimal solutions to multiple-objective problems using threshold-of-acceptability constraints

Science.gov (United States)

Giesy, D. P.

1978-01-01

A technique is presented for the calculation of Pareto-optimal solutions to a multiple-objective constrained optimization problem by solving a series of single-objective problems. Threshold-of-acceptability constraints are placed on the objective functions at each stage to both limit the area of search and to mathematically guarantee convergence to a Pareto optimum.

A Solution Approach to Assembly Line Balancing Problem With Task Related Constraints and an Application At An Enterprise

Directory of Open Access Journals (Sweden)

Serkan Altuntaş

2010-01-01

Full Text Available Occasionally certain tasks in an assembly line balancing problem are required to be kept together due to some specific reasons. These tasks are attained to the same work stations. Such problems are called as 'Assembly Line Balancing Problem with Task Related Constraints (ALBTRC'. Certain situations like awkward product construction, simultaneous operations or specific requirements leading to zoning and positional constraints like utilization of common resources as tools, jigs and fixtures are implemented thanks to these supplementary constraints. Additionally, materials handling and tooling costs, distances, set-up and lead times are also reduced. Literature on ALBTRC seems quite rare compared to Classical Line Balancing papers, although ALBTRC is one of the common real life balancing problems. This study aimed to develop and implement a novel line balancing method for a manufacturing concern where known methods are impractical to employ due to some specific positional constraints. 'Largest Candidate Method' known as a simple but effective tool is modified for this purpose first. Then a thorough 'method and time study' is conducted to get the necessary data to utilize that method. As a result, more efficient alternatives are generated and presented to decision maker.

Constraint Differentiation

DEFF Research Database (Denmark)

Mödersheim, Sebastian Alexander; Basin, David; Viganò, Luca

2010-01-01

We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation works by eliminating certain kinds of redundancies that arise in the search space when using constraints to represent...... results show that constraint differentiation substantially reduces search and considerably improves the performance of OFMC, enabling its application to a wider class of problems....

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

Science.gov (United States)

Wang, Zhihui; Rubin, Nicholas; Rieffel, Eleanor G.

2018-01-01

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

A Bee Colony Optimization Approach for Mixed Blocking Constraints Flow Shop Scheduling Problems

Directory of Open Access Journals (Sweden)

Mostafa Khorramizadeh

2015-01-01

Full Text Available The flow shop scheduling problems with mixed blocking constraints with minimization of makespan are investigated. The Taguchi orthogonal arrays and path relinking along with some efficient local search methods are used to develop a metaheuristic algorithm based on bee colony optimization. In order to compare the performance of the proposed algorithm, two well-known test problems are considered. Computational results show that the presented algorithm has comparative performance with well-known algorithms of the literature, especially for the large sized problems.

Constraint qualifications and optimality conditions for optimization problems with cardinality constraints

Czech Academy of Sciences Publication Activity Database

Červinka, Michal; Kanzow, Ch.; Schwartz, A.

2016-01-01

Roč. 160, č. 1 (2016), s. 353-377 ISSN 0025-5610 R&D Projects: GA ČR GAP402/12/1309; GA ČR GA15-00735S Institutional support: RVO:67985556 Keywords : Cardinality constraints * Constraint qualifications * Optimality conditions * KKT conditions * Strongly stationary points Subject RIV: BA - General Mathematics Impact factor: 2.446, year: 2016 http://library.utia.cas.cz/separaty/2016/MTR/cervinka-0461165.pdf

Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Optimization Problem with Entropy Diversity Constraint

Directory of Open Access Journals (Sweden)

Nebojsa Bacanin

2014-01-01

portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results.

Tabu search approaches for the multi-level warehouse layout problem with adjacency constraints

Science.gov (United States)

Zhang, G. Q.; Lai, K. K.

2010-08-01

A new multi-level warehouse layout problem, the multi-level warehouse layout problem with adjacency constraints (MLWLPAC), is investigated. The same item type is required to be located in adjacent cells, and horizontal and vertical unit travel costs are product dependent. An integer programming model is proposed to formulate the problem, which is NP hard. Along with a cube-per-order index policy based heuristic, the standard tabu search (TS), greedy TS, and dynamic neighbourhood based TS are presented to solve the problem. The computational results show that the proposed approaches can reduce the transportation cost significantly.

Comparing Mixed & Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems

Directory of Open Access Journals (Sweden)

Renata Melo e Silva de Oliveira

2015-03-01

Full Text Available Scheduling is a key factor for operations management as well as for business success. From industrial Job-shop Scheduling problems (JSSP, many optimization challenges have emerged since de 1960s when improvements have been continuously required such as bottlenecks allocation, lead-time reductions and reducing response time to requests.  With this in perspective, this work aims to discuss 3 different optimization models for minimizing Makespan. Those 3 models were applied on 17 classical problems of examples JSSP and produced different outputs.  The first model resorts on Mixed and Integer Programming (MIP and it resulted on optimizing 60% of the studied problems. The other models were based on Constraint Programming (CP and approached the problem in two different ways: a model CP1 is a standard IBM algorithm whereof restrictions have an interval structure that fail to solve 53% of the proposed instances, b Model CP-2 approaches the problem with disjunctive constraints and optimized 88% of the instances. In this work, each model is individually analyzed and then compared considering: i Optimization success performance, ii Computational processing time, iii Greatest Resource Utilization and, iv Minimum Work-in-process Inventory. Results demonstrated that CP-2 presented best results on criteria i and ii, but MIP was superior on criteria iii and iv and those findings are discussed at the final section of this work.

Job Satisfaction And Family Happiness : The Part-Time Work Problem

OpenAIRE

Booth, A.L.; van Ours, J.C.

2007-01-01

Using fixed effects ordered logit estimation, we investigate the relationship between part-time work and working hours satisfaction; job satisfaction; and life satisfaction. We account for interdependence within the family using data on partnered men and women from the British Household Panel Survey. We find that men have the highest hours-of-work satisfaction if they work full-time without overtime hours but neither their job satisfaction nor their life satisfaction are affected by how many ...

Judgement of Design Scheme Based on Flexible Constraint in ICAD

Institute of Scientific and Technical Information of China (English)

无

2000-01-01

The conception of flexible constraint is proposed in the paper. The solution of flexible constraint is in special range, and maybe different in different instances of same design scheme. The paper emphasis on how to evaluate and optimize a design scheme with flexible constraints based on the satisfaction degree function defined on flexible constraints. The conception of flexible constraint is used to solve constraint conflict and design optimization in complicated constraint-based assembly design by the PFM parametrization assembly design system. An instance of gear-box design is used for verifying optimization method.

Constraint-based reachability

Directory of Open Access Journals (Sweden)

Arnaud Gotlieb

2013-02-01

Full Text Available Iterative imperative programs can be considered as infinite-state systems computing over possibly unbounded domains. Studying reachability in these systems is challenging as it requires to deal with an infinite number of states with standard backward or forward exploration strategies. An approach that we call Constraint-based reachability, is proposed to address reachability problems by exploring program states using a constraint model of the whole program. The keypoint of the approach is to interpret imperative constructions such as conditionals, loops, array and memory manipulations with the fundamental notion of constraint over a computational domain. By combining constraint filtering and abstraction techniques, Constraint-based reachability is able to solve reachability problems which are usually outside the scope of backward or forward exploration strategies. This paper proposes an interpretation of classical filtering consistencies used in Constraint Programming as abstract domain computations, and shows how this approach can be used to produce a constraint solver that efficiently generates solutions for reachability problems that are unsolvable by other approaches.

Level of satisfaction of older persons with their general practitioner and practice: role of complexity of health problems.

Directory of Open Access Journals (Sweden)

Antonius J Poot

Full Text Available BACKGROUND: Satisfaction is widely used to evaluate and direct delivery of medical care; a complicated relationship exists between patient satisfaction, morbidity and age. This study investigates the relationships between complexity of health problems and level of patient satisfaction of older persons with their general practitioner (GP and practice. METHODS AND FINDINGS: This study is embedded in the ISCOPE (Integrated Systematic Care for Older Persons study. Enlisted patients aged ≥75 years from 59 practices received a written questionnaire to screen for complex health problems (somatic, functional, psychological and social. For 2664 randomly chosen respondents (median age 82 years; 68% female information was collected on level of satisfaction (satisfied, neutral, dissatisfied with their GP and general practice, and demographic and clinical characteristics including complexity of health problems. Of all participants, 4% was dissatisfied with their GP care, 59% neutral and 37% satisfied. Between these three categories no differences were observed in age, gender, country of birth or education level. The percentage of participants dissatisfied with their GP care increased from 0.4% in those with 0 problem domains to 8% in those with 4 domains, i.e. having complex health problems (p<0.001. Per additional health domain with problems, the risk of being dissatisfied increased 1.7 times (95% CI 1.4-2.14; p<0.001. This was independent of age, gender, and demographic and clinical parameters (adjusted OR 1.4, 95% CI 1.1-1.8; p = 0.021. CONCLUSION: In older persons, dissatisfaction with general practice is strongly correlated with rising complexity of health problems, independent of age, demographic and clinical parameters. It remains unclear whether complexity of health problems is a patient characteristic influencing the perception of care, or whether the care is unable to handle the demands of these patients. Prospective studies are needed to

Two novel classes of solvable many-body problems of goldfish type with constraints

Energy Technology Data Exchange (ETDEWEB)

Calogero, F [Dipartimento di Fisica, Universita di Roma ' La Sapienza' , 00185 Rome (Italy); Gomez-Ullate, D [Departamento de Fisica Teorica II, Universidad Complutense, 28040 Madrid (Spain)

2007-05-18

Two novel classes of many-body models with nonlinear interactions 'of goldfish type' are introduced. They are solvable provided the initial data satisfy a single constraint (in one case; in the other, two constraints), i.e., for such initial data the solution of their initial-value problem can be achieved via algebraic operations, such as finding the eigenvalues of given matrices or equivalently the zeros of known polynomials. Entirely isochronous versions of some of these models are also exhibited, i.e., versions of these models whose nonsingular solutions are all completely periodic with the same period.

Convex Minimization with Constraints of Systems of Variational Inequalities, Mixed Equilibrium, Variational Inequality, and Fixed Point Problems

Directory of Open Access Journals (Sweden)

Lu-Chuan Ceng

2014-01-01

Full Text Available We introduce and analyze one iterative algorithm by hybrid shrinking projection method for finding a solution of the minimization problem for a convex and continuously Fréchet differentiable functional, with constraints of several problems: finitely many generalized mixed equilibrium problems, finitely many variational inequalities, the general system of variational inequalities and the fixed point problem of an asymptotically strict pseudocontractive mapping in the intermediate sense in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another iterative algorithm by hybrid shrinking projection method for finding a fixed point of infinitely many nonexpansive mappings with the same constraints, and derive its strong convergence under mild assumptions.

A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints

International Nuclear Information System (INIS)

Jian Jinbao; Li Jianling; Mo Xingde

2006-01-01

This paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998),5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported

A note on existence of mixed solutions to equilibrium problems with equilibrium constraints

Czech Academy of Sciences Publication Activity Database

Červinka, Michal

2007-01-01

Roč. 2007, č. 24 (2007), s. 27-44 ISSN 1212-074X R&D Projects: GA AV ČR IAA1030405 Institutional research plan: CEZ:AV0Z10750506 Keywords : equilibrium problems with equilibrium constraints * variational analysis * mixed strategy Subject RIV: BA - General Mathematics

Multistep Hybrid Iterations for Systems of Generalized Equilibria with Constraints of Several Problems

Directory of Open Access Journals (Sweden)

Lu-Chuan Ceng

2014-01-01

Full Text Available We first introduce and analyze one multistep iterative algorithm by hybrid shrinking projection method for finding a solution of the system of generalized equilibria with constraints of several problems: the generalized mixed equilibrium problem, finitely many variational inclusions, the minimization problem for a convex and continuously Fréchet differentiable functional, and the fixed-point problem of an asymptotically strict pseudocontractive mapping in the intermediate sense in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another multistep iterative algorithm involving no shrinking projection method and derive its weak convergence under mild assumptions.

An Analysis of the Network Selection Problem for Heterogeneous Environments with User-Operator Joint Satisfaction and Multi-RAT Transmission

Directory of Open Access Journals (Sweden)

J. J. Escudero-Garzás

2017-01-01

Full Text Available The trend in wireless networks is that several wireless radio access technologies (RATs coexist in the same area, forming heterogeneous networks in which the users may connect to any of the available RATs. The problem of associating a user to the most suitable RAT, known as network selection problem (NSP, is of capital importance for the satisfaction of the users in these emerging environments. However, also the satisfaction of the operator is important in this scenario. In this work, we propose that a connection may be served by more than one RAT by using multi-RAT terminals. We formulate the NSP with multiple RAT association based on utility functions that take into consideration both user’s satisfaction and provider’s satisfaction. As users are characterized according to their expected quality of service, our results exhaustively analyze the influence of the user’s profile, along with the network topology and the type of applications served.

Equilibrium problems with complementarity constraints: case study with applications to oligopolistic markets

Czech Academy of Sciences Publication Activity Database

Mordukhovich, B. S.; Outrata, Jiří; Červinka, Michal

2007-01-01

Roč. 56, č. 4 (2007), s. 479-494 ISSN 0233-1934 R&D Projects: GA AV ČR IAA1030405 Institutional research plan: CEZ:AV0Z10750506 Keywords : equilibrium problems with complementarity constraints * multiobjective optimization * necessary optimality conditions * numerical methods * oligopolistic market s Subject RIV: BA - General Mathematics Impact factor: 0.408, year: 2007

The Relationship between Satisfaction with Life, ADHD Symptoms, and Associated Problems among University Students

Science.gov (United States)

Gudjonsson, Gisli H.; Sigurdsson, Jon Fridrik; Eyjolfsdottir, Gudrun Agusta; Smari, Jakob; Young, Susan

2009-01-01

Objective: To ascertain whether ADHD symptoms, and associated problems, are negatively related to subjective well-being. Method: The Satisfaction With Life Scale (SWLS) was completed by 369 university students, along with the Reasoning & Rehabilitation (R&R) ADHD Training Evaluation (RATE), the "Diagnostic and Statistical Manual of…

Peer Victimization among Classmates-Associations with Students' Internalizing Problems, Self-Esteem, and Life Satisfaction.

Science.gov (United States)

Låftman, Sara B; Modin, Bitte

2017-10-13

Bullying is a major problem in schools and a large number of studies have demonstrated that victims have a high excess risk of poor mental health. It may however also affect those who are not directly victimized by peers. The present study investigates whether peer victimization among classmates is linked to internalizing problems, self-esteem, and life satisfaction at the individual level, when the student's own victimization has been taken into account. The data were derived from the first wave of the Swedish part of Youth in Europe Study (YES!), including information on 4319 students in grade 8 (14-15 years of age) distributed across 242 classes. Results from multilevel analyses show a significant association between classes with a high proportion of students being victimized and higher levels of internalizing problems, lower self-esteem, and lower life satisfaction at the student level. This association holds when the student's own victimization has been taken into account. This suggests that peer victimization negatively affects those who are directly exposed, as well as their classmates. We conclude that efficient methods and interventions to reduce bullying in school are likely to benefit not only those who are victimized, but all students.

Financial Management and Financial Problems As They Relate to Marital Satisfaction in Early Marriage

OpenAIRE

Kerkmann, Barbara C.

1998-01-01

The financial management habits and perceptions of young married couples were examined, as well as their financial problems and perceptions of their problems' magnitude in an attempt to assess the relationship of these financial factors to marital satisfaction. A survey was delivered to 604 residents of family student housing at Utah State University. The spouse who predominantly handled family finances was asked to complete the survey. By using an incentive for completing the survey, a respo...

Problems and constraints in Philippine municipal fisheries: The case of San Miguel Bay, Camarines Sur

Science.gov (United States)

Lim, Cristina P.; Matsuda, Yoshiaki; Shigemi, Yukio

1995-11-01

The Philippine fisheries accounted for 3.7% of the gross national product at current prices. The sector employed about 990,872 persons. Of the divisions comprising the industry, municipal fisheries continued to contribute the largest share of fish production. However, the sector is beset with problems, many of which are best examplified by the case of San Miguel Bay (SMB). This paper presents the problems and constraints confronting SMB, a common property resource. This bay's open access condition has led to various problems, such as declining fishery resources, depressed socioeconomic conditions, illegal fishing, increasing population, and conflict among resource users. A poor marketing system, low level of fishing technology, fishermen's noncompliance and authorities' lax enforcement of rules and regulations, as well as lack of alternative sources of income further characterize the condition in SMB. Establishment of fishing rights, improvement of the marketing system, provision of alternative sources of income, and improvement of fishing technology were some of the solutions suggested. One major constraint, however, is financial, Comanagement complemented with other management tools has been proposed in addressing the problems in SMB.

Detection of Common Problems in Real-Time and Multicore Systems Using Model-Based Constraints

Directory of Open Access Journals (Sweden)

Raphaël Beamonte

2016-01-01

Full Text Available Multicore systems are complex in that multiple processes are running concurrently and can interfere with each other. Real-time systems add on top of that time constraints, making results invalid as soon as a deadline has been missed. Tracing is often the most reliable and accurate tool available to study and understand those systems. However, tracing requires that users understand the kernel events and their meaning. It is therefore not very accessible. Using modeling to generate source code or represent applications’ workflow is handy for developers and has emerged as part of the model-driven development methodology. In this paper, we propose a new approach to system analysis using model-based constraints, on top of userspace and kernel traces. We introduce the constraints representation and how traces can be used to follow the application’s workflow and check the constraints we set on the model. We then present a number of common problems that we encountered in real-time and multicore systems and describe how our model-based constraints could have helped to save time by automatically identifying the unwanted behavior.

Strict Constraint Feasibility in Analysis and Design of Uncertain Systems

Science.gov (United States)

Crespo, Luis G.; Giesy, Daniel P.; Kenny, Sean P.

2006-01-01

This paper proposes a methodology for the analysis and design optimization of models subject to parametric uncertainty, where hard inequality constraints are present. Hard constraints are those that must be satisfied for all parameter realizations prescribed by the uncertainty model. Emphasis is given to uncertainty models prescribed by norm-bounded perturbations from a nominal parameter value, i.e., hyper-spheres, and by sets of independently bounded uncertain variables, i.e., hyper-rectangles. These models make it possible to consider sets of parameters having comparable as well as dissimilar levels of uncertainty. Two alternative formulations for hyper-rectangular sets are proposed, one based on a transformation of variables and another based on an infinity norm approach. The suite of tools developed enable us to determine if the satisfaction of hard constraints is feasible by identifying critical combinations of uncertain parameters. Since this practice is performed without sampling or partitioning the parameter space, the resulting assessments of robustness are analytically verifiable. Strategies that enable the comparison of the robustness of competing design alternatives, the approximation of the robust design space, and the systematic search for designs with improved robustness characteristics are also proposed. Since the problem formulation is generic and the solution methods only require standard optimization algorithms for their implementation, the tools developed are applicable to a broad range of problems in several disciplines.

Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction

Science.gov (United States)

Baniamerian, Ali; Bashiri, Mahdi; Zabihi, Fahime

2018-03-01

Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfaction. In this paper, we introduce a vehicle routing and scheduling problem with cross-docking and time windows in a three-echelon supply chain that considers customer satisfaction. A set of homogeneous vehicles collect products from suppliers and after consolidation process in the cross-dock, immediately deliver them to customers. A mixed integer linear programming model is presented for this problem to minimize transportation cost and early/tardy deliveries with scheduling of inbound and outbound vehicles to increase customer satisfaction. A two phase genetic algorithm (GA) is developed for the problem. For investigating the performance of the algorithm, it was compared with exact and lower bound solutions in small and large-size instances, respectively. Results show that there are at least 86.6% customer satisfaction by the proposed method, whereas customer satisfaction in the classical model is at most 33.3%. Numerical examples results show that the proposed two phase algorithm could achieve optimal solutions in small-size instances. Also in large-size instances, the proposed two phase algorithm could achieve better solutions with less gap from the lower bound in less computational time in comparison with the classic GA.

DDeveloping and solving a bi-objective joint replenishment problem under storing space constraint

Directory of Open Access Journals (Sweden)

ommolbanin yousefi

2011-03-01

Full Text Available In this research, a bi-objective joint replenishment problem has been developed and solved with the assumption of one restricted resource. The proposed model has a storing space constraint and tries to optimize two objective functions simultaneously. They include minimizing annual holding and setup costs and minimizing annual inventory investment. Then, for solving this problem, a multi-objective genetic algorithm (MOGA has been developed. In order to analyze the algorithm efficiency, its performance has been examined in solving 1600 randomly produced problems using parameters extracted from literature. The findings imply that the proposed algorithm is capable of producing a good set of Pareto optimal solutions. Finally, the application of the problem solving approach and the findings of the proposed algorithm have been illustrated for a special problem, which has been randomly produced.

Robust Model Predictive Control Using Linear Matrix Inequalities for the Treatment of Asymmetric Output Constraints

Directory of Open Access Journals (Sweden)

Mariana Santos Matos Cavalca

2012-01-01

Full Text Available One of the main advantages of predictive control approaches is the capability of dealing explicitly with constraints on the manipulated and output variables. However, if the predictive control formulation does not consider model uncertainties, then the constraint satisfaction may be compromised. A solution for this inconvenience is to use robust model predictive control (RMPC strategies based on linear matrix inequalities (LMIs. However, LMI-based RMPC formulations typically consider only symmetric constraints. This paper proposes a method based on pseudoreferences to treat asymmetric output constraints in integrating SISO systems. Such technique guarantees robust constraint satisfaction and convergence of the state to the desired equilibrium point. A case study using numerical simulation indicates that satisfactory results can be achieved.

Peer Victimization among Classmates—Associations with Students’ Internalizing Problems, Self-Esteem, and Life Satisfaction

Directory of Open Access Journals (Sweden)

Sara B. Låftman

2017-10-01

Full Text Available Bullying is a major problem in schools and a large number of studies have demonstrated that victims have a high excess risk of poor mental health. It may however also affect those who are not directly victimized by peers. The present study investigates whether peer victimization among classmates is linked to internalizing problems, self-esteem, and life satisfaction at the individual level, when the student’s own victimization has been taken into account. The data were derived from the first wave of the Swedish part of Youth in Europe Study (YES!, including information on 4319 students in grade 8 (14–15 years of age distributed across 242 classes. Results from multilevel analyses show a significant association between classes with a high proportion of students being victimized and higher levels of internalizing problems, lower self-esteem, and lower life satisfaction at the student level. This association holds when the student’s own victimization has been taken into account. This suggests that peer victimization negatively affects those who are directly exposed, as well as their classmates. We conclude that efficient methods and interventions to reduce bullying in school are likely to benefit not only those who are victimized, but all students.

A numerical approach to weak Pareto solutions to equilibrium problems with equilibrium constraints

Czech Academy of Sciences Publication Activity Database

Červinka, Michal

2006-01-01

Roč. 57, č. 7 (2006), s. 14-17 ISSN 1335-3632. [ISCAM 2006. International Conference in Applied Mathematics for undergraduate and graduate students. Bratislava, 07.04.2006-08.04.2006] Institutional research plan: CEZ:AV0Z10750506 Keywords : equilibrium problems with complementarity constraints * multiobjective optimization * variational analysis Subject RIV: BD - Theory of Information

A theoretical approach to the problem of dose-volume constraint estimation and their impact on the dose-volume histogram selection

International Nuclear Information System (INIS)

Schinkel, Colleen; Stavrev, Pavel; Stavreva, Nadia; Fallone, B. Gino

2006-01-01

This paper outlines a theoretical approach to the problem of estimating and choosing dose-volume constraints. Following this approach, a method of choosing dose-volume constraints based on biological criteria is proposed. This method is called ''reverse normal tissue complication probability (NTCP) mapping into dose-volume space'' and may be used as a general guidance to the problem of dose-volume constraint estimation. Dose-volume histograms (DVHs) are randomly simulated, and those resulting in clinically acceptable levels of complication, such as NTCP of 5±0.5%, are selected and averaged producing a mean DVH that is proven to result in the same level of NTCP. The points from the averaged DVH are proposed to serve as physical dose-volume constraints. The population-based critical volume and Lyman NTCP models with parameter sets taken from literature sources were used for the NTCP estimation. The impact of the prescribed value of the maximum dose to the organ, D max , on the averaged DVH and the dose-volume constraint points is investigated. Constraint points for 16 organs are calculated. The impact of the number of constraints to be fulfilled based on the likelihood that a DVH satisfying them will result in an acceptable NTCP is also investigated. It is theoretically proven that the radiation treatment optimization based on physical objective functions can sufficiently well restrict the dose to the organs at risk, resulting in sufficiently low NTCP values through the employment of several appropriate dose-volume constraints. At the same time, the pure physical approach to optimization is self-restrictive due to the preassignment of acceptable NTCP levels thus excluding possible better solutions to the problem

Job Satisfaction And Family Happiness : The Part-Time Work Problem

NARCIS (Netherlands)

Booth, A.L.; van Ours, J.C.

2007-01-01

Using fixed effects ordered logit estimation, we investigate the relationship between part-time work and working hours satisfaction; job satisfaction; and life satisfaction. We account for interdependence within the family using data on partnered men and women from the British Household Panel

Analysis of factors affecting satisfaction level on problem based learning approach using structural equation modeling

Science.gov (United States)

Hussain, Nur Farahin Mee; Zahid, Zalina

2014-12-01

Nowadays, in the job market demand, graduates are expected not only to have higher performance in academic but they must also be excellent in soft skill. Problem-Based Learning (PBL) has a number of distinct advantages as a learning method as it can deliver graduates that will be highly prized by industry. This study attempts to determine the satisfaction level of engineering students on the PBL Approach and to evaluate their determinant factors. The Structural Equation Modeling (SEM) was used to investigate how the factors of Good Teaching Scale, Clear Goals, Student Assessment and Levels of Workload affected the student satisfaction towards PBL approach.

A hierarchical method for structural topology design problems with local stress and displacement constraints

DEFF Research Database (Denmark)

Stolpe, Mathias; Stidsen, Thomas K.

2005-01-01

In this paper we present a hierarchical optimization method for finding feasible true 0-1 solutions to finite element based topology design problems. The topology design problems are initially modeled as non-convex mixed 0-1 programs. The hierarchical optimization method is applied to the problem...... and then successively refined as needed. At each level of design mesh refinement, a neighborhood optimization method is used to solve the problem considered. The non-convex topology design problems are equivalently reformulated as convex all-quadratic mixed 0-1 programs. This reformulation enables the use of methods...... of minimizing the weight of a structure subject to displacement and local design-dependent stress constraints. The method iteratively solves a sequence of problems of increasing size of the same type as the original problem. The problems are defined on a design mesh which is initially coarse...

Perceived child behaviour problems, parenting stress, and marital satisfaction: comparison of new arrival and local parents of preschool children in Hong Kong.

Science.gov (United States)

Leung, Shirley S L; Leung, Cynthia; Chan, Ruth

2007-10-01

To compare parental perception of child behaviour problems, parenting stress, and marital satisfaction in new arrival and local parents. Cross-sectional survey; semi-structured interview. Maternal and Child Health Centres, social service centres, preschools. Parents of preschool children, including new arrival parents and local parents. Child behaviour problems, parenting stress, and marital satisfaction. After controlling for socio-economic factors, new arrival parents were more troubled by their children's behaviour problems and their parent-child interactions were more dysfunctional than those of local parents. There were no differences in parent-reported severity of child behaviour problems, parental distress, and marital satisfaction. New arrival parents reported difficulties in adapting to the new living environment and lack of social support. New arrival parents were more troubled by their children's behaviour, and their parent-child interactions were more dysfunctional than those of local parents. These might in part be related to their settlement difficulties. Parenting programmes should address their specific settlement needs.

Updating QR factorization procedure for solution of linear least squares problem with equality constraints.

Science.gov (United States)

Zeb, Salman; Yousaf, Muhammad

2017-01-01

In this article, we present a QR updating procedure as a solution approach for linear least squares problem with equality constraints. We reduce the constrained problem to unconstrained linear least squares and partition it into a small subproblem. The QR factorization of the subproblem is calculated and then we apply updating techniques to its upper triangular factor R to obtain its solution. We carry out the error analysis of the proposed algorithm to show that it is backward stable. We also illustrate the implementation and accuracy of the proposed algorithm by providing some numerical experiments with particular emphasis on dense problems.

Constraints on decay plus oscillation solutions of the solar neutrino problem

Science.gov (United States)

Joshipura, Anjan S.; Massó, Eduard; Mohanty, Subhendra

2002-12-01

We examine the constraints on the nonradiative decay of neutrinos from the observations of solar neutrino experiments. The standard oscillation hypothesis among three neutrinos solves the solar and atmospheric neutrino problems. The decay of a massive neutrino mixed with the electron neutrino results in the depletion of the solar neutrino flux. We introduce neutrino decay in the oscillation hypothesis and demand that decay does not spoil the successful explanation of solar and atmospheric observations. We obtain a lower bound on the ratio of the lifetime over the mass of ν2, τ2/m2>22.7 s/MeV for the Mikheyev-Smirnov-Wolfenstein solution of the solar neutrino problem and τ2/m2>27.8 s/MeV for the vacuum oscillation solution (at 99% C.L.).

An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints

NARCIS (Netherlands)

Tarim, S.A.; Ozen, U.; Dogru, M.K.; Rossi, R.

2011-01-01

We provide an efficient computational approach to solve the mixed integer programming (MIP) model developed by Tarim and Kingsman [8] for solving a stochastic lot-sizing problem with service level constraints under the static–dynamic uncertainty strategy. The effectiveness of the proposed method

Students' satisfaction to hybrid problem-based learning format for basic life support/advanced cardiac life support teaching.

Science.gov (United States)

Chilkoti, Geetanjali; Mohta, Medha; Wadhwa, Rachna; Saxena, Ashok Kumar; Sharma, Chhavi Sarabpreet; Shankar, Neelima

2016-11-01

Students are exposed to basic life support (BLS) and advanced cardiac life support (ACLS) training in the first semester in some medical colleges. The aim of this study was to compare students' satisfaction between lecture-based traditional method and hybrid problem-based learning (PBL) in BLS/ACLS teaching to undergraduate medical students. We conducted a questionnaire-based, cross-sectional survey among 118 1 st -year medical students from a university medical college in the city of New Delhi, India. We aimed to assess the students' satisfaction between lecture-based and hybrid-PBL method in BLS/ACLS teaching. Likert 5-point scale was used to assess students' satisfaction levels between the two teaching methods. Data were collected and scores regarding the students' satisfaction levels between these two teaching methods were analysed using a two-sided paired t -test. Most students preferred hybrid-PBL format over traditional lecture-based method in the following four aspects; learning and understanding, interest and motivation, training of personal abilities and being confident and satisfied with the teaching method ( P < 0.05). Implementation of hybrid-PBL format along with the lecture-based method in BLS/ACLS teaching provided high satisfaction among undergraduate medical students.

Academic satisfaction among traditional and problem based learning medical students. A comparative study.

Science.gov (United States)

Albarrak, Ahmed I; Mohammed, Rafiuddin; Abalhassan, Mohammed F; Almutairi, Nasser K

2013-11-01

To evaluate the academic satisfaction and importance among traditional learning (TL) and problem based learning (PBL) medical students, and to further evaluate the areas of concern in the academic education from the student's point of view. A cross sectional study was conducted at the College of Medicine, King Saud University, Riyadh, Kingdom of Saudi Arabia from May to June 2012. The survey questionnaires were self-administered and consisted of mainly 6 sections: teaching, learning, supervision, course organization, information technology (IT) facilities, and development of skills. A total of 92 TL (males: 66 [71.7%]; females: 26 [28.3%]), and 108 PBL (males: 84 [77.8%]; females: 24 [22.1%]), with a mean age of 21.3 +/- 1.3 (TL), and 20.7 +/- 1.0 (PBL) were included in the study. The overall satisfaction rate was higher in the PBL students when compared with TL students in: teaching (84.7%/60.3%); learning (81.4%/64.5%); supervision (80%/51.5%); course organization (69.3%/46.9%); IT facilities (74.0%/58.9%); and development of skills (79.1%/53.9%). There was statistical significance difference in academic satisfaction comparing both groups of students (pdisadvantages of the traditional system. The PBL was potentially considered a successful method in enhancing medical education.

Evaluating Distributed Timing Constraints

DEFF Research Database (Denmark)

Kristensen, C.H.; Drejer, N.

1994-01-01

In this paper we describe a solution to the problem of implementing time-optimal evaluation of timing constraints in distributed real-time systems.......In this paper we describe a solution to the problem of implementing time-optimal evaluation of timing constraints in distributed real-time systems....

The analytic solution of the firm's cost-minimization problem with box constraints and the Cobb-Douglas model

Science.gov (United States)

Bayón, L.; Grau, J. M.; Ruiz, M. M.; Suárez, P. M.

2012-12-01

One of the most well-known problems in the field of Microeconomics is the Firm's Cost-Minimization Problem. In this paper we establish the analytical expression for the cost function using the Cobb-Douglas model and considering maximum constraints for the inputs. Moreover we prove that it belongs to the class C1.

Production constraints and perceived marketing problems of stock ...

African Journals Online (AJOL)

In an endeavour to improve the livestock production and particularly the marketing of livestock in the Northern Communal Areas of Namibia, this study analyses the perception of livestock farmers in this regard. The low off-take percentage is the most serious production constraint, but marketing, although a constraint, is not ...

Generalized stochastic target problems for pricing and partial hedging under loss constraints - Application in optimal book liquidation

OpenAIRE

Bouchard , Bruno; Dang , Ngoc Minh

2013-01-01

International audience; We consider a singular with state constraints version of the stochastic target problems studied in Soner and Touzi (2002) and more recently Bouchard, Elie and Touzi (2008), among others. This provides a general framework for the pricing of contingent claims under risk constraints. Our extended version perfectly suits to market models with proportional transaction costs and to order book liquidation issues. Our main result is a PDE characterization of the associated pri...

Statistical surrogate model based sampling criterion for stochastic global optimization of problems with constraints

Energy Technology Data Exchange (ETDEWEB)

Cho, Su Gil; Jang, Jun Yong; Kim, Ji Hoon; Lee, Tae Hee [Hanyang University, Seoul (Korea, Republic of); Lee, Min Uk [Romax Technology Ltd., Seoul (Korea, Republic of); Choi, Jong Su; Hong, Sup [Korea Research Institute of Ships and Ocean Engineering, Daejeon (Korea, Republic of)

2015-04-15

Sequential surrogate model-based global optimization algorithms, such as super-EGO, have been developed to increase the efficiency of commonly used global optimization technique as well as to ensure the accuracy of optimization. However, earlier studies have drawbacks because there are three phases in the optimization loop and empirical parameters. We propose a united sampling criterion to simplify the algorithm and to achieve the global optimum of problems with constraints without any empirical parameters. It is able to select the points located in a feasible region with high model uncertainty as well as the points along the boundary of constraint at the lowest objective value. The mean squared error determines which criterion is more dominant among the infill sampling criterion and boundary sampling criterion. Also, the method guarantees the accuracy of the surrogate model because the sample points are not located within extremely small regions like super-EGO. The performance of the proposed method, such as the solvability of a problem, convergence properties, and efficiency, are validated through nonlinear numerical examples with disconnected feasible regions.

A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction

Science.gov (United States)

Tavakkoli-Moghaddam, Reza; Alinaghian, Mehdi; Salamat-Bakhsh, Alireza; Norouzi, Narges

2012-05-01

A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. On the other hand, this satisfaction, which will decrease by increasing the service time, is considered as an important logistic problem for a company. The stochastic time dominated by a probability variable leads to variation of the service time, while it is ignored in classical routing problems. This paper investigates the problem of the increasing service time by using the stochastic time for each tour such that the total traveling time of the vehicles is limited to a specific limit based on a defined probability. Since exact solutions of the vehicle routing problem that belong to the category of NP-hard problems are not practical in a large scale, a hybrid algorithm based on simulated annealing with genetic operators was proposed to obtain an efficient solution with reasonable computational cost and time. Finally, for some small cases, the related results of the proposed algorithm were compared with results obtained by the Lingo 8 software. The obtained results indicate the efficiency of the proposed hybrid simulated annealing algorithm.

Machine tongues. X. Constraint languages

Energy Technology Data Exchange (ETDEWEB)

Levitt, D.

Constraint languages and programming environments will help the designer produce a lucid description of a problem domain, and then of particular situations and problems in it. Early versions of these languages were given descriptions of real world domain constraints, like the operation of electrical and mechanical parts. More recently, the author has automated a vocabulary for describing musical jazz phrases, using constraint language as a jazz improviser. General constraint languages will handle all of these domains. Once the model is in place, the system will connect built-in code fragments and algorithms to answer questions about situations; that is, to help solve problems. Bugs will surface not in code, but in designs themselves. 15 references.

A hierarchical method for discrete structural topology design problems with local stress and displacement constraints

DEFF Research Database (Denmark)

Stolpe, Mathias; Stidsen, Thomas K.

2007-01-01

In this paper, we present a hierarchical optimization method for finding feasible true 0-1 solutions to finite-element-based topology design problems. The topology design problems are initially modelled as non-convex mixed 0-1 programs. The hierarchical optimization method is applied to the problem...... and then successively refined as needed. At each level of design mesh refinement, a neighbourhood optimization method is used to treat the problem considered. The non-convex topology design problems are equivalently reformulated as convex all-quadratic mixed 0-1 programs. This reformulation enables the use of methods...... of minimizing the weight of a structure subject to displacement and local design-dependent stress constraints. The method iteratively treats a sequence of problems of increasing size of the same type as the original problem. The problems are defined on a design mesh which is initially coarse...

Job satisfaction, work ability and life satisfaction among Finnish anaesthesiologists.

Science.gov (United States)

Lindfors, P M; Meretoja, O A; Töyry, S M; Luukkonen, R A; Elovainio, M J; Leino, T J

2007-08-01

Organizational changes and relative growth of the ageing population together with related health problems seem to have increased stressfulness in the work of anaesthesiologists. However, little is known about their work-related well-being and the factors through which their situation could be improved. A cross-sectional questionnaire study of the level and the determinants of job satisfaction, work ability and life satisfaction among female and male anaesthesiologists involved 258 Finnish anaesthesiologists working full time (53% men). The respondents had fairly high job satisfaction, work ability and life satisfaction. No gender differences appeared in these well-being indicators, but their determinants differed by gender. Job satisfaction was only associated with work-related factors in both genders: with job control in women and with job control and organizational justice in men. Work ability correlated with job control and health in both genders and with family life in women. Life satisfaction correlated with individual- and family related factors such as social support and family problems in both genders. Life satisfaction correlated with physical workload in men and health in women. Women had less job control, fewer permanent job contracts and more domestic workload than men. Job control and organizational justice were the most important determinants in work-related well-being. Work-related factors were slightly more important correlates of well-being in males, and family life seems to play a larger role in the well-being of female anaesthesiologists. Organizational and gender issues need to be addressed in order to maintain a high level of well-being among anaesthesiologists.

The Approximability of Learning and Constraint Satisfaction Problems

Science.gov (United States)

2010-10-07

further improved this result to NP ⊆ naPCP1,3/4+²(O(log(n)),3). Around the same time, Zwick [141] showed that naPCP1,5/8(O(log(n)),3)⊆ BPP by giving a...randomized polynomial-time 5/8-approximation algorithm for satisfiable 3CSP. Therefore unless NP⊆ BPP , the best s must be bigger than 5/8. Zwick... BPP [141]. We think that Question 5.1.2 addresses an important missing part in understanding the 3-query PCP systems. In addition, as is mentioned the

Positive Youth Development, Life Satisfaction and Problem Behaviors of Adolescents in Intact and Non-Intact Families in Hong Kong

Directory of Open Access Journals (Sweden)

Daniel Tan Lei Shek

2013-08-01

Full Text Available This study investigated whether Chinese adolescents living in intact and non-intact families differed in their positive development, life satisfaction, and risk behavior. A total of 3,328 Secondary 1 students responded to measures of positive youth development (such as resilience and psychosocial competencies, life satisfaction, and risk behavior (substance abuse, delinquency, Internet addiction, consumption of pornographic materials, self-harm, and behavioral intention to engage in problem behavior. Findings revealed that adolescents growing up in intact families reported higher levels of positive developmental outcomes and life satisfaction as compared with adolescents from non-intact families. Adolescents in non-intact families also reported higher levels of risk behaviors than those growing up in intact families.

Approximate Compilation of Constraints into Multivalued Decision Diagrams

DEFF Research Database (Denmark)

Hadzic, Tarik; Hooker, John N.; O’Sullivan, Barry

2008-01-01

We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex splitting operation that relies on the detection of equivalent paths in the MDD. Although the algorithm is quite gene...

Adaptive fuzzy dynamic surface control of nonlinear systems with input saturation and time-varying output constraints

Science.gov (United States)

Edalati, L.; Khaki Sedigh, A.; Aliyari Shooredeli, M.; Moarefianpour, A.

2018-02-01

This paper deals with the design of adaptive fuzzy dynamic surface control for uncertain strict-feedback nonlinear systems with asymmetric time-varying output constraints in the presence of input saturation. To approximate the unknown nonlinear functions and overcome the problem of explosion of complexity, a Fuzzy logic system is combined with the dynamic surface control in the backstepping design technique. To ensure the output constraints satisfaction, an asymmetric time-varying Barrier Lyapunov Function (BLF) is used. Moreover, by applying the minimal learning parameter technique, the number of the online parameters update for each subsystem is reduced to 2. Hence, the semi-globally uniformly ultimately boundedness (SGUUB) of all the closed-loop signals with appropriate tracking error convergence is guaranteed. The effectiveness of the proposed control is demonstrated by two simulation examples.

Constraint-Muse: A Soft-Constraint Based System for Music Therapy

Science.gov (United States)

Hölzl, Matthias; Denker, Grit; Meier, Max; Wirsing, Martin

Monoidal soft constraints are a versatile formalism for specifying and solving multi-criteria optimization problems with dynamically changing user preferences. We have developed a prototype tool for interactive music creation, called Constraint Muse, that uses monoidal soft constraints to ensure that a dynamically generated melody harmonizes with input from other sources. Constraint Muse provides an easy to use interface based on Nintendo Wii controllers and is intended to be used in music therapy for people with Parkinson’s disease and for children with high-functioning autism or Asperger’s syndrome.

LP Well-Posedness for Bilevel Vector Equilibrium and Optimization Problems with Equilibrium Constraints

OpenAIRE

Khanh, Phan Quoc; Plubtieng, Somyot; Sombut, Kamonrat

2014-01-01

The purpose of this paper is introduce several types of Levitin-Polyak well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints. Base on criterion and characterizations for these types of Levitin-Polyak well-posedness we argue on diameters and Kuratowski’s, Hausdorff’s, or Istrǎtescus measures of noncompactness of approximate solution sets under suitable conditions, and we prove the Levitin-Polyak well-posedness for bilevel vector equilibrium and op...

A hybrid Constraint Programming/Mixed Integer Programming framework for the preventive signaling maintenance crew scheduling problem

DEFF Research Database (Denmark)

Pour, Shahrzad M.; Drake, John H.; Ejlertsen, Lena Secher

2017-01-01

A railway signaling system is a complex and interdependent system which should ensure the safe operation of trains. We introduce and address a mixed integer optimisation model for the preventive signal maintenance crew scheduling problem in the Danish railway system. The problem contains many...... to feed as ‘warm start’ solutions to a Mixed Integer Programming (MIP) solver for further optimisation. We apply the CP/MIP framework to a section of the Danish rail network and benchmark our results against both direct application of a MIP solver and modelling the problem as a Constraint Optimisation...

Declarative Programming with Temporal Constraints, in the Language CG

Directory of Open Access Journals (Sweden)

Lorina Negreanu

2015-01-01

Full Text Available Specifying and interpreting temporal constraints are key elements of knowledge representation and reasoning, with applications in temporal databases, agent programming, and ambient intelligence. We present and formally characterize the language CG, which tackles this issue. In CG, users are able to develop time-dependent programs, in a flexible and straightforward manner. Such programs can, in turn, be coupled with evolving environments, thus empowering users to control the environment’s evolution. CG relies on a structure for storing temporal information, together with a dedicated query mechanism. Hence, we explore the computational complexity of our query satisfaction problem. We discuss previous implementation attempts of CG and introduce a novel prototype which relies on logic programming. Finally, we address the issue of consistency and correctness of CG program execution, using the Event-B modeling approach.

Declarative Programming with Temporal Constraints, in the Language CG.

Science.gov (United States)

Negreanu, Lorina

2015-01-01

Specifying and interpreting temporal constraints are key elements of knowledge representation and reasoning, with applications in temporal databases, agent programming, and ambient intelligence. We present and formally characterize the language CG, which tackles this issue. In CG, users are able to develop time-dependent programs, in a flexible and straightforward manner. Such programs can, in turn, be coupled with evolving environments, thus empowering users to control the environment's evolution. CG relies on a structure for storing temporal information, together with a dedicated query mechanism. Hence, we explore the computational complexity of our query satisfaction problem. We discuss previous implementation attempts of CG and introduce a novel prototype which relies on logic programming. Finally, we address the issue of consistency and correctness of CG program execution, using the Event-B modeling approach.

The assessment of recalled parental rearing behavior and its relationship to life satisfaction and interpersonal problems: a general population study

Directory of Open Access Journals (Sweden)

Hinz Andreas

2009-03-01

Full Text Available Abstract Background Parental rearing behavior is a significant etiological factor for the vulnerability of psychopathology and has been an issue of clinical research for a long time. For this scope instruments are important who asses economically recalled parental rearing behavior in a clinical practice. Therefore, a short German instrument for the assessment of the recalled parental rearing behavior Fragebogen zum erinnerten elterlichen Erziehungsverhalten (FEE was psychometrically evaluated [Recalled Parental Rearing Behavior]. Methods This questionnaire was evaluated in a representative population sample (N = 2.948 in Germany which included 44.2% male and 55.8% female persons with a mean age of M = 47.35 (SD = 17.10, range = 18–92. For the content evaluation of the FEE the Life Satisfaction Questionnaire (FLZ and the Inventory of Interpersonal Problems (IIP was filled out by the participants. Results The FEE scales yielded a good to satisfactory internal consistency and split-half reliability. Its three factors (rejection/punishment, emotional warmth, control/overprotection correlated positively with most of the areas of life satisfaction. Furthermore, positive associations between interpersonal problems and parental rejection and control could be identified. Conclusion The FEE is a short, reliable and valid instrument that can be applied in the clinical practice. In addition, the data proved an association between recalled parental rearing behavior, life satisfaction and interpersonal problems conform to the literature. Finally, specific problems with the retrospective assessment of parental rearing behavior were addressed as well.

University Course Timetabling using Constraint Programming

Directory of Open Access Journals (Sweden)

Hadi Shahmoradi

2017-03-01

Full Text Available University course timetabling problem is a challenging and time-consuming task on the overall structure of timetable in every academic environment. The problem deals with many factors such as the number of lessons, classes, teachers, students and working time, and these are influenced by some hard and soft constraints. The aim of solving this problem is to assign courses and classes to teachers and students, so that the restrictions are held. In this paper, a constraint programming method is proposed to satisfy maximum constraints and expectation, in order to address university timetabling problem. For minimizing the penalty of soft constraints, a cost function is introduced and AHP method is used for calculating its coefficients. The proposed model is tested on department of management, University of Isfahan dataset using OPL on the IBM ILOG CPLEX Optimization Studio platform. A statistical analysis has been conducted and shows the performance of the proposed approach in satisfying all hard constraints and also the satisfying degree of the soft constraints is on maximum desirable level. The running time of the model is less than 20 minutes that is significantly better than the non-automated ones.

Constraint-based scheduling

Science.gov (United States)

Zweben, Monte

1993-01-01

The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

AN INVESTIGATION OF RELATIONSHIP BETWEEN LEADERSHIP STYLES OF HUMAN RESOURCES MANAGER, CREATIVE PROBLEM SOLVING CAPACITY AND CAREER SATISFACTION: AN EMPIRICAL STUDY

Directory of Open Access Journals (Sweden)

Hüseyin YILMAZ

2016-12-01

Full Text Available The aim of this study is the creative problem-solving capacity of the organization with leadership behaviors of human resources managers and employees to examine the relationship between career satisfaction and is tested empirically. Research within the scope of the required data structured questionnaire method, operating in the province of Aydin was obtained from 130 employees working in five star hotels. Democratic leadership style according to the factor analysis, easygoing, participants converter, and releasing autocratic leadership dimensions were determined. According to the analysis, the dependent variable with a significant level of research and positive leadership style has been determined that no relationships. Regression analysis revealed that the leadership of the relationship with the creative problem-solving capacity of democratic leadership in style when found to be stronger than other leadership styles, while the variable describing the career of the employee satisfaction level of the maximum it was concluded that the creative problem-solving capacity of the organization. Research in the context of human resources on the very important for organizations, leadership behavior, creative problem-solving capacity and career satisfaction studies analyzing the relationships between variables it seems to be quite limited. The discovery by analyzing the relationship between the aforementioned variables, can make significant contributions to knowledge in the literature and are expected to form the basis for future research.

Constraint optimization model of a scheduling problem for a robotic arm in automatic systems

DEFF Research Database (Denmark)

Kristiansen, Ewa; Smith, Stephen F.; Kristiansen, Morten

2014-01-01

are characteristics of the painting process application itself. Unlike spot-welding, painting tasks require movement of the entire robot arm. In addition to minimizing intertask duration, the scheduler must strive to maximize painting quality and the problem is formulated as a multi-objective optimization problem....... The scheduling model is implemented as a stand-alone module using constraint programming, and integrated with a larger automatic system. The results of a number of simulation experiments with simple parts are reported, both to characterize the functionality of the scheduler and to illustrate the operation...... of the entire software system for automatic generation of robot programs for painting....

Using Coevolution Genetic Algorithm with Pareto Principles to Solve Project Scheduling Problem under Duration and Cost Constraints

Directory of Open Access Journals (Sweden)

Alexandr Victorovich Budylskiy

2014-06-01

Full Text Available This article considers the multicriteria optimization approach using the modified genetic algorithm to solve the project-scheduling problem under duration and cost constraints. The work contains the list of choices for solving this problem. The multicriteria optimization approach is justified here. The study describes the Pareto principles, which are used in the modified genetic algorithm. We identify the mathematical model of the project-scheduling problem. We introduced the modified genetic algorithm, the ranking strategies, the elitism approaches. The article includes the example.

Exact Solution of a Constraint Optimization Problem for the Thermoelectric Figure of Merit

Directory of Open Access Journals (Sweden)

Wolfgang Seifert

2012-03-01

Full Text Available In the classical theory of thermoelectricity, the performance integrals for a fully self-compatible material depend on the dimensionless figure of merit zT. Usually these integrals are evaluated for constraints z = const. and zT = const., respectively. In this paper we discuss the question from a mathematical point of view whether there is an optimal temperature characteristics of the figure of merit. We solve this isoperimetric variational problem for the best envelope of a family of curves z(TT.

Exact Solution of a Constraint Optimization Problem for the Thermoelectric Figure of Merit.

Science.gov (United States)

Seifert, Wolfgang; Pluschke, Volker

2012-03-21

In the classical theory of thermoelectricity, the performance integrals for a fully self-compatible material depend on the dimensionless figure of merit zT. Usually these integrals are evaluated for constraints z = const. and zT = const., respectively. In this paper we discuss the question from a mathematical point of view whether there is an optimal temperature characteristics of the figure of merit. We solve this isoperimetric variational problem for the best envelope of a family of curves z(T)T.

An approximation solution to refinery crude oil scheduling problem with demand uncertainty using joint constrained programming.

Science.gov (United States)

Duan, Qianqian; Yang, Genke; Xu, Guanglin; Pan, Changchun

2014-01-01

This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand uncertainty is treated by specifying proximity level on the satisfaction of product demands. However, the joint chance constraints usually hold strong nonlinearity and consequently, it is still hard to handle it directly. In this paper, an approximation method combines a relax-and-tight technique to approximately transform the joint chance constraints to a serial of parameterized linear constraints so that the complicated problem can be attacked iteratively. The basic idea behind this approach is to approximate, as much as possible, nonlinear constraints by a lot of easily handled linear constraints which will lead to a well balance between the problem complexity and tractability. Case studies are conducted to demonstrate the proposed methods. Results show that the operation cost can be reduced effectively compared with the case without considering the demand correlation.

An Approximation Solution to Refinery Crude Oil Scheduling Problem with Demand Uncertainty Using Joint Constrained Programming

Directory of Open Access Journals (Sweden)

Qianqian Duan

2014-01-01

Full Text Available This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand uncertainty is treated by specifying proximity level on the satisfaction of product demands. However, the joint chance constraints usually hold strong nonlinearity and consequently, it is still hard to handle it directly. In this paper, an approximation method combines a relax-and-tight technique to approximately transform the joint chance constraints to a serial of parameterized linear constraints so that the complicated problem can be attacked iteratively. The basic idea behind this approach is to approximate, as much as possible, nonlinear constraints by a lot of easily handled linear constraints which will lead to a well balance between the problem complexity and tractability. Case studies are conducted to demonstrate the proposed methods. Results show that the operation cost can be reduced effectively compared with the case without considering the demand correlation.

Neural Based Tabu Search method for solving unit commitment problem with cooling-banking constraints

Directory of Open Access Journals (Sweden)

Rajan Asir Christober Gnanakkan Charles

2009-01-01

Full Text Available This paper presents a new approach to solve short-term unit commitment problem (UCP using Neural Based Tabu Search (NBTS with cooling and banking constraints. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for next H hours. A 7-unit utility power system in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different IEEE test systems consist of 10, 26 and 34 units. Numerical results are shown to compare the superiority of the cost solutions obtained using the Tabu Search (TS method, Dynamic Programming (DP and Lagrangian Relaxation (LR methods in reaching proper unit commitment.

A One-Layer Recurrent Neural Network for Pseudoconvex Optimization Problems With Equality and Inequality Constraints.

Science.gov (United States)

Qin, Sitian; Yang, Xiudong; Xue, Xiaoping; Song, Jiahui

2017-10-01

Pseudoconvex optimization problem, as an important nonconvex optimization problem, plays an important role in scientific and engineering applications. In this paper, a recurrent one-layer neural network is proposed for solving the pseudoconvex optimization problem with equality and inequality constraints. It is proved that from any initial state, the state of the proposed neural network reaches the feasible region in finite time and stays there thereafter. It is also proved that the state of the proposed neural network is convergent to an optimal solution of the related problem. Compared with the related existing recurrent neural networks for the pseudoconvex optimization problems, the proposed neural network in this paper does not need the penalty parameters and has a better convergence. Meanwhile, the proposed neural network is used to solve three nonsmooth optimization problems, and we make some detailed comparisons with the known related conclusions. In the end, some numerical examples are provided to illustrate the effectiveness of the performance of the proposed neural network.

An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint

Directory of Open Access Journals (Sweden)

2006-01-01

Full Text Available We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and two-sided bounds on the variables (box constraints. Such problems are interesting from both theoretical and practical point of view because they arise in some mathematical programming problems as well as in various practical problems such as problems of production planning and scheduling, allocation of resources, decision making, facility location problems, and so forth. Polynomial algorithms are proposed for solving problems of this form and their convergence is proved. Some examples and results of numerical experiments are also presented.

Constraint Logic Programming approach to protein structure prediction

Directory of Open Access Journals (Sweden)

Fogolari Federico

2004-11-01

Full Text Available Abstract Background The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models. The protein structure prediction problem can be cast in the form of an optimization problem. Notwithstanding its importance, the problem has very seldom been tackled by Constraint Logic Programming, a declarative programming paradigm suitable for solving combinatorial optimization problems. Results Constraint Logic Programming techniques have been applied to the protein structure prediction problem on the face-centered cube lattice model. Molecular dynamics techniques, endowed with the notion of constraint, have been also exploited. Even using a very simplified model, Constraint Logic Programming on the face-centered cube lattice model allowed us to obtain acceptable results for a few small proteins. As a test implementation their (known secondary structure and the presence of disulfide bridges are used as constraints. Simplified structures obtained in this way have been converted to all atom models with plausible structure. Results have been compared with a similar approach using a well-established technique as molecular dynamics. Conclusions The results obtained on small proteins show that Constraint Logic Programming techniques can be employed for studying protein simplified models, which can be converted into realistic all atom models. The advantage of Constraint Logic Programming over other, much more explored, methodologies, resides in the rapid software prototyping, in the easy way of encoding heuristics, and in exploiting all the advances made in this research area, e.g. in constraint propagation and its use for pruning the huge search space.

Constraint Logic Programming approach to protein structure prediction.

Science.gov (United States)

Dal Palù, Alessandro; Dovier, Agostino; Fogolari, Federico

2004-11-30

The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models. The protein structure prediction problem can be cast in the form of an optimization problem. Notwithstanding its importance, the problem has very seldom been tackled by Constraint Logic Programming, a declarative programming paradigm suitable for solving combinatorial optimization problems. Constraint Logic Programming techniques have been applied to the protein structure prediction problem on the face-centered cube lattice model. Molecular dynamics techniques, endowed with the notion of constraint, have been also exploited. Even using a very simplified model, Constraint Logic Programming on the face-centered cube lattice model allowed us to obtain acceptable results for a few small proteins. As a test implementation their (known) secondary structure and the presence of disulfide bridges are used as constraints. Simplified structures obtained in this way have been converted to all atom models with plausible structure. Results have been compared with a similar approach using a well-established technique as molecular dynamics. The results obtained on small proteins show that Constraint Logic Programming techniques can be employed for studying protein simplified models, which can be converted into realistic all atom models. The advantage of Constraint Logic Programming over other, much more explored, methodologies, resides in the rapid software prototyping, in the easy way of encoding heuristics, and in exploiting all the advances made in this research area, e.g. in constraint propagation and its use for pruning the huge search space.

Self-Evaluation Processes in Life Satisfaction: Uncovering Measurement Non-Equivalence and Age-Related Differences

Science.gov (United States)

Heidemeier, Heike; Staudinger, Ursula M.

2012-01-01

This study demonstrates how self-evaluation processes explain subgroup differences in ratings of life satisfaction (population heterogeneity). Life domains differ with regard to the constraints they impose on beliefs in internal control. We hypothesized that these differences are linked with cognitive biases in ratings of life satisfaction. In…

Solution Method of Multi-Product Two-Stage Logistics Problem with Constraints of Delivery Course

Science.gov (United States)

Ataka, Shinichiro; Gen, Mitsuo

The logistics network design is one of the important phase of Supply Chain Management (SCM) and it is the problem that should be optimized for long-term promotion of efficiency of the whole supply chain. Usually a plant produces different type of products. Even if it is a factory of the same company, delivery is different by a kind of a produced product. The restrictions which this model has are deeply concerned with TP in the real world. In this paper, we consider the logistics network design problems with multi-products and constraints for delivery course. To solve the problem, we used a hybrid priority-based Genetic Algorithm (h-priGA), and we tried the comparison experiment with priority-based Genetic Algorithm (priGA)and h-priGA, we show it about the effectiveness of h-priGA.

Adjunct Faculty Job Satisfaction in California Community Colleges: A Narrative Inquiry

Science.gov (United States)

Nagle, Tonya

2016-01-01

The problem addressed in the qualitative narrative inquiry is the perceived level of adjunct faculty job satisfaction. The general problem is the inconclusive and contradictory information on job satisfaction for adjuncts nationwide. The specific problem is poor job satisfaction for adjunct faculty in California where adjuncts are 48% of the…

Dynamics of relativistic point particles as a problem with constraints

International Nuclear Information System (INIS)

Todorov, I.T.

1976-01-01

The relativistic n-particle dynamics is studied as a problem with constraints of the type (2phisub(i)=)msub(i)sup(2)-psub(i)sup(2)+PHIsub(i)=0, i=1,...,n, (C) where PHIsub(i) are Poincare invariant functions of the particles' coordinates, momenta and spin components; PHIsib(i) is assumed to vanish asymptotically when the i-th particle coordinates tend to infinity. In the two particle case it is assumed in addition that the Poisson bracket [phi 1 , phi 2 ] vanishes on the surface (C). That allows us to give a formulation of the theory, invariant with respect to the choice of the time-parameter on each trajectory. The quantization of the relative two-particle motion is also discussed. It is pointed out that the stationary Schrodinger equation obtained in this manner is a local quasipotential equation

1/f and the Earthquake Problem: Scaling constraints that facilitate operational earthquake forecasting

Science.gov (United States)

yoder, M. R.; Rundle, J. B.; Turcotte, D. L.

2012-12-01

The difficulty of forecasting earthquakes can fundamentally be attributed to the self-similar, or "1/f", nature of seismic sequences. Specifically, the rate of occurrence of earthquakes is inversely proportional to their magnitude m, or more accurately to their scalar moment M. With respect to this "1/f problem," it can be argued that catalog selection (or equivalently, determining catalog constraints) constitutes the most significant challenge to seismicity based earthquake forecasting. Here, we address and introduce a potential solution to this most daunting problem. Specifically, we introduce a framework to constrain, or partition, an earthquake catalog (a study region) in order to resolve local seismicity. In particular, we combine Gutenberg-Richter (GR), rupture length, and Omori scaling with various empirical measurements to relate the size (spatial and temporal extents) of a study area (or bins within a study area) to the local earthquake magnitude potential - the magnitude of earthquake the region is expected to experience. From this, we introduce a new type of time dependent hazard map for which the tuning parameter space is nearly fully constrained. In a similar fashion, by combining various scaling relations and also by incorporating finite extents (rupture length, area, and duration) as constraints, we develop a method to estimate the Omori (temporal) and spatial aftershock decay parameters as a function of the parent earthquake's magnitude m. From this formulation, we develop an ETAS type model that overcomes many point-source limitations of contemporary ETAS. These models demonstrate promise with respect to earthquake forecasting applications. Moreover, the methods employed suggest a general framework whereby earthquake and other complex-system, 1/f type, problems can be constrained from scaling relations and finite extents.; Record-breaking hazard map of southern California, 2012-08-06. "Warm" colors indicate local acceleration (elevated hazard

Case manager satisfaction in public health.

Science.gov (United States)

Schutt, Russell K; Fawcett, Jacqueline; Gall, Gail B; Harrow, Brooke; Woodford, Mary Lou

2010-01-01

The purpose of this study was to examine correlates of case managers' satisfaction with their work, services, and service network and to identify connections to service performance and service costs. A decentralized public health program that exemplifies the trend toward more diverse clients and networked services. A mixed method design with 34 case managers. As hypothesized, the case managers' experiences with clients and the service network, and their service effectiveness, were associated with their satisfaction with their jobs and the services they provide. Satisfaction was also positively associated with more timely service delivery. These associations were explained in part by case managers' education and training. Case managers can achieve high levels of job and service satisfaction in outreach programs serving a diverse client population in a decentralized service network. Case managers' job and service satisfaction improves with reduced service problems and service delays and when case managers can devise work-arounds for persistent service problems. Using advanced practice nurses (APN) and providing more on-the-job training may increase case manager satisfaction with their jobs and the services they provide. Special efforts may be needed to prevent a decline in job satisfaction with years of experience.

Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems

Directory of Open Access Journals (Sweden)

Nelson Maculan

2003-01-01

Full Text Available We present integer linear models with a polynomial number of variables and constraints for combinatorial optimization problems in graphs: optimum elementary cycles, optimum elementary paths and optimum tree problems.Apresentamos modelos lineares inteiros com um número polinomial de variáveis e restrições para problemas de otimização combinatória em grafos: ciclos elementares ótimos, caminhos elementares ótimos e problemas em árvores ótimas.

Implementation of the - Constraint Method in Special Class of Multi-objective Fuzzy Bi-Level Nonlinear Problems

Directory of Open Access Journals (Sweden)

Azza Hassan Amer

2017-12-01

Full Text Available Geometric programming problem is a powerful tool for solving some special type nonlinear programming problems. In the last few years we have seen a very rapid development on solving multiobjective geometric programming problem. A few mathematical programming methods namely fuzzy programming, goal programming and weighting methods have been applied in the recent past to find the compromise solution. In this paper, -constraint method has been applied in bi-level multiobjective geometric programming problem to find the Pareto optimal solution at each level. The equivalent mathematical programming problems are formulated to find their corresponding value of the objective function based on the duality theorem at eash level. Here, we have developed a new algorithm for fuzzy programming technique to solve bi-level multiobjective geometric programming problems to find an optimal compromise solution. Finally the solution procedure of the fuzzy technique is illustrated by a numerical example

A linear programming approach to max-sum problem: a review.

Science.gov (United States)

Werner, Tomás

2007-07-01

The max-sum labeling problem, defined as maximizing a sum of binary (i.e., pairwise) functions of discrete variables, is a general NP-hard optimization problem with many applications, such as computing the MAP configuration of a Markov random field. We review a not widely known approach to the problem, developed by Ukrainian researchers Schlesinger et al. in 1976, and show how it contributes to recent results, most importantly, those on the convex combination of trees and tree-reweighted max-product. In particular, we review Schlesinger et al.'s upper bound on the max-sum criterion, its minimization by equivalent transformations, its relation to the constraint satisfaction problem, the fact that this minimization is dual to a linear programming relaxation of the original problem, and the three kinds of consistency necessary for optimality of the upper bound. We revisit problems with Boolean variables and supermodular problems. We describe two algorithms for decreasing the upper bound. We present an example application for structural image analysis.

Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints

Directory of Open Access Journals (Sweden)

Hamidreza Haddad

2012-04-01

Full Text Available This paper tackles the single machine scheduling problem with dependent setup time and precedence constraints. The primary objective of this paper is minimization of total weighted tardiness. Since the complexity of the resulted problem is NP-hard we use metaheuristics method to solve the resulted model. The proposed model of this paper uses genetic algorithm to solve the problem in reasonable amount of time. Because of high sensitivity of GA to its initial values of parameters, a Taguchi approach is presented to calibrate its parameters. Computational experiments validate the effectiveness and capability of proposed method.

Roles of Communication Problems and Communication Strategies on Resident-Related Role Demand and Role Satisfaction.

Science.gov (United States)

Savundranayagam, Marie Y; Lee, Christopher

2017-03-01

This study investigated the impact of dementia-related communication difficulties and communication strategies used by staff on resident-related indicators of role demand and role satisfaction. Formal/paid long-term care staff caregivers (N = 109) of residents with dementia completed questionnaires on dementia-related communication difficulties, communication strategies, role demand (ie, residents make unreasonable demands), and role satisfaction (measured by relationship closeness and influence over residents). Three types of communication strategies were included: (a) effective repair strategies, (b) completing actions by oneself, and (c) tuning out or ignoring the resident. Analyses using structural equation modeling revealed that communication problems were positively linked with role demand. Repair strategies were positively linked with relationship closeness and influence over residents. Completing actions by oneself was positively linked to role demand and influence over residents, whereas tuning out was negatively linked with influence over residents. The findings underscore that effective caregiver communication skills are essential in enhancing staff-resident relationships.

Introducing problem-based learning to undergraduate IT service management course: student satisfaction and work performance

Directory of Open Access Journals (Sweden)

Katarina Pažur Aničić

2016-12-01

Full Text Available This paper describes the implementation of problem-based learning (PBL principles in an undergraduate IT service management course, followed by the results about student satisfaction and work performance. The results indicate the students’ general satisfaction with the course implementation, as well as some challenges regarding the self-assessment and peer assessment of their work. The findings also reveal the students’ better work performance in project results than in traditional knowledge tests, which reinforces the indications about their positive attitudes towards the interactive PBL environment. The cluster analyses identified seven different patterns in student behaviour regarding course performance. The presented results can be considered a new aspect of the development and amendment of the information and communication technology (ICT skills requested by future employers. In this regard, the demand for innovation in the education of future ICT professionals arises from the need for experts equipped with both IT and business skills.

Teacher Satisfaction with School and Psychological Well-Being Affects Their Readiness to Help Children with Mental Health Problems

Science.gov (United States)

Sisask, Merike; Värnik, Peeter; Värnik, Airi; Apter, Alan; Balazs, Judit; Balint, Maria; Bobes, Julio; Brunner, Romuald; Corcoran, Paul; Cosman, Doina; Feldman, Dana; Haring, Christian; Kahn, Jean-Pierre; Poštuvan, Vita; Tubiana, Alexandra; Sarchiapone, Marco; Wasserman, Camilla; Carli, Vladimir; Hoven, Christina W.; Wasserman, Danuta

2014-01-01

Objective: In support of a whole-school approach to mental health promotion, this study was conducted to find out whether and how significantly teachers' satisfaction with school and their subjective psychological well-being are related to the belief that they can help pupils with mental health problems. Design: Cross-sectional data were collected…

Career satisfaction among general surgeons in Canada: a qualitative study of enablers and barriers to improve recruitment and retention in general surgery.

Science.gov (United States)

Ahmed, Najma; Conn, Lesley Gotlib; Chiu, Mary; Korabi, Bochra; Qureshi, Adnan; Nathens, Avery B; Kitto, Simon

2012-11-01

To understand what influences career satisfaction among general surgeons in urban and rural areas in Canada in order to improve recruitment and retention in general surgery. Semistructured interviews were conducted with 32 general surgeons in 2010 who were members of the Canadian Association of General Surgeons and who currently practice in either an urban or rural area. Interviews explored factors contributing to career satisfaction, as well as suggestions for preventive, screening, or management strategies to support general surgery practice. Findings revealed that both urban and rural general surgeons experienced the most satisfaction from their ability to resolve patient problems quickly and effectively, enhancing their sense of the meaningfulness of their clinical practice. The supportive relationships with colleagues, trainees, and patients was also cited as a key source of career satisfaction. Conversely, insufficient access to resources and a perceived disconnect between hospital administration and clinical practice priorities were raised as key "systems-level" problems. As a result, many participants felt alienated from their work by these systems-level barriers that were perceived to hinder the provision of high-quality patient care. Career satisfaction among both urban and rural general surgeons was influenced positively by the social aspects of their work, such as patient and colleague relationships, as well as a perception of an increasing amount of control and autonomy over their professional commitments. The modern general surgeon values a balance between professional obligations and personal time that may be difficult to achieve given the current system constraints.

Study of patient satisfaction and self-expressed problems after emergency caesarean delivery under subarachnoid block

Directory of Open Access Journals (Sweden)

V R Hemanth Kumar

2014-01-01

Full Text Available Background and Aims: Subarachnoid block is one of the common modes of anaesthesia opted for emergency caesarean section, if the maternal and foetal conditions are favourable. Various factors influence the quality of care administered during the procedure. This questionnaire based study was undertaken to look for self-expressed problems in peri-operative period in patients undergoing emergency caesarean surgery under subarachnoid block. Methods: All the parturients who underwent emergency caesarean section under subarachnoid block during 6 months period were distributed a questionnaire in post-operative period. They were encouraged to fill and return the form within 15 days. Patient satisfaction and the self-expressed problems were analysed at the end of 6 months. Results: One hundred and seventy five out of 220 parturients responded. 58.3% of them said that they were explained about the anaesthesia prior to surgery and 85.3% overall remained anxious. With people around them, 93.1% of them felt comfortable and 91.4% expressed that they were made comfortable inside the theatre. The self-expressed problems were shivering (43.4%, breathlessness (21.7%, pain (20%, post-operative headache (15.4% and backache (19.4%. Parturients who heard their babies cry was 85.1%. After their babies were shown after delivery, 77.1% mothers slept well; 86.9% fed their babies within 4 h of delivery. Conclusion: Pre-operative communication in emergency caesarean section by health personnel did not reduce the anxiety level, which shows that communication was ineffective. Intra-operative psychological support like making the patient comfortable, showing baby to mother and early breast feeding improve bonding between child and mother and essentially contribute to patient satisfaction.

Job satisfaction as a matter of time, team, and trust

DEFF Research Database (Denmark)

Uhrenfeldt, Lisbeth; Hall, Elisabeth

2015-01-01

Support and variety regarding work, autonomy, organizational constraints, and promotion opportunities are factors contributing to job satisfaction or lack thereof among hospital nurses together with self-perceived health, education and career orientation. The aim of this study was to explore public...... hospital nurses’ experiences of job satisfaction. This qualitative study was undertaken in a caring theory context. Ten proficient Danish hospital nurses were interviewed twice and data were analysed using a hermeneutic approach. The analysis revealed that time, team, and trust were essential components...... in job satisfaction. Time, team and trust helped the nurses collaborate with patients, care for relatives, and work in teams with other hospital staff members. Lack of job satisfaction occurred when time was to short or quality care was threatened, when the nurses felt alone and had to finish their job...

Profit maximization with customer satisfaction control for electric vehicle charging in smart grids

Directory of Open Access Journals (Sweden)

Edwin Collado

2017-05-01

Full Text Available As the market of electric vehicles is gaining popularity, large-scale commercialized or privately-operated charging stations are expected to play a key role as a technology enabler. In this paper, we study the problem of charging electric vehicles at stations with limited charging machines and power resources. The purpose of this study is to develop a novel profit maximization framework for station operation in both offline and online charging scenarios, under certain customer satisfaction constraints. The main goal is to maximize the profit obtained by the station owner and provide a satisfactory charging service to the customers. The framework includes not only the vehicle scheduling and charging power control, but also the managing of user satisfaction factors, which are defined as the percentages of finished charging targets. The profit maximization problem is proved to be NPcomplete in both scenarios (NP refers to “nondeterministic polynomial time”, for which two-stage charging strategies are proposed to obtain efficient suboptimal solutions. Competitive analysis is also provided to analyze the performance of the proposed online two-stage charging algorithm against the offline counterpart under non-congested and congested charging scenarios. Finally, the simulation results show that the proposed two-stage charging strategies achieve performance close to that with exhaustive search. Also, the proposed algorithms provide remarkable performance gains compared to the other conventional charging strategies with respect to not only the unified profit, but also other practical interests, such as the computational time, the user satisfaction factor, the power consumption, and the competitive ratio.

Homotopy Algorithm for Optimal Control Problems with a Second-order State Constraint

International Nuclear Information System (INIS)

Hermant, Audrey

2010-01-01

This paper deals with optimal control problems with a regular second-order state constraint and a scalar control, satisfying the strengthened Legendre-Clebsch condition. We study the stability of structure of stationary points. It is shown that under a uniform strict complementarity assumption, boundary arcs are stable under sufficiently smooth perturbations of the data. On the contrary, nonreducible touch points are not stable under perturbations. We show that under some reasonable conditions, either a boundary arc or a second touch point may appear. Those results allow us to design an homotopy algorithm which automatically detects the structure of the trajectory and initializes the shooting parameters associated with boundary arcs and touch points.

The problem of bias when nursing facility staff administer customer satisfaction surveys.

Science.gov (United States)

Hodlewsky, R Tamara; Decker, Frederic H

2002-10-01

Customer satisfaction instruments are being used with increasing frequency to assess and monitor residents' assessments of quality of care in nursing facilities. There is no standard protocol, however, for how or by whom the instruments should be administered when anonymous, written responses are not feasible. Researchers often use outside interviewers to assess satisfaction, but cost considerations may limit the extent to which facilities are able to hire outside interviewers on a regular basis. This study was designed to investigate the existence and extent of any bias caused by staff administering customer satisfaction surveys. Customer satisfaction data were collected in 1998 from 265 residents in 21 nursing facilities in North Dakota. Half the residents in each facility were interviewed by staff members and the other half by outside consultants; scores were compared by interviewer type. In addition to a tabulation of raw scores, ordinary least-squares analysis with facility fixed effects was used to control for resident characteristics and unmeasured facility-level factors that could influence scores. Significant positive bias was found when staff members interviewed residents. The bias was not limited to questions directly affecting staff responsibilities but applied across all types of issues. The bias was robust under varying constructions of satisfaction and dissatisfaction. A uniform method of survey administration appears to be important if satisfaction data are to be used to compare facilities. Bias is an important factor that should be considered and weighed against the costs of obtaining outside interviewers when assessing customer satisfaction among long term care residents.

A short-term operating room surgery scheduling problem integrating multiple nurses roster constraints.

Science.gov (United States)

Xiang, Wei; Yin, Jiao; Lim, Gino

2015-02-01

Operating room (OR) surgery scheduling determines the individual surgery's operation start time and assigns the required resources to each surgery over a schedule period, considering several constraints related to a complete surgery flow and the multiple resources involved. This task plays a decisive role in providing timely treatments for the patients while balancing hospital resource utilization. The originality of the present study is to integrate the surgery scheduling problem with real-life nurse roster constraints such as their role, specialty, qualification and availability. This article proposes a mathematical model and an ant colony optimization (ACO) approach to efficiently solve such surgery scheduling problems. A modified ACO algorithm with a two-level ant graph model is developed to solve such combinatorial optimization problems because of its computational complexity. The outer ant graph represents surgeries, while the inner graph is a dynamic resource graph. Three types of pheromones, i.e. sequence-related, surgery-related, and resource-related pheromone, fitting for a two-level model are defined. The iteration-best and feasible update strategy and local pheromone update rules are adopted to emphasize the information related to the good solution in makespan, and the balanced utilization of resources as well. The performance of the proposed ACO algorithm is then evaluated using the test cases from (1) the published literature data with complete nurse roster constraints, and 2) the real data collected from a hospital in China. The scheduling results using the proposed ACO approach are compared with the test case from both the literature and the real life hospital scheduling. Comparison results with the literature shows that the proposed ACO approach has (1) an 1.5-h reduction in end time; (2) a reduction in variation of resources' working time, i.e. 25% for ORs, 50% for nurses in shift 1 and 86% for nurses in shift 2; (3) an 0.25h reduction in

A combined constraint handling framework: an empirical study

DEFF Research Database (Denmark)

Si, Chengyong; Hu, Junjie; Lan, Tian

2017-01-01

This paper presents a new combined constraint handling framework (CCHF) for solving constrained optimization problems (COPs). The framework combines promising aspects of different constraint handling techniques (CHTs) in different situations with consideration of problem characteristics. In order...

Phase-Field Relaxation of Topology Optimization with Local Stress Constraints

DEFF Research Database (Denmark)

Stainko, Roman; Burger, Martin

2006-01-01

inequality constraints. We discretize the problem by finite elements and solve the arising finite-dimensional programming problems by a primal-dual interior point method. Numerical experiments for problems with local stress constraints based on different criteria indicate the success and robustness......We introduce a new relaxation scheme for structural topology optimization problems with local stress constraints based on a phase-field method. In the basic formulation we have a PDE-constrained optimization problem, where the finite element and design analysis are solved simultaneously...

An adaptive ES with a ranking based constraint handling strategy

Directory of Open Access Journals (Sweden)

Kusakci Ali Osman

2014-01-01

Full Text Available To solve a constrained optimization problem, equality constraints can be used to eliminate a problem variable. If it is not feasible, the relations imposed implicitly by the constraints can still be exploited. Most conventional constraint handling methods in Evolutionary Algorithms (EAs do not consider the correlations between problem variables imposed by the constraints. This paper relies on the idea that a proper search operator, which captures mentioned implicit correlations, can improve performance of evolutionary constrained optimization algorithms. To realize this, an Evolution Strategy (ES along with a simplified Covariance Matrix Adaptation (CMA based mutation operator is used with a ranking based constraint-handling method. The proposed algorithm is tested on 13 benchmark problems as well as on a real life design problem. The outperformance of the algorithm is significant when compared with conventional ES-based methods.

Preconditioned alternating direction method of multipliers for inverse problems with constraints

International Nuclear Information System (INIS)

Jiao, Yuling; Jin, Qinian; Lu, Xiliang; Wang, Weijie

2017-01-01

We propose a preconditioned alternating direction method of multipliers (ADMM) to solve linear inverse problems in Hilbert spaces with constraints, where the feature of the sought solution under a linear transformation is captured by a possibly non-smooth convex function. During each iteration step, our method avoids solving large linear systems by choosing a suitable preconditioning operator. In case the data is given exactly, we prove the convergence of our preconditioned ADMM without assuming the existence of a Lagrange multiplier. In case the data is corrupted by noise, we propose a stopping rule using information on noise level and show that our preconditioned ADMM is a regularization method; we also propose a heuristic rule when the information on noise level is unavailable or unreliable and give its detailed analysis. Numerical examples are presented to test the performance of the proposed method. (paper)

Constraint programming and decision making

CERN Document Server

Kreinovich, Vladik

2014-01-01

In many application areas, it is necessary to make effective decisions under constraints. Several area-specific techniques are known for such decision problems; however, because these techniques are area-specific, it is not easy to apply each technique to other applications areas. Cross-fertilization between different application areas is one of the main objectives of the annual International Workshops on Constraint Programming and Decision Making. Those workshops, held in the US (El Paso, Texas), in Europe (Lyon, France), and in Asia (Novosibirsk, Russia), from 2008 to 2012, have attracted researchers and practitioners from all over the world. This volume presents extended versions of selected papers from those workshops. These papers deal with all stages of decision making under constraints: (1) formulating the problem of multi-criteria decision making in precise terms, (2) determining when the corresponding decision problem is algorithmically solvable; (3) finding the corresponding algorithms, and making...

Analyzing Food-Related Life Satisfaction and other Predictors of Life Satisfaction in Central Chile.

Science.gov (United States)

Schnettler, Berta; Lobos, Germán; Orellana, Ligia; Grunert, Klaus; Sepúlveda, José; Mora, Marcos; Denegri, Marianela; Miranda, Horacio

2015-06-17

This study aimed to assess the effect of satisfaction with food-related life on life satisfaction among inhabitants of the main municipalities of central Chile. A survey was applied to a sample of 1,277 people, distributed proportionally by municipality. The questionnaire included the following scales: SWLS (Satisfaction with Life Scale), SWFL (Satisfaction with Food-related Life) and the Health-Related Quality of Life Index (HRQOL). Questions were asked regarding eating habits inside and outside the home, time available for meals at home, the assessment of five sources of happiness and the demographic characteristics of those surveyed. An ordered logit model was proposed, in which the dependent variable was satisfaction with life. Satisfaction with life was significantly related to the respondent's socioeconomic status, self-perception of health, degree of satisfaction with food-related life, monthly food expenditure, time available for supper with the family (p health problems, frequency of supper with the family, the degree of agreement with respect to family being an important source of happiness (p food consumption in fast food outlets (p health, family and eating, and the family interaction associated with eating may play an important role in overall satisfaction with life.

The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints: A Branch-and-Price Approach

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Kolind, Esben; Clausen, Jens

2009-01-01

In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks....... Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an IP-model for the problem, which is decomposed using Dantzig-Wolfe decomposition....... The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test...

Comparison of AI techniques to solve combined economic emission dispatch problem with line flow constraints

Energy Technology Data Exchange (ETDEWEB)

Jacob Raglend, I. [School of Electrical Sciences, Noorul Islam University, Kumaracoil 629 180 (India); Veeravalli, Sowjanya; Sailaja, Kasanur; Sudheera, B. [School of Electrical Sciences, Vellore Institute of Technology, Vellore 632 004 (India); Kothari, D.P. [FNAE, FNASC, SMIEEE, Vellore Institute of Technology University, Vellore 632 014 (India)

2010-07-15

A comparative study has been made on the solutions obtained using combined economic emission dispatch (CEED) problem considering line flow constraints using different intelligent techniques for the regulated power system to ensure a practical, economical and secure generation schedule. The objective of the paper is to minimize the total production cost of the power generation. Economic load dispatch (ELD) and economic emission dispatch (EED) have been applied to obtain optimal fuel cost of generating units. Combined economic emission dispatch (CEED) is obtained by considering both the economic and emission objectives. This bi-objective CEED problem is converted into single objective function using price penalty factor approach. In this paper, intelligent techniques such as genetic algorithm (GA), evolutionary programming (EP), particle swarm optimization (PSO), differential evolution (DE) are applied to obtain CEED solutions for the IEEE 30-bus system and 15-unit system. This proposed algorithm introduces an efficient CEED approach that obtains the minimum operating cost satisfying unit, emission and network constraints. The proposed algorithm has been tested on two sample systems viz the IEEE 30-bus system and a 15-unit system. The results obtained by the various artificial intelligent techniques are compared with respect to the solution time, total production cost and convergence criteria. The solutions obtained are quite encouraging and useful in the economic emission environment. The algorithm and simulation are carried out using Matlab software. (author)

Comparison of AI techniques to solve combined economic emission dispatch problem with line flow constraints

International Nuclear Information System (INIS)

Jacob Raglend, I.; Veeravalli, Sowjanya; Sailaja, Kasanur; Sudheera, B.; Kothari, D.P.

2010-01-01

A comparative study has been made on the solutions obtained using combined economic emission dispatch (CEED) problem considering line flow constraints using different intelligent techniques for the regulated power system to ensure a practical, economical and secure generation schedule. The objective of the paper is to minimize the total production cost of the power generation. Economic load dispatch (ELD) and economic emission dispatch (EED) have been applied to obtain optimal fuel cost of generating units. Combined economic emission dispatch (CEED) is obtained by considering both the economic and emission objectives. This bi-objective CEED problem is converted into single objective function using price penalty factor approach. In this paper, intelligent techniques such as genetic algorithm (GA), evolutionary programming (EP), particle swarm optimization (PSO), differential evolution (DE) are applied to obtain CEED solutions for the IEEE 30-bus system and 15-unit system. This proposed algorithm introduces an efficient CEED approach that obtains the minimum operating cost satisfying unit, emission and network constraints. The proposed algorithm has been tested on two sample systems viz the IEEE 30-bus system and a 15-unit system. The results obtained by the various artificial intelligent techniques are compared with respect to the solution time, total production cost and convergence criteria. The solutions obtained are quite encouraging and useful in the economic emission environment. The algorithm and simulation are carried out using Matlab software. (author)

A problem-based approach to elastic wave propagation: the role of constraints

International Nuclear Information System (INIS)

Fazio, Claudio; Guastella, Ivan; Tarantino, Giovanni

2009-01-01

A problem-based approach to the teaching of mechanical wave propagation, focused on observation and measurement of wave properties in solids and on modelling of these properties, is presented. In particular, some experimental results, originally aimed at measuring the propagation speed of sound waves in metallic rods, are used in order to deepen the role of constraints in mechanical wave propagation. Interpretative models of the results obtained in the laboratory are built and implemented by using a well-known simulation environment. The simulation results are, then, compared with experimental data. The approach has been developed and experimented in the context of a workshop on mechanical wave propagation of the two-year Graduate Program for Physics Teacher Education at University of Palermo.

Low-cost design of next generation SONET/SDH networks with multiple constraints

CSIR Research Space (South Africa)

Karem, TR

2007-07-01

Full Text Available on constraints programming satisfaction technology is proposed. The algorithm is tested in OPNET simulation environment using different network models derived from a hypothetical case study of an optical network design for Bellville area in Cape Town, South...

Identifying Social Satisfaction from Social Media

OpenAIRE

Bai, Shuotian; Gao, Rui; Hao, Bibo; Yuan, Sha; Zhu, Tingshao

2014-01-01

We demonstrate the critical need to identify social situation and instability factors by acquiring public social satisfaction in this research. However, subject to the large amount of manual work cost in subject recruitment and data processing, conventional self-reported method cannot be implemented in real time or applied in large scale investigation. To solve the problem, this paper proposed an approach to predict users' social satisfaction, especially for the economy-related satisfaction b...

Duality in constrained location problems

DEFF Research Database (Denmark)

Juel, Henrik; Love, Robert F.

1987-01-01

The dual of a facility location problem with general norms, distance constraints, and linear constraints is formulated.......The dual of a facility location problem with general norms, distance constraints, and linear constraints is formulated....

Optimal satisfaction degree in energy harvesting cognitive radio networks

International Nuclear Information System (INIS)

Li Zan; Liu Bo-Yang; Si Jiang-Bo; Zhou Fu-Hui

2015-01-01

A cognitive radio (CR) network with energy harvesting (EH) is considered to improve both spectrum efficiency and energy efficiency. A hidden Markov model (HMM) is used to characterize the imperfect spectrum sensing process. In order to maximize the whole satisfaction degree (WSD) of the cognitive radio network, a tradeoff between the average throughput of the secondary user (SU) and the interference to the primary user (PU) is analyzed. We formulate the satisfaction degree optimization problem as a mixed integer nonlinear programming (MINLP) problem. The satisfaction degree optimization problem is solved by using differential evolution (DE) algorithm. The proposed optimization problem allows the network to adaptively achieve the optimal solution based on its required quality of service (Qos). Numerical results are given to verify our analysis. (paper)

Work Hours Constraints: Impacts and Policy Implications

OpenAIRE

Constant, Amelie F.; Otterbach, Steffen

2011-01-01

If individuals reveal their preference as consumers, then they are taken seriously. What happens if individuals, as employees, reveal their preferences in working hours? And what happens if there is a misalignment between actual hours worked and preferred hours, the so-called work hours constraints? How does this affect the productivity of workers, their health, and overall life satisfaction? Labor supply and corresponding demand are fundamental to production. Labor economists know for long t...

Medical Students' Satisfaction and Academic Performance with Problem-Based Learning in Practice-Based Exercises for Epidemiology and Health Demographics

Science.gov (United States)

Jiménez-Mejías, E.; Amezcua-Prieto, C.; Martínez-Ruiz, V.; Olvera-Porcel, M. C.; Jiménez-Moleón, J. J.; Lardelli Claret, P.

2015-01-01

The aim of this study was to evaluate the effect of problem-based learning (PBL) on university students' satisfaction with and academic performance in a course on epidemiology and social and demographic health. The participants in this interventional study were 529 students (272 in the intervention group and 257 in the control group) enrolled in a…

Job satisfaction of nursing assistants.

Science.gov (United States)

Lerner, Nancy; Resnick, Barbara; Galik, Elizabeth; Flynn, Linda

2011-11-01

This secondary data analysis explored factors influencing job satisfaction in a sample of nursing assistants employed in Maryland skilled nursing facilities. Multiple factors have been shown to affect job satisfaction and turnover in nursing assistants (NAs), but the problem of turnover persists in skilled nursing facility environments affecting quality of care. An existing data set of 556 nursing assistants from 12 Maryland skilled nursing facilities was used. To explore factors found to influence job satisfaction from other studies, a multiple regression analysis was performed. Nine dependent variables previously shown to affect job satisfaction were used. Of these variables, only years of experience (β = .230) and performance of restorative care (β = .095) were found to be positively associated with job satisfaction. Self-esteem (β = -.094) was found to be negatively associated with job satisfaction. Only length of experience and exemplary care as evidenced by the performance of restorative care were associated with job satisfaction. These results mirror results found in other studies. Self-esteem was negatively associated with job satisfaction in this population, a finding needing further study. Copyright © 2011 Wolters Kluwer Health | Lippincott Williams & Wilkins

Comparison of passive and active leisure activities and life satisfaction with aging.

Science.gov (United States)

Cho, Dongwook; Post, Jay; Kim, Sung Kyeom

2018-03-01

Many older adults face limitations to participating in active leisure activities as a result of their physical constraints from aging. Passive leisure activities become alternative leisure activities for older adults as a result of limited physical capacity. The present study sought to determine whether there exists a difference in the frequency of participation in passive and active leisure activities, and the effect of participation in passive and active leisure activities on the life satisfaction level of old adults. A total of 460 participants aged 60-95 years were randomly selected from 21 sites in the USA. The Life Satisfaction Index - Z and the Meaningful Activity Participation Assessment were analyzed to examine older adults' life satisfaction and frequency of active or passive activities. The results showed that participation in passive leisure activities, such reading, talking on the telephone and watching TV/listening to the radio, is more frequent among older adults (P = 0.000). The regression coefficient found that club/organization or volunteering (P = 0.008), homemaking/maintenance (P = 0.017) and traveling (P = 0.017) for active leisure activities were statistically significant predictors of Life Satisfaction Index - Z for older adults. The current study shows that older adults spent much more times participating in passive leisure activities, such as radio/watching TV, talking on the phone and reading. The result also showed that active leisure activities, such as club/organization or volunteering, home making/maintenance and traveling, were significant predictors of life satisfaction for older adults controlling for covariates. The current study suggests marketing and programming plans to overcome the constraints that influence older adults' life satisfaction. Geriatr Gerontol Int 2018; 18: 380-386. © 2017 Japan Geriatrics Society.

Navigating contextual constraints in discourse: Design explications in institutional talk

Science.gov (United States)

Herijgers, MLC (Marloes); Maat, HLW (Henk) Pander

2017-01-01

Although institutional discourse is subject to a vast ensemble of constraints, its design is not fixed beforehand. On the contrary, optimizing the satisfaction of these constraints requires considerable discourse design skills from institutional agents. In this article, we analyze how Dutch banks’ mortgage advisors navigate their way through the consultations context. We focus on what we call discourse design explications, that is, stretches of talk in which participants refer to conflicting constraints in the discourse context, at the same time proposing particular discourse designs for dealing with these conflicts. We start by discussing three forms of design explication. Then we will examine the various resolutions they propose for constraint conflicts and show how advisors seek customer consent or cooperation for the proposed designs. Thus our analysis reveals how institutional agents, while providing services, work on demonstrating how the design of these services is optimized and tailored to customers. PMID:28781580

Analysis of job satisfaction of employees

OpenAIRE

Procházka, Lukáš

2011-01-01

This thesis examines the problem of job satisfaction. It explains basic concepts and methods of most widely used theories of job satisfaction. The work contains survey on job satisfaction on a specific market entity - the company Telefónica Czech Republic, a.s., the findings of current situation and it proposes alternative procedures to improve the situation. Data collection was performed using a questionnaire submitted by employees of the company Telefónica Czech Republic, a. s. On the basis...

Top-k Based Adaptive Enumeration in Constraint Programming

Directory of Open Access Journals (Sweden)

Ricardo Soto

2015-01-01

order for variables and values is employed along the search. In this paper, we present a new and more lightweight approach for performing adaptive enumeration. We incorporate a powerful classification technique named Top-k in order to adaptively select strategies along the resolution. We report results on a set of well-known benchmarks where the proposed approach noticeably competes with classical and modern adaptive enumeration methods for constraint satisfaction.

Some cosmological constraints on gauge theories

International Nuclear Information System (INIS)

Schramm, D.N.

1983-01-01

In these lectures, a review is made of various constraints cosmology may place on gauge theories. Particular emphasis is placed on those constraints obtainable from Big Bang Nucleosynthesis, with only brief mention made of Big Bang Baryosynthesis. There is also a considerable discussion of astrophysical constraints on masses and lifetimes of neutrinos with specific mention of the 'missing mass (light)' problem of galactic dynamics. (orig./HSI)

Constraint programming for modelling and solving modal satisfiability

NARCIS (Netherlands)

Brand, S.; Gennari, R.; de Rijke, M.

2003-01-01

We explore to what extent and how efficiently constraint programmingcan be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfactionproblems with non-boolean domains, together with suitable constraints.Experiments show that the

Occupational therapists' job satisfaction in a changing hospital organisation--a time-geography-based study.

Science.gov (United States)

Bendixen, Hans Jørgen; Ellegård, Kajsa

2014-01-01

To investigate occupational therapists' job satisfaction under a changing regime by using a time-geographic approach focusing on the therapists' everyday working lives. Nine occupational therapists at the Copenhagen University Hospital, Gentofte, Denmark. A mixed-method design was employed. Occupational therapists kept time-geographic diaries, and the results from them were grounded for individual, semi-structured in-depth interviews. Individual reflections on everyday working life were recorded. Transcribed statements from the interviews were analysed to determine factors influencing job satisfaction. The nine therapists kept diaries for one day a month for a total of 70 preselected days over a period of nine months; six participated in individual interviews. Four factors constraining OT job satisfaction were revealed. Economic concerns, new professional paradigms and methods in combination with a new organisational structure for the occupational therapy service caused uncertainty. In addition, decreasing possibilities for supervision by colleagues influenced job satisfaction. Opportunities for experiencing autonomy in everyday working life were described as facilitators for job satisfaction. The time-geographic and interview methods were useful in focusing on the job satisfaction of occupational therapists, who provided individual interpretations of the balance between autonomy and three types of constraints in everyday working life. The constraints related to organisation, power relations and - not least - how the organisational project of the department fitted in with OTs' individual projects. Matching of organisational and individual projects is of crucial importance, not only for OTs but for most workplaces where individuals are employed to serve patients in the healthcare sector.

Dynamics and causality constraints

International Nuclear Information System (INIS)

Sousa, Manoelito M. de

2001-04-01

The physical meaning and the geometrical interpretation of causality implementation in classical field theories are discussed. Causality in field theory are kinematical constraints dynamically implemented via solutions of the field equation, but in a limit of zero-distance from the field sources part of these constraints carries a dynamical content that explains old problems of classical electrodynamics away with deep implications to the nature of physicals interactions. (author)

The MarCon Algorithm: A Systematic Market Approach to Distributed Constraint Problems

National Research Council Canada - National Science Library

Parunak, H. Van Dyke

1998-01-01

.... Each variable integrates this information from the constraints interested in it and provides feedback that enables the constraints to shrink their sets of assignments until they converge on a solution...

Level-Set Topology Optimization with Aeroelastic Constraints

Science.gov (United States)

Dunning, Peter D.; Stanford, Bret K.; Kim, H. Alicia

2015-01-01

Level-set topology optimization is used to design a wing considering skin buckling under static aeroelastic trim loading, as well as dynamic aeroelastic stability (flutter). The level-set function is defined over the entire 3D volume of a transport aircraft wing box. Therefore, the approach is not limited by any predefined structure and can explore novel configurations. The Sequential Linear Programming (SLP) level-set method is used to solve the constrained optimization problems. The proposed method is demonstrated using three problems with mass, linear buckling and flutter objective and/or constraints. A constraint aggregation method is used to handle multiple buckling constraints in the wing skins. A continuous flutter constraint formulation is used to handle difficulties arising from discontinuities in the design space caused by a switching of the critical flutter mode.

Alternative Constraint Handling Technique for Four-Bar Linkage Path Generation

Science.gov (United States)

Sleesongsom, S.; Bureerat, S.

2018-03-01

This paper proposes an extension of a new concept for path generation from our previous work by adding a new constraint handling technique. The propose technique was initially designed for problems without prescribed timing by avoiding the timing constraint, while remain constraints are solving with a new constraint handling technique. The technique is one kind of penalty technique. The comparative study is optimisation of path generation problems are solved using self-adaptive population size teaching-learning based optimization (SAP-TLBO) and original TLBO. In this study, two traditional path generation test problem are used to test the proposed technique. The results show that the new technique can be applied with the path generation problem without prescribed timing and gives better results than the previous technique. Furthermore, SAP-TLBO outperforms the original one.

Interrelationship of motivation for and perceived constraints to physical activity participation and the well-being of senior center participants

Science.gov (United States)

Motoko Miyake; Ellen Rodgers

2009-01-01

This study investigated the relationship of motivation for and perceived constraints to physical activity (PA) participation and the well-being of senior center participants. A survey instrument made up of modified versions of the Sport Motivation and Perceived Constraints Scales, the Life Satisfaction Index-Z, and the Geriatric Depression Scale was administered at the...

Numerical Solution of Mixed Problems of the Theory of Elasticity with One-Sided Constraints

Directory of Open Access Journals (Sweden)

I. V. Stankevich

2017-01-01

Full Text Available The paper deals with the application features of the finite element technologies to solve the problems of elasticity with one-sided constraints. On the one hand, the area of this study is determined by the fact that many critical parts and assemblies of mechanical and power engineering constructions have a significant contact within some given surface. To assess the strength and the life of these parts and assemblies, reliable stress-strain state data are demandable. Data on the stress-strain state can be obtained using the contemporary mathematical modeling means, e.g., finite element technology.To solve the problems of the theory of elasticity with one-sided constraints, a method of finite elements in a traditional classical form can be used, but it is necessary to consider some of its shortcomings. The most significant one is an approximation of the tensile stress and strain, as well as a considerably lower order of convergence of the approximation for stresses and strains as compared to displacements. Improving the accuracy through increasing a density of the finite element models and/or the transition to more complex approximations is not always optimal, because increasing a dimension of the discrete problem leads to a significant computational cost and demand for expensive computing resources.One of the alternatives in numerical analysis of contact problems of the elasticity theory is to use the mixed variational formulations of the finite element method in which stresses and/or strains appear in the resolving equations along with displacements as equal unknown. A major positive factor when using the mixed formulations of the finite element method is reduction of the approximation error of stress and strain, which leads to a more accurate assessment of the stress-strain state in comparison with the classical approach of the finite element method in the form of the method of displacements.Besides, mixed schemes of the finite element method

Spin glasses and nonlinear constraints in portfolio optimization

International Nuclear Information System (INIS)

Andrecut, M.

2014-01-01

We discuss the portfolio optimization problem with the obligatory deposits constraint. Recently it has been shown that as a consequence of this nonlinear constraint, the solution consists of an exponentially large number of optimal portfolios, completely different from each other, and extremely sensitive to any changes in the input parameters of the problem, making the concept of rational decision making questionable. Here we reformulate the problem using a quadratic obligatory deposits constraint, and we show that from the physics point of view, finding an optimal portfolio amounts to calculating the mean-field magnetizations of a random Ising model with the constraint of a constant magnetization norm. We show that the model reduces to an eigenproblem, with 2N solutions, where N is the number of assets defining the portfolio. Also, in order to illustrate our results, we present a detailed numerical example of a portfolio of several risky common stocks traded on the Nasdaq Market.

Spin glasses and nonlinear constraints in portfolio optimization

Energy Technology Data Exchange (ETDEWEB)

Andrecut, M., E-mail: mircea.andrecut@gmail.com

2014-01-17

We discuss the portfolio optimization problem with the obligatory deposits constraint. Recently it has been shown that as a consequence of this nonlinear constraint, the solution consists of an exponentially large number of optimal portfolios, completely different from each other, and extremely sensitive to any changes in the input parameters of the problem, making the concept of rational decision making questionable. Here we reformulate the problem using a quadratic obligatory deposits constraint, and we show that from the physics point of view, finding an optimal portfolio amounts to calculating the mean-field magnetizations of a random Ising model with the constraint of a constant magnetization norm. We show that the model reduces to an eigenproblem, with 2N solutions, where N is the number of assets defining the portfolio. Also, in order to illustrate our results, we present a detailed numerical example of a portfolio of several risky common stocks traded on the Nasdaq Market.

Portfolios with nonlinear constraints and spin glasses

Science.gov (United States)

Gábor, Adrienn; Kondor, I.

1999-12-01

In a recent paper Galluccio, Bouchaud and Potters demonstrated that a certain portfolio problem with a nonlinear constraint maps exactly onto finding the ground states of a long-range spin glass, with the concomitant nonuniqueness and instability of the optimal portfolios. Here we put forward geometric arguments that lead to qualitatively similar conclusions, without recourse to the methods of spin glass theory, and give two more examples of portfolio problems with convex nonlinear constraints.

Generalized Pauli constraints in small atoms

DEFF Research Database (Denmark)

Schilling, Christian; Altunbulak, Murat; Knecht, Stefan

2018-01-01

investigations have found evidence that these constraints are exactly saturated in several physically relevant systems, e.g., in a certain electronic state of the beryllium atom. It has been suggested that, in such cases, the constraints, rather than the details of the Hamiltonian, dictate the system......'s qualitative behavior. Here, we revisit this question with state-of-the-art numerical methods for small atoms. We find that the constraints are, in fact, not exactly saturated, but that they lie much closer to the surface defined by the constraints than the geometry of the problem would suggest. While...

Motivators of teacher job satisfaction

OpenAIRE

Juozaitienė, Agnė; Simonaitienė, Berita

2011-01-01

Article is seeking to answer these questions: what factors function as motivators and enhance teacher job satisfaction and which of the motivators are manifested at school? These questions are significant from a theoretical as well as practical point of view. The research problem addressed in the article encompasses three fields and is revealed in three parts of the article. The first part analyzes the notion of teacher job satisfaction and influencing factors. The second part is dedicated to...

How Do Severe Constraints Affect the Search Ability of Multiobjective Evolutionary Algorithms in Water Resources?

Science.gov (United States)

Clarkin, T. J.; Kasprzyk, J. R.; Raseman, W. J.; Herman, J. D.

2015-12-01

This study contributes a diagnostic assessment of multiobjective evolutionary algorithm (MOEA) search on a set of water resources problem formulations with different configurations of constraints. Unlike constraints in classical optimization modeling, constraints within MOEA simulation-optimization represent limits on acceptable performance that delineate whether solutions within the search problem are feasible. Constraints are relevant because of the emergent pressures on water resources systems: increasing public awareness of their sustainability, coupled with regulatory pressures on water management agencies. In this study, we test several state-of-the-art MOEAs that utilize restricted tournament selection for constraint handling on varying configurations of water resources planning problems. For example, a problem that has no constraints on performance levels will be compared with a problem with several severe constraints, and a problem with constraints that have less severe values on the constraint thresholds. One such problem, Lower Rio Grande Valley (LRGV) portfolio planning, has been solved with a suite of constraints that ensure high reliability, low cost variability, and acceptable performance in a single year severe drought. But to date, it is unclear whether or not the constraints are negatively affecting MOEAs' ability to solve the problem effectively. Two categories of results are explored. The first category uses control maps of algorithm performance to determine if the algorithm's performance is sensitive to user-defined parameters. The second category uses run-time performance metrics to determine the time required for the algorithm to reach sufficient levels of convergence and diversity on the solution sets. Our work exploring the effect of constraints will better enable practitioners to define MOEA problem formulations for real-world systems, especially when stakeholders are concerned with achieving fixed levels of performance according to one or

The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints: A Branch-and-Price Approach - Technical Report

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Kolind, Esben; Clausen, Jens

In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks....... Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an IP-model for the problem, which is decomposed using Dantzig-Wolfe decomposition....... The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test...

Optimal satisfaction degree in energy harvesting cognitive radio networks

Science.gov (United States)

Li, Zan; Liu, Bo-Yang; Si, Jiang-Bo; Zhou, Fu-Hui

2015-12-01

A cognitive radio (CR) network with energy harvesting (EH) is considered to improve both spectrum efficiency and energy efficiency. A hidden Markov model (HMM) is used to characterize the imperfect spectrum sensing process. In order to maximize the whole satisfaction degree (WSD) of the cognitive radio network, a tradeoff between the average throughput of the secondary user (SU) and the interference to the primary user (PU) is analyzed. We formulate the satisfaction degree optimization problem as a mixed integer nonlinear programming (MINLP) problem. The satisfaction degree optimization problem is solved by using differential evolution (DE) algorithm. The proposed optimization problem allows the network to adaptively achieve the optimal solution based on its required quality of service (Qos). Numerical results are given to verify our analysis. Project supported by the National Natural Science Foundation of China (Grant No. 61301179), the Doctorial Programs Foundation of the Ministry of Education of China (Grant No. 20110203110011), and the 111 Project (Grant No. B08038).

Application of Fuzzy Optimization to the Orienteering Problem

Directory of Open Access Journals (Sweden)

Madhushi Verma

2015-01-01

Full Text Available This paper deals with the orienteering problem (OP which is a combination of two well-known problems (i.e., travelling salesman problem and the knapsack problem. OP is an NP-hard problem and is useful in appropriately modeling several challenging applications. As the parameters involved in these applications cannot be measured precisely, depicting them using crisp numbers is unrealistic. Further, the decision maker may be satisfied with graded satisfaction levels of solutions, which cannot be formulated using a crisp program. To deal with the above-stated two issues, we formulate the fuzzy orienteering problem (FOP and provide a method to solve it. Here we state the two necessary conditions of OP of maximizing the total collected score and minimizing the time taken to traverse a path (within the specified time bound as fuzzy goals and the remaining necessary conditions as crisp constraints. Using the max-min formulation of the fuzzy sets obtained from the fuzzy goals, we calculate the fuzzy decision sets (Z and Z∗ that contain the feasible paths and the desirable paths, respectively, along with the degrees to which they are acceptable. To efficiently solve large instances of FOP, we also present a parallel algorithm on CREW PRAM model.

Initial Reliability and Validity of the Life Satisfaction Scale for Problem Youth in a Sample of Drug Abusing and Conduct Disordered Youth

Science.gov (United States)

Donohue, Brad; Teichner, Gordon; Azrin, Nathan; Weintraub, Noah; Crum, Thomas A.; Murphy, Leah; Silver, N. Clayton

2003-01-01

Responses to Life Satisfaction Scale for Problem Youth (LSSPY) items were examined in a sample of 193 substance abusing and conduct disordered adolescents. In responding to the LSSPY, youth endorse their percentage of happiness (0 to 100%) in twelve domains (i.e., friendships, family, school, employment/work, fun activities, appearance, sex…

Evaluating the link between human resource management decisions and patient satisfaction with quality of care.

Science.gov (United States)

Oppel, Eva-Maria; Winter, Vera; Schreyögg, Jonas

Patient satisfaction with quality of care is becoming increasingly important in the competitive hospital market. Simultaneously, the growing shortage of clinical staff poses a considerable challenge to ensuring a high quality of care. In this context, a question emerges regarding whether and how human resource management (HRM) might serve as a means to reduce staff shortage problems and to increase patient satisfaction. Although considerable efforts have been devoted to understanding the concepts of patient satisfaction and HRM, little is known about the interrelationships between these concepts or about the link between staff shortage problems and patients' satisfaction with quality of care. The aim of this study was to investigate the relationship between strategic human resource management (SHRM), staff shortage problems, and patients' satisfaction with care. Furthermore, we analyze how the HRM decision to fill short-term vacancies through temporary staffing affects patient satisfaction. We differentiate between physicians and nurses. We develop and empirically test a theoretical model. The data (n = 165) are derived from a survey on SHRM that was sent to 732 German hospitals and from a survey on patient satisfaction that comprises 436,848 patient satisfaction ratings. We use a structural equation modeling approach to test the model. The results indicate that SHRM significantly reduces staff shortage problems for both occupational groups. Having fewer physician shortage problems is significantly associated with higher levels of patient satisfaction, whereas this effect is not significant for nurses. Furthermore, the use of temporary staffing considerably reduces patients' satisfaction with care. Hospital managers are advised to consider the effects of HRM decisions on patients' satisfaction with care. In particular, investments in SHRM targeted at physicians have significantly positive effects on patient satisfaction, whereas the temporary staffing of physicians

Toward an automaton Constraint for Local Search

Directory of Open Access Journals (Sweden)

Jun He

2009-10-01

Full Text Available We explore the idea of using finite automata to implement new constraints for local search (this is already a successful technique in constraint-based global search. We show how it is possible to maintain incrementally the violations of a constraint and its decision variables from an automaton that describes a ground checker for that constraint. We establish the practicality of our approach idea on real-life personnel rostering problems, and show that it is competitive with the approach of [Pralong, 2007].

Predictors of employer satisfaction: technical and non-technical skills.

Science.gov (United States)

Danielson, Jared A; Wu, Tsui-Feng; Fales-Williams, Amanda J; Kirk, Ryan A; Preast, Vanessa A

2012-01-01

Employers of 2007-2009 graduates from Iowa State University College of Veterinary Medicine were asked to respond to a survey regarding their overall satisfaction with their new employees as well as their new employees' preparation in several technical and non-technical skill areas. Seventy-five responses contained complete data and were used in the analysis. Four technical skill areas (data collection, data interpretation, planning, and taking action) and five non-technical skill areas (interpersonal skills, ability to deal with legal issues, business skills, making referrals, and problem solving) were identified. All of the skill area subscales listed above had appropriate reliability (Cronbach's alpha>0.70) and were positively and significantly correlated with overall employer satisfaction. Results of two simultaneous regression analyses indicated that of the four technical skill areas, taking action is the most salient predictor of employer satisfaction. Of the five non-technical skill areas, interpersonal skills, business skills, making referrals, and problem solving were the most important skills in predicting employer satisfaction. Hierarchical regression analysis revealed that all technical skills explained 25% of the variation in employer satisfaction; non-technical skills explained an additional 42% of the variation in employer satisfaction.

Cardinality reasoning for bin-packing constraint : Application to a tank allocation problem

NARCIS (Netherlands)

Schaus, Pierre; Régin, Jean Charles; Van Schaeren, Rowan; Dullaert, Wout; Raa, Birger

2012-01-01

Flow reasoning has been successfully used in CP for more than a decade. It was originally introduced by Régin in the well-known Alldifferent and Global Cardinality Constraint (GCC) available in most of the CP solvers. The BinPacking constraint was introduced by Shaw and mainly uses an independent

Triple Hierarchical Variational Inequalities with Constraints of Mixed Equilibria, Variational Inequalities, Convex Minimization, and Hierarchical Fixed Point Problems

Directory of Open Access Journals (Sweden)

Lu-Chuan Ceng

2014-01-01

Full Text Available We introduce and analyze a hybrid iterative algorithm by virtue of Korpelevich's extragradient method, viscosity approximation method, hybrid steepest-descent method, and averaged mapping approach to the gradient-projection algorithm. It is proven that under appropriate assumptions, the proposed algorithm converges strongly to a common element of the fixed point set of infinitely many nonexpansive mappings, the solution set of finitely many generalized mixed equilibrium problems (GMEPs, the solution set of finitely many variational inequality problems (VIPs, the solution set of general system of variational inequalities (GSVI, and the set of minimizers of convex minimization problem (CMP, which is just a unique solution of a triple hierarchical variational inequality (THVI in a real Hilbert space. In addition, we also consider the application of the proposed algorithm to solve a hierarchical fixed point problem with constraints of finitely many GMEPs, finitely many VIPs, GSVI, and CMP. The results obtained in this paper improve and extend the corresponding results announced by many others.

Marital Satisfaction and Life Circumstances of Grown Children With Autism Across 7 Years

Science.gov (United States)

Hartley, Sigan L.; Barker, Erin T.; Baker, Jason K.; Seltzer, Marsha Mailick; Greenberg, Jan S.

2013-01-01

We examined the extent to which marital satisfaction across 7 years in 199 mothers was associated with the characteristics (gender, age, and intellectual disability status) of their adolescent or adult child with an autism spectrum disorder (ASD) and whether fluctuations in marital satisfaction covaried with the child’s autism symptoms, health, behavior problems, and closeness in the parent–child relationship. We also examined the impact of the departure of the adult child out of the family home on mothers’ marital satisfaction. The effect of family context variables including the presence of an additional child with a disability, maternal education, and household income on marital satisfaction were also examined. We found that closeness in the mother–child relationship and household income had a significant effect on level of marital satisfaction, and that variability in the slope of mothers’ marital satisfaction was significantly predicted by fluctuations in the behavior problems of the adolescent or adult child with an ASD. The grown child’s departure out of the family home was not related to change in marital satisfaction. Interventions aimed at managing the behavior problems of adolescents and adults with ASDs may help strengthen parents’ marital relationship. PMID:22866933

Solving University Scheduling Problem Using Hybrid Approach

Directory of Open Access Journals (Sweden)

Aftab Ahmed Shaikh

2011-10-01

Full Text Available In universities scheduling curriculum activity is an essential job. Primarily, scheduling is a distribution of limited resources under interrelated constraints. The set of hard constraints demand the highest priority and should not to be violated at any cost, while the maximum soft constraints satisfaction mounts the quality scale of solution. In this research paper, a novel bisected approach is introduced that is comprisesd of GA (Genetic Algorithm as well as Backtracking Recursive Search. The employed technique deals with both hard and soft constraints successively. The first phase decisively is focused over elimination of all the hard constraints bounded violations and eventually produces partial solution for subsequent step. The second phase is supposed to draw the best possible solution on the search space. Promising results are obtained by implementation on the real dataset. The key points of the research approach are to get assurance of hard constraints removal from the dataset and minimizing computational time for GA by initializing pre-processed set of chromosomes.

Optimal Portfolio Choice with Wash Sale Constraints

DEFF Research Database (Denmark)

Astrup Jensen, Bjarne; Marekwica, Marcel

2011-01-01

We analytically solve the portfolio choice problem in the presence of wash sale constraints in a two-period model with one risky asset. Our results show that wash sale constraints can heavily affect portfolio choice of investors with unrealized losses. The trading behavior of such investors...

Relationship between Teachers' Job Satisfaction and Students' Academic Performance

Science.gov (United States)

Iqbal, Asif; Aziz, Fakhra; Farooqi, Tahir Khan; Ali, Shabbir

2016-01-01

Problem Statement: An extensive literature on Job satisfaction has shown, teachers who are satisfied with their jobs perform better. Along with various indicators of teachers' job satisfaction, variables such as organizational justice (Nojani, Arjmandnia, Afrooz, & Rajabi, 2012), organizational culture (Hosseinkhanzadeh, Hosseinkhanzadeh,…

Energy constraints and organizational change in US production

Energy Technology Data Exchange (ETDEWEB)

1980-12-01

There is still considerable uncertainty about the way in which energy-supply constraints affect industrial thinking and activity. Yet, this is an important issue in determining the effectiveness of conservation programs and in formulating energy policy. The authors expand on a survey of US business attitudes and responses to energy constraints first published in the September 1979 Energy Policy with the results of further analysis of their survey. In particular, they examine correlations between perceived causes and preferred solutions of energy problems, organizational adjustments to energy constraints in energy-intensive industries, and the ways in which production operations have changed in response to supply problems. 5 references, 5 tables.

Constraints and Dedication as Drivers for Relationship Commitment: An Empirical Study in a Health-Care Context

OpenAIRE

Gaby Odekerken-Schröder; Bloemer Josée

2002-01-01

The objective of this study is to empirically determine the role of constraints and dedication as drivers of relationship commitment as most of the existing work is of a conceptual nature only. We assess how and to which extent these two drivers fit into the established relationships between overall service quality, satisfaction, trust and commitment. Using LISREL, we estimate the conceptual model based on a sample of customers of health-care centers. The results indicate that both constraint...

Infrared Constraint on Ultraviolet Theories

Energy Technology Data Exchange (ETDEWEB)

Tsai, Yuhsin [Cornell Univ., Ithaca, NY (United States)

2012-08-01

While our current paradigm of particle physics, the Standard Model (SM), has been extremely successful at explaining experiments, it is theoretically incomplete and must be embedded into a larger framework. In this thesis, we review the main motivations for theories beyond the SM (BSM) and the ways such theories can be constrained using low energy physics. The hierarchy problem, neutrino mass and the existence of dark matter (DM) are the main reasons why the SM is incomplete . Two of the most plausible theories that may solve the hierarchy problem are the Randall-Sundrum (RS) models and supersymmetry (SUSY). RS models usually suffer from strong flavor constraints, while SUSY models produce extra degrees of freedom that need to be hidden from current experiments. To show the importance of infrared (IR) physics constraints, we discuss the flavor bounds on the anarchic RS model in both the lepton and quark sectors. For SUSY models, we discuss the difficulties in obtaining a phenomenologically allowed gaugino mass, its relation to R-symmetry breaking, and how to build a model that avoids this problem. For the neutrino mass problem, we discuss the idea of generating small neutrino masses using compositeness. By requiring successful leptogenesis and the existence of warm dark matter (WDM), we can set various constraints on the hidden composite sector. Finally, to give an example of model independent bounds from collider experiments, we show how to constrain the DM–SM particle interactions using collider results with an effective coupling description.

Chance-Constrained Guidance With Non-Convex Constraints

Science.gov (United States)

Ono, Masahiro

2011-01-01

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of

Distributed Unmixing of Hyperspectral Datawith Sparsity Constraint

Science.gov (United States)

Khoshsokhan, S.; Rajabi, R.; Zayyani, H.

2017-09-01

Spectral unmixing (SU) is a data processing problem in hyperspectral remote sensing. The significant challenge in the SU problem is how to identify endmembers and their weights, accurately. For estimation of signature and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are used widely in the SU problem. One of the constraints which was added to NMF is sparsity constraint that was regularized by L1/2 norm. In this paper, a new algorithm based on distributed optimization has been used for spectral unmixing. In the proposed algorithm, a network including single-node clusters has been employed. Each pixel in hyperspectral images considered as a node in this network. The distributed unmixing with sparsity constraint has been optimized with diffusion LMS strategy, and then the update equations for fractional abundance and signature matrices are obtained. Simulation results based on defined performance metrics, illustrate advantage of the proposed algorithm in spectral unmixing of hyperspectral data compared with other methods. The results show that the AAD and SAD of the proposed approach are improved respectively about 6 and 27 percent toward distributed unmixing in SNR=25dB.

[Life satisfaction and related socio-demographic factors during female midlife].

Science.gov (United States)

Cuadros, José Luis; Pérez-Roncero, Gonzalo R; López-Baena, María Teresa; Cuadros-Celorrio, Angela M; Fernández-Alonso, Ana María

2014-01-01

To assess life satisfaction and related factors in middle-aged Spanish women. This was a cross-sectional study including 235 women aged 40 to 65, living in Granada (Spain), healthy companions of patients visiting the obstetrics and gynecology clinics. They completed the Diener Satisfaction with Life Scale, the Menopause Rating Scale, the Perceived Stress Scale, the Insomnia Severity Index and a sociodemographic questionnaire containing personal and partner data. Internal consistency of each tool was also calculated. Almost two-thirds (61.3%) of the women were postmenopausal, and 43.8% had abdominal obesity, 36.6% had insomnia, 18.7% had poor menopause-related quality of life, 31.9% performed regular exercise, and 5.1% had severe financial problems. Life satisfaction showed significant positive correlations (Spearman's test) with female and male age, and inverse correlations with menopause-related quality of life, perceived stress and insomnia. In the multiple linear regression analysis, high life satisfaction is positively correlated with having a partner who performed exercise, and inversely with having work problems, perceived stress and the suspicion of partner infidelity. These factors explained 40% of the variance of the multiple regression analysis for life satisfaction in middle-aged women. Life satisfaction is a construct related to perceived stress, work problems, and having a partner, while aspects of menopause and general health had no significant influence. Copyright © 2014 Elsevier España, S.L.U. All rights reserved.

Quantization of 2 + 1-spinning particles and bifermionic constraint problem

Energy Technology Data Exchange (ETDEWEB)

Fresneda, R.; Gavrilov, S.P.; Gitman, D.M.; Moshin, P.Yu. [Sao Paulo Univ., SP (Brazil). Inst. de Fisica

2004-07-01

In this paper, we have quantized a P- and T-noninvariant pseudoclassical model of a massive relativistic spin-1=2 particle in 2 + 1 dimensions, on the background of an arbitrary U(1) gauge vector field. A peculiar feature of the model at the classical level is that it contains a bifermionic first-class constraint, which does not admit gauge-fixing. It is shown that this first-class constraint can be realized at the quantum level as a bounded operator, which is imposed as a condition on the state vectors (by analogy with the Dirac quantization method). This allows us to generalize the quantization scheme [?] in case there is a bifermionic first-class constraint.We present a detailed construction of the Hilbert space and verify that the constructed QM possesses the necessary symmetry properties. We show that the condition of preservation of the classical symmetries under the restricted Lorentz transformations and the U(1) transformations allows one to realize the operator algebra in an unambiguous way. Within the constructed relativistic QM, we select a physical subspace which describes the one-particle sector. The physical sector of the QM contains both particles and antiparticles with positive energy hat {omega} levels, and exactly reproduces the one-particle sector of the quantum theory of the 2 + 1 spinor field. (author)

Patient satisfaction with maxillofacial prosthesis. Literature review.

Science.gov (United States)

Goiato, Marcelo Coelho; Pesqueira, Aldiéris Alves; Ramos da Silva, Cristina; Gennari Filho, Humberto; Micheline Dos Santos, Daniela

2009-02-01

Obturators and facial prostheses are important not only in rehabilitation and aesthetics, but also in patient re-socialisation. The level of reintegration is directly related to the degree of satisfaction with rehabilitation. So, the maxillofacial prosthetics must provide patient satisfaction during treatment. This study aimed to search information in database and conduct a literature review on patient satisfaction with maxillofacial prosthesis. The problems experienced by these patients may decrease when specialists keep the patient on regular inspection. Rehabilitation through alloplasty or prosthetic restoration provides satisfactory conditions in aesthetics and well-being and reinstates individuals in familial and social environment.

Sexual satisfaction following bariatric surgery: A prospective exploratory study.

Science.gov (United States)

Ferrer-Márquez, Manuel; Pomares-Callejón, María Ángeles; Fernández-Agis, Inmaculada; Belda-Lozano, Ricardo; Vidaña-Márquez, Elisabet; Soriano-Maldonado, Alberto

2017-11-01

Bariatric surgery improves sexual function in obese individuals, although the extent to which sexual satisfaction is improved following surgery is unknown. The aims of this study were 1) to describe sexual satisfaction in severely/morbidly obese men and women candidates for bariatric surgery; 2) to assess the effects of bariatric surgery on sexual satisfaction at 12-months follow-up; and 3) to assess whether weight changes at follow-up following bariatric surgery are associated with changes in sexual satisfaction. We conducted a prospective observational study from February 2011 to June 2014. A total of 44 patients with severe/morbid obesity participated in the study. Sexual satisfaction was assessed (at baseline and 12-months follow-up) through the Index of Sexual Satisfaction (ISS) questionnaire. Of 44 patients who completed the ISS at baseline (mean age 40.3 [SD=9.4] years and BMI 46.9 [SD=6.2] kg/m 2 ), 17 were lost to follow-up. The baseline ISS total scores were 32.0 (SD=20.1) in women and 24.4 (SD=16.0) in men (P>0.05). The proportion of sexually satisfied men and women at baseline was 62.5% and 46.4%, respectively (P=0.360). At follow-up, sexual satisfaction improved significantly in women (average difference 13.7 units; P=0.032) but not in men (average difference 3.6 units; P=0.717). The percentage of women with sexual satisfaction problems was reduced by 33% at follow-up (P=0.038). A relatively large percentage of severely/morbidly obese women and men present clinically significant sexual satisfaction problems before undergoing bariatric surgery. Sexual satisfaction improves significantly 12 months following bariatric surgery, particularly in women. Copyright © 2017 AEC. Publicado por Elsevier España, S.L.U. All rights reserved.

Hopelessness, Depression and Life Satisfaction Among The Patients With Multiple Sclerosis

Directory of Open Access Journals (Sweden)

Güler Duru Aşiret

2014-03-01

Full Text Available OBJECTIVE: This study was carried out to determine the level of hopelessness, depression, and life satisfaction among patients with multiple sclerosis. METHODS: 65 patients with multiple sclerosis, treated at the neurology clinic of a university hospital, were included in this study. In this descriptive study, a data collection form developed by the researchers, the Beck Depression Scale, and the Beck Hopelessness and Life Satisfaction Scale were used. RESULTS: Almost half (43.1% of the patients exhibited severe depressive symptoms. Patients’ hopelessness and life satisfaction levels were moderate. The scores on depression and life satisfaction scales were correlated negatively. While patients’ traits including female gender, low economic level, difficulties in walking, and fatigue were associated with reduced life satisfaction; variables such as having a child, low economic and education levels, experiencing incontinence, and fatigue were related to a higher level of depressive symptoms. CONCLUSION: The majority of patients were depressed; life satisfaction and hopelessness levels were moderate. Linear regression analysis revealed that education and emotional problems determined 42% of the depression score; and economic level and emotional problems identified 32% of the life satisfaction score

A constraint-based approach to intelligent support of nuclear reactor design

International Nuclear Information System (INIS)

Furuta, Kazuo

1993-01-01

Constraint is a powerful representation to formulate and solve problems in design; a constraint-based approach to intelligent support of nuclear reactor design is proposed. We first discuss the features of the approach, and then present the architecture of a nuclear reactor design support system under development. In this design support system, the knowledge base contains constraints useful to structure the design space as object class definitions, and several types of constraint resolvers are provided as design support subsystems. The adopted method of constraint resolution are explained in detail. The usefulness of the approach is demonstrated using two design problems: Design window search and multiobjective optimization in nuclear reactor design. (orig./HP)

RESEARCH ON HUMAN RESOURCES MOTIVATION AND SATISFACTION

Directory of Open Access Journals (Sweden)

Zoltan-Bela FARKAS

2014-06-01

Full Text Available Many research studies on the human resources performance of the educational system have proved that pupils/students’ educational success depends, to a high degree, on the level of human resource motivation, as well as on their degree of professional satisfaction. Teachers’ who show a high level of motivation, both intrinsic and extrinsic, invest more into their activity, are more creative and more efficient in problem solving. The paper debates the results of an empirical study regarding the influence of pre-university teachers’ motivation and satisfaction regarding the general work conditions on their work performance by measuring the present motivation and satisfaction level. Furthermore, the determinant factors of their satisfaction with the work place are determined and analyzed. Finally, based on the statistical data process we will conclude and debate on the research hypothesis validation and the empirical model related to motivation – satisfaction – performance interdependences.

Occupant satisfaction with new low-energy houses

DEFF Research Database (Denmark)

Knudsen, Henrik Nellemose; Jensen, Ole Michael; Kristensen, Lars

2012-01-01

The development and the erection of low-energy buildings have been intensified in recent years. Still, there are only few studies of the energy performance and occupant satisfaction with living in low-energy houses. A questionnaire survey was therefore carried out among occupants of low-energy ho......The development and the erection of low-energy buildings have been intensified in recent years. Still, there are only few studies of the energy performance and occupant satisfaction with living in low-energy houses. A questionnaire survey was therefore carried out among occupants of low......-energy houses. The purpose was to study occupant satisfaction with new low-energy houses concerning i.a. the perceived indoor climate and the technical installations for heating and ventilation. The survey showed an overall satisfaction with the new low-energy houses, but also that there were problems...... occupant satisfaction in existing and future low-energy houses are given....

Marital satisfaction and life circumstances of grown children with autism across 7 years.

Science.gov (United States)

Hartley, Sigan L; Barker, Erin T; Baker, Jason K; Seltzer, Marsha Mailick; Greenberg, Jan S

2012-10-01

We examined the extent to which marital satisfaction across 7 years in 199 mothers was associated with the characteristics (gender, age, and intellectual disability status) of their adolescent or adult child with an autism spectrum disorder (ASD) and whether fluctuations in marital satisfaction covaried with the child's autism symptoms, health, behavior problems, and closeness in the parent-child relationship. We also examined the impact of the departure of the adult child out of the family home on mothers' marital satisfaction. The effect of family context variables including the presence of an additional child with a disability, maternal education, and household income on marital satisfaction were also examined. We found that closeness in the mother-child relationship and household income had a significant effect on level of marital satisfaction, and that variability in the slope of mothers' marital satisfaction was significantly predicted by fluctuations in the behavior problems of the adolescent or adult child with an ASD. The grown child's departure out of the family home was not related to change in marital satisfaction. Interventions aimed at managing the behavior problems of adolescents and adults with ASDs may help strengthen parents' marital relationship. (PsycINFO Database Record (c) 2012 APA, all rights reserved).

Maintaining Arc Consistency in Non-Binary Dynamic CSPs using Simple Tabular Reduction

DEFF Research Database (Denmark)

Queva, Matthieu Stéphane Benoit; Probst, Christian W.; Ricci, Laurent

2010-01-01

Constraint Satisfaction Problems (CSPs) are well known models used in Artificial Intelligence. In order to represent real world systems, CSPs have been extended to Dynamic CSPs (DCSPs), which support adding and removing constraints at runtime. Some approaches to the NP-complete problem of solving...

Fuzzy Array Approach to Unit Commitment

DEFF Research Database (Denmark)

Jantzen, Jan; Eliasson, Bo

1996-01-01

The paper investigates the unit commitment problem of Swedish power company Sydkraft as a constraint satisfaction problem. The power system is a simplified system with nuclear, thermal, and hydro generators as well as power interchange. In this paper we focus on soft constraints, for instance...

Leadership style and employees' intrinsic job satisfaction in the ...

African Journals Online (AJOL)

This study investigates the impact of leadership style on employees' intrinsic job satisfaction in the Cross River State Newspaper Corporation, Calabar, Nigeria. The study examined the problem of dissatisfaction in the work place as far as intrinsic factors of job satisfaction are concerned. Structured questionnaire was used ...

Women with deep infiltrating endometriosis: sexual satisfaction, desire, orgasm, and pelvic problem interference with sex.

Science.gov (United States)

Montanari, Giulia; Di Donato, Nadine; Benfenati, Arianna; Giovanardi, Giulia; Zannoni, Letizia; Vicenzi, Claudia; Solfrini, Serena; Mignemi, Giuseppe; Villa, Gioia; Mabrouk, Mohamed; Schioppa, Claudio; Venturoli, Stefano; Seracchioli, Renato

2013-06-01

Endometriosis is a chronic and progressive condition of women of reproductive age. It is strongly associated with a significant reduction of quality of life (QOL) and sexual function. This study aims to objectively evaluate sexual function in women with deep infiltrating endometriosis (DIE) and to study the impact of endometriosis symptoms and type of lesion on patient's sexual function. This is a cross-sectional study in a tertiary care university hospital. It included 182 patients with preoperative clinical and ultrasound diagnosis of DIE who were referred to our center from 2008 to 2011. A sexual activity questionnaire, the Sexual Health Outcomes in Women Questionnaire (SHOW-Q) was used to collect data pertaining to satisfaction, orgasm, desire, and pelvic problem interference with sex. Short Form 36 (SF-36) was used to evaluate QOL. Demographic and clinical characteristics were assessed: age, body mass index, parity, ethnicity, postsecondary education, employment, smoking, history of surgical treatment, and hormonal contraception. Patients were asked about pain symptoms (dysmenorrhea, dyspareunia, dyschezia, chronic pelvic pain, and dysuria) using a visual analog scale. The mean values obtained on the different scales of the SHOW-Q showed poor sexual function (mean SHOW-Q total score 56.38 ± 22.74). Satisfaction was the dimension most affected (mean satisfaction score 55.66 ± 34.55), followed by orgasm (mean orgasm score 56.90 ± 33.77). We found a significant correlation between the SF-36 scores and the SHOW-Q scores (P < 0.0001). Sexual dysfunction and deterioration of QOL seem to be correlated. Analyzing the impact of symptoms and lesions on sexual function, we found that dyspareunia and vaginal DIE nodules significantly affect sexual activity (P < 0.05). The results of this study demonstrated that women with DIE have a sexual function impairment, correlated with the overall well-being decrease. Moreover, the presence of dyspareunia and vaginal

Results on stabilization of nonlinear systems under finite data-rate constraints

NARCIS (Netherlands)

Persis, Claudio De

2004-01-01

We discuss in this paper a result concerning the stabilization problem of nonlinear systems under data-rate constraints using output feedback. To put the result in a broader context, we shall first review a number of recent contributions on the stabilization problem under data-rate constraints when

Performance and job satisfaction of employees as well as customers satisfaction affect by organizational environment – An applied study on Gumhouria bank, Libya

Directory of Open Access Journals (Sweden)

Mohieddin Almanae

2013-01-01

Full Text Available This study conducted on Gumhouria Bank and dealing with the role played by the organizational environment on performance and functional satisfaction of the employees. The relevant effect on the customer’s satisfaction indicate that the various elements of the organizational environment have effect on the functional performance and satisfaction of the customers. For raising performance and achieving satisfaction of the employees and customers, elements should be taken into consideration and improvement thereof and solving the problems encountering them. The relationship between the organizational environment and the functional performance is progressive and positive. Whenever the organizational environment increases, the functional performance increases, which, in turn, affects the functional satisfaction degree with the employees. The results indicated effect of the organizational environment on the customer’s satisfaction with the banking services provided. This may be resulting from the effect of organizational environment on the job performance and satisfaction (positive or negative which, in turn led to achieving satisfaction or dissatisfaction of the customers.

Minimum Time Trajectory Optimization of CNC Machining with Tracking Error Constraints

Directory of Open Access Journals (Sweden)

Qiang Zhang

2014-01-01

Full Text Available An off-line optimization approach of high precision minimum time feedrate for CNC machining is proposed. Besides the ordinary considered velocity, acceleration, and jerk constraints, dynamic performance constraint of each servo drive is also considered in this optimization problem to improve the tracking precision along the optimized feedrate trajectory. Tracking error is applied to indicate the servo dynamic performance of each axis. By using variable substitution, the tracking error constrained minimum time trajectory planning problem is formulated as a nonlinear path constrained optimal control problem. Bang-bang constraints structure of the optimal trajectory is proved in this paper; then a novel constraint handling method is proposed to realize a convex optimization based solution of the nonlinear constrained optimal control problem. A simple ellipse feedrate planning test is presented to demonstrate the effectiveness of the approach. Then the practicability and robustness of the trajectory generated by the proposed approach are demonstrated by a butterfly contour machining example.

Exact and Heuristic Algorithms for Routing AGV on Path with Precedence Constraints

Directory of Open Access Journals (Sweden)

Liang Xu

2016-01-01

Full Text Available A new problem arises when an automated guided vehicle (AGV is dispatched to visit a set of customers, which are usually located along a fixed wire transmitting signal to navigate the AGV. An optimal visiting sequence is desired with the objective of minimizing the total travelling distance (or time. When precedence constraints are restricted on customers, the problem is referred to as traveling salesman problem on path with precedence constraints (TSPP-PC. Whether or not it is NP-complete has no answer in the literature. In this paper, we design dynamic programming for the TSPP-PC, which is the first polynomial-time exact algorithm when the number of precedence constraints is a constant. For the problem with number of precedence constraints, part of the input can be arbitrarily large, so we provide an efficient heuristic based on the exact algorithm.

Analysis of approaches to the concept of job satisfaction

OpenAIRE

Lysova E.

2017-01-01

the article is devoted the problem of satisfaction of person with his professional activities. It examines different approaches to understanding the phenomenon of job satisfaction, the analysis of their evolution in the works of domestic and Western scholars, describes the strengths and weaknesses of different interpretations of the concept of satisfaction. Almost a third of his life a person spends at work. In the labour force, he reveals himself as a person, implements the physical and ment...

The Effect of Entrepreneurial Orientation on Teacher Satisfaction and Retention

Science.gov (United States)

Thibault, Melissa Rihm

2016-01-01

Teacher turnover is a costly problem. Since teacher working conditions influence teacher's satisfaction and career intentions, managers may theoretically increase teacher satisfaction and retention by fostering a school environment supportive of the highly-trained professional. Entrepreneurial Orientation is an organizational construct correlated…

A Production Planning Model for Make-to-Order Foundry Flow Shop with Capacity Constraint

Directory of Open Access Journals (Sweden)

Xixing Li

2017-01-01

Full Text Available The mode of production in the modern manufacturing enterprise mainly prefers to MTO (Make-to-Order; how to reasonably arrange the production plan has become a very common and urgent problem for enterprises’ managers to improve inner production reformation in the competitive market environment. In this paper, a mathematical model of production planning is proposed to maximize the profit with capacity constraint. Four kinds of cost factors (material cost, process cost, delay cost, and facility occupy cost are considered in the proposed model. Different factors not only result in different profit but also result in different satisfaction degrees of customers. Particularly, the delay cost and facility occupy cost cannot reach the minimum at the same time; the two objectives are interactional. This paper presents a mathematical model based on the actual production process of a foundry flow shop. An improved genetic algorithm (IGA is proposed to solve the biobjective problem of the model. Also, the gene encoding and decoding, the definition of fitness function, and genetic operators have been illustrated. In addition, the proposed algorithm is used to solve the production planning problem of a foundry flow shop in a casting enterprise. And comparisons with other recently published algorithms show the efficiency and effectiveness of the proposed algorithm.

Tightness of Semidefinite Programming Relaxation to Robust Transmit Beamforming with SINR Constraints

Directory of Open Access Journals (Sweden)

Yanjun Wang

2013-01-01

Full Text Available This paper considers a multiuser transmit beamforming problem under uncertain channel state information (CSI subject to SINR constraints in a downlink multiuser MISO system. A robust transmit beamforming formulation is proposed. This robust formulation is to minimize the transmission power subject to worst-case signal-to-interference-plus-noise ratio (SINR constraints on the receivers. The challenging problem is that the worst-case SINR constraints correspond to an infinite number of nonconvex quadratic constraints. In this paper, a natural semidifinite programming (SDP relaxation problem is proposed to solve the robust beamforming problem. The main contribution of this paper is to establish the tightness of the SDP relaxation problem under proper assumption, which means that the SDP relaxation problem definitely yields rank-one solutions under the assumption. Then the SDP relaxation problem provides globally optimum solutions of the primal robust transmit beamforming problem under proper assumption and norm-constrained CSI errors. Simulation results show the correctness of the proposed theoretical results and also provide a counterexample whose solutions are not rank one. The existence of counterexample shows that the guess that the solutions of the SDP relaxation problem must be rank one is wrong, except that some assumptions (such as the one proposed in this paper hold.

Simulating non-holonomic constraints within the LCP-based simulation framework

DEFF Research Database (Denmark)

Ellekilde, Lars-Peter; Petersen, Henrik Gordon

2006-01-01

be incorporated directly, and derive formalism for how the non-holonomic contact constraints can be modelled as a combination of non-holonomic equality constraints and ordinary contacts constraints. For each of these three we are able to guarantee solvability, when using Lemke's algorithm. A number of examples......In this paper, we will extend the linear complementarity problem-based rigid-body simulation framework with non-holonomic constraints. We consider three different types of such, namely equality, inequality and contact constraints. We show how non-holonomic equality and inequality constraints can...... are included to demonstrate the non-holonomic constraints. Udgivelsesdato: Marts...

The relations of Arab Jordanian adolescents' perceived maternal parenting to teacher-rated adjustment and problems: the intervening role of perceived need satisfaction.

Science.gov (United States)

Ahmad, Ikhlas; Vansteenkiste, Maarten; Soenens, Bart

2013-01-01

Although the effects of important parenting dimensions, such as responsiveness and psychological control, are well documented among Western populations, research has only recently begun to systematically identify psychological processes that may account for the cross-cultural generalization of these effects. A first aim of this study was to examine whether perceived maternal responsiveness and psychological control would relate differentially to teacher ratings of adolescent adjustment in a vertical-collectivist society (i.e., Jordan). The most important aim of this study was to examine, on the basis of self-determination theory, whether these associations would be accounted for by perceived satisfaction of the basic psychological needs for autonomy, competence, and relatedness. Results in a large sample of Jordanian adolescents (N = 545) showed that perceived maternal psychological control and responsiveness yielded, respectively, a positive and negative association with teacher-rated problems, whereas psychological control was negatively related to teacher-rated adjustment. Further, these 2 parenting dimensions related to adjustment and problems via perceived satisfaction of the basic psychological needs for autonomy and competence (but not relatedness). The findings are discussed in light of the ongoing debate between universalistic and relativistic perspectives on parenting and adolescent adjustment.

Patient satisfaction among Spanish-speaking patients in a public health setting.

Science.gov (United States)

Welty, Elisabeth; Yeager, Valerie A; Ouimet, Claude; Menachemi, Nir

2012-01-01

Despite the growing literature on health care quality, few patient satisfaction studies have focused upon the public health setting; where many Hispanic patients receive care. The purpose of this study was to examine the differences in satisfaction between English and Spanish-speaking patients in a local health department clinical setting. We conducted a paper-based satisfaction survey of patients that visited any of the seven Jefferson County Department of Health primary care centers from March 19 to April 19, 2008. Using Chi-squared analyses we found 25% of the Spanish-speaking patients reported regularly having problems getting an appointment compared to 16.8% among English-speakers (p speaking patients controlling for center location, purpose of visit, and time spent waiting. Specifically, Spanish speaking patients were more likely to report problems getting an appointment and less likely to report having their medical problems resolved when leaving their visit as compared to those who spoke English. Findings presented herein may provide insight regarding the quality of care received, specifically regarding patient satisfaction in the public health setting. © 2011 National Association for Healthcare Quality.

Model quality assessment using distance constraints from alignments

DEFF Research Database (Denmark)

Paluszewski, Martin; Karplus, Kevin

2008-01-01

that model which is closest to the true structure. In this article, we present a new approach for addressing the MQA problem. It is based on distance constraints extracted from alignments to templates of known structure, and is implemented in the Undertaker program for protein structure prediction. One novel...... feature is that we extract noncontact constraints as well as contact constraints. We describe how the distance constraint extraction is done and we show how they can be used to address the MQA problem. We have compared our method on CASP7 targets and the results show that our method is at least comparable...... with the best MQA methods that were assessed at CASP7. We also propose a new evaluation measure, Kendall's tau, that is more interpretable than conventional measures used for evaluating MQA methods (Pearson's r and Spearman's rho). We show clear examples where Kendall's tau agrees much more with our intuition...

Solving binary-state multi-objective reliability redundancy allocation series-parallel problem using efficient epsilon-constraint, multi-start partial bound enumeration algorithm, and DEA

International Nuclear Information System (INIS)

Khalili-Damghani, Kaveh; Amiri, Maghsoud

2012-01-01

In this paper, a procedure based on efficient epsilon-constraint method and data envelopment analysis (DEA) is proposed for solving binary-state multi-objective reliability redundancy allocation series-parallel problem (MORAP). In first module, a set of qualified non-dominated solutions on Pareto front of binary-state MORAP is generated using an efficient epsilon-constraint method. In order to test the quality of generated non-dominated solutions in this module, a multi-start partial bound enumeration algorithm is also proposed for MORAP. The performance of both procedures is compared using different metrics on well-known benchmark instance. The statistical analysis represents that not only the proposed efficient epsilon-constraint method outperform the multi-start partial bound enumeration algorithm but also it improves the founded upper bound of benchmark instance. Then, in second module, a DEA model is supplied to prune the generated non-dominated solutions of efficient epsilon-constraint method. This helps reduction of non-dominated solutions in a systematic manner and eases the decision making process for practical implementations. - Highlights: ► A procedure based on efficient epsilon-constraint method and DEA was proposed for solving MORAP. ► The performance of proposed procedure was compared with a multi-start PBEA. ► Methods were statistically compared using multi-objective metrics.

A comparison of Heuristic method and Llewellyn’s rules for identification of redundant constraints

Science.gov (United States)

Estiningsih, Y.; Farikhin; Tjahjana, R. H.

2018-03-01

Important techniques in linear programming is modelling and solving practical optimization. Redundant constraints are consider for their effects on general linear programming problems. Identification and reduce redundant constraints are for avoidance of all the calculations associated when solving an associated linear programming problems. Many researchers have been proposed for identification redundant constraints. This paper a compararison of Heuristic method and Llewellyn’s rules for identification of redundant constraints.

Evaluating Direct Manipulation Operations for Constraint-Based Layout

OpenAIRE

Zeidler , Clemens; Lutteroth , Christof; Stuerzlinger , Wolfgang; Weber , Gerald

2013-01-01

Part 11: Interface Layout and Data Entry; International audience; Layout managers are used to control the placement of widgets in graphical user interfaces (GUIs). Constraint-based layout managers are more powerful than other ones. However, they are also more complex and their layouts are prone to problems that usually require direct editing of constraints. Today, designers commonly use GUI builders to specify GUIs. The complexities of traditional approaches to constraint-based layouts pose c...

The Comparison of Marital Satisfaction between Fertile and Iinfertile Women

Directory of Open Access Journals (Sweden)

Seyed Abdolmajid Bahrainian

2009-04-01

Full Text Available Objectives: This research studied and compared marital satisfaction level of the women who have infertility problem with those who does not have this problem. Methods: Totally 180 persons participated (90 infertile women and 90 fertile women were participated in this study. Participants were comprised of those referring to 3 Tehran city infertility centers. For data gathering in this research, the constructed questionnaire and Enrich Marital Satisfactions questionnaire have been used. Data analysis has been done with use of two independent t-tests and one way variance analysis has been done. Results: Results showed significant difference in satisfaction level of the fertile and infertile women, while, our research hypotheses were not confirmed in this regard by studying factors effective on marital satisfaction of the infertile women. The number of unsuccessful pregnancies whether in fertile women or infertile women didn’t have considerable effect on the marital satisfaction, while, effect of this factor on marital satisfaction level of the infertile women was higher than that on the fertile women. Discussion: Generally, by inclusion of limitations in this plan, it is impossible to generalize the present research results with difficulty, though it is inevitable to emphasize on negative consequences of the spouses' life and it is important to pay attention to its different dimensions.

Serious Leisure and People with Orthopedic Impairment: Benefits and Constraints

OpenAIRE

Manolya AKSATAN; Zehra Gökçe SEL

2017-01-01

There are many people around the world who have different types of disabilities. Understanding their needs is the first step of developing policies to increase their quality of life and satisfaction. Leisure is an essential need of disabled people and it plays an important role in disabled people’s lives. The purpose of this study is to gain a deep understanding on the serious leisure activities of people with orthopedic impairment, and also both benefits and constraints ...

The effect of job organizational factors on job satisfaction in two automotive industries in Malaysia.

Science.gov (United States)

Dawal, Siti Zawiah Md; Taha, Zahari

2007-12-01

A methodology is developed in diagnosing the effect of job organizational factors on job satisfaction in two automotive industries in Malaysia. One hundred and seventy male subjects of age 18-40 years with the mean age of 26.8 and standard deviation (SD) of 5.3 years and the mean work experience of 6.5 years and SD of 4.9 years took part in the study. Five job organizational factors were tested in the study including job rotation, work method, training, problem solving and goal setting. A job organization questionnaire was designed and was based on respondents' perception in relation to job satisfaction. The results showed that job organization factors were significantly related to job satisfaction. Job rotation, work method, training and goal setting showed strong correlation with job satisfaction while problem solving had intermediate correlation in the first automotive industry. On the other hand, most job organization factors showed intermediate correlation with job satisfaction in the second automotive industry except the training factor which had low correlation with job satisfaction. These results highlight that job rotation, work methods, problem solving and goal setting are outstanding factors in the study of job satisfaction for automotive industries.

Lot Sizing Based on Stochastic Demand and Service Level Constraint

Directory of Open Access Journals (Sweden)

hajar shirneshan

2012-06-01

Full Text Available Considering its application, stochastic lot sizing is a significant subject in production planning. Also the concept of service level is more applicable than shortage cost from managers' viewpoint. In this paper, the stochastic multi period multi item capacitated lot sizing problem has been investigated considering service level constraint. First, the single item model has been developed considering service level and with no capacity constraint and then, it has been solved using dynamic programming algorithm and the optimal solution has been derived. Then the model has been generalized to multi item problem with capacity constraint. The stochastic multi period multi item capacitated lot sizing problem is NP-Hard, hence the model could not be solved by exact optimization approaches. Therefore, simulated annealing method has been applied for solving the problem. Finally, in order to evaluate the efficiency of the model, low level criterion has been used .

AN INVESTIGATION OF RELATIONSHIP BETWEEN LEADERSHIP STYLES OF HUMAN RESOURCES MANAGER, CREATIVE PROBLEM SOLVING CAPACITY AND CAREER SATISFACTION: AN EMPIRICAL STUDY

OpenAIRE

Hüseyin YILMAZ

2016-01-01

The aim of this study is the creative problem-solving capacity of the organization with leadership behaviors of human resources managers and employees to examine the relationship between career satisfaction and is tested empirically. Research within the scope of the required data structured questionnaire method, operating in the province of Aydin was obtained from 130 employees working in five star hotels. Democratic leadership style according to the factor analysis, easygoing, participants c...

Content validity and satisfaction with a caregiver-integrated web-based rehabilitation intervention for persons with stroke.

Science.gov (United States)

Blanton, Sarah; Dunbar, Sandra; Clark, Patricia C

2018-04-01

Background Family members provide valuable contributions during rehabilitation after stroke, but frequently report higher incidences of burden, depression, and social isolation during caregiving. Thus, effective interventions to reduce stroke impact on the family are needed. Objectives To evaluate the content validity and satisfaction of a caregiver-focused web-based intervention designed to improve stroke survivor physical function while reducing caregiver negative outcomes. Methods Caregivers of individuals with stroke (N = 6) and expert rehabilitation researchers (N = 4) were presented with a novel, web-based intervention (CARE-CITE) designed to foster problem-solving and skill-building while facilitating caregiver involvement during constraint-induced movement therapy. Caregivers rated CARE-CITE for usefulness, ease of use, acceptability, and time to complete. Rehabilitation experts evaluated content for accuracy, feasibility, acceptability, problem relevance and ease of use. Ratings were assessed using a five-point Likert-type response scales (1 = strongly disagree to 5 = strongly agree). Results On average, all caregivers agreed or strongly agreed that the modules were useful (4.42), easy to use (4.60), and acceptable (4.41). Mean total satisfaction score was 4.45, and average review time was 15 min per module. Expert reviewers agreed or strongly agreed that each module was accurate (4.95), feasible (4.8), easy to use (4.86), acceptable (4.96), and had appropriate problem relevance (4.65). Conclusions The CARE-CITE intervention may be a viable program for caregivers of patients with stroke. Currently a pilot study is underway to evaluate the impact of the intervention on caregiver mental health, family conflict around stroke recovery and stroke survivor upper extremity function.

Constraints and Logic Programming in Grammars and Language Analysis

DEFF Research Database (Denmark)

Christiansen, Henning

2014-01-01

Constraints are an important notion in grammars and language analysis, and constraint programming techniques have been developed concurrently for solving a variety of complex problems. In this chapter we consider the synthesis of these branches into practical and effective methods for language...... methods that combine constraints with logic grammars such as Definite Clause Grammars and CHR Grammars, and show also a direct relationship to abductive reasoning....

Career satisfaction and burnout among Ghanaian physicians.

Science.gov (United States)

Opoku, Samuel T; Apenteng, Bettye A

2014-03-01

Thus far, there has been limited inquiry into the factors associated with physician career satisfaction and burnout in Ghana, although the two have been linked to the brain drain problem. The objective of this study was to assess career satisfaction and burnout among physicians practicing in a developing nation, Ghana. A 21-item instrument was used to assess career satisfaction among actively practicing Ghanaian physicians, using items adapted from the Physician Worklife Study survey. Burnout was assessed using the Abbreviated Maslach's Burnout Inventory. Two hundred physicians participated in the online survey from December 2012 to February 2013. Generally, physicians in Ghana expressed moderate overall career satisfaction. However, they were least satisfied with the availability of resources, their compensation and work-life balance. Overall, burnout was low in the study population; however physicians exhibited moderate levels of emotional exhaustion. Career satisfaction was negatively associated with the burnout dimensions of depersonalization, emotional exhaustion and low personal accomplishment. Health policy-makers in Ghana should address issues relating to resource adequacy, compensation and the work-life balance of physicians in order to improve the overall career satisfaction of an already dwindling physician workforce.

Psychometric properties and factor structure of the 13-item satisfaction with daily occupations scale when used with people with mental health problems.

Science.gov (United States)

Eklund, Mona; Bäckström, Martin; Eakman, Aaron M

2014-12-24

In mental health care practice and research it is increasingly recognized that clients' subjective perceptions of everyday occupations, such as satisfaction, are important in recovery from mental illness. Instruments thus need to be developed to assess satisfaction with everyday occupations. The aim of the present study was to assess psychometric properties of the 13-item Satisfaction with Daily Occupation (SDO-13) when used with people with mental health problems, including its internal consistency, factor structure, construct validity and whether the scale produced ceiling or floor effects. An additional question concerned if the factor structure varied whether the participants were, or were not, presently engaged in the activity they rated. The interview-based SDO-13 includes items pertaining to work/studies, leisure, home maintenance, and self-care occupations. Whether the person currently performs an occupation or not, he/she is asked to indicate his/her satisfaction with that occupation. The SDO-13 was completed with 184 persons with mental illness. Residual variables were created to remove the variation linked with currently performing the targeted occupation or not and to assess the factor structure of the SDO-13. The indicators of general satisfaction with daily occupations, self-esteem and global functioning were used to assess construct validity. The statistical methods included tests of homogeneity, confirmatory factor analysis and Pearson correlations. The internal consistency was satisfactory at 0.79. A three-factor solution indicated that the construct behind the SDO-13 was composed of three facets; Taking care of oneself and the home, Work and studies, and Leisure and relaxation. The same factor structure was valid for both original scores and the residuals. An expected pattern of correlations with the indicators was mainly found, suggesting basic construct validity. No ceiling or floor effects were found. Taken together, the findings suggest the

A Hybrid Tabu Search Algorithm for a Real-World Open Vehicle Routing Problem Involving Fuel Consumption Constraints

Directory of Open Access Journals (Sweden)

Yunyun Niu

2018-01-01

Full Text Available Outsourcing logistics operation to third-party logistics has attracted more attention in the past several years. However, very few papers analyzed fuel consumption model in the context of outsourcing logistics. This problem involves more complexity than traditional open vehicle routing problem (OVRP, because the calculation of fuel emissions depends on many factors, such as the speed of vehicles, the road angle, the total load, the engine friction, and the engine displacement. Our paper proposed a green open vehicle routing problem (GOVRP model with fuel consumption constraints for outsourcing logistics operations. Moreover, a hybrid tabu search algorithm was presented to deal with this problem. Experiments were conducted on instances based on realistic road data of Beijing, China, considering that outsourcing logistics plays an increasingly important role in China’s freight transportation. Open routes were compared with closed routes through statistical analysis of the cost components. Compared with closed routes, open routes reduce the total cost by 18.5% with the fuel emissions cost down by nearly 29.1% and the diver cost down by 13.8%. The effect of different vehicle types was also studied. Over all the 60- and 120-node instances, the mean total cost by using the light-duty vehicles is the lowest.

Nonnegative Matrix Factorization with Rank Regularization and Hard Constraint.

Science.gov (United States)

Shang, Ronghua; Liu, Chiyang; Meng, Yang; Jiao, Licheng; Stolkin, Rustam

2017-09-01

Nonnegative matrix factorization (NMF) is well known to be an effective tool for dimensionality reduction in problems involving big data. For this reason, it frequently appears in many areas of scientific and engineering literature. This letter proposes a novel semisupervised NMF algorithm for overcoming a variety of problems associated with NMF algorithms, including poor use of prior information, negative impact on manifold structure of the sparse constraint, and inaccurate graph construction. Our proposed algorithm, nonnegative matrix factorization with rank regularization and hard constraint (NMFRC), incorporates label information into data representation as a hard constraint, which makes full use of prior information. NMFRC also measures pairwise similarity according to geodesic distance rather than Euclidean distance. This results in more accurate measurement of pairwise relationships, resulting in more effective manifold information. Furthermore, NMFRC adopts rank constraint instead of norm constraints for regularization to balance the sparseness and smoothness of data. In this way, the new data representation is more representative and has better interpretability. Experiments on real data sets suggest that NMFRC outperforms four other state-of-the-art algorithms in terms of clustering accuracy.

Effect of Marital Relationship Enrichment Program on Marital Satisfaction, Marital Intimacy, and Sexual Satisfaction of Infertile Couples.

Science.gov (United States)

Masoumi, Seyedeh Zahra; Khani, Somayeh; Kazemi, Farideh; Kalhori, Fatemeh; Ebrahimi, Reyhaneh; Roshanaei, Ghodratollah

2017-10-01

Infertile couples only think of having children during their sexual intercourse, and their constant concern about this issue increases their stress level. Psychosocial and social stress leads to decreased life satisfaction, increased marital problems, and reduced sexual confidence. This study aims to determine the effect of enrichment program on marital and sexual satisfaction as well as marital intimacy among infertile couples. This randomized controlled clinical trial was conducted on 50 infertile couples in 2013 in Hamedan. The marital relationship enrichment program was taught to the experimental group during seven 90 minutes sessions. Enrich marital satisfaction, Linda Berg sexual satisfaction, and marital intimacy questionnaires were completed by both groups in 3 pretest steps immediately after the end of training sessions, and 8 weeks later. The results were analyzed in STATA11 software using t test, Chi-square, ANCOVA, RM-ANOVA, and Bonferroni post-hoc test. To check the data normality, Kolmogorov-Smirnov test was used. Pintimacy immediately after the test (P=0.04) and 8 weeks after the test (Pintimacy and also marital and sexual satisfaction in infertile couples (Registration Number: IRCT201604299014N97). Copyright© by Royan Institute. All rights reserved.

Exploring direct and indirect influences of physical work environment on job satisfaction for early-career registered nurses employed in hospitals.

Science.gov (United States)

Djukic, Maja; Kovner, Christine T; Brewer, Carol S; Fatehi, Farida; Greene, William H

2014-08-01

We explored direct and indirect influences of physical work environment on job satisfaction in a nationally representative sample of 1,141 early-career registered nurses. In the fully specified model, physical work environment had a non-significant direct effect on job satisfaction. The path analysis used to test multiple indirect effects showed that physical work environment had a positive indirect effect (p nurse-physician relations, quantitative workload, organizational constraints, distributive justice, promotional opportunity, local and non-local job opportunities. The findings make important contributions to the understanding of the relationship between physical work environment and job satisfaction. The results can inform health care leaders' insight about how physical work environment influences nurses' job satisfaction. © 2014 Wiley Periodicals, Inc.

Implementering Run-time Evaluation of Distributed Timing Constraints in a Micro Kernel

DEFF Research Database (Denmark)

Kristensen, C.H.; Drejer, N.; Nielsen, Jens Frederik Dalsgaard

In the present paper we describe a solution to the problem of implementing time-optimal evaluation of timing constraints in distributed real-time systems......In the present paper we describe a solution to the problem of implementing time-optimal evaluation of timing constraints in distributed real-time systems...

Hyundai’s Customer Satisfaction Analysis in Azerbaijan Market

Directory of Open Access Journals (Sweden)

Khayala Babayeva

2016-12-01

Full Text Available In modern economies, level of customer satisfaction is main indicator which intends to show organization’s position in comparison with its competitors. Determining customer satisfaction level allows any organization to detect the problems and gives a way in order to solve such issues. In this article, the aim is to measure the satisfaction level of Hyundai customers in Azerbaijan and for that a survey has been conducted. The research has been implemented on two basis: customer Satisfaction of Hyundai clients on a the car they drive; and b the service they have paid for repairing their car in the service center. Authors have developed confidence interval and hypothesis testing for each outcome from the survey. In addition to these, NPS level of Hyundai has been computed. Those figures help the authors to measure the real population’s satisfaction level. The results of the analysis claim that ultimate amount of customers are dissatisfied with car’s quality. Furthermore most of drivers’ satisfaction level of services which Hyundai provides is satisfactory.

Learning With Mixed Hard/Soft Pointwise Constraints.

Science.gov (United States)

Gnecco, Giorgio; Gori, Marco; Melacci, Stefano; Sanguineti, Marcello

2015-09-01

A learning paradigm is proposed and investigated, in which the classical framework of learning from examples is enhanced by the introduction of hard pointwise constraints, i.e., constraints imposed on a finite set of examples that cannot be violated. Such constraints arise, e.g., when requiring coherent decisions of classifiers acting on different views of the same pattern. The classical examples of supervised learning, which can be violated at the cost of some penalization (quantified by the choice of a suitable loss function) play the role of soft pointwise constraints. Constrained variational calculus is exploited to derive a representer theorem that provides a description of the functional structure of the optimal solution to the proposed learning paradigm. It is shown that such an optimal solution can be represented in terms of a set of support constraints, which generalize the concept of support vectors and open the doors to a novel learning paradigm, called support constraint machines. The general theory is applied to derive the representation of the optimal solution to the problem of learning from hard linear pointwise constraints combined with soft pointwise constraints induced by supervised examples. In some cases, closed-form optimal solutions are obtained.

Factors that influence nurses' job satisfaction.

Science.gov (United States)

Ma, Chen-Chung; Samuels, Michael E; Alexander, Judith W

2003-05-01

To examine factors affecting the job satisfaction of registered nurses (RNs). A growing recognition of job dissatisfaction among RNs in South Carolina hospitals has contributed to current problems with recruitment and retention. If administrators identify factors influencing RNs' job satisfaction in hospitals and implement strategies to address these factors, RN turnover rates will decrease and recruiting and retention rates will increase. A cross-sectional study of secondary data was designed to identify the individual, work, and geographic factors that impact nursing job satisfaction at the state level. A 27-question self-administered survey was sent to 17,500 RNs in South Carolina with postage-paid envelopes for their responses. Surveys from 3472 nurses were completed anonymously. Univariate statistics were used to describe the study sample. One-way and multivariable Analysis of Variance were used to determine which variables contributed the most to job satisfaction. For about two thirds of the RNs, job satisfaction remained the same or had lessened over the past 2 years. In addition, statistically significant differences were found between job satisfaction and years of service, job position, hospital retirement plan, and geographic area. The findings have implications for nurse managers and hospital administrators for planning and implementing effective health policies that will meet the unique needs of their staffs and organizations. Such research is particularly relevant in this difficult time of nursing shortages throughout the healthcare industry.

Constraints to solve parallelogram grid problems in 2D non separable linear canonical transform

Science.gov (United States)

Zhao, Liang; Healy, John J.; Muniraj, Inbarasan; Cui, Xiao-Guang; Malallah, Ra'ed; Ryle, James P.; Sheridan, John T.

2017-05-01

The 2D non-separable linear canonical transform (2D-NS-LCT) can model a range of various paraxial optical systems. Digital algorithms to evaluate the 2D-NS-LCTs are important in modeling the light field propagations and also of interest in many digital signal processing applications. In [Zhao 14] we have reported that a given 2D input image with rectangular shape/boundary, in general, results in a parallelogram output sampling grid (generally in an affine coordinates rather than in a Cartesian coordinates) thus limiting the further calculations, e.g. inverse transform. One possible solution is to use the interpolation techniques; however, it reduces the speed and accuracy of the numerical approximations. To alleviate this problem, in this paper, some constraints are derived under which the output samples are located in the Cartesian coordinates. Therefore, no interpolation operation is required and thus the calculation error can be significantly eliminated.

Toward making the constraint hypersurface an attractor in free evolution

International Nuclear Information System (INIS)

Fiske, David R.

2004-01-01

When constructing numerical solutions to systems of evolution equations subject to a constraint, one must decide what role the constraint equations will play in the evolution system. In one popular choice, known as free evolution, a simulation is treated as a Cauchy problem, with the initial data constructed to satisfy the constraint equations. This initial data are then evolved via the evolution equations with no further enforcement of the constraint equations. The evolution, however, via the discretized evolution equations introduce constraint violating modes at the level of truncation error, and these constraint violating modes will behave in a formalism dependent way. This paper presents a generic method for incorporating the constraint equations into the evolution equations so that the off-constraint dynamics are biased toward the constraint satisfying solutions

Family caregivers' attributions about care-recipient behaviour: does caregiver relationship satisfaction mediate the attribution-distress relationship?

Science.gov (United States)

Hui, Siu-Kuen Azor; Elliott, Timothy R; Martin, Roy; Uswatte, Gitendra

2011-09-01

The relations of caregiver attributions about care-recipient's problem behaviour to caregiving relationship satisfaction and caregiver distress were examined. This is a cross sectional study. Seventy-five family caregivers of individuals diagnosed with various disabling health conditions were recruited and interviewed. Caregiver attributions (internality, intentionality, responsibility, and controllability), caregiving relationship satisfaction, and caregiver distress variables were measured. Structural equation techniques tested an a priori model of the latent constructs of caregiver attributions and caregiver relationship satisfaction to caregiver distress. Maladaptive caregiver attributions (i.e., more trait, higher intentionality, higher responsibility, and higher controllability) about care-recipients' problem behaviours predicted lower caregiving relationship satisfaction, which in turn was predictive of higher caregiver distress. Unexpectedly, caregiver attributions were not directly related to caregiver distress. However, attributions had an indirect effect on distress through relationship satisfaction. Younger caregivers experienced higher caregiver distress. Caregivers' explanations about care-recipient's problem behaviour are indicative of their satisfaction in the relationship with the care recipient, and poor caregiving relationship satisfaction is predictive of caregiver distress. Caregiver attributions and relationship quality may be considered in interventions with family caregivers. ©2010 The British Psychological Society.

Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems

Directory of Open Access Journals (Sweden)

E. Osaba

2014-01-01

Full Text Available Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found. Anyway, there are many recently proposed techniques, such as the artificial bee colony and imperialist competitive algorithm. This paper is focused on one recently published technique, the one called Golden Ball (GB. The GB is a multiple-population metaheuristic based on soccer concepts. Although it was designed to solve combinatorial optimization problems, until now, it has only been tested with two simple routing problems: the traveling salesman problem and the capacitated vehicle routing problem. In this paper, the GB is applied to four different combinatorial optimization problems. Two of them are routing problems, which are more complex than the previously used ones: the asymmetric traveling salesman problem and the vehicle routing problem with backhauls. Additionally, one constraint satisfaction problem (the n-queen problem and one combinatorial design problem (the one-dimensional bin packing problem have also been used. The outcomes obtained by GB are compared with the ones got by two different genetic algorithms and two distributed genetic algorithms. Additionally, two statistical tests are conducted to compare these results.

Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems

Science.gov (United States)

Osaba, E.; Diaz, F.; Carballedo, R.; Onieva, E.; Perallos, A.

2014-01-01

Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found. Anyway, there are many recently proposed techniques, such as the artificial bee colony and imperialist competitive algorithm. This paper is focused on one recently published technique, the one called Golden Ball (GB). The GB is a multiple-population metaheuristic based on soccer concepts. Although it was designed to solve combinatorial optimization problems, until now, it has only been tested with two simple routing problems: the traveling salesman problem and the capacitated vehicle routing problem. In this paper, the GB is applied to four different combinatorial optimization problems. Two of them are routing problems, which are more complex than the previously used ones: the asymmetric traveling salesman problem and the vehicle routing problem with backhauls. Additionally, one constraint satisfaction problem (the n-queen problem) and one combinatorial design problem (the one-dimensional bin packing problem) have also been used. The outcomes obtained by GB are compared with the ones got by two different genetic algorithms and two distributed genetic algorithms. Additionally, two statistical tests are conducted to compare these results. PMID:25165742

Parallel Solution of Robust Nonlinear Model Predictive Control Problems in Batch Crystallization

Directory of Open Access Journals (Sweden)

Yankai Cao

2016-06-01

Full Text Available Representing the uncertainties with a set of scenarios, the optimization problem resulting from a robust nonlinear model predictive control (NMPC strategy at each sampling instance can be viewed as a large-scale stochastic program. This paper solves these optimization problems using the parallel Schur complement method developed to solve stochastic programs on distributed and shared memory machines. The control strategy is illustrated with a case study of a multidimensional unseeded batch crystallization process. For this application, a robust NMPC based on min–max optimization guarantees satisfaction of all state and input constraints for a set of uncertainty realizations, and also provides better robust performance compared with open-loop optimal control, nominal NMPC, and robust NMPC minimizing the expected performance at each sampling instance. The performance of robust NMPC can be improved by generating optimization scenarios using Bayesian inference. With the efficient parallel solver, the solution time of one optimization problem is reduced from 6.7 min to 0.5 min, allowing for real-time application.

Einstein constraints in the Yang-Mills form

International Nuclear Information System (INIS)

Ashtekar, A.

1987-01-01

It is pointed out that constraints of Einstein's theory play a powerful role in both classical and quantum theory because they generate motions in spacetime, rather than in an internal space. New variables are then introduced on the Einstein phase space in terms of which constraints simplify considerably. In particular, the use of these variables enables one to imbed the constraint surface of Einstein's theory into that of Yang-Mills. The imbedding suggests new lines of attack to a number of problems in classical and quantum gravity and provides new concepts and tools to investigate the microscopic structure of space-time geometry

Extension of Modified Polak-Ribière-Polyak Conjugate Gradient Method to Linear Equality Constraints Minimization Problems

Directory of Open Access Journals (Sweden)

Zhifeng Dai

2014-01-01

Full Text Available Combining the Rosen gradient projection method with the two-term Polak-Ribière-Polyak (PRP conjugate gradient method, we propose a two-term Polak-Ribière-Polyak (PRP conjugate gradient projection method for solving linear equality constraints optimization problems. The proposed method possesses some attractive properties: (1 search direction generated by the proposed method is a feasible descent direction; consequently the generated iterates are feasible points; (2 the sequences of function are decreasing. Under some mild conditions, we show that it is globally convergent with Armijio-type line search. Preliminary numerical results show that the proposed method is promising.

Generalized Pauli constraints in small atoms

Science.gov (United States)

Schilling, Christian; Altunbulak, Murat; Knecht, Stefan; Lopes, Alexandre; Whitfield, James D.; Christandl, Matthias; Gross, David; Reiher, Markus

2018-05-01

The natural occupation numbers of fermionic systems are subject to nontrivial constraints, which include and extend the original Pauli principle. A recent mathematical breakthrough has clarified their mathematical structure and has opened up the possibility of a systematic analysis. Early investigations have found evidence that these constraints are exactly saturated in several physically relevant systems, e.g., in a certain electronic state of the beryllium atom. It has been suggested that, in such cases, the constraints, rather than the details of the Hamiltonian, dictate the system's qualitative behavior. Here, we revisit this question with state-of-the-art numerical methods for small atoms. We find that the constraints are, in fact, not exactly saturated, but that they lie much closer to the surface defined by the constraints than the geometry of the problem would suggest. While the results seem incompatible with the statement that the generalized Pauli constraints drive the behavior of these systems, they suggest that the qualitatively correct wave-function expansions can in some systems already be obtained on the basis of a limited number of Slater determinants, which is in line with numerical evidence from quantum chemistry.

Automatic Constraint Detection for 2D Layout Regularization.

Science.gov (United States)

Jiang, Haiyong; Nan, Liangliang; Yan, Dong-Ming; Dong, Weiming; Zhang, Xiaopeng; Wonka, Peter

2016-08-01

In this paper, we address the problem of constraint detection for layout regularization. The layout we consider is a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important in digitizing plans or images, such as floor plans and facade images, and in the improvement of user-created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm that automatically detects constraints. We evaluate the proposed framework using a variety of input layouts from different applications. Our results demonstrate that our method has superior performance to the state of the art.

Automatic Constraint Detection for 2D Layout Regularization

KAUST Repository

Jiang, Haiyong

2015-09-18

In this paper, we address the problem of constraint detection for layout regularization. As layout we consider a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important for digitizing plans or images, such as floor plans and facade images, and for the improvement of user created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate the layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm to automatically detect constraints. In our results, we evaluate the proposed framework on a variety of input layouts from different applications, which demonstrates our method has superior performance to the state of the art.

Reliability based topology optimization for continuum structures with local failure constraints

DEFF Research Database (Denmark)

Luo, Yangjun; Zhou, Mingdong; Wang, Michael Yu

2014-01-01

This paper presents an effective method for stress constrained topology optimization problems under load and material uncertainties. Based on the Performance Measure Approach (PMA), the optimization problem is formulated as to minimize the objective function under a large number of (stress......-related) target performance constraints. In order to overcome the stress singularity phenomenon caused by the combined stress and reliability constraints, a reduction strategy on target reliability index is proposed and utilized together with the ε-relaxation approach. Meanwhile, an enhanced aggregation method...... is employed to aggregate the selected active constraints using a general K–S function, which avoids expensive computational cost from the large-scale nature of local failure constraints. Several numerical examples are given to demonstrate the validity of the present method....

The roles of constraint-based and dedication-based influences on user's continued online shopping behavior.

Science.gov (United States)

Chang, Su-Chao; Chou, Chi-Min

2012-11-01

The objective of this study was to determine empirically the role of constraint-based and dedication-based influences as drivers of the intention to continue using online shopping websites. Constraint-based influences consist of two variables: trust and perceived switching costs. Dedication-based influences consist of three variables: satisfaction, perceived usefulness, and trust. The current results indicate that both constraint-based and dedication-based influences are important drivers of the intention to continue using online shopping websites. The data also shows that trust has the strongest total effect on online shoppers' intention to continue using online shopping websites. In addition, the results indicate that the antecedents of constraint-based influences, technical bonds (e.g., perceived operational competence and perceived website interactivity) and social bonds (e.g., perceived relationship investment, community building, and intimacy) have indirect positive effects on the intention to continue using online shopping websites. Based on these findings, this research suggests that online shopping websites should build constraint-based and dedication-based influences to enhance user's continued online shopping behaviors simultaneously.

Determinants of job satisfaction for novice nurse managers employed in hospitals.

Science.gov (United States)

Djukic, Maja; Jun, Jin; Kovner, Christine; Brewer, Carol; Fletcher, Jason

Numbering close to 300,000 nurse managers represent the largest segment of the health care management workforce. Their effectiveness is, in part, influenced by their job satisfaction. We examined factors associated with job satisfaction of novice frontline nurse managers. We used a cross-sectional, correlational survey design. The sample consisted of responders to the fifth wave of a multiyear study of new nurses in 2013 (N = 1,392; response rate of 69%) who reported working as managers (n = 209). The parent study sample consisted of registered nurses who were licensed for the first time by exam 6-18 months prior in 1 of 51 selected metropolitan statistical areas and 9 rural areas across 34 U.S. states and the District of Columbia. We examined bivariate correlations between job satisfaction and 31 personal and structural variables. All variables significantly related to job satisfaction in bivariate analysis were included in a multivariate linear regression model. In addition, we tested the interaction effects of procedural justice and negative affectivity, autonomy, and organizational constraints on job satisfaction. The Cronbach's alphas for all multi-item scales ranged from .74 to .96. In the multivariate analysis, negative affectivity (β = -.169; p = .006) and procedural justice (β = .210; p = .016) were significantly correlated with job satisfaction. The combination of predictors in the model accounted for half of the variability in job satisfaction ratings (R = .51, adjusted R = .47; p <. 001). Health care executives who want to cultivate an effective novice frontline nurse manager workforce can best ensure their satisfaction by creating an organization with strong procedural justice. This could be achieved by involving managers in decision-making processes and ensuring transparency about how decisions that affect nursing are made.

Life Satisfaction Among Mothers of Individuals with Prader-Willi Syndrome.

Science.gov (United States)

Shivers, Carolyn M; Leonczyk, Caroline L; Dykens, Elisabeth M

2016-06-01

Mothers of individuals with Prader-Willi syndrome (PWS) often experience numerous stressors, even when compared to mothers of children with other intellectual and developmental disabilities. Despite this, these mothers show great variability in self-reported life satisfaction. Using data from a longitudinal study of individuals with PWS and their families, the present study analyzed factors related to maternal life satisfaction, both cross-sectionally and over time. Results show that both child factors (e.g., behavior problems, hyperphagia) and maternal factors (e.g., stress, coping style) were significantly related to maternal life satisfaction. However, none of the tested variables predicted change in life satisfaction over time. Research and practice implications are discussed.

Optimal Design of Composite Structures Under Manufacturing Constraints

DEFF Research Database (Denmark)

Marmaras, Konstantinos

algorithms to perform the global optimization. The efficiency of the proposed models is examined on a set of well–defined discrete multi material and thickness optimization problems originating from the literature. The inclusion of manufacturing limitations along with structural considerations in the early...... mixed integer 0–1 programming problems. The manufacturing constraints have been treated by developing explicit models with favorable properties. In this thesis we have developed and implemented special purpose global optimization methods and heuristic techniques for solving this class of problems......This thesis considers discrete multi material and thickness optimization of laminated composite structures including local failure criteria and manufacturing constraints. Our models closely follow an immediate extension of the Discrete Material Optimization scheme, which allows simultaneous...

The manifestation of job satisfaction in doctor-patient communication: a ten-country European study.

NARCIS (Netherlands)

Bensing, J.M.; Brink-Muinen, A. van den; Boerma, W.; Dulmen, S. van

2013-01-01

Objective: Job satisfaction is a common problem in modern western health care. While a lot of studies analyzed the determinants of job (dis)satisfaction, less is known about the consequences of doctors’ job satisfaction for medical visits. The aim of this study is to examine - female and male -

Cyclic labellings with constraints at two distances

OpenAIRE

Leese, R; Noble, S D

2004-01-01

Motivated by problems in radio channel assignment, we consider the vertex-labelling of graphs with non-negative integers. The objective is to minimise the span of the labelling, subject to constraints imposed at graph distances one and two. We show that the minimum span is (up to rounding) a piecewise linear function of the constraints, and give a complete specification, together with associated optimal assignments, for trees and cycles.

A note on a model for quay crane scheduling with non-crossing constraints

DEFF Research Database (Denmark)

Santini, Alberto; Friberg, Henrik Alsing; Røpke, Stefan

2015-01-01

This article studies the quay crane scheduling problem with non-crossing constraints, which is an operational problem that arises in container terminals. An enhancement to a mixed integer programming model for the problem is proposed and a new class of valid inequalities is introduced. Computatio......This article studies the quay crane scheduling problem with non-crossing constraints, which is an operational problem that arises in container terminals. An enhancement to a mixed integer programming model for the problem is proposed and a new class of valid inequalities is introduced...

Implementing Run-Time Evaluation of Distributed Timing Constraints in a Real-Time Environment

DEFF Research Database (Denmark)

Kristensen, C. H.; Drejer, N.

1994-01-01

In this paper we describe a solution to the problem of implementing run-time evaluation of timing constraints in distributed real-time environments......In this paper we describe a solution to the problem of implementing run-time evaluation of timing constraints in distributed real-time environments...

Variational structure of inverse problems in wave propagation and vibration

Energy Technology Data Exchange (ETDEWEB)

Berryman, J.G.

1995-03-01

Practical algorithms for solving realistic inverse problems may often be viewed as problems in nonlinear programming with the data serving as constraints. Such problems are most easily analyzed when it is possible to segment the solution space into regions that are feasible (satisfying all the known constraints) and infeasible (violating some of the constraints). Then, if the feasible set is convex or at least compact, the solution to the problem will normally lie on the boundary of the feasible set. A nonlinear program may seek the solution by systematically exploring the boundary while satisfying progressively more constraints. Examples of inverse problems in wave propagation (traveltime tomography) and vibration (modal analysis) will be presented to illustrate how the variational structure of these problems may be used to create nonlinear programs using implicit variational constraints.

Financial satisfaction and financial stressors in marital satisfaction.

Science.gov (United States)

Archuleta, Kristy L; Britt, Sonya L; Tonn, Teresa J; Grable, John E

2011-04-01

Using a sample of 310 married respondents from one U.S. Midwestern state, a test was conducted to examine the association of financial satisfaction and financial stressors in a spouse's decision to stay married to the same person or leave the relationship. The role of demographic and socioeconomic variables, religiosity, psychological constructs, financial satisfaction, and financial stressors as factors influencing marital satisfaction was tested. Financial stressors were measured using a list of financial stressors adapted from the literature. Financial satisfaction was measured with a one-item scale. The Kansas Marital Satisfaction Scale was used as a validation tool to assess whether individuals would marry or not marry again. Religiosity and financial satisfaction were positively associated with marital satisfaction. A negative interaction between financial satisfaction and financial stressors was also noted. Findings suggest that respondents who are financially satisfied tend to be more stable in their marriages.

ASSESSING CUSTOMER SATISFACTION BASED ON QoS PARAMETERS

Directory of Open Access Journals (Sweden)

Alem Čolaković

2017-03-01

Full Text Available Measurement of customer sastisfaction is an efficient tool to detect problems in SP (Services Provider and their relationship with customers. Based on this measurement a relationship between customer satisfaction and loyalty can be established. It can determine the influence of key parameters on the number of users of services. The parameters of customer satisfaction and loyalty are numerous and depend on the network (network quality of services parameters, the client (the perception, expectations, beliefs, etc., employees (implementation of activities, technological developments, organizational structure, etc. This paper aims to show the way to identify key indicators and their weighted factors that affect customer satisfaction. This paper intends to emphasize relationship between quality of services, customer perception and loyalty and to present a model for examining the key parameters that significantly influence customer satisfaction and how these parameters influence customer loyalty.

Dietary restraint, life satisfaction and self-discrepancy by gender in university students

Directory of Open Access Journals (Sweden)

Berta Schnettler

2017-01-01

Full Text Available This study aimed to characterize dieting and non-dieting university students by gender, based on their satisfaction with life and their food-related life, self-discrepancy, food behavior and health-related aspects. A non-probabilistic sample of 305 students from five Chilean state universities responded a questionnaire that included the Revised Restraint Scale, the Satisfaction with Life Scale, the Satisfaction with Food-related Life Scale, the Health-related Quality of Life Index, the Nutrition Interest Scale and the Self-Discrepancy Index. Socio-demographic characteristics, food behavior, and approximate weight and height were also enquired. Chronic dieters and non-dieters were distinguished according to the median score of the Revised Restraint Scale. 51.1% of women and 55.5% of men classified as chronic dieters, sharing characteristics such as nutrition concern, mental health problems, higher body mass index, and physical and economic self-discrepancy. Women dieters reported lower life satisfaction and satisfaction with food-related life, more health problems and health-related restriction of food, while men dieters showed higher social and emotional self-discrepancy.

Constrained Optimization Based on Hybrid Evolutionary Algorithm and Adaptive Constraint-Handling Technique

DEFF Research Database (Denmark)

Wang, Yong; Cai, Zixing; Zhou, Yuren

2009-01-01

A novel approach to deal with numerical and engineering constrained optimization problems, which incorporates a hybrid evolutionary algorithm and an adaptive constraint-handling technique, is presented in this paper. The hybrid evolutionary algorithm simultaneously uses simplex crossover and two...... mutation operators to generate the offspring population. Additionally, the adaptive constraint-handling technique consists of three main situations. In detail, at each situation, one constraint-handling mechanism is designed based on current population state. Experiments on 13 benchmark test functions...... and four well-known constrained design problems verify the effectiveness and efficiency of the proposed method. The experimental results show that integrating the hybrid evolutionary algorithm with the adaptive constraint-handling technique is beneficial, and the proposed method achieves competitive...

The Home Care Crew Scheduling Problem:

DEFF Research Database (Denmark)

Rasmussen, Matias Sevel; Justesen, Tor; Dohn, Anders

In the Home Care Crew Scheduling Problem a staff of caretakers has to be assigned a number of visits to patients' homes, such that the overall service level is maximised. The problem is a generalisation of the vehicle routing problem with time windows. Required travel time between visits and time...... preference constraints. The algorithm is tested both on real-life problem instances and on generated test instances inspired by realistic settings. The use of the specialised branching scheme on real-life problems is novel. The visit clustering decreases run times significantly, and only gives a loss...... windows of the visits must be respected. The challenge when assigning visits to caretakers lies in the existence of soft preference constraints and in temporal dependencies between the start times of visits. We model the problem as a set partitioning problem with side constraints and develop an exact...

Occupant Experiences and Satisfaction with New Low-Energy Houses

DEFF Research Database (Denmark)

Knudsen, Henrik Nellemose; Thomsen, Kirsten Engelund; Mørck, Ove

2013-01-01

-energy houses that meet the future lower energy requirements of the planned Danish Building Regulations 2015. The purpose was to study experiences and satisfaction among occupants living in new low-energy houses. It included i.a. overall satisfaction, perceived indoor climate and experiences and satisfaction...... be addressed in order to make low-energy houses attractive to ordinary people. Occupants experienced among other things noise from the technical installations and that it was too hot in summer and too cold in winter, that there were a series of problems with the technical installations and that their use...

Invalid-point removal based on epipolar constraint in the structured-light method

Science.gov (United States)

Qi, Zhaoshuai; Wang, Zhao; Huang, Junhui; Xing, Chao; Gao, Jianmin

2018-06-01

In structured-light measurement, there unavoidably exist many invalid points caused by shadows, image noise and ambient light. According to the property of the epipolar constraint, because the retrieved phase of the invalid point is inaccurate, the corresponding projector image coordinate (PIC) will not satisfy the epipolar constraint. Based on this fact, a new invalid-point removal method based on the epipolar constraint is proposed in this paper. First, the fundamental matrix of the measurement system is calculated, which will be used for calculating the epipolar line. Then, according to the retrieved phase map of the captured fringes, the PICs of each pixel are retrieved. Subsequently, the epipolar line in the projector image plane of each pixel is obtained using the fundamental matrix. The distance between the corresponding PIC and the epipolar line of a pixel is defined as the invalidation criterion, which quantifies the satisfaction degree of the epipolar constraint. Finally, all pixels with a distance larger than a certain threshold are removed as invalid points. Experiments verified that the method is easy to implement and demonstrates better performance than state-of-the-art measurement systems.

Prospective associations between adolescent mental health problems and positive mental wellbeing in early old age.

Science.gov (United States)

Nishida, Atsushi; Richards, Marcus; Stafford, Mai

2016-01-01

Mental health problems in adolescence are predictive of future mental distress and psychopathology; however, few studies investigated adolescent mental health problems in relation to future mental wellbeing and none with follow-up to older age. To test prospective associations between adolescent mental health problems and mental wellbeing and life satisfaction in early old age. A total of 1561 men and women were drawn from the Medical Research Council National Survey of Health and Development (the British 1946 birth cohort). Teachers had previously completed rating scales to assess emotional adjustment and behaviours, which allowed us to extract factors of mental health problems measuring self-organisation, behavioural problems, and emotional problems during adolescence. Between the ages of 60-64 years, mental wellbeing was assessed using the Warwick-Edinburgh Mental Well-being Scale (WEMWBS) and life satisfaction was self-reported using the Satisfaction with Life Scale (SWLS). After controlling for gender, social class of origin, childhood cognitive ability, and educational attainment, adolescent emotional problems were independently inversely associated with mental wellbeing and with life satisfaction. Symptoms of anxiety/depression at 60-64 years explained the association with life satisfaction but not with mental wellbeing. Associations between adolescent self-organisation and conduct problems and mental wellbeing and life satisfaction were of negligible magnitude, but higher childhood cognitive ability significantly predicted poor life satisfaction in early old age. Adolescent self-organisation and conduct problems may not be predictive of future mental wellbeing and life satisfaction. Adolescent emotional problems may be inversely associated with future wellbeing, and may be associated with lower levels of future life satisfaction through symptoms of anxiety/depression in early old age. Initiatives to prevent and treat emotional problems in adolescence may

On quantization of time-dependent systems with constraints

International Nuclear Information System (INIS)

Gadjiev, S A; Jafarov, R G

2007-01-01

The Dirac method of canonical quantization of theories with second-class constraints has to be modified if the constraints depend on time explicitly. A solution of the problem was given by Gitman and Tyutin. In the present work we propose an independent way to derive the rules of quantization for these systems, starting from the physical equivalent theory with trivial non-stationarity

On quantization of time-dependent systems with constraints

International Nuclear Information System (INIS)

Hadjialieva, F.G.; Jafarov, R.G.

1993-07-01

The Dirac method of canonical quantization of theories with second class constraints has to be modified if the constraints depend on time explicitly. A solution of the problem was given by Gitman and Tyutin. In the present work we propose an independent way to derive the rules of quantization for these systems, starting from physical equivalent theory with trivial nonstationarity. (author). 4 refs

On quantization of time-dependent systems with constraints

Energy Technology Data Exchange (ETDEWEB)

Gadjiev, S A; Jafarov, R G [Institute for Physical Problems, Baku State University, AZ11 48 Baku (Azerbaijan)

2007-03-30

The Dirac method of canonical quantization of theories with second-class constraints has to be modified if the constraints depend on time explicitly. A solution of the problem was given by Gitman and Tyutin. In the present work we propose an independent way to derive the rules of quantization for these systems, starting from the physical equivalent theory with trivial non-stationarity.

From customer satisfaction survey to corrective actions in laboratory services in a university hospital.

Science.gov (United States)

Oja, Paula I; Kouri, Timo T; Pakarinen, Arto J

2006-12-01

To find out the satisfaction of clinical units with laboratory services in a university hospital, to point out the most important problems and defects in services, to carry out corrective actions, and thereafter to identify the possible changes in satisfaction. and Senior physicians and nurses-in-charge of the clinical units at Oulu University Hospital, Finland. Customer satisfaction survey using a questionnaire was carried out in 2001, indicating the essential aspects of laboratory services. Customer-specific problems were clarified, corrective actions were performed, and the survey was repeated in 2004. In 2001, the highest dissatisfaction rates were recorded for computerized test requesting and reporting, turnaround times of tests, and the schedule of phlebotomy rounds. The old laboratory information system was not amenable to major improvements, and it was renewed in 2004-05. Several clinical units perceived turnaround times to be long, because the tests were ordered as routine despite emergency needs. Instructions about stat requesting were given to these units. However, no changes were evident in the satisfaction level in the 2004 survey. Following negotiations with the clinics, phlebotomy rounds were re-scheduled. This resulted in a distinct increase in satisfaction in 2004. Satisfaction survey is a screening tool that identifies topics of dissatisfaction. Without further clarifications, it is not possible to find out the specific problems of customers and to undertake targeted corrective actions. Customer-specific corrections are rarely seen as improvements in overall satisfaction rates.

Satisfaction

NARCIS (Netherlands)

van der Voordt, Theo; Brunia, Sandra; Appel - Meulenbroek, Rianne; Jensen, P.A.; van der Voordt, T.

2016-01-01

This chapter presents some findings from surveys on employee satisfaction in different work environments in the Netherlands and various other European countries. It first discusses why employee satisfaction is relevant for organisations and which factors may influence employee satisfaction. Then the

GraMi: Generalized Frequent Pattern Mining in a Single Large Graph

KAUST Repository

Saeedy, Mohammed El; Kalnis, Panos

2011-01-01

resolution phase as a constraint satisfaction problem, in order to avoid the costly enumeration of all instances of each pattern in the graph. The authors also implemented CGRAMI, a version that supports structural and semantic constraints; and AGRAMI

The effects of stating problems in bilingual students' first and second languages on solving mathematical word problems.

Science.gov (United States)

Bernardo, Allan B I; Calleja, Marissa O

2005-03-01

Researchers have suggested that among bilinguals, solving word problems in mathematics is influenced by linguistic factors (K. Durkin & B. Shire, 1991; L. Verschaffel, B. Greer, & E. De Corte, 2000). Others have suggested that students exhibit a strong tendency to exclude real-world constraints in solving mathematics word problems (L. Verschaffel, E. De Corte, & S. Lasure, 1994). In the present study, the authors explored the effects of stating word problems in either Filipino or English on how Filipino-English bilingual students solved word problems in which the solution required the application of real-world knowledge. The authors asked bilingual students to solve word problems in either their first or second language. For some of the word problems, real-life constraints prevented straightforward application of mathematical procedures. The authors analyzed the students' solutions to determine whether the language of the word problems affected the tendency to apply real-life constraints in the solution. Results showed that the bilingual students (a) rarely considered real-life constraints in their solutions, (b) were more successful in understanding and solving word problems that were stated in their first language, and (c) were more likely to experience failure in finding a solution to problems stated in their second language. The results are discussed in terms of the relationship between linguistic and mathematical problem-solving processes among bilinguals.

Mars Rover Sample Return aerocapture configuration design and packaging constraints

Science.gov (United States)

Lawson, Shelby J.

1989-01-01

This paper discusses the aerodynamics requirements, volume and mass constraints that lead to a biconic aeroshell vehicle design that protects the Mars Rover Sample Return (MRSR) mission elements from launch to Mars landing. The aerodynamic requirements for Mars aerocapture and entry and packaging constraints for the MRSR elements result in a symmetric biconic aeroshell that develops a L/D of 1.0 at 27.0 deg angle of attack. A significant problem in the study is obtaining a cg that provides adequate aerodynamic stability and performance within the mission imposed constraints. Packaging methods that relieve the cg problems include forward placement of aeroshell propellant tanks and incorporating aeroshell structure as lander structure. The MRSR missions developed during the pre-phase A study are discussed with dimensional and mass data included. Further study is needed for some missions to minimize MRSR element volume so that launch mass constraints can be met.

Teaching Database Design with Constraint-Based Tutors

Science.gov (United States)

Mitrovic, Antonija; Suraweera, Pramuditha

2016-01-01

Design tasks are difficult to teach, due to large, unstructured solution spaces, underspecified problems, non-existent problem solving algorithms and stopping criteria. In this paper, we comment on our approach to develop KERMIT, a constraint-based tutor that taught database design. In later work, we re-implemented KERMIT as EER-Tutor, and…

Optimal power allocation of a sensor node under different rate constraints

KAUST Repository

Ayala Solares, Jose Roberto; Rezki, Zouheir; Alouini, Mohamed-Slim

2012-01-01

The optimal transmit power of a sensor node while satisfying different rate constraints is derived. First, an optimization problem with an instantaneous transmission rate constraint is addressed. Next, the optimal power is analyzed, but now

Influence of working conditions on job satisfaction in anaesthetists.

Science.gov (United States)

Kinzl, J F; Knotzer, H; Traweger, C; Lederer, W; Heidegger, T; Benzer, A

2005-02-01

We studied job satisfaction, physical health, emotional well-being and working conditions in 125 Austrian and Swiss anaesthetists. Responses to self-reporting questionnaires were evaluated. Dependent variables included job satisfaction, emotional well-being and physical health. Independent variables included age, sex, marital status, position and working conditions as assessed by the Instrument for Stress-related Job Analysis. Control over work shows a strong effect on job satisfaction in anaesthetists, for example influence on handling tasks (P=0.001), time control (P=0.002) and participation (P=0.001), whereas task demands and task-related problems did not have any effect. Anaesthetists in leading positions and specialists reported lower job satisfaction (P=0.012) than did anaesthetists in non-leading positions. Job satisfaction was associated with better physical health (P=0.001) and better emotional well-being (P=0.005). Our results suggest that a high level of job satisfaction in anaesthetists correlates with interesting work demands and the opportunity to contribute skills and ideas. To improve job satisfaction, more attention should be paid to improving working conditions, including control over decision-making, and allowing anaesthetists to have more influence on their own work pace and work schedule.

The Relationship Between Job Satisfaction and Psychological/Physical Health among Malaysian Working Women.

Science.gov (United States)

Aazami, Sanaz; Shamsuddin, Khadijah; Akmal, Syaqirah; Azami, Golnaz

2015-01-01

The workplace environment has a great influence on employees' health. Job dissatisfaction has been widely recognised as a workplace stressor that can influence employees' psychological and physical health statuses. However, job satisfaction is a multi-dimensional concept, and it is necessary to investigate its different facets and their unique consequences. Therefore, the aim of this study was to assess the relationship between the nine facets of job satisfaction and psychological health and somatic complaints (i.e., sleep disorders, headache, gastro-intestinal and respiratory problems). This cross-sectional study was conducted among 567 Malaysian women working in the public sector. Data collection was conducted using a series of self-administered questionnaires. The results of this study show that there is a link between job satisfaction and psychological distress as well as four somatic complaints. Satisfaction with the nature of work was the strongest predictor for psychological distress, sleep disorders, headaches and gastro-intestinal problems. From the results of this study, we conclude that there is a link between job satisfaction and the health status of employees. In addition, job satisfaction levels vary across different dimensions and can even differ from an individual's feelings of global job satisfaction. Policies and practices should focus on improving working conditions to enhance the fit of the job and the employee.

Topology optimization of continuum structure with dynamic constraints using mode identification

International Nuclear Information System (INIS)

Li, Jianhongyu; Chen, Shenyan; Huang, Hai

2015-01-01

For the problems such as mode exchange and localized modes in topology optimization of continuum structure with dynamic constraints, it is difficult to apply the traditional optimization model which considers fixed order mode frequencies as constraints in optimization calculation. A new optimization model is established, in which the dynamical constraints are changed as frequencies of structural principal vibrations. The order of the principal vibrations is recognized through modal identification in the optimization process, and the constraints are updated to make the optimization calculation execute smoothly. Localized mode elimination techniques are introduced to reduce the localized modes induced by the low density elements, which could improve the optimization efficiency. A new optimization process is designed, which achieves the purpose of overcoming mode exchange problem and localized mode problem at the cost of increasing several structural analyses. Optimization system is developed by using Nastran to perform structural analysis and sensitivity analysis and two-level multipoint approximation algorithm as optimizer. Numerical results verified that the presented method is effective and reasonable.

Evaluation of Patients’ Satisfaction after Class III Orthognathic Surgery

Science.gov (United States)

Magro-Filho, Osvaldo; Oliveira, Derly Tescaro Narcizo; Martins, Lidia Pimenta; Salazar, Marcio; Medeiros, Rodrigo Antonio De; Santos, Daniela Micheline Dos

2015-01-01

Background Well-planned orthognathic surgery improves psychological health, aesthetics and function of patients. Aim The present study aimed to investigate patients’ satisfaction after orthognathic surgery by means of a satisfaction questionnaire before and after surgery. Materials and Methods A total of 29 patients was selected (17 women and 12 men), with a mean age of 28 years, randomly selected from a private clinic at Araçatuba – São Paulo by two investigators. Anamnesis and clinical examination were performed. Subjects with facial deformities submitted to orthodontic treatment before and after orthognathic surgery with a minimum post-surgery period of 6 months, answered a satisfaction questionnaire composed of 10 questions regarding dental and facial aesthetics. In this study, the maximum satisfaction score was 10. Results Regarding aesthetics, two satisfaction parameters were investigated: dental and facial. For all indices, the average satisfaction was up to score 7. Conclusion According to the results, it can be concluded that orthognathic surgery has been an effective treatment for dentofacial deformities, aesthetics and functional problems, what was verified by pre and postoperative questionnaire application. PMID:26557610

Evaluation of Patients' Satisfaction after Class III Orthognathic Surgery.

Science.gov (United States)

Magro-Filho, Osvaldo; Goiato, Marcelo Coelho; Oliveira, Derly Tescaro Narcizo; Martins, Lidia Pimenta; Salazar, Marcio; Medeiros, Rodrigo Antonio De; Santos, Daniela Micheline Dos

2015-10-01

Well-planned orthognathic surgery improves psychological health, aesthetics and function of patients. The present study aimed to investigate patients' satisfaction after orthognathic surgery by means of a satisfaction questionnaire before and after surgery. A total of 29 patients was selected (17 women and 12 men), with a mean age of 28 years, randomly selected from a private clinic at Araçatuba - São Paulo by two investigators. Anamnesis and clinical examination were performed. Subjects with facial deformities submitted to orthodontic treatment before and after orthognathic surgery with a minimum post-surgery period of 6 months, answered a satisfaction questionnaire composed of 10 questions regarding dental and facial aesthetics. In this study, the maximum satisfaction score was 10. Regarding aesthetics, two satisfaction parameters were investigated: dental and facial. For all indices, the average satisfaction was up to score 7. According to the results, it can be concluded that orthognathic surgery has been an effective treatment for dentofacial deformities, aesthetics and functional problems, what was verified by pre and postoperative questionnaire application.

Core Self-Evaluations, life satisfaction, and sport satisfaction

OpenAIRE

Antón Aluja

2014-01-01

We investigated the association between Core Self-Evaluations (CSE) and life and sport satisfaction to assess whether the Core Self-Evaluations scale was a better predictor of life satisfaction or sport satisfaction. The study included three hundred and thirteen athletes (231 men and 82 women; age range to 47 years (Mage=22.9 years, SDage=5.9 years)). Participants completed the French language version of the CSE scale, the Satisfaction with Life Scale, and the Satisfaction with Sport Scale. A...

A Biobjective Optimization Model for Deadline Satisfaction in Line-of-Balance Scheduling with Work Interruptions Consideration

Directory of Open Access Journals (Sweden)

Xin Zou

2018-01-01

Full Text Available The line-of-balance (LOB technique has demonstrated many advantages in scheduling repetitive projects, one of which is that it allows more than one crew to be hired by an activity concurrently. The deadline satisfaction problem in LOB scheduling (DSPLOB aims to find an LOB schedule such that the project is completed within a given deadline and the total number of crews is minimized. Previous studies required a strict application of crew work continuity, which may lead to a decline in the competitiveness of solutions. This paper introduces work interruptions into the DSPLOB and presents a biobjective optimization model that can balance the two conflicting objectives of minimizing the total number of crews and maximizing work continuity. An efficient version of the ϵ-constraint method is customized to find all feasible tradeoff solutions. Then, these solutions are further improved by an automated procedure to reduce the number of interruptions for each activity without deteriorating the performance in both the objectives. The effectiveness and practicability of the proposed model are verified using a considerable number of instances. The results show that introducing work interruptions provides more flexibility in reducing the total number of crews under the LOB framework, especially for serial projects with a tight deadline constraint.

Two-agent scheduling in open shops subject to machine availability and eligibility constraints

Directory of Open Access Journals (Sweden)

Ling-Huey Su

2015-09-01

Full Text Available Purpose: The aims of this article are to develop a new mathematical formulation and a new heuristic for the problem of preemptive two-agent scheduling in open shops subject to machine maintenance and eligibility constraints. Design/methodology: Using the ideas of minimum cost flow network and constraint programming, a heuristic and a network based linear programming are proposed to solve the problem. Findings: Computational experiments show that the heuristic generates a good quality schedule with a deviation of 0.25% on average from the optimum and the network based linear programming model can solve problems up to 110 jobs combined with 10 machines without considering the constraint that each operation can be processed on at most one machine at a time. In order to satisfy this constraint, a time consuming Constraint Programming is proposed. For n = 80 and m = 10, the average execution time for the combined models (linear programming model combined with Constraint programming exceeds two hours. Therefore, the heuristic algorithm we developed is very efficient and is in need. Practical implications: Its practical implication occurs in TFT-LCD and E-paper manufacturing wherein units go through a series of diagnostic tests that do not have to be performed in any specified order. Originality/value: The main contribution of the article is to split the time horizon into many time intervals and use the dispatching rule for each time interval in the heuristic algorithm, and also to combine the minimum cost flow network with the Constraint Programming to solve the problem optimally. 

Mother's marital satisfaction associated with the quality of mother-father-child triadic interaction.

Science.gov (United States)

Korja, Riikka; Piha, Jorma; Otava, Riia; Lavanchy-Scaiola, Chloe; Ahlqvist-Björkroth, Sari; Aromaa, Minna; Räihä, Hannele

2016-08-01

Low marital satisfaction has been shown to be a risk factor for early parenthood and parent-child relationship problems (Erel & Burman, ; McHale, ). The aim of this study was to assess how parental reports of marital satisfaction related to family alliance and coordination in the observed triadic interaction. The study group included 120 families. Marital satisfaction was evaluated during pregnancy, at 4 months, and at 18 months using the Revised Dyadic Adjustment Scale (RDAS; Busby, Christensen, Crane & Larsson, ) for both parents. Mother-father-child interaction was analyzed in the Lausanne Triadic Play setting and coded using the Family Alliance Assessment Scale (Favez, Lavanchy Scaiola, Tissot, Darwiche & Frascarolo, ) when the child reached 18 months of age. The mother's higher marital satisfaction at every measuring point was associated with a cooperative family alliance and/or higher family coordination at 18 months. The father's experience of marital satisfaction was not related to family interaction at any assessment point. Our study suggests that a mother's experience of lower marital satisfaction during pregnancy may be an early sign of later problems in family relationships. © 2016 Scandinavian Psychological Associations and John Wiley & Sons Ltd.

Relationship of Life Satisfaction and Job Satisfaction among Pakistani Army Soldiers

Directory of Open Access Journals (Sweden)

Summaira Naz

2015-03-01

Full Text Available The present study had two main objectives; first, to discover the relationships between job satisfaction and life satisfaction in Pakistani army soldiers, second, to find out the age, salary, marital status, and education differences on job satisfaction and life satisfaction in Pakistani army soldiers. In the present study two questionnaires; Job Satisfaction Scale JSS (Macdonald & Maclntyre, 1997 and Satisfaction With Life Scale (Diener, et al., 1985; were administered to a sample (N=400 along with a demographic sheet. The results of the study revealed a significant positive correlation between job satisfaction and life satisfaction of Pakistani army soldiers. The findings of the study also showed a significant age, education, salary, and marital status differences in job satisfaction and life satisfaction. Age, marital status, and salary variables had positive correlation with job satisfaction and life satisfaction but education had a negative association with job satisfaction and life satisfaction

Geometric constraint subsets and subgraphs in the analysis of assemblies and mechanisms Geometric constraint subsets and subgraphs in the analysis of assemblies and mechanisms

Directory of Open Access Journals (Sweden)

Oscar E Ruiz

2006-06-01

Full Text Available Geometric Reasoning ability is central to many applications in CAD/CAM/CAPP environments. An increasing demand exists for Geometric Reasoning systems which evaluate the feasibility of virtual scenes specified by geometric relations. Thus, the Geometric Constraint Satisfaction or Scene Feasibility (GCS/SF problem consists of a basic scenario containing geometric entities, whose context is used to propose constraining relations among still undefined entities. If the constraint specification is consistent, the answer of the problem is one of finitely or infinitely many solution scenarios satisfying the prescribed constraints. Otherwise, a diagnostic of inconsistency is expected. The three main approaches used for this problem are numerical, procedural or operational and mathematical. Numerical and procedural approaches answer only part of the problem, and are not complete in the sense that a failure to provide an answer does not preclude the existence of one. The mathematical approach previously presented by the authors describes the problem using a set of polynomial equations. The common roots to this set of polynomials characterizes the solution space for such a problem. That work presents the use of Groebner basis techniques for verifying the consistency of the constraints. It also integrates subgroups of the Special Euclidean Group of Displacements SE(3 in the problem formulation to exploit the structure implied by geometric relations. Although theoretically sound, these techniques require large amounts of computing resources. This work proposes Divide-and-Conquer techniques applied to local GCS/SF subproblems to identify strongly constrained clusters of geometric entities. The identification and preprocessing of these clusters generally reduces the effort required in solving the overall problem. Cluster identification can be related to identifying short cycles in the Spatial Constraint graph for the GCS/SF problem. Their preprocessing

Depression, post-traumatic stress disorder, and life satisfaction in Greenlandic adults

DEFF Research Database (Denmark)

Zaragoza Scherman, Alejandra

2017-01-01

problems or a sense of wellbeing. In this study, a group of 137 Greenlandic adults completed measures of depression, PTSD, and life satisfaction. In addition, they also provided memories of traumatic or stressful and positive life events they had xperienced during their lives. No sex differences were found......Suicide is a major public health problem in Greenland. Despite the fact that suicide is highly associated with depression, posttraumatic stress disorder (PTSD), and life satisfaction there are virtually no data about the extent to which Greenlandic individuals experience these mental health...

Ethical sensitivity, burnout, and job satisfaction in emergency nurses.

Science.gov (United States)

Palazoğlu, Cansu Atmaca; Koç, Zeliha

2017-01-01

Rising levels of burnout and decreasing job satisfaction can inhibit healthcare professionals from providing high-quality care due to a corresponding decrease in their ethical sensitivity. This study aimed to determine the relationship between the level of ethical sensitivity in emergency service nurses and their levels of burnout and job satisfaction. This research employed a descriptive and cross-sectional design. Participants and research context: This study was conducted with a sample of 236 nurses, all of whom worked in emergency service between 24 July 2015 and 28 April 2016. Data were collected using the Moral Sensitivity Questionnaire, Maslach Burnout Inventory, and Minnesota Job Satisfaction Scale. Ethical considerations: This study was approved by the Institutional Ethics Review Board of Ondokuz Mayıs University. There was a weak and negative correlation (r = -0.158, p = 0.015) between Moral Sensitivity Questionnaire and Maslach Burnout Inventory scores. There was also a weak and negative correlation (r = -0.335, p Burnout Inventory and Minnesota Job Satisfaction Scale scores. Decreased job satisfaction and increased burnout levels among emergency service nurses might result in them indulging in improper practices, frequently facing ethical problems, and a decrease in the overall quality of service in hospitals. In order for emergency service nurses to recognize ethical problems and make the most accurate decisions, a high level of ethical sensitivity is critical. In this respect, it is suggested that continuing education after graduation and training programs should be organized.

Job stress and job satisfaction: home care workers in a consumer-directed model of care.

Science.gov (United States)

Delp, Linda; Wallace, Steven P; Geiger-Brown, Jeanne; Muntaner, Carles

2010-08-01

To investigate determinants of job satisfaction among home care workers in a consumer-directed model. Analysis of data collected from telephone interviews with 1,614 Los Angeles home care workers on the state payroll in 2003. Multivariate logistic regression analysis was used to determine the odds of job satisfaction using job stress model domains of demands, control, and support. Abuse from consumers, unpaid overtime hours, and caring for more than one consumer as well as work-health demands predict less satisfaction. Some physical and emotional demands of the dyadic care relationship are unexpectedly associated with greater job satisfaction. Social support and control, indicated by job security and union involvement, have a direct positive effect on job satisfaction. Policies that enhance the relational component of care may improve workers' ability to transform the demands of their job into dignified and satisfying labor. Adequate benefits and sufficient authorized hours of care can minimize the stress of unpaid overtime work, caring for multiple consumers, job insecurity, and the financial constraints to seeking health care. Results have implications for the structure of consumer-directed models of care and efforts to retain long-term care workers.

Route constraints model based on polychromatic sets

Science.gov (United States)

Yin, Xianjun; Cai, Chao; Wang, Houjun; Li, Dongwu

2018-03-01

With the development of unmanned aerial vehicle (UAV) technology, the fields of its application are constantly expanding. The mission planning of UAV is especially important, and the planning result directly influences whether the UAV can accomplish the task. In order to make the results of mission planning for unmanned aerial vehicle more realistic, it is necessary to consider not only the physical properties of the aircraft, but also the constraints among the various equipment on the UAV. However, constraints among the equipment of UAV are complex, and the equipment has strong diversity and variability, which makes these constraints difficult to be described. In order to solve the above problem, this paper, referring to the polychromatic sets theory used in the advanced manufacturing field to describe complex systems, presents a mission constraint model of UAV based on polychromatic sets.

Constraint-based job shop scheduling with ILOG SCHEDULER

NARCIS (Netherlands)

Nuijten, W.P.M.; Le Pape, C.

1998-01-01

We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using ILOG SCHEDULER. A new way of calculating lower bounds on the makespan of the job shop scheduling problem is presented and

An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems.

Science.gov (United States)

Yu, Hao; Solvang, Wei Deng

2016-05-31

Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing transportation. In the model, two critical factors are taken into account: system operating costs and risk imposed on local residents, and a compensation factor is introduced to the risk objective function in order to account for the fact that the risk level imposed by one type of hazardous waste or treatment technology may significantly vary from that of other types. Besides, the policy instruments for promoting waste recycling are considered, and their influence on the costs and risk of hazardous waste management is also discussed. The model is coded and calculated in Lingo optimization solver, and the augmented ε-constraint method is employed to generate the Pareto optimal curve of the multi-objective optimization problem. The trade-off between different objectives is illustrated in the numerical experiment.

An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems

Directory of Open Access Journals (Sweden)

Hao Yu

2016-05-01

Full Text Available Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing transportation. In the model, two critical factors are taken into account: system operating costs and risk imposed on local residents, and a compensation factor is introduced to the risk objective function in order to account for the fact that the risk level imposed by one type of hazardous waste or treatment technology may significantly vary from that of other types. Besides, the policy instruments for promoting waste recycling are considered, and their influence on the costs and risk of hazardous waste management is also discussed. The model is coded and calculated in Lingo optimization solver, and the augmented ε-constraint method is employed to generate the Pareto optimal curve of the multi-objective optimization problem. The trade-off between different objectives is illustrated in the numerical experiment.

Location Planning Problem of Service Centers for Sustainable Home Healthcare: Evidence from the Empirical Analysis of Shanghai

Directory of Open Access Journals (Sweden)

Gang Du

2015-11-01

Full Text Available It is of theoretical and practical significance to understand what factors influence the sustainable development of home healthcare services in China. Based on a face-to-face survey, we find that the location planning, which is decisive for the improvement of patient satisfaction, can effectively reduce the risks, as well as the costs of redundant construction and re-construction of service centers for home healthcare and, thus, helps ensure the sustainability of health and the environment. The purposes of this paper are to investigate the existing problem of home healthcare in Shanghai and to find the optimum location planning scheme under several realistic constraints. By considering differentiated services provided by the medical staff at different levels and the degrees of patient satisfaction, a mixed integer programming model is built to minimize the total medical cost. The IBM ILOGCPLEX is used to solve the above model. Finally, a case study of Putuo district in Shanghai is conducted to validate the proposed model and methodology. Results indicate that the model used in this paper can effectively reduce the total medical cost and enhance the medical sustainability, and therefore, the results of the model can be used as a reference for decision makers on the location planning problem of home healthcare services in China.

Mental health and lifestyle correlates of sexual problems and sexual satisfaction in heterosexual Hong Kong Chinese population.

Science.gov (United States)

Lau, Joseph T F; Kim, Jean H; Tsui, Hi Yi

2005-12-01

To examine the lifestyle, mental health, and stress-related factors associated with various types of sexual problems among sexually active, heterosexual Hong Kong residents aged 18 to 59 years. An anonymous, cross-sectional, random telephone survey was conducted using a special, validated, computerized telephone interview method. A total of 1281 men and 2130 women completed the interview (response rate 50.6%). Sexual problems were determined according to the Diagnostic and Statistical Manual (of Mental Disorders) IV definitions. Among the men, multivariate analyses indicated that older age, poor spousal relationship, less exercise, high level of family stress, high level of financial-related stress, and past year substance use were significantly associated with sexual problems (odds ratio [OR] 1.41 to 3.83). Among the women, being married or cohabiting with a partner was positively associated with lubrication problems, lack of orgasm, lack of pleasure, lack of interest (OR 1.43 to 1.73) and negatively associated with pain during intercourse (OR 0.66) and anxiety (OR 0.62). A high level of financial stress and neuroses diagnoses were also associated with various female sexual problems (OR 1.40 to 2.66). Sexual satisfaction was associated with being married/cohabitating (OR 1.94) and negatively associated with a poor spousal relationship, low level of exercise, and a high level of work-related stress among men (OR 0.37 to 0.71). Among women, a poor spousal relationship and high levels of family stress and financial stress were associated with not being satisfied sexually (OR 0.24 to 0.71). Mental health, stress-related factors, and lifestyle factors contribute to sexual problems among Hong Kong Chinese adults. The factors differed between the two sexes.

Topological constraints and their breakdown in dynamical evolution

International Nuclear Information System (INIS)

Goldstein, Raymond E; Moffatt, H Keith; Pesci, Adriana I

2012-01-01

A variety of physical and biological systems exhibit dynamical behaviour that has some explicit or implicit topological features. Here, the term ‘topological’ is meant to convey the idea of structures, e.g. physical knots, links or braids, that have some measure of invariance under continuous deformation. Dynamical evolution is then subject to the topological constraints that express this invariance. The simplest problem arising in these systems is the determination of minimum-energy structures (and routes towards these structures) permitted by such constraints, and elucidation of mechanisms by which the constraints may be broken. In more complex nonequilibrium cases there can be recurring singularities associated with topological rearrangements driven by continuous injection of energy. In this brief overview, motivated by an upcoming program on ‘Topological Dynamics in the Physical and Biological Sciences’ at the Isaac Newton Institute for Mathematical Sciences, we present a summary of this class of dynamical systems and discuss examples of important open problems. (invited articles)

Predictors of Life Satisfaction among Guidance Counselors and Administrators Employed by the Ministry of Education in Turkey

Science.gov (United States)

Poyrazli, Senel; Yesilyaprak, Binnur; Milliogullari, Ali

2012-01-01

Problem Statement: A review of the literature indicated that both job satisfaction and life satisfaction are important to an individual's overall wellbeing. While there have been extensive studies related to job satisfaction in a Turkish context, studies related to the predictors of life satisfaction are limited. Purpose of Study: The purpose of…

Employee satisfaction and employee retention: catalysts to patient satisfaction.

Science.gov (United States)

Collins, Kevin S; Collins, Sandra K; McKinnies, Richard; Jensen, Steven

2008-01-01

Over the last few years, most health care facilities have become intensely aware of the need to increase patient satisfaction. However, with today's more consumer-driven market, this can be a daunting task for even the most experienced health care manager. Recent studies indicate that focusing on employee satisfaction and subsequent employee retention may be strong catalysts to patient satisfaction. This study offers a review of how employee satisfaction and retention correlate with patient satisfaction and also examines the current ways health care organizations are focusing on employee satisfaction and retention.

New heuristic method for the optimization of product mix based on theory of constraints and knapsack problem

Directory of Open Access Journals (Sweden)

Vinicius Amorim Sobreiro

2013-06-01

Full Text Available The definition of the product mix provides the allocation of the productive resources in the manufacture process and the optimization of productive system. However, the definition of the product mix is a problem of the NP-complete, in other words, of difficult solution. Taking this into account, with the aid of the Theory of Constraints - TOC, some constructive heuristics have been presented to help to solve this problem. Thus, the objective in this paper is to propose a new heuristics to provide better solutions when compared with the main heuristics presented in the literature, TOC-h of Fredendall and Lea. To accomplish this comparison, simulations were accomplished with the objective of identifying the production mix with the best throughput, considering CPU time and the characteristics of the productive ambient. The results show that the heuristics proposal was more satisfactory when compared to TOC-h and it shows good solution when compared with the optimum solution. This fact evidence the importance of the heuristics proposal in the definition of product mix.

Students’ perceptions and satisfaction level of hybrid problem-based learning for 16 years in Kyungpook National University School of Medicine, Korea

Directory of Open Access Journals (Sweden)

Sanghee Yeo

2016-03-01

Full Text Available Purpose: Kyungpook National University School of Medicine has been implementing hybrid problem-based learning (PBL since 1999. The aim of this study was to investigate the changes in the students’ perceptions and satisfaction levels of hybrid PBL. Methods: The target period of our study was from 1999 to 2014, and target subjects were second-year medical students in Kyungpook National University School of Medicine. The survey was conducted at the end of semester. We had a focused interview with group leaders and some volunteer students. Results: As for the scores regarding students’ overall satisfaction with PBL, there was significant improvement in 2005 compared to 2002, but the scores decreased and no differences between the survey years noted after 2005. The students’ preference ratio for the once a week PBL sessions, tutor presence, synchronization of contents, and arrangement of PBL sessions and related lectures was 60%–80%, 50%–90%, 52%–96%, and 78%–93%, respectively. Conclusion: In order to increase students’ satisfaction with hybrid PBL and to improve the perception of it, firstly, it is necessary to arrange the date and the time of PBL sessions so that students can concentrate on PBL. Secondly, PBL cases should be selected and arranged to be well synchronized with the ongoing lectures. Finally, it is important to create a safe atmosphere so that students can engage actively in PBL sessions.

Management strategies to improve job satisfaction of principals in primary schools / Khumalo M.G.

OpenAIRE

Khumalo, Mapula Gertrude.

2012-01-01

The aim of this study is to optimise aspects of job satisfaction in the work environment to improve the effectiveness of primary school principals. Job dissatisfaction seems to be a worldwide problem in the education sector, even in South Africa a number of researches were conducted on job satisfaction. In this research the focus is on the following research questions: What is the nature of job satisfaction? Which factors contribute to the job satisfaction/dissatisfaction of primary school...

Proposal of Constraints Analysis Method Based on Network Model for Task Planning

Science.gov (United States)

Tomiyama, Tomoe; Sato, Tatsuhiro; Morita, Toyohisa; Sasaki, Toshiro

Deregulation has been accelerating several activities toward reengineering business processes, such as railway through service and modal shift in logistics. Making those activities successful, business entities have to regulate new business rules or know-how (we call them ‘constraints’). According to the new constraints, they need to manage business resources such as instruments, materials, workers and so on. In this paper, we propose a constraint analysis method to define constraints for task planning of the new business processes. To visualize each constraint's influence on planning, we propose a network model which represents allocation relations between tasks and resources. The network can also represent task ordering relations and resource grouping relations. The proposed method formalizes the way of defining constraints manually as repeatedly checking the network structure and finding conflicts between constraints. Being applied to crew scheduling problems shows that the method can adequately represent and define constraints of some task planning problems with the following fundamental features, (1) specifying work pattern to some resources, (2) restricting the number of resources for some works, (3) requiring multiple resources for some works, (4) prior allocation of some resources to some works and (5) considering the workload balance between resources.

Satisfaction with the decision to participate in cancer clinical trials is high, but understanding is a problem.

Science.gov (United States)

Jefford, M; Mileshkin, L; Matthews, J; Raunow, H; O'Kane, C; Cavicchiolo, T; Brasier, H; Anderson, M; Reynolds, J

2011-03-01

Partially presented in poster format at the 40th and 41st Annual Meetings of the American Society of Clinical Oncology, held in 2004 in New Orleans, Louisiana and in 2005 in Orlando, Florida. We aimed to: (a) assess patient knowledge about cancer clinical trials (CCT) and satisfaction with their decision to participate, (b) determine whether satisfaction correlates with objective understanding, or other factors, and (c) identify correlates of increased understanding. A convenience sample of 100 patients were recruited. Instruments assessed quality of informed consent (QuIC), quality of life (EORTC QLQ C-30), anxiety and depression (HADS), and preferences for information and involvement in decision making. Measures were completed within 2 weeks of clinical trial enrollment. One hundred two patients (68 male) with a median age of 58.4 years (29-85) were registered in 27 of the 33 therapeutic cancer clinical trials approved for the Consent Study. Mean QuIC objective knowledge (QuIC-A) was 77.6 (/100) (95% CI, 75.7-79.4) and perceived (subjective) understanding (QuIC-B) 91.5 (95% CI, 89.6-93.3). There was low but significant correlation between QuIC-A and B (R = 0.26, p = 0.008). Satisfaction was very high. Correlation between QuIC-B and satisfaction was moderate (0.430, p < 0.001). QuIC-B, but not QuIC-A was associated with QOL scores. Preferences regarding participation in decision making and whether these preferences were achieved did not impact upon knowledge, understanding or satisfaction. Patient knowledge regarding CCT is similar to published US data, and satisfaction is high. Satisfaction correlates with perceived but not objective understanding of CCT. Strategies to further improve the consent process need to be developed.

Job Satisfaction Level of ICT Coordinators: The case of Hatay Province

Directory of Open Access Journals (Sweden)

Hamide Şahinkayası

2013-12-01

Full Text Available The purpose of this study was to investigate the ICT Coordinators' (BİTEFOs’ level of job satisfaction and to propose a frame of job description and working principles for these coordinators. Population of this study consisted of all BİTEFOs working in the city of Hatay. Analyses of the data showed that BİTEFOs’ job satisfaction level was at medium level. From the sub dimensions of the scale, the lowest job satisfaction level was observed in private life, whereas the highest one was success-motivation. From the particular factors influencing their job satisfaction level, the ambiguity and oldness of the BİTEFO’s job description and working principles seem to be the reasons of low job satisfaction level. Because of that, a new frame of BİTEFO job definition and working principles was offered to remove the determined problems based on job satisfaction level

Nurses' Job satisfaction: an Italian study.

Science.gov (United States)

Sansoni, J; De Caro, W; Marucci, A R; Sorrentino, M; Mayner, L; Lancia, L

2016-01-01

The aim of the work presented was to assess job satisfaction of a number of nurses from different departments working in public hospitals in Italy. The assessment was carried out through the combined use of questionnaires, which measured different aspects of job satisfaction, such as coping abilities, stress level and optimism/pessimism. The literature supports the fact that nurses' job dissatisfaction is closely connected with high levels of stress, burnout and physical and mental exhaustion, together with high workload levels and the complexity of care. The growing interest in measuring the levels of nurses' job satisfaction is attributable to a number of problems that have been raised worldwide, two of which are becoming ever so important: turnover and shortage of nurses. The research question is: Which are the main motivating factors of Italian nurses' job satisfaction/dissatisfaction? The study used a convenience (non probability) sample of 1,304 nurses from 15 different wards working in Italian public hospitals from a number of cities in northern, central and southern Italy. The survey instrument was a questionnaire consisting of 205 items which included 5 different questionnaires combined together. The results show a low level of job satisfaction (IWS= 11.5, JSS=126.4). However, the participants were overall happy about their job and considered autonomy and salary important factors for job satisfaction. Research has shown that the nurses' level of satisfaction in Italian hospitals is low. The results revealed dissatisfaction with task requirements, organizational policies and advance in career. Nurses interviewed did not feel stressed and showed to be optimistic overall. New research on the subject should be conducted by focusing on ward differences, North and South of Italy and on gender differences.

The Relationship Between Quality of Life With Marital Satisfaction in Nurses in Social Security Hospital in Zahedan.

Science.gov (United States)

Gharibi, Maliheh; Sanagouymoharer, Gholamreza; Yaghoubinia, Fariba

2015-06-25

Marital satisfaction is one of the most important determinative factors of healthy function in family and can be affected by some factors. This study was conducted aimed to determine the relationship between quality of life and marital satisfaction in nurses in Social Security hospital in Zahedan. In this descriptive and correlational study, the population was the all of the nurses in various wards in Social Security hospital in Zahedan. The sample size was 103 and data collection was done through quality of life questionnaire (War and Sherborn) and Enrich Marital Satisfaction Scale. Data analysis was done through SPSS15 and using pearsons' correlation coefficient and stepwise regression. The aspects of physical functioning, role limitations due to physical health problems, role limitation due to emotional problems had a significant positive correlation and the bodily pain had a significant reverse correlation with aspects of marital satisfaction. The aspects of role limitations due to physical health problems and bodily pain were predictors of marital satisfaction. The results of study demonstrated the importance of pay attention to family issues and marital satisfaction and in this regard, the promotion of all aspects of quality of life is essential.

Marketing health care to employees: the structure of employee health care plan satisfaction.

Science.gov (United States)

Mascarenhas, O A

1993-01-01

Providing cost-contained comprehensive quality health care to maintain healthy and productive employees is a challenging problem for all employers. Using a representative panel of metropolitan employees, the author investigates the internal and external structure of employee satisfaction with company-sponsored health care plans. Employee satisfaction is differentiated into four meaningful groups of health care benefits, whereas its external structure is supported by the traditional satisfaction paradigms of expectation-disconfirmation, attribution, and equity. Despite negative disconfirmation, employees register sufficiently high health care satisfaction levels, which suggests some useful strategies that employers may consider implementing.

The Telehealth Satisfaction Scale (TeSS): Reliability, validity, and satisfaction with telehealth in a rural memory clinic population

Science.gov (United States)

Morgan, Debra G; Kosteniuk, Julie; Stewart, Norma; O’Connell, Megan E; Karunanyake, Chandima; Beever, Rob

2015-01-01

Introduction Patient satisfaction is a key aspect of quality of care and can inform continuous quality improvement. Of the few studies that have reported on patient satisfaction with telehealth in programs aimed at individuals with memory problems, none has reported on the psychometric properties of the user satisfaction scales employed. Methods We evaluated the construct validity and internal consistency reliability of the Telehealth Satisfaction Scale (TeSS), a 10-item scale adapted for use in a Rural and Remote Memory Clinic (RRMC). The RRMC is a one-stop interprofessional clinic for rural and remote seniors with suspected dementia, located in a tertiary care hospital. Telehealth videoconferencing is used for pre-clinic assessment and for follow-up. Patients and caregivers completed the TeSS after each telehealth appointment. With data from 223 patients, exploratory factor analysis was conducted using the principal components analysis extraction method. Results The eigenvalue for the first factor (5.2) was greater than 1 and much larger than the second eigenvalue (.92), supporting a one-factor solution that was confirmed by the scree plot. The total variance explained by factor 1 was 52.1%. Factor loadings (range 0.54 – 0.84) were above recommended cutoffs. The TeSS items demonstrated high internal consistency reliability (Cronbach’s alpha = 0.90). Satisfaction scores on the TeSS items ranged from 3.43 to 3.72 on a 4-point Likert scale, indicating high satisfaction with telehealth. Conclusions The study findings demonstrate high user satisfaction with telehealth in a rural memory clinic, and sound psychometric properties of the TeSS in this population. PMID:25272141

Job satisfaction among hospital nurses revisited: a systematic review.

Science.gov (United States)

Lu, Hong; Barriball, K Louise; Zhang, Xian; While, Alison E

2012-08-01

The current nursing shortage and high turnover is of great concern in many countries because of its impact upon the efficiency and effectiveness of any healthcare delivery system. Recruitment and retention of nurses are persistent problems associated with job satisfaction. To update review paper published in 2005. This paper analyses 100 papers relating to job satisfaction among hospital nurses derived from systematic searches of seven databases covering English and Chinese language publications 1966-2011 (updating the original paper with 46 additional studies published 2004-2011). Despite varying levels of job satisfaction across studies, sources and effects of job satisfaction were similar. Hospital nurse job satisfaction is closely related to working conditions and the organizational environment, job stress, role conflict and ambiguity, role perception and role content, organizational and professional commitment. More research is required to understand the relative importance of the many identified factors relating to job satisfaction of hospital nurses. It is argued that the absence of a robust causal model reflecting moderators or moderator is undermining the development of interventions to improve nurse retention. Copyright © 2011 Elsevier Ltd. All rights reserved.

Stochastic optimization under risk constraint and utility functions

International Nuclear Information System (INIS)

Seck, B.

2008-09-01

In a context of concurrence and emergence of energy markets, the production of electricity is affected by the new sources of risks which are the price variations on the energy markets. These new sources of risks generate a new risk: the market risk. In this research, the author explores the possibility of introducing constraints, expressed by measurements of risk, into the process of optimization of electricity production when financial contracts are signed on the energy market. The author makes the distinction between the engineering approach (taking the risk into account by risk measurements) and the economist approach (taking the risk into account by utility functions). After an overview of these both approaches in a static framework, he gives an economical formulation (a Maccheroni type one) for a static optimization problem under a risk constraint when the risk measurement is written under the form of an expected infimum like the variance, the 'conditional value at risk', and so on. The obtained results are then extended to a dynamic optimization framework under risk constraints. A numerical application of this approach is presented to solve a problem of electricity production management under a constraint of 'conditional value at risk' on a middle term

Lorentz violation. Motivation and new constraints

Energy Technology Data Exchange (ETDEWEB)

Liberati, S. [Scuola Internazionale Superiore di Studi Avanzati SISSA, Trieste (Italy); Istituto Nazionale di Fisica Nucleare INFN, Sezione di Trieste (Italy); Maccione, L. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

2009-09-15

We review the main theoretical motivations and observational constraints on Planck scale sup-pressed violations of Lorentz invariance. After introducing the problems related to the phenomenological study of quantum gravitational effects, we discuss the main theoretical frameworks within which possible departures from Lorentz invariance can be described. In particular, we focus on the framework of Effective Field Theory, describing several possible ways of including Lorentz violation therein and discussing their theoretical viability. We review the main low energy effects that are expected in this framework. We discuss the current observational constraints on such a framework, focusing on those achievable through high-energy astrophysics observations. In this context we present a summary of the most recent and strongest constraints on QED with Lorentz violating non-renormalizable operators. Finally, we discuss the present status of the field and its future perspectives. (orig.)

Lorentz violation. Motivation and new constraints

International Nuclear Information System (INIS)

Liberati, S.; Maccione, L.

2009-09-01

We review the main theoretical motivations and observational constraints on Planck scale sup-pressed violations of Lorentz invariance. After introducing the problems related to the phenomenological study of quantum gravitational effects, we discuss the main theoretical frameworks within which possible departures from Lorentz invariance can be described. In particular, we focus on the framework of Effective Field Theory, describing several possible ways of including Lorentz violation therein and discussing their theoretical viability. We review the main low energy effects that are expected in this framework. We discuss the current observational constraints on such a framework, focusing on those achievable through high-energy astrophysics observations. In this context we present a summary of the most recent and strongest constraints on QED with Lorentz violating non-renormalizable operators. Finally, we discuss the present status of the field and its future perspectives. (orig.)

On Lifecycle Constraints of Artifact-Centric Workflows

Science.gov (United States)

Kucukoguz, Esra; Su, Jianwen

Data plays a fundamental role in modeling and management of business processes and workflows. Among the recent "data-aware" workflow models, artifact-centric models are particularly interesting. (Business) artifacts are the key data entities that are used in workflows and can reflect both the business logic and the execution states of a running workflow. The notion of artifacts succinctly captures the fluidity aspect of data during workflow executions. However, much of the technical dimension concerning artifacts in workflows is not well understood. In this paper, we study a key concept of an artifact "lifecycle". In particular, we allow declarative specifications/constraints of artifact lifecycle in the spirit of DecSerFlow, and formulate the notion of lifecycle as the set of all possible paths an artifact can navigate through. We investigate two technical problems: (Compliance) does a given workflow (schema) contain only lifecycle allowed by a constraint? And (automated construction) from a given lifecycle specification (constraint), is it possible to construct a "compliant" workflow? The study is based on a new formal variant of artifact-centric workflow model called "ArtiNets" and two classes of lifecycle constraints named "regular" and "counting" constraints. We present a range of technical results concerning compliance and automated construction, including: (1) compliance is decidable when workflow is atomic or constraints are regular, (2) for each constraint, we can always construct a workflow that satisfies the constraint, and (3) sufficient conditions where atomic workflows can be constructed.

The Issue of Unit Constraints and the Non-Confiscatory Electricity Market

DEFF Research Database (Denmark)

Haji Bashi, Mazaher; Rahmati, Iman; Bak, Claus Leth

2017-01-01

Security constraint unit commitment is devised to drive the generation unit schedule in a deregulated environment. Generation bids, transmission system constraints and generation unit constraints are thoroughly considered in this optimization problem. It is acceptable that the transmission system...... normal condition constraints may affect the economic opportunities of the generation companies in the electricity market. Transmission system limitations are the inherent limits of the market environment but this is not true for the generation unit constraints. It means that the generation unit...... constraint of a certain player should not affect the economic opportunities of the rivals. If this happen, generation units can claim to the electricity market regulatory board. In this paper the effect of generation unit constraint on the market outcome is discussed. A fair mechanism is introduced in which...

Conflict Resolution in Chinese Adolescents' Friendship: Links with Regulatory Focus and Friendship Satisfaction.

Science.gov (United States)

Gao, Qin; Bian, Ran; Liu, Ru-de; He, Yili; Oei, Tian-Po

2017-04-03

It is generally acknowledged that people adopt different resolution strategies when facing conflicts with others. However, the mechanisms of conflict resolution are still unclear and under researched, in particular within the context of Chinese adolescents' same-sex friendship relations. Thus, the present study investigated the mediator role of conflict resolution strategies in the relationship between regulatory foci and friendship satisfaction for the first time. 653 Chinese adolescents completed the regulatory foci, conflict resolution style, and friendship satisfaction measures. The results of the structure equation modeling showed that while promotion focus was positively associated with problem-solving and compliance, prevention focus was positively associated with withdrawal and conflict engagement. In addition, problem-solving mediated the relationship between promotion focus and friendship satisfaction, and conflict engagement mediated the relationship between prevention focus and friendship satisfaction. These findings contribute to understanding Chinese adolescents' use of conflict resolution strategies as well as the relationship between regulatory foci and behavioral strategies in negative situations.

Prediction of Marital Satisfaction based on Coping Skills and Time Perspective

Directory of Open Access Journals (Sweden)

سپیده حق شناس

2018-03-01

Full Text Available The purpose of this study was to predict marital satisfaction based on coping skills and time perspective. The research method was correlation and the statistical population composed of couples living in the 2nddistrict of Tehran. By convenience sampling method, 250 individuals were selected and were asked to complete the ENRICH Marital Satisfaction Scale, the Lazarus & Folkman’s Coping Styles Questionnaire and the Zimbardo’s Time Perspective Inventory. The results showed that 12.5% of variance of marital satisfa-ction can be explained by the time perspective and the use of coping strategies in couples. The findings also indicated that there was a negative association between emotional coping strategies and marital satisfaction; while, there was no significant relationship between problem-oriented strategies and marital satisfaction. In examining the relationship between views of time and marital satisfaction, the results indicated that there was a negative significant relationship between marital satisfaction with past negative view of time, present hedonistic and believing in present fatalistic. According to the results of t-test for gender differences, there was no significant difference between men and women in marital satisfaction, using coping strategies and time views.

Alloy design as an inverse problem of cluster expansion models

DEFF Research Database (Denmark)

Larsen, Peter Mahler; Kalidindi, Arvind R.; Schmidt, Søren

2017-01-01

Central to a lattice model of an alloy system is the description of the energy of a given atomic configuration, which can be conveniently developed through a cluster expansion. Given a specific cluster expansion, the ground state of the lattice model at 0 K can be solved by finding the configurat......Central to a lattice model of an alloy system is the description of the energy of a given atomic configuration, which can be conveniently developed through a cluster expansion. Given a specific cluster expansion, the ground state of the lattice model at 0 K can be solved by finding...... the inverse problem in terms of energetically distinct configurations, using a constraint satisfaction model to identify constructible configurations, and show that a convex hull can be used to identify ground states. To demonstrate the approach, we solve for all ground states for a binary alloy in a 2D...

Relationship of Life Satisfaction and Job Satisfaction among Pakistani Army Soldiers

OpenAIRE

Summaira Naz

2015-01-01

The present study had two main objectives; first, to discover the relationships between job satisfaction and life satisfaction in Pakistani army soldiers, second, to find out the age, salary, marital status, and education differences on job satisfaction and life satisfaction in Pakistani army soldiers. In the present study two questionnaires; Job Satisfaction Scale JSS (Macdonald & Maclntyre, 1997) and Satisfaction With Life Scale (Diener, ...

The relationship between job satisfaction and health: a meta-analysis.

Science.gov (United States)

Faragher, E B; Cass, M; Cooper, C L

2005-02-01

A vast number of published studies have suggested a link between job satisfaction levels and health. The sizes of the relationships reported vary widely. Narrative overviews of this relationship have been published, but no systematic meta-analysis review has been conducted. A systematic review and meta-analysis of 485 studies with a combined sample size of 267 995 individuals was conducted, evaluating the research evidence linking self-report measures of job satisfaction to measures of physical and mental wellbeing. The overall correlation combined across all health measures was r = 0.312 (0.370 after Schmidt-Hunter adjustment). Job satisfaction was most strongly associated with mental/psychological problems; strongest relationships were found for burnout (corrected r = 0.478), self-esteem(r = 0.429), depression (r = 0.428), and anxiety(r = 0.420). The correlation with subjective physical illness was more modest (r = 0.287). Correlations in excess of 0.3 are rare in this context. The relationships found suggest that job satisfaction level is an important factor influencing the health of workers. Organisations should include the development of stress management policies to identify and eradicate work practices that cause most job dissatisfaction as part of any exercise aimed at improving employee health. Occupational health clinicians should consider counselling employees diagnosed as having psychological problems to critically evaluate their work-and help them to explore ways of gaining greater satisfaction from this important aspect of their life.

Bayesian Optimization Under Mixed Constraints with A Slack-Variable Augmented Lagrangian

Energy Technology Data Exchange (ETDEWEB)

Picheny, Victor; Gramacy, Robert B.; Wild, Stefan M.; Le Digabel, Sebastien

2016-12-05

An augmented Lagrangian (AL) can convert a constrained optimization problem into a sequence of simpler (e.g., unconstrained) problems, which are then usually solved with local solvers. Recently, surrogate-based Bayesian optimization (BO) sub-solvers have been successfully deployed in the AL framework for a more global search in the presence of inequality constraints; however, a drawback was that expected improvement (EI) evaluations relied on Monte Carlo. Here we introduce an alternative slack variable AL, and show that in this formulation the EI may be evaluated with library routines. The slack variables furthermore facilitate equality as well as inequality constraints, and mixtures thereof. We show our new slack “ALBO” compares favorably to the original. Its superiority over conventional alternatives is reinforced on several mixed constraint examples.

Uncertainty management by relaxation of conflicting constraints in production process scheduling

Science.gov (United States)

Dorn, Juergen; Slany, Wolfgang; Stary, Christian

1992-01-01

Mathematical-analytical methods as used in Operations Research approaches are often insufficient for scheduling problems. This is due to three reasons: the combinatorial complexity of the search space, conflicting objectives for production optimization, and the uncertainty in the production process. Knowledge-based techniques, especially approximate reasoning and constraint relaxation, are promising ways to overcome these problems. A case study from an industrial CIM environment, namely high-grade steel production, is presented to demonstrate how knowledge-based scheduling with the desired capabilities could work. By using fuzzy set theory, the applied knowledge representation technique covers the uncertainty inherent in the problem domain. Based on this knowledge representation, a classification of jobs according to their importance is defined which is then used for the straightforward generation of a schedule. A control strategy which comprises organizational, spatial, temporal, and chemical constraints is introduced. The strategy supports the dynamic relaxation of conflicting constraints in order to improve tentative schedules.

Introducing geometric constraint expressions into robot constrained motion specification and control

NARCIS (Netherlands)

Borghesan, G.; Scioni, E.; Kheddar, A.; Bruyninckx, H.P.J.

2016-01-01

The problem of robotic task definition and execution was pioneered by Mason, who defined setpoint constraints where the position, velocity, and/or forces are expressed in one particular task frame for a 6-DOF robot. Later extensions generalized this approach to constraints in 1) multiple frames; 2)

A decomposition method for network-constrained unit commitment with AC power flow constraints

International Nuclear Information System (INIS)

Bai, Yang; Zhong, Haiwang; Xia, Qing; Kang, Chongqing; Xie, Le

2015-01-01

To meet the increasingly high requirement of smart grid operations, considering AC power flow constraints in the NCUC (network-constrained unit commitment) is of great significance in terms of both security and economy. This paper proposes a decomposition method to solve NCUC with AC power flow constraints. With conic approximations of the AC power flow equations, the master problem is formulated as a MISOCP (mixed integer second-order cone programming) model. The key advantage of this model is that the active power and reactive power are co-optimised, and the transmission losses are considered. With the AC optimal power flow model, the AC feasibility of the UC result of the master problem is checked in subproblems. If infeasibility is detected, feedback constraints are generated based on the sensitivity of bus voltages to a change in the unit reactive power generation. They are then introduced into the master problem in the next iteration until all AC violations are eliminated. A 6-bus system, a modified IEEE 30-bus system and the IEEE 118-bus system are used to validate the performance of the proposed method, which provides a satisfactory solution with approximately 44-fold greater computational efficiency. - Highlights: • A decomposition method is proposed to solve the NCUC with AC power flow constraints • The master problem considers active power, reactive power and transmission losses. • OPF-based subproblems check the AC feasibility using parallel computing techniques. • An effective feedback constraint interacts between the master problem and subproblem. • Computational efficiency is significantly improved with satisfactory accuracy

Egalitarian Risk Sharing under Liquidity Constraints

NARCIS (Netherlands)

Koster, M.; Boonen, T.

2014-01-01

Undertaking joint projects in practice involves a lot of uncertainty, especially when it comes to the final costs. This paper addresses the problem of sharing realized costs by the participants, subject to their indvidual liquidity constraints. If all cost levels can be accounted for, and it the

Faddeev-Jackiw quantization and constraints

International Nuclear Information System (INIS)

Barcelos-Neto, J.; Wotzasek, C.

1992-01-01

In a recent Letter, Faddeev and Jackiw have shown that the reduction of constrained systems into its canonical, first-order form, can bring some new insight into the research of this field. For sympletic manifolds the geometrical structure, called Dirac or generalized bracket, is obtained directly from the inverse of the nonsingular sympletic two-form matrix. In the cases of nonsympletic manifolds, this two-form is degenerated and cannot be inverted to provide the generalized brackets. This singular behavior of the sympletic matrix is indicative of the presence of constraints that have to be carefully considered to yield to consistent results. One has two possible routes to treat this problem: Dirac has taught us how to implement the constraints into the potential part (Hamiltonian) of the canonical Lagrangian, leading to the well-known Dirac brackets, which are consistent with the constraints and can be mapped into quantum commutators (modulo ordering terms). The second route, suggested by Faddeev and Jackiw, and followed in this paper, is to implement the constraints directly into the canonical part of the first order Lagrangian, using the fact that the consistence condition for the stability of the constrained manifold is linear in the time derivative. This algorithm may lead to an invertible two-form sympletic matrix from where the Dirac brackets are readily obtained. This algorithm is used in this paper to investigate some aspects of the quantization of constrained systems with first- and second-class constraints in the sympletic approach

Satisfaction with life and food-related life in Ecuadorian older adults.

Science.gov (United States)

Schnettler, Berta; Lobos, Germán; Lapo, María Del Carmen; Adasme-Berríos, Cristian; Hueche, Clementina

2017-02-01

To distinguish typologies of seniors according to their levels of satisfaction with life and food-related life, and to characterize them according to the importance assigned to family, health-related aspects, eating habits, nutritional status and sociodemographic characteristics. A survey was administered to a non-probabilistic sample of 817 seniors aged 60 years and over, of both genders, resident in urban and rural zones of the province of Guayas, Ecuador. The instrument included: Satisfaction with Life Scale (SWLS), Satisfaction with Food-related Life (SWFL), the Health-related Quality of Life Index (HRQOL-4) and the Family Importance Scale (FIS). Eating habits, sociodemographic variables, approximate weight and height were asked about. A cluster analysis was used to distinguish three typologies that differed significantly in the scores on the SWLS, SWFL, FIS, number of days with mental health problems, self-perception of health status, body mass index, eating habits and zone of residence. Two typologies presented high levels of satisfaction with life and food-related life, although the variables associated with overall well-being and in the food domain were different in each typology. The results suggest that high levels of satisfaction with life and food-related life in Ecuadorian seniors are associated with both healthful eating habits and having lunch in company, fewer mental health problems and greater importance assigned to family.

Health, family strains, dependency, and life satisfaction of older adults.

Science.gov (United States)

Chokkanathan, Srinivasan; Mohanty, Jayashree

2017-07-01

Using stress process theory and structural equation modelling, this study investigated the complex relationship between health status, family strain, dependency, and the life satisfaction of rural older adults with reported functional impairments in India. Data were extracted from a large-scale study of 903 randomly selected adults aged 61 years and older from 30 rural clusters of India. The sample for this study was confined to 653 older adults who reported functional impairments. Structural equation modelling showed that poor health status indirectly lowered the life satisfaction of older adults through family strains. Moreover, poor health status also indirectly influenced life satisfaction through dependency and family strain (poor health→dependency→family strains→life satisfaction). The findings indicate that for professionals who deal with the health of older adults, exploring relationship strains and dependency is vital to the assessment and intervention of subjective wellbeing. Inter-sectoral coordination and communication between healthcare and social service agencies might facilitate effective management of health problems among older adults. Moreover, taking family strains and dependency into account when caring for older adults with health problems is critical to help improve their quality of life and maintain their wellbeing. Copyright © 2017 Elsevier B.V. All rights reserved.

Serious Leisure and People with Orthopedic Impairment: Benefits and Constraints

Directory of Open Access Journals (Sweden)

Manolya AKSATAN

2017-12-01

Full Text Available There are many people around the world who have different types of disabilities. Understanding their needs is the first step of developing policies to increase their quality of life and satisfaction. Leisure is an essential need of disabled people and it plays an important role in disabled people’s lives. The purpose of this study is to gain a deep understanding on the serious leisure activities of people with orthopedic impairment, and also both benefits and constraints involved with serious leisure. Therefore, semi-structured in-depth interviews were conducted with 17 people who have orthopedic impairment. The data collected through interviews was analyzed by using a coding process. Findings of the study indicate that people with orthopedic impairment pursue many leisure activities. The research revealed that the participants were aware of significant individual and community benefits of serious leisure activities. Although the benefits of leisure for private and community life are obvious for people with orthopedic impairment, it is not always easy for them to pursue serious leisure activities. Disabled people recognize that there are many constraints involved with serious leisure. Based on the findings, these constraints are explained as psychological factors, family support, level of orthopedic impairment, community awareness and environmental factors, work and income.

Near-Optimal Fingerprinting with Constraints

Directory of Open Access Journals (Sweden)

Gulyás Gábor György

2016-10-01

Full Text Available Several recent studies have demonstrated that people show large behavioural uniqueness. This has serious privacy implications as most individuals become increasingly re-identifiable in large datasets or can be tracked, while they are browsing the web, using only a couple of their attributes, called as their fingerprints. Often, the success of these attacks depends on explicit constraints on the number of attributes learnable about individuals, i.e., the size of their fingerprints. These constraints can be budget as well as technical constraints imposed by the data holder. For instance, Apple restricts the number of applications that can be called by another application on iOS in order to mitigate the potential privacy threats of leaking the list of installed applications on a device. In this work, we address the problem of identifying the attributes (e.g., smartphone applications that can serve as a fingerprint of users given constraints on the size of the fingerprint. We give the best fingerprinting algorithms in general, and evaluate their effectiveness on several real-world datasets. Our results show that current privacy guards limiting the number of attributes that can be queried about individuals is insufficient to mitigate their potential privacy risks in many practical cases.