WorldWideScience

Sample records for orientation search problems

  1. Iterated local search algorithm for solving the orienteering problem with soft time windows.

    Science.gov (United States)

    Aghezzaf, Brahim; Fahim, Hassan El

    2016-01-01

    In this paper we study the orienteering problem with time windows (OPTW) and the impact of relaxing the time windows on the profit collected by the vehicle. The way of relaxing time windows adopted in the orienteering problem with soft time windows (OPSTW) that we study in this research is a late service relaxation that allows linearly penalized late services to customers. We solve this problem heuristically by considering a hybrid iterated local search. The results of the computational study show that the proposed approach is able to achieve promising solutions on the OPTW test instances available in the literature, one new best solution is found. On the newly generated test instances of the OPSTW, the results show that the profit collected by the OPSTW is better than the profit collected by the OPTW.

  2. Organizational search and market orientation

    DEFF Research Database (Denmark)

    Sørensen, Hans Eibe; Stieglitz, Nils

    2008-01-01

      Market orientation has evolved into a key construct in the marketing and strategy literature. While much progress has been made in empirical research, the concept lacks a coherent theoretical foundation. Essentially, much prior research has pointed to the role of market-sensing capabilities...... to explain performance differentials among firms (Day, 1994). We open up the black box of market-sensing capabilities by treating the issue of choosing marketing attributes of products as a problem of organizational search. Despite much robust research on organizational search in the strategy......, with their effectiveness depending on organizational and environmental factors. We provide an elaborate outline of the multidimensional aspect of firms' responsive and proactive search processes. First, we highlight the role of organizational aspiration-levels for market orientation. We then investigate the mechanisms...

  3. Problem-Oriented Project Work

    DEFF Research Database (Denmark)

    Olsen, Poul Bitsch; Pedersen, Nils Kaare

    This book is meant to support problem-oriented learning activities. Problem-orientation concerns the reasoning about lack of knowledge, while project work includes the ethnomethods that are practiced when collectives produce scientific knowledge. This book reflects particular methods related...

  4. User oriented trajectory search for trip recommendation

    KAUST Repository

    Shang, Shuo

    2012-01-01

    Trajectory sharing and searching have received significant attentions in recent years. In this paper, we propose and investigate a novel problem called User Oriented Trajectory Search (UOTS) for trip recommendation. In contrast to conventional trajectory search by locations (spatial domain only), we consider both spatial and textual domains in the new UOTS query. Given a trajectory data set, the query input contains a set of intended places given by the traveler and a set of textual attributes describing the traveler\\'s preference. If a trajectory is connecting/close to the specified query locations, and the textual attributes of the trajectory are similar to the traveler\\'e preference, it will be recommended to the traveler for reference. This type of queries can bring significant benefits to travelers in many popular applications such as trip planning and recommendation. There are two challenges in the UOTS problem, (i) how to constrain the searching range in two domains and (ii) how to schedule multiple query sources effectively. To overcome the challenges and answer the UOTS query efficiently, a novel collaborative searching approach is developed. Conceptually, the UOTS query processing is conducted in the spatial and textual domains alternately. A pair of upper and lower bounds are devised to constrain the searching range in two domains. In the meantime, a heuristic searching strategy based on priority ranking is adopted for scheduling the multiple query sources, which can further reduce the searching range and enhance the query efficiency notably. Furthermore, the devised collaborative searching approach can be extended to situations where the query locations are ordered. The performance of the proposed UOTS query is verified by extensive experiments based on real and synthetic trajectory data in road networks. © 2012 ACM.

  5. Interdisciplinary Problem Oriented Project Work

    DEFF Research Database (Denmark)

    Blomhøj, Morten; Kjeldsen, Tinne Hoff

    2018-01-01

    In this chapter, we analyze the problem oriented project work practiced at the Bachelor Study Program in Natural Science (Nat Bach) at Roskilde University (RU) as a learning environment for developing students’ mathematical modelling competence. The projects are conducted in a rather sophisticated...... and radical learning environment grounded on the four pedagogical key principles of, problem orientation, participant directed group work, interdisciplinarity and exemplarity. We illustrate and discuss the interplay between the aim of developing the students’ modelling competence on the one hand...

  6. Process-oriented semantic web search

    CERN Document Server

    Tran, DT

    2011-01-01

    The book is composed of two main parts. The first part is a general study of Semantic Web Search. The second part specifically focuses on the use of semantics throughout the search process, compiling a big picture of Process-oriented Semantic Web Search from different pieces of work that target specific aspects of the process.In particular, this book provides a rigorous account of the concepts and technologies proposed for searching resources and semantic data on the Semantic Web. To collate the various approaches and to better understand what the notion of Semantic Web Search entails, this bo

  7. Problem-oriented project studies

    DEFF Research Database (Denmark)

    Nielsen, Jørgen Lerche; Danielsen, Oluf

    2010-01-01

    and marking papers / essays is complemented and in some way overruled by a new role as supervisor and facilitator for the group of students working with a research problem, they themselves have picked. However different dimensions of this new teacher role can be seen – from expert in an academic field (result......-oriented focusing on how the final product demonstrates the students’ ‘correct’ way to handle the academic aspects of the subject in mind) to a role more focusing on processes, methodological dimensions and stressing the importance of a reflexive approach. Some teachers may even tend to take on a role...

  8. Market-oriented search in differentiated industries

    DEFF Research Database (Denmark)

    Sørensen, Hans Eibe; Stieglitz, Nils

    2009-01-01

      How is the success of a firm's market-oriented activities influenced by the marketing mix? This paper contributes to existing marketing research by advancing our understanding of the process by which market orientation transforms into superior performance. This process is investigated...... on the basis of appropriate organizational search models drawn from the behavioral theory of the firm. Specifically, we draw on the NK model to develop testable propositions that substantiate and extend prior theoretical market orientation research. Our results provide new insight into organizational...... characteristics and consequences of responsive and proactive marketing behaviors, as well as the allocation of attention towards customers and competitors....

  9. User Oriented Trajectory Search for Trip Recommendation

    KAUST Repository

    Ding, Ruogu

    2012-07-08

    Trajectory sharing and searching have received significant attention in recent years. In this thesis, we propose and investigate the methods to find and recommend the best trajectory to the traveler, and mainly focus on a novel technique named User Oriented Trajectory Search (UOTS) query processing. In contrast to conventional trajectory search by locations (spatial domain only), we consider both spatial and textual domains in the new UOTS query. Given a trajectory data set, the query input contains a set of intended places given by the traveler and a set of textual attributes describing the traveler’s preference. If a trajectory is connecting/close to the specified query locations, and the textual attributes of the trajectory are similar to the traveler’s preference, it will be recommended to the traveler. This type of queries can enable many popular applications such as trip planning and recommendation. There are two challenges in UOTS query processing, (i) how to constrain the searching range in two domains and (ii) how to schedule multiple query sources effectively. To overcome the challenges and answer the UOTS query efficiently, a novel collaborative searching approach is developed. Conceptually, the UOTS query processing is conducted in the spatial and textual domains alternately. A pair of upper and lower bounds are devised to constrain the searching range in two domains. In the meantime, a heuristic searching strategy based on priority ranking is adopted for scheduling the multiple query sources, which can further reduce the searching range and enhance the query efficiency notably. Furthermore, the devised collaborative searching approach can be extended to situations where the query locations are ordered. Extensive experiments are conducted on both real and synthetic trajectory data in road networks. Our approach is verified to be effective in reducing both CPU time and disk I/O time.

  10. Visual search of illusory contours: Shape and orientation effects

    Directory of Open Access Journals (Sweden)

    Gvozdenović Vasilije

    2008-01-01

    Full Text Available Illusory contours are specific class of visual stimuli that represent stimuli configurations perceived as integral irrespective of the fact that they are given in fragmented uncompleted wholes. Due to their specific features, illusory contours gained much attention in last decade representing prototype of stimuli used in investigations focused on binding problem. On the other side, investigations of illusory contours are related to problem of the level of their visual processing. Neurophysiologic studies show that processing of illusory contours proceed relatively early, on the V2 level, on the other hand most of experimental studies claim that illusory contours are perceived with engagement of visual attention, binding their elements to whole percept. This research is focused on two experiments in which visual search of illusory contours are based on shape and orientation. The main experimental procedure evolved the task proposed by Bravo and Nakayama where instead of detection, subjects were performing identification of one among two possible targets. In the first experiment subjects detected the presence of illusory square or illusory triangle, while in the second experiment subject were detecting two different orientations of illusory triangle. The results are interpreted in terms of visual search and feature integration theory. Beside the type of visual search task, search type proved to be dependent of specific features of illusory shapes which further complicate theoretical interpretation of the level of their perception.

  11. Problem-oriented approach to Ancient philosophy

    Directory of Open Access Journals (Sweden)

    Berstov, Igor

    2007-06-01

    Full Text Available Igor Berestov and Marina Wolf of the Institute of philosophy and law, Novosibirsk, discuss various methodological difficulties typical of studies in the history of Ancient Greek philosophy and try to develop their own problem-oriented approach.

  12. Complex Sequencing Problems and Local Search Heuristics

    NARCIS (Netherlands)

    Brucker, P.; Hurink, Johann L.; Osman, I.H.; Kelly, J.P.

    1996-01-01

    Many problems can be formulated as complex sequencing problems. We will present problems in flexible manufacturing that have such a formulation and apply local search methods like iterative improvement, simulated annealing and tabu search to solve these problems. Computational results are reported.

  13. Problem-Oriented Project Studies

    DEFF Research Database (Denmark)

    Nielsen, Jørgen Lerche; Danielsen, Oluf

    2012-01-01

    , providing lectures and seminars, giving assignments, and marking papers and essays is complemented and in some ways overruled by a new role as supervisor and facilitator for the group of students working with a research problem that they have picked themselves. However, different dimensions of this new...... teacher role can be observed – from expert in an academic field to a role that focuses more on processes, methodological dimensions, and the importance of a reflexive approach. In some situations, the role as social mediator is needed questioning and assisting the members of the group in the complex task...

  14. The search for a final disposal site as field of conflict. A proposition for a profile of a problem-oriented sociological repository research

    International Nuclear Information System (INIS)

    Hocke, P.

    2005-01-01

    The search for a final disposal site for high-level nuclear waste in Germany is to characterize as an enduring and politicised conflict causing a blocked process of decision making. A social science based research on final disposals, reflecting this stalemate situation in Germany, did not take place since the middle of the 1980s. This ITAS paper presents a proposal, how - by the means of social science - the chances and risks for further decision making about nuclear waste could be articulated more precise. (orig.)

  15. Problem-Oriented Requirements in Practice

    DEFF Research Database (Denmark)

    Lauesen, Søren

    2018-01-01

    [Context and motivation] Traditional requirements describe what the system shall do. This gives suppliers little freedom to use what they have already. In contrast, problem-oriented requirements describe the customer’s demands: what he wants to use the system for and which problems he wants...... to remove. The supplier specifies how his system will deal with these issues. The author developed the problem-oriented approach in 2007 on request from the Danish Government, and named it SL-07. [Question/problem] SL-07 has been used in many projects – usually with success. However, we had no detailed re......¬ports of the effects. [Princi¬pal ideas/results] This paper is a case study of SL-07 in acquisition of a complex case-management system. The author wrote the requirements and managed the supplier selection. Next, he was asked to run the entire acquisition project, although he was a novice project manager. Some...

  16. The split delivery capacitated team orienteering problem

    NARCIS (Netherlands)

    Archetti, C.; Bianchessi, N.; Speranza, M. G.; Hertz, A.

    2014-01-01

    In this article, we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated with a demand and a profit. The set of customers to be served by a fleet of capacitated vehicles has to be identified in such a way that the

  17. PREFACE: The random search problem: trends and perspectives The random search problem: trends and perspectives

    Science.gov (United States)

    da Luz, Marcos G. E.; Grosberg, Alexander; Raposo, Ernesto P.; Viswanathan, Gandhi M.

    2009-10-01

    aircraft, a given web site). Regarding the nature of the searching drive, in certain instances, it can be guided almost entirely by external cues, either by the cognitive (memory) or detective (olfaction, vision, etc) skills of the searcher. However, in many situations the movement is non-oriented, being in essence a stochastic process. Therefore, in such cases (and even when a small deterministic component in the locomotion exists) a random search effectively defines the final rates of encounters. Hence, one reason underlying the richness of the random search problem relates just to the `ignorance' of the locations of the randomly located targets. Contrary to conventional wisdom, the lack of complete information does not necessarily lead to greater complexity. As an illustrative example, let us consider the case of complete information. If the positions of all target sites are known in advance, then the question of what sequential order to visit the sites so to reduce the energy costs of locomotion itself becomes a rather challenging problem: the famous `travelling salesman' optimization query, belonging to the NP-complete class of problems. The ignorance of the target site locations, however, considerably modifies the problem and renders it not amenable to be treated by purely deterministic computational methods. In fact, as expected, the random search problem is not particularly suited to search algorithms that do not use elements of randomness. So, only a statistical approach to the search problem can adequately deal with the element of ignorance. In other words, the incomplete information renders the search under-determined, i.e., it is not possible to find the `best' solution to the problem because all the information is not given. Instead, one must guess and probabilistic or stochastic strategies become unavoidable. Also, the random search problem bears a relation to reaction-diffusion processes, because the search involves a diffusive aspect, movement, as well as a

  18. Orient Journal of Medicine: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  19. Needle Custom Search: Recall-oriented search on the Web using semantic annotations

    NARCIS (Netherlands)

    Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; van den Broek, Egon; de Rijke, Maarten; Kenter, Tom; de Vries, A.P.; Zhai, Chen Xiang; de Jong, Franciska M.G.; Radinsky, Kira; Hofmann, Katja

    Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency

  20. Needle Custom Search : Recall-oriented search on the web using semantic annotations

    NARCIS (Netherlands)

    Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; van den Broek, Egon L.

    2014-01-01

    Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency

  1. Adiabatic quantum search algorithm for structured problems

    International Nuclear Information System (INIS)

    Roland, Jeremie; Cerf, Nicolas J.

    2003-01-01

    The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover's algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is possible to devise quantum adiabatic algorithms with a complexity that, although still exponential, grows with a reduced order in the problem size

  2. User Oriented Trajectory Search for Trip Recommendation

    KAUST Repository

    Ding, Ruogu

    2012-01-01

    Trajectory sharing and searching have received significant attention in recent years. In this thesis, we propose and investigate the methods to find and recommend the best trajectory to the traveler, and mainly focus on a novel technique named User

  3. ESARDA approach to facility oriented safeguards problems

    International Nuclear Information System (INIS)

    Stewart, R.

    1979-01-01

    The paper outlines the brief history of a Working Group composed of nuclear fuel plant operators, safeguards research workers and safeguards inspectors who are examining facility orientated problems of nuclear materials control and verification activities. The working program is reviewed together with some examples of various problems and the way the group is collaborating to develop solutions by pooling resources and effort. Work in European low enriched uranium fabrication plants from UF 6 to finished fuel is discussed in connection with mesurement practices, real time accounting, error propagation and analysis, verification and surveillance

  4. User oriented trajectory search for trip recommendation

    KAUST Repository

    Shang, Shuo; Ding, Ruogu; Yuan, Bo; Xie, Kexin; Zheng, Kai; Kalnis, Panos

    2012-01-01

    trajectory search by locations (spatial domain only), we consider both spatial and textual domains in the new UOTS query. Given a trajectory data set, the query input contains a set of intended places given by the traveler and a set of textual attributes

  5. Advice Complexity of the Online Search Problem

    DEFF Research Database (Denmark)

    Clemente, Jhoirene; Hromkovič, Juraj; Komm, Dennis

    2016-01-01

    the minimum amount of information needed in order to achieve a certain competitive ratio. We design an algorithm that reads $b$ bits of advice and achieves a competitive ratio of (M/m)^{1/(2^b+1)} where M and m are the maximum and minimum price in the input. We also give a matching lower bound. Furthermore......The online search problem is a fundamental problem in finance. The numerous direct applications include searching for optimal prices for commodity trading and trading foreign currencies. In this paper, we analyze the advice complexity of this problem. In particular, we are interested in identifying......, we compare the power of advice and randomization for this problem....

  6. Local Search Approaches in Stable Matching Problems

    Directory of Open Access Journals (Sweden)

    Toby Walsh

    2013-10-01

    Full Text Available The stable marriage (SM problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market. In the classical formulation, n men and n women express their preferences (via a strict total order over the members of the other sex. Solving an SM problem means finding a stable marriage where stability is an envy-free notion: no man and woman who are not married to each other would both prefer each other to their partners or to being single. We consider both the classical stable marriage problem and one of its useful variations (denoted SMTI (Stable Marriage with Ties and Incomplete lists where the men and women express their preferences in the form of an incomplete preference list with ties over a subset of the members of the other sex. Matchings are permitted only with people who appear in these preference lists, and we try to find a stable matching that marries as many people as possible. Whilst the SM problem is polynomial to solve, the SMTI problem is NP-hard. We propose to tackle both problems via a local search approach, which exploits properties of the problems to reduce the size of the neighborhood and to make local moves efficiently. We empirically evaluate our algorithm for SM problems by measuring its runtime behavior and its ability to sample the lattice of all possible stable marriages. We evaluate our algorithm for SMTI problems in terms of both its runtime behavior and its ability to find a maximum cardinality stable marriage. Experimental results suggest that for SM problems, the number of steps of our algorithm grows only as O(n log(n, and that it samples very well the set of all stable marriages. It is thus a fair and efficient approach to generate stable marriages. Furthermore, our approach for SMTI problems is able to solve large problems, quickly returning stable matchings of large and often optimal size, despite the

  7. Enhanced exact solution methods for the Team Orienteering Problem

    NARCIS (Netherlands)

    Keshtkaran, M.; Ziarati, K.; Bettinelli, A.; Vigo, D.

    2016-01-01

    The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicle routing problems with profits. In this paper, we propose a Branch-and-Price approach to find proven optimal solutions to TOP. The pricing sub-problem is solved by a bounded bidirectional dynamic

  8. Sex differences in interpersonal problems: does sexual orientation moderate?

    Science.gov (United States)

    Lee, Debbiesiu L; Harkless, Lynn E; Sheridan, Daniel J; Winakur, Emily; Fowers, Blaine J

    2013-01-01

    Sexual orientation was examined as a moderator in the relation between biological sex and interpersonal problems. Participants were 60 lesbians, 45 heterosexual women, 37 gay men, and 39 heterosexual men, who completed the Inventory of Interpersonal Problems-Circumplex. Sexual orientation was found to moderate one of the eight interpersonal problems under study. Heterosexual women scored significantly higher than lesbian women in Non-assertive. Although hypothesized, gay men did not differ from heterosexual men along the Dominant-Cold quadrant. Implications of these results are discussed.

  9. Personality Traits, Sexual Problems, and Sexual Orientation: An Empirical Study.

    Science.gov (United States)

    Peixoto, Maria Manuela; Nobre, Pedro

    2016-01-01

    Personality traits, namely neuroticism, have been suggested as vulnerability factors for the development and maintenance of sexual dysfunction in heterosexual samples. However, no evidence was found regarding homosexual samples. This study aimed to analyze the differences on personality traits between heterosexual and homosexual men and women with and without sexual problems. Participants were 285 individuals (142 men, 143 women) who completed a web-based survey. Participants answered the NEO Five-Factor Inventory, the Brief Symptomatology Inventory, and questions regarding sexual problems. The groups of men and women with and without sexual problems were matched for sociodemographic variables. A 2 (Group) × 2 (Sexual Orientation) multivariate analysis of covariance was conducted separately for each gender. Results indicated a significant main effect for group and for sexual orientation in male and female samples. Men with sexual problems scored higher on neuroticism, whereas women with sexual problems scored higher on neuroticism and lower on extraversion when compared with healthy controls, regardless of sexual orientation. In addition, gay men scored higher on neuroticism and lesbian women scored higher on conscientiousness compared with the heterosexual groups. The present findings emphasize the central role of neuroticism on sexual problems in both men and women regardless of sexual orientation.

  10. A neural network approach to the orienteering problem

    Energy Technology Data Exchange (ETDEWEB)

    Golden, B.; Wang, Q.; Sun, X.; Jia, J.

    1994-12-31

    In the orienteering problem, we are given a transportation network in which a start point and an end point are specified. Other points have associated scores. Given a fixed amount of time, the goal is to determine a path from start to end through a subset of locations in order to maximize the total path score. This problem has received a considerable amount of attention in the last ten years. The TSP is a variant of the orienteering problem. This paper applies a modified, continuous Hopfield neural network to attack this NP-hard optimization problem. In it, we design an effective energy function and learning algorithm. Unlike some applications of neural networks to optimization problems, this approach is shown to perform quite well.

  11. Problem-based and project-oriented learning

    DEFF Research Database (Denmark)

    Blaabjerg, Frede; Teodorescu, Remus; Chen, Zhe

    2005-01-01

    . Generally, the content of the curriculum should be more expanded without extra study time. This paper presents a teaching approach, which makes it possible very fast for the students to obtain in-depth skills into new research areas, and this method is the problem-oriented and project-based learning....... In this paper the necessary skills for power electronic engineers are outlined that is followed up by a description on how the problem-oriented and project-based learning are implemented. A complete curriculum in power electronics and drives at Aalborg University is presented where different power electronics...... related projects at different study levels also are presented....

  12. Self Esteem, Information Search and Problem Solving Efficiency.

    Science.gov (United States)

    1979-05-01

    Weiss (1977, 1978) has shown that low self esteem workers are more likely to model the role behaviors and work values of superiors than are high self ...task where search is functional. Results showed that, as expected, low self esteem subjects searched for more information, search was functional and low ...situation. He has also argued that high self esteem individuals search for less information on problem solving tasks and are therefore less likely to

  13. Solving Large Clustering Problems with Meta-Heuristic Search

    DEFF Research Database (Denmark)

    Turkensteen, Marcel; Andersen, Kim Allan; Bang-Jensen, Jørgen

    In Clustering Problems, groups of similar subjects are to be retrieved from data sets. In this paper, Clustering Problems with the frequently used Minimum Sum-of-Squares Criterion are solved using meta-heuristic search. Tabu search has proved to be a successful methodology for solving optimization...... problems, but applications to large clustering problems are rare. The simulated annealing heuristic has mainly been applied to relatively small instances. In this paper, we implement tabu search and simulated annealing approaches and compare them to the commonly used k-means approach. We find that the meta-heuristic...

  14. Featural Guidance in Conjunction Search: The Contrast between Orientation and Color

    Science.gov (United States)

    Anderson, Giles M.; Heinke, Dietmar; Humphreys, Glyn W.

    2010-01-01

    Four experiments examined the effects of precues on visual search for targets defined by a color-orientation conjunction. Experiment 1 showed that cueing the identity of targets enhanced the efficiency of search. Cueing effects were stronger with color than with orientation cues, but this advantage was additive across array size. Experiment 2…

  15. The capacitated team orienteering problem with incomplete service

    NARCIS (Netherlands)

    Archetti, Claudia; Bianchessi, Nicola; Speranza, M. Grazia

    2013-01-01

    In this paper we study the capacitated version of the Team Orienteering Problem (TOP), that is the Capacitated TOP (CTOP) and the impact of relaxing the assumption that a customer, if served, must be completely served. We prove that the profit collected by the CTOP with Incomplete Service (CTOP-IS)

  16. Future Orientation, School Contexts, and Problem Behaviors: A Multilevel Study

    Science.gov (United States)

    Chen, Pan; Vazsonyi, Alexander T.

    2013-01-01

    The association between future orientation and problem behaviors has received extensive empirical attention; however, previous work has not considered school contextual influences on this link. Using a sample of N = 9,163 9th to 12th graders (51.0% females) from N = 85 high schools of the National Longitudinal Study of Adolescent Health, the…

  17. Future Orientation, Impulsivity, and Problem Behaviors: A Longitudinal Moderation Model

    Science.gov (United States)

    Chen, Pan; Vazsonyi, Alexander T.

    2011-01-01

    In the current study, based on a sample of 1,873 adolescents between 11.4 and 20.9 years of age from the first 3 waves of the National Longitudinal Study of Adolescent Health, we investigated the longitudinal effects of future orientation on levels of and developmental changes in problem behaviors, while controlling for the effects by impulsivity;…

  18. Problems of reducing the exhaustive search

    CERN Document Server

    Kreinovich, V

    1996-01-01

    This collection contains translations of papers on propositional satisfiability and related logical problems which appeared in Problemy Sokrashcheniya Perebora, published in Russian in 1987 by the Scientific Council "Cybernetics" of the USSR Academy of Sciences. The problems form the nucleus of this intensively developing area. This translation is dedicated to the memory of two remarkable Russian mathematicians, Sergei Maslov and his wife, Nina Maslova. Maslov is known as the originator of the inverse method in automated deduction, which was discovered at the same time as the resolution method

  19. Solving a chemical batch scheduling problem by local search

    NARCIS (Netherlands)

    Brucker, P.; Hurink, Johann L.

    1999-01-01

    A chemical batch scheduling problem is modelled in two different ways as a discrete optimization problem. Both models are used to solve the batch scheduling problem in a two-phase tabu search procedure. The method is tested on real-world data.

  20. An Iterated Tabu Search Approach for the Clique Partitioning Problem

    Directory of Open Access Journals (Sweden)

    Gintaras Palubeckis

    2014-01-01

    all cliques induced by the subsets is as small as possible. We develop an iterated tabu search (ITS algorithm for solving this problem. The proposed algorithm incorporates tabu search, local search, and solution perturbation procedures. We report computational results on CPP instances of size up to 2000 vertices. Performance comparisons of ITS against state-of-the-art methods from the literature demonstrate the competitiveness of our approach.

  1. 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.

  2. Fixed Orientation Interconnection Problems: Theory, Algorithms and Applications

    DEFF Research Database (Denmark)

    Zachariasen, Martin

    Interconnection problems have natural applications in the design of integrated circuits (or chips). A modern chip consists of billions of transistors that are connected by metal wires on the surface of the chip. These metal wires are routed on a (fairly small) number of layers in such a way...... that electrically independent nets do not intersect each other. Traditional manufacturing technology limits the orientations of the wires to be either horizontal or vertical — and is known as Manhattan architecture. Over the last decade there has been a growing interest in general architectures, where more than two...... a significant step forward, both concerning theory and algorithms, for the fixed orientation Steiner tree problem. In addition, the work maintains a close link to applications and generalizations motivated by chip design....

  3. Quantum algorithms for the ordered search problem via semidefinite programming

    International Nuclear Information System (INIS)

    Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A.

    2007-01-01

    One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log 2 N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for the ordered search problem in terms of a semidefinite program, we find quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log 605 N≅0.433 log 2 N queries, which improves upon the previously best known exact algorithm

  4. Online Information Search Performance and Search Strategies in a Health Problem-Solving Scenario.

    Science.gov (United States)

    Sharit, Joseph; Taha, Jessica; Berkowsky, Ronald W; Profita, Halley; Czaja, Sara J

    2015-01-01

    Although access to Internet health information can be beneficial, solving complex health-related problems online is challenging for many individuals. In this study, we investigated the performance of a sample of 60 adults ages 18 to 85 years in using the Internet to resolve a relatively complex health information problem. The impact of age, Internet experience, and cognitive abilities on measures of search time, amount of search, and search accuracy was examined, and a model of Internet information seeking was developed to guide the characterization of participants' search strategies. Internet experience was found to have no impact on performance measures. Older participants exhibited longer search times and lower amounts of search but similar search accuracy performance as their younger counterparts. Overall, greater search accuracy was related to an increased amount of search but not to increased search duration and was primarily attributable to higher cognitive abilities, such as processing speed, reasoning ability, and executive function. There was a tendency for those who were younger, had greater Internet experience, and had higher cognitive abilities to use a bottom-up (i.e., analytic) search strategy, although use of a top-down (i.e., browsing) strategy was not necessarily unsuccessful. Implications of the findings for future studies and design interventions are discussed.

  5. FACILITATING THE 3D INDOOR SEARCH AND RESCUE PROBLEM: AN OVERVIEW OF THE PROBLEM AND AN ANT COLONY SOLUTION APPROACH

    Directory of Open Access Journals (Sweden)

    H. Tashakkori

    2016-10-01

    Full Text Available Search and rescue procedures for indoor environments are quite complicated due to the fact that much of the indoor information is unavailable to rescuers before physical entrance to the incident scene. Thus, decision making regarding the number of crew required and the way they should be dispatched in the building considering the various access points and complexities in the buildings in order to cover the search area in minimum time is dependent on prior knowledge and experience of the emergency commanders. Hence, this paper introduces the Search and Rescue Problem (SRP which aims at finding best search and rescue routes that minimize the overall search time in the buildings. 3D BIM-oriented indoor GIS is integrated in the indoor route graph to find accurate routes based on the building geometric and semantic information. An Ant Colony Based Algorithm is presented that finds the number of first responders required and their individual routes to search all rooms and points of interest inside the building to minimize the overall time spent by all rescuers inside the disaster area. The evaluation of the proposed model for a case study building shows a significant improve in search and rescue time which will lead to a higher chance of saving lives and less exposure of emergency crew to danger.

  6. Facilitating the 3D Indoor Search and Rescue Problem: An Overview of the Problem and an Ant Colony Solution Approach

    Science.gov (United States)

    Tashakkori, H.; Rajabifard, A.; Kalantari, M.

    2016-10-01

    Search and rescue procedures for indoor environments are quite complicated due to the fact that much of the indoor information is unavailable to rescuers before physical entrance to the incident scene. Thus, decision making regarding the number of crew required and the way they should be dispatched in the building considering the various access points and complexities in the buildings in order to cover the search area in minimum time is dependent on prior knowledge and experience of the emergency commanders. Hence, this paper introduces the Search and Rescue Problem (SRP) which aims at finding best search and rescue routes that minimize the overall search time in the buildings. 3D BIM-oriented indoor GIS is integrated in the indoor route graph to find accurate routes based on the building geometric and semantic information. An Ant Colony Based Algorithm is presented that finds the number of first responders required and their individual routes to search all rooms and points of interest inside the building to minimize the overall time spent by all rescuers inside the disaster area. The evaluation of the proposed model for a case study building shows a significant improve in search and rescue time which will lead to a higher chance of saving lives and less exposure of emergency crew to danger.

  7. NASA Taxonomies for Searching Problem Reports and FMEAs

    Science.gov (United States)

    Malin, Jane T.; Throop, David R.

    2006-01-01

    Many types of hazard and risk analyses are used during the life cycle of complex systems, including Failure Modes and Effects Analysis (FMEA), Hazard Analysis, Fault Tree and Event Tree Analysis, Probabilistic Risk Assessment, Reliability Analysis and analysis of Problem Reporting and Corrective Action (PRACA) databases. The success of these methods depends on the availability of input data and the analysts knowledge. Standard nomenclature can increase the reusability of hazard, risk and problem data. When nomenclature in the source texts is not standard, taxonomies with mapping words (sets of rough synonyms) can be combined with semantic search to identify items and tag them with metadata based on a rich standard nomenclature. Semantic search uses word meanings in the context of parsed phrases to find matches. The NASA taxonomies provide the word meanings. Spacecraft taxonomies and ontologies (generalization hierarchies with attributes and relationships, based on terms meanings) are being developed for types of subsystems, functions, entities, hazards and failures. The ontologies are broad and general, covering hardware, software and human systems. Semantic search of Space Station texts was used to validate and extend the taxonomies. The taxonomies have also been used to extract system connectivity (interaction) models and functions from requirements text. Now the Reconciler semantic search tool and the taxonomies are being applied to improve search in the Space Shuttle PRACA database, to discover recurring patterns of failure. Usual methods of string search and keyword search fall short because the entries are terse and have numerous shortcuts (irregular abbreviations, nonstandard acronyms, cryptic codes) and modifier words cannot be used in sentence context to refine the search. The limited and fixed FMEA categories associated with the entries do not make the fine distinctions needed in the search. The approach assigns PRACA report titles to problem classes in

  8. Wolf Search Algorithm for Solving Optimal Reactive Power Dispatch Problem

    Directory of Open Access Journals (Sweden)

    Kanagasabai Lenin

    2015-03-01

    Full Text Available This paper presents a new bio-inspired heuristic optimization algorithm called the Wolf Search Algorithm (WSA for solving the multi-objective reactive power dispatch problem. Wolf Search algorithm is a new bio – inspired heuristic algorithm which based on wolf preying behaviour. The way wolves search for food and survive by avoiding their enemies has been imitated to formulate the algorithm for solving the reactive power dispatches. And the speciality  of wolf is  possessing  both individual local searching ability and autonomous flocking movement and this special property has been utilized to formulate the search algorithm .The proposed (WSA algorithm has been tested on standard IEEE 30 bus test system and simulation results shows clearly about the good performance of the proposed algorithm .

  9. Searches on star graphs and equivalent oracle problems

    International Nuclear Information System (INIS)

    Lee, Jaehak; Lee, Hai-Woong; Hillery, Mark

    2011-01-01

    We examine a search on a graph among a number of different kinds of objects (vertices), one of which we want to find. In a standard graph search, all of the vertices are the same, except for one, the marked vertex, and that is the one we wish to find. We examine the case in which the unmarked vertices can be of different types, so the background against which the search is done is not uniform. We find that the search can still be successful, but the probability of success is lower than in the uniform background case, and that probability decreases with the number of types of unmarked vertices. We also show how the graph searches can be rephrased as equivalent oracle problems.

  10. On local search for bi-objective knapsack problems.

    Science.gov (United States)

    Liefooghe, Arnaud; Paquete, Luís; Figueira, José Rui

    2013-01-01

    In this article, a local search approach is proposed for three variants of the bi-objective binary knapsack problem, with the aim of maximizing the total profit and minimizing the total weight. First, an experimental study on a given structural property of connectedness of the efficient set is conducted. Based on this property, a local search algorithm is proposed and its performance is compared to exact algorithms in terms of runtime and quality metrics. The experimental results indicate that this simple local search algorithm is able to find a representative set of optimal solutions in most of the cases, and in much less time than exact algorithms.

  11. A "feasible direction" search for Lineal Programming problem solving

    Directory of Open Access Journals (Sweden)

    Jaime U Malpica Angarita

    2003-07-01

    Full Text Available The study presents an approach to solve linear programming problems with no artificial variables. A primal linear minimization problem is standard form and its associated dual linear maximization problem are used. Initially, the dual (or a partial dual program is solved by a "feasible direction" search, where the Karush-Kuhn-Tucker conditions help to verify its optimality and then its feasibility. The "feasible direction" search exploits the characteristics of the convex polyhedron (or prototype formed by the dual program constraints to find a starting point and then follows line segments, whose directions are found in afine subspaces defined by boundary hyperplanes of polyhedral faces, to find next points up to the (an optimal one. Them, the remaining dual constraints not satisfaced at that optimal dual point, if there are any, are handled as nonbasic variables of the primal program, which is to be solved by such "feasible direction" search.

  12. Gaussian variable neighborhood search for the file transfer scheduling problem

    Directory of Open Access Journals (Sweden)

    Dražić Zorica

    2016-01-01

    Full Text Available This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search procedures. As Gaussian Variable Neighborhood Search showed promising results when solving continuous optimization problems, its implementation in solving the discrete file transfer scheduling problem is also presented. In order to apply this continuous optimization method to solve the discrete problem, mapping of uncountable set of feasible solutions into a finite set is performed. Both local search modifications gave better results for the large size instances, as well as better average performance for medium and large size instances. One local search modification achieved significant acceleration of the algorithm. The numerical experiments showed that the results obtained by Gaussian modifications are comparable with the results obtained by standard VNS based algorithms, developed for combinatorial optimization. In some cases Gaussian modifications gave even better results. [Projekat Ministarstava nauke Republike Srbije, br. 174010

  13. Repetition and Diversification in Multi-Session Task Oriented Search

    Science.gov (United States)

    Tyler, Sarah K.

    2013-01-01

    As the number of documents and the availability of information online grows, so to can the difficulty in sifting through documents to find what we're searching for. Traditional Information Retrieval (IR) systems consider the query as the representation of the user's needs, and as such are limited to the user's ability to describe the information…

  14. A Generalized Orienteering Problem for Optimal Search and Interdiction Planning

    Science.gov (United States)

    2013-09-01

    proposed for the TOP. Boussier et al. (2007) presents a branch-and- price algorithm that relies on a pricing step within the column generation phase...dominates in all metric categories and B&B appears to be the least favorable. We use performance proles ( Dolan and Moré 2002) as a method for comparing...exceeded, with greater computing power it may be possible to obtain the optimal solution in a period of time that can support a 24-hour planning

  15. Global Search Strategies for Solving Multilinear Least-Squares Problems

    Directory of Open Access Journals (Sweden)

    Mats Andersson

    2012-04-01

    Full Text Available The multilinear least-squares (MLLS problem is an extension of the linear least-squares problem. The difference is that a multilinear operator is used in place of a matrix-vector product. The MLLS is typically a large-scale problem characterized by a large number of local minimizers. It originates, for instance, from the design of filter networks. We present a global search strategy that allows for moving from one local minimizer to a better one. The efficiency of this strategy is illustrated by the results of numerical experiments performed for some problems related to the design of filter networks.

  16. Library of problem-oriented programs for solving problems of atomic and nuclear physics

    International Nuclear Information System (INIS)

    Kharitonov, Yu.I.

    1976-01-01

    The Data Centre of the Leningrad Institute of Nuclear Physics (LIYaF) is working on the establishment of a library of problem-oriented computer programs for solving problems of atomic and nuclear physics. This paper lists and describes briefly the programs presently available to the Data Centre. The descriptions include the program code numbers, the program language, the translator for which the program is designed, and the program scope

  17. The difference between problem-oriented education and problem based learning

    DEFF Research Database (Denmark)

    Olsen, Poul Bitsch

    2013-01-01

    Roskilde University offers a distinctive profile and contribution within Denmark. It is well known for its interdisciplinary research and education, including project work and problem-oriented method that is much valued by its students and graduates (International Evaluation Report on Roskilde...

  18. Dealing with Insecurity in Problem Oriented Learning Approaches--The Importance of Problem Formulation

    Science.gov (United States)

    Jensen, Annie Aarup; Lund, Birthe

    2016-01-01

    Introduction of a pedagogical concept, Kubus, in a problem oriented learning context--analysed within the framework of an activity system--indicates what might happen when offering tools tempting to influence and regulate students' learning approach and hereby neglecting the importance of existing habits and values. Introduction of this new…

  19. 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.

  20. Test-state approach to the quantum search problem

    International Nuclear Information System (INIS)

    Sehrawat, Arun; Nguyen, Le Huy; Englert, Berthold-Georg

    2011-01-01

    The search for 'a quantum needle in a quantum haystack' is a metaphor for the problem of finding out which one of a permissible set of unitary mappings - the oracles - is implemented by a given black box. Grover's algorithm solves this problem with quadratic speedup as compared with the analogous search for 'a classical needle in a classical haystack'. Since the outcome of Grover's algorithm is probabilistic - it gives the correct answer with high probability, not with certainty - the answer requires verification. For this purpose we introduce specific test states, one for each oracle. These test states can also be used to realize 'a classical search for the quantum needle' which is deterministic - it always gives a definite answer after a finite number of steps - and 3.41 times as fast as the purely classical search. Since the test-state search and Grover's algorithm look for the same quantum needle, the average number of oracle queries of the test-state search is the classical benchmark for Grover's algorithm.

  1. Complicated problem solution techniques in optimal parameter searching

    International Nuclear Information System (INIS)

    Gergel', V.P.; Grishagin, V.A.; Rogatneva, E.A.; Strongin, R.G.; Vysotskaya, I.N.; Kukhtin, V.V.

    1992-01-01

    An algorithm is presented of a global search for numerical solution of multidimentional multiextremal multicriteria optimization problems with complicated constraints. A boundedness of object characteristic changes is assumed at restricted changes of its parameters (Lipschitz condition). The algorithm was realized as a computer code. The algorithm was realized as a computer code. The programme was used to solve in practice the different applied optimization problems. 10 refs.; 3 figs

  2. Local search for Steiner tree problems in graphs

    NARCIS (Netherlands)

    Verhoeven, M.G.A.; Severens, M.E.M.; Aarts, E.H.L.; Rayward-Smith, V.J.; Reeves, C.R.; Smith, G.D.

    1996-01-01

    We present a local search algorithm for the Steiner tree problem in graphs, which uses a neighbourhood in which paths in a steiner tree are exchanged. The exchange function of this neigbourhood is based on multiple-source shortest path algorithm. We present computational results for a known

  3. Enabling Effective Problem-oriented Research for Sustainable Development

    Directory of Open Access Journals (Sweden)

    Christoph Kueffer

    2012-12-01

    Full Text Available Environmental problems caused by human activities are increasing; biodiversity is disappearing at an unprecedented rate, soils are being irreversibly damaged, freshwater is increasingly in short supply, and the climate is changing. To reverse or even to reduce these trends will require a radical transformation in the relationship between humans and the natural environment. Just how this can be achieved within, at most, a few decades is unknown, but it is clear that academia must play a crucial role. Many believe, however, that academic institutions need to become more effective in helping societies move toward sustainability. We first synthesize current thinking about this crisis of research effectiveness. We argue that those involved in producing knowledge to solve societal problems face three particular challenges: the complexity of real-world sustainability problems, maintaining impartiality when expert knowledge is used in decision making, and ensuring the salience of the scientific knowledge for decision makers. We discuss three strategies to meet these challenges: conducting research in interdisciplinary teams, forming research partnerships with actors and experts from outside academia, and framing research questions with the aim of solving specific problems (problem orientation. However, we argue that implementing these strategies within academia will require both cultural and institutional change. We then use concepts from transition management to suggest how academic institutions can make the necessary changes. At the level of system optimization, we call for: quality criteria, career incentives, and funding schemes that reward not only disciplinary excellence but also achievements in inter-/transdisciplinary work; professional services and training through specialized centers that facilitate problem-oriented research and reciprocal knowledge exchange with society; and the integration of sustainability and inter

  4. A shared computer-based problem-oriented patient record for the primary care team.

    Science.gov (United States)

    Linnarsson, R; Nordgren, K

    1995-01-01

    1. INTRODUCTION. A computer-based patient record (CPR) system, Swedestar, has been developed for use in primary health care. The principal aim of the system is to support continuous quality improvement through improved information handling, improved decision-making, and improved procedures for quality assurance. The Swedestar system has evolved during a ten-year period beginning in 1984. 2. SYSTEM DESIGN. The design philosophy is based on the following key factors: a shared, problem-oriented patient record; structured data entry based on an extensive controlled vocabulary; advanced search and query functions, where the query language has the most important role; integrated decision support for drug prescribing and care protocols and guidelines; integrated procedures for quality assurance. 3. A SHARED PROBLEM-ORIENTED PATIENT RECORD. The core of the CPR system is the problem-oriented patient record. All problems of one patient, recorded by different members of the care team, are displayed on the problem list. Starting from this list, a problem follow-up can be made, one problem at a time or for several problems simultaneously. Thus, it is possible to get an integrated view, across provider categories, of those problems of one patient that belong together. This shared problem-oriented patient record provides an important basis for the primary care team work. 4. INTEGRATED DECISION SUPPORT. The decision support of the system includes a drug prescribing module and a care protocol module. The drug prescribing module is integrated with the patient records and includes an on-line check of the patient's medication list for potential interactions and data-driven reminders concerning major drug problems. Care protocols have been developed for the most common chronic diseases, such as asthma, diabetes, and hypertension. The patient records can be automatically checked according to the care protocols. 5. PRACTICAL EXPERIENCE. The Swedestar system has been implemented in a

  5. Balancing energetic and cognitive resources: memory use during search depends on the orienting effector.

    Science.gov (United States)

    Solman, Grayden J F; Kingstone, Alan

    2014-09-01

    Search outside the laboratory involves tradeoffs among a variety of internal and external exploratory processes. Here we examine the conditions under which item specific memory from prior exposures to a search array is used to guide attention during search. We extend the hypothesis that memory use increases as perceptual search becomes more difficult by turning to an ecologically important type of search difficulty - energetic cost. Using optical motion tracking, we introduce a novel head-contingent display system, which enables the direct comparison of search using head movements and search using eye movements. Consistent with the increased energetic cost of turning the head to orient attention, we discover greater use of memory in head-contingent versus eye-contingent search, as reflected in both timing and orienting metrics. Our results extend theories of memory use in search to encompass embodied factors, and highlight the importance of accounting for the costs and constraints of the specific motor groups used in a given task when evaluating cognitive effects. Copyright © 2014 Elsevier B.V. All rights reserved.

  6. A DE-Based Scatter Search for Global Optimization Problems

    Directory of Open Access Journals (Sweden)

    Kun Li

    2015-01-01

    Full Text Available This paper proposes a hybrid scatter search (SS algorithm for continuous global optimization problems by incorporating the evolution mechanism of differential evolution (DE into the reference set updated procedure of SS to act as the new solution generation method. This hybrid algorithm is called a DE-based SS (SSDE algorithm. Since different kinds of mutation operators of DE have been proposed in the literature and they have shown different search abilities for different kinds of problems, four traditional mutation operators are adopted in the hybrid SSDE algorithm. To adaptively select the mutation operator that is most appropriate to the current problem, an adaptive mechanism for the candidate mutation operators is developed. In addition, to enhance the exploration ability of SSDE, a reinitialization method is adopted to create a new population and subsequently construct a new reference set whenever the search process of SSDE is trapped in local optimum. Computational experiments on benchmark problems show that the proposed SSDE is competitive or superior to some state-of-the-art algorithms in the literature.

  7. Social Orientation: Problem Behavior and Motivations Toward Interpersonal Problem Solving Among High Risk Adolescents

    Science.gov (United States)

    Kuperminc, Gabriel P.; Allen, Joseph P.

    2006-01-01

    A model of problematic adolescent behavior that expands current theories of social skill deficits in delinquent behavior to consider both social skills and orientation toward the use of adaptive skills was examined in an ethnically and socioeconomically diverse sample of 113 male and female adolescents. Adolescents were selected on the basis of moderate to serious risk for difficulties in social adaptation in order to focus on the population of youth most likely to be targeted by prevention efforts. Structural equation modeling was used to examine cross-sectional data using multiple informants (adolescents, peers, and parents) and multiple methods (performance test and self-report). Adolescent social orientation, as reflected in perceived problem solving effectiveness, identification with adult prosocial values, and self-efficacy expectations, exhibited a direct association to delinquent behavior and an indirect association to drug involvement mediated by demonstrated success in using problem solving skills. Results suggest that the utility of social skill theories of adolescent problem behaviors for informing preventive and remedial interventions can be enhanced by expanding them to consider adolescents’ orientation toward using the skills they may already possess. PMID:16929380

  8. An Elite Decision Making Harmony Search Algorithm for Optimization Problem

    Directory of Open Access Journals (Sweden)

    Lipu Zhang

    2012-01-01

    Full Text Available This paper describes a new variant of harmony search algorithm which is inspired by a well-known item “elite decision making.” In the new algorithm, the good information captured in the current global best and the second best solutions can be well utilized to generate new solutions, following some probability rule. The generated new solution vector replaces the worst solution in the solution set, only if its fitness is better than that of the worst solution. The generating and updating steps and repeated until the near-optimal solution vector is obtained. Extensive computational comparisons are carried out by employing various standard benchmark optimization problems, including continuous design variables and integer variables minimization problems from the literature. The computational results show that the proposed new algorithm is competitive in finding solutions with the state-of-the-art harmony search variants.

  9. Learning to Solve Problems by Searching for Macro-Operators

    Science.gov (United States)

    1983-07-01

    executing generalized robot plans. Aritificial Intelligence 3:25 1-288, 1972. [Frey 821 Frey, Alexander Ii. Jr., and David Singmaster. Handbook of Cubik...and that searching for macros may be a useful general learning paradigm. 1.1. Introduction One view of die die field of artificial intelligence is that... intelligence literature [Schofield 67, Gaschnig 79, Ericsson 761 and provides one of the simplest examples of the operation of the Macro Problem Solver. It

  10. An Improved Crow Search Algorithm Applied to Energy Problems

    Directory of Open Access Journals (Sweden)

    Primitivo Díaz

    2018-03-01

    Full Text Available The efficient use of energy in electrical systems has become a relevant topic due to its environmental impact. Parameter identification in induction motors and capacitor allocation in distribution networks are two representative problems that have strong implications in the massive use of energy. From an optimization perspective, both problems are considered extremely complex due to their non-linearity, discontinuity, and high multi-modality. These characteristics make difficult to solve them by using standard optimization techniques. On the other hand, metaheuristic methods have been widely used as alternative optimization algorithms to solve complex engineering problems. The Crow Search Algorithm (CSA is a recent metaheuristic method based on the intelligent group behavior of crows. Although CSA presents interesting characteristics, its search strategy presents great difficulties when it faces high multi-modal formulations. In this paper, an improved version of the CSA method is presented to solve complex optimization problems of energy. In the new algorithm, two features of the original CSA are modified: (I the awareness probability (AP and (II the random perturbation. With such adaptations, the new approach preserves solution diversity and improves the convergence to difficult high multi-modal optima. In order to evaluate its performance, the proposed algorithm has been tested in a set of four optimization problems which involve induction motors and distribution networks. The results demonstrate the high performance of the proposed method when it is compared with other popular approaches.

  11. Amplified Head Rotation in Virtual Reality and the Effects on 3D Search, Training Transfer, and Spatial Orientation.

    Science.gov (United States)

    Ragan, Eric D; Scerbo, Siroberto; Bacim, Felipe; Bowman, Doug A

    2017-08-01

    Many types of virtual reality (VR) systems allow users to use natural, physical head movements to view a 3D environment. In some situations, such as when using systems that lack a fully surrounding display or when opting for convenient low-effort interaction, view control can be enabled through a combination of physical and virtual turns to view the environment, but the reduced realism could potentially interfere with the ability to maintain spatial orientation. One solution to this problem is to amplify head rotations such that smaller physical turns are mapped to larger virtual turns, allowing trainees to view the entire surrounding environment with small head movements. This solution is attractive because it allows semi-natural physical view control rather than requiring complete physical rotations or a fully-surrounding display. However, the effects of amplified head rotations on spatial orientation and many practical tasks are not well understood. In this paper, we present an experiment that evaluates the influence of amplified head rotation on 3D search, spatial orientation, and cybersickness. In the study, we varied the amount of amplification and also varied the type of display used (head-mounted display or surround-screen CAVE) for the VR search task. By evaluating participants first with amplification and then without, we were also able to study training transfer effects. The findings demonstrate the feasibility of using amplified head rotation to view 360 degrees of virtual space, but noticeable problems were identified when using high amplification with a head-mounted display. In addition, participants were able to more easily maintain a sense of spatial orientation when using the CAVE version of the application, which suggests that visibility of the user's body and awareness of the CAVE's physical environment may have contributed to the ability to use the amplification technique while keeping track of orientation.

  12. Agent-oriented Architecture for Task-based Information Search System

    NARCIS (Netherlands)

    Aroyo, Lora; de Bra, Paul M.E.; De Bra, P.; Hardman, L.

    1999-01-01

    The topic of the reported research discusses an agent-oriented architecture of an educational information search system AIMS - a task-based learner support system. It is implemented within the context of 'Courseware Engineering' on-line course at the Faculty of Educational Science and Technology,

  13. Weak Ties and Self-Regulation in Job Search: The Effects of Goal Orientation on Networking

    Science.gov (United States)

    Hatala, John-Paul; Yamkovenko, Bogdan

    2016-01-01

    The purpose of this study is to empirically investigate the relationship between the self-regulatory variable of goal orientation and the extent to which job seekers reach out to and use weak ties in their job search. Weak ties, as defined by Granovettor, are connections to densely knit networks outside the individual's direct contacts who could…

  14. A local search for a graph clustering problem

    Science.gov (United States)

    Navrotskaya, Anna; Il'ev, Victor

    2016-10-01

    In the clustering problems one has to partition a given set of objects (a data set) into some subsets (called clusters) taking into consideration only similarity of the objects. One of most visual formalizations of clustering is graph clustering, that is grouping the vertices of a graph into clusters taking into consideration the edge structure of the graph whose vertices are objects and edges represent similarities between the objects. In the graph k-clustering problem the number of clusters does not exceed k and the goal is to minimize the number of edges between clusters and the number of missing edges within clusters. This problem is NP-hard for any k ≥ 2. We propose a polynomial time (2k-1)-approximation algorithm for graph k-clustering. Then we apply a local search procedure to the feasible solution found by this algorithm and hold experimental research of obtained heuristics.

  15. Determinants of a successful problem list to support the implementation of the problem-oriented medical record according to recent literature.

    Science.gov (United States)

    Simons, Sereh M J; Cillessen, Felix H J M; Hazelzet, Jan A

    2016-08-02

    A problem-oriented approach is one of the possibilities to organize a medical record. The problem-oriented medical record (POMR) - a structured organization of patient information per presented medical problem- was introduced at the end of the sixties by Dr. Lawrence Weed to aid dealing with the multiplicity of patient problems. The problem list as a precondition is the centerpiece of the problem-oriented medical record (POMR) also called problem-oriented record (POR). Prior to the digital era, paper records presented a flat list of medical problems to the healthcare professional without the features that are possible with current technology. In modern EHRs a POMR based on a structured problem list can be used for clinical decision support, registries, order management, population health, and potentially other innovative functionality in the future, thereby providing a new incentive to the implementation and use of the POMR. On both 12 May 2014 and 1 June 2015 a systematic literature search was conducted. From the retrieved articles statements regarding the POMR and related to successful or non-successful implementation, were categorized. Generic determinants were extracted from these statements. In this research 38 articles were included. The literature analysis led to 12 generic determinants: clinical practice/reasoning, complete and accurate problem list, data structure/content, efficiency, functionality, interoperability, multi-disciplinary, overview of patient information, quality of care, system support, training of staff, and usability. Two main subjects can be distinguished in the determinants: the system that the problem list and POMR is integrated in and the organization using that system. The combination of the two requires a sociotechnical approach and both are equally important for successful implementation of a POMR. All the determinants have to be taken into account, but the weight given to each of the determinants depends on the organizationusing

  16. Semantic Oriented Agent based Approach towards Engineering Data Management, Web Information Retrieval and User System Communication Problems

    OpenAIRE

    Ahmed, Zeeshan; Gerhard, Detlef

    2010-01-01

    The four intensive problems to the software rose by the software industry .i.e., User System Communication / Human Machine Interface, Meta Data extraction, Information processing & management and Data representation are discussed in this research paper. To contribute in the field we have proposed and described an intelligent semantic oriented agent based search engine including the concepts of intelligent graphical user interface, natural language based information processing, data management...

  17. A Variable Neighborhood Search Algorithm for the Leather Nesting Problem

    Directory of Open Access Journals (Sweden)

    Cláudio Alves

    2012-01-01

    Full Text Available The leather nesting problem is a cutting and packing optimization problem that consists in finding the best layout for a set of irregular pieces within a natural leather hide with an irregular surface and contour. In this paper, we address a real application of this problem related to the production of car seats in the automotive industry. The high quality requirements imposed on these products combined with the heterogeneity of the leather hides make the problem very complex to solve in practice. Very few results are reported in the literature for the leather nesting problem. Furthermore, the majority of the approaches impose some additional constraints to the layouts related to the particular application that is considered. In this paper, we describe a variable neighborhood search algorithm for the general leather nesting problem. To evaluate the performance of our approaches, we conducted an extensive set of computational experiments on real instances. The results of these experiments are reported at the end of the paper.

  18. An orientation toward help-seeking for emotional problems.

    NARCIS (Netherlands)

    Tijhuis, M.A.R.; Peters, L.; Foets, M.

    1990-01-01

    In recent years, many researchers tried to explain the social selection in use of mental health care services. A modest role is attributed to the orientation toward help-seeking. This article studies this orientation. Our research-population consisted of 10,171 Dutch persons, aged 18 and older.

  19. Orientation is different: Interaction between contour integration and feature contrasts in visual search.

    Science.gov (United States)

    Jingling, Li; Tseng, Chia-Huei; Zhaoping, Li

    2013-09-10

    Salient items usually capture attention and are beneficial to visual search. Jingling and Tseng (2013), nevertheless, have discovered that a salient collinear column can impair local visual search. The display used in that study had 21 rows and 27 columns of bars, all uniformly horizontal (or vertical) except for one column of bars orthogonally oriented to all other bars, making this unique column of collinear (or noncollinear) bars salient in the display. Observers discriminated an oblique target bar superimposed on one of the bars either in the salient column or in the background. Interestingly, responses were slower for a target in a salient collinear column than in the background. This opens a theoretical question of how contour integration interacts with salience computation, which is addressed here by an examination of how salience modulated the search impairment from the collinear column. We show that the collinear column needs to have a high orientation contrast with its neighbors to exert search interference. A collinear column of high contrast in color or luminance did not produce the same impairment. Our results show that orientation-defined salience interacted with collinear contour differently from other feature dimensions, which is consistent with the neuronal properties in V1.

  20. The database search problem: a question of rational decision making.

    Science.gov (United States)

    Gittelson, S; Biedermann, A; Bozza, S; Taroni, F

    2012-10-10

    This paper applies probability and decision theory in the graphical interface of an influence diagram to study the formal requirements of rationality which justify the individualization of a person found through a database search. The decision-theoretic part of the analysis studies the parameters that a rational decision maker would use to individualize the selected person. The modeling part (in the form of an influence diagram) clarifies the relationships between this decision and the ingredients that make up the database search problem, i.e., the results of the database search and the different pairs of propositions describing whether an individual is at the source of the crime stain. These analyses evaluate the desirability associated with the decision of 'individualizing' (and 'not individualizing'). They point out that this decision is a function of (i) the probability that the individual in question is, in fact, at the source of the crime stain (i.e., the state of nature), and (ii) the decision maker's preferences among the possible consequences of the decision (i.e., the decision maker's loss function). We discuss the relevance and argumentative implications of these insights with respect to recent comments in specialized literature, which suggest points of view that are opposed to the results of our study. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.

  1. 31 OBJECTIVE ORIENTED PROBLEM SOLVING A Case Study ...

    African Journals Online (AJOL)

    succeed but which are not Wlder the direct control of the activities ..... Frequent failure of electrical machines due to intenuption .... suffers high attribution rate of skilled personnel and as a result is .... Management and Objective Oriented Project.

  2. POWERPLAY: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem

    Directory of Open Access Journals (Sweden)

    Jürgen eSchmidhuber

    2013-06-01

    Full Text Available Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful behavior of animals and humans, to train a more and more general problem solver from scratch in an unsupervised fashion. Consider the infinite set of all computable descriptions of tasks with possibly computable solutions. The novel algorithmic framework POWERPLAY (2011 continually searches the space of possible pairs of new tasks and modifications of the current problem solver, until it finds a more powerful problem solver that provably solves all previously learned tasks plus the new one, while the unmodified predecessor does not. Wow-effects are achieved by continually making previously learned skills more efficient such that they require less time and space. New skills may (partially re-use previously learned skills. POWERPLAY's search orders candidate pairs of tasks and solver modifications by their conditional computational (time & space complexity, given the stored experience so far. The new task and its corresponding task-solving skill are those first found and validated. The computational costs of validating new tasks need not grow with task repertoire size. POWERPLAY's ongoing search for novelty keeps breaking the generalization abilities of its present solver. This is related to Goedel's sequence of increasingly powerful formal theories based on adding formerly unprovable statements to the axioms without affecting previously provable theorems. The continually increasing repertoire of problem solving procedures can be exploited by a parallel search for solutions to additional externally posed tasks. POWERPLAY may be viewed as a greedy but practical implementation of basic principles of creativity. A first experimental analysis can be found in separate papers [58, 56, 57].

  3. Intersecting Identities and Substance Use Problems: Sexual Orientation, Gender, Race, and Lifetime Substance Use Problems

    Science.gov (United States)

    Mereish, Ethan H.; Bradford, Judith B.

    2014-01-01

    Objective: Research has documented that sexual minorities are at greater risk for substance use than heterosexuals. However, there are limited studies and mixed findings when investigating these health disparities among racial and ethnic minority samples. We used an intersectionality framework to examine disparities in lifetime substance use problems between heterosexual and sexual minority men and women and within sexual minority groups among a racially diverse sample. Method: A nonprobability sample of heterosexual (n = 1,091) and sexual minority (n = 1,465) patients from an urban community health center ranged in age from 18 to 72 years. Participants completed a brief patient survey and reported demographic information and history of lifetime substance use problems. Logistic regressions analyses were used to examine interactions between and among sexual orientation, gender, and race. Results: We found a significant three-way interaction among sexual orientation, gender, and race. Sexual minorities had a greater risk of self-reported lifetime substance use problems than heterosexuals, with nuanced gender and racial differences. Of greatest note, sexual minority women of color had greater risks than heterosexual women of color and than White sexual minority women. Sexual minority men of color did not differ in their risk when compared with heterosexual men of color, and they had lower risk than White sexual minority men. Conclusions: The results of this study demonstrate that an intersectionality framework is crucial to clearly identify lifetime substance use disparities between racially diverse sexual minority and heterosexual men and women. Future research, treatment, and policy should use intersectionality approaches when addressing substance use disparities. PMID:24411810

  4. INTERP, Lexical Analysis for Problems Oriented Language Development

    International Nuclear Information System (INIS)

    Perano, K.J.; Kaliakin, V.N.

    1992-01-01

    1 - Description of program or function: INTERP is a free format data interpretation subroutine system for lexical analysis. The system is flexible, easy to use, small, and efficient and simplifies the development of a problem oriented language (POL) as well as any other translation preprocessor for an application program. INTERP is currently being used to interpret POL translators for both engineering analysis codes and utility programs. The application callable part of the INTERP subroutine system consists of the configuration routines, the interrogation routines, the logical testing functions, the utility routines, the advanced operations routines, and a string handling library. INTERP processes textual information in the form of strings, which are a primary means of data exchange between INTERP and the application program. The INTERP system can be configured to read data directly from a file opened by the application program or the application program. The INTERP system can be configured to read data directly from a file opened by the application program or the application program may read the data file directly and pass the data to the INTERP system by means of a utility routine. 2 - Method of solution: INTERP is a lexical analyzer which examines a data line with no prior knowledge of what it contains and informs the application program of what was found. Each data line typically consists of a collection of special characters and tokens. A token is defined to be an identifiable unit of information. Each new data line is loaded into an internal line buffer and examined one character at a time until a complete token is read. At this time control is returned to the application program which uses the INTERP logical testing functions to identify the token.Once the identification is made, INTERP continues processing the data line until it reaches the end-of-line. INTERP is then given a new line and the process is repeated. INTERP recognizes three classes of tokens

  5. Social value orientation, organizational goal concerns and interdepartmental problem solving

    NARCIS (Netherlands)

    Nauta, A.; de Dreu, C.K.W.; van der Vaart, T.

    2002-01-01

    In a study of 11 organizations among 120 manufacturing, planning and sales employees, support was found for the hypothesis that a prosocial value orientation - as a personality trait - increases the likelihood that employees show a high concern for the goals of other departments. This concern,

  6. Arch-pattern based design and aspect-oriented implementation of Readers-Writers concurrent problem

    Directory of Open Access Journals (Sweden)

    Dumitru Ciorbă

    2007-11-01

    Full Text Available The classical problems of concurrent programming start from the design problems of operating systems in the 80-s. But today there are still proposed new solutions for these problems with the help of various design and programming approaches. The present article describes a solution which was designed according to some new object-oriented principles, based on design patterns and proposes two program solutions: firstly - an object-oriented implementation in Java language, the secondly – an aspect-oriented one in AspectJ language.

  7. Emotion Oriented Programming: Computational Abstractions for AI Problem Solving

    OpenAIRE

    Darty , Kevin; Sabouret , Nicolas

    2012-01-01

    International audience; In this paper, we present a programming paradigm for AI problem solving based on computational concepts drawn from Affective Computing. It is believed that emotions participate in human adaptability and reactivity, in behaviour selection and in complex and dynamic environments. We propose to define a mechanism inspired from this observation for general AI problem solving. To this purpose, we synthesize emotions as programming abstractions that represent the perception ...

  8. Semantic Service Search, Service Evaluation and Ranking in Service Oriented Environment

    Science.gov (United States)

    Dong, Hai; Hussain, Farookh Khadeer; Chang, Elizabeth

    The theory of Service Oriented Environment (SOE) emerges with advanced connectivity of the Internet technologies, openness of business environment and prosperousness of business activities. Service, as a critical object impenetrating every corner of SOE, is a hot research topic in many research domains. Software Engineering (SE), as a subject in engineering field, its researchers pay more attention to supporting advanced technologies for promoting service activities in SOE. In this paper, we draw the position in the research field of semantic service search, service evaluation and ranking in SOE. By means of the case study and literature review research approach, we discover the research motivations and research issues in this field.

  9. Problems and Expectations of University Students Attending Higher Education in Turkey: Orientation Services

    Science.gov (United States)

    Kutlu, Mustafa

    2005-01-01

    The objective of this research is to find out the problems and expectations of the students in Inonu University (in Malatya, a city in east Turkey) concerning the orientation services. An additional objective is to ascertain whether students' expectations with regard to orientation services differ according to their sex, their place of origin, and…

  10. Student evaluation of a problem-oriented module of clinical medicine within a revised dental curriculum.

    NARCIS (Netherlands)

    Tack, C.J.J.; Plasschaert, A.J.M.

    2006-01-01

    As part of a revised dental curriculum, a 3(rd) year module on medical subjects was developed based on a mixture of self-study and problem-oriented approach using cases. Pairs of students had to select a specific medical problem and solve a paper patient case using a problem-solving cycle. Results

  11. Problem-oriented software for the managing of uranium mining by in-situ leaching

    International Nuclear Information System (INIS)

    Noskov, M.D.; Gutsul, M.V.; Istomin, A.D.; Kesler, A.G.; Noskova, S.N.; Cheglokov, A.A.

    2013-01-01

    The problem-oriented software consisting of interconnected geological geoinformation, technological information, geotechnological modeling and expert-analytical systems is presented. The software application procedure for the managing of uranium field development by in-situ leaching is considered [ru

  12. Research on problem solving skills of orienteering athletes in terms of some variables

    Directory of Open Access Journals (Sweden)

    Eroğlu Başak

    2016-01-01

    Full Text Available The aim of this study is to examine the problem solving skills of orienteering athletes in terms of different variables. 157 male and 43 female orienteering athletes, making a total of 200 athletes that joined the 3rd Level of Turkey Championship in 2015 have participated in this study which is in a survey model. The data collection tools were the Problem Solving Inventory and Personal Information Form that were formed by Heppner & Peterson (1982 and adapted into Turkish by Şahin, Şahin & Heppner (1993. In the data analysis, descriptive statics, anova, t test and Tukey test have been utilized. In the line with the findings, it has been determined that the difference between the total mean values (85.55+20.45 that the orienteering athletes got from the problem solving inventory and their age, marital status, sports age, the years of practice in orienteering sports, and the status of being national player is significant (p<0.05. It has been found that male orienteering athletes perform higher evaluating approach compared to the female athletes, and that as the age levels increase, the problem solving skill is affected more positively. Furthermore, it has been determined that the perceptions of the participants that have more experience and sports age in orienteering sports and that do orienteering sports at a national level are more positive in the matter of problem solving skills.

  13. Concept mapping as learning tool in problem-oriented learning

    NARCIS (Netherlands)

    Fürstenau, B.; Kneppers, L.; Sánchez, J.; Cañas, A.J.; Novak, J.D.

    2010-01-01

    In two studies we investigated whether concept mapping or summary writing is more effective in supporting students’ learning from authentic problems in the field of business. We interpret concept mapping and summary writing as elaboration tools aiming at helping students to understand new

  14. Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Junhyuk Park

    2017-01-01

    Full Text Available The capacitated team orienteering problem with time windows (CTOPTW is a problem to determine players’ paths that have the maximum rewards while satisfying the constraints. In this paper, we present the exact solution approach for the CTOPTW which has not been done in previous literature. We show that the branch-and-price (B&P scheme which was originally developed for the team orienteering problem can be applied to the CTOPTW. To solve pricing problems, we used implicit enumeration acceleration techniques, heuristic algorithms, and ng-route relaxations.

  15. Examining the Relationship Between Past Orientation and US Suicide Rates: An Analysis Using Big Data-Driven Google Search Queries.

    Science.gov (United States)

    Lee, Donghyun; Lee, Hojun; Choi, Munkee

    2016-02-11

    Internet search query data reflect the attitudes of the users, using which we can measure the past orientation to commit suicide. Examinations of past orientation often highlight certain predispositions of attitude, many of which can be suicide risk factors. To investigate the relationship between past orientation and suicide rate by examining Google search queries. We measured the past orientation using Google search query data by comparing the search volumes of the past year and those of the future year, across the 50 US states and the District of Columbia during the period from 2004 to 2012. We constructed a panel dataset with independent variables as control variables; we then undertook an analysis using multiple ordinary least squares regression and methods that leverage the Akaike information criterion and the Bayesian information criterion. It was found that past orientation had a positive relationship with the suicide rate (P ≤ .001) and that it improves the goodness-of-fit of the model regarding the suicide rate. Unemployment rate (P ≤ .001 in Models 3 and 4), Gini coefficient (P ≤ .001), and population growth rate (P ≤ .001) had a positive relationship with the suicide rate, whereas the gross state product (P ≤ .001) showed a negative relationship with the suicide rate. We empirically identified the positive relationship between the suicide rate and past orientation, which was measured by big data-driven Google search query.

  16. Social dominance orientation and opinions about what is America's most serious social problem.

    Science.gov (United States)

    Harrod, Wendy J

    2005-08-01

    This study tested whether a measure of Social Dominance Orientation was associated with opinions about America's most serious social problem. 150 undergraduates enrolled in social problems classes responded to the 14-item scale and to an open-ended question, "In your opinion, what is the most serious social problem in our country today?". Analysis shows that mean scale scores differed significantly across social problem responses. Correspondence analysis, plotting association between scale scores and social problem responses, was interpreted as support for social dominance theory. Higher scale scores were associated with problems of crime and negative values and lower scores with problems of education and racism.

  17. Comparative analysis as a basic research orientation: Key methodological problems

    Directory of Open Access Journals (Sweden)

    N P Narbut

    2015-12-01

    Full Text Available To date, the Sociological Laboratory of the Peoples’ Friendship University of Russia has accumulated a vast experience in the field of cross-cultural studies reflected in the publications based on the results of mass surveys conducted in Moscow, Maikop, Beijing, Guangzhou, Prague, Belgrade, and Pristina. However, these publications mainly focus on the comparisons of the empirical data rather than methodological and technical issues, that is why the aim of this article is to identify key problems of the comparative analysis in cross-cultural studies that become evident only if you conduct an empirical research yourself - from the first step of setting the problem and approving it by all the sides (countries involved to the last step of interpreting and comparing the data obtained. The authors are sure that no sociologist would ever doubt the necessity and importance of comparative analysis in the broadest sense of the word, but at the same time very few are ready to discuss its key methodological challenges and prefer to ignore them completely. We summarize problems of the comparative analysis in sociology as follows: (1 applying research techniques to the sample in another country - both in translating and adapting them to different social realities and worldview (in particular, the problematic status of standardization and qualitative approach; (2 choosing “right” respondents to question and relevant cases (cultures to study; (3 designing the research scheme, i.e. justifying the sequence of steps (what should go first - methodology or techniques; (4 accepting the procedures that are correct within one country for cross-cultural work (whether or not that is an appropriate choice.

  18. Problem-oriented clinical microbiology and infection. 2nd. ed.

    Energy Technology Data Exchange (ETDEWEB)

    Hilary Humphreys; William, L. Irving [Royal College of Surgeons (Ireland)

    2004-08-01

    This medical textbook is problem-based, in line with current medical teaching, and covers 70 clinical cases. This second edition has been updated to include new material on AIDS/HIV, emerging antibiotic-resistant bacteria and new viral pathogens such as SARS. Sections are headed; Skin and mucous membranes; Respiratory tract; Gastrointestinal system which includes a case study entitled: Bob, a 55-year-old retired coal miner with abdominal pain; Genito-urinary system; Central nervous system; Systemic infections; Pregnancy and the neonate; and Miscellaneous. 29 ills., 125 photos.

  19. Filter Pattern Search Algorithms for Mixed Variable Constrained Optimization Problems

    National Research Council Canada - National Science Library

    Abramson, Mark A; Audet, Charles; Dennis, Jr, J. E

    2004-01-01

    .... This class combines and extends the Audet-Dennis Generalized Pattern Search (GPS) algorithms for bound constrained mixed variable optimization, and their GPS-filter algorithms for general nonlinear constraints...

  20. The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared

    NARCIS (Netherlands)

    L. Evers (Lanah); K.M. Glorie (Kristiaan); S. van der Ster (Suzanne); A.I. Barros (Ana); H. Monsuur (Herman)

    2012-01-01

    textabstractThe Orienteering Problem (OP) is a generalization of the well-known traveling salesman problem and has many interesting applications in logistics, tourism and defense. To reflect real-life situations, we focus on an uncertain variant of the OP. Two main approaches that deal with

  1. A Two-Stage Approach to the Orienteering Problem with Stochastic Weights

    NARCIS (Netherlands)

    Evers, L.; Glorie, K.; Ster, S. van der; Barros, A.I.; Monsuur, H.

    2014-01-01

    The Orienteering Problem (OP) is a routing problem which has many interesting applications in logistics, tourism and defense. The aim of the OP is to find a maximum profit path or tour, which is feasible with respect to a capacity constraint on the total weight of the selected arcs. In this paper we

  2. A two-stage approach to the orienteering problem with stochastic weights

    NARCIS (Netherlands)

    Evers, L.; Glorie, K.M.; van der Ster, S.L.; Barros, A.I.; Monsuur, H.

    2014-01-01

    The Orienteering Problem (OP) is a routing problem which has many interesting applications in logistics, tourism and defense. The aim of the OP is to find a maximum profit path or tour, which is feasible with respect to a capacity constraint on the total weight of the selected arcs. In this paper we

  3. The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared

    NARCIS (Netherlands)

    Evers, L.; Glorie, K.; Ster, S. van der; Barros, A.I.; Monsuur, H.

    2012-01-01

    The Orienteering Problem (OP) is a generalization of the well-known traveling salesman problem and has many interesting applications in logistics, tourism and defense. To reflect real-life situations, we focus on an uncertain variant of the OP. Two main approaches that deal with optimization under

  4. Prevention for elderly people: demand-oriented or problem-oriented?

    Science.gov (United States)

    Kupper, Nicolette M; Schreurs, Hanneke; Ten Klooster, Peter M; Bode, Christina; van Ameijden, Erik J C

    2011-09-01

    To examine the association between self-expressed information needs and corresponding observed health and lifestyle issues in elderly people. Data were used from the 2006 community health survey in Utrecht, a medium-sized city in the Netherlands. Data of 1634 people aged 55 years and older were available for analyses (response 64%). Multivariate logistic regression analyses were used to examine possible associations between expressed information needs and variables on demographics, lifestyle risk behaviours, physical and psychosocial health. Several significant associations were found between information needs and corresponding health and lifestyle problems. However, the explanatory power of the observed problems was generally low, explaining only 7% of the informational needs on lifestyle, and 17% and 28% of the informational needs on physical and psychosocial health, respectively. The findings suggest that prevention amongst the elderly should not be solely based on information needs, but also on observed lifestyle and health. Implications for the use of different approaches of prevention and behavioural models underlying interventions are discussed. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

  5. Determination of optimal self-drive tourism route using the orienteering problem method

    Science.gov (United States)

    Hashim, Zakiah; Ismail, Wan Rosmanira; Ahmad, Norfaieqah

    2013-04-01

    This paper was conducted to determine the optimal travel routes for self-drive tourism based on the allocation of time and expense by maximizing the amount of attraction scores assigned to each city involved. Self-drive tourism represents a type of tourism where tourists hire or travel by their own vehicle. It only involves a tourist destination which can be linked with a network of roads. Normally, the traveling salesman problem (TSP) and multiple traveling salesman problems (MTSP) method were used in the minimization problem such as determination the shortest time or distance traveled. This paper involved an alternative approach for maximization method which is maximize the attraction scores and tested on tourism data for ten cities in Kedah. A set of priority scores are used to set the attraction score at each city. The classical approach of the orienteering problem was used to determine the optimal travel route. This approach is extended to the team orienteering problem and the two methods were compared. These two models have been solved by using LINGO12.0 software. The results indicate that the model involving the team orienteering problem provides a more appropriate solution compared to the orienteering problem model.

  6. A Hybrid Symbiotic Organisms Search Algorithm with Variable Neighbourhood Search for Solving Symmetric and Asymmetric Traveling Salesman Problem

    Science.gov (United States)

    Umam, M. I. H.; Santosa, B.

    2018-04-01

    Combinatorial optimization has been frequently used to solve both problems in science, engineering, and commercial applications. One combinatorial problems in the field of transportation is to find a shortest travel route that can be taken from the initial point of departure to point of destination, as well as minimizing travel costs and travel time. When the distance from one (initial) node to another (destination) node is the same with the distance to travel back from destination to initial, this problems known to the Traveling Salesman Problem (TSP), otherwise it call as an Asymmetric Traveling Salesman Problem (ATSP). The most recent optimization techniques is Symbiotic Organisms Search (SOS). This paper discuss how to hybrid the SOS algorithm with variable neighborhoods search (SOS-VNS) that can be applied to solve the ATSP problem. The proposed mechanism to add the variable neighborhoods search as a local search is to generate the better initial solution and then we modify the phase of parasites with adapting mechanism of mutation. After modification, the performance of the algorithm SOS-VNS is evaluated with several data sets and then the results is compared with the best known solution and some algorithm such PSO algorithm and SOS original algorithm. The SOS-VNS algorithm shows better results based on convergence, divergence and computing time.

  7. The provably total search problems of bounded arithmetic

    Czech Academy of Sciences Publication Activity Database

    Skelley, A.; Thapen, Neil

    2011-01-01

    Roč. 103, č. 1 (2011), s. 106-138 ISSN 0024-6115 R&D Projects: GA MŠk LC505 Institutional research plan: CEZ:AV0Z10190503 Keywords : Pigeonhole principle * polynomial hierarchy * local search Subject RIV: BA - General Mathematics Impact factor: 1.324, year: 2011 http://plms.oxfordjournals.org/content/103/1/106

  8. The accountability problem of flooding attacks in service-oriented architectures

    DEFF Research Database (Denmark)

    Jensen, Meiko; Schwenk, Jörg

    2009-01-01

    The threat of Denial of Service attacks poses a serious problem to the security of network-based services in general. For flooding attacks against service-oriented applications, this threat is dramatically amplified with potentially much higher impact and very little effort on the attacker's side....... Additionally, due to the high distribution of a SOA application's components, fending such attacks becomes a far more complex task. In this paper, we present the problem of accountability, referring to the issue of resolving the attacker in a highly distributed service-oriented application. Using a general...

  9. Determinants of a successful problem list to support the implementation of the problem-oriented medical record according to recent literature

    NARCIS (Netherlands)

    Simons, S.M.; Cillessen, F.H.J.M.; Hazelzet, J.A.

    2016-01-01

    BACKGROUND: A problem-oriented approach is one of the possibilities to organize a medical record. The problem-oriented medical record (POMR) - a structured organization of patient information per presented medical problem- was introduced at the end of the sixties by Dr. Lawrence Weed to aid dealing

  10. APPLYING PROFESSIONALLY ORIENTED PROBLEMS OF MATHEMATICAL MODELING IN TEACHING STUDENTS OF ENGINEERING DEPARTMENTS

    Directory of Open Access Journals (Sweden)

    Natal’ya Yur’evna Gorbunova

    2017-06-01

    Full Text Available We described several aspects of organizing student research work, as well as solving a number of mathematical modeling problems: professionally-oriented, multi-stage, etc. We underlined the importance of their economic content. Samples of using such problems in teaching Mathematics at agricultural university were given. Several questions connected with information material selection and peculiarities of research problems application were described. Purpose. The author aims to show the possibility and necessity of using professionally-oriented problems of mathematical modeling in teaching Mathematics at agricultural university. The subject of analysis is including such problems into educational process. Methodology. The main research method is dialectical method of obtaining knowledge of finding approaches to selection, writing and using mathematical modeling and professionally-oriented problems in educational process; the methodology is study of these methods of obtaining knowledge. Results. As a result of analysis of literature, students opinions, observation of students work, and taking into account personal teaching experience, it is possible to make conclusion about importance of using mathematical modeling problems, as it helps to systemize theoretical knowledge, apply it to practice, raise students study motivation in engineering sphere. Practical implications. Results of the research can be of interest for teachers of Mathematics in preparing Bachelor and Master students of engineering departments of agricultural university both for theoretical research and for modernization of study courses.

  11. Multi-objective unit commitment problem using Cuckoo search ...

    African Journals Online (AJOL)

    user

    Many solution strategies are available to solve the highly non-smooth problem. ... So, artificial intelligence techniques like, neural ..... For instance, let us assume that the Ton and Toff for a hypothetical thermal power ...... Energy Convers, Vol.

  12. A branch-and-cut algorithm for the Team Orienteering Problem

    NARCIS (Netherlands)

    Bianchessi, Nicola; Mansini, Renata; Speranza, M. Grazia

    2018-01-01

    The Team Orienteering Problem aims at maximizing the total amount of profit collected by a fleet of vehicles while not exceeding a predefined travel time limit on each vehicle. In the last years, several exact methods based on different mathematical formulations were proposed. In this paper, we

  13. Students' Performance Awareness, Motivational Orientations and Learning Strategies in a Problem-Based Electromagnetism Course

    Science.gov (United States)

    Saglam, Murat

    2010-01-01

    This study aims to explore problem-based learning (PBL) in conjunction with students' confidence in the basic ideas of electromagnetism and their motivational orientations and learning strategies. The 78 first-year geology and geophysics students followed a three-week PBL instruction in electromagnetism. The students' confidence was assessed…

  14. Sex-oriented stable matchings of the marriage problem with correlated and incomplete information

    Science.gov (United States)

    Caldarelli, Guido; Capocci, Andrea; Laureti, Paolo

    2001-10-01

    In the stable marriage problem two sets of agents must be paired according to mutual preferences, which may happen to conflict. We present two generalizations of its sex-oriented version, aiming to take into account correlations between the preferences of agents and costly information. Their effects are investigated both numerically and analytically.

  15. Contraception for the first time users: a problem-orientated guide to ...

    African Journals Online (AJOL)

    Contraception for the first time users: a problem-orientated guide to product selection and safe prescription. W M Kruger, O S Steyn. Abstract. No Abstract South African Family Practice Vol. 49 (8) 2007: pp.44-50. Full Text: EMAIL FREE FULL TEXT EMAIL FREE FULL TEXT · DOWNLOAD FULL TEXT DOWNLOAD FULL ...

  16. Enhancing Problem-Solving Capabilities Using Object-Oriented Programming Language

    Science.gov (United States)

    Unuakhalu, Mike F.

    2009-01-01

    This study integrated object-oriented programming instruction with transfer training activities in everyday tasks, which might provide a mechanism that can be used for efficient problem solving. Specifically, a Visual BASIC embedded with everyday tasks group was compared to another group exposed to Visual BASIC instruction only. Subjects were 40…

  17. An Achievement Degree Analysis Approach to Identifying Learning Problems in Object-Oriented Programming

    Science.gov (United States)

    Allinjawi, Arwa A.; Al-Nuaim, Hana A.; Krause, Paul

    2014-01-01

    Students often face difficulties while learning object-oriented programming (OOP) concepts. Many papers have presented various assessment methods for diagnosing learning problems to improve the teaching of programming in computer science (CS) higher education. The research presented in this article illustrates that although max-min composition is…

  18. Action-State Orientation and the Theory of Planned Behavior: A Study of Job Search in China

    Science.gov (United States)

    Song, Zhaoli; Wanberg, Connie; Niu, Xiongying; Xie, Yizhong

    2006-01-01

    Job search is an important element of people's careers and is especially critical for unemployed individuals. The current study surveyed a sample of 328 unemployed job seekers in China to test hypotheses related to the theory of planned behavior and action-state orientation theory. Results of the three-wave longitudinal study demonstrated that the…

  19. A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract

    Directory of Open Access Journals (Sweden)

    Quang Dung Pham

    2009-10-01

    Full Text Available Constrained Optimum Path (COP problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In this paper, we introduce a novel local search modeling for solving some COPs by local search. The modeling features the compositionality, modularity, reuse and strengthens the benefits of Constrained-Based Local Search. We also apply the modeling to the edge-disjoint paths problem (EDP. We show that side constraints can easily be added in the model. Computational results show the significance of the approach.

  20. Structured pigeonhole principle, search problems and hard tautologies

    Czech Academy of Sciences Publication Activity Database

    Krajíček, Jan

    2005-01-01

    Roč. 70, č. 2 (2005), s. 619-630 ISSN 0022-4812 R&D Projects: GA AV ČR(CZ) IAA1019401; GA MŠk(CZ) LN00A056 Institutional research plan: CEZ:AV0Z10190503 Keywords : proof complexity * pigeonhole principle * serch problems Subject RIV: BA - General Mathematics Impact factor: 0.470, year: 2005

  1. An Advanced Tabu Search Approach to the Airlift Loading Problem

    Science.gov (United States)

    2006-12-01

    Problem Statement................................................................ 37 3.1.1 SALP -TS Inputs...41 3.2.1 SALP -TS Data Structures .......................................................... 41 3.2.2 SALP -TS Solution...3.2.4 SALP Lower Bound ................................................................... 46 3.2.5 Initial Solution Generator

  2. To the editor: Two solutions in search of a problem

    Science.gov (United States)

    Two recent articles in Hepatology suggest that the problems of fructose-induced fibrosis severity in patients with nonalcoholic fatty liver disease (NAFLD) or nonalcoholic hepatic steatosis (NASH) could be solved if their exposure were limited either directly through diet or indirectly through curcu...

  3. Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.

    Science.gov (United States)

    Nallaperuma, Samadhi; Neumann, Frank; Sudholt, Dirk

    2017-01-01

    Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to our theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed-time budget. We follow this approach and present a fixed-budget analysis for an NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson Problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed-time budget. In particular, we analyze Manhattan and Euclidean TSP instances and Randomized Local Search (RLS), (1+1) EA and (1+[Formula: see text]) EA algorithms for the TSP in a smoothed complexity setting, and derive the lower bounds of the expected fitness gain for a specified number of generations.

  4. The role of metacognitive skills in solving object-oriented programming problems: a case study

    Directory of Open Access Journals (Sweden)

    Marietjie Havenga

    2015-07-01

    Full Text Available This article reports on the role of metacognitive skills when solving object-oriented programming problems as part of a case study. The research was constructivist-based within an interpretivist approach to explore how four students constructed their own thinking when solving programming problems. A qualitative methodology was employed. Both concept-driven coding and data-driven coding were applied. Two main issues emerged from the findings. Participating students had fragmented knowledge of the object-oriented approach and shortcomings regarding the implementation thereof, and they experienced problems with metacognitive control during all the steps of program development. Based on the findings the use of metacognitive critical control points (MCCPs is proposed to be used as a mechanism to facilitate students in their programming efforts and to prevent loss of control during program development.

  5. A local search heuristic for the Multi-Commodity k-splittable Maximum Flow Problem

    DEFF Research Database (Denmark)

    Gamst, Mette

    2014-01-01

    , a local search heuristic for solving the problem is proposed. The heuristic is an iterative shortest path procedure on a reduced graph combined with a local search procedure to modify certain path flows and prioritize the different commodities. The heuristic is tested on benchmark instances from...

  6. A rational analysis of alternating search and reflection strategies in problem solving

    NARCIS (Netherlands)

    Taatgen, N; Shafto, MG; Langley, P

    1997-01-01

    In this paper two approaches to problem solving, search and reflection, are discussed, and combined in two models, both based on rational analysis (Anderson, 1990). The first model is a dynamic growth model, which shows that alternating search and reflection is a rational strategy. The second model

  7. ORGANIC PRODUCTION IN UKRAINE: PROBLEMS AND PROSPECTS IN CONTEXT OF SOCIAL ORIENTED ENTEPRENEURSHIP

    Directory of Open Access Journals (Sweden)

    G. Chornous

    2014-06-01

    Full Text Available Practical realization of sustainable development general conception is passing to the organic production, that allows to satisfy society problems, not putting health and future generations' existence under a threat. At this entrepreneurs, which work in the consumer products' field, must displace accents from economic oriented to social oriented entrepreneurship. The article is dedicated to research negative and positive factors that influence on social oriented Ukrainian enterprises in the sphere of organic goods production. The special attention is attended to the analysis of foodstuffs producers' activity, the results of which have considerable direct influence on consumers' health. The value of informative influences on consumers and producers is analyzed. State support directions of organic goods production, creation of internal market ecologically safe products infrastructure are defined. Recommendations are given according to research results in relation to stimulation social responsibility of businessmen and model forming, which combines interests of consumers and producers, environmental preservation, population health refinement and ecological situation improvement.

  8. Problem-Oriented Corporate Knowledge Base Models on the Case-Based Reasoning Approach Basis

    Science.gov (United States)

    Gluhih, I. N.; Akhmadulin, R. K.

    2017-07-01

    One of the urgent directions of efficiency enhancement of production processes and enterprises activities management is creation and use of corporate knowledge bases. The article suggests a concept of problem-oriented corporate knowledge bases (PO CKB), in which knowledge is arranged around possible problem situations and represents a tool for making and implementing decisions in such situations. For knowledge representation in PO CKB a case-based reasoning approach is encouraged to use. Under this approach, the content of a case as a knowledge base component has been defined; based on the situation tree a PO CKB knowledge model has been developed, in which the knowledge about typical situations as well as specific examples of situations and solutions have been represented. A generalized problem-oriented corporate knowledge base structural chart and possible modes of its operation have been suggested. The obtained models allow creating and using corporate knowledge bases for support of decision making and implementing, training, staff skill upgrading and analysis of the decisions taken. The universal interpretation of terms “situation” and “solution” adopted in the work allows using the suggested models to develop problem-oriented corporate knowledge bases in different subject domains. It has been suggested to use the developed models for making corporate knowledge bases of the enterprises that operate engineer systems and networks at large production facilities.

  9. Genetic Local Search for Optimum Multiuser Detection Problem in DS-CDMA Systems

    Science.gov (United States)

    Wang, Shaowei; Ji, Xiaoyong

    Optimum multiuser detection (OMD) in direct-sequence code-division multiple access (DS-CDMA) systems is an NP-complete problem. In this paper, we present a genetic local search algorithm, which consists of an evolution strategy framework and a local improvement procedure. The evolution strategy searches the space of feasible, locally optimal solutions only. A fast iterated local search algorithm, which employs the proprietary characteristics of the OMD problem, produces local optima with great efficiency. Computer simulations show the bit error rate (BER) performance of the GLS outperforms other multiuser detectors in all cases discussed. The computation time is polynomial complexity in the number of users.

  10. Iterated local search and record-to-record travel applied to the fixed charge transportation problem

    DEFF Research Database (Denmark)

    Andersen, Jeanne; Klose, Andreas

    The fixed charge transportation problem (FCTP) is a well-known and difficult optimization problem with lots of applications in logistics. It consists in finding a minimum cost network flow from a set of suppliers to a set of customers. Beside costs proportional to quantities transported......, transportation costs do, however, include a fixed charge. Iterated local search and record-to-record travel are both simple local search based meta-heuristics that, to our knowledge, not yet have been applied to the FCTP. In this paper, we apply both types of search strategies and combine them into a single...

  11. Student evaluation of a problem-oriented module of clinical medicine within a revised dental curriculum.

    Science.gov (United States)

    Tack, C J; Plasschaert, A J M

    2006-05-01

    As part of a revised dental curriculum, a 3(rd) year module on medical subjects was developed based on a mixture of self-study and problem-oriented approach using cases. Pairs of students had to select a specific medical problem and solve a paper patient case using a problem-solving cycle. Results were presented in working groups and by writing an essay. The quality of the presentations was assessed by colleague students and by the teacher supervisor; the expert teacher in the field graded the essay. The results contributed for 40% to the overall grade of the module. A questionnaire filled out by 94% of the participating students showed that 85% of the students agreed in preferring this way of handling medical problems as compared with conventional, lecture-based education. Almost all of them enjoyed the provided opportunity to give a case presentation. The problem-oriented model was assessed as useful by 73% of the students. Knowledge concerning the topic chosen turned out to be higher than knowledge of other topics. Although this study cannot prove that this mode of education actually results in a better ability to cope with medical problems, it may contribute in several ways to the final competences in the area of general medicine in the undergraduate dental curriculum.

  12. The problem-oriented system, problem-knowledge coupling, and clinical decision making.

    Science.gov (United States)

    Weed, L L; Zimny, N J

    1989-07-01

    The information tool to aid us in making the clinical decisions discussed in this presentation is called the PKC. Our goal with patients should be to couple the knowledge of the unique patient to the knowledge in the literature and get the best possible match. This approach requires combinatorial versus probabilistic thinking. In the real world, ideal matches are not found. Therefore, it is critical to exhaust the patient's uniqueness first and only then use probabilities to settle further uncertainties. It is an error to teach people how to deal with uncertainty instead of teaching them to clean up a great deal of the uncertainty first. Patients must be involved in this endeavor. In essence, they have a PhD in their own uniqueness, and it is this uniqueness that is very powerful in solving complex problems. This method of patient evaluation and management cannot be used with the unaided mind. It requires new and powerful information tools like the PKC. All information that is relevant to a problem should be included in the coupler. It should encompass differing points of view, and the rationale should be made explicit to clinician and patient alike. When complete, the coupler should represent an interdisciplinary compilation of questions and tests that are expected to be collected every time in the clinic for the type of problem the coupler represents. This method will provide a basis for quality control because the contents of the coupler now have defined what we expect to occur in every patient encounter.(ABSTRACT TRUNCATED AT 250 WORDS)

  13. Monte Carlo Tree Search for Continuous and Stochastic Sequential Decision Making Problems

    International Nuclear Information System (INIS)

    Couetoux, Adrien

    2013-01-01

    In this thesis, I studied sequential decision making problems, with a focus on the unit commitment problem. Traditionally solved by dynamic programming methods, this problem is still a challenge, due to its high dimension and to the sacrifices made on the accuracy of the model to apply state of the art methods. I investigated on the applicability of Monte Carlo Tree Search methods for this problem, and other problems that are single player, stochastic and continuous sequential decision making problems. In doing so, I obtained a consistent and anytime algorithm, that can easily be combined with existing strong heuristic solvers. (author)

  14. Research problems and trends of the pharmaceutical market Sudan as social oriented structure of the country

    OpenAIRE

    Олена Миколаївна Євтушенко; Осама Абузаїд Мохамед Нур Ахмед

    2016-01-01

    Aim: The research object was the definition of problems and tendencies of pharmaceutical market development of Sudan as the country which in recent years tries to pull through the consequence of political and economic crisis and to build the socially oriented model of the state.Methods: In the researches it has been used the marketing and economic analysis methods as well as the historical, logical, comparative and graphic methods.Results: The authors represented the marketing analysis result...

  15. A reduced-cost iterated local search heuristic for the fixed-charge transportation problem

    NARCIS (Netherlands)

    Buson, Erika; Roberti, Roberto; Toth, Paolo

    2014-01-01

    The fixed-charge transportation problem (FCTP) is a generalization of the transportation problem where an additional fixed cost is paid for sending a flow from an origin to a destination. We propose an iterated local search heuristic based on the utilization of reduced costs for guiding the restart

  16. Multiobjective scatter search approach with new combination scheme applied to solve environmental/economic dispatch problem

    International Nuclear Information System (INIS)

    Athayde Costa e Silva, Marsil de; Klein, Carlos Eduardo; Mariani, Viviana Cocco; Santos Coelho, Leandro dos

    2013-01-01

    The environmental/economic dispatch (EED) is an important daily optimization task in the operation of many power systems. It involves the simultaneous optimization of fuel cost and emission objectives which are conflicting ones. The EED problem can be formulated as a large-scale highly constrained nonlinear multiobjective optimization problem. In recent years, many metaheuristic optimization approaches have been reported in the literature to solve the multiobjective EED. In terms of metaheuristics, recently, scatter search approaches are receiving increasing attention, because of their potential to effectively explore a wide range of complex optimization problems. This paper proposes an improved scatter search (ISS) to deal with multiobjective EED problems based on concepts of Pareto dominance and crowding distance and a new scheme for the combination method. In this paper, we have considered the standard IEEE (Institute of Electrical and Electronics Engineers) 30-bus system with 6-generators and the results obtained by proposed ISS algorithm are compared with the other recently reported results in the literature. Simulation results demonstrate that the proposed ISS algorithm is a capable candidate in solving the multiobjective EED problems. - Highlights: ► Economic dispatch. ► We solve the environmental/economic economic power dispatch problem with scatter search. ► Multiobjective scatter search can effectively improve the global search ability

  17. Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search

    DEFF Research Database (Denmark)

    Pedersen, C.R.; Rasmussen, R.V.; Andersen, Kim Allan

    2007-01-01

    exploitation of the elastic jobs and solve the problem using a tabu search procedure. Finding an initial feasible solution is in general -complete, but the tabu search procedure includes a specialized heuristic for solving this problem. The solution method has proven to be very efficient and leads......This paper presents a solution method for minimizing makespan of a practical large-scale scheduling problem with elastic jobs. The jobs are processed on three servers and restricted by precedence constraints, time windows and capacity limitations. We derive a new method for approximating the server...... to a significant decrease in makespan compared to the strategy currently implemented....

  18. Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search

    DEFF Research Database (Denmark)

    Pedersen, C.R.; Rasmussen, R.V.; Andersen, Kim Allan

    2007-01-01

    This paper presents a solution method for minimizing makespan of a practical large-scale scheduling problem with elastic jobs. The jobs are processed on three servers and restricted by precedence constraints, time windows and capacity limitations. We derive a new method for approximating the server...... exploitation of the elastic jobs and solve the problem using a tabu search procedure. Finding an initial feasible solution is in general -complete, but the tabu search procedure includes a specialized heuristic for solving this problem. The solution method has proven to be very efficient and leads...

  19. Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages

    Directory of Open Access Journals (Sweden)

    Hassan Ismkhan

    2014-01-01

    Full Text Available The traveling salesman problem (TSP is one of the most famous problems. Many applications and programming tools have been developed to handle TSP. However, it seems to be essential to provide easy programming tools according to state-of-the-art algorithms. Therefore, we have collected and programmed new easy tools by the three object-oriented languages. In this paper, we present ADT (abstract data type of developed tools at first; then we analyze their performance by experiments. We also design a hybrid genetic algorithm (HGA by developed tools. Experimental results show that the proposed HGA is comparable with the recent state-of-the-art applications.

  20. Solving k-Barrier Coverage Problem Using Modified Gravitational Search Algorithm

    Directory of Open Access Journals (Sweden)

    Yanhua Zhang

    2017-01-01

    Full Text Available Coverage problem is a critical issue in wireless sensor networks for security applications. The k-barrier coverage is an effective measure to ensure robustness. In this paper, we formulate the k-barrier coverage problem as a constrained optimization problem and introduce the energy constraint of sensor node to prolong the lifetime of the k-barrier coverage. A novel hybrid particle swarm optimization and gravitational search algorithm (PGSA is proposed to solve this problem. The proposed PGSA adopts a k-barrier coverage generation strategy based on probability and integrates the exploitation ability in particle swarm optimization to update the velocity and enhance the global search capability and introduce the boundary mutation strategy of an agent to increase the population diversity and search accuracy. Extensive simulations are conducted to demonstrate the effectiveness of our proposed algorithm.

  1. PowerPlay: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem.

    Science.gov (United States)

    Schmidhuber, Jürgen

    2013-01-01

    Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful behavior of animals and humans, to train a more and more general problem solver from scratch in an unsupervised fashion. Consider the infinite set of all computable descriptions of tasks with possibly computable solutions. Given a general problem-solving architecture, at any given time, the novel algorithmic framework PowerPlay (Schmidhuber, 2011) searches the space of possible pairs of new tasks and modifications of the current problem solver, until it finds a more powerful problem solver that provably solves all previously learned tasks plus the new one, while the unmodified predecessor does not. Newly invented tasks may require to achieve a wow-effect by making previously learned skills more efficient such that they require less time and space. New skills may (partially) re-use previously learned skills. The greedy search of typical PowerPlay variants uses time-optimal program search to order candidate pairs of tasks and solver modifications by their conditional computational (time and space) complexity, given the stored experience so far. The new task and its corresponding task-solving skill are those first found and validated. This biases the search toward pairs that can be described compactly and validated quickly. The computational costs of validating new tasks need not grow with task repertoire size. Standard problem solver architectures of personal computers or neural networks tend to generalize by solving numerous tasks outside the self-invented training set; PowerPlay's ongoing search for novelty keeps breaking the generalization abilities of its present solver. This is related to Gödel's sequence of increasingly powerful formal theories based on adding formerly unprovable statements to the axioms without affecting previously provable theorems. The continually increasing

  2. Self-Regulation and Problem Solving Ability in 7E-Learning Cycle Based Goal Orientation

    Science.gov (United States)

    Mulyono; Noor, N. L.

    2017-04-01

    Goal orientation differences between mastery goals and performance goals can be a cause of high and low self-regulation and problem-solving abilities. To overcome these problems applied 7E-learning cycle in which students learn and develop ways to optimise the power of reason through the learning phase elicit, engage, explore, explain, elaborate, evaluate, and extend. This study aimed to test the effectiveness of learning by 7E-learning cycle and describe self-regulation and mathematics problem solving based on goal-orientation after the implementation 7E-learning cycle. This study used mix method design with research subject is graders XII sciences MA NU Nurul Ulum Jekulo Kudus which divided into goal orientation is mastery goal and performance goal. The independent variable of this research is learning model, while the dependent variable is problem solving and self-regulation. Then, collecting data using scale, interviews and tests. The data processed with the proportion of test, t-test, paired samples t-test, and Normality-gain. The results show problem-solving abilities of students through 7E-learning cycle the average of mathematical problem-solving capability class, self-regulation at 7E-learning cycle is better than the traditional model study. The problem-solving skills at 7E-learning cycle are better than the traditional model study, there is an increase in self-regulation through 7E-learning cycle of 0.4 (medium), and there is an increased problem-solving ability through 7E-learning cycle by 0.79 (high). Based on the qualitative analysis, self-regulation and problem-solving ability after the implementation of 7E-learning cycle students of a mastery goal group are better than the performance goal team. It is suggested to implement 7E-learning cycle to improve self-regulation and problem-solving ability as well as directing and fostering mastery goal on the student in the learning process.

  3. A Group Theoretic Approach to Metaheuristic Local Search for Partitioning Problems

    Science.gov (United States)

    2005-05-01

    Tabu Search. Mathematical and Computer Modeling 39: 599-616. 107 Daskin , M.S., E. Stern. 1981. A Hierarchical Objective Set Covering Model for EMS... A Group Theoretic Approach to Metaheuristic Local Search for Partitioning Problems by Gary W. Kinney Jr., B.G.S., M.S. Dissertation Presented to the...DISTRIBUTION STATEMENT A Approved for Public Release Distribution Unlimited The University of Texas at Austin May, 2005 20050504 002 REPORT

  4. A hardware-oriented concurrent TZ search algorithm for High-Efficiency Video Coding

    Science.gov (United States)

    Doan, Nghia; Kim, Tae Sung; Rhee, Chae Eun; Lee, Hyuk-Jae

    2017-12-01

    High-Efficiency Video Coding (HEVC) is the latest video coding standard, in which the compression performance is double that of its predecessor, the H.264/AVC standard, while the video quality remains unchanged. In HEVC, the test zone (TZ) search algorithm is widely used for integer motion estimation because it effectively searches the good-quality motion vector with a relatively small amount of computation. However, the complex computation structure of the TZ search algorithm makes it difficult to implement it in the hardware. This paper proposes a new integer motion estimation algorithm which is designed for hardware execution by modifying the conventional TZ search to allow parallel motion estimations of all prediction unit (PU) partitions. The algorithm consists of the three phases of zonal, raster, and refinement searches. At the beginning of each phase, the algorithm obtains the search points required by the original TZ search for all PU partitions in a coding unit (CU). Then, all redundant search points are removed prior to the estimation of the motion costs, and the best search points are then selected for all PUs. Compared to the conventional TZ search algorithm, experimental results show that the proposed algorithm significantly decreases the Bjøntegaard Delta bitrate (BD-BR) by 0.84%, and it also reduces the computational complexity by 54.54%.

  5. Improved Particle Swarm Optimization with a Collective Local Unimodal Search for Continuous Optimization Problems

    Science.gov (United States)

    Arasomwan, Martins Akugbe; Adewumi, Aderemi Oluyinka

    2014-01-01

    A new local search technique is proposed and used to improve the performance of particle swarm optimization algorithms by addressing the problem of premature convergence. In the proposed local search technique, a potential particle position in the solution search space is collectively constructed by a number of randomly selected particles in the swarm. The number of times the selection is made varies with the dimension of the optimization problem and each selected particle donates the value in the location of its randomly selected dimension from its personal best. After constructing the potential particle position, some local search is done around its neighbourhood in comparison with the current swarm global best position. It is then used to replace the global best particle position if it is found to be better; otherwise no replacement is made. Using some well-studied benchmark problems with low and high dimensions, numerical simulations were used to validate the performance of the improved algorithms. Comparisons were made with four different PSO variants, two of the variants implement different local search technique while the other two do not. Results show that the improved algorithms could obtain better quality solution while demonstrating better convergence velocity and precision, stability, robustness, and global-local search ability than the competing variants. PMID:24723827

  6. Complex Problem Solving in Teams: The Impact of Collective Orientation on Team Process Demands

    Science.gov (United States)

    Hagemann, Vera; Kluge, Annette

    2017-01-01

    Complex problem solving is challenging and a high-level cognitive process for individuals. When analyzing complex problem solving in teams, an additional, new dimension has to be considered, as teamwork processes increase the requirements already put on individual team members. After introducing an idealized teamwork process model, that complex problem solving teams pass through, and integrating the relevant teamwork skills for interdependently working teams into the model and combining it with the four kinds of team processes (transition, action, interpersonal, and learning processes), the paper demonstrates the importance of fulfilling team process demands for successful complex problem solving within teams. Therefore, results from a controlled team study within complex situations are presented. The study focused on factors that influence action processes, like coordination, such as emergent states like collective orientation, cohesion, and trust and that dynamically enable effective teamwork in complex situations. Before conducting the experiments, participants were divided by median split into two-person teams with either high (n = 58) or low (n = 58) collective orientation values. The study was conducted with the microworld C3Fire, simulating dynamic decision making, and acting in complex situations within a teamwork context. The microworld includes interdependent tasks such as extinguishing forest fires or protecting houses. Two firefighting scenarios had been developed, which takes a maximum of 15 min each. All teams worked on these two scenarios. Coordination within the team and the resulting team performance were calculated based on a log-file analysis. The results show that no relationships between trust and action processes and team performance exist. Likewise, no relationships were found for cohesion. Only collective orientation of team members positively influences team performance in complex environments mediated by action processes such as

  7. Complex Problem Solving in Teams: The Impact of Collective Orientation on Team Process Demands.

    Science.gov (United States)

    Hagemann, Vera; Kluge, Annette

    2017-01-01

    Complex problem solving is challenging and a high-level cognitive process for individuals. When analyzing complex problem solving in teams, an additional, new dimension has to be considered, as teamwork processes increase the requirements already put on individual team members. After introducing an idealized teamwork process model, that complex problem solving teams pass through, and integrating the relevant teamwork skills for interdependently working teams into the model and combining it with the four kinds of team processes (transition, action, interpersonal, and learning processes), the paper demonstrates the importance of fulfilling team process demands for successful complex problem solving within teams. Therefore, results from a controlled team study within complex situations are presented. The study focused on factors that influence action processes, like coordination, such as emergent states like collective orientation, cohesion, and trust and that dynamically enable effective teamwork in complex situations. Before conducting the experiments, participants were divided by median split into two-person teams with either high ( n = 58) or low ( n = 58) collective orientation values. The study was conducted with the microworld C3Fire, simulating dynamic decision making, and acting in complex situations within a teamwork context. The microworld includes interdependent tasks such as extinguishing forest fires or protecting houses. Two firefighting scenarios had been developed, which takes a maximum of 15 min each. All teams worked on these two scenarios. Coordination within the team and the resulting team performance were calculated based on a log-file analysis. The results show that no relationships between trust and action processes and team performance exist. Likewise, no relationships were found for cohesion. Only collective orientation of team members positively influences team performance in complex environments mediated by action processes such as

  8. Complex Problem Solving in Teams: The Impact of Collective Orientation on Team Process Demands

    Directory of Open Access Journals (Sweden)

    Vera Hagemann

    2017-09-01

    Full Text Available Complex problem solving is challenging and a high-level cognitive process for individuals. When analyzing complex problem solving in teams, an additional, new dimension has to be considered, as teamwork processes increase the requirements already put on individual team members. After introducing an idealized teamwork process model, that complex problem solving teams pass through, and integrating the relevant teamwork skills for interdependently working teams into the model and combining it with the four kinds of team processes (transition, action, interpersonal, and learning processes, the paper demonstrates the importance of fulfilling team process demands for successful complex problem solving within teams. Therefore, results from a controlled team study within complex situations are presented. The study focused on factors that influence action processes, like coordination, such as emergent states like collective orientation, cohesion, and trust and that dynamically enable effective teamwork in complex situations. Before conducting the experiments, participants were divided by median split into two-person teams with either high (n = 58 or low (n = 58 collective orientation values. The study was conducted with the microworld C3Fire, simulating dynamic decision making, and acting in complex situations within a teamwork context. The microworld includes interdependent tasks such as extinguishing forest fires or protecting houses. Two firefighting scenarios had been developed, which takes a maximum of 15 min each. All teams worked on these two scenarios. Coordination within the team and the resulting team performance were calculated based on a log-file analysis. The results show that no relationships between trust and action processes and team performance exist. Likewise, no relationships were found for cohesion. Only collective orientation of team members positively influences team performance in complex environments mediated by action processes

  9. Teaching evidence-based medicine using a problem-oriented approach.

    Science.gov (United States)

    Hosny, Somaya; Ghaly, Mona S

    2014-04-01

    Faculty of Medicine, Suez Canal University is adopting an innovative curriculum. Evidence-based medicine (EBM) has been integrated into problem based learning (PBL) sessions as a responsive innovative paradigm for the practice and teaching of clinical medicine. To integrate EBM in the problem based sessions of the sixth-year students, and to assess students' and tutor satisfaction with this change. EBM training was conducted for sixth-year students (196) including four theoretical, and eight practical sessions. Sixteen EBM educational scenarios (problems) were formulated, according to sixth-year curriculum. Each problem was discussed in two sessions through steps of EBM, namely: formulating PICO questions, searching for and appraising evidence, applying the evidence to the clinical scenario and analysing the practice. Students and tutors satisfaction were evaluated using a 3-point ratings questionnaire. The majority of students and faculty expressed their satisfaction about integrating EBM with PBL and agreed that the problems were more stimulating. However, 33.6% of students indicated that available time was insufficient for searching literatures. Integrating EBM into PBL sessions tends to be more interesting and stimulating than traditional PBL sessions for final year students and helps them to practice and implement EBM in clinical context.

  10. A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Rui Zhang

    2011-01-01

    Full Text Available The job shop scheduling problem (JSSP is a notoriously difficult problem in combinatorial optimization. In terms of the objective function, most existing research has been focused on the makespan criterion. However, in contemporary manufacturing systems, due-date-related performances are more important because they are essential for maintaining a high service reputation. Therefore, in this study we aim at minimizing the total weighted tardiness in JSSP. Considering the high complexity, a hybrid differential evolution (DE algorithm is proposed for the problem. To enhance the overall search efficiency, a neighborhood property of the problem is discovered, and then a tree search procedure is designed and embedded into the DE framework. According to the extensive computational experiments, the proposed approach is efficient in solving the job shop scheduling problem with total weighted tardiness objective.

  11. PROBLEMS AND LIMITATIONS OF SATELLITE IMAGE ORIENTATION FOR DETERMINATION OF HEIGHT MODELS

    Directory of Open Access Journals (Sweden)

    K. Jacobsen

    2017-05-01

    Full Text Available The usual satellite image orientation is based on bias corrected rational polynomial coefficients (RPC. The RPC are describing the direct sensor orientation of the satellite images. The locations of the projection centres today are without problems, but an accuracy limit is caused by the attitudes. Very high resolution satellites today are very agile, able to change the pointed area over 200km within 10 to 11 seconds. The corresponding fast attitude acceleration of the satellite may cause a jitter which cannot be expressed by the third order RPC, even if it is recorded by the gyros. Only a correction of the image geometry may help, but usually this will not be done. The first indication of jitter problems is shown by systematic errors of the y-parallaxes (py for the intersection of corresponding points during the computation of ground coordinates. These y-parallaxes have a limited influence to the ground coordinates, but similar problems can be expected for the x-parallaxes, determining directly the object height. Systematic y-parallaxes are shown for Ziyuan-3 (ZY3, WorldView-2 (WV2, Pleiades, Cartosat-1, IKONOS and GeoEye. Some of them have clear jitter effects. In addition linear trends of py can be seen. Linear trends in py and tilts in of computed height models may be caused by limited accuracy of the attitude registration, but also by bias correction with affinity transformation. The bias correction is based on ground control points (GCPs. The accuracy of the GCPs usually does not cause some limitations but the identification of the GCPs in the images may be difficult. With 2-dimensional bias corrected RPC-orientation by affinity transformation tilts of the generated height models may be caused, but due to large affine image deformations some satellites, as Cartosat-1, have to be handled with bias correction by affinity transformation. Instead of a 2-dimensional RPC-orientation also a 3-dimensional orientation is possible, respecting the

  12. Problems and Limitations of Satellite Image Orientation for Determination of Height Models

    Science.gov (United States)

    Jacobsen, K.

    2017-05-01

    The usual satellite image orientation is based on bias corrected rational polynomial coefficients (RPC). The RPC are describing the direct sensor orientation of the satellite images. The locations of the projection centres today are without problems, but an accuracy limit is caused by the attitudes. Very high resolution satellites today are very agile, able to change the pointed area over 200km within 10 to 11 seconds. The corresponding fast attitude acceleration of the satellite may cause a jitter which cannot be expressed by the third order RPC, even if it is recorded by the gyros. Only a correction of the image geometry may help, but usually this will not be done. The first indication of jitter problems is shown by systematic errors of the y-parallaxes (py) for the intersection of corresponding points during the computation of ground coordinates. These y-parallaxes have a limited influence to the ground coordinates, but similar problems can be expected for the x-parallaxes, determining directly the object height. Systematic y-parallaxes are shown for Ziyuan-3 (ZY3), WorldView-2 (WV2), Pleiades, Cartosat-1, IKONOS and GeoEye. Some of them have clear jitter effects. In addition linear trends of py can be seen. Linear trends in py and tilts in of computed height models may be caused by limited accuracy of the attitude registration, but also by bias correction with affinity transformation. The bias correction is based on ground control points (GCPs). The accuracy of the GCPs usually does not cause some limitations but the identification of the GCPs in the images may be difficult. With 2-dimensional bias corrected RPC-orientation by affinity transformation tilts of the generated height models may be caused, but due to large affine image deformations some satellites, as Cartosat-1, have to be handled with bias correction by affinity transformation. Instead of a 2-dimensional RPC-orientation also a 3-dimensional orientation is possible, respecting the object height

  13. Solution verification, goal-oriented adaptive methods for stochastic advection–diffusion problems

    KAUST Repository

    Almeida, Regina C.

    2010-08-01

    A goal-oriented analysis of linear, stochastic advection-diffusion models is presented which provides both a method for solution verification as well as a basis for improving results through adaptation of both the mesh and the way random variables are approximated. A class of model problems with random coefficients and source terms is cast in a variational setting. Specific quantities of interest are specified which are also random variables. A stochastic adjoint problem associated with the quantities of interest is formulated and a posteriori error estimates are derived. These are used to guide an adaptive algorithm which adjusts the sparse probabilistic grid so as to control the approximation error. Numerical examples are given to demonstrate the methodology for a specific model problem. © 2010 Elsevier B.V.

  14. Solution verification, goal-oriented adaptive methods for stochastic advection–diffusion problems

    KAUST Repository

    Almeida, Regina C.; Oden, J. Tinsley

    2010-01-01

    A goal-oriented analysis of linear, stochastic advection-diffusion models is presented which provides both a method for solution verification as well as a basis for improving results through adaptation of both the mesh and the way random variables are approximated. A class of model problems with random coefficients and source terms is cast in a variational setting. Specific quantities of interest are specified which are also random variables. A stochastic adjoint problem associated with the quantities of interest is formulated and a posteriori error estimates are derived. These are used to guide an adaptive algorithm which adjusts the sparse probabilistic grid so as to control the approximation error. Numerical examples are given to demonstrate the methodology for a specific model problem. © 2010 Elsevier B.V.

  15. Mathematical programming models for solving in equal-sized facilities layout problems. A genetic search method

    International Nuclear Information System (INIS)

    Tavakkoli-Moghaddam, R.

    1999-01-01

    This paper present unequal-sized facilities layout solutions generated by a genetic search program. named Layout Design using a Genetic Algorithm) 9. The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computational results on test problems are reported as compared with layout solutions generated by the branch - and bound algorithm a hybrid method merging simulated annealing and local search techniques, and an optimization process of an enveloped block

  16. A hybrid adaptive large neighborhood search algorithm applied to a lot-sizing problem

    DEFF Research Database (Denmark)

    Muller, Laurent Flindt; Spoorendonk, Simon

    This paper presents a hybrid of a general heuristic framework that has been successfully applied to vehicle routing problems and a general purpose MIP solver. The framework uses local search and an adaptive procedure which choses between a set of large neighborhoods to be searched. A mixed integer...... of a solution and to investigate the feasibility of elements in such a neighborhood. The hybrid heuristic framework is applied to the multi-item capacitated lot sizing problem with dynamic lot sizes, where experiments have been conducted on a series of instances from the literature. On average the heuristic...

  17. Africa's search for communication technologies for education: a reflection on problems and prospects.

    Science.gov (United States)

    Ofori-ansa, K

    1983-09-01

    analysts have generally concluded that post-independence educational reforms in Africa failed to achieve thier aims. Some recommendations are offered with the objective of contributing to the ongoing international effort to search for more effective approaches in using communication technologies to support educational development in Africa. Technical assistance programs supporting educational use of modern communication technologies should be perceived in the context of international cooperation, with a 2-way flow, rather than in the context of a donor recipient relationship. Greater emphasis should be placed on thorough country by country assessment of educational needs and problems in order to provide an adequate basis for designing project objectives and project contents to satisfy specific needs. Needs assessment should be tempered with pragmatism and flexibility in approach. Training and orientation for foreign and local exports and increased local participation are among the recommendations.

  18. Psychology of development of moral reasoning: Problem-oriented overview of the field

    Directory of Open Access Journals (Sweden)

    Mirić Jovan

    2008-01-01

    Full Text Available First and foremost, this paper provides a short historical reminder of the emergence of the field of psychology of development of moral reasoning. In the second part of the paper, the author offers a problem-oriented overview of the field, that is, one possible classification of particular groups of problems for empirical research. This overview does not only point out to the problems that were more and that were less studied (e.g.. evaluative moral judgment and reasoning, distinguishing between moral and extra-moral rules and norms and to those that were relatively neglected (i.e. understanding moral situations, but also to the problems that psychologists did not even recognize as research problems. Such are the problems of development of moral concepts, meaning of moral words etc. Finally, the author also points out to the fact that this classification could be taken as one way to define the field, that is, the way to determine the boundaries of its subject of studying.

  19. Optimization of travel salesman problem using the ant colony system and Greedy search

    International Nuclear Information System (INIS)

    Esquivel E, J.; Ordonez A, A.; Ortiz S, J. J.

    2008-01-01

    In this paper we present some results obtained during the development of optimization systems that can be used to design refueling and patterns of control rods in a BWR. These systems use ant colonies and Greedy search. The first phase of this project is to be familiar with these optimization techniques applied to the problem of travel salesman problem (TSP). The utility of TSP study is that, like the refueling design and pattern design of control rods are problems of combinative optimization. Even, the similarity with the problem of the refueling design is remarkable. It is presented some results for the TSP with the 32 state capitals of Mexico country. (Author)

  20. Harmony search algorithm for solving combined heat and power economic dispatch problems

    Energy Technology Data Exchange (ETDEWEB)

    Khorram, Esmaile, E-mail: eskhor@aut.ac.i [Department of Applied Mathematics, Faculty of Mathematics and Computer Science, Amirkabir University of Technology, No. 424, Hafez Ave., 15914 Tehran (Iran, Islamic Republic of); Jaberipour, Majid, E-mail: Majid.Jaberipour@gmail.co [Department of Applied Mathematics, Faculty of Mathematics and Computer Science, Amirkabir University of Technology, No. 424, Hafez Ave., 15914 Tehran (Iran, Islamic Republic of)

    2011-02-15

    Economic dispatch (ED) is one of the key optimization problems in electric power system operation. The problem grows complex if one or more units produce both power and heat. Combined heat and power economic dispatch (CHPED) problem is a complicated problem that needs powerful methods to solve. This paper presents a harmony search (EDHS) algorithm to solve CHPED. Some standard examples are presented to demonstrate the effectiveness of this algorithm in obtaining the optimal solution. In all cases, the solutions obtained using EDHS algorithm are better than those obtained by other methods.

  1. 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.

  2. A solution to energy and environmental problems of electric power system using hybrid harmony search-random search optimization algorithm

    Directory of Open Access Journals (Sweden)

    Vikram Kumar Kamboj

    2016-04-01

    Full Text Available In recent years, global warming and carbon dioxide (CO2 emission reduction have become important issues in India, as CO2 emission levels are continuing to rise in accordance with the increased volume of Indian national energy consumption under the pressure of global warming, it is crucial for Indian government to impose the effective policy to promote CO2 emission reduction. Challenge of supplying the nation with high quality and reliable electrical energy at a reasonable cost, converted government policy into deregulation and restructuring environment. This research paper presents aims to presents an effective solution for energy and environmental problems of electric power using an efficient and powerful hybrid optimization algorithm: Hybrid Harmony search-random search algorithm. The proposed algorithm is tested for standard IEEE-14 bus, -30 bus and -56 bus system. The effectiveness of proposed hybrid algorithm is compared with others well known evolutionary, heuristics and meta-heuristics search algorithms. For multi-objective unit commitment, it is found that as there are conflicting relationship between cost and emission, if the performance in cost criterion is improved, performance in the emission is seen to deteriorate.

  3. The Problem-Oriented Project Work (PPL) Alternative in Self-Diected Higher Education

    DEFF Research Database (Denmark)

    Andersen, Anders Siig; Heilesen, Simon

    2015-01-01

    This chapter introduces an approach to higher education developed and practiced over four decades at Roskilde University in Denmark. Known as the Roskilde Model, the approach is characterized by (1) a special type of self-directed learning (SDL), named “problem-oriented project learning” (PPL); (2......) a way of organizing undergraduate education into broad interdisciplinary programs; and (3) an interdisciplinary profile where double-major graduate programs allow students to design their own academic and professional profiles. The chapter first explains similarities and differences between PPL and some...

  4. Visibility-Based Goal Oriented Metrics and Application to Navigation and Path Planning Problems

    Science.gov (United States)

    2017-12-14

    Oriented Metrics and Application to Navigation and Path Planning Problems Report Term: 0-Other Email : ytsai@math.utexas.edu Distribution Statement: 1...error bounds that we have obtained. Report Date: 06-Dec-2017 INVESTIGATOR(S): Phone Number: 5122327757 Principal: Y Name: Yen-Hsi Tsai Email ...w1 w2 ◆ and ~z = ✓ z1 z2 ◆ . Then we can write D0 h (PN (xi,j)) = Rp (R+⌘)2+h2 + 1 2h (µ2w1 µ2z1) 0 µ2w2µ3z2 2h 0 ! . It follows that the non

  5. Development of the electronic patient record system based on problem oriented system.

    Science.gov (United States)

    Uto, Yumiko; Iwaanakuchi, Takashi; Muranaga, Fuminori; Kumamoto, Ichiro

    2013-01-01

    In Japan, POS (problem oriented system) is recommended in the clinical guideline. Therefore, the records are mainly made by SOAP. We developed a system mainly with a function which enabled our staff members of all kinds of professions including doctors to enter the patients' clinical information as an identical record, regardless if they were outpatients or inpatients, and to observe the contents chronologically. This electric patient record system is called "e-kanja recording system". On this system, all staff members in the medical team can now share the same information. Moreover, the contents can be reviewed by colleagues; the quality of records has been improved as it is evaluated by the others.

  6. A Rule-Based Local Search Algorithm for General Shift Design Problems in Airport Ground Handling

    DEFF Research Database (Denmark)

    Clausen, Tommy

    We consider a generalized version of the shift design problem where shifts are created to cover a multiskilled demand and fit the parameters of the workforce. We present a collection of constraints and objectives for the generalized shift design problem. A local search solution framework with mul......We consider a generalized version of the shift design problem where shifts are created to cover a multiskilled demand and fit the parameters of the workforce. We present a collection of constraints and objectives for the generalized shift design problem. A local search solution framework...... with multiple neighborhoods and a loosely coupled rule engine based on simulated annealing is presented. Computational experiments on real-life data from various airport ground handling organization show the performance and flexibility of the proposed algorithm....

  7. A hybrid guided neighborhood search for the disjunctively constrained knapsack problem

    Directory of Open Access Journals (Sweden)

    Mhand Hifi

    2015-12-01

    Full Text Available In this paper, we investigate the use of a hybrid guided neighborhood search for solving the disjunctively constrained knapsack problem. The studied problem may be viewed as a combination of two NP-hard combinatorial optimization problems: the weighted-independent set and the classical binary knapsack. The proposed algorithm is a hybrid approach that combines both deterministic and random local searches. The deterministic local search is based on a descent method, where both building and exploring procedures are alternatively used for improving the solution at hand. In order to escape from a local optima, a random local search strategy is introduced which is based on a modified ant colony optimization system. During the search process, the ant colony optimization system tries to diversify and to enhance the solutions using some informations collected from the previous iterations. Finally, the proposed algorithm is computationally analyzed on a set of benchmark instances available in the literature. The provided results are compared to those realized by both the Cplex solver and a recent algorithm of the literature. The computational part shows that the obtained results improve most existing solution values.

  8. Search Problems in Mission Planning and Navigation of Autonomous Aircraft. M.S. Thesis

    Science.gov (United States)

    Krozel, James A.

    1988-01-01

    An architecture for the control of an autonomous aircraft is presented. The architecture is a hierarchical system representing an anthropomorphic breakdown of the control problem into planner, navigator, and pilot systems. The planner system determines high level global plans from overall mission objectives. This abstract mission planning is investigated by focusing on the Traveling Salesman Problem with variations on local and global constraints. Tree search techniques are applied including the breadth first, depth first, and best first algorithms. The minimum-column and row entries for the Traveling Salesman Problem cost matrix provides a powerful heuristic to guide these search techniques. Mission planning subgoals are directed from the planner to the navigator for planning routes in mountainous terrain with threats. Terrain/threat information is abstracted into a graph of possible paths for which graph searches are performed. It is shown that paths can be well represented by a search graph based on the Voronoi diagram of points representing the vertices of mountain boundaries. A comparison of Dijkstra's dynamic programming algorithm and the A* graph search algorithm from artificial intelligence/operations research is performed for several navigation path planning examples. These examples illustrate paths that minimize a combination of distance and exposure to threats. Finally, the pilot system synthesizes the flight trajectory by creating the control commands to fly the aircraft.

  9. GGRNA: an ultrafast, transcript-oriented search engine for genes and transcripts.

    Science.gov (United States)

    Naito, Yuki; Bono, Hidemasa

    2012-07-01

    GGRNA (http://GGRNA.dbcls.jp/) is a Google-like, ultrafast search engine for genes and transcripts. The web server accepts arbitrary words and phrases, such as gene names, IDs, gene descriptions, annotations of gene and even nucleotide/amino acid sequences through one simple search box, and quickly returns relevant RefSeq transcripts. A typical search takes just a few seconds, which dramatically enhances the usability of routine searching. In particular, GGRNA can search sequences as short as 10 nt or 4 amino acids, which cannot be handled easily by popular sequence analysis tools. Nucleotide sequences can be searched allowing up to three mismatches, or the query sequences may contain degenerate nucleotide codes (e.g. N, R, Y, S). Furthermore, Gene Ontology annotations, Enzyme Commission numbers and probe sequences of catalog microarrays are also incorporated into GGRNA, which may help users to conduct searches by various types of keywords. GGRNA web server will provide a simple and powerful interface for finding genes and transcripts for a wide range of users. All services at GGRNA are provided free of charge to all users.

  10. Searching spectrum points of difference initial-boundary value problems with using GAS

    International Nuclear Information System (INIS)

    Mazepa, N.E.

    1989-01-01

    A new algorithm for searching spectrum points is proposed. The difference schemes which approximate systems of linear differential equations of hyperbolic type with constant coefficients and in one space dimension are considered. For important class of practiclas problems this algorithm reduces the hard spectrum calculation problem to the polynomial equation solution. For complicated analytic manipulations connected with realization of this algorithm the computation algebraic system REDUCE is used. 28 refs

  11. Constraint Programming based Local Search for the Vehicle Routing Problem with Time Windows

    OpenAIRE

    Sala Reixach, Joan

    2012-01-01

    El projecte es centra en el "Vehicle Routing Problem with Time Windows". Explora i testeja un mètode basat en una formulació del problema en termes de programació de restriccions. Implementa un mètode de cerca local amb la capacitat de fer grans moviments anomenat "Large Neighbourhood Search".

  12. Bilayer Local Search Enhanced Particle Swarm Optimization for the Capacitated Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    A. K. M. Foysal Ahmed

    2018-03-01

    Full Text Available The classical capacitated vehicle routing problem (CVRP is a very popular combinatorial optimization problem in the field of logistics and supply chain management. Although CVRP has drawn interests of many researchers, no standard way has been established yet to obtain best known solutions for all the different problem sets. We propose an efficient algorithm Bilayer Local Search-based Particle Swarm Optimization (BLS-PSO along with a novel decoding method to solve CVRP. Decoding method is important to relate the encoded particle position to a feasible CVRP solution. In bilayer local search, one layer of local search is for the whole population in any iteration whereas another one is applied only on the pool of the best particles generated in different generations. Such searching strategies help the BLS-PSO to perform better than the existing proposals by obtaining best known solutions for most of the existing benchmark problems within very reasonable computational time. Computational results also show that the performance achieved by the proposed algorithm outperforms other PSO-based approaches.

  13. A Pareto archive floating search procedure for solving multi-objective flexible job shop scheduling problem

    Directory of Open Access Journals (Sweden)

    J. S. Sadaghiani

    2014-04-01

    Full Text Available Flexible job shop scheduling problem is a key factor of using efficiently in production systems. This paper attempts to simultaneously optimize three objectives including minimization of the make span, total workload and maximum workload of jobs. Since the multi objective flexible job shop scheduling problem is strongly NP-Hard, an integrated heuristic approach has been used to solve it. The proposed approach was based on a floating search procedure that has used some heuristic algorithms. Within floating search procedure utilize local heuristic algorithms; it makes the considered problem into two sections including assigning and sequencing sub problem. First of all search is done upon assignment space achieving an acceptable solution and then search would continue on sequencing space based on a heuristic algorithm. This paper has used a multi-objective approach for producing Pareto solution. Thus proposed approach was adapted on NSGA II algorithm and evaluated Pareto-archives. The elements and parameters of the proposed algorithms were adjusted upon preliminary experiments. Finally, computational results were used to analyze efficiency of the proposed algorithm and this results showed that the proposed algorithm capable to produce efficient solutions.

  14. Variable Neighbourhood Search and Mathematical Programming for Just-in-Time Job-Shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Sunxin Wang

    2014-01-01

    Full Text Available This paper presents a combination of variable neighbourhood search and mathematical programming to minimize the sum of earliness and tardiness penalty costs of all operations for just-in-time job-shop scheduling problem (JITJSSP. Unlike classical E/T scheduling problem with each job having its earliness or tardiness penalty cost, each operation in this paper has its earliness and tardiness penalties, which are paid if the operation is completed before or after its due date. Our hybrid algorithm combines (i a variable neighbourhood search procedure to explore the huge feasible solution spaces efficiently by alternating the swap and insertion neighbourhood structures and (ii a mathematical programming model to optimize the completion times of the operations for a given solution in each iteration procedure. Additionally, a threshold accepting mechanism is proposed to diversify the local search of variable neighbourhood search. Computational results on the 72 benchmark instances show that our algorithm can obtain the best known solution for 40 problems, and the best known solutions for 33 problems are updated.

  15. ONTOLOGY OF COMPUTATIONAL EXPERIMENT ORGANIZATION IN PROBLEMS OF SEARCHING AND SORTING

    Directory of Open Access Journals (Sweden)

    A. Spivakovsky

    2011-05-01

    Full Text Available Ontologies are a key technology of semantic processing of knowledge. We examine a methodology of ontology’s usage for the organization of computational experiment in problems of searching and sorting in studies of the course "Basics of algorithms and programming".

  16. Addressing special structure in the relevance feedback learning problem through aspect-based image search

    NARCIS (Netherlands)

    M.J. Huiskes (Mark)

    2004-01-01

    textabstractIn this paper we focus on a number of issues regarding special structure in the relevance feedback learning problem, most notably the effects of image selection based on partial relevance on the clustering behavior of examples. We propose a simple scheme, aspect-based image search, which

  17. Psychoeducational Services for Children and Youth in the Orient: Current Status, Problems, and some Remedies.

    Science.gov (United States)

    Oakland, T; Hu, S

    1989-01-01

    Utilizing information obtained through an international survey and existing literature, patterns in the practices, research, and preparation of professionals who deliver psychoeducational services to children and youth in six Oriental countries (i.e., China, Hong Kong(1), Japan, the Philippines, Taiwan, and Thailand) are described. Services are provided by many professional groups. While few formal programs exist for the preparation of psychologists to work in schools, those providing such services have at least a bachelor's degree. Services commonly provided include assessment, vocational and educational guidance, counseling, parent education, and teaching. School psychological services generally are not governed by legislation or professional standards. Research tends to be applied and directed toward the construction and translations of tests and toward the needs of the mentally retarded, learning disabled, and behaviorally disordered. Ten major problems creating barriers for the delivery of psychoeducational services are identified. Three suggestions to help resolve these problems are offered.

  18. Web-Based Undergraduate Chemistry Problem-Solving: The Interplay of Task Performance, Domain Knowledge and Web-Searching Strategies

    Science.gov (United States)

    She, Hsiao-Ching; Cheng, Meng-Tzu; Li, Ta-Wei; Wang, Chia-Yu; Chiu, Hsin-Tien; Lee, Pei-Zon; Chou, Wen-Chi; Chuang, Ming-Hua

    2012-01-01

    This study investigates the effect of Web-based Chemistry Problem-Solving, with the attributes of Web-searching and problem-solving scaffolds, on undergraduate students' problem-solving task performance. In addition, the nature and extent of Web-searching strategies students used and its correlation with task performance and domain knowledge also…

  19. Using Problem-solving Therapy to Improve Problem-solving Orientation, Problem-solving Skills and Quality of Life in Older Hemodialysis Patients.

    Science.gov (United States)

    Erdley-Kass, Shiloh D; Kass, Darrin S; Gellis, Zvi D; Bogner, Hillary A; Berger, Andrea; Perkins, Robert M

    2017-08-24

    To determine the effectiveness of Problem-Solving Therapy (PST) in older hemodialysis (HD) patients by assessing changes in health-related quality of life and problem-solving skills. 33 HD patients in an outpatient hemodialysis center without active medical and psychiatric illness were enrolled. The intervention group (n = 15) received PST from a licensed social worker for 6 weeks, whereas the control group (n = 18) received usual care treatment. In comparison to the control group, patients receiving PST intervention reported improved perceptions of mental health, were more likely to view their problems with a positive orientation and were more likely to use functional problem-solving methods. Furthermore, this group was also more likely to view their overall health, activity limits, social activities and ability to accomplish desired tasks with a more positive mindset. The results demonstrate that PST may positively impact mental health components of quality of life and problem-solving coping among older HD patients. PST is an effective, efficient, and easy to implement intervention that can benefit problem-solving abilities and mental health-related quality of life in older HD patients. In turn, this will help patients manage their daily living activities related to their medical condition and reduce daily stressors.

  20. A GPU Implementation of Local Search Operators for Symmetric Travelling Salesman Problem

    Directory of Open Access Journals (Sweden)

    Juraj Fosin

    2013-06-01

    Full Text Available The Travelling Salesman Problem (TSP is one of the most studied combinatorial optimization problem which is significant in many practical applications in transportation problems. The TSP problem is NP-hard problem and requires large computation power to be solved by the exact algorithms. In the past few years, fast development of general-purpose Graphics Processing Units (GPUs has brought huge improvement in decreasing the applications’ execution time. In this paper, we implement 2-opt and 3-opt local search operators for solving the TSP on the GPU using CUDA. The novelty presented in this paper is a new parallel iterated local search approach with 2-opt and 3-opt operators for symmetric TSP, optimized for the execution on GPUs. With our implementation large TSP problems (up to 85,900 cities can be solved using the GPU. We will show that our GPU implementation can be up to 20x faster without losing quality for all TSPlib problems as well as for our CRO TSP problem.

  1. Ant colony system (ACS with hybrid local search to solve vehicle routing problems

    Directory of Open Access Journals (Sweden)

    Suphan Sodsoon

    2016-02-01

    Full Text Available This research applied an Ant Colony System algorithm with a Hybrid Local Search to solve Vehicle Routing Problems (VRP from a single depot when the customers’ requirements are known. VRP is an NP-hard optimization problem and has usually been successfully solved optimum by heuristics. A fleet of vehicles of a specific capacity are used to serve a number of customers at minimum cost, without violating the constraints of vehicle capacity. There are meta-heuristic approaches to solve these problems, such as Simulated Annealing, Genetic Algorithm, Tabu Search and the Ant Colony System algorithm. In this case a hybrid local search was used (Cross-Exchange, Or-Opt and 2-Opt algorithm with an Ant Colony System algorithm. The Experimental Design was tested on 7 various problems from the data set online in the OR-Library. There are five different problems in which customers are randomly distributed with the depot in an approximately central location. The customers were grouped into clusters. The results are evaluated in terms of optimal routes using optimal distances. The experimental results are compared with those obtained from meta-heuristics and they show that the proposed method outperforms six meta-heuristics in the literature.

  2. Generalized Pattern Search methods for a class of nonsmooth optimization problems with structure

    Science.gov (United States)

    Bogani, C.; Gasparo, M. G.; Papini, A.

    2009-07-01

    We propose a Generalized Pattern Search (GPS) method to solve a class of nonsmooth minimization problems, where the set of nondifferentiability is included in the union of known hyperplanes and, therefore, is highly structured. Both unconstrained and linearly constrained problems are considered. At each iteration the set of poll directions is enforced to conform to the geometry of both the nondifferentiability set and the boundary of the feasible region, near the current iterate. This is the key issue to guarantee the convergence of certain subsequences of iterates to points which satisfy first-order optimality conditions. Numerical experiments on some classical problems validate the method.

  3. A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates

    Directory of Open Access Journals (Sweden)

    Tao Ren

    2015-01-01

    Full Text Available This paper discusses the flow shop scheduling problem to minimize the makespan with release dates. By resequencing the jobs, a modified heuristic algorithm is obtained for handling large-sized problems. Moreover, based on some properties, a local search scheme is provided to improve the heuristic to gain high-quality solution for moderate-sized problems. A sequence-independent lower bound is presented to evaluate the performance of the algorithms. A series of simulation results demonstrate the effectiveness of the proposed algorithms.

  4. Heat Transfer Search Algorithm for Non-convex Economic Dispatch Problems

    Science.gov (United States)

    Hazra, Abhik; Das, Saborni; Basu, Mousumi

    2018-03-01

    This paper presents Heat Transfer Search (HTS) algorithm for the non-linear economic dispatch problem. HTS algorithm is based on the law of thermodynamics and heat transfer. The proficiency of the suggested technique has been disclosed on three dissimilar complicated economic dispatch problems with valve point effect; prohibited operating zone; and multiple fuels with valve point effect. Test results acquired from the suggested technique for the economic dispatch problem have been fitted to that acquired from other stated evolutionary techniques. It has been observed that the suggested HTS carry out superior solutions.

  5. Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

    Directory of Open Access Journals (Sweden)

    Wenming Cheng

    2012-01-01

    Full Text Available In many real scheduling environments, a job processed later needs longer time than the same job when it starts earlier. This phenomenon is known as scheduling with deteriorating jobs to many industrial applications. In this paper, we study a scheduling problem of minimizing the total completion time on identical parallel machines where the processing time of a job is a step function of its starting time and a deteriorating date that is individual to all jobs. Firstly, a mixed integer programming model is presented for the problem. And then, a modified weight-combination search algorithm and a variable neighborhood search are employed to yield optimal or near-optimal schedule. To evaluate the performance of the proposed algorithms, computational experiments are performed on randomly generated test instances. Finally, computational results show that the proposed approaches obtain near-optimal solutions in a reasonable computational time even for large-sized problems.

  6. An Adaptive Large Neighborhood Search Algorithm for the Resource-constrained Project Scheduling Problem

    DEFF Research Database (Denmark)

    Muller, Laurent Flindt

    2009-01-01

    We present an application of an Adaptive Large Neighborhood Search (ALNS) algorithm to the Resource-constrained Project Scheduling Problem (RCPSP). The ALNS framework was first proposed by Pisinger and Røpke [19] and can be described as a large neighborhood search algorithm with an adaptive layer......, where a set of destroy/repair neighborhoods compete to modify the current solution in each iteration of the algorithm. Experiments are performed on the wellknown J30, J60 and J120 benchmark instances, which show that the proposed algorithm is competitive and confirms the strength of the ALNS framework...

  7. A trust-based sensor allocation algorithm in cooperative space search problems

    Science.gov (United States)

    Shen, Dan; Chen, Genshe; Pham, Khanh; Blasch, Erik

    2011-06-01

    Sensor allocation is an important and challenging problem within the field of multi-agent systems. The sensor allocation problem involves deciding how to assign a number of targets or cells to a set of agents according to some allocation protocol. Generally, in order to make efficient allocations, we need to design mechanisms that consider both the task performers' costs for the service and the associated probability of success (POS). In our problem, the costs are the used sensor resource, and the POS is the target tracking performance. Usually, POS may be perceived differently by different agents because they typically have different standards or means of evaluating the performance of their counterparts (other sensors in the search and tracking problem). Given this, we turn to the notion of trust to capture such subjective perceptions. In our approach, we develop a trust model to construct a novel mechanism that motivates sensor agents to limit their greediness or selfishness. Then we model the sensor allocation optimization problem with trust-in-loop negotiation game and solve it using a sub-game perfect equilibrium. Numerical simulations are performed to demonstrate the trust-based sensor allocation algorithm in cooperative space situation awareness (SSA) search problems.

  8. Modified Cuckoo Search Algorithm for Solving Nonconvex Economic Load Dispatch Problems

    Directory of Open Access Journals (Sweden)

    Thang Trung Nguyen

    2016-01-01

    Full Text Available This paper presents the application of modified cuckoo search algorithm (MCSA for solving economic load dispatch (ELD problems. The MCSA method is developed to improve the search ability and solution quality of the conventional CSA method. In the MCSA, the evaluation of eggs has divided the initial eggs into two groups, the top egg group with good quality and the abandoned group with worse quality. Moreover, the value of the updated step size in MCSA is adapted as generating a new solution for the abandoned group and the top group via the Levy flights so that a large zone is searched at the beginning and a local zone is foraged as the maximum number of iterations is nearly reached. The MCSA method has been tested on different systems with different characteristics of thermal units and constraints. The result comparison with other methods in the literature has indicated that the MCSA method can be a powerful method for solving the ELD.

  9. Three hybridization models based on local search scheme for job shop scheduling problem

    Science.gov (United States)

    Balbi Fraga, Tatiana

    2015-05-01

    This work presents three different hybridization models based on the general schema of Local Search Heuristics, named Hybrid Successive Application, Hybrid Neighborhood, and Hybrid Improved Neighborhood. Despite similar approaches might have already been presented in the literature in other contexts, in this work these models are applied to analyzes the solution of the job shop scheduling problem, with the heuristics Taboo Search and Particle Swarm Optimization. Besides, we investigate some aspects that must be considered in order to achieve better solutions than those obtained by the original heuristics. The results demonstrate that the algorithms derived from these three hybrid models are more robust than the original algorithms and able to get better results than those found by the single Taboo Search.

  10. Applying Particle Swarm Optimization for Solving Team Orienteering Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    The Jin Ai

    2014-01-01

    Full Text Available The Team Orienteering Problem With Time Windows (TOPTW is a transportation problem case that have a set of vertices with a score, service time, and the time windows, start and final at a depot location. A number of paths are constructed to maximize the total collected score by the vertices which is visited. Each vertice can be visited only once and the visit can only start during the  time window of vertices. This paper proposes a Particle Swarm Optimization algorithm for solving the TOPTW, by defining a specific particle for representing the solution of TOPTW within the PSO algorithm and two alternatives, called PSO_TOPTW1 and PSO_TOPTW2, for translating the particle position to form the routes of the path. The performance of the proposed PSO algorithm is evaluated through some benchmark data problem available in the literature. The computational results show that the proposed PSO is able to produce sufficiently good TOPTW solutions that are comparable with corresponding solutions from other existing methods for solving the TOPTW.

  11. Efficient Metaheuristics for the Mixed Team Orienteering Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Damianos Gavalas

    2016-01-01

    Full Text Available Given a graph whose nodes and edges are associated with a profit, a visiting (or traversing time and an admittance time window, the Mixed Team Orienteering Problem with Time Windows (MTOPTW seeks for a specific number of walks spanning a subset of nodes and edges of the graph so as to maximize the overall collected profit. The visit of the included nodes and edges should take place within their respective time window and the overall duration of each walk should be below a certain threshold. In this paper we introduce the MTOPTW, which can be used for modeling a realistic variant of the Tourist Trip Design Problem where the objective is the derivation of near-optimal multiple-day itineraries for tourists visiting a destination which features several points of interest (POIs and scenic routes. Since the MTOPTW is a NP-hard problem, we propose the first metaheuristic approaches to tackle it. The effectiveness of our algorithms is validated through a number of experiments on POI and scenic route sets compiled from the city of Athens (Greece.

  12. Alcohol Demand, Future Orientation, and Craving Mediate the Relation Between Depressive and Stress Symptoms and Alcohol Problems.

    Science.gov (United States)

    Soltis, Kathryn E; McDevitt-Murphy, Meghan E; Murphy, James G

    2017-06-01

    Elevated depression and stress have been linked to greater levels of alcohol problems among young adults even after taking into account drinking level. This study attempts to elucidate variables that might mediate the relation between symptoms of depression and stress and alcohol problems, including alcohol demand, future time orientation, and craving. Participants were 393 undergraduates (60.8% female, 78.9% White/Caucasian) who reported at least 2 binge-drinking episodes (4/5+ drinks for women/men, respectively) in the previous month. Participants completed self-report measures of stress and depression, alcohol demand, future time orientation, craving, and alcohol problems. In separate mediation models that accounted for gender, race, and weekly alcohol consumption, future orientation and craving significantly mediated the relation between depressive symptoms and alcohol problems. Alcohol demand, future orientation, and craving significantly mediated the relation between stress symptoms and alcohol problems. Heavy-drinking young adults who experience stress or depression are likely to experience alcohol problems, and this is due in part to elevations in craving and alcohol demand, and less sensitivity to future outcomes. Interventions targeting alcohol misuse in young adults with elevated levels of depression and stress should attempt to increase future orientation and decrease craving and alcohol reward value. Copyright © 2017 by the Research Society on Alcoholism.

  13. Problem-Oriented Simulation Packages and Computational Infrastructure for Numerical Studies of Powerful Gyrotrons

    International Nuclear Information System (INIS)

    Damyanova, M; Sabchevski, S; Vasileva, E; Balabanova, E; Zhelyazkov, I; Dankov, P; Malinov, P

    2016-01-01

    Powerful gyrotrons are necessary as sources of strong microwaves for electron cyclotron resonance heating (ECRH) and electron cyclotron current drive (ECCD) of magnetically confined plasmas in various reactors (most notably ITER) for controlled thermonuclear fusion. Adequate physical models and efficient problem-oriented software packages are essential tools for numerical studies, analysis, optimization and computer-aided design (CAD) of such high-performance gyrotrons operating in a CW mode and delivering output power of the order of 1-2 MW. In this report we present the current status of our simulation tools (physical models, numerical codes, pre- and post-processing programs, etc.) as well as the computational infrastructure on which they are being developed, maintained and executed. (paper)

  14. Transients in low pressure pumping circuits: a language oriented for the problem

    International Nuclear Information System (INIS)

    De Bernardinis, B.; Siccardi, F.

    1977-01-01

    Following a previous work (Vallombrosa 1974) a specialized language was developed for transients in low pressure pumping circuits, when the liquid column separation phenomenon may happen or is to be avoided. The first generation of the programming code is given. Numerical schemes go beyond the usual characteristic integration techniques now available and make it possible to atrack the solution of problems in which on the one hand, the differential equations are nonlinear on account of the variations of the celerity with pressure, and on the other, the pressure of a dispersed gaseous phase in the liquid influences the energetic dissipation mechanisms. The oriented language allows the simulation of the main constituents of the circuits, pumping stations, reservoirs, air tanks, piezometric wells, condensers, variable resistances, conduit junctions, both during normal functioning and in cavitation conditions. Special control instructions on the programming code allow such a simulation language to be easily employed even by people not specifically competent in computer progr

  15. A Bayesian network approach to the database search problem in criminal proceedings

    Science.gov (United States)

    2012-01-01

    Background The ‘database search problem’, that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity. Methods As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population. Results This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches. Conclusions The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions

  16. Socio-Demographic and Practice-Oriented Factors Related to Proficiency in Problem Solving: A Lifelong Learning Perspective

    Science.gov (United States)

    Desjardins, Richard; Ederer, Peer

    2015-01-01

    This article explores the relative importance of different socio-demographic and practice-oriented factors that are related to proficiency in problem solving in technology-rich environments (PSTREs) and by extension may be related to complex problem solving (CPS). The empirical analysis focuses on the proficiency measurements of PSTRE made…

  17. The Implementation and Evaluation of a Project-Oriented Problem-Based Learning Module in a First Year Engineering Programme

    Science.gov (United States)

    McLoone, Seamus C.; Lawlor, Bob J.; Meehan, Andrew R.

    2016-01-01

    This paper describes how a circuits-based project-oriented problem-based learning educational model was integrated into the first year of a Bachelor of Engineering in Electronic Engineering programme at Maynooth University, Ireland. While many variations of problem based learning exist, the presented model is closely aligned with the model used in…

  18. A New Improved Quantum Evolution Algorithm with Local Search Procedure for Capacitated Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Ligang Cui

    2013-01-01

    Full Text Available The capacitated vehicle routing problem (CVRP is the most classical vehicle routing problem (VRP; many solution techniques are proposed to find its better answer. In this paper, a new improved quantum evolution algorithm (IQEA with a mixed local search procedure is proposed for solving CVRPs. First, an IQEA with a double chain quantum chromosome, new quantum rotation schemes, and self-adaptive quantum Not gate is constructed to initialize and generate feasible solutions. Then, to further strengthen IQEA's searching ability, three local search procedures 1-1 exchange, 1-0 exchange, and 2-OPT, are adopted. Experiments on a small case have been conducted to analyze the sensitivity of main parameters and compare the performances of the IQEA with different local search strategies. Together with results from the testing of CVRP benchmarks, the superiorities of the proposed algorithm over the PSO, SR-1, and SR-2 have been demonstrated. At last, a profound analysis of the experimental results is presented and some suggestions on future researches are given.

  19. Iterated Local Search Algorithm with Strategic Oscillation for School Bus Routing Problem with Bus Stop Selection

    Directory of Open Access Journals (Sweden)

    Mohammad Saied Fallah Niasar

    2017-02-01

    Full Text Available he school bus routing problem (SBRP represents a variant of the well-known vehicle routing problem. The main goal of this study is to pick up students allocated to some bus stops and generate routes, including the selected stops, in order to carry students to school. In this paper, we have proposed a simple but effective metaheuristic approach that employs two features: first, it utilizes large neighborhood structures for a deeper exploration of the search space; second, the proposed heuristic executes an efficient transition between the feasible and infeasible portions of the search space. Exploration of the infeasible area is controlled by a dynamic penalty function to convert the unfeasible solution into a feasible one. Two metaheuristics, called N-ILS (a variant of the Nearest Neighbourhood with Iterated Local Search algorithm and I-ILS (a variant of Insertion with Iterated Local Search algorithm are proposed to solve SBRP. Our experimental procedure is based on the two data sets. The results show that N-ILS is able to obtain better solutions in shorter computing times. Additionally, N-ILS appears to be very competitive in comparison with the best existing metaheuristics suggested for SBRP

  20. Sexual Orientation-Related Differences in Virtual Spatial Navigation and Spatial Search Strategies.

    Science.gov (United States)

    Rahman, Qazi; Sharp, Jonathan; McVeigh, Meadhbh; Ho, Man-Ling

    2017-07-01

    Spatial abilities are generally hypothesized to differ between men and women, and people with different sexual orientations. According to the cross-sex shift hypothesis, gay men are hypothesized to perform in the direction of heterosexual women and lesbian women in the direction of heterosexual men on cognitive tests. This study investigated sexual orientation differences in spatial navigation and strategy during a virtual Morris water maze task (VMWM). Forty-four heterosexual men, 43 heterosexual women, 39 gay men, and 34 lesbian/bisexual women (aged 18-54 years) navigated a desktop VMWM and completed measures of intelligence, handedness, and childhood gender nonconformity (CGN). We quantified spatial learning (hidden platform trials), probe trial performance, and cued navigation (visible platform trials). Spatial strategies during hidden and probe trials were classified into visual scanning, landmark use, thigmotaxis/circling, and enfilading. In general, heterosexual men scored better than women and gay men on some spatial learning and probe trial measures and used more visual scan strategies. However, some differences disappeared after controlling for age and estimated IQ (e.g., in visual scanning heterosexual men differed from women but not gay men). Heterosexual women did not differ from lesbian/bisexual women. For both sexes, visual scanning predicted probe trial performance. More feminine CGN scores were associated with lower performance among men and greater performance among women on specific spatial learning or probe trial measures. These results provide mixed evidence for the cross-sex shift hypothesis of sexual orientation-related differences in spatial cognition.

  1. Greenland, Arctic Orientalism and the search for definitions of a contemporary postcolonial geography

    DEFF Research Database (Denmark)

    Jensen, Lars

    2015-01-01

    This article begins by discussing the applicability of Orientalism in the Arctic where it was first applied by Ann Fienup-Riordan in her work in the 1990s in relation to Inuit representation in American cinema/documentary. The article moves on to consider more broadly approaches to the Arctic...... what postcolonial sensibilities can be articulated through an analysis of the three films with a particular emphasis on the negotiation of Greenlandic, Greenlandic-Danish and Danish identities. Reading Greenland through a postcolonial lens as manifested in the Greenlandic space the films grant returns...

  2. A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

    DEFF Research Database (Denmark)

    Wen, Min; Krapper, Emil; Larsen, Jesper

    2011-01-01

    in their fresh meat supply logistics system. The problem consists of a 1‐week planning horizon, heterogeneous vehicles, and drivers with predefined work regulations. These regulations include, among other things, predefined workdays, fixed starting time, maximum weekly working duration, and a break rule......The world's second largest producer of pork, Danish Crown, also provides a fresh meat supply logistics system within Denmark. This is used by the majority of supermarkets in Denmark. This article addresses an integrated vehicle routing and driver scheduling problem arising at Danish Crown....... The objective is to minimize the total delivery cost that is a weighted sum of two kinds of delivery costs. A multilevel variable neighborhood search heuristic is proposed for the problem. In a preprocessing step, the problem size is reduced through an aggregation procedure. Thereafter, the aggregated weekly...

  3. A meta-heuristic method for solving scheduling problem: crow search algorithm

    Science.gov (United States)

    Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi

    2018-04-01

    Scheduling is one of the most important processes in an industry both in manufacturingand services. The scheduling process is the process of selecting resources to perform an operation on tasks. Resources can be machines, peoples, tasks, jobs or operations.. The selection of optimum sequence of jobs from a permutation is an essential issue in every research in scheduling problem. Optimum sequence becomes optimum solution to resolve scheduling problem. Scheduling problem becomes NP-hard problem since the number of job in the sequence is more than normal number can be processed by exact algorithm. In order to obtain optimum results, it needs a method with capability to solve complex scheduling problems in an acceptable time. Meta-heuristic is a method usually used to solve scheduling problem. The recently published method called Crow Search Algorithm (CSA) is adopted in this research to solve scheduling problem. CSA is an evolutionary meta-heuristic method which is based on the behavior in flocks of crow. The calculation result of CSA for solving scheduling problem is compared with other algorithms. From the comparison, it is found that CSA has better performance in term of optimum solution and time calculation than other algorithms.

  4. Parallel Object-Oriented Computation Applied to a Finite Element Problem

    Directory of Open Access Journals (Sweden)

    Jon B. Weissman

    1993-01-01

    Full Text Available The conventional wisdom in the scientific computing community is that the best way to solve large-scale numerically intensive scientific problems on today's parallel MIMD computers is to use Fortran or C programmed in a data-parallel style using low-level message-passing primitives. This approach inevitably leads to nonportable codes and extensive development time, and restricts parallel programming to the domain of the expert programmer. We believe that these problems are not inherent to parallel computing but are the result of the programming tools used. We will show that comparable performance can be achieved with little effort if better tools that present higher level abstractions are used. The vehicle for our demonstration is a 2D electromagnetic finite element scattering code we have implemented in Mentat, an object-oriented parallel processing system. We briefly describe the application. Mentat, the implementation, and present performance results for both a Mentat and a hand-coded parallel Fortran version.

  5. Does despotic behavior or food search explain the occurrence of problem brown bears in Europe?

    Science.gov (United States)

    Elfström, Marcus; Zedrosser, Andreas; Jerina, Klemen; Støen, Ole-Gunnar; Kindberg, Jonas; Budic, Lara; Jonozovič, Marko; Swenson, Jon E

    2014-01-01

    Bears foraging near human developments are often presumed to be responding to food shortage, but this explanation ignores social factors, in particular despotism in bears. We analyzed the age distribution and body condition index (BCI) of shot brown bears in relation to densities of bears and people, and whether the shot bears were killed by managers (i.e., problem bears; n = 149), in self-defense (n = 51), or were hunter-killed nonproblem bears (n = 1,896) during 1990–2010. We compared patterns between areas with (Slovenia) and without supplemental feeding (Sweden) of bears relative to 2 hypotheses. The food-search/food-competition hypothesis predicts that problem bears should have a higher BCI (e.g., exploiting easily accessible and/or nutritious human-derived foods) or lower BCI (e.g., because of food shortage) than nonproblem bears, that BCI and human density should have a positive correlation, and problem bear occurrence and seasonal mean BCI of nonproblem bears should have a negative correlation (i.e., more problem bears during years of low food availability). Food competition among bears additionally predicts an inverse relationship between BCI and bear density. The safety-search/naivety hypothesis (i.e., avoiding other bears or lack of human experience) predicts no relationship between BCI and human density, provided no dietary differences due to spatiotemporal habitat use among bears, no relationship between problem bear occurrence and seasonal mean BCI of nonproblem bears, and does not necessarily predict a difference between BCI for problem/nonproblem bears. If food competition or predation avoidance explained bear occurrence near settlements, we predicted younger problem than nonproblem bears and a negative correlation between age and human density. However, if only food search explained bear occurrence near settlements, we predicted no relation between age and problem or nonproblem bear status, or between age and human density. We found

  6. Tabu search for the redundancy allocation problem of homogenous series-parallel multi-state systems

    International Nuclear Information System (INIS)

    Ouzineb, Mohamed; Nourelfath, Mustapha; Gendreau, Michel

    2008-01-01

    This paper develops an efficient tabu search (TS) heuristic to solve the redundancy allocation problem for multi-state series-parallel systems. The system has a range of performance levels from perfect functioning to complete failure. Identical redundant elements are included in order to achieve a desirable level of availability. The elements of the system are characterized by their cost, performance and availability. These elements are chosen from a list of products available in the market. System availability is defined as the ability to satisfy consumer demand, which is represented as a piecewise cumulative load curve. A universal generating function technique is applied to evaluate system availability. The proposed TS heuristic determines the minimal cost system configuration under availability constraints. An originality of our approach is that it proceeds by dividing the search space into a set of disjoint subsets, and then by applying TS to each subset. The design problem, solved in this study, has been previously analyzed using genetic algorithms (GAs). Numerical results for the test problems from previous research are reported, and larger test problems are randomly generated. Comparisons show that the proposed TS out-performs GA solutions, in terms of both the solution quality and the execution time

  7. Discrete harmony search algorithm for scheduling and rescheduling the reprocessing problems in remanufacturing: a case study

    Science.gov (United States)

    Gao, Kaizhou; Wang, Ling; Luo, Jianping; Jiang, Hua; Sadollah, Ali; Pan, Quanke

    2018-06-01

    In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and tardiness (E/T). These two objectives are also considered together as a bi-objective problem. Computational optimization results and comparisons show that the proposed DHS is able to solve the scheduling and rescheduling problems effectively and productively. Using the proposed approach, satisfactory optimization results can be achieved for scheduling and rescheduling on a real-life shop floor.

  8. A HYBRID HOPFIELD NEURAL NETWORK AND TABU SEARCH ALGORITHM TO SOLVE ROUTING PROBLEM IN COMMUNICATION NETWORK

    Directory of Open Access Journals (Sweden)

    MANAR Y. KASHMOLA

    2012-06-01

    Full Text Available The development of hybrid algorithms for solving complex optimization problems focuses on enhancing the strengths and compensating for the weakness of two or more complementary approaches. The goal is to intelligently combine the key elements of these approaches to find superior solutions to solve optimization problems. Optimal routing in communication network is considering a complex optimization problem. In this paper we propose a hybrid Hopfield Neural Network (HNN and Tabu Search (TS algorithm, this algorithm called hybrid HNN-TS algorithm. The paradigm of this hybridization is embedded. We embed the short-term memory and tabu restriction features from TS algorithm in the HNN model. The short-term memory and tabu restriction control the neuron selection process in the HNN model in order to get around the local minima problem and find an optimal solution using the HNN model to solve complex optimization problem. The proposed algorithm is intended to find the optimal path for packet transmission in the network which is fills in the field of routing problem. The optimal path that will be selected is depending on 4-tuples (delay, cost, reliability and capacity. Test results show that the propose algorithm can find path with optimal cost and a reasonable number of iterations. It also shows that the complexity of the network model won’t be a problem since the neuron selection is done heuristically.

  9. Scalable Parallel Distributed Coprocessor System for Graph Searching Problems with Massive Data

    Directory of Open Access Journals (Sweden)

    Wanrong Huang

    2017-01-01

    Full Text Available The Internet applications, such as network searching, electronic commerce, and modern medical applications, produce and process massive data. Considerable data parallelism exists in computation processes of data-intensive applications. A traversal algorithm, breadth-first search (BFS, is fundamental in many graph processing applications and metrics when a graph grows in scale. A variety of scientific programming methods have been proposed for accelerating and parallelizing BFS because of the poor temporal and spatial locality caused by inherent irregular memory access patterns. However, new parallel hardware could provide better improvement for scientific methods. To address small-world graph problems, we propose a scalable and novel field-programmable gate array-based heterogeneous multicore system for scientific programming. The core is multithread for streaming processing. And the communication network InfiniBand is adopted for scalability. We design a binary search algorithm to address mapping to unify all processor addresses. Within the limits permitted by the Graph500 test bench after 1D parallel hybrid BFS algorithm testing, our 8-core and 8-thread-per-core system achieved superior performance and efficiency compared with the prior work under the same degree of parallelism. Our system is efficient not as a special acceleration unit but as a processor platform that deals with graph searching applications.

  10. An Improved Cuckoo Search for a Patient Transportation Problem with Consideration of Reducing Transport Emissions

    Directory of Open Access Journals (Sweden)

    Liyang Xiao

    2018-03-01

    Full Text Available Many government agencies and business organizations have realized that it is necessary to consider not only the economic cost but also the road transport emissions when they determine the transport policies and operations. In this study, a patient transportation problem with the aim of reducing transport emissions has been formulated by implementing CVRP model. In order to determine the routes of patient transportation with optimized emissions for targeted hospital, an improved Cuckoo Search (ICS algorithm is proposed. In this study, a ‘split’ procedure has been implemented to simplify the individual’s representation. A new category of cuckoos has been introduced to improve the ICS’s search ability. Two heuristics have been applied to improve the quality of initial population. A local search mechanism has been embedded in the search procedure to improve the quality of solutions obtained at the end of each iteration. The computational results were encouraging and demonstrated the effectiveness of the proposed solution method.

  11. Smallest-Small-World Cellular Harmony Search for Optimization of Unconstrained Benchmark Problems

    Directory of Open Access Journals (Sweden)

    Sung Soo Im

    2013-01-01

    Full Text Available We presented a new hybrid method that combines cellular harmony search algorithms with the Smallest-Small-World theory. A harmony search (HS algorithm is based on musical performance processes that occur when a musician searches for a better state of harmony. Harmony search has successfully been applied to a wide variety of practical optimization problems. Most of the previous researches have sought to improve the performance of the HS algorithm by changing the pitch adjusting rate and harmony memory considering rate. However, there has been a lack of studies to improve the performance of the algorithm by the formation of population structures. Therefore, we proposed an improved HS algorithm that uses the cellular automata formation and the topological structure of Smallest-Small-World network. The improved HS algorithm has a high clustering coefficient and a short characteristic path length, having good exploration and exploitation efficiencies. Nine benchmark functions were applied to evaluate the performance of the proposed algorithm. Unlike the existing improved HS algorithm, the proposed algorithm is expected to have improved algorithmic efficiency from the formation of the population structure.

  12. CALL FOR PAPERS: Special issue on the random search problem: trends and perspectives

    Science.gov (United States)

    da Luz, Marcos G. E.; Grosberg, Alexander Y.; Raposo, Ernesto P.; Viswanathan, Gandhi M.

    2008-11-01

    This is a call for contributions to a special issue of Journal of Physics A: Mathematical and Theoretical dedicated to the subject of the random search problem. The motivation behind this special issue is to summarize in a single comprehensive publication, the main aspects (past and present), latest developments, different viewpoints and the directions being followed in this multidisciplinary field. We hope that such a special issue could become a particularly valuable reference for the broad scientific community working with the general random search problem. The Editorial Board has invited Marcos G E da Luz, Alexander Y Grosberg, Ernesto P Raposo and Gandhi M Viswanathan to serve as Guest Editors for the special issue. The general question of how to optimize the search for specific target objects in either continuous or discrete environments when the information available is limited is of significant importance in a broad range of fields. Representative examples include ecology (animal foraging, dispersion of populations), geology (oil recovery from mature reservoirs), information theory (automated researchers of registers in high-capacity database), molecular biology (proteins searching for their sites, e.g., on DNA ), etc. One reason underlying the richness of the random search problem relates to the `ignorance' of the locations of the randomly located `targets'. A statistical approach to the search problem can deal adequately with incomplete information and so stochastic strategies become advantageous. The general problem of how to search efficiently for randomly located target sites can thus be quantitatively described using the concepts and methods of statistical physics and stochastic processes. Scope Thus far, to the best of our knowledge, no recent textbook or review article in a physics journal has appeared on this topic. This makes a special issue with review and research articles attractive to those interested in acquiring a general introduction to the

  13. Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem

    Directory of Open Access Journals (Sweden)

    Ho-Yoeng Yun

    2013-01-01

    Full Text Available We propose a novel heuristic algorithm based on the methods of advanced Harmony Search and Ant Colony Optimization (AHS-ACO to effectively solve the Traveling Salesman Problem (TSP. The TSP, in general, is well known as an NP-complete problem, whose computational complexity increases exponentially by increasing the number of cities. In our algorithm, Ant Colony Optimization (ACO is used to search the local optimum in the solution space, followed by the use of the Harmony Search to escape the local optimum determined by the ACO and to move towards a global optimum. Experiments were performed to validate the efficiency of our algorithm through a comparison with other algorithms and the optimum solutions presented in the TSPLIB. The results indicate that our algorithm is capable of generating the optimum solution for most instances in the TSPLIB; moreover, our algorithm found better solutions in two cases (kroB100 and pr144 when compared with the optimum solution presented in the TSPLIB.

  14. An Improved Harmony Search Based on Teaching-Learning Strategy for Unconstrained Optimization Problems

    Directory of Open Access Journals (Sweden)

    Shouheng Tuo

    2013-01-01

    Full Text Available Harmony search (HS algorithm is an emerging population-based metaheuristic algorithm, which is inspired by the music improvisation process. The HS method has been developed rapidly and applied widely during the past decade. In this paper, an improved global harmony search algorithm, named harmony search based on teaching-learning (HSTL, is presented for high dimension complex optimization problems. In HSTL algorithm, four strategies (harmony memory consideration, teaching-learning strategy, local pitch adjusting, and random mutation are employed to maintain the proper balance between convergence and population diversity, and dynamic strategy is adopted to change the parameters. The proposed HSTL algorithm is investigated and compared with three other state-of-the-art HS optimization algorithms. Furthermore, to demonstrate the robustness and convergence, the success rate and convergence analysis is also studied. The experimental results of 31 complex benchmark functions demonstrate that the HSTL method has strong convergence and robustness and has better balance capacity of space exploration and local exploitation on high dimension complex optimization problems.

  15. A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph

    Directory of Open Access Journals (Sweden)

    F. Liberatore

    2016-01-01

    Full Text Available In the current economic climate, law enforcement agencies are facing resource shortages. The effective and efficient use of scarce resources is therefore of the utmost importance to provide a high standard public safety service. Optimization models specifically tailored to the necessity of police agencies can help to ameliorate their use. The Multicriteria Police Districting Problem (MC-PDP on a graph concerns the definition of sound patrolling sectors in a police district. The objective of this problem is to partition a graph into convex and continuous subsets, while ensuring efficiency and workload balance among the subsets. The model was originally formulated in collaboration with the Spanish National Police Corps. We propose for its solution three local search algorithms: a Simple Hill Climbing, a Steepest Descent Hill Climbing, and a Tabu Search. To improve their diversification capabilities, all the algorithms implement a multistart procedure, initialized by randomized greedy solutions. The algorithms are empirically tested on a case study on the Central District of Madrid. Our experiments show that the solutions identified by the novel Tabu Search outperform the other algorithms. Finally, research guidelines for future developments on the MC-PDP are given.

  16. Inverse atmospheric radiative transfer problems - A nonlinear minimization search method of solution. [aerosol pollution monitoring

    Science.gov (United States)

    Fymat, A. L.

    1976-01-01

    The paper studies the inversion of the radiative transfer equation describing the interaction of electromagnetic radiation with atmospheric aerosols. The interaction can be considered as the propagation in the aerosol medium of two light beams: the direct beam in the line-of-sight attenuated by absorption and scattering, and the diffuse beam arising from scattering into the viewing direction, which propagates more or less in random fashion. The latter beam has single scattering and multiple scattering contributions. In the former case and for single scattering, the problem is reducible to first-kind Fredholm equations, while for multiple scattering it is necessary to invert partial integrodifferential equations. A nonlinear minimization search method, applicable to the solution of both types of problems has been developed, and is applied here to the problem of monitoring aerosol pollution, namely the complex refractive index and size distribution of aerosol particles.

  17. IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS

    Science.gov (United States)

    Fogle, F. R.

    1994-01-01

    IESIP, an Improved Exploratory Search Technique for Pure Integer Linear Programming Problems, addresses the problem of optimizing an objective function of one or more variables subject to a set of confining functions or constraints by a method called discrete optimization or integer programming. Integer programming is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more difficult, integer programming is required for accuracy when modeling systems with small numbers of components such as the distribution of goods, machine scheduling, and production scheduling. IESIP establishes a new methodology for solving pure integer programming problems by utilizing a modified version of the univariate exploratory move developed by Robert Hooke and T.A. Jeeves. IESIP also takes some of its technique from the greedy procedure and the idea of unit neighborhoods. A rounding scheme uses the continuous solution found by traditional methods (simplex or other suitable technique) and creates a feasible integer starting point. The Hook and Jeeves exploratory search is modified to accommodate integers and constraints and is then employed to determine an optimal integer solution from the feasible starting solution. The user-friendly IESIP allows for rapid solution of problems up to 10 variables in size (limited by DOS allocation). Sample problems compare IESIP solutions with the traditional branch-and-bound approach. IESIP is written in Borland's TURBO Pascal for IBM PC series computers and compatibles running DOS. Source code and an executable are provided. The main memory requirement for execution is 25K. This program is available on a 5.25 inch 360K MS DOS format diskette. IESIP was developed in 1990. IBM is a trademark of International Business Machines. TURBO Pascal is registered by Borland International.

  18. Searching for Ariadne’s thread. Some remarks on urban resilience and orientation

    Directory of Open Access Journals (Sweden)

    Giovanni Rabino

    2012-07-01

    Full Text Available This paper concerns the methods of analysis of the configuration of the urban grids. More in details, it will focus on the configurational approach to the analysis of urban settlements, briefly presenting the different methods and techniques it has inspired, sketching their features, highlighting their actual utility and reminding their respective advantages and limits. Moreover, it will propose the use of some further configurational parameters, suitable for describing and reproducing interesting features of urban settlements; more in details, it will cast attention onto the richness and the variety of paths within a settlement, what makes it resilient, that is capable of sustaining changes and transformations without radically modifying its inner geography. Such parameters have been tested on the case studies of Pisa and Venice, which can easily be recognised as particularly relevant and significant, in that the results they provide are diametrically different. Those outputs will then be presented and discussed; the findings are suitable for suggesting resilience as a singular clue for urban orientation, so that the configurational techniques can be proposed as a tool for evaluating and predicting this spatial attitude, here finding an Ariadne’s thread for urban wayfinding.

  19. Improved Harmony Search Algorithm for Truck Scheduling Problem in Multiple-Door Cross-Docking Systems

    Directory of Open Access Journals (Sweden)

    Zhanzhong Wang

    2018-01-01

    Full Text Available The key of realizing the cross docking is to design the joint of inbound trucks and outbound trucks, so a proper sequence of trucks will make the cross-docking system much more efficient and need less makespan. A cross-docking system is proposed with multiple receiving and shipping dock doors. The objective is to find the best door assignments and the sequences of trucks in the principle of products distribution to minimize the total makespan of cross docking. To solve the problem that is regarded as a mixed integer linear programming (MILP model, three metaheuristics, namely, harmony search (HS, improved harmony search (IHS, and genetic algorithm (GA, are proposed. Furthermore, the fixed parameters are optimized by Taguchi experiments to improve the accuracy of solutions further. Finally, several numerical examples are put forward to evaluate the performances of proposed algorithms.

  20. Cooperative parallel adaptive neighbourhood search for the disjunctively constrained knapsack problem

    Science.gov (United States)

    Quan, Zhe; Wu, Lei

    2017-09-01

    This article investigates the use of parallel computing for solving the disjunctively constrained knapsack problem. The proposed parallel computing model can be viewed as a cooperative algorithm based on a multi-neighbourhood search. The cooperation system is composed of a team manager and a crowd of team members. The team members aim at applying their own search strategies to explore the solution space. The team manager collects the solutions from the members and shares the best one with them. The performance of the proposed method is evaluated on a group of benchmark data sets. The results obtained are compared to those reached by the best methods from the literature. The results show that the proposed method is able to provide the best solutions in most cases. In order to highlight the robustness of the proposed parallel computing model, a new set of large-scale instances is introduced. Encouraging results have been obtained.

  1. 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.

  2. Search and Coherence-Building in Intuition and Insight Problem Solving

    Directory of Open Access Journals (Sweden)

    Michael Öllinger

    2017-05-01

    Full Text Available Coherence-building is a key concept for a better understanding of the underlying mechanisms of intuition and insight problem solving. There are several accounts that address certain aspects of coherence-building. However, there is still no proper framework defining the general principles of coherence-building. We propose a four-stage model of coherence-building. The first stage starts with spreading activation restricted by constraints. This dynamic is a well-defined rule based process. The second stage is characterized by detecting a coherent state. We adopted a fluency account assuming that the ease of information processing indicates the realization of a coherent state. The third stage is designated to evaluate the result of the coherence-building process and assess whether the given problem is solved or not. If the coherent state does not fit the requirements of the task, the process re-enters at stage 1. These three stages characterize intuition. For insight problem solving a fourth stage is necessary, which restructures the given representation after repeated failure, so that a new search space results. The new search space enables new coherent states. We provide a review of the most important findings, outline our model, present a large number of examples, deduce potential new paradigms and measures that might help to decipher the underlying cognitive processes.

  3. Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation.

    Science.gov (United States)

    Bula, Gustavo Alfredo; Prodhon, Caroline; Gonzalez, Fabio Augusto; Afsar, H Murat; Velasco, Nubia

    2017-02-15

    This work focuses on the Heterogeneous Fleet Vehicle Routing problem (HFVRP) in the context of hazardous materials (HazMat) transportation. The objective is to determine a set of routes that minimizes the total expected routing risk. This is a nonlinear function, and it depends on the vehicle load and the population exposed when an incident occurs. Thus, a piecewise linear approximation is used to estimate it. For solving the problem, a variant of the Variable Neighborhood Search (VNS) algorithm is employed. To improve its performance, a post-optimization procedure is implemented via a Set Partitioning (SP) problem. The SP is solved on a pool of routes obtained from executions of the local search procedure embedded on the VNS. The algorithm is tested on two sets of HFVRP instances based on literature with up to 100 nodes, these instances are modified to include vehicle and arc risk parameters. The results are competitive in terms of computational efficiency and quality attested by a comparison with Mixed Integer Linear Programming (MILP) previously proposed. Copyright © 2016 Elsevier B.V. All rights reserved.

  4. An improved exploratory search technique for pure integer linear programming problems

    Science.gov (United States)

    Fogle, F. R.

    1990-01-01

    The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.

  5. Evaluation of a Computerized Problem-Oriented Medical Record in a Hospital Department: Does it Support Daily Clinical Practice?

    DEFF Research Database (Denmark)

    Bossen, Claus

    2007-01-01

    led to more time spent documenting clinical work, fragmentation of patient situation into separate problems, and lack of overview.Conclusion: The problem-oriented method for structuring a computerized medical record may provide a description of how physicians think or ought to think, but does...... not adequately support complex clinical work. While the CPOMR can be used for patients with few, simple problems who are admitted for only a short time, the CPOMR is not useful for patients with a complex set of problems or for patients admitted for longer periods of time. This is in accordance with criticism...

  6. All roads lead to Rome - New search methods for the optimal triangulation problem

    Czech Academy of Sciences Publication Activity Database

    Ottosen, T. J.; Vomlel, Jiří

    2012-01-01

    Roč. 53, č. 9 (2012), s. 1350-1366 ISSN 0888-613X R&D Projects: GA MŠk 1M0572; GA ČR GEICC/08/E010; GA ČR GA201/09/1891 Grant - others:GA MŠk(CZ) 2C06019 Institutional support: RVO:67985556 Keywords : Bayesian networks * Optimal triangulation * Probabilistic inference * Cliques in a graph Subject RIV: BD - Theory of Information Impact factor: 1.729, year: 2012 http://library.utia.cas.cz/separaty/2012/MTR/vomlel-all roads lead to rome - new search methods for the optimal triangulation problem.pdf

  7. A tabu-search heuristic for solving the multi-depot vehicle scheduling problem

    Directory of Open Access Journals (Sweden)

    Gilmar D'Agostini Oliveira Casalinho

    2014-08-01

    Full Text Available Currently the logistical problems are relying quite significantly on Operational Research in order to achieve greater efficiency in their operations. Among the problems related to the vehicles scheduling in a logistics system, the Multiple Depot Vehicle Scheduling Problem (MDVSP has been addressed in several studies. The MDVSP presupposes the existence of depots that affect the planning of sequences to which travel must be performed. Often, exact methods cannot solve large instances encountered in practice and in order to take them into account, several heuristic approaches are being developed. The aim of this study was thus to solve the MDVSP using a meta-heuristic based on tabu-search method. The main motivation for this work came from the indication that only recently the use of meta-heuristics is being applied to MDVSP context (Pepin et al. 2008 and, also, the limitations listed by Rohde (2008 in his study, which used the branch-and-bound in one of the steps of the heuristic presented to solve the problem, which has increased the time resolution. The research method for solving this problem was based on adaptations of traditional techniques of Operational Research, and provided resolutions presenting very competitive results for the MDVSP such as the cost of the objective function, number of vehicles used and computational time.

  8. Cuckoo search via Levy flights applied to uncapacitated facility location problem

    Science.gov (United States)

    Mesa, Armacheska; Castromayor, Kris; Garillos-Manliguez, Cinmayii; Calag, Vicente

    2017-11-01

    Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take strategic decisions such as locating the facilities. There are different approaches relevant to the uncapacitated FLP. Here, the cuckoo search via Lévy flight (CS-LF) was used to solve the problem. Though hybrid methods produce better results, this study employed CS-LF to determine first its potential in finding solutions for the problem, particularly when applied to a real-world problem. The method was applied to the data set obtained from a department store in Davao City, Philippines. Results showed that applying CS-LF yielded better facility locations compared to particle swarm optimization and other existing algorithms. Although these results showed that CS-LF is a promising method to solve this particular problem, further studies on other FLP are recommended to establish a strong foundation of the capability of CS-LF in solving FLP.

  9. A trial of patient-oriented problem-solving system for immunology teaching in China: a comparison with dialectic lectures

    OpenAIRE

    Zhang Zhiren; Liu Wei; Han Junfeng; Guo Sheng; Wu Yuzhang

    2013-01-01

    Abstract Background The most common teaching method used in China is lecturing, but recently, efforts have been widely undertaken to promote the transition from teacher-centered to student-centered education. The patient-oriented problem-solving (POPS) system is an innovative teaching-learning method that permits students to work in small groups to solve clinical problems, promotes self-learning, encourages clinical reasoning and develops long-lasting memory. To our best knowledge, however, P...

  10. The Role of Parents' Attachment Orientations, Depressive Symptoms, and Conflict Behaviors in Children's Externalizing and Internalizing Behavior Problems

    Science.gov (United States)

    Marchand, Jennifer F.; Schedler, Steven; Wagstaff, David A.

    2004-01-01

    The present study examined links among parents' attachment orientations, depressive symptoms, and conflict behaviors (attacking and compromising) and children's externalizing and internalizing behavior problems in a sample of 64 nonclinical, Caucasian families. Correlational analyses showed that all three parent attributes were significantly…

  11. Large neighborhood search for the double traveling salesman problem with multiple stacks

    Energy Technology Data Exchange (ETDEWEB)

    Bent, Russell W [Los Alamos National Laboratory; Van Hentenryck, Pascal [BROWN UNIV

    2009-01-01

    This paper considers a complex real-life short-haul/long haul pickup and delivery application. The problem can be modeled as double traveling salesman problem (TSP) in which the pickups and the deliveries happen in the first and second TSPs respectively. Moreover, the application features multiple stacks in which the items must be stored and the pickups and deliveries must take place in reserve (LIFO) order for each stack. The goal is to minimize the total travel time satisfying these constraints. This paper presents a large neighborhood search (LNS) algorithm which improves the best-known results on 65% of the available instances and is always within 2% of the best-known solutions.

  12. Combining goal-oriented and model-driven approaches to solve the Payment Problem Scenario

    NARCIS (Netherlands)

    Asuncion, C.H.; Quartel, Dick; Pokraev, S.; Iacob, Maria Eugenia; van Sinderen, Marten J.

    2010-01-01

    Motivated by the objective to provide an improved participation of business domain experts in the design of service-oriented integration solutions, we extend our previous work on using the COSMO methodology for service mediation by introducing a goal-oriented approach to requirements engineering.

  13. Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net

    Directory of Open Access Journals (Sweden)

    Behnam Barzegar

    2012-01-01

    Full Text Available Scheduled production system leads to avoiding stock accumulations, losses reduction, decreasing or even eliminating idol machines, and effort to better benefitting from machines for on time responding customer orders and supplying requested materials in suitable time. In flexible job-shop scheduling production systems, we could reduce time and costs by transferring and delivering operations on existing machines, that is, among NP-hard problems. The scheduling objective minimizes the maximal completion time of all the operations, which is denoted by Makespan. Different methods and algorithms have been presented for solving this problem. Having a reasonable scheduled production system has significant influence on improving effectiveness and attaining to organization goals. In this paper, new algorithm were proposed for flexible job-shop scheduling problem systems (FJSSP-GSPN that is based on gravitational search algorithm (GSA. In the proposed method, the flexible job-shop scheduling problem systems was modeled by color Petri net and CPN tool and then a scheduled job was programmed by GSA algorithm. The experimental results showed that the proposed method has reasonable performance in comparison with other algorithms.

  14. A multi-level variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

    DEFF Research Database (Denmark)

    Wen, Min; Krapper, Emil; Larsen, Jesper

    things, predefined workdays, fixed starting time, maximum weekly working duration, break rule. The objective is to minimize the total delivery cost. The real-life case study is fi rst introduced and modelled as a mixed integer linear program. A multilevel variable neighborhood search heuristic...... is then proposed for the problem. At the first level, the problem size is reduced through an aggregation procedure. At the second level, the aggregated weekly planning problem is decomposed into daily planning problems, each of which is solved by a variable neighborhood search. At the last level, the solution...

  15. PHILOSOPHICAL-ANTROPOLOGICAL ASPECTS OF A PROBLEM OF SEARCH EXTRA-TERRESTRIAL OF CIVILIZATIONS

    Directory of Open Access Journals (Sweden)

    A. T. Tshedrin

    2013-09-01

    Full Text Available Purpose. The fears express, that «METI-projects», which testify to existence of mankind as technicalgeneous of a civilization for highly advanced ETC of a Galaxy, can have the extremely negative consequences, and «SETI-projects» and received radiosignals can become the information weapon aggressive ETC. The analysis of these fears as complete sociocultural of a phenomenon, them philosophical-anthropological of measurement, sociocultural of the basis, the forms of their display are the purpose of clause. Methodology. Author used the social-communicative approach, methods of system and cluster analyses. Scientific innovation. Are opened philosophical-anthropological of measurement of a problem of life extra-terrestrial intelligents (ETI, the factors of statement of a problem of contacts with ETC in the modern form connected with spacing of scientific and technical activity of mankind, influence of processes globalization on philosophical-anthropological aspects of a problem ETC, connected with changes in the fundamental relation «the Man - World» are investigated. These processes conduct to growth of fears concerning unpredictable intervention in terrestrial sociocultural system of alien reason. The persuasive fears, connected with possible consequences of contacts with ETC, take the form of hypotheses rather extra-terrestrial of artificial intelligence (ETAI as potential subject of space contact. The positive and negative scripts of dialogue with ETAI, problem «of high quality of a signal» and «SETI-hacker», connected with ETAI as by the subject of space dialogue are considered. Conclusions. The further development of a problem of search ETC and establishment of contacts with it will be connected, on the one hand to success in overcoming civilization of impasse, in which there was a mankind on a boundary ХХ – ХХI of centuries, and with another - deepening of revolution in cosmology, progress of observant astronomy, philosophical

  16. Bringing science to medicine: an interview with Larry Weed, inventor of the problem-oriented medical record.

    Science.gov (United States)

    Wright, Adam; Sittig, Dean F; McGowan, Julie; Ash, Joan S; Weed, Lawrence L

    2014-01-01

    Larry Weed, MD is widely known as the father of the problem-oriented medical record and inventor of the now-ubiquitous SOAP (subjective/objective/assessment/plan) note, for developing an electronic health record system (Problem-Oriented Medical Information System, PROMIS), and for founding a company (since acquired), which developed problem-knowledge couplers. However, Dr Weed's vision for medicine goes far beyond software--over the course of his storied career, he has relentlessly sought to bring the scientific method to medical practice and, where necessary, to point out shortcomings in the system and advocate for change. In this oral history, Dr Weed describes, in his own words, the arcs of his long career and the work that remains to be done. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://group.bmj.com/group/rights-licensing/permissions.

  17. The problem of the psychological construct of the personality’s goal orientation

    Directory of Open Access Journals (Sweden)

    Shylova Nina Ihorivna

    2017-12-01

    Full Text Available The article considers the concept of the personality’s goal orientation through a certain hierarchy of human goals and motivational content that reflects a personal position. The influence of this position on the achievement of long-term goals is shown mainly in future time situations. The components and forms of expression of the personality’s goal orientation are defined. Four positions are singled out: rationalistic, altruistic, rational and egocentric. The terminological apparatus for qualitative comprehension of the investigated concept is made. A psychological construct of the personality’s target orientation has been developed in the article.

  18. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.

    Science.gov (United States)

    Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

    2016-01-01

    The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.

  19. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem

    Science.gov (United States)

    Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

    2016-01-01

    The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them. PMID:26819585

  20. Problems encountered in searching for new strains of toxic planktonic syanobacteria

    International Nuclear Information System (INIS)

    Gorham, P.R.; McNicholas, S.; Allen, E.A.D.

    1982-01-01

    In 1979 and 1980, four blooms from Lac La Nonne (80 km NW of Edmonton, Alberta) dominated 67 to 95 percent by Aphanizomenon flos-aquae L., were found to be type-c-toxic to mice and agglutinated red blood cells. A search for type-c-toxic strains of Aphanizomenon in this lake was undertaken in 1980 and 1981 by making 128 colony isolates and testing the unialgal cultures obtained from five blooms which varied in composition from 10 to 95 precent Aphanizomenon. The following problems were encountered in this search and in attempts to obtain axenic clones of different species: 1)a high precentage of isolation failures caused by the gradual but complete take-over of most of the Aphanizomenon cultures by a purple-brown species of Pseudanabaena, 2)stasis or lysis caused by pH and/or composition of the medium or the agar, 3)stasis or lysis caused by bacteria in liquid microculture, on agar streaks or in agar pour-plates, 4) autolysis triggered by tensile stress during transfer of trichomes with loop or needle, 5)inability of graded dosages of gamma rays of sodium sulphide selectively to eliminate or reduce numbers of bacteria to a satisfactory level for plating, 6)autolysis and growth inhibition caused by gentle washing to reduce numbers of bacteria for plating, and 7)discovery that haemagglutination is not perfectly correlated with type-c-toxicity. The search produced no type-c toxic strains of Aphanizomenon but two heterogeneous take-over cultures of Pseudanabaena sp. were found that produced violent convulsions when injected intraperitoneally into mice

  1. Problems encountered in searching for new strains of toxic planktonic cyanobacteria

    Energy Technology Data Exchange (ETDEWEB)

    Gorham, P.R.; McNicholas, S.; Allen, E.A.D. (Alberta Univ., Edmonton (Canada))

    1982-09-01

    In 1979 and 1980, four blooms from Lac La Nonne (80 km NW of Edmonton, Alberta) dominated 67 to 95 percent by Aphanizomenon flos-aquae L., were found to be type-c-toxic to mice and agglutinated red blood cells. A search for type-c-toxic strains of Aphanizomenon in this lake was undertaken in 1980 and 1981 by making 128 colony isolates and testing the unialgal cultures obtained from five blooms which varied in composition from 10 to 95 precent Aphanizomenon. The following problems were encountered in this search and in attempts to obtain axenic clones of different species: 1)a high precentage of isolation failures caused by the gradual but complete take-over of most of the Aphanizomenon cultures by a purple-brown species of Pseudanabaena, 2)stasis or lysis caused by pH and/or composition of the medium or the agar, 3)stasis or lysis caused by bacteria in liquid microculture, on agar streaks or in agar pour-plates, 4) autolysis triggered by tensile stress during transfer of trichomes with loop or needle, 5)inability of graded dosages of gamma rays of sodium sulphide selectively to eliminate or reduce numbers of bacteria to a satisfactory level for plating, 6)autolysis and growth inhibition caused by gentle washing to reduce numbers of bacteria for plating, and 7)discovery that haemagglutination is not perfectly correlated with type-c-toxicity. The search produced no type-c toxic strains of Aphanizomenon but two heterogeneous take-over cultures of Pseudanabaena sp. were found that produced violent convulsions when injected intraperitoneally into mice.

  2. Experimental problems of search for quark-gluon plasma in nucleus-nucleus interactions

    International Nuclear Information System (INIS)

    Okonov, Eh.O.

    1987-01-01

    Experimental problems for searching for quark-gluon (quagma) plasma in nucleus-nucleus interactions (NbNb,CaCa, ArPb, CnE, ONe) in the energy range E=0.4-1 GeV/A and 3.67 GeV/A and 200 GeV/A energies are discussed. Peculiarities of performing experiments on Dubna synchrophasotron and SPS Bevalac are discussed. The first results prove hadron matter thermalization sufficient for quagma manifestation. It is found that such characteristics of studied interactions as relative λ-hyperon yield, spectral (temperature) characteristics of λ k -hyperons (with higher values of transferred transverse momenta) and associatively produced peons are of greatest interest. The necessity of precise establishment of λ-hyperon group as excessive and differing in its origin from the other particles of the hadron phase is noted. It is shown that experimental approach used in Dubna research proved efficient and requires further development. It includes : selection of rare events (fluctuations) in central interactions of nuclei with high local excitation; search and research of peculiarities in the production of strange particles and in associative pion production; use of streamer spectrometer with a trigger system of rigid selection of central interactions

  3. A problem-oriented approach to understanding adaptation: lessons learnt from Alpine Shire, Victoria Australia.

    Science.gov (United States)

    Roman, Carolina

    2010-05-01

    Climate change is gaining attention as a significant strategic issue for localities that rely on their business sectors for economic viability. For businesses in the tourism sector, considerable research effort has sought to characterise the vulnerability to the likely impacts of future climate change through scenarios or ‘end-point' approaches (Kelly & Adger, 2000). Whilst useful, there are few demonstrable case studies that complement such work with a ‘start-point' approach that seeks to explore contextual vulnerability (O'Brien et al., 2007). This broader approach is inclusive of climate change as a process operating within a biophysical system and allows recognition of the complex interactions that occur in the coupled human-environmental system. A problem-oriented and interdisciplinary approach was employed at Alpine Shire, in northeast Victoria Australia, to explore the concept of contextual vulnerability and adaptability to stressors that include, but are not limited to climatic change. Using a policy sciences approach, the objective was to identify factors that influence existing vulnerabilities and that might consequently act as barriers to effective adaptation for the Shire's business community involved in the tourism sector. Analyses of results suggest that many threats, including the effects climate change, compete for the resources, strategy and direction of local tourism management bodies. Further analysis of conditioning factors revealed that many complex and interacting factors define the vulnerability and adaptive capacity of the Shire's tourism sector to the challenges of global change, which collectively have more immediate implications for policy and planning than long-term future climate change scenarios. An approximation of the common interest, i.e. enhancing capacity in business acumen amongst tourism operators, would facilitate adaptability and sustainability through the enhancement of social capital in this business community. Kelly, P

  4. Process-oriented tests for validation of baroclinic shallow water models: The lock-exchange problem

    Science.gov (United States)

    Kolar, R. L.; Kibbey, T. C. G.; Szpilka, C. M.; Dresback, K. M.; Tromble, E. M.; Toohey, I. P.; Hoggan, J. L.; Atkinson, J. H.

    A first step often taken to validate prognostic baroclinic codes is a series of process-oriented tests, as those suggested by Haidvogel and Beckmann [Haidvogel, D., Beckmann, A., 1999. Numerical Ocean Circulation Modeling. Imperial College Press, London], among others. One of these tests is the so-called "lock-exchange" test or "dam break" problem, wherein water of different densities is separated by a vertical barrier, which is removed at time zero. Validation against these tests has primarily consisted of comparing the propagation speed of the wave front, as predicted by various theoretical and experimental results, to model output. In addition, inter-model comparisons of the lock-exchange test have been used to validate codes. Herein, we present a high resolution data set, taken from a laboratory-scale model, for direct and quantitative comparison of experimental and numerical results throughout the domain, not just the wave front. Data is captured every 0.2 s using high resolution digital photography, with salt concentration extracted by comparing pixel intensity of the dyed fluid against calibration standards. Two scenarios are discussed in this paper, symmetric and asymmetric mixing, depending on the proportion of dense/light water (17.5 ppt/0.0 ppt) in the experiment; the Boussinesq approximation applies to both. Front speeds, cast in terms of the dimensionless Froude number, show excellent agreement with literature-reported values. Data are also used to quantify the degree of mixing, as measured by the front thickness, which also provides an error band on the front speed. Finally, experimental results are used to validate baroclinic enhancements to the barotropic shallow water ADvanced CIRCulation (ADCIRC) model, including the effect of the vertical mixing scheme on simulation results. Based on salinity data, the model provides an average root-mean-square (rms) error of 3.43 ppt for the symmetric case and 3.74 ppt for the asymmetric case, most of which can

  5. Integer programming formulation and variable neighborhood search metaheuristic for the multiproduct pipeline scheduling problem

    Energy Technology Data Exchange (ETDEWEB)

    Souza Filho, Erito M.; Bahiense, Laura; Ferreira Filho, Virgilio J.M. [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE); Lima, Leonardo [Centro Federal de Educacao Tecnologica Celso Sukow da Fonseca (CEFET-RJ), Rio de Janeiro, RJ (Brazil)

    2008-07-01

    Pipeline are known as the most reliable and economical mode of transportation for petroleum and its derivatives, especially when large amounts of products have to be pumped for large distances. In this work we address the short-term schedule of a pipeline system comprising the distribution of several petroleum derivatives from a single oil refinery to several depots, connected to local consumer markets, through a single multi-product pipeline. We propose an integer linear programming formulation and a variable neighborhood search meta-heuristic in order to compare the performances of the exact and heuristic approaches to the problem. Computational tests in C language and MOSEL/XPRESS-MP language are performed over a real Brazilian pipeline system. (author)

  6. Mechatronic Control Engineering: A Problem Oriented And Project Based Learning Curriculum In Mechatronic

    DEFF Research Database (Denmark)

    Pedersen, Henrik Clemmensen; Andersen, Torben Ole; Hansen, Michael Rygaard

    2008-01-01

    Mechatronics is a field of multidisciplinary engineering that not only requires knowledge about different technical areas, but also insight into how to combine technologies optimally, to design efficient products and systems.This paper addresses the group project based and problem-oriented learning...... the well established methods from control engineering form very powerful techniques in both analysis and synthesis of mechatronic systems. The necessary skills for mechatronic engineers are outlined followed up by a discussion on how problem oriented project based learning is implemented. A complete...... curriculum named Mechatronic Control Engineering is presented, which is started at Aalborg University, Denmark, and the content of the semesters and projects are described. The projects are all characterized by the use of simulation and control for the purpose of analyzing and designing complex commercial...

  7. Intelligent Search Method Based ACO Techniques for a Multistage Decision Problem EDP/LFP

    Directory of Open Access Journals (Sweden)

    Mostefa RAHLI

    2006-07-01

    Full Text Available The implementation of a numerical library of calculation based optimization in electrical supply networks area is in the centre of the current research orientations, thus, our project in a form given is centred on the development of platform NMSS1. It's a software environment which will preserve many efforts as regards calculations of charge, smoothing curves, losses calculation and economic planning of the generated powers [23].The operational research [17] in a hand and the industrial practice in the other, prove that the means and processes of simulation reached a level of very appreciable reliability and mathematical confidence [4, 5, 14]. It is of this expert observation that many processes make confidence to the results of simulation.The handicaps of this approach or methodology are that it makes base its judgments and handling on simplified assumptions and constraints whose influence was deliberately neglected to be added to the cost to spend [14].By juxtaposing the methods of simulation with artificial intelligence techniques, gathering set of numerical methods acquires an optimal reliability whose assurance can not leave doubt.Software environment NMSS [23] can be a in the field of the rallying techniques of simulation and electric network calculation via a graphic interface. In the same software integrate an AI capability via a module expert system.Our problem is a multistage case where are completely dependant and can't be performed separately.For a multistage problem [21, 22], the results obtained from a credible (large size problem calculation, makes the following question: Could choice of numerical methods set make the calculation of a complete problem using more than two treatments levels, a total error which will be the weakest one possible? It is well-known according to algorithmic policy; each treatment can be characterized by a function called mathematical complexity. This complexity is in fact a coast (a weight overloading

  8. Java programming fundamentals problem solving through object oriented analysis and design

    CERN Document Server

    Nair, Premchand S

    2008-01-01

    While Java texts are plentiful, it's difficult to find one that takes a real-world approach, and encourages novice programmers to build on their Java skills through practical exercise. Written by an expert with 19 experience teaching computer programming, Java Programming Fundamentals presents object-oriented programming by employing examples taken from everyday life. Provides a foundation in object-oriented design principles and UML notation Describes common pitfalls and good programming practicesFurnishes supplemental links, documents, and programs on its companion website, www.premnair.netU

  9. Hybrid and Cooperative Strategies Using Harmony Search and Artificial Immune Systems for Solving the Nurse Rostering Problem

    Directory of Open Access Journals (Sweden)

    Suk Ho Jin

    2017-06-01

    Full Text Available The nurse rostering problem is an important search problem that features many constraints. In a nurse rostering problem, these constraints are defined by processes such as maintaining work regulations, assigning nurse shifts, and considering nurse preferences. A number of approaches to address these constraints, such as penalty function methods, have been investigated in the literature. We propose two types of hybrid metaheuristic approaches for solving the nurse rostering problem, which are based on combining harmony search techniques and artificial immune systems to balance local and global searches and prevent slow convergence speeds and prematurity. The proposed algorithms are evaluated against a benchmarking dataset of nurse rostering problems; the results show that they identify better or best known solutions compared to those identified in other studies for most instances. The results also show that the combination of harmony search and artificial immune systems is better suited than using single metaheuristic or other hybridization methods for finding upper-bound solutions for nurse rostering problems and discrete optimization problems.

  10. The Scatter Search Based Algorithm to Revenue Management Problem in Broadcasting Companies

    Science.gov (United States)

    Pishdad, Arezoo; Sharifyazdi, Mehdi; Karimpour, Reza

    2009-09-01

    The problem under question in this paper which is faced by broadcasting companies is how to benefit from a limited advertising space. This problem is due to the stochastic behavior of customers (advertiser) in different fare classes. To address this issue we propose a mathematical constrained nonlinear multi period model which incorporates cancellation and overbooking. The objective function is to maximize the total expected revenue and our numerical method performs it by determining the sales limits for each class of customer to present the revenue management control policy. Scheduling the advertising spots in breaks is another area of concern and we consider it as a constraint in our model. In this paper an algorithm based on Scatter search is developed to acquire a good feasible solution. This method uses simulation over customer arrival and in a continuous finite time horizon [0, T]. Several sensitivity analyses are conducted in computational result for depicting the effectiveness of proposed method. It also provides insight into better results of considering revenue management (control policy) compared to "no sales limit" policy in which sooner demand will served first.

  11. Modified Backtracking Search Optimization Algorithm Inspired by Simulated Annealing for Constrained Engineering Optimization Problems

    Directory of Open Access Journals (Sweden)

    Hailong Wang

    2018-01-01

    Full Text Available The backtracking search optimization algorithm (BSA is a population-based evolutionary algorithm for numerical optimization problems. BSA has a powerful global exploration capacity while its local exploitation capability is relatively poor. This affects the convergence speed of the algorithm. In this paper, we propose a modified BSA inspired by simulated annealing (BSAISA to overcome the deficiency of BSA. In the BSAISA, the amplitude control factor (F is modified based on the Metropolis criterion in simulated annealing. The redesigned F could be adaptively decreased as the number of iterations increases and it does not introduce extra parameters. A self-adaptive ε-constrained method is used to handle the strict constraints. We compared the performance of the proposed BSAISA with BSA and other well-known algorithms when solving thirteen constrained benchmarks and five engineering design problems. The simulation results demonstrated that BSAISA is more effective than BSA and more competitive with other well-known algorithms in terms of convergence speed.

  12. Social value orientation, organizational goal concerns and interdepartmental problem-solving behavior

    NARCIS (Netherlands)

    Nauta, A.; Dreu, C.K.W. de; Vaart, T. van der

    2002-01-01

    In a study of 11 organizations among 120 manufacturing, planning and sales employees, support was found for the hypothesis that a prosocial value orientation - as a personality trait - increases the likelihood that employees show a high concern for the goals of other departments. This concern,

  13. Social value orientation, organizational goal concerns and interdepartmental problem-solving behavior

    NARCIS (Netherlands)

    Nauta, A.; Dreu, C.K.W. de; Vaart, T. van der

    2001-01-01

    In a study in 11 organizations among 120 manufacturing, planning and sales employees, support was found for the hypothesis that a prosocial value orientation – as a personality trait -increases the likelihood that employees show a high concern for the goals of other departments. This concern,

  14. Social value orientation, organizational goal concerns and interdepartmental problem-solving behavior

    NARCIS (Netherlands)

    Nauta, A; De Dreu, CKW; Van der Vaart, T

    In a study of 11 organizations among 120 manufacturing, planning and sales employees, support was found for the hypothesis that a prosocial value orientation-as a personality trait-increases the likelihood that employees show a high concern for the goals of other departments. This concern, combined

  15. Unleashing the Effectiveness of Process-oriented Information Systems: Problem Analysis, Critical Success Factors, Implications

    NARCIS (Netherlands)

    Mutschler, B.B.; Reichert, M.U.; Bumiller, J.

    2008-01-01

    Process-oriented information systems (IS) aim at the computerized support of business processes. So far, contemporary IS have often fail to meet this goal. To better understand this drawback, to systematically identify its rationales, and to derive critical success factors for business process

  16. FACILITATING THE 3D INDOOR SEARCH AND RESCUE PROBLEM: AN OVERVIEW OF THE PROBLEM AND AN ANT COLONY SOLUTION APPROACH

    OpenAIRE

    H. Tashakkori; A. Rajabifard; M. Kalantari

    2016-01-01

    Search and rescue procedures for indoor environments are quite complicated due to the fact that much of the indoor information is unavailable to rescuers before physical entrance to the incident scene. Thus, decision making regarding the number of crew required and the way they should be dispatched in the building considering the various access points and complexities in the buildings in order to cover the search area in minimum time is dependent on prior knowledge and experience of the emerg...

  17. Hybrid Projected Gradient-Evolutionary Search Algorithm for Mixed Integer Nonlinear Optimization Problems

    National Research Council Canada - National Science Library

    Homaifar, Abdollah; Esterline, Albert; Kimiaghalam, Bahram

    2005-01-01

    The Hybrid Projected Gradient-Evolutionary Search Algorithm (HPGES) algorithm uses a specially designed evolutionary-based global search strategy to efficiently create candidate solutions in the solution space...

  18. Block Architecture Problem with Depth First Search Solution and Its Application

    Science.gov (United States)

    Rahim, Robbi; Abdullah, Dahlan; Simarmata, Janner; Pranolo, Andri; Saleh Ahmar, Ansari; Hidayat, Rahmat; Napitupulu, Darmawan; Nurdiyanto, Heri; Febriadi, Bayu; Zamzami, Z.

    2018-01-01

    Searching is a common process performed by many computer users, Raita algorithm is one algorithm that can be used to match and find information in accordance with the patterns entered. Raita algorithm applied to the file search application using java programming language and the results obtained from the testing process of the file search quickly and with accurate results and support many data types.

  19. Socioeconomic status, parenting, and externalizing problems in African American single-mother homes: A person-oriented approach.

    Science.gov (United States)

    Anton, Margaret T; Jones, Deborah J; Youngstrom, Eric A

    2015-06-01

    African American youth, particularly those from single-mother homes, are overrepresented in statistics on externalizing problems. The family is a central context in which to understand externalizing problems; however, reliance on variable-oriented approaches to the study of parenting, which originate from work with intact, middle-income, European American families, may obscure important information regarding variability in parenting styles among African American single mothers, and in turn, variability in youth outcomes as well. The current study demonstrated that within African American single-mother families: (a) a person-, rather than variable-, oriented approach to measuring parenting style may further elucidate variability; (b) socioeconomic status may provide 1 context within which to understanding variability in parenting style; and (c) 1 marker of socioeconomic status, income, and parenting style may each explain variability in youth externalizing problems; however, the interaction between income and parenting style was not significant. Findings have potential implications for better understanding the specific contexts in which externalizing problems may be most likely to occur within this at-risk and underserved group. (c) 2015 APA, all rights reserved).

  20. Socioeconomic Status, Parenting, and Externalizing Problems in African American Single-Mother Homes: A Person-Oriented Approach

    Science.gov (United States)

    Anton, Margaret T.; Jones, Deborah J.; Youngstrom, Eric A.

    2016-01-01

    African American youth, particularly those from single-mother homes, are overrepresented in statistics on externalizing problems. The family is a central context in which to understand externalizing problems; however, reliance on variable-oriented approaches to the study of parenting, which originate from work with intact, middle-income, European American families, may obscure important information regarding variability in parenting styles among African American single mothers, and in turn, variability in youth outcomes as well. The current study demonstrated that within African American single-mother families: (a) a person-, rather than variable-, oriented approach to measuring parenting style may further elucidate variability; (b) socioeconomic status may provide 1 context within which to understanding variability in parenting style; and (c) 1 marker of socioeconomic status, income, and parenting style may each explain variability in youth externalizing problems; however, the interaction between income and parenting style was not significant. Findings have potential implications for better understanding the specific contexts in which externalizing problems may be most likely to occur within this at-risk and underserved group. PMID:26053349

  1. Effect of a system-oriented intervention on compliance problems in schizophrenia

    DEFF Research Database (Denmark)

    Skarsholm, Hanne; Støvring, Henrik; Nielsen, Bent

    2014-01-01

    Background. Numerous studies have been conducted with a view to developing strategies for improvement of medical compliance in patients with schizophrenia. All of the studies conducted so far have had an individual approach to compliance based on the assumption that noncompliance is determined...... individually due to inappropriate behavior in the patient. We conducted a pragmatic controlled trial with a system-oriented approach, to provide a new perspective on compliance and test the efficacy of a multifactorial intervention at the system level in a routine clinical setting, an approach that has...... not previously been used for the improvement of compliance. Methods. 30 patients were allocated to the system-oriented therapy and 40 patients were allocated to the reference intervention, which consisted of individually based compliance therapy. The follow-up period was six months. Primary endpoint...

  2. The possibilities of applying a risk-oriented approach to the NPP reliability and safety enhancement problem

    Science.gov (United States)

    Komarov, Yu. A.

    2014-10-01

    An analysis and some generalizations of approaches to risk assessments are presented. Interconnection between different interpretations of the "risk" notion is shown, and the possibility of applying the fuzzy set theory to risk assessments is demonstrated. A generalized formulation of the risk assessment notion is proposed in applying risk-oriented approaches to the problem of enhancing reliability and safety in nuclear power engineering. The solution of problems using the developed risk-oriented approaches aimed at achieving more reliable and safe operation of NPPs is described. The results of studies aimed at determining the need (advisability) to modernize/replace NPP elements and systems are presented together with the results obtained from elaborating the methodical principles of introducing the repair concept based on the equipment technical state. The possibility of reducing the scope of tests and altering the NPP systems maintenance strategy is substantiated using the risk-oriented approach. A probabilistic model for estimating the validity of boric acid concentration measurements is developed.

  3. Unleashing the Effectiveness of Process-oriented Information Systems: Problem Analysis, Critical Success Factors, Implications

    OpenAIRE

    Mutschler, B.B.; Reichert, M.U.; Bumiller, J.

    2008-01-01

    Process-oriented information systems (IS) aim at the computerized support of business processes. So far, contemporary IS have often fail to meet this goal. To better understand this drawback, to systematically identify its rationales, and to derive critical success factors for business process support, we conducted three empirical studies: an exploratory case study in the automotive domain, an online survey among 79 IT professionals, and another online survey among 70 business process managem...

  4. A GENETIC ALGORITHM USING THE LOCAL SEARCH HEURISTIC IN FACILITIES LAYOUT PROBLEM: A MEMETİC ALGORİTHM APPROACH

    Directory of Open Access Journals (Sweden)

    Orhan TÜRKBEY

    2002-02-01

    Full Text Available Memetic algorithms, which use local search techniques, are hybrid structured algorithms like genetic algorithms among evolutionary algorithms. In this study, for Quadratic Assignment Problem (QAP, a memetic structured algorithm using a local search heuristic like 2-opt is developed. Developed in the algorithm, a crossover operator that has not been used before for QAP is applied whereas, Eshelman procedure is used in order to increase thesolution variability. The developed memetic algorithm is applied on test problems taken from QAP-LIB, the results are compared with the present techniques in the literature.

  5. Exploration of the search space of the in-core fuel management problem by knowledge-based techniques

    International Nuclear Information System (INIS)

    Galperin, A.

    1995-01-01

    The process of generating reload configuration patterns is presented as a search procedure. The search space of the problem is found to contain ∼ 10 12 possible problem states. If computational resources and execution time necessary to evaluate a single solution are taken into account, this problem may be described as a ''large space search problem.'' Understanding of the structure of the search space, i.e., distribution of the optimal (or nearly optimal) solutions, is necessary to choose an appropriate search method and to utilize adequately domain heuristic knowledge. A worth function is developed based on two performance parameters: cycle length and power peaking factor. A series of numerical experiments was carried out; 300,000 patterns were generated in 40 sessions. All these patterns were analyzed by simulating the power production cycle and by evaluating the two performance parameters. The worth function was calculated and plotted. Analysis of the worth function reveals quite a complicated search space structure. The fine structure shows an extremely large number of local peaks: about one peak per hundred configurations. The direct implication of this discovery is that within a search space of 10 12 states, there are ∼10 10 local optima. Further consideration of the worth function shape shows that the distribution of the local optima forms a contour with much slower variations, where ''better'' or ''worse'' groups of patterns are spaced within a few thousand or tens of thousands of configurations, and finally very broad subregions of the whole space display variations of the worth function, where optimal regions include tens of thousands of patterns and are separated by hundreds of thousands and millions

  6. The technical-economic problems concerning the search for sites for nuclear electricity generation facilities

    International Nuclear Information System (INIS)

    Zimmer, H.J.

    1976-01-01

    An outline of technical-physical fundamentals, of the design and the mode of operation of LWR reactors is followed by a brief description of the licensing procedure. It is pointed out that safety cannot be a criterion for a site because nuclear power plants have to be safe on every site. The problem of nuclear power plants in the vicinity of towns or densely populated areas is dealt with briefly, too. A method is proposed which allows to find a possible site while investing little time on search and evaluation and which stores this site in a site provision plan. The choice of possible sites is made on three levels which are independent of each other. Possible nuclear power plant sites, on the first level, are considered on the basis of the dominating influence of waste heat discharge and network integration. On the second level, macro-sites are determined by examining the realizability of these possible sites by looking at negative criteria, and, on the third level, the 'fine points' planning stage, a pool of potential micro-sites is determined by applying the 'measure of value' analysis. This is followed by citing an analytical method with which the order of priority amongst 8 possible sites in the USA was determined. (orig./HP) [de

  7. Kombinasi Firefly Algorithm-Tabu Search untuk Penyelesaian Traveling Salesman Problem

    Directory of Open Access Journals (Sweden)

    Riyan Naufal Hay's

    2017-07-01

    Full Text Available Traveling Salesman Problem (TSP adalah masalah optimasi kombinatorial klasik dan memiliki peran dalam perencanaan, penjadwalan, dan pencarian pada bidang rekayasa dan pengetahuan (Dong, 2012. TSP juga merupakan objek yang baik untuk menguji kinerja metode optimasi, beberapa metode seperti Cooperative Genetic Ant System (CGAS (Dong, 2012, Parallelized Genetic Ant Colony System (PGAS Particle Swarm Optimization and Ant Colony Optimization Algorithms (PSO–ACO (Elloumi, 2014, dan Ant Colony Hyper-Heuristics (ACO HH (Aziz, 2015 telah dikembangkan untuk memecahkan TSP. Sehingga, pada penelitian ini diimplementasikan kombinasi metode baru untuk meningkatkan akurasi penyelesaian TSP. Firefly Algorithm (FA merupakan salah satu algoritma yang dapat digunakan untuk memecahkan masalah optimasi kombinatorial (Layeb, 2014. FA merupakan algoritma yang berpotensi kuat dalam memecahkan kasus optimasi dibanding algoritma yang ada termasuk Particle Swarm Optimization (Yang, 2010. Namun, FA memiliki kekurangan dalam memecahkan masalah optimasi dengan skala besar (Baykasoğlu dan Ozsoy, 2014. Tabu Search (TS merupakan metode optimasi yang terbukti efektif untuk memecahkan masalah optimasi dengan skala besar (Pedro, 2013. Pada penelitian ini, TS akan diterapkan pada FA (FATS untuk memecahkan kasus TSP. Hasil FATS akan dibandingkan terhadap penelitian sebelumnya yaitu ACOHH. Perbandingan hasil menunjukan peningkatan akurasi sebesar 0.89% pada dataset Oliver30, 0.14% dataset Eil51, 3.81% dataset Eil76 dan 1.27% dataset KroA100.

  8. Automatic and directed search processes in solving simple semantic-memory problems.

    Science.gov (United States)

    Ben-Zur, H

    1989-09-01

    The cognitive processes involved in simple semantic-memory problems were investigated in four experiments. On each trial of Experiments 1 and 2, two stimulus words were presented, with the instructions to find a third word (i.e., the solution) that, when coupled with each of the stimuli, would yield two word pairs used in everyday language (e.g., surprise and birthday, for which the solution is party). The results of the two experiments indicated that informing the subject whether the solution constituted the first or the second element in the word pairs facilitated both likelihood and speed of solution attainment. In addition, solution attainment was relatively high for items based on frequently used word pairs (Experiment 1) and for items in which the stimuli appear, in everyday language, in a small number of word pairs (Experiment 2). In Experiment 3, the subjects were required to produce word pairs containing one of the two stimulus words from the items used in Experiment 2. Solution production was facilitated by rehearsing the second stimulus word of the specific item. The conclusion, supported by a post hoc analysis of the results of Experiments 2 and 3 (Experiment 4), was that indirect priming from one stimulus word may facilitate solution production from a searched word. These results are interpreted in terms of automatic and controlled processes, and their relevance to two different models for retrieval from semantic memory is discussed.

  9. A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems

    Directory of Open Access Journals (Sweden)

    Xuhao Zhang

    2014-01-01

    Full Text Available A framing link (FL based tabu search algorithm is proposed in this paper for a large-scale multidepot vehicle routing problem (LSMDVRP. Framing links are generated during continuous great optimization of current solutions and then taken as skeletons so as to improve optimal seeking ability, speed up the process of optimization, and obtain better results. Based on the comparison between pre- and postmutation routes in the current solution, different parts are extracted. In the current optimization period, links involved in the optimal solution are regarded as candidates to the FL base. Multiple optimization periods exist in the whole algorithm, and there are several potential FLs in each period. If the update condition is satisfied, the FL base is updated, new FLs are added into the current route, and the next period starts. Through adjusting the borderline of multidepot sharing area with dynamic parameters, the authors define candidate selection principles for three kinds of customer connections, respectively. Link split and the roulette approach are employed to choose FLs. 18 LSMDVRP instances in three groups are studied and new optimal solution values for nine of them are obtained, with higher computation speed and reliability.

  10. Why and How We Made a Problem Oriented AV Teaching Unit for Chemistry Students.

    Science.gov (United States)

    Mulder, T. H. M.; Verdonk, A. H.

    1984-01-01

    Describes an audiovisual teaching unit on the chemical laboratory technique of recrystallization which was developed along problem-solving lines and based on observation of student laboratory behavior. Discussion includes usual procedures for developing such units, how this unit solves problems typically associated with teaching, and its general…

  11. Mathematical toy model inspired by the problem of the adaptive origins of the sexual orientation continuum

    Science.gov (United States)

    Skinner, Brian

    2016-09-01

    Same-sex sexual behaviour is ubiquitous in the animal kingdom, but its adaptive origins remain a prominent puzzle. Here, I suggest the possibility that same-sex sexual behaviour arises as a consequence of the competition between an evolutionary drive for a wide diversity in traits, which improves the adaptability of a population, and a drive for sexual dichotomization of traits, which promotes opposite-sex attraction and increases the rate of reproduction. This trade-off is explored via a simple mathematical `toy model'. The model exhibits a number of interesting features and suggests a simple mathematical form for describing the sexual orientation continuum.

  12. Exploring the relationship between macroeconomic conditions and problem drinking as captured by Google searches in the U.S.

    Science.gov (United States)

    Frijters, Paul; Johnston, David W; Lordan, Grace; Shields, Michael A

    2013-05-01

    There is considerable policy interest in the impact of macroeconomic conditions on health-related behaviours and outcomes. This paper sheds new light on this issue by exploring the relationship between macroeconomic conditions and an indicator of problem drinking derived from state-level data on alcoholism-related Google searches conducted in the US over the period 2004-2011. We find the current recessionary period coincided with an almost 20% increase in alcoholism-related searches. Controlling for state and time-effects, a 5% rise in unemployment is followed in the next 12 months by an approximate 15% increase in searches. The use of Internet searches to inform on health-related behaviours and outcomes is in its infancy; but we suggest that the data provides important real-time information for policy-makers and can help to overcome the under-reporting in surveys of sensitive information. Copyright © 2013 Elsevier Ltd. All rights reserved.

  13. Global Search Trends of Oral Problems using Google Trends from 2004 to 2016: An Exploratory Analysis.

    Science.gov (United States)

    Patthi, Basavaraj; Kumar, Jishnu Krishna; Singla, Ashish; Gupta, Ritu; Prasad, Monika; Ali, Irfan; Dhama, Kuldeep; Niraj, Lav Kumar

    2017-09-01

    Oral diseases are pandemic cause of morbidity with widespread geographic distribution. This technology based era has brought about easy knowledge transfer than traditional dependency on information obtained from family doctors. Hence, harvesting this system of trends can aid in oral disease quantification. To conduct an exploratory analysis of the changes in internet search volumes of oral diseases by using Google Trends © (GT © ). GT © were utilized to provide real world facts based on search terms related to categories, interest by region and interest over time. Time period chosen was from January 2004 to December 2016. Five different search terms were explored and compared based on the highest relative search volumes along with comma separated value files to obtain an insight into highest search traffic. The search volume measured over the time span noted the term "Dental caries" to be the most searched in Japan, "Gingivitis" in Jordan, "Oral Cancer" in Taiwan, "No Teeth" in Australia, "HIV symptoms" in Zimbabwe, "Broken Teeth" in United Kingdom, "Cleft palate" in Philippines, "Toothache" in Indonesia and the comparison of top five searched terms provided the "Gingivitis" with highest search volume. The results from the present study offers an insight into a competent tool that can analyse and compare oral diseases over time. The trend research platform can be used on emerging diseases and their drift in geographic population with great acumen. This tool can be utilized in forecasting, modulating marketing strategies and planning disability limitation techniques.

  14. Problem-Based Learning and Teaching in Construction-Oriented Secondary Vocational Education

    Directory of Open Access Journals (Sweden)

    Csepcsényi Lajos Lászlóné Balogh Melinda

    2016-08-01

    Full Text Available It is a commonplace view today that schools do not prepare students properly for solving technical problems emerging in an ever-changing world. As attested by various PISA surveys, Hungarian students can only retrieve their knowledge situations. Their self-regulated learning, problem solving and cooperative skills do not develop in accord with the requirements of their future career. Positive transfer effects are only slightly expressed in learning, especially in the long run.

  15. Tutorial on Using LISP Object-Oriented Programming for Blackboards: Solving the Radar Tracking Problem

    Science.gov (United States)

    1989-08-01

    1977. Pp. 1-229. 25. V. Lesser and R. Fennell. "Parallelism in Aritificial Intelligence Problem Solving: A Case Study of Hearsay II," IEEE Transactions...artificial intelligence architecture used to solve the radar tracking problem. The research described was performed at Purdue University during long...TION 1 COSA TI CODES 18 SUBJECT TERMS in ,,tnu; . ’ .’ , .., ,’ a-, ,’£ ,i-, ,4’o4,, nun br) ,LD I GROUP SUB.GROu P Artificial intelligence Object

  16. An Adaptive Large Neighborhood Search-based Three-Stage Matheuristic for the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Christensen, Jonas Mark; Røpke, Stefan

    that serves all the customers. The second stage usesan Adaptive Large Neighborhood Search (ALNS) algorithm to minimise the travel distance, during the second phase all of the generated routes are considered by solving a set cover problem. The ALNS algorithm uses 4 destroy operators, 2 repair operators...

  17. Where to remove radioactive waste? Perspective for a problem-oriented sociological repository research

    International Nuclear Information System (INIS)

    Hocke, P.; Grunwald, A.

    2006-01-01

    The search for a final disposal site for high-level nuclear waste in Germany is to characterize as an enduring and politicised conflict causing a blocked process of decision making. A social science based research on final disposals, reflecting this stalemate situation in Germany, did not take place since the middle of the 1980s. This book persues three aims, it analyses the conflict situation in an historical and a systematic view, it discusses the new decision- and participation procedures and it formulates a socio-scientific research perspective on waste disposal. Th volume directs to political decision makers, representants from industry and economy, scientists and actors from the citizen sector. (GL)

  18. An item-oriented recommendation algorithm on cold-start problem

    Science.gov (United States)

    Qiu, Tian; Chen, Guang; Zhang, Zi-Ke; Zhou, Tao

    2011-09-01

    Based on a hybrid algorithm incorporating the heat conduction and probability spreading processes (Proc. Natl. Acad. Sci. U.S.A., 107 (2010) 4511), in this letter, we propose an improved method by introducing an item-oriented function, focusing on solving the dilemma of the recommendation accuracy between the cold and popular items. Differently from previous works, the present algorithm does not require any additional information (e.g., tags). Further experimental results obtained in three real datasets, RYM, Netflix and MovieLens, show that, compared with the original hybrid method, the proposed algorithm significantly enhances the recommendation accuracy of the cold items, while it keeps the recommendation accuracy of the overall and the popular items. This work might shed some light on both understanding and designing effective methods for long-tailed online applications of recommender systems.

  19. [Clinical orientation and thought on several problems in post-marketed reassessment of traditional Chinese medicine].

    Science.gov (United States)

    Wang, Xin; Su, Xia; Yu, Jie; Xie, Yanming; Wang, Yongyan

    2011-10-01

    The post-marketed reassessment is an important link to ensure the safety and effectiveness of traditional chinese medicine. It is also the expansion and stretch of new drug evaluation. Through the systematic, standard, rigorous post-marketed reassessment, the enterprise can full access to drugs after listing the efficacy and safety information, evaluate the interests and risk of the drug and provide the scientific basis for the drug use. It can also provide timely, scientific technology basis for government health decisions, the enterprise marketing decision and public health security. This paper mainly discussed the thought on clinical orientation of traditional chinese medicine in the post-marketed reassessment and how to reach the goal through systematic consideration and overall plan.

  20. Local search heuristics for the probabilistic dial-a-ride problem

    DEFF Research Database (Denmark)

    Ho, Sin C.; Haugland, Dag

    2011-01-01

    evaluation procedure in a pure local search heuristic and in a tabu search heuristic. The quality of the solutions obtained by the two heuristics have been compared experimentally. Computational results confirm that our neighborhood evaluation technique is much faster than the straightforward one...

  1. Safety problems, symptomatic oriented accident regulations, influence of nuclear energetic on ecology of the Slovak Republic

    International Nuclear Information System (INIS)

    Palenikova, M.

    2002-01-01

    IAEA initiated in 1990 the program on help of the countries of Eastern Europe and of the former Soviet Union at evaluating of the safety of their first generation nuclear power reactors of the type WWER 440/223. The main aim of this program was to identify the main design and operational safety problems, to determine international consensus on priorities of safety improvements, to provide the help in the assessment of completeness and adequacy of programs of safety improvements: What are the safety problems; What is the safety importance of problems; What is done for prevention from damage of nuclear power plant; and of three barriers: the tasks MOD V-2 NPP; What is done for reducing of damage consequences; PHP, PASS (post-accidental directives and post-accidental monitoring). (author)

  2. Sexual orientation and alcohol problem use among U.K. adolescents: an indirect link through depressed mood.

    Science.gov (United States)

    Pesola, Francesca; Shelton, Katherine H; van den Bree, Marianne B M

    2014-07-01

    Sexual minority adolescents are more likely to engage in alcohol use than their heterosexual counterparts; however, the underlying reasons remain unclear and longitudinal research is limited. Owing to evidence that this group also experiences greater depressive symptoms than their peers, we aimed to (i) assess to what extent depressed mood explains the increased likelihood of engaging in alcohol use among sexual minority adolescents, and (ii) explore potential gender-specific patterns. Structural equation modelling was used to test the indirect relationship between sexual orientation and alcohol use through depressed mood, with heterosexuals as the reference group. A total of 3710 adolescents (12% sexual minority), from the Avon Longitudinal Study of Parents and Children (ALSPAC) study, assessed between the ages of 15 and 18 years. Sexual orientation was assessed at age 15, while alcohol use was measured using the Alcohol Use Disorders Identification Test (AUDIT) at age 18. Depressed mood was indexed by the Short Mood and Feelings Questionnaire (SMFQ) at age 16. Sexual minority adolescents were more likely to engage in alcohol problem use compared to their heterosexual counterparts [Btotal  = 0.12, 95% confidence interval (CI) = 0.04-0.20, P = 0.003]. Depressed mood explained 21% of the link between sexual orientation and alcohol use after adjustment for covariates and earlier measures (Z = 3.2, P = 0.001). No gender differences were observed. A higher prevalence of alcohol problem use in adolescents who are gay, lesbian or bisexual is partly explained by increased rates of depression in this group. © 2014 Society for the Study of Addiction.

  3. Impact of a family-oriented rehabilitation programme on behavioural and emotional problems in healthy siblings of chronically ill children.

    Science.gov (United States)

    Besier, T; Hölling, H; Schlack, R; West, C; Goldbeck, L

    2010-09-01

    To evaluate the impact of a family-oriented inpatient rehabilitation programme on behavioural and emotional problems in healthy siblings of chronically ill children and to assess the association between these problems and quality of life. A total of 259 healthy children (4-16 years, M = 8.6 years, SD = 3.3) with a chronically ill sibling were enrolled in the study. Parents filled in the Strengths and Difficulties Questionnaire, while the children answered a self-report quality of life instrument (LQ-KID) at the time of admission and discharge from the clinic and at a 6-month follow-up. Comparisons were performed with a matched control group from the German general population (n= 777). Significant behavioural or emotional symptoms were found in 30.5% of the healthy siblings, the relative risk of having elevated scores being 2.2 compared with the control group. Symptoms were inversely correlated with quality of life (r=-0.42). During the inpatient rehabilitation, symptoms decreased significantly to a normal level. Similarly, quality of life significantly improved, except in the dimension family relations. Family-oriented inpatient rehabilitation is a promising approach to improve the mental health of children with a chronically ill sibling.

  4. "Breaking the Mold" in the Dissertation: Implementing a Problem-Based, Decision-Oriented Thesis Project

    Science.gov (United States)

    Archbald, Doug

    2010-01-01

    This article offers lessons from an initiative refashioning the doctoral thesis in an education leadership program. The program serves a practitioner clientele; most are teachers and administrators. The new model for the thesis emphasizes leadership, problem solving, decision making, and organizational improvement. The former model was a…

  5. Concept mapping and text writing as learning tools in problem-oriented learning

    NARCIS (Netherlands)

    Fürstenau, B.; Kneppers, L.; Dekker, R.; Cañas, A.J.; Novak, J.D.; Vanhaer, J.

    2012-01-01

    In two studies we investigated whether concept mapping or summary writing better support students while learning from authentic problems in the field of business. We interpret concept mapping and summary writing as elaboration tools aiming at helping students to understand new information, and to

  6. Statistics Anxiety and Worry: The Roles of Worry Beliefs, Negative Problem Orientation, and Cognitive Avoidance

    Science.gov (United States)

    Williams, Amanda S.

    2015-01-01

    Statistics anxiety is a common problem for graduate students. This study explores the multivariate relationship between a set of worry-related variables and six types of statistics anxiety. Canonical correlation analysis indicates a significant relationship between the two sets of variables. Findings suggest that students who are more intolerant…

  7. Sexual Orientation (For Parents)

    Science.gov (United States)

    ... Staying Safe Videos for Educators Search English Español Sexual Orientation KidsHealth / For Parents / Sexual Orientation What's in this ... orientation is part of that process. What Is Sexual Orientation? The term sexual orientation refers to the gender ( ...

  8. Problem-Oriented Conceptual Model and Ontology for Enterprise e-Recruitment

    OpenAIRE

    Alamro, S.; Dogan, Huseyin; Cetinkaya, Deniz; Jiang, N.

    2018-01-01

    Internet-led labour market has become so competitive forcing many organisations from different sectors to embrace e-recruitment. However, realising the value of the e-recruitment from a Requirements Engineering (RE) analysis perspective is challenging. The research is motivated by the results of a failed e-recruitment project as a case study by focusing on the difficulty of scoping and representing recruitment problem knowledge to systematically inform the RE process towards an e-recruitment ...

  9. PROBLEMS OF VALUE-ORIENTED FORMATION OF PROJECT PRODUCT’S MODEL

    Directory of Open Access Journals (Sweden)

    Тигран Георгиевич ГРИГОРЯН

    2015-06-01

    Full Text Available Problems of formation of the project output model related to the complexity of information transmission in the communication between the project participants and stakeholders are considered. The concept of forming a project output model based on allocation of stages of model developing and specification and efficiency of the formation of a model that takes into account the need to plan the project output value creation and transferring to the sponsor and consumers is proposed.

  10. Sexual orientation, treatment utilization, and barriers for alcohol related problems: Findings from a nationally representative sample.

    Science.gov (United States)

    Allen, Junior Lloyd; Mowbray, Orion

    2016-04-01

    Gay, lesbian, and bisexual (GLB) individuals appear to have an increased likelihood of alcohol use disorders and treatment utilization for alcohol related problems compared to heterosexual individuals. Despite this increase, treatment utilization rates among GLB individuals remain low. In an effort to address this, our paper examined whether or not GLB individuals encounter unique barriers when pursuing treatment for alcohol related problems. Using data from the National Epidemiologic Survey on Alcohol Related Conditions (NESARC), we examined service sector specific factors, some of which included (a) utilization rates, (b) self-reported treatment barriers, and (c) whether or not there were emergent differences among GLB individuals, after controlling for socio-demographic and clinical characteristics. Findings indicated that GLB individuals reported higher severity rates for alcohol use disorders when compared to heterosexual individuals, and were significantly more likely to utilize treatment services for alcohol related problems, however, not across all treatment sectors. While similar patterns were observed when examining barriers to treatment, bisexual individuals reported significantly more barriers than heterosexual and gay/lesbian individuals. These findings underscored the importance of identifying and developing interventions that addresses treatment barriers associated with alcohol use service utilization among GLB populations, and creating improved outreach and education programs to better address stigmas associated with substance use and sexuality. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

  11. Probability evaluation in problems of structural safety and quality assurance through oriented simulation

    International Nuclear Information System (INIS)

    Puppo, A.H.

    1990-01-01

    The procedure described in this work may be considered to improve the Harbitz method by a limitation of the directions corresponding to the sampling points. By the introduction of polar coordinates n-dimensional system, these directions may be limited to those contained in an hypercone, whose axis contains the design point. Some problems with strongly convex failure domain presented in some structural systems (Igusa and Der Kiureghian, 1988; Nadim, 1990) and also in the acceptance probability of analysis and rejection of quality assurance methods may be efficiently treated. (Author) [es

  12. The mesmerists inquire about "Oriental mind powers": West meets East in the search for the universal trance.

    Science.gov (United States)

    Schmit, David T

    2010-01-01

    Contemporary interest in Asian meditation raises questions about when Westerners began investigating these practices. A synopsis of Western-originating scientific meditation research is followed by a brief introduction to mesmerism. Next, the unappreciated ways the mesmerists explored Oriental mind powers is recounted. How the mesmerists' cultural positioning, philosophy, and interest in mind-body practices facilitated their inquiries of Oriental medicine and Hindu contemplative practices is explored, followed by a consideration of why these investigations were unique for the era. The way this work subverted Western cultural imperialism is examined. A consideration of the historical continuities and discontinuities between the mesmerists' inquiries and twentieth-century meditation research concludes the article.

  13. The effects of problem content and scientific background on information search and the assessment and valuation of correlations.

    Science.gov (United States)

    Soffer, Shira; Kareev, Yaakov

    2011-01-01

    The effects of problem contents and one's scientific background on the detection of correlations and the assessment of their strength were studied using a task that required active data search, assessment of the strength of a correlation, and monetary valuation of the correlation's predictive utility. Participants (N = 72) who were trained either in the natural sciences or in the social sciences and humanities explored data sets differing in contents and actual strength of correlation. Data search was consistent across all variables: Participants drew relatively small samples whose relative sizes would favor the detection of a correlation, if one existed. In contrast, the assessment of the correlation strength and the valuation of its predictive utility were strongly related not only to its objective strength, but also to the correspondence between problem contents and one's scientific background: When the two matched, correlations were judged to be stronger and more valuable than when they did not.

  14. Development of Problem-Based Learning Oriented Teaching Learning Materials to Facilitate Students’ Mastery of Concept and Critical Thinking Skill

    Science.gov (United States)

    Reza, M.; Ibrahim, M.; Rahayu, Y. S.

    2018-01-01

    This research aims to develop problem-based learning oriented teaching materials to improve students’ mastery of concept and critical thinking skill. Its procedure was divided into two phases; developmental phase and experimental phase. This developmental research used Four-D Model. However, within this research, the process of development would not involve the last stages, which is disseminate. The teaching learning materials which were developed consist of lesson plan, student handbook, student worksheet, achievement test and critical thinking skill test. The experimental phase employs a research design called one group pretest-posttest design. Results show that the validity of the teaching materials which were developed was good and revealed the enhancement of students’ activities with positive response to the teaching learning process. Furthermore, the learning materials improve the students’ mastery of concept and critical thinking skill.

  15. Alignment and orientation of atomic outer shells induced by electron and ion impact: Some recent developments and remaining problems

    International Nuclear Information System (INIS)

    Andersen, N.; Gallagher, J.W.; Hertel, I.V.

    1985-01-01

    Alignment and orientation of atoms in collision experiments with planar symmetry have now been studied for about 15 years and close to 500 papers have been produced, mainly devoted to S->P excitation. Despite the large variety of electron-atom, ion-atom and atom-atom collision systems considered, a unified framework for description of these phenomena is now emerging. This framework is a generalization of the original ideas of Macek and Jaecks and is based on consideration of symmetries, conservation laws, etc. The key parameters are directly related to the shape and dynamics of the charge cloud of the excited electron as well as to experimental observables. A brief review is given of this framework, and some current problems and prospects for the future are discussed. (orig.)

  16. Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

    Directory of Open Access Journals (Sweden)

    Vatutin Eduard

    2017-12-01

    Full Text Available The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

  17. Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

    Science.gov (United States)

    Vatutin, Eduard

    2017-12-01

    The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

  18. Solution Approach to Automatic Generation Control Problem Using Hybridized Gravitational Search Algorithm Optimized PID and FOPID Controllers

    Directory of Open Access Journals (Sweden)

    DAHIYA, P.

    2015-05-01

    Full Text Available This paper presents the application of hybrid opposition based disruption operator in gravitational search algorithm (DOGSA to solve automatic generation control (AGC problem of four area hydro-thermal-gas interconnected power system. The proposed DOGSA approach combines the advantages of opposition based learning which enhances the speed of convergence and disruption operator which has the ability to further explore and exploit the search space of standard gravitational search algorithm (GSA. The addition of these two concepts to GSA increases its flexibility for solving the complex optimization problems. This paper addresses the design and performance analysis of DOGSA based proportional integral derivative (PID and fractional order proportional integral derivative (FOPID controllers for automatic generation control problem. The proposed approaches are demonstrated by comparing the results with the standard GSA, opposition learning based GSA (OGSA and disruption based GSA (DGSA. The sensitivity analysis is also carried out to study the robustness of DOGSA tuned controllers in order to accommodate variations in operating load conditions, tie-line synchronizing coefficient, time constants of governor and turbine. Further, the approaches are extended to a more realistic power system model by considering the physical constraints such as thermal turbine generation rate constraint, speed governor dead band and time delay.

  19. Applying AN Object-Oriented Database Model to a Scientific Database Problem: Managing Experimental Data at Cebaf.

    Science.gov (United States)

    Ehlmann, Bryon K.

    Current scientific experiments are often characterized by massive amounts of very complex data and the need for complex data analysis software. Object-oriented database (OODB) systems have the potential of improving the description of the structure and semantics of this data and of integrating the analysis software with the data. This dissertation results from research to enhance OODB functionality and methodology to support scientific databases (SDBs) and, more specifically, to support a nuclear physics experiments database for the Continuous Electron Beam Accelerator Facility (CEBAF). This research to date has identified a number of problems related to the practical application of OODB technology to the conceptual design of the CEBAF experiments database and other SDBs: the lack of a generally accepted OODB design methodology, the lack of a standard OODB model, the lack of a clear conceptual level in existing OODB models, and the limited support in existing OODB systems for many common object relationships inherent in SDBs. To address these problems, the dissertation describes an Object-Relationship Diagram (ORD) and an Object-oriented Database Definition Language (ODDL) that provide tools that allow SDB design and development to proceed systematically and independently of existing OODB systems. These tools define multi-level, conceptual data models for SDB design, which incorporate a simple notation for describing common types of relationships that occur in SDBs. ODDL allows these relationships and other desirable SDB capabilities to be supported by an extended OODB system. A conceptual model of the CEBAF experiments database is presented in terms of ORDs and the ODDL to demonstrate their functionality and use and provide a foundation for future development of experimental nuclear physics software using an OODB approach.

  20. An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem

    DEFF Research Database (Denmark)

    Wen, M.; Linde, Esben; Røpke, Stefan

    2016-01-01

    to minimizing the total deadheading distance. A mixed integer programming formulation as well as an Adaptive Large Neighborhood Search (ALNS) heuristic for the E-VSP are presented. ALNS is tested on newly generated E-VSP benchmark instances. Result shows that the proposed heuristic can provide good solutions...

  1. Aiding the search: Examining individual differences in multiply-constrained problem solving.

    Science.gov (United States)

    Ellis, Derek M; Brewer, Gene A

    2018-07-01

    Understanding and resolving complex problems is of vital importance in daily life. Problems can be defined by the limitations they place on the problem solver. Multiply-constrained problems are traditionally examined with the compound remote associates task (CRAT). Performance on the CRAT is partially dependent on an individual's working memory capacity (WMC). These findings suggest that executive processes are critical for problem solving and that there are reliable individual differences in multiply-constrained problem solving abilities. The goals of the current study are to replicate and further elucidate the relation between WMC and CRAT performance. To achieve these goals, we manipulated preexposure to CRAT solutions and measured WMC with complex-span tasks. In Experiment 1, we report evidence that preexposure to CRAT solutions improved problem solving accuracy, WMC was correlated with problem solving accuracy, and that WMC did not moderate the effect of preexposure on problem solving accuracy. In Experiment 2, we preexposed participants to correct and incorrect solutions. We replicated Experiment 1 and found that WMC moderates the effect of exposure to CRAT solutions such that high WMC participants benefit more from preexposure to correct solutions than low WMC (although low WMC participants have preexposure benefits as well). Broadly, these results are consistent with theories of working memory and problem solving that suggest a mediating role of attention control processes. Published by Elsevier Inc.

  2. Searching for Love in all the “Write” Places: Exploring Internet Personals Use by Sexual Orientation, Gender, and Age

    OpenAIRE

    Lever, Janet; Grov, Christian; Royce, Tracy; Gillespie, Brian Joseph

    2008-01-01

    Few researchers of Internet sexual exploration have systematically compared variance of use across sexual orientations, with even fewer surveying bisexual respondents. In 2004, 15,246 individuals responded to an online survey of their use of Internet personals and adult websites. Gay men, lesbians, and bisexuals (GLBs) were more likely than heterosexuals to have exchanged correspondence, met others offline, and had sex with someone they met through personal ads. Whereas gay men and lesbians o...

  3. PROBLEM ORIENTED WILLED MOVEMENT THERAPY ON MOTOR ABILITIES OF TRAUMATIC BRAIN INJURY PATIENTS WITH COGNITIVE DEFICITS

    Directory of Open Access Journals (Sweden)

    Suchetha .P.S

    2014-06-01

    Full Text Available Background: Falls are a major problem in the elderly leading to increased morbidity and mortality in this population. Scores from objective clinical measures of balance have frequently been associated with falls in older adults. The Berg Balance Score (BBS which is a frequently used scale to test balance impairments in the elderly ,takes time to perform and has been found to have scoring inconsistencies. The purpose was to determine if individual items or a group of BBS items would have better accuracy than the total BBS in classifying community dwelling elderly individuals according to fall history. Method: 60 community dwelling elderly individuals were chosen based on a history of falls in this cross sectional study. Each BBS item was dichotomized at three points along the scoring scale of 0 – 4: between scores of 1 and 2, 2 and 3, and 3 and 4. Sensitivity (Sn, specificity (Sp, and positive (+LR and negative (-LR likelihood ratios were calculated for all items for each scoring dichotomy based on their accuracy in classifying subjects with a history of multiple falls. These findings were compared with the total BBS score where the cut-off score was derived from receiver operating characteristic curve analysis. Results: On analysing a combination of BBS items, B9 and B11 were found to have the best sensitivity and specificity when considered together. However the area under the curve of these items was 0.799 which did not match that of the total score (AUC= 0.837. A, combination of 4 BBS items - B9 B11 B12 and B13 also had good Sn and Sp but the AUC was 0.815. The combination with the AUC closest to that of the total score was a combination items B11 and B13. (AUC= 0.824. hence these two items can be used as the best predictor of falls with a cut off of 6.5 The ROC curve of the Total Berg balance Scale scores revealed a cut off score of 48.5. Conclusion: This study showed that combination of items B11 and B13 may be best predictors of falls in

  4. Solving a static repositioning problem in bike-sharing systems using iterated tabu search

    DEFF Research Database (Denmark)

    Ho, Sin C.; Szeto, W. Y.

    2014-01-01

    In this paper, we study the static bike repositioning problem where the problem consists of selecting a subset of stations to visit, sequencing them, and determining the pick-up/drop-off quantities (associated with each of the visited stations) under the various operational constraints. The objec......In this paper, we study the static bike repositioning problem where the problem consists of selecting a subset of stations to visit, sequencing them, and determining the pick-up/drop-off quantities (associated with each of the visited stations) under the various operational constraints...

  5. An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics

    Science.gov (United States)

    Hemmelmayr, Vera C.; Cordeau, Jean-François; Crainic, Teodor Gabriel

    2012-01-01

    In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP. PMID:23483764

  6. An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics.

    Science.gov (United States)

    Hemmelmayr, Vera C; Cordeau, Jean-François; Crainic, Teodor Gabriel

    2012-12-01

    In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP.

  7. Solving a manpower scheduling problem for airline catering using tabu search

    DEFF Research Database (Denmark)

    Ho, Sin C.; Leung, Janny M. Y.

    We study a manpower scheduling problem with job time-windows and job-skills compatibility constraints. This problem is motivated by airline catering operations, whereby airline meals and other supplies are delivered to aircrafts on the tarmac just before the flights take off. Jobs (flights) must...

  8. A Novel Discrete Global-Best Harmony Search Algorithm for Solving 0-1 Knapsack Problems

    Directory of Open Access Journals (Sweden)

    Wan-li Xiang

    2014-01-01

    is applied to decide whether or not a new randomly generated harmony is included into the HM. The proposed DGHS is evaluated on twenty knapsack problems with different scales and compared with other three metaheuristics from the literature. The experimental results indicate that DGHS is efficient, effective, and robust for solving difficult 0-1 knapsack problems.

  9. Parallel local search for solving Constraint Problems on the Cell Broadband Engine (Preliminary Results

    Directory of Open Access Journals (Sweden)

    Salvator Abreu

    2009-10-01

    Full Text Available We explore the use of the Cell Broadband Engine (Cell/BE for short for combinatorial optimization applications: we present a parallel version of a constraint-based local search algorithm that has been implemented on a multiprocessor BladeCenter machine with twin Cell/BE processors (total of 16 SPUs per blade. This algorithm was chosen because it fits very well the Cell/BE architecture and requires neither shared memory nor communication between processors, while retaining a compact memory footprint. We study the performance on several large optimization benchmarks and show that this achieves mostly linear time speedups, even sometimes super-linear. This is possible because the parallel implementation might explore simultaneously different parts of the search space and therefore converge faster towards the best sub-space and thus towards a solution. Besides getting speedups, the resulting times exhibit a much smaller variance, which benefits applications where a timely reply is critical.

  10. From printed geological maps to web-based service oriented data products - strategies, foundations and problems.

    Science.gov (United States)

    Ebner, M.; Schiegl, M.; Stöckl, W.; Heger, H.

    2012-04-01

    The Geological Survey of Austria is legally obligated by the INSPIRE directive to provide data that fall under this directive (geology, mineral resources and natural risk zones) to the European commission in a semantically harmonized and technically interoperable way. Until recently the focus was entirely on the publication of high quality printed cartographic products. These have a complex (carto-)graphic data-model, which allows visualizing several thematic aspects, such as lithology, stratigraphy, tectonics, geologic age, mineral resources, mass movements, geomorphology etc. in a single planar map/product. Nonetheless these graphic data-models do not allow retrieving individual thematic aspects since these were coded in a complex portrayal scheme. Automatic information retrieval is thus impossible; and domain knowledge is necessary to interpret these "encrypted datasets". With INSPIRE becoming effective and a variety of conceptual models (e.g. GeoSciML), built around a semantic framework (i.e. controlled vocabularies), being available it is necessary to develop a strategy and workflow for semantic harmonization of such datasets. In this contribution we demonstrate the development of a multistage workflow which will allow us to transform our printed maps to semantically enabled datasets and services and discuss some prerequisites, foundations and problems. In a first step in our workflow we analyzed our maps and developed controlled vocabularies that describe the thematic content of our data. We then developed a physical data-model which we use to attribute our spatial data with thematic information from our controlled vocabularies to form core thematic data sets. This physical data model is geared towards use on an organizational level but builds upon existing standards (INSPIRE, GeoSciML) to allow transformation to international standards. In a final step we will develop a standardized mapping scheme to publish INSPIRE conformant services from our core datasets

  11. A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems

    Directory of Open Access Journals (Sweden)

    Ricardo Soto

    2014-01-01

    Full Text Available The Sudoku is a famous logic-placement game, originally popularized in Japan and today widely employed as pastime and as testbed for search algorithms. The classic Sudoku consists in filling a 9×9 grid, divided into nine 3×3 regions, so that each column, row, and region contains different digits from 1 to 9. This game is known to be NP-complete, with existing various complete and incomplete search algorithms able to solve different instances of it. In this paper, we present a new cuckoo search algorithm for solving Sudoku puzzles combining prefiltering phases and geometric operations. The geometric operators allow one to correctly move toward promising regions of the combinatorial space, while the prefiltering phases are able to previously delete from domains the values that do not conduct to any feasible solution. This integration leads to a more efficient domain filtering and as a consequence to a faster solving process. We illustrate encouraging experimental results where our approach noticeably competes with the best approximate methods reported in the literature.

  12. An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Weizhen Rao

    2016-01-01

    Full Text Available The classical model of vehicle routing problem (VRP generally minimizes either the total vehicle travelling distance or the total number of dispatched vehicles. Due to the increased importance of environmental sustainability, one variant of VRPs that minimizes the total vehicle fuel consumption has gained much attention. The resulting fuel consumption VRP (FCVRP becomes increasingly important yet difficult. We present a mixed integer programming model for the FCVRP, and fuel consumption is measured through the degree of road gradient. Complexity analysis of FCVRP is presented through analogy with the capacitated VRP. To tackle the FCVRP’s computational intractability, we propose an efficient two-objective hybrid local search algorithm (TOHLS. TOHLS is based on a hybrid local search algorithm (HLS that is also used to solve FCVRP. Based on the Golden CVRP benchmarks, 60 FCVRP instances are generated and tested. Finally, the computational results show that the proposed TOHLS significantly outperforms the HLS.

  13. An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems

    Science.gov (United States)

    Sitopu, Joni Wilson; Mawengkang, Herman; Syafitri Lubis, Riri

    2018-01-01

    The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.

  14. EDUCATION AND CULTURE (CONCERNING THE PROBLEM IN SEARCH THE PRINCIPLE OF EDUCATION ADEQUACY)

    OpenAIRE

    Elena N. Yarkova

    2015-01-01

    This article develops a theme raised in the study «Education in Search of the Adequacy principle» by Yu. V. Larin, whereas the topical principle of modern education is the principle of cultural adequacy.The aim of the study is the analysis of value-semantic content of the principle of cultural adequacy of education. Methods of the study are formed by appeal to cultural approach connecting methods of ideal typing and value-semantic reconstruction.Results. In general, there are three types of c...

  15. Random searching

    International Nuclear Information System (INIS)

    Shlesinger, Michael F

    2009-01-01

    There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.

  16. A Power Electronic and Drives Curriculum with Project-oriented and Problem-based Learning: A Dynamic Teaching Approach for the Future

    DEFF Research Database (Denmark)

    Blaabjerg, Frede

    2002-01-01

    extra study time. This paper present a teaching approach which makes it possible very fast for the student to get in-depth skills in this important area which is the problem-oriented and project-based learning. The trend and application of power electronics are illustrated. The necessary skills...... for power electronic engineers are outlined followed up by a discussion on how problem-oriented and project-based learning are implemented. A complete curriculum at Aalborg University is presented where different power electronics related projects at different study levels are carried out....

  17. A modified Symbiotic Organisms Search algorithm for large scale economic dispatch problem with valve-point effects

    International Nuclear Information System (INIS)

    Secui, Dinu Calin

    2016-01-01

    This paper proposes a new metaheuristic algorithm, called Modified Symbiotic Organisms Search (MSOS) algorithm, to solve the economic dispatch problem considering the valve-point effects, the prohibited operating zones (POZ), the transmission line losses, multi-fuel sources, as well as other operating constraints of the generating units and power system. The MSOS algorithm introduces, in all of its phases, new relations to update the solutions to improve its capacity of identifying stable and of high-quality solutions in a reasonable time. Furthermore, to increase the capacity of exploring the MSOS algorithm in finding the most promising zones, it is endowed with a chaotic component generated by the Logistic map. The performance of the modified algorithm and of the original algorithm Symbiotic Organisms Search (SOS) is tested on five systems of different characteristics, constraints and dimensions (13-unit, 40-unit, 80-unit, 160-unit and 320-unit). The results obtained by applying the proposed algorithm (MSOS) show that this has a better performance than other techniques of optimization recently used in solving the economic dispatch problem with valve-point effects. - Highlights: • A new modified SOS algorithm (MSOS) is proposed to solve the EcD problem. • Valve-point effects, ramp-rate limits, POZ, multi-fuel sources, transmission losses were considered. • The algorithm is tested on five systems having 13, 40, 80, 160 and 320 thermal units. • MSOS algorithm outperforms many other optimization techniques.

  18. Hybridization of Sensing Methods of the Search Domain and Adaptive Weighted Sum in the Pareto Approximation Problem

    Directory of Open Access Journals (Sweden)

    A. P. Karpenko

    2015-01-01

    Full Text Available We consider the relatively new and rapidly developing class of methods to solve a problem of multi-objective optimization, based on the preliminary built finite-dimensional approximation of the set, and thereby, the Pareto front of this problem as well. The work investigates the efficiency of several modifications of the method of adaptive weighted sum (AWS. This method proposed in the paper of Ryu and Kim Van (JH. Ryu, S. Kim, H. Wan is intended to build Pareto approximation of the multi-objective optimization problem.The AWS method uses quadratic approximation of the objective functions in the current sub-domain of the search space (the area of trust based on the gradient and Hessian matrix of the objective functions. To build the (quadratic meta objective functions this work uses methods of the experimental design theory, which involves calculating the values of these functions in the grid nodes covering the area of trust (a sensing method of the search domain. There are two groups of the sensing methods under consideration: hypercube- and hyper-sphere-based methods. For each of these groups, a number of test multi-objective optimization tasks has been used to study the efficiency of the following grids: "Latin Hypercube"; grid, which is uniformly random for each measurement; grid, based on the LP  sequences.

  19. An opposition-based harmony search algorithm for engineering optimization problems

    Directory of Open Access Journals (Sweden)

    Abhik Banerjee

    2014-03-01

    Full Text Available Harmony search (HS is a derivative-free real parameter optimization algorithm. It draws inspiration from the musical improvisation process of searching for a perfect state of harmony. The proposed opposition-based HS (OHS of the present work employs opposition-based learning for harmony memory initialization and also for generation jumping. The concept of opposite number is utilized in OHS to improve the convergence rate of the HS algorithm. The potential of the proposed algorithm is assessed by means of an extensive comparative study of the numerical results on sixteen benchmark test functions. Additionally, the effectiveness of the proposed algorithm is tested for reactive power compensation of an autonomous power system. For real-time reactive power compensation of the studied model, Takagi Sugeno fuzzy logic (TSFL is employed. Time-domain simulation reveals that the proposed OHS-TSFL yields on-line, off-nominal model parameters, resulting in real-time incremental change in terminal voltage response profile.

  20. Causation in the law of state responsibility and the problem of overdetermination : In search for clarity

    NARCIS (Netherlands)

    Plakokefalos, I.

    2015-01-01

    This article addresses the preliminary steps that must be taken in order to study the problems stemming from overdetermination in the law of state responsibility. Overdetermination, broadly defined, is the existence of multiple causes (multiple wrongdoers, external natural causes, contribution to

  1. Inequality--"Wicked Problems", Labour Market Outcomes and the Search for Silver Bullets

    Science.gov (United States)

    Keep, Ewart; Mayhew, Ken

    2014-01-01

    In recent years concerns about inequality have been growing in prominence within UK policy debates. The many causes of inequality of earnings and income are complex in their interactions and their tendency to reinforce one another. This makes inequality an intractable or "wicked" policy problem, particularly within a contemporary context…

  2. A manufacturing problem solving environment combining evaluation, search, and generalisation methods

    NARCIS (Netherlands)

    Caskey, K.R.

    2001-01-01

    This paper develops a general environment for suggesting good operating strategies for specific factory conditions at the time the strategies are needed. The characteristics of the problems addressed do not allow analysis of the alternatives at the time the suggestions are needed. This requires the

  3. A trial of patient-oriented problem-solving system for immunology teaching in China: a comparison with dialectic lectures

    Science.gov (United States)

    2013-01-01

    Background The most common teaching method used in China is lecturing, but recently, efforts have been widely undertaken to promote the transition from teacher-centered to student-centered education. The patient-oriented problem-solving (POPS) system is an innovative teaching-learning method that permits students to work in small groups to solve clinical problems, promotes self-learning, encourages clinical reasoning and develops long-lasting memory. To our best knowledge, however, POPS has never been applied in teaching immunology in China. The aim of this study was to develop POPS in teaching immunology and assess students’ and teachers’ perception to POPS. Methods 321 second-year medical students were divided into two groups: I and II. Group I, comprising 110 students, was taught by POPS, and 16 immunology teachers witnessed the whole teaching process. Group II including the remaining 211 students was taught through traditional lectures. The results of the pre- and post-test of both groups were compared. Group I students and teachers then completed a self-structured feedback questionnaire for analysis before a discussion meeting attended only by the teachers was held. Results Significant improvement in the mean difference between the pre- and post-test scores of those in Groups I and II was seen, demonstrating the effectiveness of POPS teaching. Most students responded that POPS facilitates self-learning, helps them to understand topics and creates interest, and 88.12% of students favored POPS over simple lectures. Moreover, while they responded that POPS facilitated student learning better than lectures, teachers pointed out that limited teaching resources would make it difficult for wide POPS application in China. Conclusions While POPS can break up the monotony of dialectic lectures and serve as a better teaching method, it may not be feasible for the current educational environment in China. The main reason for this is the relative shortage of teaching

  4. A trial of patient-oriented problem-solving system for immunology teaching in China: a comparison with dialectic lectures.

    Science.gov (United States)

    Zhang, Zhiren; Liu, Wei; Han, Junfeng; Guo, Sheng; Wu, Yuzhang

    2013-01-28

    The most common teaching method used in China is lecturing, but recently, efforts have been widely undertaken to promote the transition from teacher-centered to student-centered education. The patient-oriented problem-solving (POPS) system is an innovative teaching-learning method that permits students to work in small groups to solve clinical problems, promotes self-learning, encourages clinical reasoning and develops long-lasting memory. To our best knowledge, however, POPS has never been applied in teaching immunology in China. The aim of this study was to develop POPS in teaching immunology and assess students' and teachers' perception to POPS. 321 second-year medical students were divided into two groups: I and II. Group I, comprising 110 students, was taught by POPS, and 16 immunology teachers witnessed the whole teaching process. Group II including the remaining 211 students was taught through traditional lectures. The results of the pre- and post-test of both groups were compared. Group I students and teachers then completed a self-structured feedback questionnaire for analysis before a discussion meeting attended only by the teachers was held. Significant improvement in the mean difference between the pre- and post-test scores of those in Groups I and II was seen, demonstrating the effectiveness of POPS teaching. Most students responded that POPS facilitates self-learning, helps them to understand topics and creates interest, and 88.12% of students favored POPS over simple lectures. Moreover, while they responded that POPS facilitated student learning better than lectures, teachers pointed out that limited teaching resources would make it difficult for wide POPS application in China. While POPS can break up the monotony of dialectic lectures and serve as a better teaching method, it may not be feasible for the current educational environment in China. The main reason for this is the relative shortage of teaching resources such as space, library facilities

  5. Solving the wind farm layout optimization problem using random search algorithm

    DEFF Research Database (Denmark)

    Feng, Ju; Shen, Wen Zhong

    2015-01-01

    , in which better results than the genetic algorithm (GA) and the old version of the RS algorithm are obtained. Second it is applied to the Horns Rev 1 WF, and the optimized layouts obtain a higher power production than its original layout, both for the real scenario and for two constructed scenarios......Wind farm (WF) layout optimization is to find the optimal positions of wind turbines (WTs) inside a WF, so as to maximize and/or minimize a single objective or multiple objectives, while satisfying certain constraints. In this work, a random search (RS) algorithm based on continuous formulation....... In this application, it is also found that in order to get consistent and reliable optimization results, up to 360 or more sectors for wind direction have to be used. Finally, considering the inevitable inter-annual variations in the wind conditions, the robustness of the optimized layouts against wind condition...

  6. Theoretical Investigation of Combined Use of PSO, Tabu Search and Lagrangian Relaxation methods to solve the Unit Commitment Problem

    Directory of Open Access Journals (Sweden)

    Sahbi Marrouchi

    2018-02-01

    Full Text Available Solving the Unit Commitment problem (UCP optimizes the combination of production units operations and determines the appropriate operational scheduling of each production units to satisfy the expected consumption which varies from one day to one month. Besides, each production unit is conducted to constraints that render this problem complex, combinatorial and nonlinear. In this paper, we proposed a new strategy based on the combination three optimization methods: Tabu search, Particle swarm optimization and Lagrangian relaxation methods in order to develop a proper unit commitment scheduling of the production units while reducing the production cost during a definite period. The proposed strategy has been implemented on a the IEEE 9 bus test system containing 3 production unit and the results were promising compared to strategies based on meta-heuristic and deterministic methods.

  7. Cuckoo Search with flight of Levy applied to the problem of reload of fuels in nuclear reactors

    International Nuclear Information System (INIS)

    Silva, Patrick V.; Nast, Fernando N.; Schirru, Roberto; Meneses, Anderson A.M.; Coordenacao de Pos-Graduacao e Pesquisa de Engenharia

    2017-01-01

    Intra-Nuclear Fuel Management Optimization is a complex combinatorial problem of the NP-difficult type, associated with the refueling process of a nuclear reactor, which aims to extend the cycle of operation by determining loading patterns, obeying safety margins. In addition to the combinatorial problem, we have the aspect of calculations of reactor physics, which increases the difficult of OGCIN. Methods that are proving effective when applied to OGCIN are the algorithms belonging to the swarm intelligence paradigm. A new member of this paradigm is Cuckoo Search (CS), which has shown results promising when applied to optimization issues. The CS is based on the litter parasitism of some cuckoo species combined with the Levy flight behavior of some birds. In the present work we present the results of the application of CS to OGCIN, and compare them to the results obtained by the application of ABC

  8. A Hybrid Method for the Modelling and Optimisation of Constrained Search Problems

    Directory of Open Access Journals (Sweden)

    Sitek Pawel

    2014-08-01

    Full Text Available The paper presents a concept and the outline of the implementation of a hybrid approach to modelling and solving constrained problems. Two environments of mathematical programming (in particular, integer programming and declarative programming (in particular, constraint logic programming were integrated. The strengths of integer programming and constraint logic programming, in which constraints are treated in a different way and different methods are implemented, were combined to use the strengths of both. The hybrid method is not worse than either of its components used independently. The proposed approach is particularly important for the decision models with an objective function and many discrete decision variables added up in multiple constraints. To validate the proposed approach, two illustrative examples are presented and solved. The first example is the authors’ original model of cost optimisation in the supply chain with multimodal transportation. The second one is the two-echelon variant of the well-known capacitated vehicle routing problem.

  9. Heuristic methods using grasp, path relinking and variable neighborhood search for the clustered traveling salesman problem

    Directory of Open Access Journals (Sweden)

    Mário Mestria

    2013-08-01

    Full Text Available The Clustered Traveling Salesman Problem (CTSP is a generalization of the Traveling Salesman Problem (TSP in which the set of vertices is partitioned into disjoint clusters and objective is to find a minimum cost Hamiltonian cycle such that the vertices of each cluster are visited contiguously. The CTSP is NP-hard and, in this context, we are proposed heuristic methods for the CTSP using GRASP, Path Relinking and Variable Neighborhood Descent (VND. The heuristic methods were tested using Euclidean instances with up to 2000 vertices and clusters varying between 4 to 150 vertices. The computational tests were performed to compare the performance of the heuristic methods with an exact algorithm using the Parallel CPLEX software. The computational results showed that the hybrid heuristic method using VND outperforms other heuristic methods.

  10. Searching for optimal integer solutions to set partitioning problems using column generation

    OpenAIRE

    Bredström, David; Jörnsten, Kurt; Rönnqvist, Mikael

    2007-01-01

    We describe a new approach to produce integer feasible columns to a set partitioning problem directly in solving the linear programming (LP) relaxation using column generation. Traditionally, column generation is aimed to solve the LP relaxation as quick as possible without any concern of the integer properties of the columns formed. In our approach we aim to generate the columns forming the optimal integer solution while simultaneously solving the LP relaxation. By this we can re...

  11. An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem

    Science.gov (United States)

    2009-03-01

    cargo, and the problem therefore becomes trivial. 3. Shoring: Some cargo requires shoring which is small planks of plywood stacked on top of each...Integer Programming Method In 1989, Kevin Ng examined the bin-packing MPALP for Canada’s C-130 aircraft (Ng 1992). His goal was to move a set of... leadership & ethics [ ] warfighting [ ] international security [ ] doctrine [X] other (specify): Military Airlift

  12. The Search for the Solution of Personnel Problems of Municipal Service in the Russian Federation

    Directory of Open Access Journals (Sweden)

    Вадим Вадимович Кушнир

    2013-12-01

    Full Text Available The article is devoted to the analysis of a current state of personnel base of municipal service in Russia. The circle of the main problems is outlined, a number of effective technologies and the options promoting their permission are offered. The separate attention is paid to a question of formation of a personnel reserve of the young specialists who have ended higher educational institutions, a technique of selection of highly skilled employees.

  13. Links between Alcohol and Other Drug Problems and Maltreatment among Adolescent Girls: Perceived Discrimination, Ethnic Identity, and Ethnic Orientation as Moderators

    Science.gov (United States)

    Gray, Calonie M. K.; Montgomery, Marilyn J.

    2012-01-01

    Objectives: This study examined the links between maltreatment, posttraumatic stress symptoms, ethnicity-specific factors (i.e., perceived discrimination, ethnic identity, and ethnic orientation), and alcohol and/or other drug (AOD) problems among adolescent girls. Methods: These relations were examined using archived data from a community sample…

  14. Problem - oriented studies on plant - soil - water relations : sowing strategies for maize in rainfed agriculture in Southern Mozambique : water management in bog relicts in the Netherlands

    NARCIS (Netherlands)

    Schouwenaars, J.M.

    1990-01-01

    Plant-soil-water models are applied in two case studies. Attention is given to the desired level of accuracy in (agro-)hydrological. research when applied in problem-oriented studies. In the case studies it is shown that when decision criteria are only roughly known and when only

  15. Research-Based Development of a Lesson Plan on Shower Gels and Musk Fragrances Following a Socio-Critical and Problem-Oriented Approach to Chemistry Teaching

    Science.gov (United States)

    Marks, Ralf; Eilks, Ingo

    2010-01-01

    A case is described of the development of a lesson plan for 10th grade (age range 15-16) chemistry classes on the chemistry of shower gels. The lesson plan follows a socio-critical and problem-oriented approach to chemistry teaching. This means that, aside from learning about the basic chemistry of the components making up modern shower gels in…

  16. Way Search to Research: from Academic Exercises in Architecture to Scientific Investigations into Actual Problems

    Directory of Open Access Journals (Sweden)

    Gintaras Stauskis

    2012-05-01

    Full Text Available Abstract. An interest in doctoral studies reflects the overall status of the scientist in the country in general and the role of science in the architect profession in particular. The article analyses the basic channels of how the students of architecture search for and find the ways to transfer themselves from the study area into an academic research environment. In order to figure out general trends and to outline the differences and similarities of doctoral studies that could further facilitate cooperation, the paper presents the thematic outputs of doctoral programmes in architecture schools in Vilnius, Riga, Venice, Jelgava and Weimar. With reference to the example of the Faculty of Architecture, VGTU, the trends towards developing research activities are analysed taking into account three interconnected branches of architecture: urban design, building architecture and landscape architecture. The cooperation and coordination of academic and research activities in wider European space is taking place upon common interest based on the specificities of each school and priorities of the chosen region. The awareness of global and regional processes in architectural research is an important point for the present and coming generations of researchers in Europe as they are building their careers on the basis of investigation into the options of the local applications of global competences in a cross-professional and inter-disciplinary way.

  17. Social learning solves the problem of narrow-peaked search landscapes: experimental evidence in humans.

    Science.gov (United States)

    Acerbi, Alberto; Tennie, Claudio; Mesoudi, Alex

    2016-09-01

    The extensive use of social learning is considered a major reason for the ecological success of humans. Theoretical considerations, models and experiments have explored the evolutionary basis of social learning, showing the conditions under which learning from others is more adaptive than individual learning. Here we present an extension of a previous experimental set-up, in which individuals go on simulated 'hunts' and their success depends on the features of a 'virtual arrowhead' they design. Individuals can modify their arrowhead either by individual trial and error or by copying others. We study how, in a multimodal adaptive landscape, the smoothness of the peaks influences learning. We compare narrow peaks, in which solutions close to optima do not provide useful feedback to individuals, to wide peaks, where smooth landscapes allow an effective hill-climbing individual learning strategy. We show that individual learning is more difficult in narrow-peaked landscapes, but that social learners perform almost equally well in both narrow- and wide-peaked search spaces. There was a weak trend for more copying in the narrow than wide condition, although as in previous experiments social information was generally underutilized. Our results highlight the importance of tasks' design space when studying the adaptiveness of high-fidelity social learning.

  18. Incremental artificial bee colony with local search to economic dispatch problem with ramp rate limits and prohibited operating zones

    International Nuclear Information System (INIS)

    Özyön, Serdar; Aydin, Doğan

    2013-01-01

    Highlights: ► Prohibited operating zone economic dispatch problem has been solved by IABC-LS. ► The losses used in the solution of the problem have been computed by B-loss matrix. ► IABC-LS method has been applied to three test systems in literature. ► The values obtained by IABC and IABC-LS are better than the results in literature. - Abstract: In this study, prohibited operating zone economic power dispatch problem which considers ramp rate limit, has been solved by incremental artificial bee colony algorithm (IABC) and incremental artificial bee colony algorithm with local search (IABC-LS) methods. The transmission line losses used in the solution of the problem have been computed by B-loss matrix. IABC, IABC-LS methods have been applied to three different test systems in literature which consist of 6, 15 and 40 generators. The attained optimum solution values have been compared with the optimum results in literature and have been discussed.

  19. 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.

  20. Does despotic behavior or food search explain the occurrence of problem brown bears in Europe?

    OpenAIRE

    Elfström, Marcus; Zedrosser, Andreas; Jerina, Klemen; Støen, Ole-Gunnar; Kindberg, Jonas; Budic, Lara; Jonozovic, Marko; Swenson, Jon

    2014-01-01

    Bears foraging near human developments are often presumed to be responding to food shortage, but this explanation ignores social factors, in particular despotism in bears. We analyzed the age distribution and body condition index (BCI) of shot brown bears in relation to densities of bears and people, and whether the shot bears were killed by managers (i.e., problem bears; n = 149), in self-defense (n = 51), or were hunter-killed nonproblem bears (n = 1,896) during 1990–2010. We compared patte...

  1. Resolución del Response Time Variability Problem mediante tabu search

    OpenAIRE

    Corominas Subias, Albert; García Villoria, Alberto; Pastor Moreno, Rafael

    2009-01-01

    El Response Time Variability Problem (RTVP) es un problema combinatorio de scheduling publicado recientemente en la literatura. Dicho problema de optimización combinatoria es muy fácil de formular pero muy difícil de resolver de forma exacta (es NP-hard). El RTVP se presenta cuando productos, clientes o tareas se han de secuenciar minimizando la variabilidad entre los instantes de tiempo en los que reciben los recursos que ellos necesitan. Este problema tiene una gran cantidad de aplicaciones...

  2. Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem

    Directory of Open Access Journals (Sweden)

    J.D. Quintana

    2016-12-01

    Full Text Available Over the years, there has been an evolution in the manner in which we perform traditional tasks. Nowadays, almost every simple action that we can think about involves the connection among two or more devices. It is desirable to have a high quality connection among devices, by using electronic or optical signals. Therefore, it is really important to have a reliable connection among terminals in the network. However, the transmission of the signal deteriorates when increasing the distance among devices. There exists a special piece of equipment that we can deploy in a network, called regenerator, which is able to restore the signal transmitted through it, in order to maintain its quality. Deploying a regenerator in a network is generally expensive, so it is important to minimize the number of regenerators used. In this paper we focus on the Generalized Regenerator Location Problem (GRLP, which tries to innd the minimum number of regenerators that must be deployed in a network in order to have a reliable communication without loss of quality. We present a GRASP metaheuristic in order to innd good solutions for the GRLP. The results obtained by the proposal are compared with the best previous methods for this problem. We conduct an extensive computational experience with 60 large and challenging instances, emerging the proposed method as the best performing one. This fact is innally supported by non-parametric statistical tests.

  3. Exploring L1 model space in search of conductivity bounds for the MT problem

    Science.gov (United States)

    Wheelock, B. D.; Parker, R. L.

    2013-12-01

    Geophysical inverse problems of the type encountered in electromagnetic techniques are highly non-unique. As a result, any single inverted model, though feasible, is at best inconclusive and at worst misleading. In this paper, we use modified inversion methods to establish bounds on electrical conductivity within a model of the earth. Our method consists of two steps, each making use of the 1-norm in model regularization. Both 1-norm minimization problems are framed without approximation as non-negative least-squares (NNLS) problems. First, we must identify a parsimonious set of regions within the model for which upper and lower bounds on average conductivity will be sought. This is accomplished by minimizing the 1-norm of spatial variation, which produces a model with a limited number of homogeneous regions; in fact, the number of homogeneous regions will never be greater than the number of data, regardless of the number of free parameters supplied. The second step establishes bounds for each of these regions with pairs of inversions. The new suite of inversions also uses a 1-norm penalty, but applied to the conductivity values themselves, rather than the spatial variation thereof. In the bounding step we use the 1-norm of our model parameters because it is proportional to average conductivity. For a lower bound on average conductivity, the 1-norm within a bounding region is minimized. For an upper bound on average conductivity, the 1-norm everywhere outside a bounding region is minimized. The latter minimization has the effect of concentrating conductance into the bounding region. Taken together, these bounds are a measure of the uncertainty in the associated region of our model. Starting with a blocky inverse solution is key in the selection of the bounding regions. Of course, there is a tradeoff between resolution and uncertainty: an increase in resolution (smaller bounding regions), results in greater uncertainty (wider bounds). Minimization of the 1-norm of

  4. LETTER TO THE EDITOR: Constant-time solution to the global optimization problem using Brüschweiler's ensemble search algorithm

    Science.gov (United States)

    Protopopescu, V.; D'Helon, C.; Barhen, J.

    2003-06-01

    A constant-time solution of the continuous global optimization problem (GOP) is obtained by using an ensemble algorithm. We show that under certain assumptions, the solution can be guaranteed by mapping the GOP onto a discrete unsorted search problem, whereupon Brüschweiler's ensemble search algorithm is applied. For adequate sensitivities of the measurement technique, the query complexity of the ensemble search algorithm depends linearly on the size of the function's domain. Advantages and limitations of an eventual NMR implementation are discussed.

  5. EDUCATION AND CULTURE (CONCERNING THE PROBLEM IN SEARCH THE PRINCIPLE OF EDUCATION ADEQUACY

    Directory of Open Access Journals (Sweden)

    Elena N. Yarkova

    2015-01-01

    Full Text Available This article develops a theme raised in the study «Education in Search of the Adequacy principle» by Yu. V. Larin, whereas the topical principle of modern education is the principle of cultural adequacy.The aim of the study is the analysis of value-semantic content of the principle of cultural adequacy of education. Methods of the study are formed by appeal to cultural approach connecting methods of ideal typing and value-semantic reconstruction.Results. In general, there are three types of culture based on the explication of the three modality human relations to the world: «the world is a condition», «the world is a tool», «the world is a purpose»; and, accordingly, three types of pedagogical culture: traditional, utilitarian, creative.Traditional pedagogical culture focuses on education homo traditional – traditional man, the individual, the obedient executor of the culture value semantic, regulatory policies and regulations, subordinating its activity transmitted from generation to generation tradition. The semantic space of traditional pedagogical culture principle of cultural adequacy education is defined as the principle of consistency with established tradition.Pedagogical culture of utilitarian type directs a homo utilitarian – utilitarian man, individuality, interpreting the culture value semantic, legal and regulatory requirements and on the basis of situational use, fully to the publication of his life publicly or individually beneficial activities. The utilitarian type principle of cultural adequacy of education is defined as the principle of consistency with the social and/or individual use in the semantic space of pedagogical culture.Pedagogical culture of creative types is aimed at nurturing homo creator – creative person whose existence is self-organization in the space between tradition and innovation, absolute and relative, universal and particular meanings of human existence, between social and individual

  6. A trial of patient-oriented problem-solving system for immunology teaching in China: a comparison with dialectic lectures

    Directory of Open Access Journals (Sweden)

    Zhang Zhiren

    2013-01-01

    Full Text Available Abstract Background The most common teaching method used in China is lecturing, but recently, efforts have been widely undertaken to promote the transition from teacher-centered to student-centered education. The patient-oriented problem-solving (POPS system is an innovative teaching-learning method that permits students to work in small groups to solve clinical problems, promotes self-learning, encourages clinical reasoning and develops long-lasting memory. To our best knowledge, however, POPS has never been applied in teaching immunology in China. The aim of this study was to develop POPS in teaching immunology and assess students’ and teachers’ perception to POPS. Methods 321 second-year medical students were divided into two groups: I and II. Group I, comprising 110 students, was taught by POPS, and 16 immunology teachers witnessed the whole teaching process. Group II including the remaining 211 students was taught through traditional lectures. The results of the pre- and post-test of both groups were compared. Group I students and teachers then completed a self-structured feedback questionnaire for analysis before a discussion meeting attended only by the teachers was held. Results Significant improvement in the mean difference between the pre- and post-test scores of those in Groups I and II was seen, demonstrating the effectiveness of POPS teaching. Most students responded that POPS facilitates self-learning, helps them to understand topics and creates interest, and 88.12% of students favored POPS over simple lectures. Moreover, while they responded that POPS facilitated student learning better than lectures, teachers pointed out that limited teaching resources would make it difficult for wide POPS application in China. Conclusions While POPS can break up the monotony of dialectic lectures and serve as a better teaching method, it may not be feasible for the current educational environment in China. The main reason for this is the

  7. Universal approximators for multi-objective direct policy search in water reservoir management problems: a comparative analysis

    Science.gov (United States)

    Giuliani, Matteo; Mason, Emanuele; Castelletti, Andrea; Pianosi, Francesca

    2014-05-01

    The optimal operation of water resources systems is a wide and challenging problem due to non-linearities in the model and the objectives, high dimensional state-control space, and strong uncertainties in the hydroclimatic regimes. The application of classical optimization techniques (e.g., SDP, Q-learning, gradient descent-based algorithms) is strongly limited by the dimensionality of the system and by the presence of multiple, conflicting objectives. This study presents a novel approach which combines Direct Policy Search (DPS) and Multi-Objective Evolutionary Algorithms (MOEAs) to solve high-dimensional state and control space problems involving multiple objectives. DPS, also known as parameterization-simulation-optimization in the water resources literature, is a simulation-based approach where the reservoir operating policy is first parameterized within a given family of functions and, then, the parameters optimized with respect to the objectives of the management problem. The selection of a suitable class of functions to which the operating policy belong to is a key step, as it might restrict the search for the optimal policy to a subspace of the decision space that does not include the optimal solution. In the water reservoir literature, a number of classes have been proposed. However, many of these rules are based largely on empirical or experimental successes and they were designed mostly via simulation and for single-purpose reservoirs. In a multi-objective context similar rules can not easily inferred from the experience and the use of universal function approximators is generally preferred. In this work, we comparatively analyze two among the most common universal approximators: artificial neural networks (ANN) and radial basis functions (RBF) under different problem settings to estimate their scalability and flexibility in dealing with more and more complex problems. The multi-purpose HoaBinh water reservoir in Vietnam, accounting for hydropower

  8. The effect of the fragmentation problem in decision tree learning applied to the search for single top quark production

    International Nuclear Information System (INIS)

    Vilalta, R; Ocegueda-Hernandez, F; Valerio, R; Watts, G

    2010-01-01

    Decision tree learning constitutes a suitable approach to classification due to its ability to partition the variable space into regions of class-uniform events, while providing a structure amenable to interpretation, in contrast to other methods such as neural networks. But an inherent limitation of decision tree learning is the progressive lessening of the statistical support of the final classifier as clusters of single-class events are split on every partition, a problem known as the fragmentation problem. We describe a software system called DTFE, for Decision Tree Fragmentation Evaluator, that measures the degree of fragmentation caused by a decision tree learner on every event cluster. Clusters are found through a decomposition of the data using a technique known as Spectral Clustering. Each cluster is analyzed in terms of the number and type of partitions induced by the decision tree. Our domain of application lies on the search for single top quark production, a challenging problem due to large and similar backgrounds, low energetic signals, and low number of jets. The output of the machine-learning software tool consists of a series of statistics describing the degree of data fragmentation.

  9. A Phenomena-Oriented Environment for Teaching Process Modeling: Novel Modeling Software and Its Use in Problem Solving.

    Science.gov (United States)

    Foss, Alan S.; Geurts, Kevin R.; Goodeve, Peter J.; Dahm, Kevin D.; Stephanopoulos, George; Bieszczad, Jerry; Koulouris, Alexandros

    1999-01-01

    Discusses a program that offers students a phenomenon-oriented environment expressed in the fundamental concepts and language of chemical engineering such as mass and energy balancing, phase equilibria, reaction stoichiometry and rate, modes of heat, and species transport. (CCM)

  10. A New Approach to Reducing Search Space and Increasing Efficiency in Simulation Optimization Problems via the Fuzzy-DEA-BCC

    Directory of Open Access Journals (Sweden)

    Rafael de Carvalho Miranda

    2014-01-01

    Full Text Available The development of discrete-event simulation software was one of the most successful interfaces in operational research with computation. As a result, research has been focused on the development of new methods and algorithms with the purpose of increasing simulation optimization efficiency and reliability. This study aims to define optimum variation intervals for each decision variable through a proposed approach which combines the data envelopment analysis with the Fuzzy logic (Fuzzy-DEA-BCC, seeking to improve the decision-making units’ distinction in the face of uncertainty. In this study, Taguchi’s orthogonal arrays were used to generate the necessary quantity of DMUs, and the output variables were generated by the simulation. Two study objects were utilized as examples of mono- and multiobjective problems. Results confirmed the reliability and applicability of the proposed method, as it enabled a significant reduction in search space and computational demand when compared to conventional simulation optimization techniques.

  11. An improved Pattern Search based algorithm to solve the Dynamic Economic Dispatch problem with valve-point effect

    International Nuclear Information System (INIS)

    Alsumait, J.S.; Qasem, M.; Sykulski, J.K.; Al-Othman, A.K.

    2010-01-01

    In this paper, an improved algorithm based on Pattern Search method (PS) to solve the Dynamic Economic Dispatch is proposed. The algorithm maintains the essential unit ramp rate constraint, along with all other necessary constraints, not only for the time horizon of operation (24 h), but it preserves these constraints through the transaction period to the next time horizon (next day) in order to avoid the discontinuity of the power system operation. The Dynamic Economic and Emission Dispatch problem (DEED) is also considered. The load balance constraints, operating limits, valve-point loading and network losses are included in the models of both DED and DEED. The numerical results clarify the significance of the improved algorithm and verify its performance.

  12. The Influence of Emotional Difficulty, Parent-Child Relationship, Peer Relationships, Materially-Oriented and Appearance-Oriented Attitudes on Adolescent Problem Behavior

    Science.gov (United States)

    Bae, Sung Man

    2016-01-01

    This study explored predictors of adolescent problem behavior utilizing panel data from the National Youth Policy Institute. Data were collected from June 2013 to August 2013 from 3195 middle school students living in 15 cities of South Korea. Data were analysed using hierarchical regression in two steps. The first step included gender and school…

  13. A tabu search evalutionary algorithm for multiobjective optimization: Application to a bi-criterion aircraft structural reliability problem

    Science.gov (United States)

    Long, Kim Chenming

    Real-world engineering optimization problems often require the consideration of multiple conflicting and noncommensurate objectives, subject to nonconvex constraint regions in a high-dimensional decision space. Further challenges occur for combinatorial multiobjective problems in which the decision variables are not continuous. Traditional multiobjective optimization methods of operations research, such as weighting and epsilon constraint methods, are ill-suited to solving these complex, multiobjective problems. This has given rise to the application of a wide range of metaheuristic optimization algorithms, such as evolutionary, particle swarm, simulated annealing, and ant colony methods, to multiobjective optimization. Several multiobjective evolutionary algorithms have been developed, including the strength Pareto evolutionary algorithm (SPEA) and the non-dominated sorting genetic algorithm (NSGA), for determining the Pareto-optimal set of non-dominated solutions. Although numerous researchers have developed a wide range of multiobjective optimization algorithms, there is a continuing need to construct computationally efficient algorithms with an improved ability to converge to globally non-dominated solutions along the Pareto-optimal front for complex, large-scale, multiobjective engineering optimization problems. This is particularly important when the multiple objective functions and constraints of the real-world system cannot be expressed in explicit mathematical representations. This research presents a novel metaheuristic evolutionary algorithm for complex multiobjective optimization problems, which combines the metaheuristic tabu search algorithm with the evolutionary algorithm (TSEA), as embodied in genetic algorithms. TSEA is successfully applied to bicriteria (i.e., structural reliability and retrofit cost) optimization of the aircraft tail structure fatigue life, which increases its reliability by prolonging fatigue life. A comparison for this

  14. Mothers' power assertion; children's negative, adversarial orientation; and future behavior problems in low-income families: early maternal responsiveness as a moderator of the developmental cascade.

    Science.gov (United States)

    Kim, Sanghag; Kochanska, Grazyna

    2015-02-01

    Parental power assertion, a key dimension of family environment, generally sets in motion detrimental developmental cascades; however, evidence suggests that other qualities of parenting, such as responsiveness, can significantly moderate those processes. Mechanisms that account for such moderating effects are not fully understood. We propose a conceptual model of processes linking parental power assertion, parental responsiveness, children's negative, adversarial, rejecting orientation toward the parent, and behavior problems. We test that model in a short-term longitudinal design involving 186 low-income, ethnically diverse mothers and their toddlers. When children were 30 months, the dyads were observed in multiple, lengthy, naturalistic laboratory interactions to assess behaviorally mothers' responsiveness and their power-assertive control style. At 33 months, we observed behavioral indicators of children's negative, adversarial, rejecting orientation toward the mothers in several naturalistic and standardized paradigms. At 40 months, mothers rated children's behavior problems. The proposed moderated mediation sequence, tested using a new approach, PROCESS (Hayes, 2013), was supported. The indirect effect from maternal power assertion to children's negative, adversarial orientation to future behavior problems was present when mothers' responsiveness was either low or average but absent when mothers were highly responsive. This study elucidates a potential process that may link parental power assertion with behavior problems and highlights how positive aspects of parenting can moderate this process and defuse maladaptive developmental cascades. It also suggests possible targets for parenting intervention and prevention efforts. PsycINFO Database Record (c) 2015 APA, all rights reserved.

  15. Mothers’ Power Assertion, Children’s Negative, Adversarial Orientation, and Future Behavior Problems in Low-Income Families: Early Maternal Responsiveness as a Moderator of the Developmental Cascade

    Science.gov (United States)

    Kim, Sanghag; Kochanska, Grazyna

    2014-01-01

    Parental power assertion, a key dimension of family environment, generally sets in motion detrimental developmental cascades; however, evidence suggests that other qualities of parenting, such as responsiveness, can significantly moderate those processes. Mechanisms that account for such moderating effects are not fully understood. We propose a conceptual model of processes linking parental power assertion, parental responsiveness, children’s negative, adversarial, rejecting orientation toward the parent, and behavior problems. We test that model in a short-term longitudinal design involving 186 low-income, ethnically diverse mothers and their toddlers. When children were 30 months, the dyads were observed in multiple, lengthy, naturalistic laboratory interactions to assess behaviorally mothers’ responsiveness and their power-assertive control style. At 33 months, we observed behavioral indicators of children’s negative, adversarial, rejecting orientation toward the mothers in several naturalistic and standardized paradigms. At 40 months, mothers rated children’s behavior problems. The proposed moderated mediation sequence, tested using a new approach, PROCESS (Hayes, 2013), was supported. The indirect effect from maternal power assertion to children’s negative, adversarial orientation to future behavior problems was present when mothers’ responsiveness was either low or average but absent when mothers were highly responsive. This study elucidates a potential process that may link parental power assertion with behavior problems and highlights how positive aspects of parenting can moderate this process and defuse maladaptive developmental cascades. It also suggests possible targets for parenting intervention and prevention efforts. PMID:25401483

  16. Autonomous search

    CERN Document Server

    Hamadi, Youssef; Saubion, Frédéric

    2012-01-01

    Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.

  17. Effect of Means of Problem-Oriented Physical Rehabilitation on Pain and Tactile Sensitivity and Pain Syndrome Intensity in Women with Post-Mastectomy Syndrome

    Directory of Open Access Journals (Sweden)

    Т. Є. Одинець

    2015-03-01

    Full Text Available The objective of the paper is to determine the effectiveness of problem-oriented physical rehabilitation of women with post-mastectomy syndrome in terms of normalization of their sensitivity and lessening of the pain syndrome. Materials and methods. The paper provides a review of the related literary sources and empirical data analyzed and summarized, offers definitions of pain by the Visual Analogue Scale, McGill Pain Questionnaire and the Verbal Rating Scale, evaluates tactile and pain sensitivity, and uses the methods of mathematical statistics. The participants in the study were 50 women with diagnosed with the post-mastectomy syndrome and at the stage of residential treatment. Results: The developed problem-oriented physical rehabilitation experimentally proved effective by showing improvements in tactile and pain sensitivity, and pain lessening by the sensory, affective and rating scales in women with post-mastectomy syndrome at the stage of residential treatment.

  18. Problem-Based Project-Oriented Learning: Educating and evaluating for new disciplines emerging in the interplay between the professions of civil engineering and architecture

    DEFF Research Database (Denmark)

    Mullins, Michael

    2006-01-01

    styles, which raises the question of how to assess the individual student’s learning where widely different strategies with widely differing results are employed. While offering many interesting possibilities, the integration of these historically separated disciplines embraces paradoxes...... and contradictions reflected in the differences inherent in two pedagogical models used by the university, problem-based learning and project-oriented learning. However, in order for this to be adequately demonstrated, suitable forms of evaluation are necessary. A case is made for the review of assessment criteria......, and uses PBL and project-oriented models for its educational form. There is a distinct difference between engineering and architecture in their evolutionary backgrounds and their varying degree of emphasis on natural science. Both present different forms of problem solving that appeal to different learning...

  19. Time Out of Joint and Future-Oriented Memory: Engaging Dietrich Bonhoeffer in the Search for a Way to Deal Responsibly with the Ghosts of the Past

    Directory of Open Access Journals (Sweden)

    Robert Vosloo

    2017-03-01

    Full Text Available This article explores in conversation with some of the writings of Dietrich Bonhoeffer the question of how the experience of the dislocation of time and the visitation of “the ghosts of the past” (also in contexts marked by historical injustices is related to responsible ethical action. The question is also posed as to how the reconfiguration of the relationship of past, present and future functions on an implicit and explicit level in this regard. In the process, the article affirms the eschatological horizon of Bonhoeffer’s ethics and points to the importance of what is referred to as “future-oriented memory” in the search for responsible and hopeful action. The article acknowledges the dilemmas in relating thought and action (with reference to the so-called “Hamlet doctrine” and points to the way in which “the future” marks and determines Bonhoeffer’s understanding of ethical action amidst the haunting presence of the past and the experience of the present time as a “time out of joint.”

  20. Student performance and their perception of a patient-oriented problem-solving approach with audiovisual aids in teaching pathology: a comparison with traditional lectures

    OpenAIRE

    Singh, Arjun

    2010-01-01

    Arjun SinghDepartment of Pathology, Sri Venkateshwara Medical College Hospital and Research Centre, Pondicherry, IndiaPurpose: We use different methods to train our undergraduates. The patient-oriented problem-solving (POPS) system is an innovative teaching–learning method that imparts knowledge, enhances intrinsic motivation, promotes self learning, encourages clinical reasoning, and develops long-lasting memory. The aim of this study was to develop POPS in teaching pathology, asse...

  1. Validation of an adapted version of the Coping Orientations to Problems Experienced questionnaire (COPE) in the South African Police Service / Hester Antoinette Visser

    OpenAIRE

    Visser, Hester Antoinette

    2005-01-01

    Members of the SAPS come into contact with violent crimes on a daily basis. They also have to deal with changes on an organisational level, as well as large amounts of administrative work. The Coping Orientations to Problems Experienced Questionnaire (COPE) was completed by police members in the North West Province, and eight items focusing on emotion-focused coping were added. The objectives of this study were to assess the construct validity and internal consistency of the CO...

  2. Solving public passenger transportation problems: a need for policy reorientation. [Brokerage or consumer-oriented approach needed

    Energy Technology Data Exchange (ETDEWEB)

    Davis, F.W. Jr.; Oen, K.

    1977-01-01

    Public transportation has declined because policymakers and outdated regulations have restricted the evolution of transportation systems which more closely reflect the mobility and lifestyles of today. Public policy needs to take a consumer-oriented approach to public transportation by recognizing that all consumers do not have the same transportation needs and that one or two modes of transportation cannot satisfy these needs. This report argues that if public transportation is to become an efficient method of satisfying the transportation needs of a community, a brokerage or consumer-oriented approach should be adopted. The transportation broker will match specific individual needs with a broad array of transportation services, and overcome institutional, legal, and operational barriers to the development of new forms of transportation service. 51 references or footnotes.

  3. Bourbaki's structure theory in the problem of complex systems simulation models synthesis and model-oriented programming

    Science.gov (United States)

    Brodsky, Yu. I.

    2015-01-01

    The work is devoted to the application of Bourbaki's structure theory to substantiate the synthesis of simulation models of complex multicomponent systems, where every component may be a complex system itself. An application of the Bourbaki's structure theory offers a new approach to the design and computer implementation of simulation models of complex multicomponent systems—model synthesis and model-oriented programming. It differs from the traditional object-oriented approach. The central concept of this new approach and at the same time, the basic building block for the construction of more complex structures is the concept of models-components. A model-component endowed with a more complicated structure than, for example, the object in the object-oriented analysis. This structure provides to the model-component an independent behavior-the ability of standard responds to standard requests of its internal and external environment. At the same time, the computer implementation of model-component's behavior is invariant under the integration of models-components into complexes. This fact allows one firstly to construct fractal models of any complexity, and secondly to implement a computational process of such constructions uniformly-by a single universal program. In addition, the proposed paradigm allows one to exclude imperative programming and to generate computer code with a high degree of parallelism.

  4. Individual activities as an integrated part of project work - an innovative approach to project oriented and problem-based learning POPBL

    DEFF Research Database (Denmark)

    Moesby, Egon; Winther, Hans Henrik; Kørnøv, Lone

    2006-01-01

    in an individual activity to subsequently be separately assessed. The results of the individually oriented project work form the platform for final work with the project as a team. The students in each team are expected to evaluate the individual solutions and select the one solution to work on in the final phases......In this paper, the authors describe and, on the basis of a recently conducted survey, evaluate a way to increase student learning through the introduction of an individual project activity to the project oriented and problem-based and team-based project work - POPBL. This can be achieved not just...... by adding an individual activity outside or parallel to the project work, but by having the individual activity embedded as an integrated part of the overall team-based project work. In what the authors have deemed the extended project model, students work individually in the solution phase of the project...

  5. The role of pattern recognition in creative problem solving: a case study in search of new mathematics for biology.

    Science.gov (United States)

    Hong, Felix T

    2013-09-01

    Rosen classified sciences into two categories: formalizable and unformalizable. Whereas formalizable sciences expressed in terms of mathematical theories were highly valued by Rutherford, Hutchins pointed out that unformalizable parts of soft sciences are of genuine interest and importance. Attempts to build mathematical theories for biology in the past century was met with modest and sporadic successes, and only in simple systems. In this article, a qualitative model of humans' high creativity is presented as a starting point to consider whether the gap between soft and hard sciences is bridgeable. Simonton's chance-configuration theory, which mimics the process of evolution, was modified and improved. By treating problem solving as a process of pattern recognition, the known dichotomy of visual thinking vs. verbal thinking can be recast in terms of analog pattern recognition (non-algorithmic process) and digital pattern recognition (algorithmic process), respectively. Additional concepts commonly encountered in computer science, operations research and artificial intelligence were also invoked: heuristic searching, parallel and sequential processing. The refurbished chance-configuration model is now capable of explaining several long-standing puzzles in human cognition: a) why novel discoveries often came without prior warning, b) why some creators had no ideas about the source of inspiration even after the fact, c) why some creators were consistently luckier than others, and, last but not least, d) why it was so difficult to explain what intuition, inspiration, insight, hunch, serendipity, etc. are all about. The predictive power of the present model was tested by means of resolving Zeno's paradox of Achilles and the Tortoise after one deliberately invoked visual thinking. Additional evidence of its predictive power must await future large-scale field studies. The analysis was further generalized to constructions of scientific theories in general. This approach

  6. THE APPLICATION'S WAYS OF PROBLEM-ORIENTED TASKS FOR DEVELOPMENT OF EDUCATIONAL MATERIALS IN THE DISTANCE COURSE "EXPERIMENTAL PSYCHOLOGY"

    Directory of Open Access Journals (Sweden)

    M. A. Salyuk

    2009-05-01

    Full Text Available Some principles on which it is expedient to lean in the process of the development of materials of distant educational courses are considered: support on multiplicity of form of representation of information in consciousness; an account of conformity to law of maintenance of information in semantic memory of man; integration of educational information in the personal experience; orientation on the future real professional activity at the design of base of executive knowledge. Application of principles is illustrated by the examples of tasks in the distance educational course «Experimental psychology».

  7. Mechatronic control engineering and electro-mechanical system design - two mechatronic curricula at Aalborg University based on problem oriented and project based learning

    DEFF Research Database (Denmark)

    Pedersen, Henrik C.; Andersen, Torben Ole; Rasmussen, Peter Omand

    2009-01-01

    , it is addressed how a mechatronic education is structured so courses and projects are aligned, to utilize the full benefits of the Problem Oriented Project Based Learning (POPBL) system practiced at AalborgUniversity (AAU). This is followed by a presentation of the two complementary educations in Mechatronicsat...... using a subsystem based approach. The challenges related to teaching and learning mechatronics are addressed, discussing how mechatronics is typically taught around the world also illustrating the trends and applications of mechatronic engineering and research. This is followed by an outline...... Based Learning environment....

  8. HSTLBO: A hybrid algorithm based on Harmony Search and Teaching-Learning-Based Optimization for complex high-dimensional optimization problems.

    Directory of Open Access Journals (Sweden)

    Shouheng Tuo

    Full Text Available Harmony Search (HS and Teaching-Learning-Based Optimization (TLBO as new swarm intelligent optimization algorithms have received much attention in recent years. Both of them have shown outstanding performance for solving NP-Hard optimization problems. However, they also suffer dramatic performance degradation for some complex high-dimensional optimization problems. Through a lot of experiments, we find that the HS and TLBO have strong complementarity each other. The HS has strong global exploration power but low convergence speed. Reversely, the TLBO has much fast convergence speed but it is easily trapped into local search. In this work, we propose a hybrid search algorithm named HSTLBO that merges the two algorithms together for synergistically solving complex optimization problems using a self-adaptive selection strategy. In the HSTLBO, both HS and TLBO are modified with the aim of balancing the global exploration and exploitation abilities, where the HS aims mainly to explore the unknown regions and the TLBO aims to rapidly exploit high-precision solutions in the known regions. Our experimental results demonstrate better performance and faster speed than five state-of-the-art HS variants and show better exploration power than five good TLBO variants with similar run time, which illustrates that our method is promising in solving complex high-dimensional optimization problems. The experiment on portfolio optimization problems also demonstrate that the HSTLBO is effective in solving complex read-world application.

  9. Proposed declassification of disease categories related to sexual orientation in the International Statistical Classification of Diseases and Related Health Problems (ICD-11).

    Science.gov (United States)

    Cochran, Susan D; Drescher, Jack; Kismödi, Eszter; Giami, Alain; García-Moreno, Claudia; Atalla, Elham; Marais, Adele; Vieira, Elisabeth Meloni; Reed, Geoffrey M

    2014-09-01

    The World Health Organization is developing the 11th revision of the International Statistical Classification of Diseases and Related Health Problems (ICD-11), planned for publication in 2017. The Working Group on the Classification of Sexual Disorders and Sexual Health was charged with reviewing and making recommendations on disease categories related to sexuality in the chapter on mental and behavioural disorders in the 10th revision (ICD-10), published in 1990. This chapter includes categories for diagnoses based primarily on sexual orientation even though ICD-10 states that sexual orientation alone is not a disorder. This article reviews the scientific evidence and clinical rationale for continuing to include these categories in the ICD. A review of the evidence published since 1990 found little scientific interest in these categories. In addition, the Working Group found no evidence that they are clinically useful: they neither contribute to health service delivery or treatment selection nor provide essential information for public health surveillance. Moreover, use of these categories may create unnecessary harm by delaying accurate diagnosis and treatment. The Working Group recommends that these categories be deleted entirely from ICD-11. Health concerns related to sexual orientation can be better addressed using other ICD categories.

  10. Oriental Elements in the Material Culture of Azaq and the Problem of Migrations of the Golden Horde Urban Population

    Directory of Open Access Journals (Sweden)

    Maslovskiy Andrey N.

    2013-12-01

    Full Text Available The data on the emergence of new Oriental material culture elements in the city of Azaq, such as new housing and pottery types, characteristic of the mid-14th-century Golden Horde cities of the Lower Volga region, are provided in the article. Particular attention is paid to the appearance of new types of dwellings with the kang-based system of heating. They make up about 10 per cent of all residential complexes studied in Azaq: mostly ground dwellings, as semi-subterranean dwellings with kangs are rarely met. It has been suggested that in the mid-14th century a considerable group of residents of the Golden Horde Lower Volga towns had migrated to Azaq. The reasons for this relocation can be discussed only hypothetically.

  11. A Pareto-Based Adaptive Variable Neighborhood Search for Biobjective Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time

    Directory of Open Access Journals (Sweden)

    Huixin Tian

    2016-01-01

    Full Text Available Different from most researches focused on the single objective hybrid flowshop scheduling (HFS problem, this paper investigates a biobjective HFS problem with sequence dependent setup time. The two objectives are the minimization of total weighted tardiness and the total setup time. To efficiently solve this problem, a Pareto-based adaptive biobjective variable neighborhood search (PABOVNS is developed. In the proposed PABOVNS, a solution is denoted as a sequence of all jobs and a decoding procedure is presented to obtain the corresponding complete schedule. In addition, the proposed PABOVNS has three major features that can guarantee a good balance of exploration and exploitation. First, an adaptive selection strategy of neighborhoods is proposed to automatically select the most promising neighborhood instead of the sequential selection strategy of canonical VNS. Second, a two phase multiobjective local search based on neighborhood search and path relinking is designed for each selected neighborhood. Third, an external archive with diversity maintenance is adopted to store the nondominated solutions and at the same time provide initial solutions for the local search. Computational results based on randomly generated instances show that the PABOVNS is efficient and even superior to some other powerful multiobjective algorithms in the literature.

  12. Improvement of upper limb’s condition of women with post mastectomy syndrome with the help of problem-oriented program of physical rehabilitation

    Directory of Open Access Journals (Sweden)

    Y.A. Briskin

    2015-11-01

    Full Text Available Purpose: to determine effectiveness of problem-oriented program of women’s physical rehabilitation with post mastectomy syndrome in improvement of upper limb’s functional state. Material: 50 women with early symptoms of post mastectomy syndrome at stationary rehabilitation stage, who underwent radical mastectomy by Madden were involved in the research. Testing of movement amplitude in shoulder joint, swelling of upper limb and muscular strength of hand’s flexors was conducted on 2 nd day after surgery and at the end of stationary rehabilitation period (12-14 th day. Results: Main means of the authors’ program were: general and special physical exercises; static and dynamic breathing exercises; breathing through preloaded lips, controlled coughing, autogenic drainage, manual pressing, manual vibration; post-isometric relaxation; elements of labor therapy; lymphatic drainage massage and self massage; topical talks; consultations; auto training. The trainings were conducted individually 2-3 times a day; 20-30 minutes every session. The patients’ independent trainings included: fulfillment of therapeutic positions, self-massage, relaxation exercises and auto-training. Conclusions: application of problem-oriented physical rehabilitation program facilitates improvement of upper limb’s functional potentials of women with post mastectomy syndrome.

  13. Development of innovative teaching materials: clinical pharmacology problem-solving (CPPS) units: comparison with patient-oriented problem-solving units and problem-based learning--a 10-year review.

    Science.gov (United States)

    Lathers, Claire M; Smith, Cedric M

    2002-05-01

    The First Teaching Clinic in Clinical Pharmacology, sponsored by the American College of Clinical Pharmacology in September 1992, was designed for the preparation and development of new clinical pharmacology problem-solving (CPPS) units. CPPS units are case histories that illustrate pertinent principles in clinical pharmacology. Each unit consists of the following sections: introduction, learning objectives, pretest, four clinical pharmacology scenarios, posttest, answers to pre- and posttest questions, and selected references. The clinical pharmacology content of the CPPS units place greater emphasis on clinical information, drug selection, and risk/benefit analyses, and thus they complement the basic pharmacology presented in the patient-oriented problem-solving (POPS) units. In general, the CPPS units are intended for use by students more advanced in clinical pharmacology than first- and second-year medical students. The CPPS unit "Clinical Pharmacology of Antiepileptic Drug Use: Clinical Pearls about the Perils of Patty" was developed for use by third- and fourth-year medical students doing rotations in neurology or clinical pharmacology; advanced pharmacy students; residents in neurology, pediatrics, internal medicine, and family practice; fellows in clinical pharmacology, and those taking the board examination in clinical pharmacology. The CPPS unit titled "Geriatric Clinical Psychopharmacology" was written for third- and fourth-year medical students; residents in psychiatry, family practice, and internal medicine;fellows in clinical pharmacology; and those studying for boards in clinical pharmacology. The CPPS unit "Anisocoria and Glaucoma" was written for more advanced students of clinical pharmacology. The CPPS unit titled "Antiepileptic Drugs" was intended for second-year medical students. The second teaching clinic was held in November 1993 and focused on the development and editing of the CPPS units and their evaluations by faculty and students from

  14. The problem of latent attentional capture: Easy visual search conceals capture by task-irrelevant abrupt onsets.

    Science.gov (United States)

    Gaspelin, Nicholas; Ruthruff, Eric; Lien, Mei-Ching

    2016-08-01

    Researchers are sharply divided regarding whether irrelevant abrupt onsets capture spatial attention. Numerous studies report that they do and a roughly equal number report that they do not. This puzzle has inspired numerous attempts at reconciliation, none gaining general acceptance. The authors propose that abrupt onsets routinely capture attention, but the size of observed capture effects depends critically on how long attention dwells on distractor items which, in turn, depends critically on search difficulty. In a series of spatial cuing experiments, the authors show that irrelevant abrupt onsets produce robust capture effects when visual search is difficult, but not when search is easy. Critically, this effect occurs even when search difficulty varies randomly across trials, preventing any strategic adjustments of the attentional set that could modulate probability of capture by the onset cue. The authors argue that easy visual search provides an insensitive test for stimulus-driven capture by abrupt onsets: even though onsets truly capture attention, the effects of capture can be latent. This observation helps to explain previous failures to find capture by onsets, nearly all of which used an easy visual search. (PsycINFO Database Record (c) 2016 APA, all rights reserved).

  15. Personal skills and abilities in curriculum development planning for Project Oriented and Problem-Based Learning (POPBL)

    DEFF Research Database (Denmark)

    Moesby, Egon

    2005-01-01

    In this article, the author is giving examples on an approach to include the personal competences in the initial phase of the planning process for a change towards project organized and problem-based learning ? POPBL. A model is presented on how to have trainees recognize the necessity to include...... professional competences as well as personal competences in a new POPBL based curriculum. The article continues by giving an example of a possible method to be used in the developing of a curriculum where the personal skills and abilities are an active and equally valued as the development of the students...

  16. An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm.

    Science.gov (United States)

    Deb, Kalyanmoy; Sinha, Ankur

    2010-01-01

    Bilevel optimization problems involve two optimization tasks (upper and lower level), in which every feasible upper level solution must correspond to an optimal solution to a lower level optimization problem. These problems commonly appear in many practical problem solving tasks including optimal control, process optimization, game-playing strategy developments, transportation problems, and others. However, they are commonly converted into a single level optimization problem by using an approximate solution procedure to replace the lower level optimization task. Although there exist a number of theoretical, numerical, and evolutionary optimization studies involving single-objective bilevel programming problems, not many studies look at the context of multiple conflicting objectives in each level of a bilevel programming problem. In this paper, we address certain intricate issues related to solving multi-objective bilevel programming problems, present challenging test problems, and propose a viable and hybrid evolutionary-cum-local-search based algorithm as a solution methodology. The hybrid approach performs better than a number of existing methodologies and scales well up to 40-variable difficult test problems used in this study. The population sizing and termination criteria are made self-adaptive, so that no additional parameters need to be supplied by the user. The study indicates a clear niche of evolutionary algorithms in solving such difficult problems of practical importance compared to their usual solution by a computationally expensive nested procedure. The study opens up many issues related to multi-objective bilevel programming and hopefully this study will motivate EMO and other researchers to pay more attention to this important and difficult problem solving activity.

  17. Reducing the drop-out rate of a technical oriented course by introducing Problem Based Learning – a first concept

    Directory of Open Access Journals (Sweden)

    Christian Kaufmann

    2011-04-01

    Full Text Available At the University of Applied Sciences (UAS Technikum Wien one of the most difficult courses in the Bachelor degree program of Computer Science is “Database Systems and Database Design”. Together with “Advanced Computer Programming”, this course accounts for the high drop-out rate in the degree program. For this reason, this course was chosen for a redesign, in line with the research project QUADRO (Measures to increase quality of teaching and to reduce drop-out rates promoted by the City of Vienna – MA 27 (EU strategy and promote economic development. As the authors have already gained experience in Problem Based Learning (PBL, they saw an opportunity to improve students’ database knowledge by changing the teaching method to Problem Based Learning (PBL. The proposed paper first explains the current situation, identifies its drawbacks and difficulties. In a second step, it describes the new method, shows the students’ feedback after the first semester and the resulting changes in the concept.

  18. Ionosphere Waves Service (IWS – a problem-oriented tool in ionosphere and Space Weather research produced by POPDAT project

    Directory of Open Access Journals (Sweden)

    Ferencz Csaba

    2014-05-01

    Full Text Available In the frame of the FP7 POPDAT project the Ionosphere Waves Service (IWS has been developed and opened for public access by ionosphere experts. IWS is forming a database, derived from archived ionospheric wave records to assist the ionosphere and Space Weather research, and to answer the following questions: How can the data of earlier ionospheric missions be reprocessed with current algorithms to gain more profitable results? How could the scientific community be provided with a new insight on wave processes that take place in the ionosphere? The answer is a specific and unique data mining service accessing a collection of topical catalogs that characterize a huge number of recorded occurrences of Whistler-like Electromagnetic Wave Phenomena, Atmosphere Gravity Waves, and Traveling Ionosphere Disturbances. IWS online service (http://popdat.cbk.waw.pl offers end users to query optional set of predefined wave phenomena, their detailed characteristics. These were collected by target specific event detection algorithms in selected satellite records during database buildup phase. Result of performed wave processing thus represents useful information on statistical or comparative investigations of wave types, listed in a detailed catalog of ionospheric wave phenomena. The IWS provides wave event characteristics, extracted by specific software systems from data records of the selected satellite missions. The end-user can access targets by making specific searches and use statistical modules within the service in their field of interest. Therefore the IWS opens a new way in ionosphere and Space Weather research. The scientific applications covered by IWS concern beyond Space Weather also other fields like earthquake precursors, ionosphere climatology, geomagnetic storms, troposphere-ionosphere energy transfer, and trans-ionosphere link perturbations.

  19. Ionosphere Waves Service (IWS) - a problem-oriented tool in ionosphere and Space Weather research produced by POPDAT project

    Science.gov (United States)

    Ferencz, Csaba; Lizunov, Georgii; Crespon, François; Price, Ivan; Bankov, Ludmil; Przepiórka, Dorota; Brieß, Klaus; Dudkin, Denis; Girenko, Andrey; Korepanov, Valery; Kuzmych, Andrii; Skorokhod, Tetiana; Marinov, Pencho; Piankova, Olena; Rothkaehl, Hanna; Shtus, Tetyana; Steinbach, Péter; Lichtenberger, János; Sterenharz, Arnold; Vassileva, Any

    2014-05-01

    In the frame of the FP7 POPDAT project the Ionosphere Waves Service (IWS) has been developed and opened for public access by ionosphere experts. IWS is forming a database, derived from archived ionospheric wave records to assist the ionosphere and Space Weather research, and to answer the following questions: How can the data of earlier ionospheric missions be reprocessed with current algorithms to gain more profitable results? How could the scientific community be provided with a new insight on wave processes that take place in the ionosphere? The answer is a specific and unique data mining service accessing a collection of topical catalogs that characterize a huge number of recorded occurrences of Whistler-like Electromagnetic Wave Phenomena, Atmosphere Gravity Waves, and Traveling Ionosphere Disturbances. IWS online service (http://popdat.cbk.waw.pl) offers end users to query optional set of predefined wave phenomena, their detailed characteristics. These were collected by target specific event detection algorithms in selected satellite records during database buildup phase. Result of performed wave processing thus represents useful information on statistical or comparative investigations of wave types, listed in a detailed catalog of ionospheric wave phenomena. The IWS provides wave event characteristics, extracted by specific software systems from data records of the selected satellite missions. The end-user can access targets by making specific searches and use statistical modules within the service in their field of interest. Therefore the IWS opens a new way in ionosphere and Space Weather research. The scientific applications covered by IWS concern beyond Space Weather also other fields like earthquake precursors, ionosphere climatology, geomagnetic storms, troposphere-ionosphere energy transfer, and trans-ionosphere link perturbations.

  20. Searching for Authentic Context in Designing PISA-like Mathematics Problem: From Indoor to Outdoor Field Experience

    Science.gov (United States)

    Siswono, T. Y. E.; Kohar, A. W.; Rosyidi, A. H.; Hartono, S.; Masriyah

    2018-01-01

    Designing problem like in PISA is known as a challenging activity for teachers particularly as the use of authentic context within that type of problem. This paper aims to describe the experiences of secondary mathematics teachers in designing PISA-like problems within an innovative training program focusing on building teachers’ understanding on the concept of mathematical literacy. The teachers were engaged in a set of problem-solving and problem-posing activities using PISA-based problem within indoor and outdoor field experiences. Within indoor field experience, the teachers worked collaboratively in groups on designing PISA-like problems with a given context through problem generation and reformulation techniques. Within outdoor field experience, they worked on designing PISA-like problems with self-chosen context from the place where the outdoor field experience took place. Our analysis indicates that there were improvements on the PISA-like problems designed by teachers based on its level use of context from indoor to outdoor experience. Also, the teachers were relatively successful with creating appropriate and motivating contexts by harnessing a variety of context consisting of personal, occupational, societal, and scientific contexts. However, they still experienced difficulties in turning these contexts into an appropriate problem satisfying PISA framework such as regarding authenticity of context use, language structure, and PISA task profile.

  1. Utilization and perceived problems of online medical resources and search tools among different groups of European physicians.

    Science.gov (United States)

    Kritz, Marlene; Gschwandtner, Manfred; Stefanov, Veronika; Hanbury, Allan; Samwald, Matthias

    2013-06-26

    There is a large body of research suggesting that medical professionals have unmet information needs during their daily routines. To investigate which online resources and tools different groups of European physicians use to gather medical information and to identify barriers that prevent the successful retrieval of medical information from the Internet. A detailed Web-based questionnaire was sent out to approximately 15,000 physicians across Europe and disseminated through partner websites. 500 European physicians of different levels of academic qualification and medical specialization were included in the analysis. Self-reported frequency of use of different types of online resources, perceived importance of search tools, and perceived search barriers were measured. Comparisons were made across different levels of qualification (qualified physicians vs physicians in training, medical specialists without professorships vs medical professors) and specialization (general practitioners vs specialists). Most participants were Internet-savvy, came from Austria (43%, 190/440) and Switzerland (31%, 137/440), were above 50 years old (56%, 239/430), stated high levels of medical work experience, had regular patient contact and were employed in nonacademic health care settings (41%, 177/432). All groups reported frequent use of general search engines and cited "restricted accessibility to good quality information" as a dominant barrier to finding medical information on the Internet. Physicians in training reported the most frequent use of Wikipedia (56%, 31/55). Specialists were more likely than general practitioners to use medical research databases (68%, 185/274 vs 27%, 24/88; χ²₂=44.905, Presources on the Internet and frequent reliance on general search engines and social media among physicians require further attention. Possible solutions may be increased governmental support for the development and popularization of user-tailored medical search tools and open

  2. The Problem-Oriented Approach to Organization of the Functioning of the State Control System in Ukraine

    Directory of Open Access Journals (Sweden)

    Ivanova Olga Yu.

    2017-06-01

    Full Text Available There conducted an analysis of the number of inspections of business entities that were carried out by controlling bodies in Ukraine in 2015. As a result, it is justified that the issue of reducing the number of inspections of business entities is of primary importance for improving the business climate in Ukraine. The control functions of some central bodies of executive power that are similar or identical are singled out, the cases of dividing one sphere of control between several bodies are considered. By analyzing the organization of the functioning of the state control system in Ukraine, there revealed its main problems and directions for their solution, among which: the depriving of the State Forest Resource Agency of Ukraine and the State Agency of Fisheries of Ukraine of the duplicating control functions; the depriving of the State Service of Ukraine for Labor of functions of control over business entities delegating these functions to the above bodies. As a result, the State Service of Ukraine for Labor will only perform functions of control over activities of the Funds. These changes will make it possible not only to simplify the system of central bodies of executive power that have the right to conduct inspections of business entities by reducing the number of such bodies but also ensure the conducting of the inspections by special bodies.

  3. Behavior of matter under nonequilibrium conditions: fundamental aspects and applications in energy-oriented problems. Progress report

    International Nuclear Information System (INIS)

    Prigogine, I.

    1984-01-01

    During the last years, the research activities of the statistical mechanics and thermodynamics groups of The University of Texas at Austin and the University of Brussels in Belgium, have concentrated on the study of phenomena far away from the state of thermal equilibrium. This subject, long considered to belong to basic research if only because of its close link to the problem of irreversibility, is now believed to constitute also a new interface between pure and applied research and to have a considerable potential for applications in a variety of fields. This link results from the fact that most of the systems encountered in practice (a chemical plant, the combustion chamber of a heat engine, etc.) are subjected to mechanical, thermal, chemical or electric constraints, which remove them far away from thermodynamic equilibrium. The response to these constraints is almost always nonlinear. This gives rise to critical situations resulting in deep and frequently essential modifications in the behavior, reflected by the appearance of a multitude of simultaneously stable states. The study of these bifurcation phenomena has constituted the main theme of the research carried out in the last three years

  4. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time Windows and scheduled lines

    NARCIS (Netherlands)

    Ghilas, V.; Demir, E.; van Woensel, T.

    2016-01-01

    The Pickup and Delivery Problem with Time Windows and Scheduled Lines (PDPTW-SL) concerns scheduling a set of vehicles to serve freight requests such that a part of the journey can be carried out on a scheduled public transportation line. Due to the complexity of the problem, which is NP-hard, we

  5. A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem

    NARCIS (Netherlands)

    Goldengorin, B.; Ghosh, D.

    Maximization of submodular functions on a ground set is a NP-hard combinatorial optimization problem. Data correcting algorithms are among the several algorithms suggested for solving this problem exactly and approximately. From the point of view of Hasse diagrams data correcting algorithms use

  6. Speech Problems

    Science.gov (United States)

    ... Staying Safe Videos for Educators Search English Español Speech Problems KidsHealth / For Teens / Speech Problems What's in ... a person's ability to speak clearly. Some Common Speech and Language Disorders Stuttering is a problem that ...

  7. A Comparison of Monte Carlo Tree Search and Rolling Horizon Optimization for Large Scale Dynamic Resource Allocation Problems

    Science.gov (United States)

    2015-05-01

    decisions on the fly in an online retail environment. Tech. rep., Working Paper, Massachusetts Institute of Technology, Boston, MA. Arneson, Broderick , Ryan...Hayward, Philip Henderson. 2009. MoHex wins Hex tournament. International Computer Games Association Journal 32 114–116. Arneson, Broderick , Ryan B...Combina- torial Search. Enzenberger, Markus, Martin Muller, Broderick Arneson, Richard Segal. 2010. Fuego—an open-source framework for board games and

  8. Assessment of methods for computing the closest point projection, penetration, and gap functions in contact searching problems

    Czech Academy of Sciences Publication Activity Database

    Kopačka, Ján; Gabriel, Dušan; Plešek, Jiří; Ulbin, M.

    2016-01-01

    Roč. 105, č. 11 (2016), s. 803-833 ISSN 0029-5981 R&D Projects: GA ČR(CZ) GAP101/12/2315; GA MŠk(CZ) ME10114 Institutional support: RVO:61388998 Keywords : closest point projection * local contact search * quadratic elements * Newtons methods * geometric iteration methods * simplex method Subject RIV: JC - Computer Hardware ; Software Impact factor: 2.162, year: 2016 http://onlinelibrary.wiley.com/doi/10.1002/nme.4994/abstract

  9. Religion Education Teaching in Zimbabwe Secondary Schools: The Search for an Authentic Values-Oriented Multi-Faith Religion Education Pedagogical Model

    Science.gov (United States)

    Ndlovu, Lovemore

    2014-01-01

    Religion Education teaching in post-independence Zimbabwe has remained bible-oriented and confessional at a time when most Religion Education stakeholders expect an "open", plural and authentic multi-faith Religion Education curriculum. Despite curriculum innovation initiatives aimed at introducing new approaches such as experiential…

  10. A Functional Programming Approach to AI Search Algorithms

    Science.gov (United States)

    Panovics, Janos

    2012-01-01

    The theory and practice of search algorithms related to state-space represented problems form the major part of the introductory course of Artificial Intelligence at most of the universities and colleges offering a degree in the area of computer science. Students usually meet these algorithms only in some imperative or object-oriented language…

  11. Student performance and their perception of a patient-oriented problem-solving approach with audiovisual aids in teaching pathology: a comparison with traditional lectures

    Directory of Open Access Journals (Sweden)

    Arjun Singh

    2010-12-01

    Full Text Available Arjun SinghDepartment of Pathology, Sri Venkateshwara Medical College Hospital and Research Centre, Pondicherry, IndiaPurpose: We use different methods to train our undergraduates. The patient-oriented problem-solving (POPS system is an innovative teaching–learning method that imparts knowledge, enhances intrinsic motivation, promotes self learning, encourages clinical reasoning, and develops long-lasting memory. The aim of this study was to develop POPS in teaching pathology, assess its effectiveness, and assess students’ preference for POPS over didactic lectures.Method: One hundred fifty second-year MBBS students were divided into two groups: A and B. Group A was taught by POPS while group B was taught by traditional lectures. Pre- and post-test numerical scores of both groups were evaluated and compared. Students then completed a self-structured feedback questionnaire for analysis.Results: The mean (SD difference in pre- and post-test scores of groups A and B was 15.98 (3.18 and 7.79 (2.52, respectively. The significance of the difference between scores of group A and group B teaching methods was 16.62 (P < 0.0001, as determined by the z-test. Improvement in post-test performance of group A was significantly greater than of group B, demonstrating the effectiveness of POPS. Students responded that POPS facilitates self-learning, helps in understanding topics, creates interest, and is a scientific approach to teaching. Feedback response on POPS was strong in 57.52% of students, moderate in 35.67%, and negative in only 6.81%, showing that 93.19% students favored POPS over simple lectures.Conclusion: It is not feasible to enforce the PBL method of teaching throughout the entire curriculum; However, POPS can be incorporated along with audiovisual aids to break the monotony of dialectic lectures and as alternative to PBL.Keywords: medical education, problem-solving exercise, problem-based learning

  12. A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems

    Directory of Open Access Journals (Sweden)

    Nader Ghaffari-Nasab

    2010-07-01

    Full Text Available During the past two decades, there have been increasing interests on permutation flow shop with different types of objective functions such as minimizing the makespan, the weighted mean flow-time etc. The permutation flow shop is formulated as a mixed integer programming and it is classified as NP-Hard problem. Therefore, a direct solution is not available and meta-heuristic approaches need to be used to find the near-optimal solutions. In this paper, we present a new discrete firefly meta-heuristic to minimize the makespan for the permutation flow shop scheduling problem. The results of implementation of the proposed method are compared with other existing ant colony optimization technique. The preliminary results indicate that the new proposed method performs better than the ant colony for some well known benchmark problems.

  13. Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem

    DEFF Research Database (Denmark)

    Iris, Cagatay; Pacino, Dario; Røpke, Stefan

    2017-01-01

    This paper focuses on the integrated berth allocation and quay crane assignment problem in container terminals. We consider the decrease in the marginal productivity of quay cranes and the increase in handling time due to deviation from the desired position. We consider a continuous berth...

  14. Extended Subject Access to Hypertext Online Documentation. Parts I and II: The Search-Support and Maintenance Problems.

    Science.gov (United States)

    Girill, T. R.; And Others

    1991-01-01

    Describes enhancements made to a hypertext information retrieval system at the National Energy Research Supercomputer Center (NERSC) called DFT (Document, Find, and Theseus). The enrichment of DFT's entry vocabulary is described, DFT and other hypertext systems are compared, and problems that occur due to the need for frequent updates are…

  15. An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem

    OpenAIRE

    Rao, Weizhen; Liu, Feng; Wang, Shengbin

    2016-01-01

    The classical model of vehicle routing problem (VRP) generally minimizes either the total vehicle travelling distance or the total number of dispatched vehicles. Due to the increased importance of environmental sustainability, one variant of VRPs that minimizes the total vehicle fuel consumption has gained much attention. The resulting fuel consumption VRP (FCVRP) becomes increasingly important yet difficult. We present a mixed integer programming model for the FCVRP, and fuel consumption is ...

  16. Problems and prospects for maintaining the register of sanitary and epidemiological objects of surveillance for the tasks of the transition to risk-oriented model of activity

    Directory of Open Access Journals (Sweden)

    N.V. Zaitseva

    2015-03-01

    Full Text Available The article describes the approaches to the formation of regional databases of the objects of sanitary-epidemiological surveillance for the tasks of sequential evaluation of each object having the potential risk to the citizens of the affected areas of these objects, e.g. workers, consumers of products or services. The basic structure of the information system is demonstrated. The system is oriented to be used together with the DBMS MS Access. The system performs the manual quiding function for the register and implements the calculation algorithm of the health risk indicators and classification of the objects of surveillance. Approaches to the formation of the system have been tested in Perm, Lipetsk, Kaluga, Omsk regions as part of a pilot project of the Federal Service on Surveillance for Consumer rights protection and human well-being. The problems of the registers’ formation are in the fact of scares operational entering of the significant amount of information, that has been accumulated in Administration offices of Rospotrebnadzor, but do not exist in the form of electronic databases. The relevant issue is the development of guidance documents to ensure unified approaches to the registers’ formation and risk calculation in relation to population census under the influence of various activities.

  17. Aspect-Oriented Programming

    NARCIS (Netherlands)

    Bergmans, Lodewijk; Videira Lopes, Cristina; Moreira, Ana; Demeyer, Serge

    1999-01-01

    Aspect-oriented programming is a promising idea that can improve the quality of software by reduce the problem of code tangling and improving the separation of concerns. At ECOOP'97, the first AOP workshop brought together a number of researchers interested in aspect-orientation. At ECOOP'98, during

  18. A granular t abu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    Energy Technology Data Exchange (ETDEWEB)

    Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo

    2017-07-01

    We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  19. A granular t abu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    International Nuclear Information System (INIS)

    Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo

    2017-01-01

    We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  20. A Combined Adaptive Tabu Search and Set Partitioning Approach for the Crew Scheduling Problem with an Air Tanker Crew Application

    Science.gov (United States)

    2002-08-15

    Agency Name(s) and Address(es) Maj Juan Vasquez AFOSR/NM 801 N. Randolph St., Rm 732 Arlington, VA 22203-1977 Sponsor/Monitor’s Acronym(s) Sponsor... Gelman , E., Patty, B., and R. Tanga. 1991. Recent Advances in Crew-Pairing Optimization at American Airlines, Interfaces, 21(1):62-74. Baker, E.K...Operations Research, 25(11):887-894. Chu, H.D., Gelman , E., and E.L. Johnson. 1997. Solving Large Scale Crew Scheduling Problems, European

  1. Implementing Strategic Orientation

    Science.gov (United States)

    Fischer, Arthur K.; Brownback, Sarah

    2012-01-01

    An HRM case dealing with problems and issues of setting up orientation programs which align with corporate strategy. Discussion concerns how such a case can be used to exhibit the alignment between HRM and business strategy.

  2. Power and Society: Search for New Approaches to the Problem of Cooperation (Based on the Theses of Historical Sciences

    Directory of Open Access Journals (Sweden)

    Oleg V. Kuznetsov

    2017-03-01

    Full Text Available The publication analyzes the theses presented in 2016 in the Dissertation Council for historical sciences in Volgograd State University, in particular, the thesis “Cossacks and peasants of the Southern Russia in 1920s: socio-political life and economic activity” by T.V. Pankova-Kozochkina, “The Soviet state and the Russian Orthodox Church in 1953-1964 (on the materials of the Stalingrad (Volgograd region” by M. I. Sokolova, “Journey to the other world: the image of Charon/Charos in the culture and religious consciousness of Byzantine society” by E. V. Stelnik. It is noted that despite the thematic and content diversity of the presented works, they are all united by a common problem: the interaction of power and society. The main focus of the present analysis is made on finding new methodological approaches and research methods by the authors.

  3. Our love-hate relationship with DNA barcodes, the Y2K problem, and the search for next generation barcodes

    Directory of Open Access Journals (Sweden)

    Jeffrey M. Marcus

    2018-01-01

    Full Text Available DNA barcodes are very useful for species identification especially when identification by traditional morphological characters is difficult. However, the short mitochondrial and chloroplast barcodes currently in use often fail to distinguish between closely related species, are prone to lateral transfer, and provide inadequate phylogenetic resolution, particularly at deeper nodes. The deficiencies of short barcode identifiers are similar to the deficiencies of the short year identifiers that caused the Y2K problem in computer science. The resolution of the Y2K problem was to increase the size of the year identifiers. The performance of conventional mitochondrial COI barcodes for phylogenetics was compared with the performance of complete mitochondrial genomes and nuclear ribosomal RNA repeats obtained by genome skimming for a set of caddisfly taxa (Insect Order Trichoptera. The analysis focused on Trichoptera Family Hydropsychidae, the net-spinning caddisflies, which demonstrates many of the frustrating limitations of current barcodes. To conduct phylogenetic comparisons, complete mitochondrial genomes (15 kb each and nuclear ribosomal repeats (9 kb each from six caddisfly species were sequenced, assembled, and are reported for the first time. These sequences were analyzed in comparison with eight previously published trichopteran mitochondrial genomes and two triochopteran rRNA repeats, plus outgroup sequences from sister clade Lepidoptera (butterflies and moths. COI trees were not well-resolved, had low bootstrap support, and differed in topology from prior phylogenetic analyses of the Trichoptera. Phylogenetic trees based on mitochondrial genomes or rRNA repeats were well-resolved with high bootstrap support and were largely congruent with each other. Because they are easily sequenced by genome skimming, provide robust phylogenetic resolution at various phylogenetic depths, can better distinguish between closely related species, and (in the

  4. Learning Problems

    Science.gov (United States)

    ... Staying Safe Videos for Educators Search English Español Learning Problems KidsHealth / For Kids / Learning Problems What's in ... for how to make it better. What Are Learning Disabilities? Learning disabilities aren't contagious, but they ...

  5. Orienting hypnosis.

    Science.gov (United States)

    Hope, Anna E; Sugarman, Laurence I

    2015-01-01

    This article presents a new frame for understanding hypnosis and its clinical applications. Despite great potential to transform health and care, hypnosis research and clinical integration is impaired in part by centuries of misrepresentation and ignorance about its demonstrated efficacy. The authors contend that advances in the field are primarily encumbered by the lack of distinct boundaries and definitions. Here, hypnosis, trance, and mind are all redefined and grounded in biological, neurological, and psychological phenomena. Solutions are proposed for boundary and language problems associated with hypnosis. The biological role of novelty stimulating an orienting response that, in turn, potentiates systemic plasticity forms the basis for trance. Hypnosis is merely the skill set that perpetuates and influences trance. This formulation meshes with many aspects of Milton Erickson's legacy and Ernest Rossi's recent theory of mind and health. Implications of this hypothesis for clinical skills, professional training, and research are discussed.

  6. I Keep my Problems to Myself: Negative Social Network Orientation, Social Resources, and Health-Related Quality of Life in Cancer Survivors

    Science.gov (United States)

    Symes, Yael; Campo, Rebecca A.; Wu, Lisa M.; Austin, Jane

    2016-01-01

    Background Cancer survivors treated with hematopoietic stem cell transplant rely on their social network for successful recovery. However, some survivors have negative attitudes about using social resources (negative social network orientation) that are critical for their recovery. Purpose We examined the association between survivors’ social network orientation and health-related quality of life (HRQoL) and whether it was mediated by social resources (network size, perceived support, and negative and positive support-related social exchanges). Methods In a longitudinal study, 255 survivors completed validated measures of social network orientation, HRQoL, and social resources. Hypotheses were tested using path analysis. Results More negative social network orientation predicted worse HRQoL (p social exchanges. Conclusions Survivors with negative social network orientation may have poorer HRQoL in part due to deficits in several key social resources. Findings highlight a subgroup at risk for poor transplant outcomes and can guide intervention development. PMID:26693932

  7. A search for optimal parameters of resonance circuits ensuring damping of electroelastic structure vibrations based on the solution of natural vibration problem

    Science.gov (United States)

    Oshmarin, D.; Sevodina, N.; Iurlov, M.; Iurlova, N.

    2017-06-01

    In this paper, with the aim of providing passive control of structure vibrations a new approach has been proposed for selecting optimal parameters of external electric shunt circuits connected to piezoelectric elements located on the surface of the structure. The approach is based on the mathematical formulation of the natural vibration problem. The results of solution of this problem are the complex eigenfrequencies, the real part of which represents the vibration frequency and the imaginary part corresponds to the damping ratio, characterizing the rate of damping. A criterion of search for optimal parameters of the external passive shunt circuits, which can provide the system with desired dissipative properties, has been derived based on the analysis of responses of the real and imaginary parts of different complex eigenfrequencies to changes in the values of the parameters of the electric circuit. The efficiency of this approach has been verified in the context of natural vibration problem of rigidly clamped plate and semi-cylindrical shell, which is solved for series-connected and parallel -connected external resonance (consisting of resistive and inductive elements) R-L circuits. It has been shown that at lower (more energy-intensive) frequencies, a series-connected external circuit has the advantage of providing lower values of the circuit parameters, which renders it more attractive in terms of practical applications.

  8. Student performance and their perception of a patient-oriented problem-solving approach with audiovisual aids in teaching pathology: a comparison with traditional lectures.

    Science.gov (United States)

    Singh, Arjun

    2011-01-01

    We use different methods to train our undergraduates. The patient-oriented problem-solving (POPS) system is an innovative teaching-learning method that imparts knowledge, enhances intrinsic motivation, promotes self learning, encourages clinical reasoning, and develops long-lasting memory. The aim of this study was to develop POPS in teaching pathology, assess its effectiveness, and assess students' preference for POPS over didactic lectures. One hundred fifty second-year MBBS students were divided into two groups: A and B. Group A was taught by POPS while group B was taught by traditional lectures. Pre- and posttest numerical scores of both groups were evaluated and compared. Students then completed a self-structured feedback questionnaire for analysis. The mean (SD) difference in pre- and post-test scores of groups A and B was 15.98 (3.18) and 7.79 (2.52), respectively. The significance of the difference between scores of group A and group B teaching methods was 16.62 (P effectiveness of POPS. Students responded that POPS facilitates self-learning, helps in understanding topics, creates interest, and is a scientific approach to teaching. Feedback response on POPS was strong in 57.52% of students, moderate in 35.67%, and negative in only 6.81%, showing that 93.19% students favored POPS over simple lectures. It is not feasible to enforce the PBL method of teaching throughout the entire curriculum; However, POPS can be incorporated along with audiovisual aids to break the monotony of dialectic lectures and as alternative to PBL.

  9. An algorithm based on granular tabu search for the problem of balancing public bikes by using multiple vehicles

    Directory of Open Access Journals (Sweden)

    Rodrigo Linfati

    2014-01-01

    Full Text Available El uso de sistemas de bicicletas públicas ha cobrado gran importancia en países europeos y alrededor de todo el planeta; esto ha llevado a la necesidad de buscar técnicas avanzadas que ayuden a la toma de decisiones. Un sistema de bicicletas públicas consiste en un conjunto de puntos donde se pueden recoger y entregar bicicletas; un depósito central donde existe un conjunto de vehículos que toma las bicicletas sobrantes y las transportan a los puntos donde exista un déficit (es decir que la demanda supera la oferta. Una de las grandes problemáticas que se presentan en los sistemas de bicicletas públicas es el balanceo, que consiste en enviar bicicletas desde los puntos donde se produce una oferta (bicicletas que sobran hacia los puntos donde existe una demanda (bicicletas que faltan. La forma de modelar este problema es con una adaptación del problema de ruteo de vehículos con recolección y entrega de mercancías (VRPPD, permitiendo que cada ruta realice entregas parciales a los clientes y limitando el número de clientes a visitar por ruta. En este artículo se introduce un modelo de programación lineal entera mixta y una metaheurística basada en una búsqueda tabú granular para encontrar soluciones. Se usan instancias desde 15 a 500 clientes adaptadas de la literatura. Los resultados computacionales evidencian que el algoritmo propuesto encuentra soluciones en tiempos acotados de cómputo.

  10. Search and imperative programming

    OpenAIRE

    Apt, Krzysztof; Schaerf, A.

    1996-01-01

    textabstractWe augment the expressive power of imperative programming in order to make it a more attractive vehicle for problems that involve search.The proposed additions are limited yet powerful and are inspired by the logic programming paradigm.We illustrate their use by presenting solutions to a number of classical problems, including the straight search problem, the knapsack problem, and the 8 queens problem. These solutions are substantially simpler than their counterparts written in th...

  11. A granular tabu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    Directory of Open Access Journals (Sweden)

    Jose Bernal

    2017-10-01

    Full Text Available Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase, a granular tabu search is applied during the improvement phase (second phase. Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  12. Implementasi Algoritma Best-First Search (BeFS pada Penyelesaian Traveling Salesman Problem (TSP (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta

    Directory of Open Access Journals (Sweden)

    Muchammad Abrori

    2015-10-01

    Full Text Available Yogyakarta offers many tourist attractions, from nature based tourism, culinary tourism until cultural tourism. With so many tourist attractions offered by Yogyakarta, tourist often finds it difficult to arrange their travel schedule (from choosing which tourist attractions to be visited until choosing which route tourist should takes to maximize their vacation time. Therefore, it’s required to have a way to determine the shortest tour route so tourist can make their tour in the Yogyakarta effective. This problem can be categorized as Traveling Salesman Problem (TSP case. There are a lot of methods can be used to find the shortest route in Travelling Salesman Problems (TSP case. To solve the problem, which is to find the shortest tour route in Yogyakarta, Algorithm Best-First Travelling will be used in this undergraduate thesis. The implementation of Algorithm Best-First Search to find the shortest tour route in Yogyakarta can be used to produce a solution for tourist to choose the shortest tour package and decide which route they should take. The premium tour package produces tour route from Adi Sucipto Airport-Gembira Loka Zoo- Purawisata-N’dalem Gamelan Hotel-Yogyakarta Palace-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Adi Sucipto Airport with distance covered 20.297 meter. The middle tour package produces tour route from Tugu railway station-Benteng Vredeburg Museum- Taman Pintar-Yogyakarta Palace-Mawar Asri Hotel-Tamansari-Purawisata-Gembira Loka Zoo-Tugu railway station with distance covered 11.772 meter. The economy tour package produces tour route from Giwangan bus station- Gembira Loka zoo-Purawisata-Yogyakarta Palace-Mitra Hotel-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Giwangan bus station with distance covered 14.037 meter.

  13. Archives: Orient Journal of Medicine

    African Journals Online (AJOL)

    Items 1 - 26 of 26 ... Archives: Orient Journal of Medicine. Journal Home > Archives: Orient Journal of Medicine. Log in or Register to get access to full text downloads. Username, Password, Remember me, or Register · Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives. 1 - 26 of 26 Items ...

  14. EDITORIAL: Optical orientation Optical orientation

    Science.gov (United States)

    SAME ADDRESS *, Yuri; Landwehr, Gottfried

    2008-11-01

    radiation. The major results of the systematic work on optical orientation, both experimental and theoretical, at the Ioffe Institute and the Ecole Normale Supérieure in Paris are documented in the book Optical Orientation, edited by F Meier and B P Zakharchenya in the series Modern Problems in Condensed Matter Sciences [4], in which the foundations of optical orientation are comprehensively presented by renowned authors. This book is still the unsurpassed standard work in the field. If one asks what has become new since that publication in 1984 it is obviously the arrival of low-dimensional structures, two-dimensional heterostructures and zero-dimensional quantum dots. It has turned out that the quantum confinement can significantly modify the spin lifetime and the spin relaxation. The experimental work on spin alignment was done by a relative small number of researchers. However, the situation has substantially changed during the last decade. Research on spin-related phenomena has become very popular and the word 'spintronics' was coined. Spin research is no longer considered to be somewhat esoteric, since the replacement of silicon microelectronics based on the electron charge by spin-based electronics is being discussed. Whether these proposals can be realized remains to be seen. But one consequence has been a worldwide increase of high level basic research in spin phenomena. Another line of current research which has contributed to the popularity of spin-related research is quantum computing, based on spin-qubits. To be useful, solid state systems require long spin relaxation times and weak interaction with the environment. This is indispensable for low error rates. The difficulties in achieving these goals have been extensively discussed in the literature. Nowadays, because of the volume and diversity of spin-related work worldwide, a book on optical orientation like that edited by Meyer and Zakharchenya does not seem possible, so in this special issue of

  15. Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method

    Science.gov (United States)

    Bagherinejad, Jafar; Niknam, Azar

    2018-03-01

    In this paper, a leader-follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services are taken into account. The competitor could react by opening new facilities, closing existing ones, and adjusting the quality levels of its existing facilities. The market share, captured by each facility, depends on its distance to customer and its quality that is calculated based on the probabilistic Huff's model. Each firm aims to maximize its profit subject to constraints on quality levels and budget of setting up new facilities. This problem is formulated as a bi-level mixed integer non-linear model. The model is solved using a combination of Tabu Search with an exact method. The performance of the proposed algorithm is compared with an upper bound that is achieved by applying Karush-Kuhn-Tucker conditions. Computational results show that our algorithm finds near the upper bound solutions in a reasonable time.

  16. A States of Matter Search-Based Approach for Solving the Problem of Intelligent Power Allocation in Plug-in Hybrid Electric Vehicles

    Directory of Open Access Journals (Sweden)

    Arturo Valdivia-Gonzalez

    2017-01-01

    Full Text Available Recently, many researchers have proved that the electrification of the transport sector is a key for reducing both the emissions of green-house pollutants and the dependence on oil for transportation. As a result, Plug-in Hybrid Electric Vehicles (or PHEVs are receiving never before seen increased attention. Consequently, large-scale penetration of PHEVs into the market is expected to take place in the near future, however, an unattended increase in the PHEVs needs may cause several technical problems which could potentially compromise the stability of power systems. As a result of the growing necessity for addressing such issues, topics related to the optimization of PHEVs’ charging infrastructures have captured the attention of many researchers. Related to this, several state-of-the-art swarm optimization methods (such as the well-known Particle Swarm Optimization (PSO or the recently proposed Gravitational Search Algorithm (GSA approach have been successfully applied in the optimization of the average State of Charge (SoC, which represents one of the most important performance indicators in the context of PHEVs’ intelligent power allocation. Many of these swarm optimization methods, however, are known to be subject to several critical flaws, including premature convergence and a lack of balance between the exploration and exploitation of solutions. Such problems are usually related to the evolutionary operators employed by each of the methods on the exploration and exploitation of new solutions. In this paper, the recently proposed States of Matter Search (SMS swarm optimization method is proposed for maximizing the average State of Charge of PHEVs within a charging station. In our experiments, several different scenarios consisting on different numbers of PHEVs were considered. To test the feasibility of the proposed approach, comparative experiments were performed against other popular PHEVs’ State of Charge maximization approaches

  17. Diclofenac 1,3,4-Oxadiazole Derivatives; Biology-Oriented Drug Synthesis (BIODS) in Search of Better Non-Steroidal, Non-Acid Antiinflammatory Agents.

    Science.gov (United States)

    Shah, Shazia; Arshia; Kazmi, Nida Siraj; Jabeen, Almas; Faheem, Aisha; Dastagir, Nida; Ahmed, Tariq; Khan, Khalid Mohammed; Ahmed, Shakil; Raza, Abeer; Perveen, Shahnaz

    2018-03-21

    Inflammation is defined as the response of immune system cells to damaged or injured tissues The major symptoms of inflammation include increased blood flow, cellular influx, edema, elevated cellular metabolism, reactive oxygen species (ROS) nitric oxide (NO) and vasodilation. This normally protective mechanism against harmful agents when this normal mechanism becomes dysregulated that can cause serious illnesses including ulcerative colitis, Crohn's disease, rheumatoid arthritis, osteoarthritis, sepsis, and chronic pulmonary inflammation . In this study synthetic transformations on diclofenac were carried out in search of better non-steroidal antiinflammatory drugs (NSAIDs), non-acidic, antiinflammatory agents. For this purpose diclofenac derivatives (2-20) were synthesized from diclofenac (1). All derivatives (2-20) and parent diclofenac (1) were evaluated for their antiinflammatory effect using different parameters including suppression of intracellular reactive oxygen species (ROS), produced by whole blood phagocytes, produced by neutrophils, and inhibition of nitric oxide (NO) production from J774.2 macrophages. Most active compound also evaluated for cytotoxicity activity. Diclofenac (1) inhibited the ROS with an IC50 of 3.9 ± 2.8, 1.2 ± 0.0 μg/mL respectively and inhibited NO with an IC50 of 30.01 ± 0.01 μg/mL. Among its derivatives 4, 5, 11, 16, and 20, showed better antiinflammatory potential. The compound 5 was found to be the most potent inhibitor of intracellular ROS as well as NO with an IC50 values of 1.9 ± 0.9, 1.7 ± 0.4 μg/mL respectively and 7.13 ± 1.0 μg/mL, respectively, and showed good inhibitory activity than parent diclofenac. The most active compounds were tested for their toxic effect on NIH-3T3 cells where all compounds were found to be non-toxic compared to the standard cytotoxic drug cyclohexamide. Five derivatives were found to be active. Compound 5 was found to be the most potent inhibitor of ROS and NO compared to parent

  18. The concurrent validity of the Problem Oriented Screening Instrument for Teenagers (POSIT) substance use/abuse subscale in adolescent patients in an urban federally qualified health center.

    Science.gov (United States)

    Kelly, Sharon M; O'Grady, Kevin E; Gryczynski, Jan; Mitchell, Shannon Gwin; Kirk, Arethusa; Schwartz, Robert P

    2017-01-01

    The Problem Oriented Screening Instrument for Teenagers (POSIT) substance use/abuse subscale has been validated with high school students, adolescents with criminal justice involvement, and adolescent substance use treatment samples using the Diagnostic and Statistical Manual of Mental Disorders (DSM)-III-R and DSM-IV. This study examines the concurrent validity of the POSIT's standard 17-item substance use/abuse subscale and a revised, shorter 11-item version using DSM-5 substance use disorder diagnoses. Adolescents (N = 525; 93% African American, 55% female) 12-17 years of age awaiting primary care appointments at a Federally Qualified Health Center in Baltimore, Maryland completed the 17-item POSIT substance use/abuse subscale and items from a modified World Mental Health Composite International Diagnostic Interview corresponding to DSM-5 alcohol use disorder (AUD) and cannabis use disorder (CUD). Receiver operating characteristic curves, sensitivities, and specificities were examined with DSM-5 AUD, CUD, and a diagnosis of either or both disorders for the standard and revised subscales using risk cutoffs of either 1 or 2 POSIT "yes" responses. For the 17-item subscale, sensitivities were generally high using either cutoff (range: 0.79-1.00), although a cutoff of 1 was superior (sensitivities were 1.00 for AUD, CUD, and for either disorder). Specificities were also high using either cutoff (range: 0.81-0.95) but were higher using a cutoff of 2. For the 11-item subscale, a cutoff of 1 yielded higher sensitivities than a cutoff of 2 (ranges for 1 and 2: 0.96-1.00 and 0.79-0.86, respectively). Specificities for this subscale were higher using a cutoff of 2 (ranges for 1 and 2: 0.82-0.89 and 0.89-0.96, respectively). Findings suggest that the POSIT's substance use/abuse subscale is a potentially useful tool for screening adolescents in primary care for AUD or CUD using a cutoff of 1 or 2. The briefer, revised subscale may be preferable to the standard subscale in

  19. New Ideas on the Design of the Web-Based Learning System Oriented to Problem Solving from the Perspective of Question Chain and Learning Community

    Science.gov (United States)

    Zhang, Yin; Chu, Samuel K. W.

    2016-01-01

    In recent years, a number of models concerning problem solving systems have been put forward. However, many of them stress on technology and neglect the research of problem solving itself, especially the learning mechanism related to problem solving. In this paper, we analyze the learning mechanism of problem solving, and propose that when…

  20. Large Neighborhood Search

    DEFF Research Database (Denmark)

    Pisinger, David; Røpke, Stefan

    2010-01-01

    Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better...... candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method,we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood...

  1. German Orientalism

    OpenAIRE

    Margaret Olin

    2011-01-01

    Review of: Suzanne L. Marchand, German Orientalism in the Age of Empire: Religion, Race and Scholarship, Cambridge and Washington, D.C.: Cambridge University Press, 2009. This analysis of Suzanne L. Marchand’s German Orientalism in the Age of Empire: Religion, Race and Scholarship reads her contribution in part against the background of Edward Said’s path breaking book Orientalism. Differences lie in her more expansive understanding of the term ‘Oriental’ to include the Far East and her conce...

  2. Orienteering injuries

    OpenAIRE

    Folan, Jean M.

    1982-01-01

    At the Irish National Orienteering Championships in 1981 a survey of the injuries occurring over the two days of competition was carried out. Of 285 individual competitors there was a percentage injury rate of 5.26%. The article discusses the injuries and aspects of safety in orienteering.

  3. Search Help

    Science.gov (United States)

    Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.

  4. How does firm performance influence market orientation?

    DEFF Research Database (Denmark)

    Sørensen, Hans Eibe; Stieglitz, Nils

    This paper contributes by investigating how firm performance influences its market orientation. We draw on the aspiration-level model from the behavioral theory of the firm to develop testable propositions that substantiate and extend prior market orientation research. Specifically, we address how...... performance influences firms' market-oriented search behavior (responsive or proactive) and the allocation of attention (customer and competitor orientation) as well as the formation of aspiration levels. Research and managerial implications are discussed....

  5. Complete local search with memory

    NARCIS (Netherlands)

    Ghosh, D.; Sierksma, G.

    2000-01-01

    Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we introduce a new neighborhood search heuristic

  6. Aspect-Oriented Programming

    NARCIS (Netherlands)

    Lopes, C.; Bergmans, Lodewijk; Lopes, C.

    1999-01-01

    Aspect-oriented programming is a promising idea that can improve the quality of software by reduce the problem of code tangling and improving the separation of concerns. At ECOOP’97, the first AOP workshop brought together a number of researchers interested in aspectorientation. At ECOOP’98, during

  7. The problems of professional training of practice-oriented specialists for small enterprises of footwear and leather production industries in Uzbekistan

    Science.gov (United States)

    Ilkhamova, M. U.; Gafurov, J. K.; Maksudova, U. M.; Vassiliadis, S.

    2017-10-01

    At the present, the State authorities of the Republic of Uzbekistan pay special attention to the development of small and medium businesses and, in particular, to the enterprises oriented on manufacturing products with high added value. The leather and footwear industry of Uzbekistan is one of the dynamically developing sectors of economy. However, the study of the situation demonstrates that the increase in number of small and medium footwear and leather enterprises that have taken place in recent years, is not accompanied by a formation of corresponding professional training system for the enterprises, especially for associate specialists. The analysis of the legal base disclosed that the professional training level in footwear industry enterprises does not meet the up-to-date manufacturing requirements. The study is devoted to the issues of professional training of practice-oriented staff - the specialists for small enterprises of footwear and leather industry. The main task is the development of new vocational courses and programs for the training and professional development of personnel at all levels. The basic stages of complete staff training cycle for footwear sector have been determined based on the practical experience of staff training for small footwear enterprises in Greece. The 3-6 months duration short-term courses recommended for associate and medium level specialists have been developed and evaluated.

  8. Sex differences in young children's use of tools in a problem-solving task : The role of object-oriented play.

    Science.gov (United States)

    Gredlein, Jeffrey M; Bjorklund, David F

    2005-06-01

    Three-year-old children were observed in two free-play sessions and participated in a toy-retrieval task, in which only one of six tools could be used to retrieve an out-of-reach toy. Boys engaged in more object-oriented play than girls and were more likely to use tools to retrieve the toy during the baseline tool-use task. All children who did not retrieve the toy during the baseline trials did so after being given a hint, and performance on a transfer-of-training tool-use task approached ceiling levels. This suggests that the sex difference in tool use observed during the baseline phase does not reflect a difference in competency, but rather a sex difference in motivation to interact with objects. Amount of time boys, but not girls, spent in object-oriented play during the free-play sessions predicted performance on the tool-use task. The findings are interpreted in terms of evolutionary theory, consistent with the idea that boys' and girls' play styles evolved to prepare them for adult life in traditional environments.

  9. In Search of Insight.

    Science.gov (United States)

    Kaplan, Craig A.; Simon, Herbert A.

    1990-01-01

    Attaining the insight needed to solve the Mutilated Checkerboard problem, which requires discovery of an effective problem representation (EPR), is described. Performance on insight problems can be predicted from the availability of generators and constraints in the search for an EPR. Data for 23 undergraduates were analyzed. (TJH)

  10. Search for a planet

    International Nuclear Information System (INIS)

    Tokovinin, A.A.

    1986-01-01

    The problem of search for star planets is discussed in a popular form. Two methods of search for planets are considered: astrometric and spectral. Both methods complement one another. An assumption is made that potential possessors of planets are in the first place yellow and red dwarfs with slow axial rotation. These stars are the most numerous representatives of Galaxy population

  11. Guided Search for Triple Conjunctions

    OpenAIRE

    Nordfang, Maria; Wolfe, Jeremy M

    2014-01-01

    A key tenet of Feature Integration Theory and related theories such as Guided Search (GS) is that the binding of basic features requires attention. This would seem to predict that conjunctions of features of objects that have not been attended should not influence search. However, Found (1998) reported that an irrelevant feature (size) improved the efficiency of search for a color × orientation conjunction if it was correlated with the other two features across the display compared to the cas...

  12. Heuristic Search Theory and Applications

    CERN Document Server

    Edelkamp, Stefan

    2011-01-01

    Search has been vital to artificial intelligence from the very beginning as a core technique in problem solving. The authors present a thorough overview of heuristic search with a balance of discussion between theoretical analysis and efficient implementation and application to real-world problems. Current developments in search such as pattern databases and search with efficient use of external memory and parallel processing units on main boards and graphics cards are detailed. Heuristic search as a problem solving tool is demonstrated in applications for puzzle solving, game playing, constra

  13. An Adaptive Tabu Search Heuristic for the Location Routing Pickup and Delivery Problem with Time Windows with a Theater Distribution Application

    National Research Council Canada - National Science Library

    Burks, Jr, Robert E

    2006-01-01

    .... The location routing problem (LRP) is an extension of the vehicle routing problem where the solution identifies the optimal location of the depots and provides the vehicle schedules and distribution routes...

  14. Orienteering club

    CERN Multimedia

    Club d'orientation

    2015-01-01

    Course d'orientation La reprise des courses d’orientation était attendue dans la région puisque près de 150 coureurs ont participé à la première épreuve automnale organisée par le club d’orientation du CERN sur le site de La Faucille. Les circuits ont été remportés par Yann Locatelli du club d’Orientation Coeur de Savoie avec 56 secondes d’avance sur Damien Berguerre du club SOS Sallanches pour le parcours technique long, Marie Vuitton du club CO CERN (membre également de l’Equipe de France Jeune) pour le parcours technique moyen avec presque 4 minutes d’avance sur Jeremy Wichoud du club Lausanne-Jorat, Victor Dannecker pour le circuit technique court devant Alina Niggli, Elliot Dannecker pour le facile moyen et Alice Merat sur le facile court, tous membres du club O’Jura. Les résultats comp...

  15. Oriental cholangiohepatitis

    International Nuclear Information System (INIS)

    Scheible, F.W.; Davis, G.B.; California Univ., San Diego, La Jolla

    1981-01-01

    The recent influx of immigrants from Southeast Asia into the United States has increased the likelihood of encountering unusual diseases heretofore rarely seen in this country. Among these disorders is Oriental cholangiohepatitis, a potentially life-threatening process whose early diagnosis is facilitated by roentgenographic findings. Ultrasonography can also provide useful information, although potential pitfalls in diagnosis should be recognized. (orig.)

  16. Oriental cholangiohepatitis

    Energy Technology Data Exchange (ETDEWEB)

    Scheible, F.W.; Davis, G.B.

    1981-07-15

    The recent influx of immigrants from Southeast Asia into the United States has increased the likelihood of encountering unusual diseases heretofore rarely seen in this country. Among these disorders is Oriental cholangiohepatitis, a potentially life-threatening process whose early diagnosis is facilitated by roentgenographic findings. Ultrasonography can also provide useful information, although potential pitfalls in diagnosis should be recognized.

  17. Motivos paganos en mosaicos cristianos y judíos de Oriente : problemática e interpretación (I

    Directory of Open Access Journals (Sweden)

    Pau Figueras

    2000-01-01

    Full Text Available Muchos de los pavimentos de mosaico paviméntales descubiertos en las antiguas provincias romanas de Oriente (Siria, Arabia, Palestina se fechan ya en el periodo bizantino (siglos iv al vii (d.C. y provienen principalmente de las antiguas iglesias y sinagogas. Sin embargo, son numerosos los motivos de tipo mitológico y alegórico pagano que aparecen en ellos, y no todos los estudiosos concuerdan en la interpretación que hay que dar a este fenómeno. El fin principal del presente estudio es un intento de interpretación de tales temas a base de confrontaros en detalle con judíos, acerca del paganismo en general y de muchos de los motivos en particular. En este primer artículo introductorio se analizan tanto las opiniones de los principales autores modernos como la actitud ambivalente de los varios padres de la Iglesia ante la persistencia de la cultura pagana y sus manifestaciones artísticas.Many of the mosaic pavements discovered in the ancient Román provinces of the East (Syria, Aragia, palestine are dated to the Byzantine period (fourth to seventh centuries CE., mostly recovered from churches and synagogues. Even so, numerous mythological and pagan allegorical motifs appear on them, and not all scholars agree on the interpretation to be glven to this phenomenon. The present study aims mainly to interpret these motifs in deetail through their confrontation with the opinons expressed by ancient authors, Christian and Jews alike, abaut paganism in general and some of the motifs in particular.

  18. Motivos paganos en mosaicos cristianos y judíos de Oriente : problemática e interpretación (IV

    Directory of Open Access Journals (Sweden)

    Pau Figueras

    2002-01-01

    Full Text Available Varias representaciones de escenas, personajes y animales de origen pagano fueron utilizadas por cristianos y judíos de Oriente en la decoración de sus iglesias y sinagogas. Sin que fuese considerada una alegoría, la figura de Orfeo inspiró algunas representaciones de Adán, del rey David y de Jesucristo. El ave fénix y los grifones formaban parte del bestiario cristiano, al igual que el águila de Zeus y el pavo real de Hera, ahora símbolos de vida eterna. La convivencia entre animales enemigos evocaba la esperada la paz paradisíaca, y lo mismo hacían las llamadas «vides pobladas» con sus recuerdos dionisíacos. Viejos mitos de maternidad pudieron haber inspirado la figura de una mujer amamantando su hijito, como tradicionales representaciones de filósofos paganos inspiraron las de Cristo y sus acompañantes en la escena de la Transfiguración.Christians and Jews in the East used certain representations of pagan origin to decórate their churches and synagogues. Without being considerad an allegory, Orpheus'figure inspirad soma representations of Adam, king David and Jesús Christ. Phoanix and griffon bacame part of tha Christian bestiary togethar with Zeus' eagle and Hara's paacock, now symbols of everlasting lifa. The axpactad peace of Paradisa was avoked by anamy animáis living togathar, and a similar role played the «populated» vinas with thair Dionisiac ramambrances. Ancient maternity myths might have inspirad the figure of a woman breastfeading har chiid, as tha traditional representation of pagan philosophers inspirad those of Christ and his companions in the scene of the Transfiguration.

  19. Modified harmony search

    Science.gov (United States)

    Mohamed, Najihah; Lutfi Amri Ramli, Ahmad; Majid, Ahmad Abd; Piah, Abd Rahni Mt

    2017-09-01

    A metaheuristic algorithm, called Harmony Search is quite highly applied in optimizing parameters in many areas. HS is a derivative-free real parameter optimization algorithm, and draws an inspiration from the musical improvisation process of searching for a perfect state of harmony. Propose in this paper Modified Harmony Search for solving optimization problems, which employs a concept from genetic algorithm method and particle swarm optimization for generating new solution vectors that enhances the performance of HS algorithm. The performances of MHS and HS are investigated on ten benchmark optimization problems in order to make a comparison to reflect the efficiency of the MHS in terms of final accuracy, convergence speed and robustness.

  20. Search Patterns

    CERN Document Server

    Morville, Peter

    2010-01-01

    What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont

  1. An Adaptive Tabu Search Heuristic for the Location Routing Pickup and Delivery Problem with Time Windows with a Theater Distribution Application

    Science.gov (United States)

    2006-08-01

    including approximations of delivery costs. The solution of a sub-problem provides input for another sub-problem. Perl (1983) and Perl and Daskin (1985...developed in this section represents a modification and combination of both the three-layer location routing formulation of Perl and Daskin (1985) and the...1985) LRP formulation to create the LPDPTW. 4.2.1 Generalization of the LRP Perl and Daskin (1985) utilize a fixed charge location problem as the

  2. Adaptive Large Neighbourhood Search

    DEFF Research Database (Denmark)

    Røpke, Stefan

    Large neighborhood search is a metaheuristic that has gained popularity in recent years. The heuristic repeatedly moves from solution to solution by first partially destroying the solution and then repairing it. The best solution observed during this search is presented as the final solution....... This tutorial introduces the large neighborhood search metaheuristic and the variant adaptive large neighborhood search that dynamically tunes parameters of the heuristic while it is running. Both heuristics belong to a broader class of heuristics that are searching a solution space using very large...... neighborhoods. The tutorial also present applications of the adaptive large neighborhood search, mostly related to vehicle routing problems for which the heuristic has been extremely successful. We discuss how the heuristic can be parallelized and thereby take advantage of modern desktop computers...

  3. Problems arising in connection with the commissioning of experts in conflict-oriented implementation of nuclear law. The legal status of expert opinions in administrative procedures under the Atomic Energy Act

    International Nuclear Information System (INIS)

    Fiebig, T.H.

    1995-01-01

    Court decisions available so far do not primarily consider the problems linked to the commissioning of an expert and his mandate, as well as the legal status of the commissioning of an expert as an administrative act which might be legally contestable. Thus there are at present no court decisions that would create legal certainty in matters of the act of commissioning a nuclear expert opinion. The current legal situation is such that an independent order for commissioning of an expert opinion in compliance with section 19 III AtG (Atomic Energy Act), which in general is given in response to the refusal of the facility operator to do so, can be independently contested on the basis of section 44 a, sentence 2 VwGO (Rules of Administrative Courts). The current practice of conflict-oriented, or nuclear power phase-out-oriented, implementation of the nuclear law poses a threat to our constitutional state and to our democracy. The supply of energy as a common good is of essential importance and thus deserves fair and objective treatment free of emotions, including the matter of nuclear energy. In cases of nuclear licensing procedures meeting with impedimental treatment by a Land government favouring the nuclear power phase-out, this treatment however not fitting into the Land governments' overall political line, there is reason to call upon the Federal Government to take action for clarifying the situation. (orig./HP) [de

  4. Orientation Club

    CERN Multimedia

    Club d'orientation

    2014-01-01

    COURSE ORIENTATION Résultats de samedi 10 mai    C’est sur une carte entièrement réactualisée dans les bois de Versoix, que plus de 100 coureurs sont venus participer à la course d’orientation, type longue distance, préparée par des membres du club du CERN. Le terrain plutôt plat nécessitait une orientation à grande vitesse, ce qui a donné les podiums suivants :  Technique long avec 17 postes : 1er Jurg Niggli, O’Jura en 52:48, 2e Beat Muller, COLJ Lausanne-Jorat en 58:02, 3e Christophe Vuitton, CO CERN en 58:19 Technique moyen avec 13 postes : 1er Jean-Bernard Zosso, CO CERN, en 46:05 ; 2e Yves Rousselot, Balise 25 Besançon, en 55:11 ; 3e Laurent Merat, O'Jura, en 55:13 Technique court avec 13 postes : 1er Julien Vuitton, CO CERN en 40:59, 2e Marc Baumgartner, CO CERN en 43:18, 3e Yaelle Mathieu en 51:42 Su...

  5. Orienteering Club

    CERN Multimedia

    Club d'orientation

    2013-01-01

    Courses d’orientation ce printemps Le Club d’orientation du CERN vous invite à venir découvrir la course d’orientation et vous propose, en partenariat avec d’autres clubs de la région, une dizaine de courses populaires. Celles-ci ont lieu les samedis après-midi, elles sont ouvertes à tous, quel que soit le niveau, du débutant au sportif confirmé, en famille ou en individuel, en promenade ou en course. Si vous êtes débutant vous pouvez profiter d’une petite initiation offerte par l’organisateur avant de vous lancer sur un parcours. Divers types de parcours sont à votre choix lors de chaque épreuve : facile court (2-3 km), facile moyen (3-5 km), technique court (3-4 km), technique moyen (4-5 km) et technique long (5-7 km). Les dates à retenir sont les suivantes : Samedi 23 mars: Pully (Vd) Samedi 13 avril: Pougny...

  6. Measurement Axis Searching Model for Terrestrial Laser Scans Registration

    Directory of Open Access Journals (Sweden)

    Shaoxing Hu

    2016-01-01

    Full Text Available Nowadays, terrestrial Lidar scans can cover rather a large area; the point densities are strongly varied because of the line-of-sight measurement principle in potential overlaps with scans taken from different viewpoints. Most of the traditional methods focus on registration algorithm and ignore searching model. Sometimes the traditional methods are directly used to align two point clouds; a large critically unsolved problem of the large biases will be created in areas distant from the overlaps while the local overlaps are often aligned well. So a novel measurement axis searching model (MASM has been proposed in this paper. The method includes four steps: (1 the principal axis fitting, (2 the measurement axis generation, (3 low-high-precision search, and (4 result generation. The principal axis gives an orientation to the point cloud; the search scope is limited by the measurement axis. The point cloud orientation can be adjusted gradually until the achievement of the global optimum using low- and high-precision search. We perform some experiments with simulated point clouds and real terrestrial laser scans. The results of simulated point clouds have shown the processing steps of our method, and the results of real terrestrial laser scans have shown the sensitivity of the approach with respect to the indoor and outdoor scenes.

  7. Project Communication in Functions, Process and Project-Oriented Industiral Companies

    Science.gov (United States)

    Samáková, Jana; Koltnerová, Kristína; Rybanský, Rudolf

    2012-12-01

    The article is focused on the project communication management. Industrial enterprises, which use project management must constantly search the new ways for improving. One of the possibilities is the change of management from a functional oriented to the projectoriented or process-oriented. Process-oriented and project-oriented companies have better project communication management during the all project life cycle. Communication in the project is a very important factor. According to the arguments of several authors, one of the biggest problem is that threaten the success of the project is just the communication. In each project is an important pillar - and that is communication. Only on the base of communication can the project move forward and achieve the target.

  8. APPLICATION OF A PRIMAL-DUAL INTERIOR POINT ALGORITHM USING EXACT SECOND ORDER INFORMATION WITH A NOVEL NON-MONOTONE LINE SEARCH METHOD TO GENERALLY CONSTRAINED MINIMAX OPTIMISATION PROBLEMS

    Directory of Open Access Journals (Sweden)

    INTAN S. AHMAD

    2008-04-01

    Full Text Available This work presents the application of a primal-dual interior point method to minimax optimisation problems. The algorithm differs significantly from previous approaches as it involves a novel non-monotone line search procedure, which is based on the use of standard penalty methods as the merit function used for line search. The crucial novel concept is the discretisation of the penalty parameter used over a finite range of orders of magnitude and the provision of a memory list for each such order. An implementation within a logarithmic barrier algorithm for bounds handling is presented with capabilities for large scale application. Case studies presented demonstrate the capabilities of the proposed methodology, which relies on the reformulation of minimax models into standard nonlinear optimisation models. Some previously reported case studies from the open literature have been solved, and with significantly better optimal solutions identified. We believe that the nature of the non-monotone line search scheme allows the search procedure to escape from local minima, hence the encouraging results obtained.

  9. Improved product planning by problem-oriented use of preventive quality management methods; Verbesserte Produktplanung durch den problemorientierten Einsatz praeventiver Qualitaetsmanagementmethoden

    Energy Technology Data Exchange (ETDEWEB)

    Lesmeister, F.

    2001-07-01

    The development of innovative products meeting the customer's needs is getting increasingly complex. The production cost and the time to market must be reduced constantly. Modern methods of preventive quality management like QFD, FMEA and Target Costing offer help but they tend to be complex and costly. The author attempted a modularisation of the methods, with the possibility of linking modules as desired using a commercially available software. [German] Die Entwicklung innovativer, den Kundenbeduerfnissen entsprechender Produkte wird zunehmend komplexer. Die Unternehmen sind gezwungen, die Kosten der Produkterstellung stetig zu reduzieren und den Time-to-Market zu verkuerzen. Moderne Methoden des praeventiven Qualitaetsmanagements wie das QFD, die FMEA und das Target Costing bieten Unterstuetzungsmoeglichkeiten zur Loesung der damit zusammenhaengenden Probleme. Doch ist der Einsatz der oft komplizierten Methoden sehr aufwendig. Gruende hierfuer sind die oft starren Anwendungsschemata, die einem situationsspezifischen Einsatz der Methoden entgegenstehen, und die fehlende Verknuepfung der Methoden. Ergebnis der Arbeit ist eine Modularisierung der Methoden und eine Verknuepfung der einzelnen Methodenmodule. Hierdurch koennen die Methoden an die jeweilige Problemsituation angepasst eingesetzt und dadurch der gesamte Produktentwicklungsprozess durchgaengig unterstuetzt werden. Die Anwendung der Methoden wird mittels einer auf dem Markt erhaeltlichen Software unterstuetzt. (orig.)

  10. Personalized Search

    CERN Document Server

    AUTHOR|(SzGeCERN)749939

    2015-01-01

    As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.

  11. The 2P1/2 → 2P3/2 laser transition in atomic iodine and the problem of search for signals from extraterrestrial intelligence

    International Nuclear Information System (INIS)

    Kutaev, Yu F; Mankevich, S K; Nosach, O Yu; Orlov, E P

    2007-01-01

    It is proposed to search for signals from extraterrestrial intelligence (ETI) at a wavelength of 1.315 μm of the laser 2 P 1/2 → 2 P 3/2 transition in the atomic iodine, which can be used for this purpose as the natural frequency reference. The search at this wavelength is promising because active quantum filters (AQFs) with the quantum sensitivity limit have been developed for this wavelength, which are capable of receiving laser signals, consisting of only a few photons, against the background of emission from a star under study. In addition, high-power iodine lasers emitting diffraction-limited radiation at 1.315 μm have been created, which highly developed ETI also can have. If a ETI sends in our direction a diffraction-limited 10-ns, 1-kJ laser pulse with the beam diameter of 10 m, a receiver with an AQF mounted on a ten-meter extra-atmospheric optical telescope can detect this signal at a distance of up to 300 light years, irrespective of the ETI position on the celestial sphere. The realisation of the projects for manufacturing optical telescopes of diameter 30 m will increase the research range up to 2700 light years. A weak absorption of the 1.315-μm radiation in the Earth atmosphere (the signal is attenuated by less than 20%) allows the search for ETI signals by using ground telescopes equipped with adaptive optical systems. (laser applications and other topics in quantum electronics)

  12. Switching strategies to optimize search

    International Nuclear Information System (INIS)

    Shlesinger, Michael F

    2016-01-01

    Search strategies are explored when the search time is fixed, success is probabilistic and the estimate for success can diminish with time if there is not a successful result. Under the time constraint the problem is to find the optimal time to switch a search strategy or search location. Several variables are taken into account, including cost, gain, rate of success if a target is present and the probability that a target is present. (paper: interdisciplinary statistical mechanics)

  13. Strong orientational coordinates and orientational order parameters for symmetric objects

    International Nuclear Information System (INIS)

    Haji-Akbari, Amir; Glotzer, Sharon C

    2015-01-01

    Recent advancements in the synthesis of anisotropic macromolecules and nanoparticles have spurred an immense interest in theoretical and computational studies of self-assembly. The cornerstone of such studies is the role of shape in self-assembly and in inducing complex order. The problem of identifying different types of order that can emerge in such systems can, however, be challenging. Here, we revisit the problem of quantifying orientational order in systems of building blocks with non-trivial rotational symmetries. We first propose a systematic way of constructing orientational coordinates for such symmetric building blocks. We call the arising tensorial coordinates strong orientational coordinates (SOCs) as they fully and exclusively specify the orientation of a symmetric object. We then use SOCs to describe and quantify local and global orientational order, and spatiotemporal orientational correlations in systems of symmetric building blocks. The SOCs and the orientational order parameters developed in this work are not only useful in performing and analyzing computer simulations of symmetric molecules or particles, but can also be utilized for the efficient storage of rotational information in long trajectories of evolving many-body systems. (paper)

  14. Orienteering club

    CERN Multimedia

    Club d'orientation

    2013-01-01

    Courses d’orientation Le soleil enfin de retour a incité nombre de sportifs et promeneurs à nous rejoindre dans la belle forêt de Challex /Pougny pour la deuxième étape de notre coupe de printemps 2013. Certains sont revenus crottés et fourbus alors que d’autres avaient les joues bien roses après un grand bol d’air frais. Mais tous avaient passé un agréable moment dans la nature. Nous rappelons que nos activités sont ouvertes à tous, jeunes, moins jeunes, sportifs, familles, du CERN ou d’ailleurs, et que le seul inconvénient est que si vous goûtez à la course d’orientation, il vous sera difficile de ne pas y revenir ! Samedi 20 avril 2013, nous serons sur le Mont Mourex (entre Gex et Divonne) pour notre prochaine épreuve et vous y serez les bienvenus. Les inscriptions et les départ...

  15. Orienteering club

    CERN Multimedia

    Club d’Orientation du CERN

    2015-01-01

    Courses d’orientation Nouvelle saison nouveau programme Le Club d’orientation du CERN, en partenariat avec d’autres clubs de la région, vous propose une dizaine de courses populaires comptant pour la coupe Genevoise de printemps: samedi 28 mars: Vernand Dessus samedi 18 avril: Pougny/Challex samedi 25 avril: Chancy/Valleiry samedi 2 mai: Mauvernay samedi 9 mai: Longchaumois samedi 16 mai: Genolier samedi 30 mai: Prevondavaux samedi 6 juin: Biere-Ballens samedi 13 juin: Haut-Jura samedi 20 juin: Bonmont - Finale Ces courses sont ouvertes à tous, quel que soit le niveau, du débutant au sportif confirmé, en famille ou en individuel, en promenade ou en course. Les inscriptions se font sur place le jour de l’épreuve. Si vous êtes débutant, vous pouvez profiter d’une initiation offerte par l’organisateur avant de vous lancer sur un parcours. Le club propose aussi...

  16. Orienteering club

    CERN Multimedia

    Orienteering Club

    2016-01-01

    Course d'orientation Calendrier des courses d’orientation Coupe genevoise d’automne 2016 Samedi 3 septembre : La Faucille (01) Samedi 10 septembre : Prémanon (39) Samedi 17 septembre : Saint-Cergue (VD) Samedi 24 septembre : Jorat / Corcelles (VD) Samedi 1 octobre: Bière - Ballens (VD) -relais Vendredi 14 octobre : Parc Mon Repos (GE) - nocturne Samedi 15 octobre : Terrasse de Genève (74) Samedi 29 octobre : Bonmont (VD) Samedi 5 novembre : Pomier (74) – one-man-relay - Finale   Courses ouvertes à toutes et à tous, sportifs, familles, débutants ou confirmés, du CERN ou d’ailleurs. Cinq circuits disponibles, ceci va du facile court (2 km) adapté aux débutants et aux enfants jusqu’au parcours technique long de 6 km pour les chevronnés en passant par les parcours facile moyen (4&am...

  17. COURSE ORIENTATION

    CERN Multimedia

    Club d'orientation du CERN

    2015-01-01

      Les coureurs d’orientation de la région se sont donné rendez-vous samedi dernier dans les bois de Pougny/Challex lors de l’épreuve organisée par le club d’orientation du CERN. La carte proposée pour les 5 circuits offrait aussi bien un coté très technique avec un relief pentu qu’un coté avec de grandes zones plates à forêt claire. Le parcours technique long comportant 20 postes a été remporté par Beat Muller du COLJ Lausanne en 56:26 devançant Denis Komarov, CO CERN en 57:30 et Yvan Balliot, ASO Annecy en 57:46. Pour les autres circuits les résultats sont les suivants: Technique moyen (13 postes): 1er Joël Mathieu en 52:32 à une seconde du 2e Vladimir Kuznetsov, COLJ Lausanne-Jorat, 3e Jean-Bernard Zosso, CO CERN, en 54:01 Technique court (12 postes): 1er Lennart Jirden, ...

  18. Orienteering Club

    CERN Multimedia

    Club d'Orientation

    2013-01-01

    Course d’orientation Face aux Championnats de France des Clubs à Poitiers, et à une météo hivernale (vent glaciale et pluie), il ne restait qu’une cinquantaine d’orienteurs pour participer à l’épreuve organisée le samedi 25 mai à Grange-Malval. Les participants ont tout de même bien apprécié les 5 circuits proposés par le Satus Genève. Les résultats sont disponibles sur notre site http://cern.ch/club-orientation. En plus des résultats, vous pourrez noter des informations sur la nouvelle école de CO encadrée par B. Barge, Prof. EPS à Ferney-Voltaire pour les jeunes à partir de 6 ans. La prochaine étape de la coupe genevoise se déroulera samedi 1er juin à Morez (39). Epreuve organisée par le club O’Jura&nb...

  19. Orienteering Club

    CERN Multimedia

    Le Club d’orientation du CERN

    2017-01-01

    COURSE ORIENTATION Finale de la coupe d’automne Le club d’orientation du CERN (COC Genève) a organisé sa dernière course populaire de la saison samedi 4 novembre au lieu-dit Les Terrasses de Genève (74). Cette 9e épreuve qui se courait sous la forme d’un One-Man-Relay, clôturait ainsi la coupe genevoise d’automne dont les lauréats sont : Circuit technique long : 1. Julien Vuitton (COC Genève), 2. Berni Wehrle (COC Genève), 3. Christophe Vuitton (COC Genève). Circuit technique moyen : 1. Vladimir Kuznetsov (Lausanne-Jorat), 2. J.-Bernard Zosso (COC Genève), 3. Laurent Merat (O’Jura). Circuit technique court : 1. Thibault Rouiller (COC Genève), 2. exæquo Lennart Jirden (COC Genève) et Katya Kuznetsova (Lausanne-Jorat). Circuit facile moyen : 1. Tituan Barge ...

  20. Orienteering Club

    CERN Multimedia

    Le Club d’orientation du CERN

    2017-01-01

    COURSE ORIENTATION Finale de la coupe d’automne Le club d’orientation du CERN (COC Genève) a organisé sa dernière course populaire de la saison samedi 4 novembre au lieu-dit Les Terrasses de Genève (74). Cette 9e épreuve qui se courait sous la forme d’un One-Man-Relay, clôturait ainsi la coupe genevoise d’automne dont les lauréats sont : Circuit technique long : 1. Julien Vuitton (COC Genève), 2. Berni Wehrle (COC Genève), 3. Christophe Vuitton (COC Genève). Circuit technique moyen : 1. Vladimir Kuznetsov (Lausanne-Jorat), 2. J.-Bernard Zosso (COC Genève), 3. Laurent Merat (O’Jura). Circuit technique court : 1. Thibault Rouiller (COC Genève), 2. exæquo Lennart Jirden (COC Genève) et Katya Kuznetsova (Lausanne-Jorat). Circuit facile moyen : 1. Tituan Barge...

  1. Orienteering Club

    CERN Multimedia

    Club d'Orientation

    2015-01-01

    Course orientation C’est au pied du Salève, proche du Golf de Bosset, que le club d’orientation du CERN (CO CERN) a organisé samedi 19 septembre une nouvelle épreuve comptant pour la Coupe Genevoise d’automne. La zone « des Terrasses de Genève » avait été cartographiée et mise en service l’année dernière. Les participants ont pu apprécier un terrain ludique avec beaucoup de microreliefs, de points d’eau et de gros rochers, le tout au milieu d’une forêt assez claire et agréable à courir. Sur le parcours technique long, le résultat a été très serré puisque Pierrick Merino du club d’Annecy a gagné avec seulement 9 secondes d’avance sur Gaëtan Vuitton (CO CERN) qui confiait avoir perdu beaucoup du te...

  2. Orienteering Club

    CERN Multimedia

    Le Club d’orientation du CERN

    2017-01-01

    Course orientation Les courses d’orientation comptant pour la coupe genevoise de printemps s’enchainent dans la région franco-suisse. Samedi dernier, une bonne centaine de coureurs se sont retrouvés au Mont Mourex où le club du CERN avait préparé la sixième épreuve. A l’issue de la course, les participants confirmaient l’exigence des circuits, à savoir la condition physique et le côté technique du traçage. Le parcours technique long comportant 20 postes a été remporté par Darrell High du Care Vevey en 1:22:38 devançant Beat Muller du COLJ Lausanne-Jorat en 1:25:25 et Alison High également du Care Vevey en 1:28:51. Le circuit technique moyen a été remporté par Christophe Vuitton du CO CERN et le circuit technique court par Claire-Lise Rouiller, CO CERN. Les trois pr...

  3. Orienteering Club

    CERN Multimedia

    Club d'orientation

    2010-01-01

    COURSE D’ORIENTATION La finale de la coupe de printemps Après avoir remporté le challenge club, samedi 29 juin lors du relais inter-club à Lausanne, le Club d’orientation du CERN organisait la dernière étape de la coupe genevoise de printemps samedi 5 juin à Saint-Cergue dans les bois de Monteret (Canton de Vaud). Plus de 100 participants se sont déplacés pour venir participer à la finale et découvrir une toute nouvelle carte dans une forêt vallonnée. Les résultats pour chaque circuit de cette étape sont : Technique long : 1. Jurg Niggli du club O’Jura, 2. Clément Poncet, 3. Oystein Midttun. Technique moyen : 1. Zoltan Trocsanyi CO CERN, 2. Christophe Ingold, 3. Christina Falga. Technique court : 1. Pierre-Andre Baum, CARE Vevey, 2. Emese Szunyog, 3. Solène Balay. Facile moyen : 1. Elisa P...

  4. Club Orientation

    CERN Multimedia

    Club d'orientation

    2014-01-01

      COURSE ORIENTATION   Pas moins de 100 concurrents sont venus s’affronter sur les parcours proposés par le club d’orientation du CERN ce samedi 26 avril lors de la 4e étape de la coupe genevoise de printemps. Les podiums ont été attribués à :  Technique long avec 19 postes : 1er Yvan Balliot, ASO Annecy en 1:01:39 ; 2e Dominique Fleurent, ASO Annecy, en 1:05:12 ; 3e Rémi Fournier, SOS Sallanches, en 1:05:40. Technique moyen avec 14 postes : 1er Jean-Bernard Zosso, CO CERN, en 46:42 ; 2e Céline Zosso, CO CERN, en 50:51 ; 3e Clément Poncet, O’Jura Prémanon, en 51:27. Technique court avec 13 postes : 1er Jaakko Murtomaki, YKV Seinaejoki, en 36:04 ; 2e Marc Baumgartner en 41:27 ; 3e Natalia Niggli, O’Jura Prémanon, en 52:43. Sur les parcours facile moyen et facile court, victoire respectivement de Stéphanie...

  5. Orienteering Club

    CERN Multimedia

    Le Club d’orientation du CERN

    2017-01-01

    Calendrier des courses de la Coupe Genevoise – printemps 2017 Club d'orientation - Julien,  jeune membre du club. Le Club d’orientation du CERN, en partenariat avec d’autres clubs de la région, vous propose une série de courses populaires, qui se dérouleront des deux côtés de la frontière franco-suisse, à savoir : Samedi 1 avril : Pougny/Challex (01) Samedi 8 avril: Ballens (VD) Samedi 22 avril: Apples (VD) Samedi 29 avril: Mont Mussy (01) Samedi 6 mai: Prémanon (39) Samedi 13 mai: Mont Mourex (01) Samedi 20 mai: Prévondavaux (VD) Samedi 10 juin: Chancy/Valleiry (74) Samedi 17 juin: Trélex - Finale (VD) Ces courses sont ouvertes à tous, quel que soit le niveau, du débutant au sportif confirmé, en famille ou en individuel. Les inscriptions sur un des 5 parcours proposés se font sur place le jour de l...

  6. Firm Search for External Knowledge

    DEFF Research Database (Denmark)

    Sofka, Wolfgang; Grimpe, Christoph

    2012-01-01

    ignored the institutional context that provides or denies access to external knowledge at the country level. Combining institutional and knowledge search theory, we suggest that the market orientation of the institutional environment and the magnitude of institutional change influence when firms begin......The innovation performance of modern firms is increasingly determined by their ability to search and absorb external knowledge. However, after a certain threshold firms "oversearch" their environment and innovation performance declines. In this paper, we argue that prior literature has largely...... to experience the negative performance effects of oversearch. Based on a comprehensive sample of almost 8,000 firms from ten European countries, we find that institutions matter considerably for firms' search activity. Higher market orientation of institutions increases the effectiveness of firms' search...

  7. Oriented Approach

    Directory of Open Access Journals (Sweden)

    Seyed Mohammad Moghimi

    2013-12-01

    Full Text Available Promoting productivity is one of the goals of usinginformation technology in organizations. The purpose of this research isexamining the impact of IT on organizational productivity andrecognizing its mechanisms based on process-oriented approach. For thisend, by reviewing the literature of the subject a number of impacts of ITon organizational processes were identified. Then, through interviewswith IT experts, seven main factors were selected and presented in aconceptual model. This model was tested through a questionnaire in 148industrial companies. Data analysis shows that impact of IT onproductivity can be included in the eight major categories: Increasing ofthe Automation, Tracking, Communication, Improvement, Flexibility,Analytic, Coordination and Monitoring in organizational processes.Finally, to improve the impact of information technology onorganizational productivity, some suggestions are presented.

  8. Some problems on target-area selection for searching interstratified infiltration sandstone-type uranium deposits suitable to in-situ leaching

    International Nuclear Information System (INIS)

    Hu Shaokang

    2005-01-01

    The sandstone-type uranium deposits are widely distributed in the world, but only 3 regions where deposits reach uranium province size and are suitable for in-situ leaching have been found. Deposits are all of the interstratified-oxidation type, and developed at the combination sites of the most recent orogenic belt with young or old platforms in form of 'branching, inclining and disappearing' of the former. Geomorphologically, these regions consist of 3 big 'steps' from high mountain regions through lower mountains or hills to the margins of the basin, which are in form of declining slope and form a good hydrodynamic conditions. Climatically, an arid climate was always required for the period of sandstone-type uranium ore formation, while annual evaporation is higher than the annual precipitation, the high mountain regions with high potential energy of water melted from glacier and snow which is thought to be a long-term and steady underground water supplier for lower mountains or hill regions and the margins of the basin. However, in orogenic belt there is a good number of inter-mountain basins with at least two big 'steps' indicating a good potential to discover interstratified-oxidation sandstone-type uranium deposits in coal-bearing basins. Many Chinese and foreign uranium geologists have noticed that there is an east-west oriented Hercynian uranium mineralization belt lying across the middle of Europe, the eastern section is superimposed on the Ural-Tianshan-Mongolian mobile belt and together with the latter it was infected by the Alpine-Himalayan movement in Meso-Cenozoic. This resulted in a complicated metallogenic scene with different ore-forming times, multiple types of deposits, and spatial concentration. In addition, a sub-meridional-oriented 'Vebris belt' running through the eastern part of Asia is considered as combination part of the Central Asian mobile belt with the Western Pacific mobile belt which reflects inhomogeneity in crustal construction of

  9. Cuckoo Search with flight of Levy applied to the problem of reload of fuels in nuclear reactors; Busca Cuco com voo de Levy aplicado ao problema de recarga de combustiveis em reatores nucleares

    Energy Technology Data Exchange (ETDEWEB)

    Silva, Patrick V.; Nast, Fernando N.; Schirru, Roberto; Meneses, Anderson A.M., E-mail: patrickvs@hotmail.com, E-mail: fernandonnast@gmail.com, E-mail: anderson.meneses@pq.cnpq.br, E-mail: schirru@lmp.ufrj.br [Universidade Federal do Oeste do Para (UFOPA), Santarem, PA (Brazil). Instituto de Engenharia e Geociencias. Programa de Ciencia e Tecnologia; Coordenacao de Pos-Graduacao e Pesquisa de Engenharia (COPPE/UFRJ) RJ (Brazil). Programa de Engenharia Nuclear

    2017-11-01

    Intra-Nuclear Fuel Management Optimization is a complex combinatorial problem of the NP-difficult type, associated with the refueling process of a nuclear reactor, which aims to extend the cycle of operation by determining loading patterns, obeying safety margins. In addition to the combinatorial problem, we have the aspect of calculations of reactor physics, which increases the difficult of OGCIN. Methods that are proving effective when applied to OGCIN are the algorithms belonging to the swarm intelligence paradigm. A new member of this paradigm is Cuckoo Search (CS), which has shown results promising when applied to optimization issues. The CS is based on the litter parasitism of some cuckoo species combined with the Levy flight behavior of some birds. In the present work we present the results of the application of CS to OGCIN, and compare them to the results obtained by the application of ABC.

  10. The Roles of recognition processes and look-ahead search in time-constrained expert problem solving: Evidence from grandmaster level chess.

    OpenAIRE

    Gobet, F; Simon, H A

    1996-01-01

    Chess has long served as an important standard task environment for research on human memory and problem-solving abilities and processes. In this paper, we report evidence on the relative importance of recognition processes and planning (look-ahead) processes in very high level expert performance in chess. The data show that the rated skill of a top-level grandmaster is only slightly lower when he is playing simultaneously against a half dozen grandmaster opponents than under tournament con...

  11. Search Advertising

    OpenAIRE

    Cornière (de), Alexandre

    2016-01-01

    Search engines enable advertisers to target consumers based on the query they have entered. In a framework with horizontal product differentiation, imperfect product information and in which consumers incur search costs, I study a game in which advertisers have to choose a price and a set of relevant keywords. The targeting mechanism brings about three kinds of efficiency gains, namely lower search costs, better matching, and more intense product market price-competition. A monopolistic searc...

  12. Problem Oriented Differential Diagnosis of Tropical Diseases

    Science.gov (United States)

    1989-09-01

    glomerulonephritis. 13. Varicella ( chicken pox ): rare complication. II. Nephrotic syndrome A distinctive lesion associated with nephrotic syndrome in West...hypersensitivity reactions, Stevens-Johnson syndrome, toxic nephrosis, and hypoglycemia. Studies in Mexico have shown that bismuth subsalicylate tablets are...typhus fever 7 14 Murine typhus 14 26 Q fever 10 21 Rickettsial pox 3 14 Rocky mountain spotted fever 6 21 Scrub typhus 2 10 Tick-borne rickettsioses

  13. Faceted Search

    CERN Document Server

    Tunkelang, Daniel

    2009-01-01

    We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more

  14. Factors associated with students' orientations to nursing.

    Science.gov (United States)

    Vanhanen, L; Janhonen, S

    2000-05-01

    Factors associated with students' orientations to nursing This paper presents the results of a study focusing on the factors associated with orientations to nursing. Students' orientations to nursing have not as yet been a focus of nursing research. In some other professions, however, professional orientation has been associated with learning motivation and study performance, and has been seen as a predictor of work satisfaction. In this study, students' orientations to nursing were defined in terms of caring, nursing expertise and life orientation. The hypothesis of whether students' pre-educational experiences of nursing, gender, choice of nursing specialty, problems with nursing studies and intention to stay in nursing were associated with different orientations was tested. The extent to which students were orientated to caring, nursing expertise and their own life was also examined. The orientation to nursing measurement tool, which has been developed on the basis of a qualitative study, was used to collect the data. Nurse teachers collected the data from nursing students (n=184) who were studying in three different nursing programmes in Finland. Non-parametric assessments (Mann-Whitney U-test and Kruskal-Wallis test) of the differences between the students' orientations were carried out. A majority of the students were highly life-orientated, and two-thirds had average nursing expertise or caring orientation scores. The results supported the study hypothesis of an association between students' orientations and their gender, choice of nursing speciality, problems with nursing studies and intention to stay in nursing. However, the hypothesis of an association between students' pre-educational nursing experiences and orientation to nursing was not supported. The contradictions between students' orientation to nursing and the philosophy of nursing underlying the study programme may be a source of motivational problems and dissatisfaction with nursing education

  15. Orienteering Club

    CERN Multimedia

    Club d'orientation

    2013-01-01

    Course d'orientation Le coup d’envoi de la coupe genevoise a été donné samedi 31 août dans les bois de Combe Froide à Prémanon. Plus de 150 coureurs avaient fait le déplacement. Les parcours facile court, facile moyen et technique court ont été remportés par des coureurs du club O’Jura - Ulysse Dannecker, Léo Lonchampt, Franck Lonchampt, le technique moyen par Pekka Marti du club Ol Biel Seeland et le technique long par Térence Risse du CA Rosé – également membre de l’équipe nationale suisse des moins de 20 ans. Pour le club du CERN, les meilleures résultats ont été obtenus pas Emese Szunyog sur technique court et Marie Vuitton sur technique moyen avec une 4e place. La prochaine course aura lieu samedi 14 septembre à La Faucille. Le club propose aussi...

  16. Orienteering club

    CERN Multimedia

    Club d'orientation

    2014-01-01

    Course d'orientation Finale de la coupe d’automne La dernière épreuve de la coupe d’automne organisée par le club s’est déroulée ce samedi 1er novembre avec une course type «one-man-relay» dans la forêt de Trelex (Vd). Les concurrents des circuits techniques devaient parcourir trois boucles et ceux des circuits «faciles» deux boucles, avec changements de carte. Le parcours technique long a été remporté par un membre du club, Berni Wehrle. A l’issue de cette course, le Président du club, L. Jirden annonçait le classement général de la coupe d’automne, basé sur les 6 meilleurs résultats de la saison : Circuit technique long : 1er Juerg Niggli (O’Jura), 2e Berni Wehrle, 3e Beat Mueller. Circuit technique moyen : 1er Laurent Merat (O&r...

  17. Orienteering club

    CERN Multimedia

    Club d'orientation

    2013-01-01

    Course d'orientation Finale de la coupe genevoise Rapide et méthodique, voilà les qualités dont il fallait faire preuve pour remporter la dernière étape de la coupe organisée par le club du CERN dans les bois de Monteret. Il s’agissait d’une course au score où chaque concurrent disposait d’un temps imparti pour poinçonner le maximum de balises. Le parcours technique a été remporté par Tomas Shellman et le parcours facile par Victor Dannecker. Cette dernière étape était aussi décisive pour la désignation des lauréats de la coupe genevoise de printemps. Les résultats officiels étaient donnés par le président du club, L. Jirden : Circuit Technique Long : Berni Wehrle, Bruno Barge, Edvins Reisons Circuit Technique Moyen : J.-Bernard Zosso, ...

  18. Orienteering Club

    CERN Multimedia

    Club d'Orientation

    2011-01-01

    Course d'orientation Avec la CO en nocturne organisée par le club du CERN vendredi 14 octobre au stade des Eveaux (Ge), et la CO à Savigny (Vd) proposée par le club de Lausanne-Jorat le lendemain, les étapes de la coupe genevoise d’automne s’enchainent rapidement. Il ne reste plus que 3 rendez-vous pour boucler la saison. Les premières places devraient certainement se jouer entre des membres du club du CERN, du O’Jura ou de Lausanne-Jorat. La prochaine course du club est programmée pour samedi 22 octobre à Pomier, près de Cruseilles. L’accueil se fera à partir de 12h30 et les départs s’échelonneront de 13h à 15h. * * * * * * * Nouvelle belle victoire samedi 8 octobre à Saint Cergue du jeune finlandais Ville Keskisaari (COLJ) en 50:56 devant Jürg Niggli (O’Jura) en 1:03:32, et Alexandre...

  19. Orienteering Club

    CERN Document Server

    Club d'orientation

    2013-01-01

    De jour comme de nuit Les amateurs de course d’orientation ont pu s’en donner à cœur joie ce week-end puisqu’ils avaient la possibilité de courir sur deux épreuves en moins de 24 heures. En effet, le club du CERN organisait une course de nuit aux Evaux et la 7e étape de la coupe genevoise se tenait samedi après-midi dans les bois du Grand Jorat à Savigny. Les vainqueurs pour chaque course sont : Technique long CO de nuit: Julien Charlemagne, SOS Sallanches CO samedi: Philipp Khlebnikov, ANCO   Technique moyen CO de nuit: Céline Zosso, CO CERN CO samedi: Pavel Khlebnikov, ANCO Technique court CO de nuit: Colas Ginztburger, SOS Sallanches CO samedi: Victor Kuznetsov, COLJ Lausannne Facile moyen CO de nuit: Gaëtan Rickenbacher, CO CERN CO samedi: Tamas Szoke   Facile court CO de nuit:Oriane Rickenbacher, CO CERN CO samedi: Katya Kuznetsov...

  20. Orienteering Club

    CERN Multimedia

    Club d'Orientation

    2015-01-01

    Course orientation Finale de la coupe genevoise La série des courses de printemps s’est achevée samedi dernier dans les bois de Bonmont (Vaud) avec une épreuve «one-man-relay» organisée par le club. Le vainqueur du parcours technique  long, Yann Locatelli (Club de Chambéry Savoie) a réalisé les deux boucles comportant 24 balises avec presque 6 minutes d’avance sur le second concurrent Domenico Lepori (Club CARE Vevey). Cette dernière étape était aussi décisive pour la désignation des lauréats de la coupe genevoise de printemps, en comptabilisant les 6 meilleurs résultats sur les 10 épreuves. Le podium officiel était donné par le président du club, L. Jirden, qui profitait de l’occasion pour remercier tous les participants et également tous les...

  1. Orienteering Club

    CERN Multimedia

    CLUB D'ORIENTATION

    2013-01-01

    Calendrier de la coupe d’automne Le Club d’orientation du CERN, en partenariat avec d’autres clubs de la région, vous propose, pour cette nouvelle coupe d’automne genevoise, une série de 10 courses. Le club du O’Jura donnera le coup d’envoi le samedi 31 août. Les courses s’enchaîneront selon le calendrier suivant : Samedi 31 août : Prémanon (39) - longue distance Samedi 14 septembre : La Faucille (01) - longue distance Samedi 21 septembre : Saint Cergue (VD) - longue distance Samedi 28 septembre : Ballens (VD) - relais Samedi 5 octobre : La Pile (VD) - longue distance Vendredi 11 octobre : Les Evaux (GE) - nocturne Samedi 12 octobre : Grand Jorat, Savigny (VD) - longue distance Samedi 19 octobre : Terrasses de Genève (74) - longue distance Samedi 26 octobre : Prémanon (39) - longue distance Samedi 2 novembre : Bois Tollot (GE) - score - Finale Les &a...

  2. Orienteering club

    CERN Multimedia

    Club d'orientation

    2014-01-01

    Course d'orientation C’est sous un beau soleil samedi 4 octobre que s’est déroulée la 6e étape de la Coupe genevoise d’automne organisée par le club. Plus d’une centaine de concurrents provenant de 7 clubs de CO avaient fait le déplacement pour courir sur un des cinq parcours proposés dans les bois de Trélex-Génolier (VD). Le podium est le suivant : Technique long (5,9 km, 19 postes) : 1er Jurg Niggli, O’Jura (1:00:02); 2e Berni Wehrle, CO CERN (1:06:44); 3e Konrad Ehrbar, COLJ (1:07:08) Technique moyen (4,8 km, 18 postes) : 1er Christophe Vuitton, CO CERN (54:25); 2e J.B. Zosso, CO CERN (1:01:19); 3e Jeremy Wichoud, COLJ (1:06:21) Technique court (3,8 km, 14 postes) : 1er Julien Vuitton, CO CERN (36:19); 2e Vladimir Kuznetsov, COLJ (48:47); 3e Natalia Niggli, O’Jura (50:38) Facile moyen (3,2 km, 11 postes) : 1ère Alina Niggli, O&...

  3. Orienteering Club

    CERN Multimedia

    Club d'Orientation

    2012-01-01

    Relais inter-club/Challenge Carlo Milan Samedi dernier, lors de l’épreuve de course d’orientation organisée par le club du O’Jura, le moteur de la discipline était l’esprit d’équipe, puisqu’il était question d’un relais inter-club avec le Challenge Carlo Milan. Les clubs avaient aligné leurs coureurs soit sur le relais technique (trois participants) soit sur le relais facile (deux participants). Côté O’Jura, il fallait noter la participation de François Gonon, champion du monde 2011, côté club du CERN, Marie et Gaëtan Vuitton, jeunes espoirs du club, devaient préparer la piste pour lancer le dernier relayeur. Côté Lausanne-Jorat, il fallait compter sur le très jeune Viktor Kuznetsov. Les 31 équipes engagées n’ont pas m&ea...

  4. Orienteering Club

    CERN Multimedia

    Club d'Orientation

    2012-01-01

     Finale de la coupe de printemps   La dernière course d’orientation comptant pour la Coupe de printemps a eu lieu samedi dernier dans le village des Rousses et vers le Fort. Il s’agissait d’un sprint organisé par le club O’Jura. Les temps de course ont avoisiné les 20 minutes que ce soit pour le parcours technique moyen ou technique long. Tous les habitués étaient au rendez-vous pour venir consolider ou améliorer leur place au classement. A l’issue de cette course, le classement général de la Coupe de printemps prenant en compte les 6 meilleurs résultats des 9 courses était établi et les lauréats de chaque catégorie sont les suivants: Circuit technique long : 1er Berni Wehrle, 2e Bruno Barge, 3e Edvins Reisons. Circuit technique moyen : 1er Jean-Bernard Zosso, 2e Cédric Wehrl&...

  5. Orienteering club

    CERN Multimedia

    Club d'orientation

    2010-01-01

    COURSE D’ORIENTATION  De La Rippe à Sauvabellin, la coupe genevoise continue ! Le rendez-vous était donné samedi 8 mai aux amateurs de course d’orientation dans les bois de La Rippe (Canton de Vaud). Cette 6e épreuve était organisée par le Club Satus Grutli de Genève. Il est dommage que les participants n’aient pas été aussi nombreux que lors des dernières courses, les Championnats de France des clubs à Dijon ayant certainement retenus plus d’un compétiteur. La première place est revenue à : – Technique long : Berni Wehrle – Technique moyen : Jean-Bernard Zosso – Technique court : Berni Wehrle – Facile moyen : Peter Troscanyi – Facile court : Claire Droz. Il ne restera plus que deux épreuves ...

  6. Orienteering club

    CERN Multimedia

    Club d'orientation

    2013-01-01

    Courses d’orientation Samedi 20 avril, les organisateurs du Club de CO du CERN ont accueilli au Mont Mourex 70 participants qui n’ont pas hésité à venir malgré la forte bise. Berni Wehrle du CO CERN s’est octroyé la première place en 1:04:49 sur le parcours technique long devant Pyry Kettunen du Saynso Juankoski en 1:06:52, la 3e place revenant à Bruno Barge, CO CERN, à 7 secondes. Les autres parcours ont été remportés par : Technique moyen : 1er Jacques Moisset, Chamonix (47:44), 2e Yves Rousselot, Balise 25 Besançon (57:16), 3e Jean-Bernard Zosso, CO CERN (59:28). Technique court : 1er Victor Kuznetsov, COLJ (51:53), 2e Pierrick Collet, CO CERN (1:12:52), 3e Dominique Balay, CO CERN (1:16:04). Pour les parcours facile moyen et facile court, Ralf Nardini et Léa Nicolas, tous deux du CO CERN, terminaient respectivement premier. Voi...

  7. Improvement Of Search Process In Electronic Catalogues

    Directory of Open Access Journals (Sweden)

    Titas Savickas

    2014-05-01

    Full Text Available The paper presents investigation on search in electronic catalogues. The chosen problem domain is the search system in the electronic catalogue of Lithuanian Academic Libraries. The catalogue uses ALEPH system with MARC21 bibliographic format. The article presents analysis of problems pertaining to the current search engine and user expectations related to the search system of the electronic catalogue of academic libraries. Subsequent to analysis, the research paper presents the architecture for a semantic search system in the electronic catalogue that uses search process designed to improve search results for users.

  8. Emotion-oriented systems

    CERN Document Server

    Pelachaud, Catherine

    2013-01-01

    The Affective Computing domain, term coined by Rosalind Picard in 1997, gathers several scientific areas such as computer science, cognitive science, psychology, design and art. The humane-machine interaction systems are no longer solely fast and efficient. They aim to offer to users affective experiences: user's affective state is detected and considered within the interaction; the system displays affective state; it can reason about their implication to achieve a task or resolve a problem. In this book, we have chosen to cover various domains of research in emotion-oriented systems. Our aim

  9. Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  10. The Optimization of the Time-Cost Tradeoff Problem in Projects with Conditional Activities Using of the Multi-Objective Charged System Search Algorithm (SMOCSS

    Directory of Open Access Journals (Sweden)

    M. K. Sharbatdar

    2016-11-01

    Full Text Available Abstract The appropriate planning and scheduling for reaching the project goals in the most economical way is the very basic issue of the project management. As in each project, the project manager must determine the required activities for the implementation of the project and select the best option in the implementation of each of the activities, in a way that the least final cost and time of the project is achieved. Considering the number of activities and selecting options for each of the activities, usually the selection has not one unique solution, but it consists of a set of solutions that are not preferred to each other and are known as Pareto solutions. On the other hand, in some actual projects, there are activities that their implementation options depend on the implementation of the prerequisite activity and are not applicable using all the implementation options, and even in some cases the implementation or the non-implementation of some activities are also dependent on the prerequisite activity implementation. These projects can be introduced as conditional projects. Much researchs have been conducted for acquiring Pareto solution set, using different methods and algorithms, but in all the done tasks the time-cost optimization of conditional projects is not considered. Thus, in the present study the concept of conditional network is defined along with some practical examples, then an appropriate way to illustrate these networks and suitable time-cost formulation of these are presented. Finally, for some instances of conditional activity networks, conditional project time-cost optimization conducted multi-objectively using known meta-heuristic algorithms such as multi-objective genetic algorithm, multi-objective particle swarm algorithm and multi-objective charged system search algorithm.

  11. Object-Oriented Type Systems

    DEFF Research Database (Denmark)

    Schwartzbach, Michael Ignatieff; Palsberg, Jens

    a type system that generalizes and explains them. The theory is based on an idealized object-oriented language called BOPL (Basic Object Programming Language), containing common features of the above languages. A type system, type inference algorithm, and typings of inheritance and genericity......Object-Oriented Type Systems Jens Palsberg and Michael I. Schwartzbach Aarhus University, Denmark Type systems are required to ensure reliability and efficiency of software. For object-oriented languages, typing is an especially challenging problem because of inheritance, assignment, and late...... are provided for BOPL. Throughout, the results are related to the languages on which BOPL is based. This text offers advanced undergraduates and professional software developers a sound understanding of the key aspects of object-oriented type systems. All algorithms are implemented in a freely available...

  12. Composite Differential Search Algorithm

    Directory of Open Access Journals (Sweden)

    Bo Liu

    2014-01-01

    Full Text Available Differential search algorithm (DS is a relatively new evolutionary algorithm inspired by the Brownian-like random-walk movement which is used by an organism to migrate. It has been verified to be more effective than ABC, JDE, JADE, SADE, EPSDE, GSA, PSO2011, and CMA-ES. In this paper, we propose four improved solution search algorithms, namely “DS/rand/1,” “DS/rand/2,” “DS/current to rand/1,” and “DS/current to rand/2” to search the new space and enhance the convergence rate for the global optimization problem. In order to verify the performance of different solution search methods, 23 benchmark functions are employed. Experimental results indicate that the proposed algorithm performs better than, or at least comparable to, the original algorithm when considering the quality of the solution obtained. However, these schemes cannot still achieve the best solution for all functions. In order to further enhance the convergence rate and the diversity of the algorithm, a composite differential search algorithm (CDS is proposed in this paper. This new algorithm combines three new proposed search schemes including “DS/rand/1,” “DS/rand/2,” and “DS/current to rand/1” with three control parameters using a random method to generate the offspring. Experiment results show that CDS has a faster convergence rate and better search ability based on the 23 benchmark functions.

  13. Biased Predecessor Search

    DEFF Research Database (Denmark)

    Bose, Prosenjit; Fagerberg, Rolf; Howat, John

    2016-01-01

    We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data structures that achieve expected query times logarithmic...

  14. Biased predecessor search

    DEFF Research Database (Denmark)

    Bose, Prosenjit; Fagerberg, Rolf; Howat, John

    2014-01-01

    We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data structures that achieve expected query times logarithmic...

  15. Quantum Search and Beyond

    Science.gov (United States)

    2008-07-02

    mechanics leads to non-local paradoxical effects (physicists sometimes call this "spooky action at a distance"). Spatial searching is the problem where...resource of EPR pairs, and that they use the states |0L〉 = |00〉+ |11〉 (|1L〉 = |00〉 − |11〉) to encode a logical zero (one). Note that each of them can set

  16. Search and imperative programming

    NARCIS (Netherlands)

    K.R. Apt (Krzysztof); A. Schaerf

    1996-01-01

    textabstractWe augment the expressive power of imperative programming in order to make it a more attractive vehicle for problems that involve search.The proposed additions are limited yet powerful and are inspired by the logic programming paradigm.We illustrate their use by presenting solutions to a

  17. Entity associations for search

    NARCIS (Netherlands)

    Reinanda, R.

    2017-01-01

    In this thesis, we investigate the broad problem of computing entity associations for search. Specifically, we consider three types of entity association: entity-entity, entity-document, and entity-aspect associations. We touch upon various domains, starting with specific domains such as the

  18. Guided search for triple conjunctions.

    Science.gov (United States)

    Nordfang, Maria; Wolfe, Jeremy M

    2014-08-01

    A key tenet of feature integration theory and of related theories such as guided search (GS) is that the binding of basic features requires attention. This would seem to predict that conjunctions of features of objects that have not been attended should not influence search. However, Found (1998) reported that an irrelevant feature (size) improved the efficiency of search for a Color × Orientation conjunction if it was correlated with the other two features across the display, as compared to the case in which size was not correlated with color and orientation features. We examined this issue with somewhat different stimuli. We used triple conjunctions of color, orientation, and shape (e.g., search for a red, vertical, oval-shaped item). This allowed us to manipulate the number of features that each distractor shared with the target (sharing) and it allowed us to vary the total number of distractor types (and, thus, the number of groups of identical items: grouping). We found that these triple conjunction searches were generally very efficient--producing very shallow Reaction Time × Set Size slopes, consistent with strong guidance by basic features. Nevertheless, both of the variables, sharing and grouping, modulated performance. These influences were not predicted by previous accounts of GS; however, both can be accommodated in a GS framework. Alternatively, it is possible, though not necessary, to see these effects as evidence for "preattentive binding" of conjunctions.

  19. Understanding search trees via statistical physics

    Indian Academy of Sciences (India)

    ary search tree model (where stands for the number of branches of the search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain exact asymptotic results.

  20. Collinearity Impairs Local Element Visual Search

    Science.gov (United States)

    Jingling, Li; Tseng, Chia-Huei

    2013-01-01

    In visual searches, stimuli following the law of good continuity attract attention to the global structure and receive attentional priority. Also, targets that have unique features are of high feature contrast and capture attention in visual search. We report on a salient global structure combined with a high orientation contrast to the…