Science.gov

Sample records for heuristic mastermind strategies

  1. Heuristic Strategies: An Aid for Solving Verbal Mathematical Problems.

    ERIC Educational Resources Information Center

    Giordano, Gerard

    1992-01-01

    Because of the importance of problem-solving skills in mathematics instruction of children with learning disabilities, this article offers guidance on teaching heuristic global strategies, including use of analogy, annotating problems, detail analysis, deletion of details, detail sorting, symbolizing operations, and designating formulas. (DB)

  2. Heuristical Strategies on the Study Theme "The Unsaturated Hydrocarbons -- Alkenes"

    ERIC Educational Resources Information Center

    Naumescu, Adrienne Kozan; Pasca, Roxana-Diana

    2011-01-01

    The influence of heuristical strategies upon the level of two experimental classes is studied in this paper. The didactic experiment took place at secondary school in Cluj-Napoca, in 2008-2009 school year. The study theme "The Unsaturated Hydrocarbons--Alkenes" has been efficiently learned by using the most active methods: laboratory…

  3. Compensatory Reading among ESL Learners: A Reading Strategy Heuristic

    ERIC Educational Resources Information Center

    Ismail, Shaik Abdul Malik Mohamed; Petras, Yusof Ede; Mohamed, Abdul Rashid; Eng, Lin Siew

    2015-01-01

    This paper aims to gain an insight to the relationship of two different concepts about reading comprehension, namely, the linear model of comprehension and the interactive compensatory theory. Drawing on both the above concepts, a heuristic was constructed about three different reading strategies determined by the specific ways the literal,…

  4. Analysis of complex network performance and heuristic node removal strategies

    NASA Astrophysics Data System (ADS)

    Jahanpour, Ehsan; Chen, Xin

    2013-12-01

    Removing important nodes from complex networks is a great challenge in fighting against criminal organizations and preventing disease outbreaks. Six network performance metrics, including four new metrics, are applied to quantify networks' diffusion speed, diffusion scale, homogeneity, and diameter. In order to efficiently identify nodes whose removal maximally destroys a network, i.e., minimizes network performance, ten structured heuristic node removal strategies are designed using different node centrality metrics including degree, betweenness, reciprocal closeness, complement-derived closeness, and eigenvector centrality. These strategies are applied to remove nodes from the September 11, 2001 hijackers' network, and their performance are compared to that of a random strategy, which removes randomly selected nodes, and the locally optimal solution (LOS), which removes nodes to minimize network performance at each step. The computational complexity of the 11 strategies and LOS is also analyzed. Results show that the node removal strategies using degree and betweenness centralities are more efficient than other strategies.

  5. Cracking Bank PINs by Playing Mastermind

    NASA Astrophysics Data System (ADS)

    Focardi, Riccardo; Luccio, Flaminia L.

    The bank director was pretty upset noticing Joe, the system administrator, spending his spare time playing Mastermind, an old useless game of the 70ies. He had fought the instinct of telling him how to better spend his life, just limiting to look at him in disgust long enough to be certain to be noticed. No wonder when the next day the director fell on his chair astonished while reading, on the newspaper, about a huge digital fraud on the ATMs of his bank, with millions of Euros stolen by a team of hackers all around the world. The article mentioned how the hackers had 'played with the bank computers just like playing Mastermind', being able to disclose thousands of user PINs during the one-hour lunch break. That precise moment, a second before falling senseless, he understood the subtle smile on Joe's face the day before, while training at his preferred game, Mastermind.

  6. Fieldwork Game Play: Masterminding Evidentiality in Desano

    ERIC Educational Resources Information Center

    Silva, Wilson; AnderBois, Scott

    2016-01-01

    In this paper, we propose a methodology for collecting naturally occurring data on evidentials and epistemic modals. We use Desano (Eastern Tukanoan) as a case study. This language has a complex evidential system with six evidential forms. The methodology in question consists of having Desano speakers to play a logic game, "Mastermind".…

  7. Heuristic Strategies for Persuader Selection in Contagions on Complex Networks

    PubMed Central

    Wang, Peng; Zhang, Li-Jie; Xiao, Gaoxi

    2017-01-01

    Individual decision to accept a new idea or product is often driven by both self-adoption and others’ persuasion, which has been simulated using a double threshold model [Huang et al., Scientific Reports 6, 23766 (2016)]. We extend the study to consider the case with limited persuasion. That is, a set of individuals is chosen from the population to be equipped with persuasion capabilities, who may succeed in persuading their friends to take the new entity when certain conditions are satisfied. Network node centrality is adopted to characterize each node’s influence, based on which three heuristic strategies are applied to pick out persuaders. We compare these strategies for persuader selection on both homogeneous and heterogeneous networks. Two regimes of the underline networks are identified in which the system exhibits distinct behaviors: when networks are sufficiently sparse, selecting persuader nodes in descending order of node centrality achieves the best performance; when networks are sufficiently dense, however, selecting nodes with medium centralities to serve as the persuaders performs the best. Under respective optimal strategies for different types of networks, we further probe which centrality measure is most suitable for persuader selection. It turns out that for the first regime, degree centrality offers the best measure for picking out persuaders from homogeneous networks; while in heterogeneous networks, betweenness centrality takes its place. In the second regime, there is no significant difference caused by centrality measures in persuader selection for homogeneous network; while for heterogeneous networks, closeness centrality offers the best measure. PMID:28072847

  8. Heuristic Strategies for Persuader Selection in Contagions on Complex Networks.

    PubMed

    Wang, Peng; Zhang, Li-Jie; Xu, Xin-Jian; Xiao, Gaoxi

    2017-01-01

    Individual decision to accept a new idea or product is often driven by both self-adoption and others' persuasion, which has been simulated using a double threshold model [Huang et al., Scientific Reports 6, 23766 (2016)]. We extend the study to consider the case with limited persuasion. That is, a set of individuals is chosen from the population to be equipped with persuasion capabilities, who may succeed in persuading their friends to take the new entity when certain conditions are satisfied. Network node centrality is adopted to characterize each node's influence, based on which three heuristic strategies are applied to pick out persuaders. We compare these strategies for persuader selection on both homogeneous and heterogeneous networks. Two regimes of the underline networks are identified in which the system exhibits distinct behaviors: when networks are sufficiently sparse, selecting persuader nodes in descending order of node centrality achieves the best performance; when networks are sufficiently dense, however, selecting nodes with medium centralities to serve as the persuaders performs the best. Under respective optimal strategies for different types of networks, we further probe which centrality measure is most suitable for persuader selection. It turns out that for the first regime, degree centrality offers the best measure for picking out persuaders from homogeneous networks; while in heterogeneous networks, betweenness centrality takes its place. In the second regime, there is no significant difference caused by centrality measures in persuader selection for homogeneous network; while for heterogeneous networks, closeness centrality offers the best measure.

  9. Hitch-hiking: a parallel heuristic search strategy, applied to the phylogeny problem.

    PubMed

    Charleston, M A

    2001-01-01

    The article introduces a parallel heuristic search strategy ("Hitch-hiking") which can be used in conjunction with other random-walk heuristic search strategies. It is applied to an artificial phylogeny problem, in which character sequences are evolved using pseudo-random numbers from a hypothetical ancestral sequence. The objective function to be minimized is the minimum number of character-state changes required on a binary tree that could account for the sequences observed at the tips (leaves) of the tree -- the Maximum Parsimony criterion. The Hitch-hiking strategy is shown to be useful in that it is robust and that on average the solutions found using the strategy are better than those found without. Also the strategy can dynamically provide information on the characteristics of the landscape of the problem. I argue that Hitch-hiking as a scheme for parallelization of existing heuristic search strategies is of potentially very general use, in many areas of combinatorial optimization.

  10. Superheroes and masterminds of plant domestication.

    PubMed

    Martínez-Ainsworth, Natalia E; Tenaillon, Maud I

    2016-01-01

    Domestication is one of the most fundamental changes in the evolution of human societies. The geographical origins of domesticated plants are inferred from archaeology, ecology and genetic data. Scenarios vary among species and include single, diffuse or multiple independent domestications. Cultivated plants present a panel of traits, the "domestication syndrome" that distinguish them from their wild relatives. It encompasses yield-, food usage-, and cultivation-related traits. Most genes underlying those traits are "masterminds" affecting the regulation of gene networks. Phenotypic convergence of domestication traits across species or within species between independently domesticated forms rarely coincides with convergence at the gene level. We review here current data/models that propose a protracted transition model for domestication and investigate the impact of mating system, life cycle and gene flow on the pace of domestication. Finally, we discuss the cost of domestication, pointing to the importance of characterizing adaptive functional variation in wild resources.

  11. The Development of a Culture of Problem Solving with Secondary Students through Heuristic Strategies

    ERIC Educational Resources Information Center

    Eisenmann, Petr; Novotná, Jarmila; Pribyl, Jirí; Brehovský, Jirí

    2015-01-01

    The article reports the results of a longitudinal research study conducted in three mathematics classes in Czech schools with 62 pupils aged 12-18 years. The pupils were exposed to the use of selected heuristic strategies in mathematical problem solving for a period of 16 months. This was done through solving problems where the solution was the…

  12. The development of a culture of problem solving with secondary students through heuristic strategies

    NASA Astrophysics Data System (ADS)

    Eisenmann, Petr; Novotná, Jarmila; Přibyl, Jiří; Břehovský, Jiří

    2015-12-01

    The article reports the results of a longitudinal research study conducted in three mathematics classes in Czech schools with 62 pupils aged 12-18 years. The pupils were exposed to the use of selected heuristic strategies in mathematical problem solving for a period of 16 months. This was done through solving problems where the solution was the most efficient if heuristic strategies were used. The authors conducted a two-dimensional classification of the use of heuristic strategies based on the work of Pólya (2004) and Schoenfeld (1985). We developed a tool that allows for the description of a pupil's ability to solve problems. Named, the Culture of Problem Solving (CPS), this tool consists of four components: intelligence, text comprehension, creativity and the ability to use existing knowledge. The pupils' success rate in problem solving and the changes in some of the CPS factors pre- and post-experiment were monitored. The pupils appeared to considerably improve in the creativity component. In addition, the results indicate a positive change in the students' attitude to problem solving. As far as the teachers participating in the experiment are concerned, a significant change was in their teaching style to a more constructivist, inquiry-based approach, as well as their willingness to accept a student's non-standard approach to solving a problem. Another important outcome of the research was the identification of the heuristic strategies that can be taught via long-term guided solutions of suitable problems and those that cannot. Those that can be taught include systematic experimentation, guess-check-revise and introduction of an auxiliary element. Those that cannot be taught (or can only be taught with difficulty) include the strategies of specification and generalization and analogy.

  13. Heuristic Chemistry--A Qualitative Study on Teaching Domain-Specific Strategies for the Six-Electron Case

    ERIC Educational Resources Information Center

    Graulich, Nicole; Tiemann, Rudiger; Schreiner, Peter R.

    2012-01-01

    We investigate the efficiency of domain-specific heuristic strategies in mastering and predicting pericyclic six-electron rearrangements. Based on recent research findings on these types of reactions a new concept has been developed that should help students identify and describe six-electron rearrangements more readily in complex molecules. The…

  14. Promoter-specific co-activation by Drosophila Mastermind

    PubMed Central

    Caudy, Michael A.

    2008-01-01

    Mastermind (Mam) is a co-activator protein of binary complexes consisting of Suppressor of Hairless (Su(H)) and Notch Intracellular Domain (NICD) proteins assembled on cis-regulatory regions of target genes activated by Notch signaling. Current evidence indicates that Mastermind is necessary and sufficient for the formation of a functional Su(H)/NICD/Mam ternary complex on at least one specific architecture of Su(H) binding sites, called the SPS element (Su(H) Paired Sites). However, using transcription assays with a combination of native and synthetic Notch target gene promoters in Drosophila cultured cells, we show here that co-activation of Su(H)/NICD complexes on SPS elements by Mam is promoter-specific. Our novel results suggest this promoter specificity is mediated by additional unknown cis-regulatory elements present in the native promoters that are required for the recruitment of Mam and formation of functional Su(H)/NICD/Mam complexes on SPS elements. Together, the findings in this study suggest Mam is not always necessary and sufficient for co-activation of binary Su(H)/NICD complexes on SPS elements. PMID:18930034

  15. Investigation of image corner features matching algorithm based on heuristic local geometric constrained strategy

    NASA Astrophysics Data System (ADS)

    An, Ru; Wang, Huilin; Fen, Xuezhi; Xu, Daxin; Ruan, Renzong

    2005-11-01

    The main aim of the study is to improve the performance of image matching algorithm of Scene Matching Aided Navigation System. In the paper, corner-based image matching algorithm with automatic search of homonymous corner pairs is discussed. Gaussian Low-pass Filter with different kernels according to the spatial resolution of reference image and real-time image are applied to the image in preprocessing stage to remove noise, to get over spatial resolution difference between reference image and real-time image and to enhance the repeatability of corner detection. A novel fast corner detector, which is based on SUSAN and the geometric structure analysis, is designed to extract corner features. Normalized co-correlation algorithm is applied in search of homonymous corner pairs through a small window centering corners. A heuristic local geometrically constrained strategy is employed to remove mis-matched corner pairs in initial matching stage. In the end, matched corners, in combination with a suitable polynomial algorithm, are used to match and rectify images.

  16. A heuristic biomarker selection approach based on professional tennis player ranking strategy.

    PubMed

    Han, Bin; Xie, Ruifei; Li, Lihua; Zhu, Lei; Wang, Shen

    2014-01-01

    Extracting significant features from high-dimension and small sample size biological data is a challenging problem. Recently, Michał Draminski proposed the Monte Carlo feature selection (MC) algorithm, which was able to search over large feature spaces and achieved better classification accuracies. However in MC the information of feature rank variations is not utilized and the ranks of features are not dynamically updated. Here, we propose a novel feature selection algorithm which integrates the ideas of the professional tennis players ranking, such as seed players and dynamic ranking, into Monte Carlo simulation. Seed players make the feature selection game more competitive and selective. The strategy of dynamic ranking ensures that it is always the current best players to take part in each competition. The proposed algorithm is tested on 8 biological datasets. Results demonstrate that the proposed method is computationally efficient, stable and has favorable performance in classification.

  17. Heuristic status polling

    DOEpatents

    Archer, Charles J.; Blocksome, Michael A.; Heidelberger, Philip; Kumar, Sameer; Parker, Jeffrey J.; Ratterman, Joseph D.

    2011-06-07

    Methods, compute nodes, and computer program products are provided for heuristic status polling of a component in a computing system. Embodiments include receiving, by a polling module from a requesting application, a status request requesting status of a component; determining, by the polling module, whether an activity history for the component satisfies heuristic polling criteria; polling, by the polling module, the component for status if the activity history for the component satisfies the heuristic polling criteria; and not polling, by the polling module, the component for status if the activity history for the component does not satisfy the heuristic criteria.

  18. Recursive heuristic classification

    NASA Technical Reports Server (NTRS)

    Wilkins, David C.

    1994-01-01

    The author will describe a new problem-solving approach called recursive heuristic classification, whereby a subproblem of heuristic classification is itself formulated and solved by heuristic classification. This allows the construction of more knowledge-intensive classification programs in a way that yields a clean organization. Further, standard knowledge acquisition and learning techniques for heuristic classification can be used to create, refine, and maintain the knowledge base associated with the recursively called classification expert system. The method of recursive heuristic classification was used in the Minerva blackboard shell for heuristic classification. Minerva recursively calls itself every problem-solving cycle to solve the important blackboard scheduler task, which involves assigning a desirability rating to alternative problem-solving actions. Knowing these ratings is critical to the use of an expert system as a component of a critiquing or apprenticeship tutoring system. One innovation of this research is a method called dynamic heuristic classification, which allows selection among dynamically generated classification categories instead of requiring them to be prenumerated.

  19. Heuristic thinking makes a chemist smart.

    PubMed

    Graulich, Nicole; Hopf, Henning; Schreiner, Peter R

    2010-05-01

    We focus on the virtually neglected use of heuristic principles in understanding and teaching of organic chemistry. As human thinking is not comparable to computer systems employing factual knowledge and algorithms--people rarely make decisions through careful considerations of every possible event and its probability, risks or usefulness--research in science and teaching must include psychological aspects of the human decision making processes. Intuitive analogical and associative reasoning and the ability to categorize unexpected findings typically demonstrated by experienced chemists should be made accessible to young learners through heuristic concepts. The psychology of cognition defines heuristics as strategies that guide human problem-solving and deciding procedures, for example with patterns, analogies, or prototypes. Since research in the field of artificial intelligence and current studies in the psychology of cognition have provided evidence for the usefulness of heuristics in discovery, the status of heuristics has grown into something useful and teachable. In this tutorial review, we present a heuristic analysis of a familiar fundamental process in organic chemistry--the cyclic six-electron case, and we show that this approach leads to a more conceptual insight in understanding, as well as in teaching and learning.

  20. Pitfalls in Teaching Judgment Heuristics

    ERIC Educational Resources Information Center

    Shepperd, James A.; Koch, Erika J.

    2005-01-01

    Demonstrations of judgment heuristics typically focus on how heuristics can lead to poor judgments. However, exclusive focus on the negative consequences of heuristics can prove problematic. We illustrate the problem with the representativeness heuristic and present a study (N = 45) that examined how examples influence understanding of the…

  1. Heuristics: foundations for a novel approach to medical decision making.

    PubMed

    Bodemer, Nicolai; Hanoch, Yaniv; Katsikopoulos, Konstantinos V

    2015-03-01

    Medical decision-making is a complex process that often takes place during uncertainty, that is, when knowledge, time, and resources are limited. How can we ensure good decisions? We present research on heuristics-simple rules of thumb-and discuss how medical decision-making can benefit from these tools. We challenge the common view that heuristics are only second-best solutions by showing that they can be more accurate, faster, and easier to apply in comparison to more complex strategies. Using the example of fast-and-frugal decision trees, we illustrate how heuristics can be studied and implemented in the medical context. Finally, we suggest how a heuristic-friendly culture supports the study and application of heuristics as complementary strategies to existing decision rules.

  2. ALMA Pipeline Heuristics

    NASA Astrophysics Data System (ADS)

    Lightfoot, J.; Wyrowski, F.; Muders, D.; Boone, F.; Davis, L.; Shepherd, D.; Wilson, C.

    2006-07-01

    The ALMA (Atacama Large Millimeter Array) Pipeline Heuristics system is being developed to automatically reduce data taken with the standard observing modes. The goal is to make ALMA user-friendly to astronomers who are not experts in radio interferometry. The Pipeline Heuristics system must capture the expert knowledge required to provide data products that can be used without further processing. Observing modes to be processed by the system include single field interferometry, mosaics and single dish `on-the-fly' maps, and combinations of these modes. The data will be produced by the main ALMA array, the ALMA Compact Array (ACA) and single dish antennas. The Pipeline Heuristics system is being developed as a set of Python scripts. For interferometry these use as data processing engines the CASA/AIPS++ libraries and their bindings as CORBA objects within the ALMA Common Software (ACS). Initial development has used VLA and Plateau de Bure data sets to build and test a heuristic script capable of reducing single field data. In this paper we describe the reduction datapath and the algorithms used at each stage. Test results are presented. The path for future development is outlined.

  3. The mastermind approach to CNS drug therapy: translational prediction of human brain distribution, target site kinetics, and therapeutic effects.

    PubMed

    de Lange, Elizabeth Cm

    2013-02-22

    Despite enormous advances in CNS research, CNS disorders remain the world's leading cause of disability. This accounts for more hospitalizations and prolonged care than almost all other diseases combined, and indicates a high unmet need for good CNS drugs and drug therapies.Following dosing, not only the chemical properties of the drug and blood-brain barrier (BBB) transport, but also many other processes will ultimately determine brain target site kinetics and consequently the CNS effects. The rate and extent of all these processes are regulated dynamically, and thus condition dependent. Therefore, heterogenious conditions such as species, gender, genetic background, tissue, age, diet, disease, drug treatment etc., result in considerable inter-individual and intra-individual variation, often encountered in CNS drug therapy.For effective therapy, drugs should access the CNS "at the right place, at the right time, and at the right concentration". To improve CNS therapies and drug development, details of inter-species and inter-condition variations are needed to enable target site pharmacokinetics and associated CNS effects to be translated between species and between disease states. Specifically, such studies need to include information about unbound drug concentrations which drive the effects. To date the only technique that can obtain unbound drug concentrations in brain is microdialysis. This (minimally) invasive technique cannot be readily applied to humans, and we need to rely on translational approaches to predict human brain distribution, target site kinetics, and therapeutic effects of CNS drugs.In this review the term "Mastermind approach" is introduced, for strategic and systematic CNS drug research using advanced preclinical experimental designs and mathematical modeling. In this way, knowledge can be obtained about the contributions and variability of individual processes on the causal path between drug dosing and CNS effect in animals that can be

  4. Heuristic Reasoning in Chemistry: Making decisions about acid strength

    NASA Astrophysics Data System (ADS)

    McClary, LaKeisha; Talanquer, Vicente

    2011-07-01

    The characterization of students' reasoning strategies is of central importance in the development of instructional strategies that foster meaningful learning. In particular, the identification of shortcut reasoning procedures (heuristics) used by students to reduce cognitive load can help us devise strategies to facilitate the development of more analytical ways of thinking. The central goal of this qualitative study was thus to investigate heuristic reasoning as used by organic chemistry college students, focusing our attention on their ability to predict the relative acid strength of chemical compounds represented using explicit composition and structural features (i.e., structural formulas). Our results indicated that many study participants relied heavily on one or more of the following heuristics to make most of their decisions: reduction, representativeness, and lexicographic. Despite having visual access to reach structural information about the substances included in each ranking task, many students relied on isolated composition features to make their decisions. However, the specific characteristics of the tasks seemed to trigger heuristic reasoning in different ways. Although the use of heuristics allowed students to simplify some components of the ranking tasks and generate correct responses, it often led them astray. Very few study participants predicted the correct trends based on scientifically acceptable arguments. Our results suggest the need for instructional interventions that explicitly develop college chemistry students' abilities to monitor their thinking and evaluate the effectiveness of analytical versus heuristic reasoning strategies in different contexts.

  5. Heuristic Reasoning in Chemistry: Making Decisions about Acid Strength

    ERIC Educational Resources Information Center

    McClary, Lakeisha; Talanquer, Vicente

    2011-01-01

    The characterization of students' reasoning strategies is of central importance in the development of instructional strategies that foster meaningful learning. In particular, the identification of shortcut reasoning procedures (heuristics) used by students to reduce cognitive load can help us devise strategies to facilitate the development of more…

  6. Reexamining our bias against heuristics.

    PubMed

    McLaughlin, Kevin; Eva, Kevin W; Norman, Geoff R

    2014-08-01

    Using heuristics offers several cognitive advantages, such as increased speed and reduced effort when making decisions, in addition to allowing us to make decision in situations where missing data do not allow for formal reasoning. But the traditional view of heuristics is that they trade accuracy for efficiency. Here the authors discuss sources of bias in the literature implicating the use of heuristics in diagnostic error and highlight the fact that there are also data suggesting that under certain circumstances using heuristics may lead to better decisions that formal analysis. They suggest that diagnostic error is frequently misattributed to the use of heuristics and propose an alternative view whereby content knowledge is the root cause of diagnostic performance and heuristics lie on the causal pathway between knowledge and diagnostic error or success.

  7. Heuristic Automation for Decluttering Tactical Displays

    DTIC Science & Technology

    2007-01-01

    2001b). Heuristic Automation for Decluttering Tactical Displays Mark St. John, Harvey S. Smallman, and Daniel I. Manes , Pacific Science...an ill-defined and com- plex function of many aircraft attributes and requires years of experience to train (Kaempf, Wolf , & Miller,1993; Liebhaber...best judgment. According to this design strategy (e.g., Parasuraman & Riley, 1997, pp. 244, 249; St. John & Manes , 2002; St. John, Oonk, & Osga, 2000

  8. Obtaining Maxwell's equations heuristically

    NASA Astrophysics Data System (ADS)

    Diener, Gerhard; Weissbarth, Jürgen; Grossmann, Frank; Schmidt, Rüdiger

    2013-02-01

    Starting from the experimental fact that a moving charge experiences the Lorentz force and applying the fundamental principles of simplicity (first order derivatives only) and linearity (superposition principle), we show that the structure of the microscopic Maxwell equations for the electromagnetic fields can be deduced heuristically by using the transformation properties of the fields under space inversion and time reversal. Using the experimental facts of charge conservation and that electromagnetic waves propagate with the speed of light, together with Galilean invariance of the Lorentz force, allows us to finalize Maxwell's equations and to introduce arbitrary electrodynamics units naturally.

  9. The Recognition Heuristic: A Review of Theory and Tests

    PubMed Central

    Pachur, Thorsten; Todd, Peter M.; Gigerenzer, Gerd; Schooler, Lael J.; Goldstein, Daniel G.

    2011-01-01

    The recognition heuristic is a prime example of how, by exploiting a match between mind and environment, a simple mental strategy can lead to efficient decision making. The proposal of the heuristic initiated a debate about the processes underlying the use of recognition in decision making. We review research addressing four key aspects of the recognition heuristic: (a) that recognition is often an ecologically valid cue; (b) that people often follow recognition when making inferences; (c) that recognition supersedes further cue knowledge; (d) that its use can produce the less-is-more effect – the phenomenon that lesser states of recognition knowledge can lead to more accurate inferences than more complete states. After we contrast the recognition heuristic to other related concepts, including availability and fluency, we carve out, from the existing findings, some boundary conditions of the use of the recognition heuristic as well as key questions for future research. Moreover, we summarize developments concerning the connection of the recognition heuristic with memory models. We suggest that the recognition heuristic is used adaptively and that, compared to other cues, recognition seems to have a special status in decision making. Finally, we discuss how systematic ignorance is exploited in other cognitive mechanisms (e.g., estimation and preference). PMID:21779266

  10. Reexamining Our Bias against Heuristics

    ERIC Educational Resources Information Center

    McLaughlin, Kevin; Eva, Kevin W.; Norman, Geoff R.

    2014-01-01

    Using heuristics offers several cognitive advantages, such as increased speed and reduced effort when making decisions, in addition to allowing us to make decision in situations where missing data do not allow for formal reasoning. But the traditional view of heuristics is that they trade accuracy for efficiency. Here the authors discuss sources…

  11. Heuristic-biased stochastic sampling

    SciTech Connect

    Bresina, J.L.

    1996-12-31

    This paper presents a search technique for scheduling problems, called Heuristic-Biased Stochastic Sampling (HBSS). The underlying assumption behind the HBSS approach is that strictly adhering to a search heuristic often does not yield the best solution and, therefore, exploration off the heuristic path can prove fruitful. Within the HBSS approach, the balance between heuristic adherence and exploration can be controlled according to the confidence one has in the heuristic. By varying this balance, encoded as a bias function, the HBSS approach encompasses a family of search algorithms of which greedy search and completely random search are extreme members. We present empirical results from an application of HBSS to the realworld problem of observation scheduling. These results show that with the proper bias function, it can be easy to outperform greedy search.

  12. Heuristic and algorithmic processing in English, mathematics, and science education.

    PubMed

    Sharps, Matthew J; Hess, Adam B; Price-Sharps, Jana L; Teh, Jane

    2008-01-01

    Many college students experience difficulties in basic academic skills. Recent research suggests that much of this difficulty may lie in heuristic competency--the ability to use and successfully manage general cognitive strategies. In the present study, the authors evaluated this possibility. They compared participants' performance on a practice California Basic Educational Skills Test and on a series of questions in the natural sciences with heuristic and algorithmic performance on a series of mathematics and reading comprehension exercises. Heuristic competency in mathematics was associated with better scores in science and mathematics. Verbal and algorithmic skills were associated with better reading comprehension. These results indicate the importance of including heuristic training in educational contexts and highlight the importance of a relatively domain-specific approach to questions of cognition in higher education.

  13. Heuristics in Composition and Literary Criticism.

    ERIC Educational Resources Information Center

    McCarthy, B. Eugene

    1978-01-01

    Describes the "particle, wave, field" heuristic for gathering information, and shows how students can apply that heuristic in analyzing literature and in using procedures of historical criticism. (RL)

  14. Promotion of Heuristic Literacy in a Regular Mathematics Classroom

    ERIC Educational Resources Information Center

    Koichu, Boris; Berman, Abraham; Moore, Michael

    2004-01-01

    Applying and adapting a variety of appropriate heuristic strategies is one of the accepted standards of problem solving (NCTM, 2000). Thinking through a solution to a non-routine mathematical task, experts in problem solving call into play many sophisticated strategies (almost) without conscious efforts, while novices need to be taught how to do…

  15. Determining best practices in reconnoitering sites for habitability potential on Mars using a semi-autonomous rover: A GeoHeuristic Operational Strategies Test

    NASA Astrophysics Data System (ADS)

    Yingst, R. A.; Berger, J.; Cohen, B. A.; Hynek, B.; Schmidt, M. E.

    2017-03-01

    We tested science operations strategies developed for use in remote mobile spacecraft missions, to determine whether reconnoitering a site of potential habitability prior to in-depth study (a walkabout-first strategy) can be a more efficient use of time and resources than the linear approach commonly used by planetary rover missions. Two field teams studied a sedimentary sequence in Utah to assess habitability potential. At each site one team commanded a human "rover" to execute observations and conducted data analysis and made follow-on decisions based solely on those observations. Another team followed the same traverse using traditional terrestrial field methods, and the results of the two teams were compared. Test results indicate that for a mission with goals similar to our field case, the walkabout-first strategy may save time and other mission resources, while improving science return. The approach enabled more informed choices and higher team confidence in choosing where to spend time and other consumable resources. The walkabout strategy may prove most efficient when many close sites must be triaged to a smaller subset for detailed study or sampling. This situation would arise when mission goals include finding, identifying, characterizing or sampling a specific material, feature or type of environment within a certain area.

  16. New insights into diversification of hyper-heuristics.

    PubMed

    Ren, Zhilei; Jiang, He; Xuan, Jifeng; Hu, Yan; Luo, Zhongxuan

    2014-10-01

    There has been a growing research trend of applying hyper-heuristics for problem solving, due to their ability of balancing the intensification and the diversification with low level heuristics. Traditionally, the diversification mechanism is mostly realized by perturbing the incumbent solutions to escape from local optima. In this paper, we report our attempt toward providing a new diversification mechanism, which is based on the concept of instance perturbation. In contrast to existing approaches, the proposed mechanism achieves the diversification by perturbing the instance under solving, rather than the solutions. To tackle the challenge of incorporating instance perturbation into hyper-heuristics, we also design a new hyper-heuristic framework HIP-HOP (recursive acronym of HIP-HOP is an instance perturbation-based hyper-heuristic optimization procedure), which employs a grammar guided high level strategy to manipulate the low level heuristics. With the expressive power of the grammar, the constraints, such as the feasibility of the output solution could be easily satisfied. Numerical results and statistical tests over both the Ising spin glass problem and the p -median problem instances show that HIP-HOP is able to achieve promising performances. Furthermore, runtime distribution analysis reveals that, although being relatively slow at the beginning, HIP-HOP is able to achieve competitive solutions once given sufficient time.

  17. Memory-Based Decision-Making with Heuristics: Evidence for a Controlled Activation of Memory Representations

    ERIC Educational Resources Information Center

    Khader, Patrick H.; Pachur, Thorsten; Meier, Stefanie; Bien, Siegfried; Jost, Kerstin; Rosler, Frank

    2011-01-01

    Many of our daily decisions are memory based, that is, the attribute information about the decision alternatives has to be recalled. Behavioral studies suggest that for such decisions we often use simple strategies (heuristics) that rely on controlled and limited information search. It is assumed that these heuristics simplify decision-making by…

  18. A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems.

    PubMed

    Sabar, Nasser R; Ayob, Masri; Kendall, Graham; Qu, Rong

    2015-02-01

    Hyper-heuristics are search methodologies that aim to provide high-quality solutions across a wide variety of problem domains, rather than developing tailor-made methodologies for each problem instance/domain. A traditional hyper-heuristic framework has two levels, namely, the high level strategy (heuristic selection mechanism and the acceptance criterion) and low level heuristics (a set of problem specific heuristics). Due to the different landscape structures of different problem instances, the high level strategy plays an important role in the design of a hyper-heuristic framework. In this paper, we propose a new high level strategy for a hyper-heuristic framework. The proposed high-level strategy utilizes a dynamic multiarmed bandit-extreme value-based reward as an online heuristic selection mechanism to select the appropriate heuristic to be applied at each iteration. In addition, we propose a gene expression programming framework to automatically generate the acceptance criterion for each problem instance, instead of using human-designed criteria. Two well-known, and very different, combinatorial optimization problems, one static (exam timetabling) and one dynamic (dynamic vehicle routing) are used to demonstrate the generality of the proposed framework. Compared with state-of-the-art hyper-heuristics and other bespoke methods, empirical results demonstrate that the proposed framework is able to generalize well across both domains. We obtain competitive, if not better results, when compared to the best known results obtained from other methods that have been presented in the scientific literature. We also compare our approach against the recently released hyper-heuristic competition test suite. We again demonstrate the generality of our approach when we compare against other methods that have utilized the same six benchmark datasets from this test suite.

  19. Regarding Chilcott's "Structural Functionalism as a Heuristic Device" Heuristically.

    ERIC Educational Resources Information Center

    Blot, Richard K.

    1998-01-01

    The heuristic value of Chilcott's essay lies less in its support for structural functionalism and more in its concern to reexamine theory in the work of earlier educational anthropologists for what earlier theories and practices can add to current research. (SLD)

  20. Training Lie Detectors to Use Nonverbal Cues Instead of Global Heuristics.

    ERIC Educational Resources Information Center

    Fiedler, Klaus; Walka, Isabella

    1993-01-01

    Finds that naive human lie detectors follow content-related heuristics (like infrequency of reported events or falsifiability) but can flexibly change their strategy as they learn about authentic nonverbal cues that discriminate lies from truthful communications. (SR)

  1. Rubrics: Heuristics for Developing Writing Strategies

    ERIC Educational Resources Information Center

    De La Paz, Susan

    2009-01-01

    Rubrics are an integral part of many writing programs, and they represent elements of good writing in essays, stories, poems, as well as other genres and forms of text. Although it is possible to use rubrics to teach students about the processes underlying effective writing, a more common practice is to use rubrics as a means of assessment, after…

  2. How Forgetting Aids Heuristic Inference

    ERIC Educational Resources Information Center

    Schooler, Lael J.; Hertwig, Ralph

    2005-01-01

    Some theorists, ranging from W. James (1890) to contemporary psychologists, have argued that forgetting is the key to proper functioning of memory. The authors elaborate on the notion of beneficial forgetting by proposing that loss of information aids inference heuristics that exploit mnemonic information. To this end, the authors bring together 2…

  3. Conflict and Bias in Heuristic Judgment

    ERIC Educational Resources Information Center

    Bhatia, Sudeep

    2017-01-01

    Conflict has been hypothesized to play a key role in recruiting deliberative processing in reasoning and judgment tasks. This claim suggests that changing the task so as to add incorrect heuristic responses that conflict with existing heuristic responses can make individuals less likely to respond heuristically and can increase response accuracy.…

  4. A Geographical Heuristic Routing Protocol for VANETs

    PubMed Central

    Urquiza-Aguiar, Luis; Tripp-Barba, Carolina; Aguilar Igartua, Mónica

    2016-01-01

    Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, Delay-Tolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation). PMID:27669254

  5. A Geographical Heuristic Routing Protocol for VANETs.

    PubMed

    Urquiza-Aguiar, Luis; Tripp-Barba, Carolina; Aguilar Igartua, Mónica

    2016-09-23

    Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, Delay-Tolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation).

  6. Fluency heuristic: a model of how the mind exploits a by-product of information retrieval.

    PubMed

    Hertwig, Ralph; Herzog, Stefan M; Schooler, Lael J; Reimer, Torsten

    2008-09-01

    Boundedly rational heuristics for inference can be surprisingly accurate and frugal for several reasons. They can exploit environmental structures, co-opt complex capacities, and elude effortful search by exploiting information that automatically arrives on the mental stage. The fluency heuristic is a prime example of a heuristic that makes the most of an automatic by-product of retrieval from memory, namely, retrieval fluency. In 4 experiments, the authors show that retrieval fluency can be a proxy for real-world quantities, that people can discriminate between two objects' retrieval fluencies, and that people's inferences are in line with the fluency heuristic (in particular fast inferences) and with experimentally manipulated fluency. The authors conclude that the fluency heuristic may be one tool in the mind's repertoire of strategies that artfully probes memory for encapsulated frequency information that can veridically reflect statistical regularities in the world.

  7. Familiarity and Recollection in Heuristic Decision Making

    PubMed Central

    Schwikert, Shane R.; Curran, Tim

    2014-01-01

    Heuristics involve the ability to utilize memory to make quick judgments by exploiting fundamental cognitive abilities. In the current study we investigated the memory processes that contribute to the recognition heuristic and the fluency heuristic, which are both presumed to capitalize on the by-products of memory to make quick decisions. In Experiment 1, we used a city-size comparison task while recording event-related potentials (ERPs) to investigate the potential contributions of familiarity and recollection to the two heuristics. ERPs were markedly different for recognition heuristic-based decisions and fluency heuristic-based decisions, suggesting a role for familiarity in the recognition heuristic and recollection in the fluency heuristic. In Experiment 2, we coupled the same city-size comparison task with measures of subjective pre-experimental memory for each stimulus in the task. Although previous literature suggests the fluency heuristic relies on recognition speed alone, our results suggest differential contributions of recognition speed and recollected knowledge to these decisions, whereas the recognition heuristic relies on familiarity. Based on these results, we created a new theoretical frame work that explains decisions attributed to both heuristics based on the underlying memory associated with the choice options. PMID:25347534

  8. Familiarity and recollection in heuristic decision making.

    PubMed

    Schwikert, Shane R; Curran, Tim

    2014-12-01

    Heuristics involve the ability to utilize memory to make quick judgments by exploiting fundamental cognitive abilities. In the current study we investigated the memory processes that contribute to the recognition heuristic and the fluency heuristic, which are both presumed to capitalize on the byproducts of memory to make quick decisions. In Experiment 1, we used a city-size comparison task while recording event-related potentials (ERPs) to investigate the potential contributions of familiarity and recollection to the 2 heuristics. ERPs were markedly different for recognition heuristic-based decisions and fluency heuristic-based decisions, suggesting a role for familiarity in the recognition heuristic and recollection in the fluency heuristic. In Experiment 2, we coupled the same city-size comparison task with measures of subjective preexperimental memory for each stimulus in the task. Although previous literature suggests the fluency heuristic relies on recognition speed alone, our results suggest differential contributions of recognition speed and recollected knowledge to these decisions, whereas the recognition heuristic relies on familiarity. Based on these results, we created a new theoretical framework that explains decisions attributed to both heuristics based on the underlying memory associated with the choice options.

  9. Heuristic for Critical Machine Based a Lot Streaming for Two-Stage Hybrid Production Environment

    NASA Astrophysics Data System (ADS)

    Vivek, P.; Saravanan, R.; Chandrasekaran, M.; Pugazhenthi, R.

    2017-03-01

    Lot streaming in Hybrid flowshop [HFS] is encountered in many real world problems. This paper deals with a heuristic approach for Lot streaming based on critical machine consideration for a two stage Hybrid Flowshop. The first stage has two identical parallel machines and the second stage has only one machine. In the second stage machine is considered as a critical by valid reasons these kind of problems is known as NP hard. A mathematical model developed for the selected problem. The simulation modelling and analysis were carried out in Extend V6 software. The heuristic developed for obtaining optimal lot streaming schedule. The eleven cases of lot streaming were considered. The proposed heuristic was verified and validated by real time simulation experiments. All possible lot streaming strategies and possible sequence under each lot streaming strategy were simulated and examined. The heuristic consistently yielded optimal schedule consistently in all eleven cases. The identification procedure for select best lot streaming strategy was suggested.

  10. Social biases determine spatiotemporal sparseness of ciliate mating heuristics

    PubMed Central

    2012-01-01

    Ciliates become highly social, even displaying animal-like qualities, in the joint presence of aroused conspecifics and nonself mating pheromones. Pheromone detection putatively helps trigger instinctual and learned courtship and dominance displays from which social judgments are made about the availability, compatibility, and fitness representativeness or likelihood of prospective mates and rivals. In earlier studies, I demonstrated the heterotrich Spirostomum ambiguum improves mating competence by effecting preconjugal strategies and inferences in mock social trials via behavioral heuristics built from Hebbian-like associative learning. Heuristics embody serial patterns of socially relevant action that evolve into ordered, topologically invariant computational networks supporting intra- and intermate selection. S. ambiguum employs heuristics to acquire, store, plan, compare, modify, select, and execute sets of mating propaganda. One major adaptive constraint over formation and use of heuristics involves a ciliate’s initial subjective bias, responsiveness, or preparedness, as defined by Stevens’ Law of subjective stimulus intensity, for perceiving the meaningfulness of mechanical pressures accompanying cell-cell contacts and additional perimating events. This bias controls durations and valences of nonassociative learning, search rates for appropriate mating strategies, potential net reproductive payoffs, levels of social honesty and deception, successful error diagnosis and correction of mating signals, use of insight or analysis to solve mating dilemmas, bioenergetics expenditures, and governance of mating decisions by classical or quantum statistical mechanics. I now report this same social bias also differentially affects the spatiotemporal sparseness, as measured with metric entropy, of ciliate heuristics. Sparseness plays an important role in neural systems through optimizing the specificity, efficiency, and capacity of memory representations. The

  11. Metacognition and false recognition in Alzheimer's disease: further exploration of the distinctiveness heuristic.

    PubMed

    Budson, Andrew E; Dodson, Chad S; Daffner, Kirk R; Schacter, Daniel L

    2005-03-01

    The distinctiveness heuristic is a response mode in which participants expect to remember vivid details of an experience and make recognition decisions on the basis of this metacognitive expectation. The authors examined whether the distinctiveness heuristic could be engaged to reduce false recognition in a repetition-lag paradigm in patients with Alzheimer's disease (AD). Patients with AD were able to use the distinctiveness heuristic--though not selectively--and thus they showed reduction of both true and false recognition. The authors suggest that patients with AD can engage in decision strategies on the basis of the metacognitive expectation associated with use of the distinctiveness heuristic, but the patients' episodic memory impairment limits both the scope and effectiveness of such strategies.

  12. A single cognitive heuristic process meets the complexity of domain-specific moral heuristics.

    PubMed

    Dubljević, Veljko; Racine, Eric

    2014-10-01

    The inherence heuristic (a) offers modest insights into the complex nature of both the is-ought tension in moral reasoning and moral reasoning per se, and (b) does not reflect the complexity of domain-specific moral heuristics. Formal and general in nature, we contextualize the process described as "inherence heuristic" in a web of domain-specific heuristics (e.g., agent specific; action specific; consequences specific).

  13. Diagnostic retrieval monitoring in patients with frontal lobe lesions: further exploration of the distinctiveness heuristic.

    PubMed

    Hwang, David Y; Gallo, David A; Ally, Brandon A; Black, Peter M; Schacter, Daniel L; Budson, Andrew E

    2007-06-18

    The distinctiveness heuristic is a diagnostic monitoring strategy whereby a subject expects a vivid recollection if a test item has been seen during the study session; the absence of a vivid recollection suggests the test item is novel. Consistent with the hypothesis that memory monitoring is dependent upon the frontal lobes, previous work using a repetition-lag paradigm found that patients with frontal lobe lesions were unable to use the distinctiveness heuristic. Evidence from recent neuroimaging studies, however, has suggested that use of the distinctiveness heuristic decreases the need for frontal processing. The present study used the criterial recollection task to revisit the question of whether patients with frontal lobe lesions are able to use a distinctiveness heuristic. Subjects studied black words paired with the same word in red font, a corresponding picture of the word, or both. They then took three memory tests designed to elicit false recognition of presented items. Both frontal lesion patients and matched control subjects showed intact ability to use the distinctiveness heuristic to reduce false recognition when tested on whether items were previously presented as pictures compared to red words. This use of the distinctiveness heuristic is evidence that patients with frontal lesions can use certain diagnostic monitoring strategies during recognition memory tasks when given guidance in coordinating their decision-making processes. This result suggests that the frontal lobes are necessary for self-initiation of this strategy during recognition memory tasks.

  14. Heuristics of Twelfth Graders Building Isomorphisms

    ERIC Educational Resources Information Center

    Powell, Arthur B.; Maher, Carolyn A.

    2003-01-01

    This report analyzes the discursive interactions of four students to understand what heuristic methods they develop as well as how and why they build isomorphisms to resolve a combinatorial problem set in a non-Euclidian context. The findings suggest that results of their heuristic actions lead them to build isomorphisms that in turn allow them to…

  15. "A Heuristic for Visual Thinking in History"

    ERIC Educational Resources Information Center

    Staley, David J.

    2007-01-01

    This article details a heuristic history teachers can use in assigning and evaluating multimedia projects in history. To use this heuristic successfully, requires more than simply following the steps in the list or stages in a recipe: in many ways, it requires a reorientation in what it means to think like an historian. This article, as much as…

  16. Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems

    NASA Technical Reports Server (NTRS)

    Minton, Steve; Johnston, Mark; Philips, Andrew; Laird, Phil

    1992-01-01

    This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the n-queens problem, a technique based on this approach performs orders of magnitude better than traditional backtracking techniques. We also describe a scheduling application where the approach has been used successfully. A theoretical analysis is presented both to explain why this method works well on certain types of problems and to predict when it is likely to be most effective.

  17. The Role of Intuitive Heuristics in Students' Thinking: Ranking Chemical Substances

    ERIC Educational Resources Information Center

    Maeyer, Jenine; Talanquer, Vicente

    2010-01-01

    The characterization of students' cognitive biases is of central importance in the development of curriculum and teaching strategies that better support student learning in science. In particular, the identification of shortcut reasoning procedures (heuristics) used by students to reduce cognitive load can help us devise strategies to foster the…

  18. Automatic Generation of Heuristics for Scheduling

    NASA Technical Reports Server (NTRS)

    Morris, Robert A.; Bresina, John L.; Rodgers, Stuart M.

    1997-01-01

    This paper presents a technique, called GenH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing consensus that heuristics encode advice that is, at best, useful in solving most, or typical, problem instances, and, at worst, useful in solving only a narrowly defined set of instances. In either case, heuristic problem solvers, to be broadly applicable, should have a means of automatically adjusting to the idiosyncrasies of each problem instance. GenH generates a search heuristic for a given problem instance by hill-climbing in the space of possible multi-attribute heuristics, where the evaluation of a candidate heuristic is based on the quality of the solution found under its guidance. We present empirical results obtained by applying GenH to the real world problem of telescope observation scheduling. These results demonstrate that GenH is a simple and effective way of improving the performance of an heuristic scheduler.

  19. Frequency-based heuristics for material perception

    PubMed Central

    Giesel, Martin; Zaidi, Qasim

    2013-01-01

    People often make rapid visual judgments of the properties of surfaces they are going to walk on or touch. How do they do this when the interactions of illumination geometry with 3-D material structure and object shape result in images that inverse optics algorithms cannot resolve without externally imposed constraints? A possibly effective strategy would be to use heuristics based on information that can be gleaned rapidly from retinal images. By using perceptual scaling of a large sample of images, combined with correspondence and canonical correlation analyses, we discovered that material properties, such as roughness, thickness, and undulations, are characterized by specific scales of luminance variations. Using movies, we demonstrate that observers' percepts of these 3-D qualities vary continuously as a function of the relative energy in corresponding 2-D frequency bands. In addition, we show that judgments of roughness, thickness, and undulations are predictably altered by adaptation to dynamic noise at the corresponding scales. These results establish that the scale of local 3-D structure is critical in perceiving material properties, and that relative contrast at particular spatial frequencies is important for perceiving the critical 3-D structure from shading cues, so that cortical mechanisms for estimating material properties could be constructed by combining the parallel outputs of sets of frequency-selective neurons. These results also provide methods for remote sensing of material properties in machine vision, and rapid synthesis, editing and transfer of material properties for computer graphics and animation. PMID:24317425

  20. Towards competitive instead of biased testing of heuristics: a reply to hilbig and richter (2011).

    PubMed

    Brighton, Henry; Gigerenzer, Gerd

    2011-01-01

    Our programmatic article on Homo heuristicus (Gigerenzer & Brighton, 2009) included a methodological section specifying three minimum criteria for testing heuristics: competitive tests, individual-level tests, and tests of adaptive selection of heuristics. Using Richter and Späth's (2006) study on the recognition heuristic, we illustrated how violations of these criteria can lead to unsupported conclusions. In their comment, Hilbig and Richter conduct a reanalysis, but again without competitive testing. They neither test nor specify the compensatory model of inference they argue for. Instead, they test whether participants use the recognition heuristic in an unrealistic 100% (or 96%) of cases, report that only some people exhibit this level of consistency, and conclude that most people would follow a compensatory strategy. We know of no model of judgment that predicts 96% correctly. The curious methodological practice of adopting an unrealistic measure of success to argue against a competing model, and to interpret such a finding as a triumph for a preferred but unspecified model, can only hinder progress. Marewski, Gaissmaier, Schooler, Goldstein, and Gigerenzer (2010), in contrast, specified five compensatory models, compared them with the recognition heuristic, and found that the recognition heuristic predicted inferences most accurately.

  1. Social heuristics shape intuitive cooperation.

    PubMed

    Rand, David G; Peysakhovich, Alexander; Kraft-Todd, Gordon T; Newman, George E; Wurzbacher, Owen; Nowak, Martin A; Greene, Joshua D

    2014-04-22

    Cooperation is central to human societies. Yet relatively little is known about the cognitive underpinnings of cooperative decision making. Does cooperation require deliberate self-restraint? Or is spontaneous prosociality reined in by calculating self-interest? Here we present a theory of why (and for whom) intuition favors cooperation: cooperation is typically advantageous in everyday life, leading to the formation of generalized cooperative intuitions. Deliberation, by contrast, adjusts behaviour towards the optimum for a given situation. Thus, in one-shot anonymous interactions where selfishness is optimal, intuitive responses tend to be more cooperative than deliberative responses. We test this 'social heuristics hypothesis' by aggregating across every cooperation experiment using time pressure that we conducted over a 2-year period (15 studies and 6,910 decisions), as well as performing a novel time pressure experiment. Doing so demonstrates a positive average effect of time pressure on cooperation. We also find substantial variation in this effect, and show that this variation is partly explained by previous experience with one-shot lab experiments.

  2. Establishing usability heuristics for heuristics evaluation in a specific domain: Is there a consensus?

    PubMed

    Hermawati, Setia; Lawson, Glyn

    2016-09-01

    Heuristics evaluation is frequently employed to evaluate usability. While general heuristics are suitable to evaluate most user interfaces, there is still a need to establish heuristics for specific domains to ensure that their specific usability issues are identified. This paper presents a comprehensive review of 70 studies related to usability heuristics for specific domains. The aim of this paper is to review the processes that were applied to establish heuristics in specific domains and identify gaps in order to provide recommendations for future research and area of improvements. The most urgent issue found is the deficiency of validation effort following heuristics proposition and the lack of robustness and rigour of validation method adopted. Whether domain specific heuristics perform better or worse than general ones is inconclusive due to lack of validation quality and clarity on how to assess the effectiveness of heuristics for specific domains. The lack of validation quality also affects effort in improving existing heuristics for specific domain as their weaknesses are not addressed.

  3. Heuristic algorithm for off-lattice protein folding problem*

    PubMed Central

    Chen, Mao; Huang, Wen-qi

    2006-01-01

    Enlightened by the law of interactions among objects in the physical world, we propose a heuristic algorithm for solving the three-dimensional (3D) off-lattice protein folding problem. Based on a physical model, the problem is converted from a nonlinear constraint-satisfied problem to an unconstrained optimization problem which can be solved by the well-known gradient method. To improve the efficiency of our algorithm, a strategy was introduced to generate initial configuration. Computational results showed that this algorithm could find states with lower energy than previously proposed ground states obtained by nPERM algorithm for all chains with length ranging from 13 to 55. PMID:16365919

  4. Parallel Heuristics for Scalable Community Detection

    SciTech Connect

    Lu, Howard; Kalyanaraman, Anantharaman; Halappanavar, Mahantesh; Choudhury, Sutanay

    2014-05-17

    Community detection has become a fundamental operation in numerous graph-theoretic applications. It is used to reveal natural divisions that exist within real world networks without imposing prior size or cardinality constraints on the set of communities. Despite its potential for application, there is only limited support for community detection on large-scale parallel computers, largely owing to the irregular and inherently sequential nature of the underlying heuristics. In this paper, we present parallelization heuristics for fast community detection using the Louvain method as the serial template. The Louvain method is an iterative heuristic for modularity optimization. Originally developed by Blondel et al. in 2008, the method has become increasingly popular owing to its ability to detect high modularity community partitions in a fast and memory-efficient manner. However, the method is also inherently sequential, thereby limiting its scalability to problems that can be solved on desktops. Here, we observe certain key properties of this method that present challenges for its parallelization, and consequently propose multiple heuristics that are designed to break the sequential barrier. Our heuristics are agnostic to the underlying parallel architecture. For evaluation purposes, we implemented our heuristics on shared memory (OpenMP) and distributed memory (MapReduce-MPI) machines, and tested them over real world graphs derived from multiple application domains (internet, biological, natural language processing). Experimental results demonstrate the ability of our heuristics to converge to high modularity solutions comparable to those output by the serial algorithm in nearly the same number of iterations, while also drastically reducing time to solution.

  5. Prediction-based dynamic load-sharing heuristics

    NASA Technical Reports Server (NTRS)

    Goswami, Kumar K.; Devarakonda, Murthy; Iyer, Ravishankar K.

    1993-01-01

    The authors present dynamic load-sharing heuristics that use predicted resource requirements of processes to manage workloads in a distributed system. A previously developed statistical pattern-recognition method is employed for resource prediction. While nonprediction-based heuristics depend on a rapidly changing system status, the new heuristics depend on slowly changing program resource usage patterns. Furthermore, prediction-based heuristics can be more effective since they use future requirements rather than just the current system state. Four prediction-based heuristics, two centralized and two distributed, are presented. Using trace driven simulations, they are compared against random scheduling and two effective nonprediction based heuristics. Results show that the prediction-based centralized heuristics achieve up to 30 percent better response times than the nonprediction centralized heuristic, and that the prediction-based distributed heuristics achieve up to 50 percent improvements relative to their nonprediction counterpart.

  6. Learning to Search: From Weak Methods to Domain-Specific Heuristics.

    ERIC Educational Resources Information Center

    Langley, Pat

    1985-01-01

    Examines processes by which general but weak search methods are transformed into powerful, domain-specific search strategies by classifying types of heuristics learning that can occur and components that contribute to such learning. A learning system--SAGE.2--and its structure, behavior in different domains, and future directions are explored. (36…

  7. Common-Sense Chemistry: The Use of Assumptions and Heuristics in Problem Solving

    ERIC Educational Resources Information Center

    Maeyer, Jenine Rachel

    2013-01-01

    Students experience difficulty learning and understanding chemistry at higher levels, often because of cognitive biases stemming from common sense reasoning constraints. These constraints can be divided into two categories: assumptions (beliefs held about the world around us) and heuristics (the reasoning strategies or rules used to build…

  8. Not So Fast! (and Not So Frugal!): Rethinking the Recognition Heuristic

    ERIC Educational Resources Information Center

    Oppenheimer, Daniel M.

    2003-01-01

    The "fast and frugal" approach to reasoning (Gigerenzer, G., & Todd, P. M. (1999). "Simple heuristics that make us smart." New York: Oxford University Press) claims that individuals use non-compensatory strategies in judgment--the idea that only one cue is taken into account in reasoning. The simplest and most important of these heuristics…

  9. Heuristics as a Basis for Assessing Creative Potential: Measures, Methods, and Contingencies

    ERIC Educational Resources Information Center

    Vessey, William B.; Mumford, Michael D.

    2012-01-01

    Studies of creative thinking skills have generally measured a single aspect of creativity, divergent thinking. A number of other processes involved in creative thought have been identified. Effective execution of these processes is held to depend on the strategies applied in process execution, or heuristics. In this article, we review prior…

  10. (Re)theorizing Integrated Knowledge Translation: A Heuristic for Knowledge-As-Action.

    PubMed

    Hartrick Doane, Gweneth; Reimer-Kirkham, Sheryl; Antifeau, Elisabeth; Stajduhar, Kelli

    2015-01-01

    Approaches to knowledge translation (KT) have undergone substantial transformation in an effort to find more effective strategies to ensure the best available knowledge informs nursing practice. However, the fundamental epistemology underpinning KT itself has gone largely unquestioned. Of particular concern is the inadequacy of current representational models to depict the complex, social process of KT. To address the limitations of representational models we propose an inquiry heuristic that conceptualizes KT as a knowledge-as-action process. Developed through a series of KT research projects, the heuristic is intended to guide the KT process and support effective navigation in the complexities of contemporary health care milieus.

  11. Combining heuristic and statistical techniques in landslide hazard assessments

    NASA Astrophysics Data System (ADS)

    Cepeda, Jose; Schwendtner, Barbara; Quan, Byron; Nadim, Farrokh; Diaz, Manuel; Molina, Giovanni

    2014-05-01

    As a contribution to the Global Assessment Report 2013 - GAR2013, coordinated by the United Nations International Strategy for Disaster Reduction - UNISDR, a drill-down exercise for landslide hazard assessment was carried out by entering the results of both heuristic and statistical techniques into a new but simple combination rule. The data available for this evaluation included landslide inventories, both historical and event-based. In addition to the application of a heuristic method used in the previous editions of GAR, the availability of inventories motivated the use of statistical methods. The heuristic technique is largely based on the Mora & Vahrson method, which estimates hazard as the product of susceptibility and triggering factors, where classes are weighted based on expert judgment and experience. Two statistical methods were also applied: the landslide index method, which estimates weights of the classes for the susceptibility and triggering factors based on the evidence provided by the density of landslides in each class of the factors; and the weights of evidence method, which extends the previous technique to include both positive and negative evidence of landslide occurrence in the estimation of weights for the classes. One key aspect during the hazard evaluation was the decision on the methodology to be chosen for the final assessment. Instead of opting for a single methodology, it was decided to combine the results of the three implemented techniques using a combination rule based on a normalization of the results of each method. The hazard evaluation was performed for both earthquake- and rainfall-induced landslides. The country chosen for the drill-down exercise was El Salvador. The results indicate that highest hazard levels are concentrated along the central volcanic chain and at the centre of the northern mountains.

  12. Planning paths to multiple targets: memory involvement and planning heuristics in spatial problem solving.

    PubMed

    Wiener, J M; Ehbauer, N N; Mallot, H A

    2009-09-01

    For large numbers of targets, path planning is a complex and computationally expensive task. Humans, however, usually solve such tasks quickly and efficiently. We present experiments studying human path planning performance and the cognitive processes and heuristics involved. Twenty-five places were arranged on a regular grid in a large room. Participants were repeatedly asked to solve traveling salesman problems (TSP), i.e., to find the shortest closed loop connecting a start location with multiple target locations. In Experiment 1, we tested whether humans employed the nearest neighbor (NN) strategy when solving the TSP. Results showed that subjects outperform the NN-strategy, suggesting that it is not sufficient to explain human route planning behavior. As a second possible strategy we tested a hierarchical planning heuristic in Experiment 2, demonstrating that participants first plan a coarse route on the region level that is refined during navigation. To test for the relevance of spatial working memory (SWM) and spatial long-term memory (LTM) for planning performance and the planning heuristics applied, we varied the memory demands between conditions in Experiment 2. In one condition the target locations were directly marked, such that no memory was required; a second condition required participants to memorize the target locations during path planning (SWM); in a third condition, additionally, the locations of targets had to retrieved from LTM (SWM and LTM). Results showed that navigation performance decreased with increasing memory demands while the dependence on the hierarchical planning heuristic increased.

  13. Structural Functionalism as a Heuristic Device.

    ERIC Educational Resources Information Center

    Chilcott, John H.

    1998-01-01

    Argues that structural functionalism as a method for conducting fieldwork and as a format for the analysis of ethnographic data remains a powerful model, one that is easily understood by professional educators. As a heuristic device, functionalist theory can help in the solution of a problem that is otherwise incapable of theoretical…

  14. Teaching a Heuristic Approach to Information Retrieval.

    ERIC Educational Resources Information Center

    Ury, Connie Jo; And Others

    1997-01-01

    Discusses lifelong learning and the need for information retrieval skills, and describes how Northwest Missouri State University incorporates a heuristic model of library instruction in which students continually evaluate and refine information-seeking practices while progressing through all levels of courses in diverse disciplines. (Author/LRW)

  15. Investigating Heuristic Evaluation: A Case Study.

    ERIC Educational Resources Information Center

    Goldman, Kate Haley; Bendoly, Laura

    When museum professionals speak of evaluating a web site, they primarily mean formative evaluation, and by that they primarily mean testing the usability of the site. In the for-profit world, usability testing is a multi-million dollar industry, while non-profits often rely on far too few dollars to do too much. Hence, heuristic evaluation is one…

  16. Engineering applications of heuristic multilevel optimization methods

    NASA Technical Reports Server (NTRS)

    Barthelemy, Jean-Francois M.

    1988-01-01

    Some engineering applications of heuristic multilevel optimization methods are presented and the discussion focuses on the dependency matrix that indicates the relationship between problem functions and variables. Coordination of the subproblem optimizations is shown to be typically achieved through the use of exact or approximate sensitivity analysis. Areas for further development are identified.

  17. Engineering applications of heuristic multilevel optimization methods

    NASA Technical Reports Server (NTRS)

    Barthelemy, Jean-Francois M.

    1989-01-01

    Some engineering applications of heuristic multilevel optimization methods are presented and the discussion focuses on the dependency matrix that indicates the relationship between problem functions and variables. Coordination of the subproblem optimizations is shown to be typically achieved through the use of exact or approximate sensitivity analysis. Areas for further development are identified.

  18. The Heuristic Interpretation of Box Plots

    ERIC Educational Resources Information Center

    Lem, Stephanie; Onghena, Patrick; Verschaffel, Lieven; Van Dooren, Wim

    2013-01-01

    Box plots are frequently used, but are often misinterpreted by students. Especially the area of the box in box plots is often misinterpreted as representing number or proportion of observations, while it actually represents their density. In a first study, reaction time evidence was used to test whether heuristic reasoning underlies this…

  19. Heuristic Classification. Technical Report Number 12.

    ERIC Educational Resources Information Center

    Clancey, William J.

    A broad range of well-structured problems--embracing forms of diagnosis, catalog selection, and skeletal planning--are solved in expert computer systems by the method of heuristic classification. These programs have a characteristic inference structure that systematically relates data to a pre-enumerated set of solutions by abstraction, heuristic…

  20. Heuristic Diagrams as a Tool to Teach History of Science

    ERIC Educational Resources Information Center

    Chamizo, Jose A.

    2012-01-01

    The graphic organizer called here heuristic diagram as an improvement of Gowin's Vee heuristic is proposed as a tool to teach history of science. Heuristic diagrams have the purpose of helping students (or teachers, or researchers) to understand their own research considering that asks and problem-solving are central to scientific activity. The…

  1. Heuristics Made Easy: An Effort-Reduction Framework

    ERIC Educational Resources Information Center

    Shah, Anuj K.; Oppenheimer, Daniel M.

    2008-01-01

    In this article, the authors propose a new framework for understanding and studying heuristics. The authors posit that heuristics primarily serve the purpose of reducing the effort associated with a task. As such, the authors propose that heuristics can be classified according to a small set of effort-reduction principles. The authors use this…

  2. BCI Control of Heuristic Search Algorithms

    PubMed Central

    Cavazza, Marc; Aranyi, Gabor; Charles, Fred

    2017-01-01

    The ability to develop Brain-Computer Interfaces (BCI) to Intelligent Systems would offer new perspectives in terms of human supervision of complex Artificial Intelligence (AI) systems, as well as supporting new types of applications. In this article, we introduce a basic mechanism for the control of heuristic search through fNIRS-based BCI. The rationale is that heuristic search is not only a basic AI mechanism but also one still at the heart of many different AI systems. We investigate how users’ mental disposition can be harnessed to influence the performance of heuristic search algorithm through a mechanism of precision-complexity exchange. From a system perspective, we use weighted variants of the A* algorithm which have an ability to provide faster, albeit suboptimal solutions. We use recent results in affective BCI to capture a BCI signal, which is indicative of a compatible mental disposition in the user. It has been established that Prefrontal Cortex (PFC) asymmetry is strongly correlated to motivational dispositions and results anticipation, such as approach or even risk-taking, and that this asymmetry is amenable to Neurofeedback (NF) control. Since PFC asymmetry is accessible through fNIRS, we designed a BCI paradigm in which users vary their PFC asymmetry through NF during heuristic search tasks, resulting in faster solutions. This is achieved through mapping the PFC asymmetry value onto the dynamic weighting parameter of the weighted A* (WA*) algorithm. We illustrate this approach through two different experiments, one based on solving 8-puzzle configurations, and the other on path planning. In both experiments, subjects were able to speed up the computation of a solution through a reduction of search space in WA*. Our results establish the ability of subjects to intervene in heuristic search progression, with effects which are commensurate to their control of PFC asymmetry: this opens the way to new mechanisms for the implementation of hybrid

  3. BCI Control of Heuristic Search Algorithms.

    PubMed

    Cavazza, Marc; Aranyi, Gabor; Charles, Fred

    2017-01-01

    The ability to develop Brain-Computer Interfaces (BCI) to Intelligent Systems would offer new perspectives in terms of human supervision of complex Artificial Intelligence (AI) systems, as well as supporting new types of applications. In this article, we introduce a basic mechanism for the control of heuristic search through fNIRS-based BCI. The rationale is that heuristic search is not only a basic AI mechanism but also one still at the heart of many different AI systems. We investigate how users' mental disposition can be harnessed to influence the performance of heuristic search algorithm through a mechanism of precision-complexity exchange. From a system perspective, we use weighted variants of the A* algorithm which have an ability to provide faster, albeit suboptimal solutions. We use recent results in affective BCI to capture a BCI signal, which is indicative of a compatible mental disposition in the user. It has been established that Prefrontal Cortex (PFC) asymmetry is strongly correlated to motivational dispositions and results anticipation, such as approach or even risk-taking, and that this asymmetry is amenable to Neurofeedback (NF) control. Since PFC asymmetry is accessible through fNIRS, we designed a BCI paradigm in which users vary their PFC asymmetry through NF during heuristic search tasks, resulting in faster solutions. This is achieved through mapping the PFC asymmetry value onto the dynamic weighting parameter of the weighted A* (WA*) algorithm. We illustrate this approach through two different experiments, one based on solving 8-puzzle configurations, and the other on path planning. In both experiments, subjects were able to speed up the computation of a solution through a reduction of search space in WA*. Our results establish the ability of subjects to intervene in heuristic search progression, with effects which are commensurate to their control of PFC asymmetry: this opens the way to new mechanisms for the implementation of hybrid

  4. Heuristic control of the Utah/MIT dextrous robot hand

    NASA Technical Reports Server (NTRS)

    Bass, Andrew H., Jr.

    1987-01-01

    Basic hand grips and sensor interactions that a dextrous robot hand will need as part of the operation of an EVA Retriever are analyzed. What is to be done with a dextrous robot hand is examined along with how such a complex machine might be controlled. It was assumed throughout that an anthropomorphic robot hand should perform tasks just as a human would; i.e., the most efficient approach to developing control strategies for the hand would be to model actual hand actions and do the same tasks in the same ways. Therefore, basic hand grips that human hands perform, as well as hand grip action were analyzed. It was also important to examine what is termed sensor fusion. This is the integration of various disparate sensor feedback paths. These feedback paths can be spatially and temporally separated, as well as, of different sensor types. Neural networks are seen as a means of integrating these varied sensor inputs and types. Basic heuristics of hand actions and grips were developed. These heuristics offer promise of control dextrous robot hands in a more natural and efficient way.

  5. Heuristic Evaluation of E-Learning Courses: A Comparative Analysis of Two E-Learning Heuristic Sets

    ERIC Educational Resources Information Center

    Zaharias, Panagiotis; Koutsabasis, Panayiotis

    2012-01-01

    Purpose: The purpose of this paper is to discuss heuristic evaluation as a method for evaluating e-learning courses and applications and more specifically to investigate the applicability and empirical use of two customized e-learning heuristic protocols. Design/methodology/approach: Two representative e-learning heuristic protocols were chosen…

  6. Learning process mapping heuristics under stochastic sampling overheads

    NASA Technical Reports Server (NTRS)

    Ieumwananonthachai, Arthur; Wah, Benjamin W.

    1991-01-01

    A statistical method was developed previously for improving process mapping heuristics. The method systematically explores the space of possible heuristics under a specified time constraint. Its goal is to get the best possible heuristics while trading between the solution quality of the process mapping heuristics and their execution time. The statistical selection method is extended to take into consideration the variations in the amount of time used to evaluate heuristics on a problem instance. The improvement in performance is presented using the more realistic assumption along with some methods that alleviate the additional complexity.

  7. More than one way to see it: Individual heuristics in avian visual computation.

    PubMed

    Ravignani, Andrea; Westphal-Fitch, Gesche; Aust, Ulrike; Schlumpp, Martin M; Fitch, W Tecumseh

    2015-10-01

    Comparative pattern learning experiments investigate how different species find regularities in sensory input, providing insights into cognitive processing in humans and other animals. Past research has focused either on one species' ability to process pattern classes or different species' performance in recognizing the same pattern, with little attention to individual and species-specific heuristics and decision strategies. We trained and tested two bird species, pigeons (Columba livia) and kea (Nestor notabilis, a parrot species), on visual patterns using touch-screen technology. Patterns were composed of several abstract elements and had varying degrees of structural complexity. We developed a model selection paradigm, based on regular expressions, that allowed us to reconstruct the specific decision strategies and cognitive heuristics adopted by a given individual in our task. Individual birds showed considerable differences in the number, type and heterogeneity of heuristic strategies adopted. Birds' choices also exhibited consistent species-level differences. Kea adopted effective heuristic strategies, based on matching learned bigrams to stimulus edges. Individual pigeons, in contrast, adopted an idiosyncratic mix of strategies that included local transition probabilities and global string similarity. Although performance was above chance and quite high for kea, no individual of either species provided clear evidence of learning exactly the rule used to generate the training stimuli. Our results show that similar behavioral outcomes can be achieved using dramatically different strategies and highlight the dangers of combining multiple individuals in a group analysis. These findings, and our general approach, have implications for the design of future pattern learning experiments, and the interpretation of comparative cognition research more generally.

  8. More than one way to see it: Individual heuristics in avian visual computation

    PubMed Central

    Ravignani, Andrea; Westphal-Fitch, Gesche; Aust, Ulrike; Schlumpp, Martin M.; Fitch, W. Tecumseh

    2015-01-01

    Comparative pattern learning experiments investigate how different species find regularities in sensory input, providing insights into cognitive processing in humans and other animals. Past research has focused either on one species’ ability to process pattern classes or different species’ performance in recognizing the same pattern, with little attention to individual and species-specific heuristics and decision strategies. We trained and tested two bird species, pigeons (Columba livia) and kea (Nestor notabilis, a parrot species), on visual patterns using touch-screen technology. Patterns were composed of several abstract elements and had varying degrees of structural complexity. We developed a model selection paradigm, based on regular expressions, that allowed us to reconstruct the specific decision strategies and cognitive heuristics adopted by a given individual in our task. Individual birds showed considerable differences in the number, type and heterogeneity of heuristic strategies adopted. Birds’ choices also exhibited consistent species-level differences. Kea adopted effective heuristic strategies, based on matching learned bigrams to stimulus edges. Individual pigeons, in contrast, adopted an idiosyncratic mix of strategies that included local transition probabilities and global string similarity. Although performance was above chance and quite high for kea, no individual of either species provided clear evidence of learning exactly the rule used to generate the training stimuli. Our results show that similar behavioral outcomes can be achieved using dramatically different strategies and highlight the dangers of combining multiple individuals in a group analysis. These findings, and our general approach, have implications for the design of future pattern learning experiments, and the interpretation of comparative cognition research more generally. PMID:26113444

  9. Include heuristics in protection systems

    SciTech Connect

    Kobyakov, A.I. )

    1993-02-01

    Automatic systems based on interlock principles are the most popular method of protecting plants from hazards. Nevertheless, such systems have specific shortcomings. The major one comes from the fact that protection controls are activated at the stage of break down mode development, and not at the moments of pre-fault status origin. It is possible to design protection controls that account for information relating to pre-fault status, causes, locations, and potential danger severity. A method of recreating automatic protection systems (APS) with functioning and structural organization is based on the accepted strategy of potentially hazardous plant protection. APS features these basic functions: pre-fault status classification and diagnostic providing protection controls that depend on pre-fault status type and cause, and suppression process analysis and protection controls correction. The system functions as a parallel/series process. Pre-fault status location data with related classification and diagnostics are based on current startup information. A protection control vector is formed that guarantees pre-fault status suppression. This paper describes these features.

  10. Fairness heuristic theory: valid but not empirical.

    PubMed

    Arnadóttir, Steinvör Pöll

    2002-09-01

    Fairness heuristic theory is concerned with how people react to outcomes of their dealings with authorities, and makes some predictions concerning the relationship between perceived fairness of procedures, perceived fairness of outcomes and acceptance of outcomes. Although considerable effort has been put into establishing empirical evidence for the theory, it is argued that such efforts have no bearing upon the truth of the theory. Central propositions of fairness heuristic theory that have recently been tested empirically are examined and found to be nonempirical and noncontingent. The propositions, it is argued, are necessary truths of commonsense psychology that are not falsifiable by empirical outcomes. Hence, empirical research designed to test them, it is argued, is fruitless and misguided.

  11. A System for Automatically Generating Scheduling Heuristics

    NASA Technical Reports Server (NTRS)

    Morris, Robert

    1996-01-01

    The goal of this research is to improve the performance of automated schedulers by designing and implementing an algorithm by automatically generating heuristics by selecting a schedule. The particular application selected by applying this method solves the problem of scheduling telescope observations, and is called the Associate Principal Astronomer. The input to the APA scheduler is a set of observation requests submitted by one or more astronomers. Each observation request specifies an observation program as well as scheduling constraints and preferences associated with the program. The scheduler employs greedy heuristic search to synthesize a schedule that satisfies all hard constraints of the domain and achieves a good score with respect to soft constraints expressed as an objective function established by an astronomer-user.

  12. Heuristics and Biases in Military Decision Making

    DTIC Science & Technology

    2010-10-01

    to embrace improvisation and reflection.3 The theory of reflection-in-action requires practitioners to question the structure of assumptions within...how we make decisions shape these heuristics and their accompanying biases. The theory of reflection-in-action and its implications for decision... theory ) which sought to describe human behavior as a rational maximization of cost-benefit decisions, Kahne- man and Tversky provided a simple

  13. Heuristics for Job-Shop Scheduling

    DTIC Science & Technology

    1988-01-01

    None 11. KEY WORDS (Continue on fewer&* Slde II neceseome aid idontify by Wock numberh) scheduling job-shop heuristic geometric 20. ABSTRACT (C nRtnue...partial fulfillment of the requirements for the degree of Doctor of Science in Mechanical Engineering. Abstract Two methods of obtaining approximate... Representation 27 2.1 Cartesian Completion Space. .. .. .. .. .I.. ... ... ... ... 27 2.2 Capabilities and Limitations of the Representation

  14. Structuring Decisions. The Role of Structuring Heuristics

    DTIC Science & Technology

    1981-08-01

    tasks to be carried out: 1. Develop interactive Multiattribute Utility Theory ( MAUT ) aid with dynamic capability, 2. Collect and investigate heuristics... Multiattribute Utility Theory When the value of a consequence can be completely described in terms of money (e.g., worth $1,000), utility assessment may be...C. Application of multiattribute utility theory . In H. Junger- mann & G. de Zeeuw (Eds.), Decision making and change in human affairs. Amsterdam

  15. When decision heuristics and science collide.

    PubMed

    Yu, Erica C; Sprenger, Amber M; Thomas, Rick P; Dougherty, Michael R

    2014-04-01

    The ongoing discussion among scientists about null-hypothesis significance testing and Bayesian data analysis has led to speculation about the practices and consequences of "researcher degrees of freedom." This article advances this debate by asking the broader questions that we, as scientists, should be asking: How do scientists make decisions in the course of doing research, and what is the impact of these decisions on scientific conclusions? We asked practicing scientists to collect data in a simulated research environment, and our findings show that some scientists use data collection heuristics that deviate from prescribed methodology. Monte Carlo simulations show that data collection heuristics based on p values lead to biases in estimated effect sizes and Bayes factors and to increases in both false-positive and false-negative rates, depending on the specific heuristic. We also show that using Bayesian data collection methods does not eliminate these biases. Thus, our study highlights the little appreciated fact that the process of doing science is a behavioral endeavor that can bias statistical description and inference in a manner that transcends adherence to any particular statistical framework.

  16. "The Gaze Heuristic:" Biography of an Adaptively Rational Decision Process.

    PubMed

    Hamlin, Robert P

    2017-02-21

    This article is a case study that describes the natural and human history of the gaze heuristic. The gaze heuristic is an interception heuristic that utilizes a single input (deviation from a constant angle of approach) repeatedly as a task is performed. Its architecture, advantages, and limitations are described in detail. A history of the gaze heuristic is then presented. In natural history, the gaze heuristic is the only known technique used by predators to intercept prey. In human history the gaze heuristic was discovered accidentally by Royal Air Force (RAF) fighter command just prior to World War II. As it was never discovered by the Luftwaffe, the technique conferred a decisive advantage upon the RAF throughout the war. After the end of the war in America, German technology was combined with the British heuristic to create the Sidewinder AIM9 missile, the most successful autonomous weapon ever built. There are no plans to withdraw it or replace its guiding gaze heuristic. The case study demonstrates that the gaze heuristic is a specific heuristic type that takes a single best input at the best time (take the best(2) ). Its use is an adaptively rational response to specific, rapidly evolving decision environments that has allowed those animals/humans/machines who use it to survive, prosper, and multiply relative to those who do not.

  17. Common-sense chemistry: The use of assumptions and heuristics in problem solving

    NASA Astrophysics Data System (ADS)

    Maeyer, Jenine Rachel

    Students experience difficulty learning and understanding chemistry at higher levels, often because of cognitive biases stemming from common sense reasoning constraints. These constraints can be divided into two categories: assumptions (beliefs held about the world around us) and heuristics (the reasoning strategies or rules used to build predictions and make decisions). A better understanding and characterization of these constraints are of central importance in the development of curriculum and teaching strategies that better support student learning in science. It was the overall goal of this thesis to investigate student reasoning in chemistry, specifically to better understand and characterize the assumptions and heuristics used by undergraduate chemistry students. To achieve this, two mixed-methods studies were conducted, each with quantitative data collected using a questionnaire and qualitative data gathered through semi-structured interviews. The first project investigated the reasoning heuristics used when ranking chemical substances based on the relative value of a physical or chemical property, while the second study characterized the assumptions and heuristics used when making predictions about the relative likelihood of different types of chemical processes. Our results revealed that heuristics for cue selection and decision-making played a significant role in the construction of answers during the interviews. Many study participants relied frequently on one or more of the following heuristics to make their decisions: recognition, representativeness, one-reason decision-making, and arbitrary trend. These heuristics allowed students to generate answers in the absence of requisite knowledge, but often led students astray. When characterizing assumptions, our results indicate that students relied on intuitive, spurious, and valid assumptions about the nature of chemical substances and processes in building their responses. In particular, many

  18. A lack of appetite for information and computation. Simple heuristics in food choice.

    PubMed

    Schulte-Mecklenbeck, Michael; Sohn, Matthias; de Bellis, Emanuel; Martin, Nathalie; Hertwig, Ralph

    2013-12-01

    The predominant, but largely untested, assumption in research on food choice is that people obey the classic commandments of rational behavior: they carefully look up every piece of relevant information, weight each piece according to subjective importance, and then combine them into a judgment or choice. In real world situations, however, the available time, motivation, and computational resources may simply not suffice to keep these commandments. Indeed, there is a large body of research suggesting that human choice is often better accommodated by heuristics-simple rules that enable decision making on the basis of a few, but important, pieces of information. We investigated the prevalence of such heuristics in a computerized experiment that engaged participants in a series of choices between two lunch dishes. Employing MouselabWeb, a process-tracing technique, we found that simple heuristics described an overwhelmingly large proportion of choices, whereas strategies traditionally deemed rational were barely apparent in our data. Replicating previous findings, we also observed that visual stimulus segments received a much larger proportion of attention than any nutritional values did. Our results suggest that, consistent with human behavior in other domains, people make their food choices on the basis of simple and informationally frugal heuristics.

  19. Self-organization in a distributed coordination game through heuristic rules

    NASA Astrophysics Data System (ADS)

    Agarwal, Shubham; Ghosh, Diptesh; Chakrabarti, Anindya S.

    2016-12-01

    In this paper, we consider a distributed coordination game played by a large number of agents with finite information sets, which characterizes emergence of a single dominant attribute out of a large number of competitors. Formally, N agents play a coordination game repeatedly, which has exactly N pure strategy Nash equilibria, and all of the equilibria are equally preferred by the agents. The problem is to select one equilibrium out of N possible equilibria in the least number of attempts. We propose a number of heuristic rules based on reinforcement learning to solve the coordination problem. We see that the agents self-organize into clusters with varying intensities depending on the heuristic rule applied, although all clusters but one are transitory in most cases. Finally, we characterize a trade-off in terms of the time requirement to achieve a degree of stability in strategies versus the efficiency of such a solution.

  20. AM: An Artificial Intelligence Approach to Discovery in Mathematics as Heuristic Search

    DTIC Science & Technology

    1976-07-01

    conclusions contained in this document are those of the author (s) and should not be interpreted as necessarily representing the official policies...faculties, skills . The more familiar the parts, the more striking the new whole. -- Koestler Suppose a large collection of these heuristic strategies...hitherto unknown to the author . A couple bits of new mathematics have been inipired by AM.2 A synergetic AM-human combination can sometimes produce

  1. Intelligent process mapping through systematic improvement of heuristics

    NASA Technical Reports Server (NTRS)

    Ieumwananonthachai, Arthur; Aizawa, Akiko N.; Schwartz, Steven R.; Wah, Benjamin W.; Yan, Jerry C.

    1992-01-01

    The present system for automatic learning/evaluation of novel heuristic methods applicable to the mapping of communication-process sets on a computer network has its basis in the testing of a population of competing heuristic methods within a fixed time-constraint. The TEACHER 4.1 prototype learning system implemented or learning new postgame analysis heuristic methods iteratively generates and refines the mappings of a set of communicating processes on a computer network. A systematic exploration of the space of possible heuristic methods is shown to promise significant improvement.

  2. A Graph Search Heuristic for Shortest Distance Paths

    SciTech Connect

    Chow, E

    2005-03-24

    This paper presents a heuristic for guiding A* search for finding the shortest distance path between two vertices in a connected, undirected, and explicitly stored graph. The heuristic requires a small amount of data to be stored at each vertex. The heuristic has application to quickly detecting relationships between two vertices in a large information or knowledge network. We compare the performance of this heuristic with breadth-first search on graphs with various topological properties. The results show that one or more orders of magnitude improvement in the number of vertices expanded is possible for large graphs, including Poisson random graphs.

  3. Hegemony, hermeneutics, and the heuristic of hope.

    PubMed

    Dorcy, Kathleen Shannon

    2010-01-01

    Hope has become a commodity, one that society expects those who suffer to invest in and one that healthcare providers are expected to promote as an outcome. In nursing research, a single hegemonic epistemology/ontology has been implemented through an exclusive hermeneutic (interpretation of data) and has resulted in hope being designated as an external objective heuristic for those who suffer. Evidence is articulated in this article for adopting a broader method of analysis and interpretation (genealogy) that can facilitate fuller apprehension of hope in the human experience of suffering and despair.

  4. Heuristic reconstructions of neutron penumbral images

    SciTech Connect

    Nozaki, Shinya; Chen Yenwei

    2004-10-01

    Penumbral imaging is a technique of coded aperture imaging proposed for imaging of highly penetrating radiations. To date, the penumbral imaging technique has been successfully applied to neutron imaging in laser fusion experiments. Since the reconstruction of penumbral images is based on linear deconvolution methods, such as inverse filter and Wiener filer, the point spread function of apertures should be space invariant; it is also sensitive to the noise contained in penumbral images. In this article, we propose a new heuristic reconstruction method for neutron penumbral imaging, which can be used for a space-variant imaging system and is also very tolerant to the noise.

  5. How do people judge risks: availability heuristic, affect heuristic, or both?

    PubMed

    Pachur, Thorsten; Hertwig, Ralph; Steinmann, Florian

    2012-09-01

    How does the public reckon which risks to be concerned about? The availability heuristic and the affect heuristic are key accounts of how laypeople judge risks. Yet, these two accounts have never been systematically tested against each other, nor have their predictive powers been examined across different measures of the public's risk perception. In two studies, we gauged risk perception in student samples by employing three measures (frequency, value of a statistical life, and perceived risk) and by using a homogeneous (cancer) and a classic set of heterogeneous causes of death. Based on these judgments of risk, we tested precise models of the availability heuristic and the affect heuristic and different definitions of availability and affect. Overall, availability-by-recall, a heuristic that exploits people's direct experience of occurrences of risks in their social network, conformed to people's responses best. We also found direct experience to carry a high degree of ecological validity (and one that clearly surpasses that of affective information). However, the relative impact of affective information (as compared to availability) proved more pronounced in value-of-a-statistical-life and perceived-risk judgments than in risk-frequency judgments. Encounters with risks in the media, in contrast, played a negligible role in people's judgments. Going beyond the assumption of exclusive reliance on either availability or affect, we also found evidence for mechanisms that combine both, either sequentially or in a composite fashion. We conclude with a discussion of policy implications of our results, including how to foster people's risk calibration and the success of education campaigns.

  6. University Research Centers: Heuristic Categories, Issues, and Administrative Strategies

    ERIC Educational Resources Information Center

    Hall, Kelly

    2011-01-01

    University-based research centers can bring prestige and revenue to the institutions of higher education with which they are affiliated. Collaborating with corporations, units of government, and foundations, centers provide services to organizational leaders, policy makers, and communities. University research centers continue to increase in…

  7. Heuristics for test recognition using contextual information

    NASA Astrophysics Data System (ADS)

    Baraghimian, Tony

    1995-01-01

    Competitive electronic imaging systems are emerging due to rapidly declining processing power and storage costs. Imaging converts information on paper to electronic pictures. For applications involving large quantities of paper documents, the resulting pictures are further processed by automated character recognition systems, resulting in a text representation of the original document. Current character recognition accuracy varies from one implementation to the next, and greatly depends on each particular application. We define a set of information fusion rules for combining character recognition system output. The combined result has a higher character recognition accuracy and lower error rate than either of the individual recognizer outputs taken separately. This new set of fusion heuristics takes advantage of the following information from multiple text string recognition systems simultaneously: (1) multiple hypotheses and associated confidences for each character in a text string; (2) multiple text string segmentation hypotheses; (3) separate or combined hypotheses for both uppercase and lowercase alphabetic characters; and (4) overall text string hypotheses and associated confidences. Traditionally, only the last of these four information groups is used for fusion of multiple classifications within character recognition systems. We report on a nationally sponsored character recognition benchmark, with results indicating increased accuracy using the heuristic rules described.

  8. Memorability in Context: A Heuristic Story.

    PubMed

    Geurten, Marie; Meulemans, Thierry; Willems, Sylvie

    2015-01-01

    We examined children's ability to employ a metacognitive heuristic based on memorability expectations to reduce false recognitions, and explored whether these expectations depend on the context in which the items are presented. Specifically, 4-, 6-, and 9-year-old children were presented with high-, medium-, and low-memorability words, either mixed together (Experiment 1) or separated into two different lists (Experiment 2). Results revealed that only children with a higher level of executive functioning (9-year-olds) used the memorability-based heuristic when all types of items were presented within the same list. However, all children, regardless of age or executive level, implemented the metacognitive rule when high- and low-memorability words were presented in two separate lists. Moreover, the results of Experiment 2 showed that participants processed medium-memorability words more conservatively when they were presented in a low- than in a high-memorability list, suggesting that children's memorability expectations are sensitive to list-context effects.

  9. Heuristic Inquiry: A Personal Journey of Acculturation and Identity Reconstruction

    ERIC Educational Resources Information Center

    Djuraskovic, Ivana; Arthur, Nancy

    2010-01-01

    Heuristic methodology attempts to discover the nature and meaning of phenomenon through internal self-search, exploration, and discovery. Heuristic methodology encourages the researcher to explore and pursue the creative journey that begins inside one's being and ultimately uncovers its direction and meaning through internal discovery (Douglass &…

  10. Swift and Smart Decision Making: Heuristics that Work

    ERIC Educational Resources Information Center

    Hoy, Wayne K.; Tarter, C. J.

    2010-01-01

    Purpose: The aim of this paper is to examine the research literature on decision making and identify and develop a set of heuristics that work for school decision makers. Design/methodology/approach: This analysis is a synthesis of the research on decision-making heuristics that work. Findings: A set of nine rules for swift and smart decision…

  11. Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems

    PubMed Central

    Moreno-Scott, Jorge Humberto; Ortiz-Bayliss, José Carlos; Terashima-Marín, Hugo; Conant-Pablos, Santiago Enrique

    2016-01-01

    Constraint satisfaction problems are of special interest for the artificial intelligence and operations research community due to their many applications. Although heuristics involved in solving these problems have largely been studied in the past, little is known about the relation between instances and the respective performance of the heuristics used to solve them. This paper focuses on both the exploration of the instance space to identify relations between instances and good performing heuristics and how to use such relations to improve the search. Firstly, the document describes a methodology to explore the instance space of constraint satisfaction problems and evaluate the corresponding performance of six variable ordering heuristics for such instances in order to find regions on the instance space where some heuristics outperform the others. Analyzing such regions favors the understanding of how these heuristics work and contribute to their improvement. Secondly, we use the information gathered from the first stage to predict the most suitable heuristic to use according to the features of the instance currently being solved. This approach proved to be competitive when compared against the heuristics applied in isolation on both randomly generated and structured instances of constraint satisfaction problems. PMID:26949383

  12. Cultural Heuristics: Topics of Invention Based on Human Behavior.

    ERIC Educational Resources Information Center

    DeGeorge, James M.

    Heuristic models help writers recall information, sometimes revealing unique combinations of information in ways not conceived previously. This makes heuristics a valuable technique for helping beginning writers generate writing ideas. Observing that all culture is communication, Edward Hall has organized Primary Message Systems (PMS), a framework…

  13. Automating the packing heuristic design process with genetic programming.

    PubMed

    Burke, Edmund K; Hyde, Matthew R; Kendall, Graham; Woodward, John

    2012-01-01

    The literature shows that one-, two-, and three-dimensional bin packing and knapsack packing are difficult problems in operational research. Many techniques, including exact, heuristic, and metaheuristic approaches, have been investigated to solve these problems and it is often not clear which method to use when presented with a new instance. This paper presents an approach which is motivated by the goal of building computer systems which can design heuristic methods. The overall aim is to explore the possibilities for automating the heuristic design process. We present a genetic programming system to automatically generate a good quality heuristic for each instance. It is not necessary to change the methodology depending on the problem type (one-, two-, or three-dimensional knapsack and bin packing problems), and it therefore has a level of generality unmatched by other systems in the literature. We carry out an extensive suite of experiments and compare with the best human designed heuristics in the literature. Note that our heuristic design methodology uses the same parameters for all the experiments. The contribution of this paper is to present a more general packing methodology than those currently available, and to show that, by using this methodology, it is possible for a computer system to design heuristics which are competitive with the human designed heuristics from the literature. This represents the first packing algorithm in the literature able to claim human competitive results in such a wide variety of packing domains.

  14. Heuristics for Online Information Retrieval: A Typology and Preliminary Listing.

    ERIC Educational Resources Information Center

    Harter, Stephen P.; Peters, Anne Rogers

    1985-01-01

    Presents typology of online search heuristics consisting of six main classes: philosophical attitudes and overall approach; language of problem description; record and file structure; concept formulation and reformulation; recall and precision; and cost efficiency. Heuristics in each of the six classes are listed and selected examples are briefly…

  15. Inferring heuristic classification hierarchies from natural language input

    NASA Technical Reports Server (NTRS)

    Hull, Richard; Gomez, Fernando

    1993-01-01

    A methodology for inferring hierarchies representing heuristic knowledge about the check out, control, and monitoring sub-system (CCMS) of the space shuttle launch processing system from natural language input is explained. Our method identifies failures explicitly and implicitly described in natural language by domain experts and uses those descriptions to recommend classifications for inclusion in the experts' heuristic hierarchies.

  16. Hyper-heuristics with low level parameter adaptation.

    PubMed

    Ren, Zhilei; Jiang, He; Xuan, Jifeng; Luo, Zhongxuan

    2012-01-01

    Recent years have witnessed the great success of hyper-heuristics applying to numerous real-world applications. Hyper-heuristics raise the generality of search methodologies by manipulating a set of low level heuristics (LLHs) to solve problems, and aim to automate the algorithm design process. However, those LLHs are usually parameterized, which may contradict the domain independent motivation of hyper-heuristics. In this paper, we show how to automatically maintain low level parameters (LLPs) using a hyper-heuristic with LLP adaptation (AD-HH), and exemplify the feasibility of AD-HH by adaptively maintaining the LLPs for two hyper-heuristic models. Furthermore, aiming at tackling the search space expansion due to the LLP adaptation, we apply a heuristic space reduction (SAR) mechanism to improve the AD-HH framework. The integration of the LLP adaptation and the SAR mechanism is able to explore the heuristic space more effectively and efficiently. To evaluate the performance of the proposed algorithms, we choose the p-median problem as a case study. The empirical results show that with the adaptation of the LLPs and the SAR mechanism, the proposed algorithms are able to achieve competitive results over the three heterogeneous classes of benchmark instances.

  17. Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems.

    PubMed

    Moreno-Scott, Jorge Humberto; Ortiz-Bayliss, José Carlos; Terashima-Marín, Hugo; Conant-Pablos, Santiago Enrique

    2016-01-01

    Constraint satisfaction problems are of special interest for the artificial intelligence and operations research community due to their many applications. Although heuristics involved in solving these problems have largely been studied in the past, little is known about the relation between instances and the respective performance of the heuristics used to solve them. This paper focuses on both the exploration of the instance space to identify relations between instances and good performing heuristics and how to use such relations to improve the search. Firstly, the document describes a methodology to explore the instance space of constraint satisfaction problems and evaluate the corresponding performance of six variable ordering heuristics for such instances in order to find regions on the instance space where some heuristics outperform the others. Analyzing such regions favors the understanding of how these heuristics work and contribute to their improvement. Secondly, we use the information gathered from the first stage to predict the most suitable heuristic to use according to the features of the instance currently being solved. This approach proved to be competitive when compared against the heuristics applied in isolation on both randomly generated and structured instances of constraint satisfaction problems.

  18. Individual Heuristics and the Dynamics of Cooperation in Large Groups.

    ERIC Educational Resources Information Center

    Messick, David M.; Liebrand, Wim B. G.

    1995-01-01

    Computer simulations are described in which pairs of simulated individuals in groups play a prisoner's dilemma game, with the choice to cooperate determined by one of three simple heuristics. Results reveal that the prevalence of cooperation depends on the heuristic used, value of the payoff, and the social comparison process. (SLD)

  19. Use of Statistical Heuristics in Everyday Inductive Reasoning.

    ERIC Educational Resources Information Center

    Nisbett, Richard E.; And Others

    1983-01-01

    In everyday reasoning, people use statistical heuristics (judgmental tools that are rough intuitive equivalents of statistical principles). Use of statistical heuristics is more likely when (1) sampling is clear, (2) the role of chance is clear, (3) statistical reasoning is normative for the event, or (4) the subject has had training in…

  20. HEURISTIC OPTIMIZATION AND ALGORITHM TUNING APPLIED TO SORPTIVE BARRIER DESIGN

    EPA Science Inventory

    While heuristic optimization is applied in environmental applications, ad-hoc algorithm configuration is typical. We use a multi-layer sorptive barrier design problem as a benchmark for an algorithm-tuning procedure, as applied to three heuristics (genetic algorithms, simulated ...

  1. Does the inherence heuristic take us to psychological essentialism?

    PubMed

    Marmodoro, Anna; Murphy, Robin A; Baker, A G

    2014-10-01

    We argue that the claim that essence-based causal explanations emerge, hydra-like, from an inherence heuristic is incomplete. No plausible mechanism for the transition from concrete properties, or cues, to essences is provided. Moreover, the fundamental shotgun and storytelling mechanisms of the inherence heuristic are not clearly enough specified to distinguish them, developmentally, from associative or causal networks.

  2. An extended abstract: A heuristic repair method for constraint-satisfaction and scheduling problems

    NASA Technical Reports Server (NTRS)

    Minton, Steven; Johnston, Mark D.; Philips, Andrew B.; Laird, Philip

    1992-01-01

    The work described in this paper was inspired by a surprisingly effective neural network developed for scheduling astronomical observations on the Hubble Space Telescope. Our heuristic constraint satisfaction problem (CSP) method was distilled from an analysis of the network. In the process of carrying out the analysis, we discovered that the effectiveness of the network has little to do with its connectionist implementation. Furthermore, the ideas employed in the network can be implemented very efficiently within a symbolic CSP framework. The symbolic implementation is extremely simple. It also has the advantage that several different search strategies can be employed, although we have found that hill-climbing methods are particularly well-suited for the applications that we have investigated. We begin the paper with a brief review of the neural network. Following this, we describe our symbolic method for heuristic repair.

  3. Heuristic Traversal Of A Free Space Graph

    NASA Astrophysics Data System (ADS)

    Holmes, Peter D.; Jungert, Erland

    1989-01-01

    In order to plan paths within a physical working space, effective data structures must be used for spatial representation. A free space graph is a data structure derived from a systematic decomposition of the unobstructed portions of the working space. For the two-dimensional case, this work describes an heuristic method for traversal and search of one particular type of free space graph. The focus herein regards the "dialogue" between an A* search process and an inference engine whose rules employ spatial operators for classification of local topologies within the free space graph. This knowledge-based technique is used to generate plans which describe admissible sequences of movement between selected start and goal configurations.

  4. Regularity of free boundaries a heuristic retro

    PubMed Central

    Caffarelli, Luis A.; Shahgholian, Henrik

    2015-01-01

    This survey concerns regularity theory of a few free boundary problems that have been developed in the past half a century. Our intention is to bring up different ideas and techniques that constitute the fundamentals of the theory. We shall discuss four different problems, where approaches are somewhat different in each case. Nevertheless, these problems can be divided into two groups: (i) obstacle and thin obstacle problem; (ii) minimal surfaces, and cavitation flow of a perfect fluid. In each case, we shall only discuss the methodology and approaches, giving basic ideas and tools that have been specifically designed and tailored for that particular problem. The survey is kept at a heuristic level with mainly geometric interpretation of the techniques and situations in hand. PMID:26261372

  5. Interim Report on Heuristics about Inspection Parameters: Updates to Heuristics Resulting from Refinement on Projects

    NASA Technical Reports Server (NTRS)

    Shull, Forrest; Seaman, Carolyn; Feldman, Raimund; Haingaertner, Ralf; Regardie, Myrna

    2008-01-01

    In 2008, we have continued analyzing the inspection data in an effort to better understand the applicability and effect of the inspection heuristics on inspection outcomes. Our research goals during this period are: 1. Investigate the effect of anomalies in the dataset (e.g. the very large meeting length values for some inspections) on our results 2. Investigate the effect of the heuristics on other inspection outcome variables (e.g. effort) 3. Investigate whether the recommended ranges can be modified to give inspection planners more flexibility without sacrificing effectiveness 4. Investigate possible refinements or modifications to the heuristics for specific subdomains (partitioned, e.g., by size, domain, or Center) This memo reports our results to date towards addressing these goals. In the next section, the first goal is addressed by describing the types of anomalies we have found in our dataset, how we have addressed them, and the effect of these changes on our previously reported results. In the following section, on "methodology", we describe the analyses we have conducted to address the other three goals and the results of these analyses are described in the "results" section. Finally, we conclude with future plans for continuing our investigation.

  6. Comparative study of heuristic evaluation and usability testing methods.

    PubMed

    Thyvalikakath, Thankam Paul; Monaco, Valerie; Thambuganipalle, Himabindu; Schleyer, Titus

    2009-01-01

    Usability methods, such as heuristic evaluation, cognitive walk-throughs and user testing, are increasingly used to evaluate and improve the design of clinical software applications. There is still some uncertainty, however, as to how those methods can be used to support the development process and evaluation in the most meaningful manner. In this study, we compared the results of a heuristic evaluation with those of formal user tests in order to determine which usability problems were detected by both methods. We conducted heuristic evaluation and usability testing on four major commercial dental computer-based patient records (CPRs), which together cover 80% of the market for chairside computer systems among general dentists. Both methods yielded strong evidence that the dental CPRs have significant usability problems. An average of 50% of empirically-determined usability problems were identified by the preceding heuristic evaluation. Some statements of heuristic violations were specific enough to precisely identify the actual usability problem that study participants encountered. Other violations were less specific, but still manifested themselves in usability problems and poor task outcomes. In this study, heuristic evaluation identified a significant portion of problems found during usability testing. While we make no assumptions about the generalizability of the results to other domains and software systems, heuristic evaluation may, under certain circumstances, be a useful tool to determine design problems early in the development cycle.

  7. A quantum heuristic algorithm for the traveling salesman problem

    NASA Astrophysics Data System (ADS)

    Bang, Jeongho; Ryu, Junghee; Lee, Changhyoup; Yoo, Seokwon; Lim, James; Lee, Jinhyoung

    2012-12-01

    We propose a quantum heuristic algorithm to solve the traveling salesman problem by generalizing the Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with the cheapest costs reaching almost to unity. These conditions are characterized by the statistical properties of tour costs and are shown to be automatically satisfied in the large-number limit of cities. In particular for a continuous distribution of the tours along the cost, we show that the quantum heuristic algorithm exhibits a quadratic speedup compared to its classical heuristic algorithm.

  8. Teaching Evolution: A Heuristic Study of Personal and Cultural Dissonance

    NASA Astrophysics Data System (ADS)

    Grimes, Larry G.

    Darwinian evolution is a robustly supported scientific theory. Yet creationists continue to challenge its teaching in American public schools. Biology teachers in all 50 states are responsible for teaching science content standards that include evolution. As products of their backgrounds and affiliations teachers bring personal attitudes and beliefs to their teaching. The purpose of this study was to explore how biology teachers perceive, describe, and value their teaching of evolution. This research question was explored through a heuristic qualitative methodology. Eight veteran California high school biology teachers were queried as to their beliefs, perceptions, experiences and practices of teaching evolution. Both personal and professional documents were collected. Data was presented in the form of biographical essays that highlight teachers' backgrounds, experiences, perspectives and practices of teaching evolution. Of special interest was how they describe pressure over teaching evolution during a decade of standards and No Child Left Behind high-stakes testing mandates. Five common themes emerged. Standards have increased the overall amount of evolution that is taught. High-stakes testing has decreased the depth at which evolution is taught. Teacher belief systems strongly influence how evolution is taught. Fear of creationist challenges effect evolution teaching strategies. And lastly, concern over the potential effects of teaching evolution on student worldviews was mixed. Three categories of teacher concern over the potential impact of evolution on student worldviews were identified: Concerned, Strategist, and Carefree. In the final analysis teacher beliefs and attitudes still appeared to he the most important factor influencing how evolution is taught.

  9. Identifying multiple influential spreaders by a heuristic clustering algorithm

    NASA Astrophysics Data System (ADS)

    Bao, Zhong-Kui; Liu, Jian-Guo; Zhang, Hai-Feng

    2017-03-01

    The problem of influence maximization in social networks has attracted much attention. However, traditional centrality indices are suitable for the case where a single spreader is chosen as the spreading source. Many times, spreading process is initiated by simultaneously choosing multiple nodes as the spreading sources. In this situation, choosing the top ranked nodes as multiple spreaders is not an optimal strategy, since the chosen nodes are not sufficiently scattered in networks. Therefore, one ideal situation for multiple spreaders case is that the spreaders themselves are not only influential but also they are dispersively distributed in networks, but it is difficult to meet the two conditions together. In this paper, we propose a heuristic clustering (HC) algorithm based on the similarity index to classify nodes into different clusters, and finally the center nodes in clusters are chosen as the multiple spreaders. HC algorithm not only ensures that the multiple spreaders are dispersively distributed in networks but also avoids the selected nodes to be very "negligible". Compared with the traditional methods, our experimental results on synthetic and real networks indicate that the performance of HC method on influence maximization is more significant.

  10. Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons

    NASA Astrophysics Data System (ADS)

    Bashiri, Mahdi; Karimi, Hossein

    2012-07-01

    Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and particle swarm optimization as meta-heuristic methods for the QAP. This research is dedicated to compare the relative percentage deviation of these solution qualities from the best known solution which is introduced in QAPLIB. Furthermore, a tuning method is applied for meta-heuristic parameters. Results indicate that TS is the best in 31%of QAPs, and the IFLS method, which is in the literature, is the best in 58 % of QAPs; these two methods are the same in 11 % of test problems. Also, TS has a better computational time among heuristic and meta-heuristic methods.

  11. Economic tour package model using heuristic

    NASA Astrophysics Data System (ADS)

    Rahman, Syariza Abdul; Benjamin, Aida Mauziah; Bakar, Engku Muhammad Nazri Engku Abu

    2014-07-01

    A tour-package is a prearranged tour that includes products and services such as food, activities, accommodation, and transportation, which are sold at a single price. Since the competitiveness within tourism industry is very high, many of the tour agents try to provide attractive tour-packages in order to meet tourist satisfaction as much as possible. Some of the criteria that are considered by the tourist are the number of places to be visited and the cost of the tour-packages. Previous studies indicate that tourists tend to choose economical tour-packages and aiming to visit as many places as they can cover. Thus, this study proposed tour-package model using heuristic approach. The aim is to find economical tour-packages and at the same time to propose as many places as possible to be visited by tourist in a given geographical area particularly in Langkawi Island. The proposed model considers only one starting point where the tour starts and ends at an identified hotel. This study covers 31 most attractive places in Langkawi Island from various categories of tourist attractions. Besides, the allocation of period for lunch and dinner are included in the proposed itineraries where it covers 11 popular restaurants around Langkawi Island. In developing the itinerary, the proposed heuristic approach considers time window for each site (hotel/restaurant/place) so that it represents real world implementation. We present three itineraries with different time constraints (1-day, 2-day and 3-day tour-package). The aim of economic model is to minimize the tour-package cost as much as possible by considering entrance fee of each visited place. We compare the proposed model with our uneconomic model from our previous study. The uneconomic model has no limitation to the cost with the aim to maximize the number of places to be visited. Comparison between the uneconomic and economic itinerary has shown that the proposed model have successfully achieved the objective that

  12. Cognitive Abilities, Monitoring Confidence, and Control Thresholds Explain Individual Differences in Heuristics and Biases

    PubMed Central

    Jackson, Simon A.; Kleitman, Sabina; Howie, Pauline; Stankov, Lazar

    2016-01-01

    In this paper, we investigate whether individual differences in performance on heuristic and biases tasks can be explained by cognitive abilities, monitoring confidence, and control thresholds. Current theories explain individual differences in these tasks by the ability to detect errors and override automatic but biased judgments, and deliberative cognitive abilities that help to construct the correct response. Here we retain cognitive abilities but disentangle error detection, proposing that lower monitoring confidence and higher control thresholds promote error checking. Participants (N = 250) completed tasks assessing their fluid reasoning abilities, stable monitoring confidence levels, and the control threshold they impose on their decisions. They also completed seven typical heuristic and biases tasks such as the cognitive reflection test and Resistance to Framing. Using structural equation modeling, we found that individuals with higher reasoning abilities, lower monitoring confidence, and higher control threshold performed significantly and, at times, substantially better on the heuristic and biases tasks. Individuals with higher control thresholds also showed lower preferences for risky alternatives in a gambling task. Furthermore, residual correlations among the heuristic and biases tasks were reduced to null, indicating that cognitive abilities, monitoring confidence, and control thresholds accounted for their shared variance. Implications include the proposal that the capacity to detect errors does not differ between individuals. Rather, individuals might adopt varied strategies that promote error checking to different degrees, regardless of whether they have made a mistake or not. The results support growing evidence that decision-making involves cognitive abilities that construct actions and monitoring and control processes that manage their initiation. PMID:27790170

  13. Cognitive Abilities, Monitoring Confidence, and Control Thresholds Explain Individual Differences in Heuristics and Biases.

    PubMed

    Jackson, Simon A; Kleitman, Sabina; Howie, Pauline; Stankov, Lazar

    2016-01-01

    In this paper, we investigate whether individual differences in performance on heuristic and biases tasks can be explained by cognitive abilities, monitoring confidence, and control thresholds. Current theories explain individual differences in these tasks by the ability to detect errors and override automatic but biased judgments, and deliberative cognitive abilities that help to construct the correct response. Here we retain cognitive abilities but disentangle error detection, proposing that lower monitoring confidence and higher control thresholds promote error checking. Participants (N = 250) completed tasks assessing their fluid reasoning abilities, stable monitoring confidence levels, and the control threshold they impose on their decisions. They also completed seven typical heuristic and biases tasks such as the cognitive reflection test and Resistance to Framing. Using structural equation modeling, we found that individuals with higher reasoning abilities, lower monitoring confidence, and higher control threshold performed significantly and, at times, substantially better on the heuristic and biases tasks. Individuals with higher control thresholds also showed lower preferences for risky alternatives in a gambling task. Furthermore, residual correlations among the heuristic and biases tasks were reduced to null, indicating that cognitive abilities, monitoring confidence, and control thresholds accounted for their shared variance. Implications include the proposal that the capacity to detect errors does not differ between individuals. Rather, individuals might adopt varied strategies that promote error checking to different degrees, regardless of whether they have made a mistake or not. The results support growing evidence that decision-making involves cognitive abilities that construct actions and monitoring and control processes that manage their initiation.

  14. Complex Chemical Reaction Networks from Heuristics-Aided Quantum Chemistry.

    PubMed

    Rappoport, Dmitrij; Galvin, Cooper J; Zubarev, Dmitry Yu; Aspuru-Guzik, Alán

    2014-03-11

    While structures and reactivities of many small molecules can be computed efficiently and accurately using quantum chemical methods, heuristic approaches remain essential for modeling complex structures and large-scale chemical systems. Here, we present a heuristics-aided quantum chemical methodology applicable to complex chemical reaction networks such as those arising in cell metabolism and prebiotic chemistry. Chemical heuristics offer an expedient way of traversing high-dimensional reactive potential energy surfaces and are combined here with quantum chemical structure optimizations, which yield the structures and energies of the reaction intermediates and products. Application of heuristics-aided quantum chemical methodology to the formose reaction reproduces the experimentally observed reaction products, major reaction pathways, and autocatalytic cycles.

  15. Behavior of heuristics on large and hard satisfiability problems

    NASA Astrophysics Data System (ADS)

    Ardelius, John; Aurell, Erik

    2006-09-01

    We study the behavior of a heuristic for solving random satisfiability problems by stochastic local search near the satisfiability threshold. The heuristic for average satisfiability (ASAT), is similar to the Focused Metropolis Search heuristic, and shares the property of being focused, i.e., only variables in unsatisfied clauses are updated in each step. It is significantly simpler than the benchmark WALKSAT heuristic. We show that ASAT solves instances as large as N=106 in linear time, on average, up to a ratio of 4.21 clauses per variable in random three-satisfiability. For K higher than 3, ASAT appears to solve instances of K -satisfiability up to the Montanari-Ricci-Tersenghi-Parisi full replica symmetry breaking (FSRB) threshold denoted αs(K) in linear time.

  16. Impact of heuristics in clustering large biological networks.

    PubMed

    Shafin, Md Kishwar; Kabir, Kazi Lutful; Ridwan, Iffatur; Anannya, Tasmiah Tamzid; Karim, Rashid Saadman; Hoque, Mohammad Mozammel; Rahman, M Sohel

    2015-12-01

    Traditional clustering algorithms often exhibit poor performance for large networks. On the contrary, greedy algorithms are found to be relatively efficient while uncovering functional modules from large biological networks. The quality of the clusters produced by these greedy techniques largely depends on the underlying heuristics employed. Different heuristics based on different attributes and properties perform differently in terms of the quality of the clusters produced. This motivates us to design new heuristics for clustering large networks. In this paper, we have proposed two new heuristics and analyzed the performance thereof after incorporating those with three different combinations in a recently celebrated greedy clustering algorithm named SPICi. We have extensively analyzed the effectiveness of these new variants. The results are found to be promising.

  17. Novels as a Source for Heuristics about Interpersonal Communication.

    ERIC Educational Resources Information Center

    Kougl, Kathleen Mary

    1983-01-01

    Examines the interpersonal communication of main characters in three novels. Concludes that the heuristic propositions that emerge from this study might be useful in the study and understanding of real life interpersonal experiences. (PD)

  18. Heuristic Modeling for TRMM Lifetime Predictions

    NASA Technical Reports Server (NTRS)

    Jordan, P. S.; Sharer, P. J.; DeFazio, R. L.

    1996-01-01

    Analysis time for computing the expected mission lifetimes of proposed frequently maneuvering, tightly altitude constrained, Earth orbiting spacecraft have been significantly reduced by means of a heuristic modeling method implemented in a commercial-off-the-shelf spreadsheet product (QuattroPro) running on a personal computer (PC). The method uses a look-up table to estimate the maneuver frequency per month as a function of the spacecraft ballistic coefficient and the solar flux index, then computes the associated fuel use by a simple engine model. Maneuver frequency data points are produced by means of a single 1-month run of traditional mission analysis software for each of the 12 to 25 data points required for the table. As the data point computations are required only a mission design start-up and on the occasion of significant mission redesigns, the dependence on time consuming traditional modeling methods is dramatically reduced. Results to date have agreed with traditional methods to within 1 to 1.5 percent. The spreadsheet approach is applicable to a wide variety of Earth orbiting spacecraft with tight altitude constraints. It will be particularly useful to such missions as the Tropical Rainfall Measurement Mission scheduled for launch in 1997, whose mission lifetime calculations are heavily dependent on frequently revised solar flux predictions.

  19. A heuristic model of sensory adaptation.

    PubMed

    McBurney, Donald H; Balaban, Carey D

    2009-11-01

    Adaptation is a universal process in organisms as diverse as bacteria and humans, and across the various senses. This article proposes a simple, heuristic, mathematical model containing tonic and phasic processes. The model demonstrates properties not commonly associated with adaptation, such as increased sensitivity to changes, range shifting, and phase lead. Changes in only four parameters permit the model to predict empirical psychophysical data from different senses. The relatively prolonged time courses of responses to oral and topical capsaicin are used to illustrate and validate this mathematical modeling approach for different stimulus profiles. Other examples of phenomena elucidated by this modeling approach include the time courses of taste sensation, brightness perception, loudness perception, cross-adaptation to oral irritants, and cutaneous mechanoreception. It also predicts such apparently unrelated phenomena as perceived alcohol intoxication, habituation, and drug tolerance. Because the integration of phasic and tonic components is a conservative, highly efficacious solution to a ubiquitous biological challenge, sensory adaptation is seen as an evolutionary adaptation, and as a prominent feature of Mother Nature's small bag of tricks.

  20. Scheduling constrained tools using heuristic techniques

    NASA Astrophysics Data System (ADS)

    Maram, Venkataramana; Rahman, Syariza Abdul; Maram, Sandhya Rani

    2015-12-01

    One of the main challenge to the current manufacturing production planning is to provide schedules of operations to maximize resource utilization to yield highest overall productivity. This is achieved by scheduling available resources to activities. There can be many different real time scenarios with different combination of input resources to produce parts. In this paper, the problem is simplified to single machine with individual process times and due dates to represent the real world scheduling problem. The main objective function is to minimize the total tardiness or late jobs. Nearest greedy method of assignment problem algorithm is used to find the initial solution followed by Simulated Annealing (SA) algorithm for the improvement part. Simulated Annealing is one of the meta-heuristic techniques in solving combinatorial optimization problem. The general purpose Microsoft Visual C++ is used to developed algorithm for finding the best solution. The proposed hybrid approach able to generate best schedule in 7th and optimal in 170th iteration with tardiness 8 and 7 hours respectively.

  1. Heuristic Medicine: The Methodists and Metalepsis.

    PubMed

    Webster, Colin

    2015-09-01

    In the first century B.C.E., a group of Greek physicians called the Methodists denied that medicine could be based on such "hidden causes" as humors, atoms, or elements. They argued that the inner workings of the body were ultimately unknowable, existing beyond the limits of human knowledge and inference. Yet they insisted that medical certainty was still possible, claiming that every disease shared one of three directly apprehensible "manifest commonalities"--stricture, laxity, or some mixture of the two. Medicine could therefore be a science; it was simply noncausal in structure. This essay examines these medical theories in light of Herbert Simon's concept of "bounded rationality," suggesting that the Methodists were proposing a type of medical "heuristic" in response to the limitations of human knowledge and processing power. At the same time, the essay suggests that such an epistemology had its consequences, setting up an ontological crunch whereby the demands formerly placed on diseases and their causes transferred to "affections" and the commonalities, with successive generations of Methodists disagreeing about the status of symptoms, signs, and diseased states. Borrowing vocabulary from the Methodists themselves, the essay calls the consequent ontological slippage between causes and effects "metalepsis".

  2. Neural Basis of Scientific Innovation Induced by Heuristic Prototype

    PubMed Central

    Qiu, Jiang; Wei, Dongtao; Liu, Yijun; Zhang, Qinlin

    2013-01-01

    A number of major inventions in history have been based on bionic imitation. Heuristics, by applying biological systems to the creation of artificial devices and machines, might be one of the most critical processes in scientific innovation. In particular, prototype heuristics propositions that innovation may engage automatic activation of a prototype such as a biological system to form novel associations between a prototype's function and problem-solving. We speculated that the cortical dissociation between the automatic activation and forming novel associations in innovation is critical point to heuristic creativity. In the present study, novel and old scientific innovations (NSI and OSI) were selected as experimental materials in using learning-testing paradigm to explore the neural basis of scientific innovation induced by heuristic prototype. College students were required to resolve NSI problems (to which they did not know the answers) and OSI problems (to which they knew the answers). From two fMRI experiments, our results showed that the subjects could resolve NSI when provided with heuristic prototypes. In Experiment 1, it was found that the lingual gyrus (LG; BA18) might be related to prototype heuristics in college students resolving NSI after learning a relative prototype. In Experiment 2, the LG (BA18) and precuneus (BA31) were significantly activated for NSI compared to OSI when college students learned all prototypes one day before the test. In addition, the mean beta-values of these brain regions of NSI were all correlated with the behavior accuracy of NSI. As our hypothesis indicated, the findings suggested that the LG might be involved in forming novel associations using heuristic information, while the precuneus might be involved in the automatic activation of heuristic prototype during scientific innovation. PMID:23372641

  3. Climate adaptation heuristics and the science/policy divide

    SciTech Connect

    Preston, Benjamin L.; Mustelin, Johanna; Maloney, Megan C.

    2013-09-05

    The adaptation science enterprise has expanded rapidly in recent years, presumably in response to growth in demand for knowledge that can facilitate adaptation policy and practice. However, evidence suggests such investments in adaptation science have not necessarily translated into adaptation implementation. One potential constraint on adaptation may be the underlying heuristics that are used as the foundation for both adaptation research and practice. In this paper, we explore the adaptation academic literature with the objective of identifying adaptation heuristics, assessing the extent to which they have become entrenched within the adaptation discourse, and discussing potential weaknesses in their framing that could undermine adaptation efforts. This investigation is supported by a multi-method analysis that includes both a quantitative content analysis of the adaptation literature that evidences the use of adaptation heuristics and a qualitative analysis of the implications of such heuristics for enhancing or hindering the implementation of adaptation. Results demonstrate that a number of heuristic devices are commonly used in both the peer-reviewed adaptation literature as well as within grey literature designed to inform adaptation practitioners. Furthermore, the apparent lack of critical reflection upon the robustness of these heuristics for diverse contexts may contribute to potential cognitive bias with respect to the framing of adaptation by both researchers and practitioners. Finally, we discuss this phenomenon by drawing upon heuristic-analytic theory, which has explanatory utility in understanding both the origins of such heuristics as well as the measures that can be pursued toward the co-generation of more robust approaches to adaptation problem-solving.

  4. Climate adaptation heuristics and the science/policy divide

    DOE PAGES

    Preston, Benjamin L.; Mustelin, Johanna; Maloney, Megan C.

    2013-09-05

    The adaptation science enterprise has expanded rapidly in recent years, presumably in response to growth in demand for knowledge that can facilitate adaptation policy and practice. However, evidence suggests such investments in adaptation science have not necessarily translated into adaptation implementation. One potential constraint on adaptation may be the underlying heuristics that are used as the foundation for both adaptation research and practice. In this paper, we explore the adaptation academic literature with the objective of identifying adaptation heuristics, assessing the extent to which they have become entrenched within the adaptation discourse, and discussing potential weaknesses in their framing thatmore » could undermine adaptation efforts. This investigation is supported by a multi-method analysis that includes both a quantitative content analysis of the adaptation literature that evidences the use of adaptation heuristics and a qualitative analysis of the implications of such heuristics for enhancing or hindering the implementation of adaptation. Results demonstrate that a number of heuristic devices are commonly used in both the peer-reviewed adaptation literature as well as within grey literature designed to inform adaptation practitioners. Furthermore, the apparent lack of critical reflection upon the robustness of these heuristics for diverse contexts may contribute to potential cognitive bias with respect to the framing of adaptation by both researchers and practitioners. Finally, we discuss this phenomenon by drawing upon heuristic-analytic theory, which has explanatory utility in understanding both the origins of such heuristics as well as the measures that can be pursued toward the co-generation of more robust approaches to adaptation problem-solving.« less

  5. Neural basis of scientific innovation induced by heuristic prototype.

    PubMed

    Luo, Junlong; Li, Wenfu; Qiu, Jiang; Wei, Dongtao; Liu, Yijun; Zhang, Qinlin

    2013-01-01

    A number of major inventions in history have been based on bionic imitation. Heuristics, by applying biological systems to the creation of artificial devices and machines, might be one of the most critical processes in scientific innovation. In particular, prototype heuristics propositions that innovation may engage automatic activation of a prototype such as a biological system to form novel associations between a prototype's function and problem-solving. We speculated that the cortical dissociation between the automatic activation and forming novel associations in innovation is critical point to heuristic creativity. In the present study, novel and old scientific innovations (NSI and OSI) were selected as experimental materials in using learning-testing paradigm to explore the neural basis of scientific innovation induced by heuristic prototype. College students were required to resolve NSI problems (to which they did not know the answers) and OSI problems (to which they knew the answers). From two fMRI experiments, our results showed that the subjects could resolve NSI when provided with heuristic prototypes. In Experiment 1, it was found that the lingual gyrus (LG; BA18) might be related to prototype heuristics in college students resolving NSI after learning a relative prototype. In Experiment 2, the LG (BA18) and precuneus (BA31) were significantly activated for NSI compared to OSI when college students learned all prototypes one day before the test. In addition, the mean beta-values of these brain regions of NSI were all correlated with the behavior accuracy of NSI. As our hypothesis indicated, the findings suggested that the LG might be involved in forming novel associations using heuristic information, while the precuneus might be involved in the automatic activation of heuristic prototype during scientific innovation.

  6. Generating effective project scheduling heuristics by abstraction and reconstitution

    NASA Technical Reports Server (NTRS)

    Janakiraman, Bhaskar; Prieditis, Armand

    1992-01-01

    A project scheduling problem consists of a finite set of jobs, each with fixed integer duration, requiring one or more resources such as personnel or equipment, and each subject to a set of precedence relations, which specify allowable job orderings, and a set of mutual exclusion relations, which specify jobs that cannot overlap. No job can be interrupted once started. The objective is to minimize project duration. This objective arises in nearly every large construction project--from software to hardware to buildings. Because such project scheduling problems are NP-hard, they are typically solved by branch-and-bound algorithms. In these algorithms, lower-bound duration estimates (admissible heuristics) are used to improve efficiency. One way to obtain an admissible heuristic is to remove (abstract) all resources and mutual exclusion constraints and then obtain the minimal project duration for the abstracted problem; this minimal duration is the admissible heuristic. Although such abstracted problems can be solved efficiently, they yield inaccurate admissible heuristics precisely because those constraints that are central to solving the original problem are abstracted. This paper describes a method to reconstitute the abstracted constraints back into the solution to the abstracted problem while maintaining efficiency, thereby generating better admissible heuristics. Our results suggest that reconstitution can make good admissible heuristics even better.

  7. An interdisciplinary heuristic evaluation method for universal building design.

    PubMed

    Afacan, Yasemin; Erbug, Cigdem

    2009-07-01

    This study highlights how heuristic evaluation as a usability evaluation method can feed into current building design practice to conform to universal design principles. It provides a definition of universal usability that is applicable to an architectural design context. It takes the seven universal design principles as a set of heuristics and applies an iterative sequence of heuristic evaluation in a shopping mall, aiming to achieve a cost-effective evaluation process. The evaluation was composed of three consecutive sessions. First, five evaluators from different professions were interviewed regarding the construction drawings in terms of universal design principles. Then, each evaluator was asked to perform the predefined task scenarios. In subsequent interviews, the evaluators were asked to re-analyze the construction drawings. The results showed that heuristic evaluation could successfully integrate universal usability into current building design practice in two ways: (i) it promoted an iterative evaluation process combined with multi-sessions rather than relying on one evaluator and on one evaluation session to find the maximum number of usability problems, and (ii) it highlighted the necessity of an interdisciplinary ad hoc committee regarding the heuristic abilities of each profession. A multi-session and interdisciplinary heuristic evaluation method can save both the project budget and the required time, while ensuring a reduced error rate for the universal usage of the built environments.

  8. Domain-Independent Heuristics for Goal Formulation

    DTIC Science & Technology

    2013-05-01

    While this increases autonomy, it employs a domain- dependent reward function; indirectly, LGDA’s goal selection strategy is guided by a human. MADBot...autonomy for responding to unexpected events in strategy simulations. To appear in Computational Intelligence. Molineaux, M., Klenk, M., & Aha, D.W...2010a). Goal-driven autonomy in a Navy strategy simulation. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence. Atlanta

  9. Heuristic optimization of the scanning path of particle therapy beams.

    PubMed

    Pardo, J; Donetti, M; Bourhaleb, F; Ansarinejad, A; Attili, A; Cirio, R; Garella, M A; Giordanengo, S; Givehchi, N; La Rosa, A; Marchetto, F; Monaco, V; Pecka, A; Peroni, C; Russo, G; Sacchi, R

    2009-06-01

    Quasidiscrete scanning is a delivery strategy for proton and ion beam therapy in which the beam is turned off when a slice is finished and a new energy must be set but not during the scanning between consecutive spots. Different scanning paths lead to different dose distributions due to the contribution of the unintended transit dose between spots. In this work an algorithm to optimize the scanning path for quasidiscrete scanned beams is presented. The classical simulated annealing algorithm is used. It is a heuristic algorithm frequently used in combinatorial optimization problems, which allows us to obtain nearly optimal solutions in acceptable running times. A study focused on the best choice of operational parameters on which the algorithm performance depends is presented. The convergence properties of the algorithm have been further improved by using the next-neighbor algorithm to generate the starting paths. Scanning paths for two clinical treatments have been optimized. The optimized paths are found to be shorter than the back-and-forth, top-to-bottom (zigzag) paths generally provided by the treatment planning systems. The gamma method has been applied to quantify the improvement achieved on the dose distribution. Results show a reduction of the transit dose when the optimized paths are used. The benefit is clear especially when the fluence per spot is low, as in the case of repainting. The minimization of the transit dose can potentially allow the use of higher beam intensities, thus decreasing the treatment time. The algorithm implemented for this work can optimize efficiently the scanning path of quasidiscrete scanned particle beams. Optimized scanning paths decrease the transit dose and lead to better dose distributions.

  10. Memory-Based Simple Heuristics as Attribute Substitution: Competitive Tests of Binary Choice Inference Models.

    PubMed

    Honda, Hidehito; Matsuka, Toshihiko; Ueda, Kazuhiro

    2016-07-20

    Some researchers on binary choice inference have argued that people make inferences based on simple heuristics, such as recognition, fluency, or familiarity. Others have argued that people make inferences based on available knowledge. To examine the boundary between heuristic and knowledge usage, we examine binary choice inference processes in terms of attribute substitution in heuristic use (Kahneman & Frederick, 2005). In this framework, it is predicted that people will rely on heuristic or knowledge-based inference depending on the subjective difficulty of the inference task. We conducted competitive tests of binary choice inference models representing simple heuristics (fluency and familiarity heuristics) and knowledge-based inference models. We found that a simple heuristic model (especially a familiarity heuristic model) explained inference patterns for subjectively difficult inference tasks, and that a knowledge-based inference model explained subjectively easy inference tasks. These results were consistent with the predictions of the attribute substitution framework. Issues on usage of simple heuristics and psychological processes are discussed.

  11. Brain mechanisms of valuable scientific problem finding inspired by heuristic knowledge.

    PubMed

    Dandan, Tong; Wenfu, Li; Tianen, Dai; Nusbaum, Howard C; Jiang, Qiu; Qinglin, Zhang

    2013-08-01

    Heuristics through the application of heuristic knowledge to the creation of imitation devices may be one of the most common processes in scientific innovation. In particular, heuristics suggests that innovation includes the automatic activation of heuristic knowledge and formation of novel associations between heuristic knowledge and problem situations. In this study, 76 scientific innovation problem situations were selected as materials. Among these, 36 contain related heuristic knowledge and 40 have no such information. Through functional magnetic resonance imaging, the learning-testing paradigm was used to explore the brain mechanisms of scientific problem finding inspired by heuristic knowledge. Participants were asked to find a problem on the basis of a given innovation problem situation. Two scenarios were presented: finding scientific problems with related heuristic knowledge and finding conventional problems without related heuristic knowledge. The authors assumed that the regions in the brain significantly activated by the finding scientific problems with related heuristic knowledge condition compared with the finding normal problems without related heuristic knowledge condition are relevant to the brain mechanisms of scientific problem finding inspired by heuristic knowledge. The first scenario more significantly activated the left precuneus and left angular gyrus than did the second scenario. These findings suggest that the precuneus is relevant to the successful storage and retrieval of heuristic knowledge and that the left angular gyrus is involved in the formation of novel associations between heuristic knowledge and problem situations for finding scientific problems.

  12. Meta-heuristic algorithms as tools for hydrological science

    NASA Astrophysics Data System (ADS)

    Yoo, Do Guen; Kim, Joong Hoon

    2014-12-01

    In this paper, meta-heuristic optimization techniques are introduced and their applications to water resources engineering, particularly in hydrological science are introduced. In recent years, meta-heuristic optimization techniques have been introduced that can overcome the problems inherent in iterative simulations. These methods are able to find good solutions and require limited computation time and memory use without requiring complex derivatives. Simulation-based meta-heuristic methods such as Genetic algorithms (GAs) and Harmony Search (HS) have powerful searching abilities, which can occasionally overcome the several drawbacks of traditional mathematical methods. For example, HS algorithms can be conceptualized from a musical performance process and used to achieve better harmony; such optimization algorithms seek a near global optimum determined by the value of an objective function, providing a more robust determination of musical performance than can be achieved through typical aesthetic estimation. In this paper, meta-heuristic algorithms and their applications (focus on GAs and HS) in hydrological science are discussed by subject, including a review of existing literature in the field. Then, recent trends in optimization are presented and a relatively new technique such as Smallest Small World Cellular Harmony Search (SSWCHS) is briefly introduced, with a summary of promising results obtained in previous studies. As a result, previous studies have demonstrated that meta-heuristic algorithms are effective tools for the development of hydrological models and the management of water resources.

  13. Multicriteria meta-heuristics for AGV dispatching control based on computational intelligence.

    PubMed

    Naso, David; Turchiano, Biagio

    2005-04-01

    In many manufacturing environments, automated guided vehicles are used to move the processed materials between various pickup and delivery points. The assignment of vehicles to unit loads is a complex problem that is often solved in real-time with simple dispatching rules. This paper proposes an automated guided vehicles dispatching approach based on computational intelligence. We adopt a fuzzy multicriteria decision strategy to simultaneously take into account multiple aspects in every dispatching decision. Since the typical short-term view of dispatching rules is one of the main limitations of such real-time assignment heuristics, we also incorporate in the multicriteria algorithm a specific heuristic rule that takes into account the empty-vehicle travel on a longer time-horizon. Moreover, we also adopt a genetic algorithm to tune the weights associated to each decision criteria in the global decision algorithm. The proposed approach is validated by means of a comparison with other dispatching rules, and with other recently proposed multicriteria dispatching strategies also based on computational Intelligence. The analysis of the results obtained by the proposed dispatching approach in both nominal and perturbed operating conditions (congestions, faults) confirms its effectiveness.

  14. Discovery and problem solving: Triangulation as a weak heuristic

    NASA Technical Reports Server (NTRS)

    Rochowiak, Daniel

    1987-01-01

    Recently the artificial intelligence community has turned its attention to the process of discovery and found that the history of science is a fertile source for what Darden has called compiled hindsight. Such hindsight generates weak heuristics for discovery that do not guarantee that discoveries will be made but do have proven worth in leading to discoveries. Triangulation is one such heuristic that is grounded in historical hindsight. This heuristic is explored within the general framework of the BACON, GLAUBER, STAHL, DALTON, and SUTTON programs. In triangulation different bases of information are compared in an effort to identify gaps between the bases. Thus, assuming that the bases of information are relevantly related, the gaps that are identified should be good locations for discovery and robust analysis.

  15. Plan-graph Based Heuristics for Conformant Probabilistic Planning

    NASA Technical Reports Server (NTRS)

    Ramakrishnan, Salesh; Pollack, Martha E.; Smith, David E.

    2004-01-01

    In this paper, we introduce plan-graph based heuristics to solve a variation of the conformant probabilistic planning (CPP) problem. In many real-world problems, it is the case that the sensors are unreliable or take too many resources to provide knowledge about the environment. These domains are better modeled as conformant planning problems. POMDP based techniques are currently the most successful approach for solving CPP but have the limitation of state- space explosion. Recent advances in deterministic and conformant planning have shown that plan-graphs can be used to enhance the performance significantly. We show that this enhancement can also be translated to CPP. We describe our process for developing the plan-graph heuristics and estimating the probability of a partial plan. We compare the performance of our planner PVHPOP when used with different heuristics. We also perform a comparison with a POMDP solver to show over a order of magnitude improvement in performance.

  16. A Comparison of Genetic Programming Variants for Hyper-Heuristics

    SciTech Connect

    Harris, Sean

    2015-03-01

    Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved, such as routing vehicles over highways with constantly changing traffic flows, because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. Hyper-heuristics typically employ Genetic Programming (GP) and this project has investigated the relationship between the choice of GP and performance in Hyper-heuristics. Results are presented demonstrating the existence of problems for which there is a statistically significant performance differential between the use of different types of GP.

  17. The min-conflicts heuristic: Experimental and theoretical results

    NASA Technical Reports Server (NTRS)

    Minton, Steven; Philips, Andrew B.; Johnston, Mark D.; Laird, Philip

    1991-01-01

    This paper describes a simple heuristic method for solving large-scale constraint satisfaction and scheduling problems. Given an initial assignment for the variables in a problem, the method operates by searching through the space of possible repairs. The search is guided by an ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. We demonstrate empirically that the method performs orders of magnitude better than traditional backtracking techniques on certain standard problems. For example, the one million queens problem can be solved rapidly using our approach. We also describe practical scheduling applications where the method has been successfully applied. A theoretical analysis is presented to explain why the method works so well on certain types of problems and to predict when it is likely to be most effective.

  18. Reasoning by analogy as an aid to heuristic theorem proving.

    NASA Technical Reports Server (NTRS)

    Kling, R. E.

    1972-01-01

    When heuristic problem-solving programs are faced with large data bases that contain numbers of facts far in excess of those needed to solve any particular problem, their performance rapidly deteriorates. In this paper, the correspondence between a new unsolved problem and a previously solved analogous problem is computed and invoked to tailor large data bases to manageable sizes. This paper outlines the design of an algorithm for generating and exploiting analogies between theorems posed to a resolution-logic system. These algorithms are believed to be the first computationally feasible development of reasoning by analogy to be applied to heuristic theorem proving.

  19. Heuristic scenario builder for power system operator training

    SciTech Connect

    Irisarri, G.; Rafian, M. ); Miller, B.N. ); Dobrowolski, E.J. )

    1992-05-01

    The Heuristic Scenario Builder (HSB), a knowledge-based training scenario builder for the EPRI Operator Training Simulator (OTS), is described in this paper. Expert systems and heuristic searches are used in the HSB to find training scenarios that closely fit trainee profiles and that address particular training requirements. Expert knowledge obtained from instructors and other operations personnel is used throughout the HSB to determine the scenarios. The HSB is an integral part of the OTS and is currently in operation at Philadelphia Electric's OTS installation.

  20. Automated unit-level testing with heuristic rules

    NASA Technical Reports Server (NTRS)

    Carlisle, W. Homer; Chang, Kai-Hsiung; Cross, James H.; Keleher, William; Shackelford, Keith

    1990-01-01

    Software testing plays a significant role in the development of complex software systems. Current testing methods generally require significant effort to generate meaningful test cases. The QUEST/Ada system is a prototype system designed using CLIPS to experiment with expert system based test case generation. The prototype is designed to test for condition coverage, and attempts to generate test cases to cover all feasible branches contained in an Ada program. This paper reports on heuristics sued by the system. These heuristics vary according to the amount of knowledge obtained by preprocessing and execution of the boolean conditions in the program.

  1. Petri nets SM-cover-based on heuristic coloring algorithm

    NASA Astrophysics Data System (ADS)

    Tkacz, Jacek; Doligalski, Michał

    2015-09-01

    In the paper, coloring heuristic algorithm of interpreted Petri nets is presented. Coloring is used to determine the State Machines (SM) subnets. The present algorithm reduces the Petri net in order to reduce the computational complexity and finds one of its possible State Machines cover. The proposed algorithm uses elements of interpretation of Petri nets. The obtained result may not be the best, but it is sufficient for use in rapid prototyping of logic controllers. Found SM-cover will be also used in the development of algorithms for decomposition, and modular synthesis and implementation of parallel logic controllers. Correctness developed heuristic algorithm was verified using Gentzen formal reasoning system.

  2. Philosophic Heuristic Instruction (PHI)--II.

    ERIC Educational Resources Information Center

    Coole, Walter A.

    This publication contains a course outline and syllabus, self-study units, and testing materials finished and tested in the Open Classroom, an auto-tutorial learning laboratory at Skagit Valley College (Washington). This self-contained course in informal logic is organized around problem-solving strategy and a collection of modules for extensive…

  3. Fabrication, characterization, and heuristic trade space exploration of magnetically actuated Miura-Ori origami structures

    NASA Astrophysics Data System (ADS)

    Cowan, Brett; von Lockette, Paris R.

    2017-04-01

    The authors develop magnetically actuated Miura-Ori structures through observation, experiment, and computation using an initially heuristic strategy followed by trade space visualization and optimization. The work is novel, especially within origami engineering, in that beyond final target shape approximation, Miura-Ori structures in this work are additionally evaluated for the shape approximation while folding and for their efficient use of their embedded actuators. The structures consisted of neodymium magnets placed on the panels of silicone elastomer substrates cast in the Miura-Ori folding pattern. Initially four configurations, arrangements of magnets on the panels, were selected based on heuristic arguments that (1) maximized the amount of magnetic torque applied to the creases and (2) reduced the number of magnets needed to affect all creases in the pattern. The results of experimental and computational performance metrics were used in a weighted sum model to predict the optimum configuration, which was then fabricated and experimentally characterized for comparison to the initial prototypes. As expected, optimization of magnet placement and orientation was effective at increasing the degree of theoretical useful work. Somewhat unexpectedly, however, trade space results showed that even after optimization, the configuration with the most number of magnets was least effective, per magnet, at directing its actuation to the structure’s creases. Overall, though the winning configuration experimentally outperformed its initial, non-optimal counterparts, results showed that the choice of optimum configuration was heavily dependent on the weighting factors. These results highlight both the ability of the Miura-Ori to be actuated with external magnetic stimuli, the effectiveness of a heuristic design approach that focuses on the actuation mechanism, and the need to address path-dependent metrics in assessing performance in origami folding structures.

  4. Heuristics for Relevancy Ranking of Earth Dataset Search Results

    NASA Technical Reports Server (NTRS)

    Lynnes, Christopher; Quinn, Patrick; Norton, James

    2016-01-01

    As the Variety of Earth science datasets increases, science researchers find it more challenging to discover and select the datasets that best fit their needs. The most common way of search providers to address this problem is to rank the datasets returned for a query by their likely relevance to the user. Large web page search engines typically use text matching supplemented with reverse link counts, semantic annotations and user intent modeling. However, this produces uneven results when applied to dataset metadata records simply externalized as a web page. Fortunately, data and search provides have decades of experience in serving data user communities, allowing them to form heuristics that leverage the structure in the metadata together with knowledge about the user community. Some of these heuristics include specific ways of matching the user input to the essential measurements in the dataset and determining overlaps of time range and spatial areas. Heuristics based on the novelty of the datasets can prioritize later, better versions of data over similar predecessors. And knowledge of how different user types and communities use data can be brought to bear in cases where characteristics of the user (discipline, expertise) or their intent (applications, research) can be divined. The Earth Observing System Data and Information System has begun implementing some of these heuristics in the relevancy algorithm of its Common Metadata Repository search engine.

  5. A lifelong learning hyper-heuristic method for bin packing.

    PubMed

    Sim, Kevin; Hart, Emma; Paechter, Ben

    2015-01-01

    We describe a novel hyper-heuristic system that continuously learns over time to solve a combinatorial optimisation problem. The system continuously generates new heuristics and samples problems from its environment; and representative problems and heuristics are incorporated into a self-sustaining network of interacting entities inspired by methods in artificial immune systems. The network is plastic in both its structure and content, leading to the following properties: it exploits existing knowledge captured in the network to rapidly produce solutions; it can adapt to new problems with widely differing characteristics; and it is capable of generalising over the problem space. The system is tested on a large corpus of 3,968 new instances of 1D bin-packing problems as well as on 1,370 existing problems from the literature; it shows excellent performance in terms of the quality of solutions obtained across the datasets and in adapting to dynamically changing sets of problem instances compared to previous approaches. As the network self-adapts to sustain a minimal repertoire of both problems and heuristics that form a representative map of the problem space, the system is further shown to be computationally efficient and therefore scalable.

  6. Heuristic Model Of The Composite Quality Index Of Environmental Assessment

    NASA Astrophysics Data System (ADS)

    Khabarov, A. N.; Knyaginin, A. A.; Bondarenko, D. V.; Shepet, I. P.; Korolkova, L. N.

    2017-01-01

    The goal of the paper is to present the heuristic model of the composite environmental quality index based on the integrated application of the elements of utility theory, multidimensional scaling, expert evaluation and decision-making. The composite index is synthesized in linear-quadratic form, it provides higher adequacy of the results of the assessment preferences of experts and decision-makers.

  7. Heuristics guide cooperative behaviors in public goods game

    NASA Astrophysics Data System (ADS)

    Wang, Yongjie; Chen, Tong

    2015-12-01

    In public goods game (PGG), player's cooperative behavior is not pure economical rationality, but social preference and prosocial intuition play extremely important roles as well. Social preference and prosocial intuition can be guided by heuristics from one's neighbors in daily life. To better investigate the impacts of heuristics on the evolution of cooperation, four types of agents are introduced into our spatial PGG. Through numerical simulations, results show that the larger percentages of cooperators with independent thought, the easier emergence and maintenance of collective cooperative behaviors. Additionally, we find that differentia heuristic capability has great effect on the equilibrium of PGG. Cooperation can be obviously promoted, when heuristic capability of cooperators with independent thought is stronger than that of defectors with independent thought. Finally, we observe that cooperators with independent thought and defectors with independent thought are favorable for the formation of some high quality clusters, which can resist the invasion between each other. Our work may help us understand more clearly the mechanism of cooperation in real world.

  8. Prototypes Are Key Heuristic Information in Insight Problem Solving

    ERIC Educational Resources Information Center

    Yang, Wenjing; Dietrich, Arne; Liu, Peiduo; Ming, Dan; Jin, Yule; Nusbaum, Howard C.; Qiu, Jiang; Zhang, Qinglin

    2016-01-01

    Evidence from a range of fields indicates that inventions are often inspired by drawing a parallel to solutions found in nature. However, the cognitive mechanism of this process is not well understood. The cognitive mechanism of heuristic prototype in scientific innovation was tested with 3 experiments. First, 84 historical accounts of important…

  9. Heuristic Evaluation on Mobile Interfaces: A New Checklist

    PubMed Central

    Yáñez Gómez, Rosa; Cascado Caballero, Daniel; Sevillano, José-Luis

    2014-01-01

    The rapid evolution and adoption of mobile devices raise new usability challenges, given their limitations (in screen size, battery life, etc.) as well as the specific requirements of this new interaction. Traditional evaluation techniques need to be adapted in order for these requirements to be met. Heuristic evaluation (HE), an Inspection Method based on evaluation conducted by experts over a real system or prototype, is based on checklists which are desktop-centred and do not adequately detect mobile-specific usability issues. In this paper, we propose a compilation of heuristic evaluation checklists taken from the existing bibliography but readapted to new mobile interfaces. Selecting and rearranging these heuristic guidelines offer a tool which works well not just for evaluation but also as a best-practices checklist. The result is a comprehensive checklist which is experimentally evaluated as a design tool. This experimental evaluation involved two software engineers without any specific knowledge about usability, a group of ten users who compared the usability of a first prototype designed without our heuristics, and a second one after applying the proposed checklist. The results of this experiment show the usefulness of the proposed checklist for avoiding usability gaps even with nontrained developers. PMID:25295300

  10. The Priority Heuristic: Making Choices without Trade-Offs

    ERIC Educational Resources Information Center

    Brandstatter, Eduard; Gigerenzer, Gerd; Hertwig, Ralph

    2006-01-01

    Bernoulli's framework of expected utility serves as a model for various psychological processes, including motivation, moral sense, attitudes, and decision making. To account for evidence at variance with expected utility, the authors generalize the framework of fast and frugal heuristics from inferences to preferences. The priority heuristic…

  11. Heuristic and Linear Models of Judgment: Matching Rules and Environments

    ERIC Educational Resources Information Center

    Hogarth, Robin M.; Karelaia, Natalia

    2007-01-01

    Much research has highlighted incoherent implications of judgmental heuristics, yet other findings have demonstrated high correspondence between predictions and outcomes. At the same time, judgment has been well modeled in the form of as if linear models. Accepting the probabilistic nature of the environment, the authors use statistical tools to…

  12. Heuristics and NCLB Standardized Tests: A Convenient Lie

    ERIC Educational Resources Information Center

    Dodge, Arnold

    2009-01-01

    The No Child Left Behind Act of 2001 requires public schools in the United States to test students in grades 3-8. The author argues that this mandate has been supported by the public, in part, because of the "availability heuristic," a phenomenon which occurs when people assess the probability of an event by the ease with which instances…

  13. Heuristic evaluation on mobile interfaces: a new checklist.

    PubMed

    Yáñez Gómez, Rosa; Cascado Caballero, Daniel; Sevillano, José-Luis

    2014-01-01

    The rapid evolution and adoption of mobile devices raise new usability challenges, given their limitations (in screen size, battery life, etc.) as well as the specific requirements of this new interaction. Traditional evaluation techniques need to be adapted in order for these requirements to be met. Heuristic evaluation (HE), an Inspection Method based on evaluation conducted by experts over a real system or prototype, is based on checklists which are desktop-centred and do not adequately detect mobile-specific usability issues. In this paper, we propose a compilation of heuristic evaluation checklists taken from the existing bibliography but readapted to new mobile interfaces. Selecting and rearranging these heuristic guidelines offer a tool which works well not just for evaluation but also as a best-practices checklist. The result is a comprehensive checklist which is experimentally evaluated as a design tool. This experimental evaluation involved two software engineers without any specific knowledge about usability, a group of ten users who compared the usability of a first prototype designed without our heuristics, and a second one after applying the proposed checklist. The results of this experiment show the usefulness of the proposed checklist for avoiding usability gaps even with nontrained developers.

  14. Use of the Competing-Hypotheses Heuristic to Reduce "Pseudodiagnosticity."

    ERIC Educational Resources Information Center

    Wolf, Fredric M. And Others

    1988-01-01

    The efficacy of an educational intervention in teaching medical students to select optimal diagnostic data consistent with the competing-hypotheses heuristic and Bayes' theorem when solving clinical problems was examined. The results suggest that some problem-solving skills can be enhanced or learned independent of the acquisition of content…

  15. Animal, Vegetable, Mineral: A Method for Introducing Heuristics.

    ERIC Educational Resources Information Center

    Rivers, Thomas M.

    Students beginning a freshman composition class tend to regard writing as an editing process rather than as a process which encompasses intelligence, character, and humanity. Helping students understand and master heuristic procedures on the way to developing composition skills can be facilitated by the use of the game Twenty Questions to learn…

  16. A Heuristic for Disassembly Planning in Remanufacturing System

    PubMed Central

    2014-01-01

    This study aims to improve the efficiency of disassembly planning in remanufacturing environment. Even though disassembly processes are considered as the reverse of the corresponding assembly processes, under some technological and management constraints the feasible and efficient disassembly planning can be achieved by only well-designed algorithms. In this paper, we propose a heuristic for disassembly planning with the existence of disassembled part/subassembly demands. A mathematical model is formulated for solving this problem to determine the sequence and quantity of disassembly operations to minimize the disassembly costs under sequence-dependent setup and capacity constraints. The disassembly costs consist of the setup cost, part inventory holding cost, disassembly processing cost, and purchasing cost that resulted from unsatisfied demand. A simple but efficient heuristic algorithm is proposed to improve the quality of solution and computational efficiency. The main idea of heuristic is to divide the planning horizon into the smaller planning windows and improve the computational efficiency without much loss of solution quality. Performances of the heuristic are investigated through the computational experiments. PMID:24895679

  17. How cognitive heuristics can explain social interactions in spatial movement.

    PubMed

    Seitz, Michael J; Bode, Nikolai W F; Köster, Gerta

    2016-08-01

    The movement of pedestrian crowds is a paradigmatic example of collective motion. The precise nature of individual-level behaviours underlying crowd movements has been subject to a lively debate. Here, we propose that pedestrians follow simple heuristics rooted in cognitive psychology, such as 'stop if another step would lead to a collision' or 'follow the person in front'. In other words, our paradigm explicitly models individual-level behaviour as a series of discrete decisions. We show that our cognitive heuristics produce realistic emergent crowd phenomena, such as lane formation and queuing behaviour. Based on our results, we suggest that pedestrians follow different cognitive heuristics that are selected depending on the context. This differs from the widely used approach of capturing changes in behaviour via model parameters and leads to testable hypotheses on changes in crowd behaviour for different motivation levels. For example, we expect that rushed individuals more often evade to the side and thus display distinct emergent queue formations in front of a bottleneck. Our heuristics can be ranked according to the cognitive effort that is required to follow them. Therefore, our model establishes a direct link between behavioural responses and cognitive effort and thus facilitates a novel perspective on collective behaviour.

  18. The Electrophysiological Correlates of Scientific Innovation Induced by Heuristic Information

    ERIC Educational Resources Information Center

    Luo, Junlong; Du, Xiumin; Tang, Xiaochen; Zhang, Entao; Li, Haijiang; Zhang, Qinglin

    2013-01-01

    In this study, novel and old scientific innovations (NSI and OSI) were selected as materials to explore the electrophysiological correlates of scientific innovation induced by heuristic information. Using event-related brain potentials (ERPs) to do so, college students solved NSI problems (for which they did not know the answers) and OSI problems…

  19. Development of Heuristic Bias Detection in Elementary School

    ERIC Educational Resources Information Center

    De Neys, Wim; Feremans, Vicky

    2013-01-01

    Although human reasoning is often biased by intuitive heuristics, recent studies have shown that adults and adolescents detect the biased nature of their judgments. The present study focused on the development of this critical bias sensitivity by examining the detection skills of young children in elementary school. Third and 6th graders were…

  20. Heuristics Applied in the Development of Advanced Space Mission Concepts

    NASA Technical Reports Server (NTRS)

    Nilsen, Erik N.

    1998-01-01

    Advanced mission studies are the first step in determining the feasibility of a given space exploration concept. A space scientist develops a science goal in the exploration of space. This may be a new observation method, a new instrument or a mission concept to explore a solar system body. In order to determine the feasibility of a deep space mission, a concept study is convened to determine the technology needs and estimated cost of performing that mission. Heuristics are one method of defining viable mission and systems architectures that can be assessed for technology readiness and cost. Developing a viable architecture depends to a large extent upon extending the existing body of knowledge, and applying it in new and novel ways. These heuristics have evolved over time to include methods for estimating technical complexity, technology development, cost modeling and mission risk in the unique context of deep space missions. This paper examines the processes involved in performing these advanced concepts studies, and analyzes the application of heuristics in the development of an advanced in-situ planetary mission. The Venus Surface Sample Return mission study provides a context for the examination of the heuristics applied in the development of the mission and systems architecture. This study is illustrative of the effort involved in the initial assessment of an advance mission concept, and the knowledge and tools that are applied.

  1. Resolution of seven-axis manipulator redundancy: A heuristic issue

    NASA Technical Reports Server (NTRS)

    Chen, I.

    1990-01-01

    An approach is presented for the resolution of the redundancy of a seven-axis manipulator arm from the AI and expert systems point of view. This approach is heuristic, analytical, and globally resolves the redundancy at the position level. When compared with other approaches, this approach has several improved performance capabilities, including singularity avoidance, repeatability, stability, and simplicity.

  2. Making Predictions about Chemical Reactivity: Assumptions and Heuristics

    ERIC Educational Resources Information Center

    Maeyer, Jenine; Talanquer, Vicente

    2013-01-01

    Diverse implicit cognitive elements seem to support but also constrain reasoning in different domains. Many of these cognitive constraints can be thought of as either implicit assumptions about the nature of things or reasoning heuristics for decision-making. In this study we applied this framework to investigate college students' understanding of…

  3. Best-First Heuristic Search for Multicore Machines

    DTIC Science & Technology

    2010-01-01

    w factor of the optimal solution cost) (Davis, Bramanti -Gregor, & Wang, 1988). It is possible to modify AHDA*, BFPSDD, and PBNF to use weights to... Bramanti -Gregor, A., & Wang, J. (1988). The advantages of using depth and breadth components in heuristic search. In Methodologies for Intelligent Systems 3

  4. Implementing the Science Writing Heuristic in the Chemistry Laboratory

    ERIC Educational Resources Information Center

    Burke, K. A.; Greenbowe, Thomas J.; Hand, Brian M.

    2006-01-01

    The Science Writing Heuristic (SWH) is an instructional technique that combines inquiry, collaborative learning, and writing to change the nature of the chemistry laboratory for students and instructors. The SWH provides a format for students to guide their discussions, their thinking, and writing about how science activities relate to their own…

  5. Divergence of Scientific Heuristic Method and Direct Algebraic Instruction

    ERIC Educational Resources Information Center

    Calucag, Lina S.

    2016-01-01

    This is an experimental study, made used of the non-randomized experimental and control groups, pretest-posttest designs. The experimental and control groups were two separate intact classes in Algebra. For a period of twelve sessions, the experimental group was subjected to the scientific heuristic method, but the control group instead was given…

  6. Investigating the Impacts of Design Heuristics on Idea Initiation and Development

    ERIC Educational Resources Information Center

    Kramer, Julia; Daly, Shanna R.; Yilmaz, Seda; Seifert, Colleen M.; Gonzalez, Richard

    2015-01-01

    This paper presents an analysis of engineering students' use of Design Heuristics as part of a team project in an undergraduate engineering design course. Design Heuristics are an empirically derived set of cognitive "rules of thumb" for use in concept generation. We investigated heuristic use in the initial concept generation phase,…

  7. Heuristic Literacy Development and Its Relation to Mathematical Achievements of Middle School Students

    ERIC Educational Resources Information Center

    Koichu, Boris; Berman, Abraham; Moore, Michael

    2007-01-01

    The relationships between heuristic literacy development and mathematical achievements of middle school students were explored during a 5-month classroom experiment in two 8th grade classes (N = 37). By heuristic literacy we refer to an individual's capacity to use heuristic vocabulary in problem-solving discourse and to approach scholastic…

  8. Automated Detection of Heuristics and Biases among Pathologists in a Computer-Based System

    ERIC Educational Resources Information Center

    Crowley, Rebecca S.; Legowski, Elizabeth; Medvedeva, Olga; Reitmeyer, Kayse; Tseytlin, Eugene; Castine, Melissa; Jukic, Drazen; Mello-Thoms, Claudia

    2013-01-01

    The purpose of this study is threefold: (1) to develop an automated, computer-based method to detect heuristics and biases as pathologists examine virtual slide cases, (2) to measure the frequency and distribution of heuristics and errors across three levels of training, and (3) to examine relationships of heuristics to biases, and biases to…

  9. Fluency Heuristic: A Model of How the Mind Exploits a By-Product of Information Retrieval

    ERIC Educational Resources Information Center

    Hertwig, Ralph; Herzog, Stefan M.; Schooler, Lael J.; Reimer, Torsten

    2008-01-01

    Boundedly rational heuristics for inference can be surprisingly accurate and frugal for several reasons. They can exploit environmental structures, co-opt complex capacities, and elude effortful search by exploiting information that automatically arrives on the mental stage. The fluency heuristic is a prime example of a heuristic that makes the…

  10. Heuristic Research: A New Perspective on Ethics and Problems in Adult Education Research.

    ERIC Educational Resources Information Center

    Beckstrom, Edward S.

    1993-01-01

    Heuristic research is a highly autobiographical investigation of one's experience with a question or problem. This article examines the basic concepts and processes of heuristic research (in adult education), including self-dialog, tacit knowing, inverted perspective, intuition, indwelling, and focusing. Heuristic research design phases involve…

  11. Interpreting Quantifier Scope Ambiguity: Evidence of Heuristic First, Algorithmic Second Processing

    PubMed Central

    Dwivedi, Veena D.

    2013-01-01

    The present work suggests that sentence processing requires both heuristic and algorithmic processing streams, where the heuristic processing strategy precedes the algorithmic phase. This conclusion is based on three self-paced reading experiments in which the processing of two-sentence discourses was investigated, where context sentences exhibited quantifier scope ambiguity. Experiment 1 demonstrates that such sentences are processed in a shallow manner. Experiment 2 uses the same stimuli as Experiment 1 but adds questions to ensure deeper processing. Results indicate that reading times are consistent with a lexical-pragmatic interpretation of number associated with context sentences, but responses to questions are consistent with the algorithmic computation of quantifier scope. Experiment 3 shows the same pattern of results as Experiment 2, despite using stimuli with different lexical-pragmatic biases. These effects suggest that language processing can be superficial, and that deeper processing, which is sensitive to structure, only occurs if required. Implications for recent studies of quantifier scope ambiguity are discussed. PMID:24278439

  12. The role of heuristic appraisal in conflicting assessments of string theory

    NASA Astrophysics Data System (ADS)

    Camilleri, Kristian; Ritson, Sophie

    2015-08-01

    Over the last three decades, string theory has emerged as one of the leading hopes for a consistent theory of quantum gravity that unifies particle physics with general relativity. Despite the fact that string theory has been a thriving research program for the better part of three decades, it has been subjected to extensive criticism from a number of prominent physicists. The aim of this paper is to obtain a clearer picture of where the conflict lies in competing assessments of string theory, through a close reading of the argumentative strategies employed by protagonists on both sides. Although it has become commonplace to construe this debate as stemming from different attitudes to the absence of testable predictions, we argue that this presents an overly simplified view of the controversy, which ignores the critical role of heuristic appraisal. While string theorists and their defenders see the theoretical achievements of the string theory program as providing strong indication that it is 'on the right track', critics have challenged such claims, by calling into question the status of certain 'solved problems' and its purported 'explanatory coherence'. The debates over string theory are therefore particularly instructive from a philosophical point of view, not only because they offer important insights into the nature of heuristic appraisal and theoretical progress, but also because they raise deep questions about what constitutes a solved problem and an explanation in fundamental physics.

  13. Heuristic use of perceptual evidence leads to dissociation between performance and metacognitive sensitivity.

    PubMed

    Maniscalco, Brian; Peters, Megan A K; Lau, Hakwan

    2016-04-01

    Zylberberg et al. [Zylberberg, Barttfeld, & Sigman (Frontiers in Integrative Neuroscience, 6; 79, 2012), Frontiers in Integrative Neuroscience 6:79] found that confidence decisions, but not perceptual decisions, are insensitive to evidence against a selected perceptual choice. We present a signal detection theoretic model to formalize this insight, which gave rise to a counter-intuitive empirical prediction: that depending on the observer's perceptual choice, increasing task performance can be associated with decreasing metacognitive sensitivity (i.e., the trial-by-trial correspondence between confidence and accuracy). The model also provides an explanation as to why metacognitive sensitivity tends to be less than optimal in actual subjects. These predictions were confirmed robustly in a psychophysics experiment. In a second experiment we found that, in at least some subjects, the effects were replicated even under performance feedback designed to encourage optimal behavior. However, some subjects did show improvement under feedback, suggesting the tendency to ignore evidence against a selected perceptual choice may be a heuristic adopted by the perceptual decision-making system, rather than reflecting inherent biological limitations. We present a Bayesian modeling framework that explains why this heuristic strategy may be advantageous in real-world contexts.

  14. The Nature of Elementary Student Science Discourse in the Context of the Science Writing Heuristic Approach

    NASA Astrophysics Data System (ADS)

    Cavagnetto, Andy; Hand, Brian M.; Norton-Meier, Lori

    2010-03-01

    This case study aimed to determine the nature of student interactions in small groups in an elementary classroom utilizing the Science Writing Heuristic approach. Fifth grade students were audio-recorded over four units of study while working in small groups to generate knowledge claims after conducting student-directed investigations. Analysis consisted of (1) identifying amount of on/off task talk, (2) categorizing on-task talk as generative (talk associated with generating an argument) or representational (talk associated with representing an argument in a final written form), (3) characterizing the generative components of argument, and (4) determining the functions of language used. Results indicate that students were on task 98% of the time. Students engaged in generative talk an average of 25% of the time and representational talk an average of 71% of the time. Students engaged in components of Toulmin's model of argument, but challenging of each other's ideas was not commonplace. Talk was dominated by the informative function (representing one's ideas) of language as it was found 78.3% of the time and to a lesser extent (11.7%) the heuristic function (inquiring through questions). These functions appear to be intimately tied to the task of generating knowledge claims in small groups. The results suggest that both talking and writing are critical to using science discourse as an embedded strategy to learning science. Further, nature and structure of the task are important pedagogical considerations when moving students toward participation in science discourse.

  15. Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows.

    PubMed

    Jawarneh, Sana; Abdullah, Salwani

    2015-01-01

    This paper presents a bee colony optimisation (BCO) algorithm to tackle the vehicle routing problem with time window (VRPTW). The VRPTW involves recovering an ideal set of routes for a fleet of vehicles serving a defined number of customers. The BCO algorithm is a population-based algorithm that mimics the social communication patterns of honeybees in solving problems. The performance of the BCO algorithm is dependent on its parameters, so the online (self-adaptive) parameter tuning strategy is used to improve its effectiveness and robustness. Compared with the basic BCO, the adaptive BCO performs better. Diversification is crucial to the performance of the population-based algorithm, but the initial population in the BCO algorithm is generated using a greedy heuristic, which has insufficient diversification. Therefore the ways in which the sequential insertion heuristic (SIH) for the initial population drives the population toward improved solutions are examined. Experimental comparisons indicate that the proposed adaptive BCO-SIH algorithm works well across all instances and is able to obtain 11 best results in comparison with the best-known results in the literature when tested on Solomon's 56 VRPTW 100 customer instances. Also, a statistical test shows that there is a significant difference between the results.

  16. Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows

    PubMed Central

    Jawarneh, Sana; Abdullah, Salwani

    2015-01-01

    This paper presents a bee colony optimisation (BCO) algorithm to tackle the vehicle routing problem with time window (VRPTW). The VRPTW involves recovering an ideal set of routes for a fleet of vehicles serving a defined number of customers. The BCO algorithm is a population-based algorithm that mimics the social communication patterns of honeybees in solving problems. The performance of the BCO algorithm is dependent on its parameters, so the online (self-adaptive) parameter tuning strategy is used to improve its effectiveness and robustness. Compared with the basic BCO, the adaptive BCO performs better. Diversification is crucial to the performance of the population-based algorithm, but the initial population in the BCO algorithm is generated using a greedy heuristic, which has insufficient diversification. Therefore the ways in which the sequential insertion heuristic (SIH) for the initial population drives the population toward improved solutions are examined. Experimental comparisons indicate that the proposed adaptive BCO-SIH algorithm works well across all instances and is able to obtain 11 best results in comparison with the best-known results in the literature when tested on Solomon’s 56 VRPTW 100 customer instances. Also, a statistical test shows that there is a significant difference between the results. PMID:26132158

  17. Heuristics to Evaluate Interactive Systems for Children with Autism Spectrum Disorder (ASD)

    PubMed Central

    Khowaja, Kamran; Salim, Siti Salwah

    2015-01-01

    In this paper, we adapted and expanded a set of guidelines, also known as heuristics, to evaluate the usability of software to now be appropriate for software aimed at children with autism spectrum disorder (ASD). We started from the heuristics developed by Nielsen in 1990 and developed a modified set of 15 heuristics. The first 5 heuristics of this set are the same as those of the original Nielsen set, the next 5 heuristics are improved versions of Nielsen's, whereas the last 5 heuristics are new. We present two evaluation studies of our new heuristics. In the first, two groups compared Nielsen’s set with the modified set of heuristics, with each group evaluating two interactive systems. The Nielsen’s heuristics were assigned to the control group while the experimental group was given the modified set of heuristics, and a statistical analysis was conducted to determine the effectiveness of the modified set, the contribution of 5 new heuristics and the impact of 5 improved heuristics. The results show that the modified set is significantly more effective than the original, and we found a significant difference between the five improved heuristics and their corresponding heuristics in the original set. The five new heuristics are effective in problem identification using the modified set. The second study was conducted using a system which was developed to ascertain if the modified set was effective at identifying usability problems that could be fixed before the release of software. The post-study analysis revealed that the majority of the usability problems identified by the experts were fixed in the updated version of the system. PMID:26196385

  18. Heuristics to Evaluate Interactive Systems for Children with Autism Spectrum Disorder (ASD).

    PubMed

    Khowaja, Kamran; Salim, Siti Salwah; Asemi, Adeleh

    2015-01-01

    In this paper, we adapted and expanded a set of guidelines, also known as heuristics, to evaluate the usability of software to now be appropriate for software aimed at children with autism spectrum disorder (ASD). We started from the heuristics developed by Nielsen in 1990 and developed a modified set of 15 heuristics. The first 5 heuristics of this set are the same as those of the original Nielsen set, the next 5 heuristics are improved versions of Nielsen's, whereas the last 5 heuristics are new. We present two evaluation studies of our new heuristics. In the first, two groups compared Nielsen's set with the modified set of heuristics, with each group evaluating two interactive systems. The Nielsen's heuristics were assigned to the control group while the experimental group was given the modified set of heuristics, and a statistical analysis was conducted to determine the effectiveness of the modified set, the contribution of 5 new heuristics and the impact of 5 improved heuristics. The results show that the modified set is significantly more effective than the original, and we found a significant difference between the five improved heuristics and their corresponding heuristics in the original set. The five new heuristics are effective in problem identification using the modified set. The second study was conducted using a system which was developed to ascertain if the modified set was effective at identifying usability problems that could be fixed before the release of software. The post-study analysis revealed that the majority of the usability problems identified by the experts were fixed in the updated version of the system.

  19. Maximal area and conformal welding heuristics for optimal slice selection in splenic volume estimation

    NASA Astrophysics Data System (ADS)

    Gutenko, Ievgeniia; Peng, Hao; Gu, Xianfeng; Barish, Mathew; Kaufman, Arie

    2016-03-01

    Accurate estimation of splenic volume is crucial for the determination of disease progression and response to treatment for diseases that result in enlargement of the spleen. However, there is no consensus with respect to the use of single or multiple one-dimensional, or volumetric measurement. Existing methods for human reviewers focus on measurement of cross diameters on a representative axial slice and craniocaudal length of the organ. We propose two heuristics for the selection of the optimal axial plane for splenic volume estimation: the maximal area axial measurement heuristic and the novel conformal welding shape-based heuristic. We evaluate these heuristics on time-variant data derived from both healthy and sick subjects and contrast them to established heuristics. Under certain conditions our heuristics are superior to standard practice volumetric estimation methods. We conclude by providing guidance on selecting the optimal heuristic for splenic volume estimation.

  20. Task Assignment Heuristics for Parallel and Distributed CFD Applications

    NASA Technical Reports Server (NTRS)

    Lopez-Benitez, Noe; Djomehri, M. Jahed; Biswas, Rupak

    2003-01-01

    This paper proposes a task graph (TG) model to represent a single discrete step of multi-block overset grid computational fluid dynamics (CFD) applications. The TG model is then used to not only balance the computational workload across the overset grids but also to reduce inter-grid communication costs. We have developed a set of task assignment heuristics based on the constraints inherent in this class of CFD problems. Two basic assignments, the smallest task first (STF) and the largest task first (LTF), are first presented. They are then systematically costs. To predict the performance of the proposed task assignment heuristics, extensive performance evaluations are conducted on a synthetic TG with tasks defined in terms of the number of grid points in predetermined overlapping grids. A TG derived from a realistic problem with eight million grid points is also used as a test case.

  1. The source of the truth bias: Heuristic processing?

    PubMed

    Street, Chris N H; Masip, Jaume

    2015-06-01

    People believe others are telling the truth more often than they actually are; this is called the truth bias. Surprisingly, when a speaker is judged at multiple points across their statement the truth bias declines. Previous claims argue this is evidence of a shift from (biased) heuristic processing to (reasoned) analytical processing. In four experiments we contrast the heuristic-analytic model (HAM) with alternative accounts. In Experiment 1, the decrease in truth responding was not the result of speakers appearing more deceptive, but was instead attributable to the rater's processing style. Yet contrary to HAMs, across three experiments we found the decline in bias was not related to the amount of processing time available (Experiments 1-3) or the communication channel (Experiment 2). In Experiment 4 we found support for a new account: that the bias reflects whether raters perceive the statement to be internally consistent.

  2. A multivariate heuristic model for fuzzy time-series forecasting.

    PubMed

    Huarng, Kun-Huang; Yu, Tiffany Hui-Kuang; Hsu, Yu Wei

    2007-08-01

    Fuzzy time-series models have been widely applied due to their ability to handle nonlinear data directly and because no rigid assumptions for the data are needed. In addition, many such models have been shown to provide better forecasting results than their conventional counterparts. However, since most of these models require complicated matrix computations, this paper proposes the adoption of a multivariate heuristic function that can be integrated with univariate fuzzy time-series models into multivariate models. Such a multivariate heuristic function can easily be extended and integrated with various univariate models. Furthermore, the integrated model can handle multiple variables to improve forecasting results and, at the same time, avoid complicated computations due to the inclusion of multiple variables.

  3. Deterministic algorithm with agglomerative heuristic for location problems

    NASA Astrophysics Data System (ADS)

    Kazakovtsev, L.; Stupina, A.

    2015-10-01

    Authors consider the clustering problem solved with the k-means method and p-median problem with various distance metrics. The p-median problem and the k-means problem as its special case are most popular models of the location theory. They are implemented for solving problems of clustering and many practically important logistic problems such as optimal factory or warehouse location, oil or gas wells, optimal drilling for oil offshore, steam generators in heavy oil fields. Authors propose new deterministic heuristic algorithm based on ideas of the Information Bottleneck Clustering and genetic algorithms with greedy heuristic. In this paper, results of running new algorithm on various data sets are given in comparison with known deterministic and stochastic methods. New algorithm is shown to be significantly faster than the Information Bottleneck Clustering method having analogous preciseness.

  4. A novel heuristic algorithm for capacitated vehicle routing problem

    NASA Astrophysics Data System (ADS)

    Kır, Sena; Yazgan, Harun Reşit; Tüncel, Emre

    2017-02-01

    The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic algorithm based on the tabu search and adaptive large neighborhood search (ALNS) with several specifically designed operators and features to solve the capacitated vehicle routing problem (CVRP). The effectiveness of the proposed algorithm was illustrated on the benchmark problems. The algorithm provides a better performance on large-scaled instances and gained advantage in terms of CPU time. In addition, we solved a real-life CVRP using the proposed algorithm and found the encouraging results by comparison with the current situation that the company is in.

  5. A heuristic approach to incremental and reactive scheduling

    NASA Technical Reports Server (NTRS)

    Odubiyi, Jide B.; Zoch, David R.

    1989-01-01

    An heuristic approach to incremental and reactive scheduling is described. Incremental scheduling is the process of modifying an existing schedule if the initial schedule does not meet its stated initial goals. Reactive scheduling occurs in near real-time in response to changes in available resources or the occurrence of targets of opportunity. Only minor changes are made during both incremental and reactive scheduling because a goal of re-scheduling procedures is to minimally impact the schedule. The described heuristic search techniques, which are employed by the Request Oriented Scheduling Engine (ROSE), a prototype generic scheduler, efficiently approximate the cost of reaching a goal from a given state and effective mechanisms for controlling search.

  6. A heuristic finite-state model of the human driver in a car-following situation

    NASA Technical Reports Server (NTRS)

    Burnham, G. O.; Bekey, G. A.

    1976-01-01

    An approach to modeling human driver behavior in single-lane car following which is based on a finite-state decision structure is considered. The specific strategy at each point in the decision tree was obtained from observations of typical driver behavior. The synthesis of the decision logic is based on position and velocity thresholds and four states defined by regions in the phase plane. The performance of the resulting assumed intuitively logical model was compared with actual freeway data. The match of the model to the data was optimized by adapting the model parameters using a modified PARTAN algorithm. The results indicate that the heuristic model behavior matches actual car-following performance better during deceleration and constant velocity phases than during acceleration periods.

  7. Multiobjective hyper heuristic scheme for system design and optimization

    NASA Astrophysics Data System (ADS)

    Rafique, Amer Farhan

    2012-11-01

    As system design is becoming more and more multifaceted, integrated, and complex, the traditional single objective optimization trends of optimal design are becoming less and less efficient and effective. Single objective optimization methods present a unique optimal solution whereas multiobjective methods present pareto front. The foremost intent is to predict a reasonable distributed pareto-optimal solution set independent of the problem instance through multiobjective scheme. Other objective of application of intended approach is to improve the worthiness of outputs of the complex engineering system design process at the conceptual design phase. The process is automated in order to provide the system designer with the leverage of the possibility of studying and analyzing a large multiple of possible solutions in a short time. This article presents Multiobjective Hyper Heuristic Optimization Scheme based on low level meta-heuristics developed for the application in engineering system design. Herein, we present a stochastic function to manage meta-heuristics (low-level) to augment surety of global optimum solution. Generic Algorithm, Simulated Annealing and Swarm Intelligence are used as low-level meta-heuristics in this study. Performance of the proposed scheme is investigated through a comprehensive empirical analysis yielding acceptable results. One of the primary motives for performing multiobjective optimization is that the current engineering systems require simultaneous optimization of conflicting and multiple. Random decision making makes the implementation of this scheme attractive and easy. Injecting feasible solutions significantly alters the search direction and also adds diversity of population resulting in accomplishment of pre-defined goals set in the proposed scheme.

  8. Concept Learning and Heuristic Classification in Weak-Theory Domains

    DTIC Science & Technology

    1990-03-01

    successful approach to concept learning for heuristic classification. Almost all current programs for this task create or use explicit, abstract...generalizations. These programs are largely ineffective for domains with weak or intractable theories. An exemplar-based approach is suitable for domains with...inadequate theories but raises two additional problems: determining similarity and indexing exemplars. Our approach extends the exemplar-based approach

  9. VHP - An environment for the remote visualization of heuristic processes

    NASA Technical Reports Server (NTRS)

    Crawford, Stuart L.; Leiner, Barry M.

    1991-01-01

    A software system called VHP is introduced which permits the visualization of heuristic algorithms on both resident and remote hardware platforms. The VHP is based on the DCF tool for interprocess communication and is applicable to remote algorithms which can be on different types of hardware and in languages other than VHP. The VHP system is of particular interest to systems in which the visualization of remote processes is required such as robotics for telescience applications.

  10. Symbolic Heuristic Search for Factored Markov Decision Processes

    NASA Technical Reports Server (NTRS)

    Morris, Robert (Technical Monitor); Feng, Zheng-Zhu; Hansen, Eric A.

    2003-01-01

    We describe a planning algorithm that integrates two approaches to solving Markov decision processes with large state spaces. State abstraction is used to avoid evaluating states individually. Forward search from a start state, guided by an admissible heuristic, is used to avoid evaluating all states. We combine these two approaches in a novel way that exploits symbolic model-checking techniques and demonstrates their usefulness for decision-theoretic planning.

  11. Bose-Einstein condensates form in heuristics learned by ciliates deciding to signal 'social' commitments.

    PubMed

    Clark, Kevin B

    2010-03-01

    Fringe quantum biology theories often adopt the concept of Bose-Einstein condensation when explaining how consciousness, emotion, perception, learning, and reasoning emerge from operations of intact animal nervous systems and other computational media. However, controversial empirical evidence and mathematical formalism concerning decoherence rates of bioprocesses keep these frameworks from satisfactorily accounting for the physical nature of cognitive-like events. This study, inspired by the discovery that preferential attachment rules computed by complex technological networks obey Bose-Einstein statistics, is the first rigorous attempt to examine whether analogues of Bose-Einstein condensation precipitate learned decision making in live biological systems as bioenergetics optimization predicts. By exploiting the ciliate Spirostomum ambiguum's capacity to learn and store behavioral strategies advertising mating availability into heuristics of topologically invariant computational networks, three distinct phases of strategy use were found to map onto statistical distributions described by Bose-Einstein, Fermi-Dirac, and classical Maxwell-Boltzmann behavior. Ciliates that sensitized or habituated signaling patterns to emit brief periods of either deceptive 'harder-to-get' or altruistic 'easier-to-get' serial escape reactions began testing condensed on initially perceived fittest 'courting' solutions. When these ciliates switched from their first strategy choices, Bose-Einstein condensation of strategy use abruptly dissipated into a Maxwell-Boltzmann computational phase no longer dominated by a single fittest strategy. Recursive trial-and-error strategy searches annealed strategy use back into a condensed phase consistent with performance optimization. 'Social' decisions performed by ciliates showing no nonassociative learning were largely governed by Fermi-Dirac statistics, resulting in degenerate distributions of strategy choices. These findings corroborate

  12. Heuristic and analytic processing in online sports betting.

    PubMed

    d'Astous, Alain; Di Gaspero, Marc

    2015-06-01

    This article presents the results of two studies that examine the occurrence of heuristic (i.e., intuitive and fast) and analytic (i.e., deliberate and slow) processes among people who engage in online sports betting on a regular basis. The first study was qualitative and was conducted with a convenience sample of 12 regular online sports gamblers who described the processes by which they arrive at a sports betting decision. The results of this study showed that betting online on sports events involves a mix of heuristic and analytic processes. The second study consisted in a survey of 161 online sports gamblers where performance in terms of monetary gains, experience in online sports betting, propensity to collect and analyze relevant information prior to betting, and use of bookmaker odds were measured. This study showed that heuristic and analytic processes act as mediators of the relationship between experience and performance. The findings stemming of these two studies give some insights into gamblers' modes of thinking and behaviors in an online sports betting context and show the value of the dual mediation process model for research that looks at gambling activities from a judgment and decision making perspective.

  13. Remotely sensed image processing service composition based on heuristic search

    NASA Astrophysics Data System (ADS)

    Yang, Xiaoxia; Zhu, Qing; Li, Hai-feng; Zhao, Wen-hao

    2008-12-01

    As remote sensing technology become ever more powerful with multi-platform and multi-sensor, it has been widely recognized for contributing to geospatial information efforts. Because the remotely sensed image processing demands large-scale, collaborative processing and massive storage capabilities to satisfy the increasing demands of various applications, the effect and efficiency of the remotely sensed image processing is far from the user's expectation. The emergence of Service Oriented Architecture (SOA) may make this challenge manageable. It encapsulate all processing function into services and recombine them with service chain. The service composition on demand has become a hot topic. Aiming at the success rate, quality and efficiency of processing service composition for remote sensing application, a remote sensed image processing service composition method is proposed in this paper. It composes services for a user requirement through two steps: 1) dynamically constructs a complete service dependency graph for user requirement on-line; 2) AO* based heuristic searches for optimal valid path in service dependency graph. These services within the service dependency graph are considered relevant to the specific request, instead of overall registered services. The second step, heuristic search is a promising approach for automated planning. Starting with the initial state, AO* uses a heuristic function to select states until the user requirement is reached. Experimental results show that this method has a good performance even the repository has a large number of processing services.

  14. Tuning Parameters in Heuristics by Using Design of Experiments Methods

    NASA Technical Reports Server (NTRS)

    Arin, Arif; Rabadi, Ghaith; Unal, Resit

    2010-01-01

    With the growing complexity of today's large scale problems, it has become more difficult to find optimal solutions by using exact mathematical methods. The need to find near-optimal solutions in an acceptable time frame requires heuristic approaches. In many cases, however, most heuristics have several parameters that need to be "tuned" before they can reach good results. The problem then turns into "finding best parameter setting" for the heuristics to solve the problems efficiently and timely. One-Factor-At-a-Time (OFAT) approach for parameter tuning neglects the interactions between parameters. Design of Experiments (DOE) tools can be instead employed to tune the parameters more effectively. In this paper, we seek the best parameter setting for a Genetic Algorithm (GA) to solve the single machine total weighted tardiness problem in which n jobs must be scheduled on a single machine without preemption, and the objective is to minimize the total weighted tardiness. Benchmark instances for the problem are available in the literature. To fine tune the GA parameters in the most efficient way, we compare multiple DOE models including 2-level (2k ) full factorial design, orthogonal array design, central composite design, D-optimal design and signal-to-noise (SIN) ratios. In each DOE method, a mathematical model is created using regression analysis, and solved to obtain the best parameter setting. After verification runs using the tuned parameter setting, the preliminary results for optimal solutions of multiple instances were found efficiently.

  15. Bflinks: Reliable Bugfix Links via Bidirectional References and Tuned Heuristics

    PubMed Central

    2014-01-01

    Background. Data from software version archives and defect databases can be used for defect insertion circumstance analysis and defect prediction. The first step in such analyses is identifying defect-correcting changes in the version archive (bugfix commits) and enriching them with additional metadata by establishing bugfix links to corresponding entries in the defect database. Candidate bugfix commits are typically identified via heuristic string matching on the commit message. Research Questions. Which filters could be used to obtain a set of bugfix links? How to tune their parameters? What accuracy is achieved? Method. We analyze a modular set of seven independent filters, including new ones that make use of reverse links, and evaluate visual heuristics for setting cutoff parameters. For a commercial repository, a product expert manually verifies over 2500 links to validate the results with unprecedented accuracy. Results. The heuristics pick a very good parameter value for five filters and a reasonably good one for the sixth. The combined filtering, called bflinks, provides 93% precision and only 7% results loss. Conclusion. Bflinks can provide high-quality results and adapts to repositories with different properties. PMID:27433506

  16. Visualization for Hyper-Heuristics: Back-End Processing

    SciTech Connect

    Simon, Luke

    2015-03-01

    Modern society is faced with increasingly complex problems, many of which can be formulated as generate-and-test optimization problems. Yet, general-purpose optimization algorithms may sometimes require too much computational time. In these instances, hyperheuristics may be used. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario, finding the solution significantly faster than its predecessor. However, it may be difficult to understand exactly how a design was derived and why it should be trusted. This project aims to address these issues by creating an easy-to-use graphical user interface (GUI) for hyper-heuristics and an easy-to-understand scientific visualization for the produced solutions. To support the development of this GUI, my portion of the research involved developing algorithms that would allow for parsing of the data produced by the hyper-heuristics. This data would then be sent to the front-end, where it would be displayed to the end user.

  17. General heuristics algorithms for solving capacitated arc routing problem

    NASA Astrophysics Data System (ADS)

    Fadzli, Mohammad; Najwa, Nurul; Masran, Hafiz

    2015-05-01

    In this paper, we try to determine the near-optimum solution for the capacitated arc routing problem (CARP). In general, NP-hard CARP is a special graph theory specifically arises from street services such as residential waste collection and road maintenance. By purpose, the design of the CARP model and its solution techniques is to find optimum (or near-optimum) routing cost for a fleet of vehicles involved in operation. In other words, finding minimum-cost routing is compulsory in order to reduce overall operation cost that related with vehicles. In this article, we provide a combination of various heuristics algorithm to solve a real case of CARP in waste collection and benchmark instances. These heuristics work as a central engine in finding initial solutions or near-optimum in search space without violating the pre-setting constraints. The results clearly show that these heuristics algorithms could provide good initial solutions in both real-life and benchmark instances.

  18. Recipient design in human communication: simple heuristics or perspective taking?

    PubMed

    Blokpoel, Mark; van Kesteren, Marlieke; Stolk, Arjen; Haselager, Pim; Toni, Ivan; van Rooij, Iris

    2012-01-01

    Humans have a remarkable capacity for tuning their communicative behaviors to different addressees, a phenomenon also known as recipient design. It remains unclear how this tuning of communicative behavior is implemented during live human interactions. Classical theories of communication postulate that recipient design involves perspective taking, i.e., the communicator selects her behavior based on her hypotheses about beliefs and knowledge of the recipient. More recently, researchers have argued that perspective taking is computationally too costly to be a plausible mechanism in everyday human communication. These researchers propose that computationally simple mechanisms, or heuristics, are exploited to perform recipient design. Such heuristics may be able to adapt communicative behavior to an addressee with no consideration for the addressee's beliefs and knowledge. To test whether the simpler of the two mechanisms is sufficient for explaining the "how" of recipient design we studied communicators' behaviors in the context of a non-verbal communicative task (the Tacit Communication Game, TCG). We found that the specificity of the observed trial-by-trial adjustments made by communicators is parsimoniously explained by perspective taking, but not by simple heuristics. This finding is important as it suggests that humans do have a computationally efficient way of taking beliefs and knowledge of a recipient into account.

  19. Recipient design in human communication: simple heuristics or perspective taking?

    PubMed Central

    Blokpoel, Mark; van Kesteren, Marlieke; Stolk, Arjen; Haselager, Pim; Toni, Ivan; van Rooij, Iris

    2012-01-01

    Humans have a remarkable capacity for tuning their communicative behaviors to different addressees, a phenomenon also known as recipient design. It remains unclear how this tuning of communicative behavior is implemented during live human interactions. Classical theories of communication postulate that recipient design involves perspective taking, i.e., the communicator selects her behavior based on her hypotheses about beliefs and knowledge of the recipient. More recently, researchers have argued that perspective taking is computationally too costly to be a plausible mechanism in everyday human communication. These researchers propose that computationally simple mechanisms, or heuristics, are exploited to perform recipient design. Such heuristics may be able to adapt communicative behavior to an addressee with no consideration for the addressee's beliefs and knowledge. To test whether the simpler of the two mechanisms is sufficient for explaining the “how” of recipient design we studied communicators' behaviors in the context of a non-verbal communicative task (the Tacit Communication Game, TCG). We found that the specificity of the observed trial-by-trial adjustments made by communicators is parsimoniously explained by perspective taking, but not by simple heuristics. This finding is important as it suggests that humans do have a computationally efficient way of taking beliefs and knowledge of a recipient into account. PMID:23055960

  20. Investigating the effectiveness of implementing the Science Writing Heuristic on student performance in general chemistry

    NASA Astrophysics Data System (ADS)

    Poock, Jason Ray

    This research investigated the effectiveness at how the Science Writing Heuristic in the freshman chemistry laboratory for science and engineering majors at Iowa State University during the fall and spring semesters of the 2002--2003 academic year, was implemented. The Science Writing Heuristic (SWH) consists of two components, writing to learn strategies and conducting the laboratory session in a student-centered, guided-inquiry fashion. The writing component replaced the standard laboratory report with a series of questions that guided the students' critical thinking along the lines of scientific investigation. The writing process helped students construct knowledge. Also critical to the successful implementation of the SWH was conducting the laboratory experiments in a student-centered, guided-inquiry fashion. Through the SWH the students became engaged in meaningful scientific dialogue that promoted knowledge construction. For the SWH to be properly implemented, a classroom dynamic between the teacher and the students should be established. The teacher provides the framework within which the laboratory experiment is conducted and the students respond to that guidance by becoming engaged in the learning process. Results of the study showed that student scores improved when the teacher properly implemented the SWH, when the students responded positively to the implementation of the SWH, and when there was a proper classroom dynamic created between the teacher and the students. This study revealed that successful implementation of the SWH was beneficial to females and low ability students. This research also demonstrated a connection between the implementation of a learning strategy in the laboratory component of a course and the subsequent benefit in student performance in the lecture component of the course.

  1. Use of Heuristics to Facilitate Scientific Discovery Learning in a Simulation Learning Environment in a Physics Domain

    NASA Astrophysics Data System (ADS)

    Veermans, Koen; van Joolingen, Wouter; de Jong, Ton

    2006-03-01

    This article describes a study into the role of heuristic support in facilitating discovery learning through simulation-based learning. The study compares the use of two such learning environments in the physics domain of collisions. In one learning environment (implicit heuristics) heuristics are only used to provide the learner with guidance derived from heuristics, without presenting the heuristics themselves; in the other (explicit heuristics) the heuristics themselves are also made explicit to the learner. The two learning environments are tested with 46 students from two schools. The results show that learners in both conditions gain domain knowledge from pre-test to post-test. Regression analyses show that pre-test results can predict post-test results in the implicit heuristics condition but not in the explicit heuristic condition. Process analyses suggest that presenting the heuristics explicitly facilitate more self-regulation in students.

  2. Extending Students' Practice of Metacognitive Regulation Skills with the Science Writing Heuristic

    NASA Astrophysics Data System (ADS)

    van Opstal, Mary T.; Daubenmire, Patrick L.

    2015-05-01

    Metacognition can be described as an internal conversation that seeks to answer the questions, 'how much do I really know about what I am learning' and, 'how am I monitoring what I am learning?' Metacognitive regulation skills are critical to meaningful learning because they facilitate the abilities to recognize the times when one's current level of understanding is insufficient and to identify the needs for closing the gap in understanding. This research explored how using the Science Writing Heuristic (SWH) as an instructional approach in a laboratory classroom affected students' practice of metacognitive skills while solving open-ended laboratory problems. Within our qualitative research design, results demonstrate that students in the SWH environment, compared to non-SWH students, used metacognitive strategies to a different degree and to a different depth when solving open-ended laboratory problems. As students engaged in higher levels of metacognitive regulation, peer collaboration became a prominent path for supporting the use of metacognitive strategies. Students claimed that the structure of the SWH weekly laboratory experiments improved their ability to solve open-ended lab problems. Results from this study suggest that using instruction that encourages practice of metacognitive strategies can improve students' use of these strategies.

  3. Planning collision free paths for two cooperating robots using a divide-and-conquer C-space traversal heuristic

    NASA Technical Reports Server (NTRS)

    Weaver, Johnathan M.

    1993-01-01

    A method was developed to plan feasible and obstacle-avoiding paths for two spatial robots working cooperatively in a known static environment. Cooperating spatial robots as referred to herein are robots which work in 6D task space while simultaneously grasping and manipulating a common, rigid payload. The approach is configuration space (c-space) based and performs selective rather than exhaustive c-space mapping. No expensive precomputations are required. A novel, divide-and-conquer type of heuristic is used to guide the selective mapping process. The heuristic does not involve any robot, environment, or task specific assumptions. A technique was also developed which enables solution of the cooperating redundant robot path planning problem without requiring the use of inverse kinematics for a redundant robot. The path planning strategy involves first attempting to traverse along the configuration space vector from the start point towards the goal point. If an unsafe region is encountered, an intermediate via point is identified by conducting a systematic search in the hyperplane orthogonal to and bisecting the unsafe region of the vector. This process is repeatedly applied until a solution to the global path planning problem is obtained. The basic concept behind this strategy is that better local decisions at the beginning of the trouble region may be made if a possible way around the 'center' of the trouble region is known. Thus, rather than attempting paths which look promising locally (at the beginning of a trouble region) but which may not yield overall results, the heuristic attempts local strategies that appear promising for circumventing the unsafe region.

  4. Using a Science Writing Heuristic to enhance learning outcomes from laboratory activities in seventh-grade science: quantitative and qualitative aspects

    NASA Astrophysics Data System (ADS)

    Hand, Brian; Wallace, Carolyn W.; Yang, Eun-Mi

    2004-02-01

    Science laboratory activities within secondary science have traditionally followed prescriptive outlines both in the structure and reporting of the activity. Building on current understandings of writing to learn science strategies, a Science Writing Heuristic has been developed that encourages students to examine laboratory activities much more carefully in terms of having to justify their research questions, claims and evidence. This study reports on the implementation of the heuristic within a Year 7 biology classroom. A mixed-method approach was used to determine whether student performance on conceptual questions improved when using the heuristic and if using a more non-traditional write-up of laboratory activities was beneficial for students in terms of learning. Results indicate that students who used the Science Writing Heuristic performed better as a group than students who did not, and that students who completed a textbook explanation as a write-up performed better as a group than those who completed a more traditional write-up format. Student interview responses indicate a development of understanding of science inquiry and an awareness of cognitive and metacognitive processes needed to complete the activities.

  5. From Metaphors to Formalism: A Heuristic Approach to Holistic Assessments of Ecosystem Health

    PubMed Central

    Kraus, Gerd

    2016-01-01

    Environmental policies employ metaphoric objectives such as ecosystem health, resilience and sustainable provision of ecosystem services, which influence corresponding sustainability assessments by means of normative settings such as assumptions on system description, indicator selection, aggregation of information and target setting. A heuristic approach is developed for sustainability assessments to avoid ambiguity and applications to the EU Marine Strategy Framework Directive (MSFD) and OSPAR assessments are presented. For MSFD, nineteen different assessment procedures have been proposed, but at present no agreed assessment procedure is available. The heuristic assessment framework is a functional-holistic approach comprising an ex-ante/ex-post assessment framework with specifically defined normative and systemic dimensions (EAEPNS). The outer normative dimension defines the ex-ante/ex-post framework, of which the latter branch delivers one measure of ecosystem health based on indicators and the former allows to account for the multi-dimensional nature of sustainability (social, economic, ecological) in terms of modeling approaches. For MSFD, the ex-ante/ex-post framework replaces the current distinction between assessments based on pressure and state descriptors. The ex-ante and the ex-post branch each comprise an inner normative and a systemic dimension. The inner normative dimension in the ex-post branch considers additive utility models and likelihood functions to standardize variables normalized with Bayesian modeling. Likelihood functions allow precautionary target setting. The ex-post systemic dimension considers a posteriori indicator selection by means of analysis of indicator space to avoid redundant indicator information as opposed to a priori indicator selection in deconstructive-structural approaches. Indicator information is expressed in terms of ecosystem variability by means of multivariate analysis procedures. The application to the OSPAR

  6. Convex hull or crossing avoidance? Solution heuristics in the traveling salesperson problem.

    PubMed

    MacGregor, James N; Chronicle, Edward P; Ormerod, Thomas C

    2004-03-01

    Untrained adults appear to have access to cognitive processes that allow them to perform well in the Euclidean version of the traveling salesperson problem (E-TSP). They do so despite the famous computational intractability of the problem, which stems from its combinatorial complexity. A current hypothesis is the humans' good performance is based on following a strategy of connecting boundary points in order (the convex hull hypothesis). Recently, an alternative has been proposed, that performance is governed by a strategy of avoiding crossings. We examined the crossing avoidance hypothesis from the perspectives of its capacity to explain existing data, its theoretical adequacy, and its ability to explain the results of three new experiments. In Experiment 1, effects on the solution quality of number of points versus number of interior points were compared. In Experiment 2, the distributions of observed paths were compared with those predicted from the two hypotheses. In Experiment 3, figural effects were varied to induce crossings. The results of the experiments were more consistent with the convex hull than with the crossing avoidance hypothesis. Despite its simplicity and intuitive appeal, crossing avoidance does not provide a complete alternative to the convex hull hypothesis. Further elucidation of human strategies and heuristics for optimization problems such as the E-TSP will aid our understanding of how cognitive processes have adapted to the demands of combinatorial difficulty.

  7. Money earlier or later? Simple heuristics explain intertemporal choices better than delay discounting does.

    PubMed

    Ericson, Keith M Marzilli; White, John Myles; Laibson, David; Cohen, Jonathan D

    2015-06-01

    Heuristic models have been proposed for many domains involving choice. We conducted an out-of-sample, cross-validated comparison of heuristic models of intertemporal choice (which can account for many of the known intertemporal choice anomalies) and discounting models. Heuristic models outperformed traditional utility-discounting models, including models of exponential and hyperbolic discounting. The best-performing models predicted choices by using a weighted average of absolute differences and relative percentage differences of the attributes of the goods in a choice set. We concluded that heuristic models explain time-money trade-off choices in experiments better than do utility-discounting models.

  8. How the twain can meet: Prospect theory and models of heuristics in risky choice.

    PubMed

    Pachur, Thorsten; Suter, Renata S; Hertwig, Ralph

    2017-03-01

    Two influential approaches to modeling choice between risky options are algebraic models (which focus on predicting the overt decisions) and models of heuristics (which are also concerned with capturing the underlying cognitive process). Because they rest on fundamentally different assumptions and algorithms, the two approaches are usually treated as antithetical, or even incommensurable. Drawing on cumulative prospect theory (CPT; Tversky & Kahneman, 1992) as the currently most influential instance of a descriptive algebraic model, we demonstrate how the two modeling traditions can be linked. CPT's algebraic functions characterize choices in terms of psychophysical (diminishing sensitivity to probabilities and outcomes) as well as psychological (risk aversion and loss aversion) constructs. Models of heuristics characterize choices as rooted in simple information-processing principles such as lexicographic and limited search. In computer simulations, we estimated CPT's parameters for choices produced by various heuristics. The resulting CPT parameter profiles portray each of the choice-generating heuristics in psychologically meaningful ways-capturing, for instance, differences in how the heuristics process probability information. Furthermore, CPT parameters can reflect a key property of many heuristics, lexicographic search, and track the environment-dependent behavior of heuristics. Finally, we show, both in an empirical and a model recovery study, how CPT parameter profiles can be used to detect the operation of heuristics. We also address the limits of CPT's ability to capture choices produced by heuristics. Our results highlight an untapped potential of CPT as a measurement tool to characterize the information processing underlying risky choice.

  9. A heuristic re-mapping algorithm reducing inter-level communication in SAMR applications.

    SciTech Connect

    Steensland, Johan; Ray, Jaideep

    2003-07-01

    This paper aims at decreasing execution time for large-scale structured adaptive mesh refinement (SAMR) applications by proposing a new heuristic re-mapping algorithm and experimentally showing its effectiveness in reducing inter-level communication. Tests were done for five different SAMR applications. The overall goal is to engineer a dynamically adaptive meta-partitioner capable of selecting and configuring the most appropriate partitioning strategy at run-time based on current system and application state. Such a metapartitioner can significantly reduce execution times for general SAMR applications. Computer simulations of physical phenomena are becoming increasingly popular as they constitute an important complement to real-life testing. In many cases, such simulations are based on solving partial differential equations by numerical methods. Adaptive methods are crucial to efficiently utilize computer resources such as memory and CPU. But even with adaption, the simulations are computationally demanding and yield huge data sets. Thus parallelization and the efficient partitioning of data become issues of utmost importance. Adaption causes the workload to change dynamically, calling for dynamic (re-) partitioning to maintain efficient resource utilization. The proposed heuristic algorithm reduced inter-level communication substantially. Since the complexity of the proposed algorithm is low, this decrease comes at a relatively low cost. As a consequence, we draw the conclusion that the proposed re-mapping algorithm would be useful to lower overall execution times for many large SAMR applications. Due to its usefulness and its parameterization, the proposed algorithm would constitute a natural and important component of the meta-partitioner.

  10. Effects of meal variety on expected satiation: evidence for a 'perceived volume' heuristic.

    PubMed

    Keenan, Gregory S; Brunstrom, Jeffrey M; Ferriday, Danielle

    2015-06-01

    Meal variety has been shown to increase energy intake in humans by an average of 29%. Historically, research exploring the mechanism underlying this effect has focused on physiological and psychological processes that terminate a meal (e.g., sensory-specific satiety). We sought to explore whether meal variety stimulates intake by influencing pre-meal planning. We know that individuals use prior experience with a food to estimate the extent to which it will deliver fullness. These 'expected satiation' judgments may be straightforward when only one meal component needs to be considered, but it remains unclear how prospective satiation is estimated when a meal comprises multiple items. We hypothesised that people simplify the task by using a heuristic, or 'cognitive shortcut.' Specifically, as within-meal variety increases, expected satiation tends to be based on the perceived volume of food(s) rather than on prior experience. In each trial, participants (N = 68) were shown a plate of food with six buffet food items. Across trials the number of different foods varied in the range one to six. In separate tasks, the participants provided an estimate of their combined expected satiation and volume. When meal variety was high, judgments of perceived volume and expected satiation 'converged.' This is consistent with a common underlying response strategy. By contrast, the low variety meals produced dissociable responses, suggesting that judgments of expected satiation were not governed solely by perceived volume. This evidence for a 'volume heuristic' was especially clear in people who were less familiar with the meal items. Together, these results are important because they expose a novel process by which meal variety might increase food intake in humans.

  11. TORC3: Token-ring clearing heuristic for currency circulation

    NASA Astrophysics Data System (ADS)

    Humes, Carlos, Jr.; Lauretto, Marcelo S.; Nakano, Fábio; Pereira, Carlos A. B.; Rafare, Guilherme F. G.; Stern, Julio Michael

    2012-10-01

    Clearing algorithms are at the core of modern payment systems, facilitating the settling of multilateral credit messages with (near) minimum transfers of currency. Traditional clearing procedures use batch processing based on MILP - mixed-integer linear programming algorithms. The MILP approach demands intensive computational resources; moreover, it is also vulnerable to operational risks generated by possible defaults during the inter-batch period. This paper presents TORC3 - the Token-Ring Clearing Algorithm for Currency Circulation. In contrast to the MILP approach, TORC3 is a real time heuristic procedure, demanding modest computational resources, and able to completely shield the clearing operation against the participating agents' risk of default.

  12. Universal area product for black holes: A heuristic argument

    NASA Astrophysics Data System (ADS)

    Page, Don N.; Shoom, Andrey A.

    2015-08-01

    We present a heuristic argument for the universal area product: A+A-=(8 π J )2+(4 π Q2)2 for a four-dimensional, stationary, axisymmetric, electrically charged black hole with an arbitrary stationary axisymmetric distribution of external matter (possibly charged), derived by Marcus Ansorg and Jörg Hennig. Here A+ and A- are the areas of the event and Cauchy horizons, and J and Q are the angular momentum and electric charge. Based on this argument, we conjecture that a universal area product holds for higher-dimensional, stationary, multihorizon black objects in the presence of an external stationary charged distribution of matter.

  13. Heuristical Feature Extraction from LIDAR Data and Their Visualization

    NASA Astrophysics Data System (ADS)

    Ghosh, S.; Lohani, B.

    2011-09-01

    Extraction of landscape features from LiDAR data has been studied widely in the past few years. These feature extraction methodologies have been focussed on certain types of features only, namely the bare earth model, buildings principally containing planar roofs, trees and roads. In this paper, we present a methodology to process LiDAR data through DBSCAN, a density based clustering method, which extracts natural and man-made clusters. We then develop heuristics to process these clusters and simplify them to be sent to a visualization engine.

  14. An Empirical Study in the Simulation of Heuristic Error Behavior.

    DTIC Science & Technology

    1986-01-01

    generation (global] procedure initialize.graph.descriptor (var g graph -descriptor); varIi : integer; 0. begin g.depth := 0; g.gsnerated := 0; g expanded...state puzzle-state; var search-tree, graph : node.ptr; var g : graph -descriptor); e%:. " var start, current, c, p node-ptr; open. successor-list node...node.ptr; .e inv- g graph -descriptor; profile-input, profil*-output : text; frequency : array (1..max-heuristics, 0 .max-n. 0.max-k] of integer; profile

  15. Heuristic optimization in penumbral image for high resolution reconstructed image

    SciTech Connect

    Azuma, R.; Nozaki, S.; Fujioka, S.; Chen, Y. W.; Namihira, Y.

    2010-10-15

    Penumbral imaging is a technique which uses the fact that spatial information can be recovered from the shadow or penumbra that an unknown source casts through a simple large circular aperture. The size of the penumbral image on the detector can be mathematically determined as its aperture size, object size, and magnification. Conventional reconstruction methods are very sensitive to noise. On the other hand, the heuristic reconstruction method is very tolerant of noise. However, the aperture size influences the accuracy and resolution of the reconstructed image. In this article, we propose the optimization of the aperture size for the neutron penumbral imaging.

  16. Heuristic-based scheduling algorithm for high level synthesis

    NASA Technical Reports Server (NTRS)

    Mohamed, Gulam; Tan, Han-Ngee; Chng, Chew-Lye

    1992-01-01

    A new scheduling algorithm is proposed which uses a combination of a resource utilization chart, a heuristic algorithm to estimate the minimum number of hardware units based on operator mobilities, and a list-scheduling technique to achieve fast and near optimal schedules. The schedule time of this algorithm is almost independent of the length of mobilities of operators as can be seen from the benchmark example (fifth order digital elliptical wave filter) presented when the cycle time was increased from 17 to 18 and then to 21 cycles. It is implemented in C on a SUN3/60 workstation.

  17. Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

    NASA Technical Reports Server (NTRS)

    Lee, Charles H.; Cheung, Kar-Ming

    2012-01-01

    In this paper, we propose to solve the constrained optimization problem in two phases. The first phase uses heuristic methods such as the ant colony method, particle swarming optimization, and genetic algorithm to seek a near optimal solution among a list of feasible initial populations. The final optimal solution can be found by using the solution of the first phase as the initial condition to the SQP algorithm. We demonstrate the above problem formulation and optimization schemes with a large-scale network that includes the DSN ground stations and a number of spacecraft of deep space missions.

  18. Automatic Overset Grid Generation with Heuristic Feedback Control

    NASA Technical Reports Server (NTRS)

    Robinson, Peter I.

    2001-01-01

    An advancing front grid generation system for structured Overset grids is presented which automatically modifies Overset structured surface grids and control lines until user-specified grid qualities are achieved. The system is demonstrated on two examples: the first refines a space shuttle fuselage control line until global truncation error is achieved; the second advances, from control lines, the space shuttle orbiter fuselage top and fuselage side surface grids until proper overlap is achieved. Surface grids are generated in minutes for complex geometries. The system is implemented as a heuristic feedback control (HFC) expert system which iteratively modifies the input specifications for Overset control line and surface grids. It is developed as an extension of modern control theory, production rules systems and subsumption architectures. The methodology provides benefits over the full knowledge lifecycle of an expert system for knowledge acquisition, knowledge representation, and knowledge execution. The vector/matrix framework of modern control theory systematically acquires and represents expert system knowledge. Missing matrix elements imply missing expert knowledge. The execution of the expert system knowledge is performed through symbolic execution of the matrix algebra equations of modern control theory. The dot product operation of matrix algebra is generalized for heuristic symbolic terms. Constant time execution is guaranteed.

  19. Theoretical Analysis of Heuristic Search Methods for Online POMDPs.

    PubMed

    Ross, Stéphane; Pineau, Joelle; Chaib-Draa, Brahim

    2008-01-01

    Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have also been proposed recently, and proven to be remarkably scalable, but without the theoretical guarantees of their offline counterparts. Thus it seems natural to try to unify offline and online techniques, preserving the theoretical properties of the former, and exploiting the scalability of the latter. In this paper, we provide theoretical guarantees on an anytime algorithm for POMDPs which aims to reduce the error made by approximate offline value iteration algorithms through the use of an efficient online searching procedure. The algorithm uses search heuristics based on an error analysis of lookahead search, to guide the online search towards reachable beliefs with the most potential to reduce error. We provide a general theorem showing that these search heuristics are admissible, and lead to complete and ε-optimal algorithms. This is, to the best of our knowledge, the strongest theoretical result available for online POMDP solution methods. We also provide empirical evidence showing that our approach is also practical, and can find (provably) near-optimal solutions in reasonable time.

  20. A manpower scheduling heuristic for aircraft maintenance application

    NASA Astrophysics Data System (ADS)

    Sze, San-Nah; Sze, Jeeu-Fong; Chiew, Kang-Leng

    2012-09-01

    This research studies a manpower scheduling for aircraft maintenance, focusing on in-flight food loading operation. A group of loading teams with flexible shifts is required to deliver and upload packaged meals from the ground kitchen to aircrafts in multiple trips. All aircrafts must be served within predefined time windows. The scheduling process takes into account of various constraints such as meal break allocation, multi-trip traveling and food exposure time limit. Considering the aircrafts movement and predefined maximum working hours for each loading team, the main objective of this study is to form an efficient roster by assigning a minimum number of loading teams to the aircrafts. We proposed an insertion based heuristic to generate the solutions in a short period of time for large instances. This proposed algorithm is implemented in various stages for constructing trips due to the presence of numerous constraints. The robustness and efficiency of the algorithm is demonstrated in computational results. The results show that the insertion heuristic more efficiently outperforms the company's current practice.

  1. Heuristic theory of nonlocally broken gyro-Bohm scaling

    SciTech Connect

    Waltz, R.E.; Candy, J.

    2005-07-15

    Global gyrokinetic simulations of ion temperature gradient turbulent transport with piecewise-flat profiles are given to illustrate the breaking of gyro-Bohm scaling by a nonlocal mechanism. The nonlocal drainage of the turbulence from unstable regions spreading into stable (or less unstable) regions breaks the gyro-Bohm scaling toward Bohm in unstable regions and toward super-gyro-Bohm in stable (or less unstable) regions. A heuristic model for this nonlocal process is formulated in terms of a nonlocal growth rate resulting from a locally weighted radial average of the local linear ballooning mode growth rate. A nonlocality length L measured in ion gyroradii provides the exponential scale for the local weighting. The nonlocal growth rate can be incorporated into a local gyro-Bohm-scaled transport model in place of the local growth rate. The resulting nonlocal transport model will provide some transport in stable regions. A heuristic theory of this nonlocal transport mechanism based on the partial formation of global modes in toroidal geometry is detailed. The theory argues that the nonlocality length L increases with relative gyroradius and decreases with the linear growth rate.

  2. Exact and heuristic algorithms for weighted cluster editing.

    PubMed

    Rahmann, Sven; Wittkop, Tobias; Baumbach, Jan; Martin, Marcel; Truss, Anke; Böcker, Sebastian

    2007-01-01

    Clustering objects according to given similarity or distance values is a ubiquitous problem in computational biology with diverse applications, e.g., in defining families of orthologous genes, or in the analysis of microarray experiments. While there exists a plenitude of methods, many of them produce clusterings that can be further improved. "Cleaning up" initial clusterings can be formalized as projecting a graph on the space of transitive graphs; it is also known as the cluster editing or cluster partitioning problem in the literature. In contrast to previous work on cluster editing, we allow arbitrary weights on the similarity graph. To solve the so-defined weighted transitive graph projection problem, we present (1) the first exact fixed-parameter algorithm, (2) a polynomial-time greedy algorithm that returns the optimal result on a well-defined subset of "close-to-transitive" graphs and works heuristically on other graphs, and (3) a fast heuristic that uses ideas similar to those from the Fruchterman-Reingold graph layout algorithm. We compare quality and running times of these algorithms on both artificial graphs and protein similarity graphs derived from the 66 organisms of the COG dataset.

  3. Facing the grand challenges through heuristics and mindfulness

    NASA Astrophysics Data System (ADS)

    Powietrzynska, Malgorzata; Tobin, Kenneth; Alexakos, Konstantinos

    2015-03-01

    We address the nature of mindfulness and its salience to education generally and to science education specifically. In a context of the historical embeddedness of mindfulness in Buddhism we discuss research in social neuroscience, presenting evidence for neuronal plasticity of the brain and six emotional styles, which are not biologically predetermined, but are responsive to adaptation through life experiences. We raise questions about the role of science education in mediating the structure and function of the brain. Also, we discuss interventions to increase Mindfulness in Education, including meditation and heuristics, that act as reflexive objects to heighten awareness of characteristics of mindfulness and increase the likelihood of changes in the conduct of social life—increasing the mindfulness of those who engage the characteristics included in the heuristic. We present mindfulness and the development of a toolkit for ameliorating emotions when and as necessary as a component of a science curriculum that orientates toward wellness and sustainability. We advocate for changes in the nature of science education to reflect the priorities of the twenty first century that relate to sustainability of the living and nonliving universe and wellness of sentient beings.

  4. An Action Dependent Heuristic Dynamic Programming-controlled Superconducting Magnetic Energy Storage for Transient Stability Augmentation

    NASA Astrophysics Data System (ADS)

    Wang, Xinpu; Yang, Jun; Zhang, Xiaodong; Yu, Xiaopeng

    To enhance the stability of power system, the active power and reactive power can be absorbed from or released to Superconducting magnetic energy storage (SMES) unit according to system power requirements. This paper proposes a control strategy based on action dependent heuristic dynamic programing (ADHDP) which can control SMES to improve the stability of electric power system with on-line learning ability. Based on back propagation (BP) neural network, ADHDP approximates the optimal control solution of nonlinear system through iteration step by step. This on-line learning ability improves its performance by learning from its own mistakes through reinforcement signal from external environment, so that it can adjust the neural network weights according to the back propagation error to achieve optimal control performance. To investigate the effectiveness of the proposed control strategy, simulation tests are carried out in Matlab/Simulink. And a conventional Proportional-Integral (PI) controlled method is used to compare the performance of ADHDP. Simulation results show that the proposed controller demonstrates superior damping performance on power system oscillation caused by three-phase fault and wind power fluctuation over the PI controller.

  5. Avoiding reification. Heuristic effectiveness of mathematics and the prediction of the Ω- particle

    NASA Astrophysics Data System (ADS)

    Ginammi, Michele

    2016-02-01

    According to Steiner (1998), in contemporary physics new important discoveries are often obtained by means of strategies which rely on purely formal mathematical considerations. In such discoveries, mathematics seems to have a peculiar and controversial role, which apparently cannot be accounted for by means of standard methodological criteria. M. Gell-Mann and Y. Ne'eman's prediction of the Ω- particle is usually considered a typical example of application of this kind of strategy. According to Bangu (2008), this prediction is apparently based on the employment of a highly controversial principle-what he calls the "reification principle". Bangu himself takes this principle to be methodologically unjustifiable, but still indispensable to make the prediction logically sound. In the present paper I will offer a new reconstruction of the reasoning that led to this prediction. By means of this reconstruction, I will show that we do not need to postulate any "reificatory" role of mathematics in contemporary physics and I will contextually clarify the representative and heuristic role of mathematics in science.

  6. Social Outcomes in Childhood Brain Disorder: A Heuristic Integration of Social Neuroscience and Developmental Psychology

    ERIC Educational Resources Information Center

    Yeates, Keith Owen; Bigler, Erin D.; Dennis, Maureen; Gerhardt, Cynthia A.; Rubin, Kenneth H.; Stancin, Terry; Taylor, H. Gerry; Vannatta, Kathryn

    2007-01-01

    The authors propose a heuristic model of the social outcomes of childhood brain disorder that draws on models and methods from both the emerging field of social cognitive neuroscience and the study of social competence in developmental psychology/psychopathology. The heuristic model characterizes the relationships between social adjustment, peer…

  7. The Memory State Heuristic: A Formal Model Based on Repeated Recognition Judgments

    ERIC Educational Resources Information Center

    Castela, Marta; Erdfelder, Edgar

    2017-01-01

    The recognition heuristic (RH) theory predicts that, in comparative judgment tasks, if one object is recognized and the other is not, the recognized one is chosen. The memory-state heuristic (MSH) extends the RH by assuming that choices are not affected by recognition judgments per se, but by the memory states underlying these judgments (i.e.,…

  8. Heuristic-Leadership Model: Adapting to Current Training and Changing Times.

    ERIC Educational Resources Information Center

    Danielson, Mary Ann

    A model was developed for training individuals to adapt better to the changing work environment by focusing on the subordinate to supervisor relationship and providing a heuristic approach to leadership. The model emphasizes a heuristic approach to decision-making through the active participation of both members of the dyad. The demand among…

  9. Using Heuristic Task Analysis to Create Web-Based Instructional Design Theory

    ERIC Educational Resources Information Center

    Fiester, Herbert R.

    2010-01-01

    The first purpose of this study was to identify procedural and heuristic knowledge used when creating web-based instruction. The second purpose of this study was to develop suggestions for improving the Heuristic Task Analysis process, a technique for eliciting, analyzing, and representing expertise in cognitively complex tasks. Three expert…

  10. Estimation of Post-Test Probabilities by Residents: Bayesian Reasoning versus Heuristics?

    ERIC Educational Resources Information Center

    Hall, Stacey; Phang, Sen Han; Schaefer, Jeffrey P.; Ghali, William; Wright, Bruce; McLaughlin, Kevin

    2014-01-01

    Although the process of diagnosing invariably begins with a heuristic, we encourage our learners to support their diagnoses by analytical cognitive processes, such as Bayesian reasoning, in an attempt to mitigate the effects of heuristics on diagnosing. There are, however, limited data on the use ± impact of Bayesian reasoning on the accuracy of…

  11. Heuristic Reasoning and Beliefs on Immigration: An Approach to an Intercultural Education Programme

    ERIC Educational Resources Information Center

    Navarro, Santiago Palacios; Lopez de Arechavaleta, Blanca Olalde

    2010-01-01

    People use mental shortcuts to simplify the amount of information they receive from the environment. Heuristic reasoning can be included among these mental shortcuts. In general, heuristics is useful for making fast decisions and judgements, but in certain cases, it may lead to systematic errors because some relevant aspects presented in the given…

  12. Managing Heuristics as a Method of Inquiry in Autobiographical Graphic Design Theses

    ERIC Educational Resources Information Center

    Ings, Welby

    2011-01-01

    This article draws on case studies undertaken in postgraduate research at AUT University, Auckland. It seeks to address a number of issues related to heuristic inquiries employed by graphic design students who use autobiographical approaches when developing research-based theses. For this type of thesis, heuristics as a system of inquiry may…

  13. Effects of Narrated Heuristic Feedback and Gender on College Students' Calculus Problem Solving Performance

    ERIC Educational Resources Information Center

    Xie, Ying; Coffland, David; Yang, Fangyun

    2012-01-01

    Multimodal feedback could promote college students' conceptual, procedural and heuristic knowledge learning. This study used an experimental design to investigate the interaction effects of instructor's narrated feedback (with procedural feedback delivered visually and heuristic feedback auditorily) and gender on their post-test performance of a…

  14. A Behavior Analysis of Individuals' Use of the Fairness Heuristic when Interacting with Groups and Organizations

    ERIC Educational Resources Information Center

    Goltz, Sonia M.

    2013-01-01

    In the present analysis the author utilizes the groups as patches model (Goltz, 2009, 2010) to extend fairness heuristic theory (Lind, 2001) in which the concept of fairness is thought to be a heuristic that allows individuals to match responses to consequences they receive from groups. In this model, individuals who are reviewing possible groups…

  15. Automated detection of heuristics and biases among pathologists in a computer-based system.

    PubMed

    Crowley, Rebecca S; Legowski, Elizabeth; Medvedeva, Olga; Reitmeyer, Kayse; Tseytlin, Eugene; Castine, Melissa; Jukic, Drazen; Mello-Thoms, Claudia

    2013-08-01

    The purpose of this study is threefold: (1) to develop an automated, computer-based method to detect heuristics and biases as pathologists examine virtual slide cases, (2) to measure the frequency and distribution of heuristics and errors across three levels of training, and (3) to examine relationships of heuristics to biases, and biases to diagnostic errors. The authors conducted the study using a computer-based system to view and diagnose virtual slide cases. The software recorded participant responses throughout the diagnostic process, and automatically classified participant actions based on definitions of eight common heuristics and/or biases. The authors measured frequency of heuristic use and bias across three levels of training. Biases studied were detected at varying frequencies, with availability and search satisficing observed most frequently. There were few significant differences by level of training. For representativeness and anchoring, the heuristic was used appropriately as often or more often than it was used in biased judgment. Approximately half of the diagnostic errors were associated with one or more biases. We conclude that heuristic use and biases were observed among physicians at all levels of training using the virtual slide system, although their frequencies varied. The system can be employed to detect heuristic use and to test methods for decreasing diagnostic errors resulting from cognitive biases.

  16. Deriving a Set of Privacy Specific Heuristics for the Assessment of PHRs (Personal Health Records).

    PubMed

    Furano, Riccardo F; Kushniruk, Andre; Barnett, Jeff

    2017-01-01

    With the emergence of personal health record (PHR) platforms becoming more widely available, this research focused on the development of privacy heuristics to assess PHRs regarding privacy. Existing sets of heuristics are typically not application specific and do not address patient-centric privacy as a main concern prior to undergoing PHR procurement. A set of privacy specific heuristics were developed based on a scoping review of the literature. An internet-based commercially available, vendor specific PHR application was evaluated using the derived set of privacy specific heuristics. The proposed set of privacy specific derived heuristics is explored in detail in relation to ISO 29100. The assessment of the internet-based commercially available, vendor specific PHR application indicated numerous violations. These violations were noted within the study. It is argued that the new derived privacy heuristics should be used in addition to Nielsen's well-established set of heuristics. Privacy specific heuristics could be used to assess PHR portal system-level privacy mechanisms in the procurement process of a PHR application and may prove to be a beneficial form of assessment to prevent the selection of a PHR platform with a poor privacy specific interface design.

  17. Towards an Understanding of Instructional Design Heuristics: An Exploratory Delphi Study

    ERIC Educational Resources Information Center

    York, Cindy S.; Ertmer, Peggy A.

    2011-01-01

    Evidence suggests that experienced instructional designers often use heuristics and adapted models when engaged in the instructional design problem-solving process. This study used the Delphi technique to identify a core set of heuristics designers reported as being important to the success of the design process. The overarching purpose of the…

  18. Complexity, Heuristic, and Search Analysis for the Games of Crossings and Epaminondas

    DTIC Science & Technology

    2014-03-27

    second. 40 Next, leveraging heuristics from Lines of Action and the ancient Egyptian game Seega, the evaluation function was modified to take into account...Institute of Technology Air University Air Education and Training Command in Partial Fulfillment of the Requirements for the Degree of Master of...17 2.7.3 History Heuristic . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2.7.4 Transposition Tables

  19. Procedures for Separations within Batches of Values, 1. The Orderly Tool Kit and Some Heuristics

    DTIC Science & Technology

    1989-03-01

    separations within batches of values, I. The orderly tool kit and some heuristics by Thu Hoang* and John W. Tukey** *Universite Rene Descartes ...separations with batches of values, . The orderly tool kit and heuristics Thu Hoang* and John W. Tukey** *Universite Rene Descartes Laboratoire de

  20. Answer first: Applying the heuristic-analytic theory of reasoning to examine student intuitive thinking in the context of physics

    NASA Astrophysics Data System (ADS)

    Kryjevskaia, Mila; Stetzer, MacKenzie R.; Grosz, Nathaniel

    2014-12-01

    We have applied the heuristic-analytic theory of reasoning to interpret inconsistencies in student reasoning approaches to physics problems. This study was motivated by an emerging body of evidence that suggests that student conceptual and reasoning competence demonstrated on one task often fails to be exhibited on another. Indeed, even after instruction specifically designed to address student conceptual and reasoning difficulties identified by rigorous research, many undergraduate physics students fail to build reasoning chains from fundamental principles even though they possess the required knowledge and skills to do so. Instead, they often rely on a variety of intuitive reasoning strategies. In this study, we developed and employed a methodology that allowed for the disentanglement of student conceptual understanding and reasoning approaches through the use of sequences of related questions. We have shown that the heuristic-analytic theory of reasoning can be used to account for, in a mechanistic fashion, the observed inconsistencies in student responses. In particular, we found that students tended to apply their correct ideas in a selective manner that supported a specific and likely anticipated conclusion while neglecting to employ the same ideas to refute an erroneous intuitive conclusion. The observed reasoning patterns were consistent with the heuristic-analytic theory, according to which reasoners develop a "first-impression" mental model and then construct an argument in support of the answer suggested by this model. We discuss implications for instruction and argue that efforts to improve student metacognition, which serves to regulate the interaction between intuitive and analytical reasoning, is likely to lead to improved student reasoning.

  1. Usability Heuristics and Qualitative Indicators for the Usability Evaluation of Touch Screen Ventilator Systems

    NASA Astrophysics Data System (ADS)

    Katre, Dinesh; Bhutkar, Ganesh; Karmarkar, Shekhar

    A ventilator system provides respiratory support to critically ill patients in the Intensive Care Unit. Increasing complexity in the user interface, features and functionalities of ventilator systems can cause medical errors and cost the life of a patient. Therefore, the usability of ventilator systems is most crucial to ensure patient safety. We have evolved a specialized set of heuristics combined with objectively defined usability indicators for the usability evaluation of touch screen based ventilator systems. Our study presents the heuristic evaluation of three touch screen based ventilator systems manufactured by three different companies. The heuristic evaluation has been performed by four different usability evaluators to ensure the reliability of heuristics proposed in this paper. The specialized set of heuristics linked with user interface components and the objectively defined usability indicators are found more reliable in identifying specific usability problems of ventilator systems.

  2. The power of simplicity: a fast-and-frugal heuristics approach to performance science.

    PubMed

    Raab, Markus; Gigerenzer, Gerd

    2015-01-01

    Performance science is a fairly new multidisciplinary field that integrates performance domains such as sports, medicine, business, and the arts. To give its many branches a structure and its research a direction, it requires a theoretical framework. We demonstrate the applications of this framework with examples from sport and medicine. Because performance science deals mainly with situations of uncertainty rather than known risks, the needed framework can be provided by the fast-and-frugal heuristics approach. According to this approach, experts learn to rely on heuristics in an adaptive way in order to make accurate decisions. We investigate the adaptive use of heuristics in three ways: the descriptive study of the heuristics in the cognitive "adaptive toolbox;" the prescriptive study of their "ecological rationality," that is, the characterization of the situations in which a given heuristic works; and the engineering study of "intuitive design," that is, the design of transparent aids for making better decisions.

  3. Combining factual and heuristic knowledge in knowledge acquisition

    NASA Technical Reports Server (NTRS)

    Gomez, Fernando; Hull, Richard; Karr, Clark; Hosken, Bruce; Verhagen, William

    1992-01-01

    A knowledge acquisition technique that combines heuristic and factual knowledge represented as two hierarchies is described. These ideas were applied to the construction of a knowledge acquisition interface to the Expert System Analyst (OPERA). The goal of OPERA is to improve the operations support of the computer network in the space shuttle launch processing system. The knowledge acquisition bottleneck lies in gathering knowledge from human experts and transferring it to OPERA. OPERA's knowledge acquisition problem is approached as a classification problem-solving task, combining this approach with the use of factual knowledge about the domain. The interface was implemented in a Symbolics workstation making heavy use of windows, pull-down menus, and other user-friendly devices.

  4. Heuristic modeling of macromolecule release from PLGA microspheres

    PubMed Central

    Szlęk, Jakub; Pacławski, Adam; Lau, Raymond; Jachowicz, Renata; Mendyk, Aleksander

    2013-01-01

    Dissolution of protein macromolecules from poly(lactic-co-glycolic acid) (PLGA) particles is a complex process and still not fully understood. As such, there are difficulties in obtaining a predictive model that could be of fundamental significance in design, development, and optimization for medical applications and toxicity evaluation of PLGA-based multiparticulate dosage form. In the present study, two models with comparable goodness of fit were proposed for the prediction of the macromolecule dissolution profile from PLGA micro- and nanoparticles. In both cases, heuristic techniques, such as artificial neural networks (ANNs), feature selection, and genetic programming were employed. Feature selection provided by fscaret package and sensitivity analysis performed by ANNs reduced the original input vector from a total of 300 input variables to 21, 17, 16, and eleven; to achieve a better insight into generalization error, two cut-off points for every method was proposed. The best ANNs model results were obtained by monotone multi-layer perceptron neural network (MON-MLP) networks with a root-mean-square error (RMSE) of 15.4, and the input vector consisted of eleven inputs. The complicated classical equation derived from a database consisting of 17 inputs was able to yield a better generalization error (RMSE) of 14.3. The equation was characterized by four parameters, thus feasible (applicable) to standard nonlinear regression techniques. Heuristic modeling led to the ANN model describing macromolecules release profiles from PLGA microspheres with good predictive efficiency. Moreover genetic programming technique resulted in classical equation with comparable predictability to the ANN model. PMID:24348037

  5. Heuristic reusable dynamic programming: efficient updates of local sequence alignment.

    PubMed

    Hong, Changjin; Tewfik, Ahmed H

    2009-01-01

    Recomputation of the previously evaluated similarity results between biological sequences becomes inevitable when researchers realize errors in their sequenced data or when the researchers have to compare nearly similar sequences, e.g., in a family of proteins. We present an efficient scheme for updating local sequence alignments with an affine gap model. In principle, using the previous matching result between two amino acid sequences, we perform a forward-backward alignment to generate heuristic searching bands which are bounded by a set of suboptimal paths. Given a correctly updated sequence, we initially predict a new score of the alignment path for each contour to select the best candidates among them. Then, we run the Smith-Waterman algorithm in this confined space. Furthermore, our heuristic alignment for an updated sequence shows that it can be further accelerated by using reusable dynamic programming (rDP), our prior work. In this study, we successfully validate "relative node tolerance bound" (RNTB) in the pruned searching space. Furthermore, we improve the computational performance by quantifying the successful RNTB tolerance probability and switch to rDP on perturbation-resilient columns only. In our searching space derived by a threshold value of 90 percent of the optimal alignment score, we find that 98.3 percent of contours contain correctly updated paths. We also find that our method consumes only 25.36 percent of the runtime cost of sparse dynamic programming (sDP) method, and to only 2.55 percent of that of a normal dynamic programming with the Smith-Waterman algorithm.

  6. Use of Heuristics to Facilitate Scientific Discovery Learning in a Simulation Learning Environment in a Physics Domain

    ERIC Educational Resources Information Center

    Veermans, Koen; van Joolingen, Wouter; de Jong, Ton

    2006-01-01

    This article describes a study into the role of heuristic support in facilitating discovery learning through simulation-based learning. The study compares the use of two such learning environments in the physics domain of collisions. In one learning environment (implicit heuristics) heuristics are only used to provide the learner with guidance…

  7. Forging a National Strategy for Combating Terrorism

    DTIC Science & Technology

    2007-11-02

    organization and who are apparently not agents of any state sponsor. The terrorist Ramzi Ahmed Yousef, who is believed to have masterminded the 1993 World...also has a foreign intelligence, Mossad (Hebrew for “institute”), and a military intelligence 26 service, Aman. Shin Bet works closely with Mossad and

  8. Communication patterns and allocation strategies.

    SciTech Connect

    Leung, Vitus Joseph; Mache, Jens Wolfgang; Bunde, David P.

    2004-01-01

    Motivated by observations about job runtimes on the CPlant system, we use a trace-driven microsimulator to begin characterizing the performance of different classes of allocation algorithms on jobs with different communication patterns in space-shared parallel systems with mesh topology. We show that relative performance varies considerably with communication pattern. The Paging strategy using the Hilbert space-filling curve and the Best Fit heuristic performed best across several communication patterns.

  9. A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.

    PubMed

    Hart, Emma; Sim, Kevin

    2016-01-01

    We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics composed of linear sequences of dispatching rules: each rule is represented using a tree structure and is itself evolved. Following a training period, the ensemble is shown to outperform both existing dispatching rules and a standard genetic programming algorithm on a large set of new test instances. In addition, it obtains superior results on a set of 210 benchmark problems from the literature when compared to two state-of-the-art hyper-heuristic approaches. Further analysis of the relationship between heuristics in the evolved ensemble and the instances each solves provides new insights into features that might describe similar instances.

  10. A heuristic solution for the disassembly line balancing problem incorporating sequence dependent costs

    NASA Astrophysics Data System (ADS)

    Lambert, A. J. D.; Gupta, Surendra M.

    2005-11-01

    This paper deals with disassembly sequencing problems subjected to sequence dependent disassembly costs. We present a heuristic and an iterative method based on partial branch and bound concept to solve such problems. Since heuristic methods intrinsically generate suboptimum solutions, we compared the heuristically obtained solutions with the exact solutions to see if they are reasonably good or not. This process, however, is limited to small or perhaps medium sized problems only as the required CPU time for exact methods tends to increase exponentially with the problem size. For the problems tested, we observed that the methods described in this paper generate surprisingly good results using almost negligible amount of CPU time.

  11. A Conceptual Framework and a Heuristic Program for the Credit Assignment Problem.

    DTIC Science & Technology

    1983-02-01

    f-R127 367 R CONCEPTUAL FRAMEWORK AND A HEURISTIC PROGRAM FOR THE i/1 CREDIT ASSIGNMENT..(U) ARIZONA STATE UNIV TEMPE GROUP FOR COMPUTER STUDIES OF...ARIZONA 85287 ,.:" luioltt ulnI 1wt ea. s 04 g o71 I - -I * I . . .,° -4 A CONCEPTUAL FRAMEWORK AND A HEURISTIC PROGRAM POR THE CREDWT A=EGNMENT...Itos ’me 8 -0 8 3 l"’ 4. TITLE (and Subtitle) S. TYPE OF REPORT A CONCEPTUAL FRAMEWORK AND A HEURISTIC PROGRAM INTERIM*, 1 JUL 30 JUN 83 FOR THE CREDIT

  12. Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system.

    PubMed

    Page, Andrew J; Keane, Thomas M; Naughton, Thomas J

    2010-07-01

    We present a multi-heuristic evolutionary task allocation algorithm to dynamically map tasks to processors in a heterogeneous distributed system. It utilizes a genetic algorithm, combined with eight common heuristics, in an effort to minimize the total execution time. It operates on batches of unmapped tasks and can preemptively remap tasks to processors. The algorithm has been implemented on a Java distributed system and evaluated with a set of six problems from the areas of bioinformatics, biomedical engineering, computer science and cryptography. Experiments using up to 150 heterogeneous processors show that the algorithm achieves better efficiency than other state-of-the-art heuristic algorithms.

  13. Parameter identification of robot manipulators: a heuristic particle swarm search approach.

    PubMed

    Yan, Danping; Lu, Yongzhong; Levy, David

    2015-01-01

    Parameter identification of robot manipulators is an indispensable pivotal process of achieving accurate dynamic robot models. Since these kinetic models are highly nonlinear, it is not easy to tackle the matter of identifying their parameters. To solve the difficulty effectively, we herewith present an intelligent approach, namely, a heuristic particle swarm optimization (PSO) algorithm, which we call the elitist learning strategy (ELS) and proportional integral derivative (PID) controller hybridized PSO approach (ELPIDSO). A specified PID controller is designed to improve particles' local and global positions information together with ELS. Parameter identification of robot manipulators is conducted for performance evaluation of our proposed approach. Experimental results clearly indicate the following findings: Compared with standard PSO (SPSO) algorithm, ELPIDSO has improved a lot. It not only enhances the diversity of the swarm, but also features better search effectiveness and efficiency in solving practical optimization problems. Accordingly, ELPIDSO is superior to least squares (LS) method, genetic algorithm (GA), and SPSO algorithm in estimating the parameters of the kinetic models of robot manipulators.

  14. Decision precision or holistic heuristic?: Insights on on-site selection of student nurses and midwives.

    PubMed

    Macduff, Colin; Stephen, Audrey; Taylor, Ruth

    2016-01-01

    Concerns about quality of care delivery in the UK have led to more scrutiny of criteria and methods for the selection of student nurses. However few substantive research studies of on-site selection processes exist. This study elicited and interpreted perspectives on interviewing processes and related decision making involved in on-site selection of student nurses and midwives. Individual and focus group interviews were undertaken with 36 lecturers, 5 clinical staff and 72 students from seven Scottish universities. Enquiry focused primarily on interviewing of candidates on-site. Qualitative content analysis was used as a primary strategy, followed by in-depth thematic analysis. Students had very mixed experiences of interview processes. Staff typically took into account a range of candidate attributes that they valued in order to achieve holistic assessments. These included: interpersonal skills, team working, confidence, problem-solving, aptitude for caring, motivations, and commitment. Staff had mixed views of the validity and reliability of interview processes. A holistic heuristic for overall decision making predominated over belief in the precision of, and evidence base for, particular attribute measurement processes. While the development of measurement tools for particular attributes continues apace, tension between holism and precision is likely to persist within on-site selection procedures.

  15. Heuristics guide the implementation of social preferences in one-shot Prisoner's Dilemma experiments.

    PubMed

    Capraro, Valerio; Jordan, Jillian J; Rand, David G

    2014-10-28

    Cooperation in one-shot anonymous interactions is a widely documented aspect of human behaviour. Here we shed light on the motivations behind this behaviour by experimentally exploring cooperation in a one-shot continuous-strategy Prisoner's Dilemma (i.e. one-shot two-player Public Goods Game). We examine the distribution of cooperation amounts, and how that distribution varies based on the benefit-to-cost ratio of cooperation (b/c). Interestingly, we find a trimodal distribution at all b/c values investigated. Increasing b/c decreases the fraction of participants engaging in zero cooperation and increases the fraction engaging in maximal cooperation, suggesting a role for efficiency concerns. However, a substantial fraction of participants consistently engage in 50% cooperation regardless of b/c. The presence of these persistent 50% cooperators is surprising, and not easily explained by standard models of social preferences. We present evidence that this behaviour is a result of social preferences guided by simple decision heuristics, rather than the rational examination of payoffs assumed by most social preference models. We also find a strong correlation between play in the Prisoner's Dilemma and in a subsequent Dictator Game, confirming previous findings suggesting a common prosocial motivation underlying altruism and cooperation.

  16. Parameter Identification of Robot Manipulators: A Heuristic Particle Swarm Search Approach

    PubMed Central

    Yan, Danping; Lu, Yongzhong; Levy, David

    2015-01-01

    Parameter identification of robot manipulators is an indispensable pivotal process of achieving accurate dynamic robot models. Since these kinetic models are highly nonlinear, it is not easy to tackle the matter of identifying their parameters. To solve the difficulty effectively, we herewith present an intelligent approach, namely, a heuristic particle swarm optimization (PSO) algorithm, which we call the elitist learning strategy (ELS) and proportional integral derivative (PID) controller hybridized PSO approach (ELPIDSO). A specified PID controller is designed to improve particles’ local and global positions information together with ELS. Parameter identification of robot manipulators is conducted for performance evaluation of our proposed approach. Experimental results clearly indicate the following findings: Compared with standard PSO (SPSO) algorithm, ELPIDSO has improved a lot. It not only enhances the diversity of the swarm, but also features better search effectiveness and efficiency in solving practical optimization problems. Accordingly, ELPIDSO is superior to least squares (LS) method, genetic algorithm (GA), and SPSO algorithm in estimating the parameters of the kinetic models of robot manipulators. PMID:26039090

  17. Scalable Heuristics for Planning, Placement and Sizing of Flexible AC Transmission System Devices

    SciTech Connect

    Frolov, Vladmir; Backhaus, Scott N.; Chertkov, Michael

    2015-07-02

    Aiming to relieve transmission grid congestion and improve or extend feasibility domain of the operations, we build optimization heuristics, generalizing standard AC Optimal Power Flow (OPF), for placement and sizing of Flexible Alternating Current Transmission System (FACTS) devices of the Series Compensation (SC) and Static VAR Compensation (SVC) type. One use of these devices is in resolving the case when the AC OPF solution does not exist because of congestion. Another application is developing a long-term investment strategy for placement and sizing of the SC and SVC devices to reduce operational cost and improve power system operation. SC and SVC devices are represented by modification of the transmission line inductances and reactive power nodal corrections respectively. We find one placement and sizing of FACTs devices for multiple scenarios and optimal settings for each scenario simultaneously. Our solution of the nonlinear and nonconvex generalized AC-OPF consists of building a convergent sequence of convex optimizations containing only linear constraints and shows good computational scaling to larger systems. The approach is illustrated on single- and multi-scenario examples of the Matpower case-30 model.

  18. A heuristic expert system for forest fire guidance in Greece.

    PubMed

    Iliadis, Lazaros S; Papastavrou, Anastasios K; Lefakis, Panagiotis D

    2002-07-01

    Forests and forestlands are common inheritance for all Greeks and a piece of the national wealth that must be handed over to the next generations in the best possible condition. After 1974, Greece faces a severe forest fire problem and forest fire forecasting is the process that will enable the Greek ministry of Agriculture to reduce the destruction. This paper describes the basic design principles of an Expert System that performs forest fire forecasting (for the following fire season) and classification of the prefectures of Greece into forest fire risk zones. The Expert system handles uncertainty and uses heuristics in order to produce scenarios based on the presence or absence of various qualitative factors. The initial research focused on the construction of a mathematical model which attempted to describe the annual number of forest fires and burnt area in Greece based on historical data. However this has proven to be impossible using regression analysis and time series. A closer analysis of the fire data revealed that two qualitative factors dramatically affect the number of forest fires and the hectares of burnt areas annually. The first is political stability and national elections and the other is drought cycles. Heuristics were constructed that use political stability and drought cycles, to provide forest fire guidance. Fuzzy logic was applied to produce a fuzzy expected interval for each prefecture of Greece. A fuzzy expected interval is a narrow interval of values that best describes the situation in the country or a part of the country for a certain time period. A successful classification of the prefectures of Greece in forest fire risk zones was done by the system, by comparing the fuzzy expected intervals to each other. The system was tested for the years 1994 and 1995. The testing has clearly shown that the system can predict accurately, the number of forest fires for each prefecture for the following year. The average accuracy was as high as 85

  19. Evaluating Common De-Identification Heuristics for Personal Health Information

    PubMed Central

    Jabbouri, Sam; Sams, Scott; Drouet, Youenn; Power, Michael

    2006-01-01

    Background With the growing adoption of electronic medical records, there are increasing demands for the use of this electronic clinical data in observational research. A frequent ethics board requirement for such secondary use of personal health information in observational research is that the data be de-identified. De-identification heuristics are provided in the Health Insurance Portability and Accountability Act Privacy Rule, funding agency and professional association privacy guidelines, and common practice. Objective The aim of the study was to evaluate whether the re-identification risks due to record linkage are sufficiently low when following common de-identification heuristics and whether the risk is stable across sample sizes and data sets. Methods Two methods were followed to construct identification data sets. Re-identification attacks were simulated on these. For each data set we varied the sample size down to 30 individuals, and for each sample size evaluated the risk of re-identification for all combinations of quasi-identifiers. The combinations of quasi-identifiers that were low risk more than 50% of the time were considered stable. Results The identification data sets we were able to construct were the list of all physicians and the list of all lawyers registered in Ontario, using 1% sampling fractions. The quasi-identifiers of region, gender, and year of birth were found to be low risk more than 50% of the time across both data sets. The combination of gender and region was also found to be low risk more than 50% of the time. We were not able to create an identification data set for the whole population. Conclusions Existing Canadian federal and provincial privacy laws help explain why it is difficult to create an identification data set for the whole population. That such examples of high re-identification risk exist for mainstream professions makes a strong case for not disclosing the high-risk variables and their combinations identified here

  20. A multi-stage heuristic algorithm for matching problem in the modified miniload automated storage and retrieval system of e-commerce

    NASA Astrophysics Data System (ADS)

    Wang, Wenrui; Wu, Yaohua; Wu, Yingying

    2016-05-01

    E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can't fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.

  1. Adapting Nielsen’s Design Heuristics to Dual Processing for Clinical Decision Support

    PubMed Central

    Taft, Teresa; Staes, Catherine; Slager, Stacey; Weir, Charlene

    2016-01-01

    The study objective was to improve the applicability of Nielson’s standard design heuristics for evaluating electronic health record (EHR) alerts and linked ordering support by integrating them with Dual Process theory. Through initial heuristic evaluation and a user study of 7 physicians, usability problems were identified. Through independent mapping of specific usability criteria to support for each of the Dual Cognitive processes (S1 and S2) and deliberation, agreement was reached on mapping criteria. Finally, usability errors from the heuristic and user study were mapped to S1 and S2. Adding a dual process perspective to specific heuristic analysis increases the applicability and relevance of computerized health information design evaluations. This mapping enables designers to measure that their systems are tailored to support attention allocation. System 1 will be supported by improving pattern recognition and saliency, and system 2 through efficiency and control of information access. PMID:28269915

  2. Social welfare as small-scale help: evolutionary psychology and the deservingness heuristic.

    PubMed

    Petersen, Michael Bang

    2012-01-01

    Public opinion concerning social welfare is largely driven by perceptions of recipient deservingness. Extant research has argued that this heuristic is learned from a variety of cultural, institutional, and ideological sources. The present article provides evidence supporting a different view: that the deservingness heuristic is rooted in psychological categories that evolved over the course of human evolution to regulate small-scale exchanges of help. To test predictions made on the basis of this view, a method designed to measure social categorization is embedded in nationally representative surveys conducted in different countries. Across the national- and individual-level differences that extant research has used to explain the heuristic, people categorize welfare recipients on the basis of whether they are lazy or unlucky. This mode of categorization furthermore induces people to think about large-scale welfare politics as its presumed ancestral equivalent: small-scale help giving. The general implications for research on heuristics are discussed.

  3. The White ceiling heuristic and the underestimation of Asian-American income.

    PubMed

    Martin, Chris C; Nezlek, John B

    2014-01-01

    The belief that ethnic majorities dominate ethnic minorities informs research on intergroup processes. This belief can lead to the social heuristic that the ethnic majority sets an upper limit that minority groups cannot surpass, but this possibility has not received much attention. In three studies of perceived income, we examined how this heuristic, which we term the White ceiling heuristic leads people to inaccurately estimate the income of a minority group that surpasses the majority. We found that Asian Americans, whose median income has surpassed White median income for nearly three decades, are still perceived as making less than Whites, with the least accurate estimations being made by people who strongly believe that Whites are privileged. In contrast, income estimates for other minorities were fairly accurate. Thus, perceptions of minorities are shaped both by stereotype content and a heuristic.

  4. The White Ceiling Heuristic and the Underestimation of Asian-American Income

    PubMed Central

    Martin, Chris C.; Nezlek, John B.

    2014-01-01

    The belief that ethnic majorities dominate ethnic minorities informs research on intergroup processes. This belief can lead to the social heuristic that the ethnic majority sets an upper limit that minority groups cannot surpass, but this possibility has not received much attention. In three studies of perceived income, we examined how this heuristic, which we term the White ceiling heuristic leads people to inaccurately estimate the income of a minority group that surpasses the majority. We found that Asian Americans, whose median income has surpassed White median income for nearly three decades, are still perceived as making less than Whites, with the least accurate estimations being made by people who strongly believe that Whites are privileged. In contrast, income estimates for other minorities were fairly accurate. Thus, perceptions of minorities are shaped both by stereotype content and a heuristic. PMID:25268366

  5. A health literacy and usability heuristic evaluation of a mobile consumer health application.

    PubMed

    Monkman, Helen; Kushniruk, Andre

    2013-01-01

    Usability and health literacy are two critical factors in the design and evaluation of consumer health information systems. However, methods for evaluating these two factors in conjunction remain limited. This study adapted a set of existing guidelines for the design of consumer health Web sites into evidence-based evaluation heuristics tailored specifically for mobile consumer health applications. In order to test the approach, a mobile consumer health application (app) was then evaluated using these heuristics. In addition to revealing ways to improve the usability of the system, this analysis identified opportunities to augment the content to make it more understandable by users with limited health literacy. This study successfully demonstrated the utility of converting existing design guidelines into heuristics for the evaluation of usability and health literacy. The heuristics generated could be applied for assessing and revising other existing consumer health information systems.

  6. Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain

    NASA Astrophysics Data System (ADS)

    Anbuudayasankar, S. P.; Ganesh, K.; Lenny Koh, S. C.; Mohandas, K.

    2010-03-01

    A reverse logistics problem, motivated by many real-life applications, is examined where bottles/cans in which products are delivered from a processing depot to customers in one period are available for return to the depot in the following period. The picked-up bottles/cans need to be adjusted in the place of delivery load. This problem is termed as simultaneous delivery and pick-up problem with constrained capacity (SDPC). We develop three unified heuristics based on extended branch and bound heuristic, genetic algorithm and simulated annealing to solve SDPC. These heuristics are also designed to solve standard travelling salesman problem (TSP) and TSP with simultaneous delivery and pick-up (TSDP). We tested the heuristics on standard, derived and randomly generated datasets of TSP, TSDP and SDPC and obtained satisfying results with high convergence in reasonable time.

  7. Does interaction matter? Testing whether a confidence heuristic can replace interaction in collective decision-making.

    PubMed

    Bang, Dan; Fusaroli, Riccardo; Tylén, Kristian; Olsen, Karsten; Latham, Peter E; Lau, Jennifer Y F; Roepstorff, Andreas; Rees, Geraint; Frith, Chris D; Bahrami, Bahador

    2014-05-01

    In a range of contexts, individuals arrive at collective decisions by sharing confidence in their judgements. This tendency to evaluate the reliability of information by the confidence with which it is expressed has been termed the 'confidence heuristic'. We tested two ways of implementing the confidence heuristic in the context of a collective perceptual decision-making task: either directly, by opting for the judgement made with higher confidence, or indirectly, by opting for the faster judgement, exploiting an inverse correlation between confidence and reaction time. We found that the success of these heuristics depends on how similar individuals are in terms of the reliability of their judgements and, more importantly, that for dissimilar individuals such heuristics are dramatically inferior to interaction. Interaction allows individuals to alleviate, but not fully resolve, differences in the reliability of their judgements. We discuss the implications of these findings for models of confidence and collective decision-making.

  8. Design of high-performing hybrid meta-heuristics for unrelated parallel machine scheduling with machine eligibility and precedence constraints

    NASA Astrophysics Data System (ADS)

    Afzalirad, Mojtaba; Rezaeian, Javad

    2016-04-01

    This study involves an unrelated parallel machine scheduling problem in which sequence-dependent set-up times, different release dates, machine eligibility and precedence constraints are considered to minimize total late works. A new mixed-integer programming model is presented and two efficient hybrid meta-heuristics, genetic algorithm and ant colony optimization, combined with the acceptance strategy of the simulated annealing algorithm (Metropolis acceptance rule), are proposed to solve this problem. Manifestly, the precedence constraints greatly increase the complexity of the scheduling problem to generate feasible solutions, especially in a parallel machine environment. In this research, a new corrective algorithm is proposed to obtain the feasibility in all stages of the algorithms. The performance of the proposed algorithms is evaluated in numerical examples. The results indicate that the suggested hybrid ant colony optimization statistically outperformed the proposed hybrid genetic algorithm in solving large-size test problems.

  9. Heuristic cognitive diagnosis when the Q-matrix is unknown.

    PubMed

    Köhn, Hans-Friedrich; Chiu, Chia-Yi; Brusco, Michael J

    2015-05-01

    Cognitive diagnosis models of educational test performance rely on a binary Q-matrix that specifies the associations between individual test items and the cognitive attributes (skills) required to answer those items correctly. Current methods for fitting cognitive diagnosis models to educational test data and assigning examinees to proficiency classes are based on parametric estimation methods such as expectation maximization (EM) and Markov chain Monte Carlo (MCMC) that frequently encounter difficulties in practical applications. In response to these difficulties, non-parametric classification techniques (cluster analysis) have been proposed as heuristic alternatives to parametric procedures. These non-parametric classification techniques first aggregate each examinee's test item scores into a profile of attribute sum scores, which then serve as the basis for clustering examinees into proficiency classes. Like the parametric procedures, the non-parametric classification techniques require that the Q-matrix underlying a given test be known. Unfortunately, in practice, the Q-matrix for most tests is not known and must be estimated to specify the associations between items and attributes, risking a misspecified Q-matrix that may then result in the incorrect classification of examinees. This paper demonstrates that clustering examinees into proficiency classes based on their item scores rather than on their attribute sum-score profiles does not require knowledge of the Q-matrix, and results in a more accurate classification of examinees.

  10. Heuristic Scheduling in Grid Environments: Reducing the Operational Energy Demand

    NASA Astrophysics Data System (ADS)

    Bodenstein, Christian

    In a world where more and more businesses seem to trade in an online market, the supply of online services to the ever-growing demand could quickly reach its capacity limits. Online service providers may find themselves maxed out at peak operation levels during high-traffic timeslots but too little demand during low-traffic timeslots, although the latter is becoming less frequent. At this point deciding which user is allocated what level of service becomes essential. The concept of Grid computing could offer a meaningful alternative to conventional super-computing centres. Not only can Grids reach the same computing speeds as some of the fastest supercomputers, but distributed computing harbors a great energy-saving potential. When scheduling projects in such a Grid environment however, simply assigning one process to a system becomes so complex in calculation that schedules are often too late to execute, rendering their optimizations useless. Current schedulers attempt to maximize the utility, given some sort of constraint, often reverting to heuristics. This optimization often comes at the cost of environmental impact, in this case CO 2 emissions. This work proposes an alternate model of energy efficient scheduling while keeping a respectable amount of economic incentives untouched. Using this model, it is possible to reduce the total energy consumed by a Grid environment using 'just-in-time' flowtime management, paired with ranking nodes by efficiency.

  11. A fast heuristic algorithm for a probe mapping problem.

    PubMed

    Mumey, B

    1997-01-01

    A new heuristic algorithm is presented for mapping probes to locations along the genome, given noisy pairwise distance data as input. The model considered is quite general: The input consists of a collection of probe pairs and a confidence interval for the genomic distance separating each pair. Because the distance intervals are only known with some confidence level, some may be erroneous and must be removed in order to find a consistent map. A novel randomized technique for detecting and removing bad distance intervals is described. The technique could be useful in other contexts where partially erroneous data is inconsistent with the remaining data. These algorithms were motivated by the goal of making probe maps with inter-probe distance confidence intervals estimated from fluorescence in-situ hybridization (FISH) experiments. Experimentation was done on synthetic data sets (with and without errors) and FISH data from a region of human chromosome 4. Problems with up to 100 probes could be solved in several minutes on a fast workstation. In addition to FISH mapping, we describe some other possible applications that fall within the problem model. These include: mapping a backbone structure in folded DNA, finding consensus maps between independent maps covering the same genomic region, and ordering clones in a clone library.

  12. High throughput heuristics for prioritizing human exposure to environmental chemicals.

    PubMed

    Wambaugh, John F; Wang, Anran; Dionisio, Kathie L; Frame, Alicia; Egeghy, Peter; Judson, Richard; Setzer, R Woodrow

    2014-11-04

    The risk posed to human health by any of the thousands of untested anthropogenic chemicals in our environment is a function of both the hazard presented by the chemical and the extent of exposure. However, many chemicals lack estimates of exposure intake, limiting the understanding of health risks. We aim to develop a rapid heuristic method to determine potential human exposure to chemicals for application to the thousands of chemicals with little or no exposure data. We used Bayesian methodology to infer ranges of exposure consistent with biomarkers identified in urine samples from the U.S. population by the National Health and Nutrition Examination Survey (NHANES). We performed linear regression on inferred exposure for demographic subsets of NHANES demarked by age, gender, and weight using chemical descriptors and use information from multiple databases and structure-based calculators. Five descriptors are capable of explaining roughly 50% of the variability in geometric means across 106 NHANES chemicals for all the demographic groups, including children aged 6-11. We use these descriptors to estimate human exposure to 7968 chemicals, the majority of which have no other quantitative exposure prediction. For thousands of chemicals with no other information, this approach allows forecasting of average exposure intake of environmental chemicals.

  13. A Heuristic Approach to Examining Volatile Equilibrium at Titan's Surface

    NASA Technical Reports Server (NTRS)

    Samuelson, Robert E.

    1999-01-01

    R. D. Lorenz, J. I. Lunine, and C. P. McKay have shown in a manuscript accepted for publication that, for a given ethane abundance and surface temperature, the nitrogen and methane abundances in Titan's atmosphere can be calculated, yielding a surface pressure that can be compared with the observed value. This is potentially a very valuable tool for examining the evolution of Titan's climatology. Its validity does depend on two important assumptions, however: 1) that the atmosphere of Titan is in global radiative equilibrium, and 2) that volatiles present are in vapor equilibrium with the surface. The former assumption has been shown to be likely, but the latter has not. Water vapor in the Earth's atmosphere, in fact, is generally not very close to equilibrium in a global sense. In the present work a heuristic approach is used to examine the likelihood that methane vapor is in equilibrium with Titan's surface. Plausible climate scenerios are examined that are consistent with methane vapor abundances derived from Voyager IRIS data. Simple precipitation and surface diffusion models are incorporated into the analysis. It is tentatively inferred that methane may be in surface equilibrium near the poles, but that equilibrium at low latitudes is more difficult to establish.

  14. A bicriteria heuristic for an elective surgery scheduling problem.

    PubMed

    Marques, Inês; Captivo, M Eugénia; Vaz Pato, Margarida

    2015-09-01

    Resource rationalization and reduction of waiting lists for surgery are two main guidelines for hospital units outlined in the Portuguese National Health Plan. This work is dedicated to an elective surgery scheduling problem arising in a Lisbon public hospital. In order to increase the surgical suite's efficiency and to reduce the waiting lists for surgery, two objectives are considered: maximize surgical suite occupation and maximize the number of surgeries scheduled. This elective surgery scheduling problem consists of assigning an intervention date, an operating room and a starting time for elective surgeries selected from the hospital waiting list. Accordingly, a bicriteria surgery scheduling problem arising in the hospital under study is presented. To search for efficient solutions of the bicriteria optimization problem, the minimization of a weighted Chebyshev distance to a reference point is used. A constructive and improvement heuristic procedure specially designed to address the objectives of the problem is developed and results of computational experiments obtained with empirical data from the hospital are presented. This study shows that by using the bicriteria approach presented here it is possible to build surgical plans with very good performance levels. This method can be used within an interactive approach with the decision maker. It can also be easily adapted to other hospitals with similar scheduling conditions.

  15. CHOPIN, a heuristic model for long term transmission expansion planning

    SciTech Connect

    Latorre-Bayona, G. . Dept. de Ingenieria Electrica y Electronica); Perez-Arriaga, I.J. . Inst. de Investigacion Tecnologica)

    1994-11-01

    This paper describes the long term transmission expansion planning model CHOPIN. In CHOPIN, the network expansion is formulated as the static optimization problem of minimizing the global annual cost of electricity production, which is obtained as the sum of the annualized network investment cost, the operation cost and the reliability cost. The solution method takes advantage of the natural decomposition between the investment and operation submodels. The investment submodel is solved by a new heuristic procedure that in practice has invariably yielded the optimal plan. At the operation level CHOPIN optimizes over a multiplicity of scenarios which are characterized by the demand, the hydraulicity and the availability of components. The network is represented by any one out of four options: DC load flow (DCLF), transportation model and two hybrid models. Any of these models may consider the ohmic losses. The model is very efficient computationally; this fact was verified on test examples, as well as on the actual transmission expansion planning of the Spanish system.

  16. Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

    NASA Technical Reports Server (NTRS)

    Cheung, Kar-Ming; Lee, Charles H.

    2012-01-01

    We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

  17. Runway Operations Planning: A Two-Stage Heuristic Algorithm

    NASA Technical Reports Server (NTRS)

    Anagnostakis, Ioannis; Clarke, John-Paul

    2003-01-01

    The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, can also be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. This paper introduces a two stage heuristic algorithm for solving the Runway Operations Planning (ROP) problem. In the first stage, sequences of departure class slots and runway crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program with a Branch & Bound algorithm implementation. Preliminary results from this implementation of the two-stage algorithm on real-world traffic data are presented.

  18. Modern meta-heuristics based on nonlinear physics processes: A review of models and design procedures

    NASA Astrophysics Data System (ADS)

    Salcedo-Sanz, S.

    2016-10-01

    Meta-heuristic algorithms are problem-solving methods which try to find good-enough solutions to very hard optimization problems, at a reasonable computation time, where classical approaches fail, or cannot even been applied. Many existing meta-heuristics approaches are nature-inspired techniques, which work by simulating or modeling different natural processes in a computer. Historically, many of the most successful meta-heuristic approaches have had a biological inspiration, such as evolutionary computation or swarm intelligence paradigms, but in the last few years new approaches based on nonlinear physics processes modeling have been proposed and applied with success. Non-linear physics processes, modeled as optimization algorithms, are able to produce completely new search procedures, with extremely effective exploration capabilities in many cases, which are able to outperform existing optimization approaches. In this paper we review the most important optimization algorithms based on nonlinear physics, how they have been constructed from specific modeling of a real phenomena, and also their novelty in terms of comparison with alternative existing algorithms for optimization. We first review important concepts on optimization problems, search spaces and problems' difficulty. Then, the usefulness of heuristics and meta-heuristics approaches to face hard optimization problems is introduced, and some of the main existing classical versions of these algorithms are reviewed. The mathematical framework of different nonlinear physics processes is then introduced as a preparatory step to review in detail the most important meta-heuristics based on them. A discussion on the novelty of these approaches, their main computational implementation and design issues, and the evaluation of a novel meta-heuristic based on Strange Attractors mutation will be carried out to complete the review of these techniques. We also describe some of the most important application areas, in

  19. A heuristic for the distribution of point counts for random curves over a finite field

    PubMed Central

    Achter, Jeffrey D.; Erman, Daniel; Kedlaya, Kiran S.; Wood, Melanie Matchett; Zureick-Brown, David

    2015-01-01

    How many rational points are there on a random algebraic curve of large genus g over a given finite field ? We propose a heuristic for this question motivated by a (now proven) conjecture of Mumford on the cohomology of moduli spaces of curves; this heuristic suggests a Poisson distribution with mean q+1+1/(q−1). We prove a weaker version of this statement in which g and q tend to infinity, with q much larger than g. PMID:25802415

  20. Analytic and heuristic processes in the detection and resolution of conflict.

    PubMed

    Ferreira, Mário B; Mata, André; Donkin, Christopher; Sherman, Steven J; Ihmels, Max

    2016-10-01

    Previous research with the ratio-bias task found larger response latencies for conflict trials where the heuristic- and analytic-based responses are assumed to be in opposition (e.g., choosing between 1/10 and 9/100 ratios of success) when compared to no-conflict trials where both processes converge on the same response (e.g., choosing between 1/10 and 11/100). This pattern is consistent with parallel dual-process models, which assume that there is effective, rather than lax, monitoring of the output of heuristic processing. It is, however, unclear why conflict resolution sometimes fails. Ratio-biased choices may increase because of a decline in analytical reasoning (leaving heuristic-based responses unopposed) or to a rise in heuristic processing (making it more difficult for analytic processes to override the heuristic preferences). Using the process-dissociation procedure, we found that instructions to respond logically and response speed affected analytic (controlled) processing (C), leaving heuristic processing (H) unchanged, whereas the intuitive preference for large nominators (as assessed by responses to equal ratio trials) affected H but not C. These findings create new challenges to the debate between dual-process and single-process accounts, which are discussed.

  1. Efficiency Improvements in Meta-Heuristic Algorithms to Solve the Optimal Power Flow Problem

    NASA Astrophysics Data System (ADS)

    Reddy, S. Surender; Bijwe, P. R.

    2016-12-01

    This paper proposes the efficient approaches for solving the Optimal Power Flow (OPF) problem using the meta-heuristic algorithms. Mathematically, OPF is formulated as non-linear equality and inequality constrained optimization problem. The main drawback of meta-heuristic algorithm based OPF is the excessive execution time required due to the large number of power flows needed in the solution process. The proposed efficient approaches uses the lower and upper bounds of objective function values. By using this approach, the number of power flows to be performed are reduced substantially, resulting in the solution speed up. The efficiently generated objective function bounds can result in the faster solutions of meta-heuristic algorithms. The original advantages of meta-heuristic algorithms, such as ability to handle complex non-linearities, discontinuities in the objective function, discrete variables handling, and multi-objective optimization, etc., are still available in the proposed efficient approaches. The proposed OPF formulation includes the active and reactive power generation limits, Valve Point Loading (VPL) and Prohibited Operating Zones (POZs) effects of generating units. The effectiveness of proposed approach is examined on IEEE 30, 118 and 300 bus test systems, and the simulation results confirm the efficiency and superiority of the proposed approaches over the other meta-heuristic algorithms. The proposed efficient approach is generic enough to use with any type of meta-heuristic algorithm based OPF.

  2. The heuristic value of redundancy models of aging.

    PubMed

    Boonekamp, Jelle J; Briga, Michael; Verhulst, Simon

    2015-11-01

    Molecular studies of aging aim to unravel the cause(s) of aging bottom-up, but linking these mechanisms to organismal level processes remains a challenge. We propose that complementary top-down data-directed modelling of organismal level empirical findings may contribute to developing these links. To this end, we explore the heuristic value of redundancy models of aging to develop a deeper insight into the mechanisms causing variation in senescence and lifespan. We start by showing (i) how different redundancy model parameters affect projected aging and mortality, and (ii) how variation in redundancy model parameters relates to variation in parameters of the Gompertz equation. Lifestyle changes or medical interventions during life can modify mortality rate, and we investigate (iii) how interventions that change specific redundancy parameters within the model affect subsequent mortality and actuarial senescence. Lastly, as an example of data-directed modelling and the insights that can be gained from this, (iv) we fit a redundancy model to mortality patterns observed by Mair et al. (2003; Science 301: 1731-1733) in Drosophila that were subjected to dietary restriction and temperature manipulations. Mair et al. found that dietary restriction instantaneously reduced mortality rate without affecting aging, while temperature manipulations had more transient effects on mortality rate and did affect aging. We show that after adjusting model parameters the redundancy model describes both effects well, and a comparison of the parameter values yields a deeper insight in the mechanisms causing these contrasting effects. We see replacement of the redundancy model parameters by more detailed sub-models of these parameters as a next step in linking demographic patterns to underlying molecular mechanisms.

  3. On two heuristic viewpoints concerning the study of light

    NASA Astrophysics Data System (ADS)

    Bi, Siwen

    2015-02-01

    It has been a debatable problem that what the essence of light is, and how it is produced. Since the modern times, as James Clerk Maxwell setting the theory of electromagnetic up, the mainstream consciousness was occupied gradually by the wave theory of light. But at the end of 19th century, a series experimental phenomenon weren't precisely explained by the wave theory of light such as photoelectric effect experiment. Then Albert Einstein published his famous paper "On a Heuristic Viewpoint Concerning the Production and Transformation of Light", which laid the foundation of light quantum hypothesis. While solving these problems perfectly, a new problem was caused that because the wave theory and the quantum theory are both applicable to interpret some of the experiment of light, what is the essence of light. This paper first outlines the history of optical development and current status, and states the difficulties and deficiencies of the study of light. Then we put forward the key concept of the paper called lightstring which consults some points of the theory of modern optics and physics which called the optical frequency comb and the string theory, then presents the essence of light based on the light string concept in order to make the concept of photons specific. And then we put forward the production mechanism of light ---- the String-Light effect based on the concept of light string. In this paper, we attempt to put forward a new idea of the study of the essence of light and the production mechanism of it.

  4. Mixed Integer Programming and Heuristic Scheduling for Space Communication

    NASA Technical Reports Server (NTRS)

    Lee, Charles H.; Cheung, Kar-Ming

    2013-01-01

    Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

  5. Using an Enhanced Conflict Map in the Classroom (Photoelectric Effect) Based on Lakatosian Heuristic Principle Strategies

    ERIC Educational Resources Information Center

    Oh, Jun-Young

    2011-01-01

    Researchers have shown that most students resist changes to their core beliefs by offering auxiliary hypotheses at the first sign of the development of conceptual change. Studies have viewed student reaction to discrepant events as an important clue in helping researchers understand not only the structure of alternative concepts (Niaz,…

  6. Cognitive niches: an ecological model of strategy selection.

    PubMed

    Marewski, Julian N; Schooler, Lael J

    2011-07-01

    How do people select among different strategies to accomplish a given task? Across disciplines, the strategy selection problem represents a major challenge. We propose a quantitative model that predicts how selection emerges through the interplay among strategies, cognitive capacities, and the environment. This interplay carves out for each strategy a cognitive niche, that is, a limited number of situations in which the strategy can be applied, simplifying strategy selection. To illustrate our proposal, we consider selection in the context of 2 theories: the simple heuristics framework and the ACT-R (adaptive control of thought-rational) architecture of cognition. From the heuristics framework, we adopt the thesis that people make decisions by selecting from a repertoire of simple decision strategies that exploit regularities in the environment and draw on cognitive capacities, such as memory and time perception. ACT-R provides a quantitative theory of how these capacities adapt to the environment. In 14 simulations and 10 experiments, we consider the choice between strategies that operate on the accessibility of memories and those that depend on elaborate knowledge about the world. Based on Internet statistics, our model quantitatively predicts people's familiarity with and knowledge of real-world objects, the distributional characteristics of the associated speed of memory retrieval, and the cognitive niches of classic decision strategies, including those of the fluency, recognition, integration, lexicographic, and sequential-sampling heuristics. In doing so, the model specifies when people will be able to apply different strategies and how accurate, fast, and effortless people's decisions will be.

  7. Finding minimum gene subsets with heuristic breadth-first search algorithm for robust tumor classification

    PubMed Central

    2012-01-01

    Background Previous studies on tumor classification based on gene expression profiles suggest that gene selection plays a key role in improving the classification performance. Moreover, finding important tumor-related genes with the highest accuracy is a very important task because these genes might serve as tumor biomarkers, which is of great benefit to not only tumor molecular diagnosis but also drug development. Results This paper proposes a novel gene selection method with rich biomedical meaning based on Heuristic Breadth-first Search Algorithm (HBSA) to find as many optimal gene subsets as possible. Due to the curse of dimensionality, this type of method could suffer from over-fitting and selection bias problems. To address these potential problems, a HBSA-based ensemble classifier is constructed using majority voting strategy from individual classifiers constructed by the selected gene subsets, and a novel HBSA-based gene ranking method is designed to find important tumor-related genes by measuring the significance of genes using their occurrence frequencies in the selected gene subsets. The experimental results on nine tumor datasets including three pairs of cross-platform datasets indicate that the proposed method can not only obtain better generalization performance but also find many important tumor-related genes. Conclusions It is found that the frequencies of the selected genes follow a power-law distribution, indicating that only a few top-ranked genes can be used as potential diagnosis biomarkers. Moreover, the top-ranked genes leading to very high prediction accuracy are closely related to specific tumor subtype and even hub genes. Compared with other related methods, the proposed method can achieve higher prediction accuracy with fewer genes. Moreover, they are further justified by analyzing the top-ranked genes in the context of individual gene function, biological pathway, and protein-protein interaction network. PMID:22830977

  8. Usability of a Patient Education and Motivation Tool Using Heuristic Evaluation

    PubMed Central

    Arora, Mohit; Dai, Liwei; Price, Kathleen; Vizer, Lisa; Sears, Andrew

    2009-01-01

    Background Computer-mediated educational applications can provide a self-paced, interactive environment to deliver educational content to individuals about their health condition. These programs have been used to deliver health-related information about a variety of topics, including breast cancer screening, asthma management, and injury prevention. We have designed the Patient Education and Motivation Tool (PEMT), an interactive computer-based educational program based on behavioral, cognitive, and humanistic learning theories. The tool is designed to educate users and has three key components: screening, learning, and evaluation. Objective The objective of this tutorial is to illustrate a heuristic evaluation using a computer-based patient education program (PEMT) as a case study. The aims were to improve the usability of PEMT through heuristic evaluation of the interface; to report the results of these usability evaluations; to make changes based on the findings of the usability experts; and to describe the benefits and limitations of applying usability evaluations to PEMT. Methods PEMT was evaluated by three usability experts using Nielsen’s usability heuristics while reviewing the interface to produce a list of heuristic violations with severity ratings. The violations were sorted by heuristic and ordered from most to least severe within each heuristic. Results A total of 127 violations were identified with a median severity of 3 (range 0 to 4 with 0 = no problem to 4 = catastrophic problem). Results showed 13 violations for visibility (median severity = 2), 38 violations for match between system and real world (median severity = 2), 6 violations for user control and freedom (median severity = 3), 34 violations for consistency and standards (median severity = 2), 11 violations for error severity (median severity = 3), 1 violation for recognition and control (median severity = 3), 7 violations for flexibility and efficiency (median severity = 2), 9 violations

  9. Heuristic field theory of Bose-Einstein condensates

    NASA Astrophysics Data System (ADS)

    Stenholm, Stig

    2002-06-01

    This paper reviews the basic ideas of the field theoretic approach to Bose-Einstein condensation. The central concepts are presented in a historical way, the most important results are given and they are justified by heuristic physical ideas instead of detailed derivations. The mathematical level of rigour is low, and the intuitive relations between the concepts and their physical origin is used to justify the various results. I present the original Bose-Einstein conception of bosons condensing into a macroscopically occupied state. The special features deriving from this situation are discussed, and the concept of long-range order is introduced. Historically the concept of broken symmetry has played a central role in the description of Bose condensates. In this approach the system is described by states with broken particle conservation, which justifies the introduction of a physical phase factor. When interactions are present, this acquires its own dynamic behaviour, which gives rise to the low-lying collective excitations of the system. They can be interpreted as collisionless oscillations of the particle density. The condensate acting as a particle reservoir introduces a coupling between these collective excitations and the single-particle ones, which makes the collective excitations dominate the physics of the system. This justifies the hydrodynamic view of a condensed Bose system, which has been central to both the theoretical approaches and the interpretations of experiments on superfluid helium. The results are derived using both algebraic and perturbative methods; some of the tools from formal many-body theory are summarized in the appendix. The treatment approaches most issues from a bulk material point of view, but I also keep the possibility open to apply the results to the topical field of trapped condensates. The equation for the order parameter, the Gross-Pitaevski equation, is presented and discussed, but its detailed applications to trapped alkali

  10. Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem.

    PubMed

    Sun, Jianyong; Zhang, Qingfu; Yao, Xin

    2014-03-01

    The construction of promising solutions for NP-hard combinatorial optimization problems (COPs) in meta-heuristics is usually based on three types of information, namely a priori information, a posteriori information learned from visited solutions during the search procedure, and online information collected in the solution construction process. Prior information reflects our domain knowledge about the COPs. Extensive domain knowledge can surely make the search effective, yet it is not always available. Posterior information could guide the meta-heuristics to globally explore promising search areas, but it lacks local guidance capability. On the contrary, online information can capture local structures, and its application can help exploit the search space. In this paper, we studied the effects of using this information on metaheuristic's algorithmic performances for the COPs. The study was illustrated by a set of heuristic algorithms developed for the quadratic assignment problem. We first proposed an improved scheme to extract online local information, then developed a unified framework under which all types of information can be combined readily. Finally, we studied the benefits of the three types of information to meta-heuristics. Conclusions were drawn from the comprehensive study, which can be used as principles to guide the design of effective meta-heuristic in the future.

  11. The power of simplicity: a fast-and-frugal heuristics approach to performance science

    PubMed Central

    Raab, Markus; Gigerenzer, Gerd

    2015-01-01

    Performance science is a fairly new multidisciplinary field that integrates performance domains such as sports, medicine, business, and the arts. To give its many branches a structure and its research a direction, it requires a theoretical framework. We demonstrate the applications of this framework with examples from sport and medicine. Because performance science deals mainly with situations of uncertainty rather than known risks, the needed framework can be provided by the fast-and-frugal heuristics approach. According to this approach, experts learn to rely on heuristics in an adaptive way in order to make accurate decisions. We investigate the adaptive use of heuristics in three ways: the descriptive study of the heuristics in the cognitive “adaptive toolbox;” the prescriptive study of their “ecological rationality,” that is, the characterization of the situations in which a given heuristic works; and the engineering study of “intuitive design,” that is, the design of transparent aids for making better decisions. PMID:26579051

  12. A method for extracting drainage networks with heuristic information from digital elevation models.

    PubMed

    Hou, Kun; Yang, Wei; Sun, Jigui; Sun, Tieli

    2011-01-01

    Depression filling and direction assignment over flat areas are critical issues in hydrologic analysis. This paper proposes a method to handle depressions and flat areas in one procedure. Being different from the traditional raster neighbourhoods processing with little heuristic information, the method is designed to compensate for the inadequate searching information of other methods. The proposed method routes flow through depressions and flat areas by searching for the outlet using the heuristic information. Heuristic information can reveal the general trend slope of the DEM (digital elevation models) and help the proposed method find the outlet accurately. The method is implemented in Pascal and experiments are carried out on actual DEM data. It can be seen from the comparison with the four existing methods that the proposed method can get a closer match result with the ground truth network. Moreover, the proposed method can avoid the generation of the unrealistic parallel drainage lines, unreal drainage lines and spurious terrain features.

  13. Monolingual, bilingual, trilingual: infants' language experience influences the development of a word-learning heuristic.

    PubMed

    Byers-Heinlein, Krista; Werker, Janet F

    2009-09-01

    How infants learn new words is a fundamental puzzle in language acquisition. To guide their word learning, infants exploit systematic word-learning heuristics that allow them to link new words to likely referents. By 17 months, infants show a tendency to associate a novel noun with a novel object rather than a familiar one, a heuristic known as disambiguation. Yet, the developmental origins of this heuristic remain unknown. We compared disambiguation in 17- to 18-month-old infants from different language backgrounds to determine whether language experience influences its development, or whether disambiguation instead emerges as a result of maturation or social experience. Monolinguals showed strong use of disambiguation, bilinguals showed marginal use, and trilinguals showed no disambiguation. The number of languages being learned, but not vocabulary size, predicted performance. The results point to a key role for language experience in the development of disambiguation, and help to distinguish among theoretical accounts of its emergence.

  14. A practical implementation science heuristic for organizational readiness: R = MC2

    PubMed Central

    Cook, Brittany S.; Lamont, Andrea; Wandersman, Abraham; Castellow, Jennifer; Katz, Jason; Beidas, Rinad S.

    2015-01-01

    There are many challenges when an innovation (i.e., a program, process, or policy that is new to an organization) is actively introduced into an organization. One critical component for successful implementation is the organization’s readiness for the innovation. In this article, we propose a practical implementation science heuristic, abbreviated as R= MC2. We propose that organizational readiness involves: 1) the motivation to implement an innovation, 2) the general capacities of an organization, and 3) the innovation-specific capacities needed for a particular innovation. Each of these components can be assessed independently and be used formatively. The heuristic can be used by organizations to assess readiness to implement and by training and technical assistance providers to help build organizational readiness. We present an illustration of the heuristic by showing how behavioral health organizations differ in readiness to implement a peer specialist initiative. Implications for research and practice of organizational readiness are discussed. PMID:26668443

  15. Social Outcomes in Childhood Brain Disorder: A Heuristic Integration of Social Neuroscience and Developmental Psychology

    PubMed Central

    Yeates, Keith Owen; Bigler, Erin D.; Dennis, Maureen; Gerhardt, Cynthia A.; Rubin, Kenneth H.; Stancin, Terry; Taylor, H. Gerry; Vannatta, Kathryn

    2010-01-01

    The authors propose a heuristic model of the social outcomes of childhood brain disorder that draws on models and methods from both the emerging field of social cognitive neuroscience and the study of social competence in developmental psychology/psychopathology. The heuristic model characterizes the relationships between social adjustment, peer interactions and relationships, social problem solving and communication, social-affective and cognitive-executive processes, and their neural substrates. The model is illustrated by research on a specific form of childhood brain disorder, traumatic brain injury. The heuristic model may promote research regarding the neural and cognitive-affective substrates of children’s social development. It also may engender more precise methods of measuring impairments and disabilities in children with brain disorder and suggest ways to promote their social adaptation. PMID:17469991

  16. Application of heuristic satellite plan synthesis algorithms to requirements of the WARC-88 allotment plan

    NASA Technical Reports Server (NTRS)

    Heyward, Ann O.; Reilly, Charles H.; Walton, Eric K.; Mata, Fernando; Olen, Carl

    1990-01-01

    Creation of an Allotment Plan for the Fixed Satellite Service at the 1988 Space World Administrative Radio Conference (WARC) represented a complex satellite plan synthesis problem, involving a large number of planned and existing systems. Solutions to this problem at WARC-88 required the use of both automated and manual procedures to develop an acceptable set of system positions. Development of an Allotment Plan may also be attempted through solution of an optimization problem, known as the Satellite Location Problem (SLP). Three automated heuristic procedures, developed specifically to solve SLP, are presented. The heuristics are then applied to two specific WARC-88 scenarios. Solutions resulting from the fully automated heuristics are then compared with solutions obtained at WARC-88 through a combination of both automated and manual planning efforts.

  17. Proportional reasoning as a heuristic-based process: time constraint and dual task considerations.

    PubMed

    Gillard, Ellen; Van Dooren, Wim; Schaeken, Walter; Verschaffel, Lieven

    2009-01-01

    The present study interprets the overuse of proportional solution methods from a dual process framework. Dual process theories claim that analytic operations involve time-consuming executive processing, whereas heuristic operations are fast and automatic. In two experiments to test whether proportional reasoning is heuristic-based, the participants solved "proportional" problems, for which proportional solution methods provide correct answers, and "nonproportional" problems known to elicit incorrect answers based on the assumption of proportionality. In Experiment 1, the available solution time was restricted. In Experiment 2, the executive resources were burdened with a secondary task. Both manipulations induced an increase in proportional answers and a decrease in correct answers to nonproportional problems. These results support the hypothesis that the choice for proportional methods is heuristic-based.

  18. Knee model: Comparison between heuristic and rigorous solutions for the Schumann resonance problem

    NASA Astrophysics Data System (ADS)

    Galuk, Yu. P.; Nickolaenko, A. P.; Hayakawa, M.

    2015-12-01

    Rapid development of computers allows for application of the direct numerical solution of the global electromagnetic resonance problem in the Earth-ionosphere cavity. Direct numerical solutions exploit the cavity models with the given conductivity profile of atmosphere such as exponential or the knee profiles. These profiles are usually derived from the knee model by Mushtak and Williams (2002) developed for obtaining the realistic ELF propagation constant. It is usually forgotten that profiles of the knee model are only a convenient approximate interpretation for the heuristic relations used in computations. We demonstrate that the rigorous full wave solution of the electromagnetic problem for such profiles deviates from that obtained in the knee model. Therefore the direct numerical solutions must also depart from the heuristic one. We evaluate deviations of the heuristic knee model data from those pertinent to equivalent profile of atmospheric conductivity.

  19. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.

    PubMed

    Drake, John H; Özcan, Ender; Burke, Edmund K

    2016-01-01

    Hyper-heuristics are high-level methodologies for solving complex problems that operate on a search space of heuristics. In a selection hyper-heuristic framework, a heuristic is chosen from an existing set of low-level heuristics and applied to the current solution to produce a new solution at each point in the search. The use of crossover low-level heuristics is possible in an increasing number of general-purpose hyper-heuristic tools such as HyFlex and Hyperion. However, little work has been undertaken to assess how best to utilise it. Since a single-point search hyper-heuristic operates on a single candidate solution, and two candidate solutions are required for crossover, a mechanism is required to control the choice of the other solution. The frameworks we propose maintain a list of potential solutions for use in crossover. We investigate the use of such lists at two conceptual levels. First, crossover is controlled at the hyper-heuristic level where no problem-specific information is required. Second, it is controlled at the problem domain level where problem-specific information is used to produce good-quality solutions to use in crossover. A number of selection hyper-heuristics are compared using these frameworks over three benchmark libraries with varying properties for an NP-hard optimisation problem: the multidimensional 0-1 knapsack problem. It is shown that allowing crossover to be managed at the domain level outperforms managing crossover at the hyper-heuristic level in this problem domain.

  20. Inservice teachers' implementation of the Science Writing Heuristic as a tool for professional growth

    NASA Astrophysics Data System (ADS)

    Omar, Sozan H.

    According to the National Science Standards, science educators have been calling for the inclusion of inquiry-based approaches in science classrooms as a reform for science instruction. Teachers' reluctance to implement inquiry-based approaches may be attributed to the different interpretations of the underpinning theory. Any efforts to help teachers implement effective teaching approaches, therefore, should not target merely additive skills; rather, such efforts should foster fundamental changes of beliefs, knowledge, and habits of practice that teachers deeply hold. This study is a part of a bigger project known as the Science Writing Heuristic (SWH) Partnership Professional Development Project, conducted at Iowa State University in association with the Iowa Department of Education to help improve science teaching. The aim of the project is to help in service science teachers understand and apply a student-oriented instructional approach, using the SWH. The framework of the SWH emphasizes the role of classroom dialogical discussion in students' learning. The role of the teacher when implementing constructivist approaches represented in a student-oriented instruction, differs markedly from traditional approaches, and hence there is a need to study the changes in teaching practice when using this specific tool. The methodological framework of this study combined qualitative and quantitative methods. Interpretative case studies for 18 science teachers are presented. A triangulation strategy was used to provide support for the qualitative findings using three different data collection approaches: observation, questionnaire, and interviews. Quantitative data in the form of student performance on higher order conceptual questions and total test scores were collected. Teachers varied in their implementation of the SWH. Three criteria were constructed to define teachers' levels of implementation: epistemological belief, pedagogical practice, and teacher content knowledge

  1. Application of a hybrid generation/utility assessment heuristic to a class of scheduling problems

    NASA Technical Reports Server (NTRS)

    Heyward, Ann O.

    1989-01-01

    A two-stage heuristic solution approach for a class of multiobjective, n-job, 1-machine scheduling problems is described. Minimization of job-to-job interference for n jobs is sought. The first stage generates alternative schedule sequences by interchanging pairs of schedule elements. The set of alternative sequences can represent nodes of a decision tree; each node is reached via decision to interchange job elements. The second stage selects the parent node for the next generation of alternative sequences through automated paired comparison of objective performance for all current nodes. An application of the heuristic approach to communications satellite systems planning is presented.

  2. Individual differences in use of the recognition heuristic are stable across time, choice objects, domains, and presentation formats.

    PubMed

    Michalkiewicz, Martha; Erdfelder, Edgar

    2016-04-01

    The recognition heuristic (RH) is a simple decision strategy that performs surprisingly well in many domains. According to the RH, people decide on the basis of recognition alone and ignore further knowledge when faced with a recognized and an unrecognized choice object. Previous research has revealed noteworthy individual differences in RH use, suggesting that people have preferences for using versus avoiding this strategy that might be causally linked to cognitive or personality traits. However, trying to explain differences in RH use in terms of traits presupposes temporal and cross-situational stability in use of the RH, an important prerequisite that has not been scrutinized so far. In a series of four experiments, we therefore assessed the stability in RH use across (1) time, (2) choice objects, (3) domains, and (4) presentation formats of the choice objects. In Experiment 1, participants worked on the same inference task and choice objects twice, separated by a delay of either one day or one week. Experiment 2 replicated Experiment 1 using two different object sets from the same domain, whereas Experiment 3 assessed the stability of RH use across two different domains. Finally, in Experiment 4 we investigated stability across verbal and pictorial presentation formats of the choice objects. For all measures of RH use proposed so far, we found strong evidence for both temporal and cross-situational stability in use of the RH. Thus, RH use at least partly reflects a person-specific style of decision making whose determinants await further research.

  3. A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-heuristics with a Case Study in High School Timetabling Problems.

    PubMed

    Kheiri, Ahmed; Keedwell, Ed

    2016-06-03

    Operations research is a well established field that uses computational systems to support decisions in business and public life. Good solutions to operations research problems can make a large difference to the efficient running of businesses and organisations and so the field often searches for new methods to improve these solutions. The high school timetabling problem is an example of an operations research problem and is a challenging task which requires assigning events and resources to time slots subject to a set of constraints. In this paper a new sequence-based selection hyper-heuristic is presented that produces excellent results on a suite of high school timetabling problems. In this study, we present an easy-to-implement, easy-to-maintain and effective sequence-based selection hyper-heuristic to solve high school timetabling problems using a benchmark of unified real-world instances collected from different countries. We show that with sequence-based methods, it is possible to discover new best known solutions for a number of the problems in the timetabling domain. Through this investigation, the usefulness of sequence-based selection hyper-heuristics has been demonstrated and the capability of these methods has been shown to exceed the state-of-the-art.

  4. Professional Development in ESP: A Heuristic for Self-Study.

    ERIC Educational Resources Information Center

    Orr, Thomas

    A plan of action is presented for teachers of English for Special Purposes (ESP) who wish to strengthen their professional competence, either in ESP strategies and techniques or in content areas in which they might teach. It begins with a list of recommended books, journal articles, periodicals, World Wide Web resources, electronic discussion…

  5. Personal Agency in Leadership Learning Using an Australian Heuristic

    ERIC Educational Resources Information Center

    Lovett, Susan; Dempster, Neil; Flückiger, Bev

    2015-01-01

    The starting point for this article is the lack of a robust research base regarding details of what works and why for school leaders' professional development. The article extends work undertaken for a recent commissioned literature review of selected international reports on supporting school leaders' development strategies. The authors reveal…

  6. Question Generation by First Graders: A Heuristic Model.

    ERIC Educational Resources Information Center

    Streiff, Virginia

    This paper describes the design and practical application of a program called "Listening" which has been developed to help young learners of English as a second language gain some strategies for comprehension in their new language. The long-range goal of the program is to develop the learner's active involvement in thinking about the facts he…

  7. Fast and Frugal Heuristics Are Plausible Models of Cognition: Reply to Dougherty, Franco-Watkins, and Thomas (2008)

    ERIC Educational Resources Information Center

    Gigerenzer, Gerd; Hoffrage, Ulrich; Goldstein, Daniel G.

    2008-01-01

    M. R. Dougherty, A. M. Franco-Watkins, and R. Thomas (2008) conjectured that fast and frugal heuristics need an automatic frequency counter for ordering cues. In fact, only a few heuristics order cues, and these orderings can arise from evolutionary, social, or individual learning, none of which requires automatic frequency counting. The idea that…

  8. Playing with Grammar: A Pedagogical Heuristic for Orientating to the Language Content of the Australian Curriculum: English

    ERIC Educational Resources Information Center

    Exley, Beryl; Kervin, Lisa; Mantei, Jessica

    2016-01-01

    In this article we introduce a heuristic for orientating to the language content of the Australian Curriculum: English. Our pedagogical heuristic, called "Playing with Grammar", moves through three separate but interwoven stages: (i) an introduction to the learning experience, (ii) a focus on learning, and (iii) an application of new…

  9. At the Crossroads: Portrait of an Undergraduate Composition Teacher Whose Heuristics Were Transformed by Computer-Technology

    ERIC Educational Resources Information Center

    Grover, Susan Hendricks

    2010-01-01

    Heuristics are deeply-held, tacit knowledge structures connected to our feelings. A heuristic study explores a phenomenon crucial to the researcher's self-discovery (Moustakas, 1990). Like me, many undergraduate composition instructors feel both fear and hope at the crossroads of composition and technology. Technology and composition shape one…

  10. Evaluating the usability of an interactive, bi-lingual, touchscreen-enabled breastfeeding educational programme: application of Nielson's heuristics.

    PubMed

    Joshi, Ashish; Perin, Douglas M Puricelli; Amadi, Chioma; Trout, Kate

    2015-03-05

    The study purpose was to conduct heuristic evaluation of an interactive, bilingual touchscreen-enabled breastfeeding educational programme for Hispanic women living in rural settings in Nebraska. Three raters conducted the evaluation during May 2013 using principles of Nielson's heuristics. A total of 271 screens were evaluated and included: interface (n = 5), programme sections (n = 223) and educational content (n = 43). A total of 97 heuristic violations were identified and were mostly related to interface (8 violations/5 screens) and programme components (89 violations/266 screens). The most common heuristic violations reported were recognition rather than recall (62%, n = 60), consistency and standards (14%, n = 14) and match between the system and real world (9%, n = 9). Majority of the heuristic violations had minor usability issues (73%, n = 71). The only grade 4 heuristic violation reported was due to the visibility of system status in the assessment modules. The results demonstrated that the system was more consistent with Nielsen's usability heuristics. With Nielsen's usability heuristics, it is possible to identify problems in a timely manner, and help facilitate the identification and prioritisation of problems needing urgent attention at an earlier stage before the final deployment of the system.

  11. The Effectiveness of Local Culture-Based Mathematical Heuristic-KR Learning towards Enhancing Student's Creative Thinking Skill

    ERIC Educational Resources Information Center

    Tandiseru, Selvi Rajuaty

    2015-01-01

    The problem in this research is the lack of creative thinking skills of students. One of the learning models that is expected to enhance student's creative thinking skill is the local culture-based mathematical heuristic-KR learning model (LC-BMHLM). Heuristic-KR is a learning model which was introduced by Krulik and Rudnick (1995) that is the…

  12. Trends Concerning Four Misconceptions in Students' Intuitively-Based Probabilistic Reasoning Sourced in the Heuristic of Representativeness

    ERIC Educational Resources Information Center

    Kustos, Paul Nicholas

    2010-01-01

    Student difficulty in the study of probability arises in intuitively-based misconceptions derived from heuristics. One such heuristic, the one of note for this research study, is that of representativeness, in which an individual informally assesses the probability of an event based on the degree to which the event is similar to the sample from…

  13. Heuristic Social Information Processing and Its Implications for Behavioral Measurement: An Example Based on Leadership Categorization.

    ERIC Educational Resources Information Center

    Lord, Robert G.

    Behavioral measurement using untrained organizational members as raters is highly dependent on heuristic or automatic processes. Such processes direct attention, simplify encoding and storage, and guide recall of behavioral information by using pre-existing schema to simplify processing; however, such processing results in systematic rather than…

  14. Heuristics and Biases as Measures of Critical Thinking: Associations with Cognitive Ability and Thinking Dispositions

    ERIC Educational Resources Information Center

    West, Richard F.; Toplak, Maggie E.; Stanovich, Keith E.

    2008-01-01

    In this article, the authors argue that there are a range of effects usually studied within cognitive psychology that are legitimately thought of as aspects of critical thinking: the cognitive biases studied in the heuristics and biases literature. In a study of 793 student participants, the authors found that the ability to avoid these biases was…

  15. Lagrange Multipliers, Adjoint Equations, the Pontryagin Maximum Principle and Heuristic Proofs

    ERIC Educational Resources Information Center

    Ollerton, Richard L.

    2013-01-01

    Deeper understanding of important mathematical concepts by students may be promoted through the (initial) use of heuristic proofs, especially when the concepts are also related back to previously encountered mathematical ideas or tools. The approach is illustrated by use of the Pontryagin maximum principle which is then illuminated by reference to…

  16. One-Reason Decision Making Unveiled: A Measurement Model of the Recognition Heuristic

    ERIC Educational Resources Information Center

    Hilbig, Benjamin E.; Erdfelder, Edgar; Pohl, Rudiger F.

    2010-01-01

    The fast-and-frugal recognition heuristic (RH) theory provides a precise process description of comparative judgments. It claims that, in suitable domains, judgments between pairs of objects are based on recognition alone, whereas further knowledge is ignored. However, due to the confound between recognition and further knowledge, previous…

  17. Ignorance- versus Evidence-Based Decision Making: A Decision Time Analysis of the Recognition Heuristic

    ERIC Educational Resources Information Center

    Hilbig, Benjamin E.; Pohl, Rudiger F.

    2009-01-01

    According to part of the adaptive toolbox notion of decision making known as the recognition heuristic (RH), the decision process in comparative judgments--and its duration--is determined by whether recognition discriminates between objects. By contrast, some recently proposed alternative models predict that choices largely depend on the amount of…

  18. A Comparison of Heuristic Procedures for Minimum within-Cluster Sums of Squares Partitioning

    ERIC Educational Resources Information Center

    Brusco, Michael J.; Steinley, Douglas

    2007-01-01

    Perhaps the most common criterion for partitioning a data set is the minimization of the within-cluster sums of squared deviation from cluster centroids. Although optimal solution procedures for within-cluster sums of squares (WCSS) partitioning are computationally feasible for small data sets, heuristic procedures are required for most practical…

  19. Transformative Learning and Spirituality: A Heuristic Inquiry into the Experience of Spiritual Learning

    ERIC Educational Resources Information Center

    Campbell, Karen P.

    2010-01-01

    The purpose of this heuristic study was to explore the ways in which spirituality informed and impacted educators' own experience of learning as a transformative inner encounter. It inquired into the experience of learning from a spiritual perspective in order to determine the extent to which transformative learning could be described as a…

  20. Judgment of riskiness: impact of personality, naive theories and heuristic thinking among female students.

    PubMed

    Gana, Kamel; Lourel, Marcel; Trouillet, Raphaël; Fort, Isabelle; Mezred, Djamila; Blaison, Christophe; Boudjemadi, Valerian; K'Delant, Pascaline; Ledrich, Julie

    2010-02-01

    Three different studies were conducted to examine the impact of heuristic reasoning in the perception of health-related events: lifetime risk of breast cancer (Study 1, n = 468), subjective life expectancy (Study 2, n = 449), and subjective age of onset of menopause (Study 3, n = 448). In each study, three experimental conditions were set up: control, anchoring heuristic and availability heuristic. Analyses of Covariance controlling for optimism, depressive mood, Locus of Control, hypochondriac tendencies and subjective health, indicated significant effect of experimental conditions on perceived breast-cancer risk (p = 0.000), subjective life expectancy (p = 0.000) and subjective onset of menopause (p = 0.000). Indeed, all findings revealed that availability and anchoring heuristics were being used to estimate personal health-related events. The results revealed that some covariates, hypochondriac tendencies in Study 1, optimism, depressive mood and subjective health in Study 2 and internal locus of control in Study 3 had significant impact on judgment of riskiness.

  1. Autobiographical Elaboration Reduces Memory Distortion: Cognitive Operations and the Distinctiveness Heuristic

    ERIC Educational Resources Information Center

    McDonough, Ian M.; Gallo, David A.

    2008-01-01

    Retrieval monitoring enhances episodic memory accuracy. For instance, false recognition is reduced when participants base their decisions on more distinctive recollections, a retrieval monitoring process called the distinctiveness heuristic. The experiments reported here tested the hypothesis that autobiographical elaboration during study (i.e.,…

  2. Video-Sharing Website Writing as Identity Performance: Heuristic Inquiry into Experiencing Personally Meaningful Music

    ERIC Educational Resources Information Center

    Nicholes, Justin

    2016-01-01

    Enacting heuristic phenomenological inquiry, this article explores the experience of watching a video of a live show of what was personally meaningful music for the researcher. In this study, personally meaningful music, defined as music integral to adolescent identity construction, was sung by and conveyed through the online "discoursal…

  3. Example-Based Learning in Heuristic Domains: A Cognitive Load Theory Account

    ERIC Educational Resources Information Center

    Renkl, Alexander; Hilbert, Tatjana; Schworm, Silke

    2009-01-01

    One classical instructional effect of cognitive load theory (CLT) is the worked-example effect. Although the vast majority of studies have focused on well-structured and algorithmic sub-domains of mathematics or physics, more recent studies have also analyzed learning with examples from complex domains in which only heuristic solution strategies…

  4. Learning to Prove in Geometry: Learning from Heuristic Examples and How It Can Be Supported

    ERIC Educational Resources Information Center

    Hilbert, Tatjana S.; Renkl, Alexander; Kessler, Stephan; Reiss, Kristina

    2008-01-01

    This field experiment tested whether a special type of worked-out examples (i.e., heuristic examples) helps learners develop better conceptual knowledge about mathematical proving and proving skills than a control condition focussing on mathematical contents. Additionally, we analysed the benefits of self-explanation prompts and completion…

  5. Compound Cue Processing within the Fast and Frugal Heuristics Approach in Nonlinearly Separable Environments

    ERIC Educational Resources Information Center

    Garcia-Retamero, Rocio; Hoffrage, Ulrich; Dieckmann, Anja; Ramos, Manuel

    2007-01-01

    Three experiments investigated whether participants used Take The Best (TTB) Configural, a fast and frugal heuristic that processes configurations of cues when making inferences concerning which of two alternatives has a higher criterion value. Participants were presented with a compound cue that was nonlinearly separable from its elements. The…

  6. Heuristic and Analytic Processing: Age Trends and Associations with Cognitive Ability and Cognitive Styles.

    ERIC Educational Resources Information Center

    Kokis, Judite V.; Macpherson, Robyn; Toplak, Maggie E.; West, Richard F.; Stanovich, Keith E.

    2002-01-01

    Examined developmental and individual differences in tendencies to favor analytic over heuristic responses in three tasks (inductive reasoning, deduction under belief bias conditions, probabilistic reasoning) in children varying in age and cognitive ability. Found significant increases in analytic responding with development on first two tasks.…

  7. Creating a movement heuristic for voluntary action: electrophysiological correlates of movement-outcome learning.

    PubMed

    Bednark, Jeffery G; Reynolds, John N J; Stafford, Tom; Redgrave, Peter; Franz, Elizabeth A

    2013-03-01

    Performance of voluntary behavior requires the selection of appropriate movements to attain a desired goal. We propose that the selection of voluntary movements is often contingent on the formation of a movement heuristic or set of internal rules governing movement selection. We used event-related potentials (ERPs) to identify the electrophysiological correlates of the formation of movement heuristics during movement-outcome learning. In two experiments, ERPs from non-learning control tasks were compared to a movement-learning task in which a movement heuristic was formed. We found that novelty P3 amplitude was negatively correlated with improved performance in the movement-learning task. Additionally, enhancement of novelty P3 amplitude was observed during learning even after controlling for memory, attentional and inter-stimulus interval parameters. The feedback correct-related positivity (fCRP) was only elicited by sensory effects following intentional movements. These findings extend previous studies demonstrating the role of the fCRP in performance monitoring and the role of the P3 in learning. In particular, the present study highlights an integrative role of the fCRP and the novelty P3 for the acquisition of movement heuristics. While the fCRP indicates that the goal of intentional movements has been attained, the novelty P3 engages stimulus-driven attentional mechanisms to determine the primary aspects of movement and context required to elicit the sensory effect.

  8. Developing Critical Thinking Skills Using the Science Writing Heuristic in the Chemistry Laboratory

    ERIC Educational Resources Information Center

    Stephenson, N. S.; Sadler-McKnight, N. P.

    2016-01-01

    The Science Writing Heuristic (SWH) laboratory approach is a teaching and learning tool which combines writing, inquiry, collaboration and reflection, and provides scaffolding for the development of critical thinking skills. In this study, the California Critical Thinking Skills Test (CCTST) was used to measure the critical thinking skills of…

  9. What could possibly go wrong? - A heuristic for predicting population health outcomes of interventions.

    PubMed

    Broadbent, Alex

    2011-10-01

    Austin Bradford Hill offers a general heuristic for causal inference in epidemiology, but no general heuristic for prediction is available. This paper seeks to identify a heuristic for predicting the outcome of interventions on population health, informed by the moral context of such interventions. It is suggested that, where available, robust predictions should be preferred, where a robust prediction is one which, according to the best knowledge we are currently able to obtain, could not easily be wrong. To assess whether a prediction is robust, it is suggested that we ask why the predicted outcome will occur, rather than any other outcome. Firstly, if, according to our current knowledge, we cannot identify the likeliest ways that the other outcomes could occur, then the prediction is not robust. And secondly, if, according to our current knowledge, we can identify the likeliest other outcomes but we are unable to say why our predicted outcome will occur rather than these, then, again, our prediction is not robust. Otherwise, it is robust. The inaccurate but memorable short version of the heuristic is, "What could possibly go wrong?"

  10. FocusHeuristics - expression-data-driven network optimization and disease gene prediction.

    PubMed

    Ernst, Mathias; Du, Yang; Warsow, Gregor; Hamed, Mohamed; Endlich, Nicole; Endlich, Karlhans; Murua Escobar, Hugo; Sklarz, Lisa-Madeleine; Sender, Sina; Junghanß, Christian; Möller, Steffen; Fuellen, Georg; Struckmann, Stephan

    2017-02-16

    To identify genes contributing to disease phenotypes remains a challenge for bioinformatics. Static knowledge on biological networks is often combined with the dynamics observed in gene expression levels over disease development, to find markers for diagnostics and therapy, and also putative disease-modulatory drug targets and drugs. The basis of current methods ranges from a focus on expression-levels (Limma) to concentrating on network characteristics (PageRank, HITS/Authority Score), and both (DeMAND, Local Radiality). We present an integrative approach (the FocusHeuristics) that is thoroughly evaluated based on public expression data and molecular disease characteristics provided by DisGeNet. The FocusHeuristics combines three scores, i.e. the log fold change and another two, based on the sum and difference of log fold changes of genes/proteins linked in a network. A gene is kept when one of the scores to which it contributes is above a threshold. Our FocusHeuristics is both, a predictor for gene-disease-association and a bioinformatics method to reduce biological networks to their disease-relevant parts, by highlighting the dynamics observed in expression data. The FocusHeuristics is slightly, but significantly better than other methods by its more successful identification of disease-associated genes measured by AUC, and it delivers mechanistic explanations for its choice of genes.

  11. Balancing Self-Directed Learning with Expert Mentoring: The Science Writing Heuristic Approach

    ERIC Educational Resources Information Center

    Shelley, Mack; Fostvedt, Luke; Gonwa-Reeves, Christopher; Baenziger, Joan; McGill, Michael; Seefeld, Ashley; Hand, Brian; Therrien, William; Taylor, Jonte; Villanueva, Mary Grace

    2012-01-01

    This study focuses on the implementation of the Science Writing Heuristic (SWH) curriculum (Hand, 2007), which combines current understandings of learning as a cognitive and negotiated process with the techniques of argument-based inquiry, critical thinking skills, and writing to strengthen student outcomes. Success of SWH is dependent on the…

  12. Investigating the Decision Heuristics of Candidate Teachers Who Are Different in Their Responsibility Controls

    ERIC Educational Resources Information Center

    Özen, Yener

    2016-01-01

    In this study, decision heuristics used by individuals with different responsibility controls were investigated. In the research, 370 final grade university students studying at Erzincan University Faculty of Education were included. In order to collect data, Internally Controlled Responsibility-Externally Controlled Responsibility Scale of Özen…

  13. Non-Intentional Invention: The Promethean, Trickster, and Improvisational Invention Heuristics of Academic Writers and Poets

    ERIC Educational Resources Information Center

    Wirtz, Jason

    2013-01-01

    This essay introduces a novel way to conceptualize writerly invention -- invention as adopting a non-intentional intellectual stance wherein heuristics are experienced as acting upon the writer as opposed to being enacted by the writer. This view of invention complicates and extends the traditional, Aristotelian view of invention as discreet…

  14. Approach to design neural cryptography: a generalized architecture and a heuristic rule.

    PubMed

    Mu, Nankun; Liao, Xiaofeng; Huang, Tingwen

    2013-06-01

    Neural cryptography, a type of public key exchange protocol, is widely considered as an effective method for sharing a common secret key between two neural networks on public channels. How to design neural cryptography remains a great challenge. In this paper, in order to provide an approach to solve this challenge, a generalized network architecture and a significant heuristic rule are designed. The proposed generic framework is named as tree state classification machine (TSCM), which extends and unifies the existing structures, i.e., tree parity machine (TPM) and tree committee machine (TCM). Furthermore, we carefully study and find that the heuristic rule can improve the security of TSCM-based neural cryptography. Therefore, TSCM and the heuristic rule can guide us to designing a great deal of effective neural cryptography candidates, in which it is possible to achieve the more secure instances. Significantly, in the light of TSCM and the heuristic rule, we further expound that our designed neural cryptography outperforms TPM (the most secure model at present) on security. Finally, a series of numerical simulation experiments are provided to verify validity and applicability of our results.

  15. An Approach to Protein Name Extraction Using Heuristics and a Dictionary.

    ERIC Educational Resources Information Center

    Seki, Kazuhiro; Mostafa, Javed

    2003-01-01

    Proposes a method for protein name extraction from biological texts. The method exploits hand-crafted rules based on heuristics and a set of protein names (dictionary). The approach avoids use of natural language processing tools so as to improve processing speed. Evaluation experiments were conducted in terms of: accuracy, generalizability, and…

  16. Design Heuristics in Academic, Corporate, and Military Instruction: More Similar than Different

    ERIC Educational Resources Information Center

    York, Cindy S.; Ertmer, Peggy A.

    2013-01-01

    Despite the fact that the practice of instructional design (ID) began in the U. S. military (Branson et al., 1975; Jeffrey & Bratton-Jeffrey, 2004; Reiser, 2102), there is little known regarding which design and development heuristics military instructional designers deem important to the ID process. The study reported in this article was…

  17. Learning and Motivation in Multiple Contexts: The Development of a Heuristic Framework

    ERIC Educational Resources Information Center

    Wosnitza, Marold; Beltman, Susan

    2012-01-01

    This paper presents the development of a heuristic framework that integrates three aspects of context (perspective, content and level) from a number of established theoretical approaches. In this framework, context is viewed from different perspectives (subjective and objective), it comprises different contents (physical, social and formal) and it…

  18. Multi-objective Decision Based Available Transfer Capability in Deregulated Power System Using Heuristic Approaches

    NASA Astrophysics Data System (ADS)

    Pasam, Gopi Krishna; Manohar, T. Gowri

    2016-09-01

    Determination of available transfer capability (ATC) requires the use of experience, intuition and exact judgment in order to meet several significant aspects in the deregulated environment. Based on these points, this paper proposes two heuristic approaches to compute ATC. The first proposed heuristic algorithm integrates the five methods known as continuation repeated power flow, repeated optimal power flow, radial basis function neural network, back propagation neural network and adaptive neuro fuzzy inference system to obtain ATC. The second proposed heuristic model is used to obtain multiple ATC values. Out of these, a specific ATC value will be selected based on a number of social, economic, deregulated environmental constraints and related to specific applications like optimization, on-line monitoring, and ATC forecasting known as multi-objective decision based optimal ATC. The validity of results obtained through these proposed methods are scrupulously verified on various buses of the IEEE 24-bus reliable test system. The results presented and derived conclusions in this paper are very useful for planning, operation, maintaining of reliable power in any power system and its monitoring in an on-line environment of deregulated power system. In this way, the proposed heuristic methods would contribute the best possible approach to assess multiple objective ATC using integrated methods.

  19. Using the Science Writing Heuristic Approach to Enhance Student Understanding in Chemical Change and Mixture

    ERIC Educational Resources Information Center

    Kingir, Sevgi; Geban, Omer; Gunel, Murat

    2013-01-01

    This study investigated the effect of the Science Writing Heuristic (SWH) approach on grade 9 students' understanding of chemical change and mixture concepts. Four intact classes taught by two chemistry teachers from a Turkish public high school were selected for the study; one class was assigned as the treatment group, and the other class was…

  20. The Effects of Polya's Heuristic and Diary Writing on Children's Problem Solving

    ERIC Educational Resources Information Center

    Hensberry, Karina K. R.; Jacobbe, Tim

    2012-01-01

    This paper presents the results of a study that aimed at increasing students' problem-solving skills. Polya's (1985) heuristic for problem solving was used and students were required to articulate their thought processes through the use of a structured diary. The diary prompted students to answer questions designed to engage them in the phases of…

  1. Developing Biology Lessons Aimed at Teaching for Understanding: A Domain-Specific Heuristic for Student Teachers

    ERIC Educational Resources Information Center

    Janssen, Fred J. J. M.; Tigelaar, Dineke E. H.; Verloop, Nico

    2009-01-01

    Teaching for understanding requires teachers to organize thought-demanding activities which continually challenge students to apply and extend their prior knowledge. Research shows that student teachers often are unable to develop lessons in teaching for understanding. We explored how a domain-specific heuristic can assist student biology teachers…

  2. Introducing Heuristics of Cultural Dimensions into the Service-Level Technical Communication Classroom

    ERIC Educational Resources Information Center

    Schafer, Robert

    2009-01-01

    A significant problem for practitioners of technical communication is to gain the skills to compete in a global, multicultural work environment. Instructors of technical communication can provide future practitioners with the tools to compete and excel in this global environment by introducing heuristics of cultural dimensions into the…

  3. The Historical Ideal-Type as a Heuristic Device for Academic Storytelling by Sport Scholars

    ERIC Educational Resources Information Center

    Tutka, Patrick; Seifried, Chad

    2015-01-01

    The goal of this research endeavor is to take the previous calls of sport scholars to expand into alternative research approaches (e.g., history, case study, law reviews, philosophy, etc.) and to show how storytelling can be an effective tool through the use of a heuristic device. The present analysis attempts to focus on the usage of the…

  4. Improved direct cover heuristic algorithms for synthesis of multiple-valued logic functions

    NASA Astrophysics Data System (ADS)

    Abd-El-Barr, Mostafa I.; Khan, Esam A.

    2014-02-01

    Multiple-valued logic (MVL) circuits using complementary metal-oxide semiconductor (CMOS) technology have been successfully used in implementing a number of digital signal processing (DSP) applications. Heuristic algorithms using the direct cover (DC) approach have been widely used in synthesising (near) minimal two-level realisation of MVL functions. This article presents three improved DC-based algorithms: weighted direct-cover (WDC), ordered direct-cover (ODC) and fuzzy direct-cover (FDC). In the WDC, a weighted-sum scheme for combining a number of different criteria for minterm and implicant selection was applied. In the ODC, a set of criteria for the selection of appropriate minterm and implicant was applied in a specific order. In the FDC, a fuzzy-based algorithm for minterm and implicant selection was introduced. The proposed heuristic algorithms were tested using two sets of benchmarks. The first consists of 50,000 2-variable 4-valued randomly generated functions and the second consists of 50,000 2-variable 5-valued randomly generated functions. The results obtained using the three heuristic algorithms were compared to those obtained using three existing DC-based techniques. It is shown that the heuristic algorithms outperform existing DC-based approaches in terms of the average number of product terms (a measure of the chip area consumed) required to realise a given MVL function.

  5. Teaching High School Students to Use Heuristics while Reading Historical Texts

    ERIC Educational Resources Information Center

    Nokes, Jeffery D.; Dole, Janice A.; Hacker, Douglas J.

    2007-01-01

    The purpose of this study was to test the effectiveness of different types of instruction and texts on high schools students' learning of (a) history content and (b) a set of heuristics that historians use to think critically about texts. Participants for the study were 128 male and 118 female students, ages 16 and 17 years, from 2 high schools in…

  6. A Comparison of Heuristic and Human Performance on Open Versions of the Traveling Salesperson Problem

    ERIC Educational Resources Information Center

    MacGregor, James N.; Chronicle, Edward P.; Ormerod, Thomas C.

    2006-01-01

    We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points from one side of the array to the other. Like the standard TSP, the task is computationally…

  7. Psychological Plausibility of the Theory of Probabilistic Mental Models and the Fast and Frugal Heuristics

    ERIC Educational Resources Information Center

    Dougherty, Michael R.; Franco-Watkins, Ana M.; Thomas, Rick

    2008-01-01

    The theory of probabilistic mental models (PMM; G. Gigerenzer, U. Hoffrage, & H. Kleinbolting, 1991) has had a major influence on the field of judgment and decision making, with the most recent important modifications to PMM theory being the identification of several fast and frugal heuristics (G. Gigerenzer & D. G. Goldstein, 1996). These…

  8. On the Psychology of the Recognition Heuristic: Retrieval Primacy as a Key Determinant of Its Use

    ERIC Educational Resources Information Center

    Pachur, Thorsten; Hertwig, Ralph

    2006-01-01

    The recognition heuristic is a prime example of a boundedly rational mind tool that rests on an evolved capacity, recognition, and exploits environmental structures. When originally proposed, it was conjectured that no other probabilistic cue reverses the recognition-based inference (D. G. Goldstein & G. Gigerenzer, 2002). More recent studies…

  9. Using the Science Writing Heuristic to Improve Students' Understanding of General Equilibrium

    ERIC Educational Resources Information Center

    Rudd, James A., II; Greenbowe, Thomas J.; Hand, Brian M.

    2007-01-01

    This study compared the performance of students using the Science Writing Heuristic (SWH) approach and students using a standard or traditional laboratory curriculum on lecture exams and a laboratory practical exam on a specific topic, chemical equilibrium. The SWH helps students do inquiry science laboratory work by structuring the laboratory…

  10. Displacements Of Brownian Particles In Terms Of Marian Von Smoluchowski's Heuristic Model

    ERIC Educational Resources Information Center

    Klein, Hermann; Woermann, Dietrich

    2005-01-01

    Albert Einstein's theory of the Brownian motion, Marian von Smoluchowski's heuristic model, and Perrin's experimental results helped to bring the concept of molecules from a state of being a useful hypothesis in chemistry to objects existing in reality. Central to the theory of Brownian motion is the relation between mean particle displacement and…

  11. FocusHeuristics – expression-data-driven network optimization and disease gene prediction

    PubMed Central

    Ernst, Mathias; Du, Yang; Warsow, Gregor; Hamed, Mohamed; Endlich, Nicole; Endlich, Karlhans; Murua Escobar, Hugo; Sklarz, Lisa-Madeleine; Sender, Sina; Junghanß, Christian; Möller, Steffen; Fuellen, Georg; Struckmann, Stephan

    2017-01-01

    To identify genes contributing to disease phenotypes remains a challenge for bioinformatics. Static knowledge on biological networks is often combined with the dynamics observed in gene expression levels over disease development, to find markers for diagnostics and therapy, and also putative disease-modulatory drug targets and drugs. The basis of current methods ranges from a focus on expression-levels (Limma) to concentrating on network characteristics (PageRank, HITS/Authority Score), and both (DeMAND, Local Radiality). We present an integrative approach (the FocusHeuristics) that is thoroughly evaluated based on public expression data and molecular disease characteristics provided by DisGeNet. The FocusHeuristics combines three scores, i.e. the log fold change and another two, based on the sum and difference of log fold changes of genes/proteins linked in a network. A gene is kept when one of the scores to which it contributes is above a threshold. Our FocusHeuristics is both, a predictor for gene-disease-association and a bioinformatics method to reduce biological networks to their disease-relevant parts, by highlighting the dynamics observed in expression data. The FocusHeuristics is slightly, but significantly better than other methods by its more successful identification of disease-associated genes measured by AUC, and it delivers mechanistic explanations for its choice of genes. PMID:28205611

  12. The Lived Experience of Psychotherapists Working with Older Clients: An Heuristic Study

    ERIC Educational Resources Information Center

    Atkins, Dianne; Loewenthal, Del

    2004-01-01

    This paper presents the results of an heuristic study based on the research question: 'How do psychotherapists experience working with older clients?' The question came from the researchers' experience and interest in working with older clients in general practice. It started from the researchers' desire to examine more closely feelings and…

  13. Mediators of the Availability Heuristic in Probability Estimates of Future Events.

    ERIC Educational Resources Information Center

    Levi, Ariel S.; Pryor, John B.

    Individuals often estimate the probability of future events by the ease with which they can recall or cognitively construct relevant instances. Previous research has not precisely identified the cognitive processes mediating this "availability heuristic." Two potential mediators (imagery of the event, perceived reasons or causes for the…

  14. Relating Local to Global Spatial Knowledge: Heuristic Influence of Local Features on Direction Estimates

    ERIC Educational Resources Information Center

    Phillips, Daniel W.; Montello, Daniel R.

    2015-01-01

    Previous research has examined heuristics--simplified decision-making rules-of-thumb--for geospatial reasoning. This study examined at two locations the influence of beliefs about local coastline orientation on estimated directions to local and distant places; estimates were made immediately or after fifteen seconds. This study goes beyond…

  15. Take the First Heuristic, Self-Efficacy, and Decision-Making in Sport

    ERIC Educational Resources Information Center

    Hepler, Teri J.; Feltz, Deborah L.

    2012-01-01

    Can taking the first (TTF) option in decision-making lead to the best decisions in sports contexts? And, is one's decision-making self-efficacy in that context linked to TTF decisions? The purpose of this study was to examine the role of the TTF heuristic and self-efficacy in decision-making on a simulated sports task. Undergraduate and graduate…

  16. A Heuristic Tool for Teaching Business Writing: Self-Assessment, Knowledge Transfer, and Writing Exercises

    ERIC Educational Resources Information Center

    Ortiz, Lorelei A.

    2013-01-01

    To teach effective business communication, instructors must target students’ current weaknesses in writing. One method for doing so is by assigning writing exercises. When used heuristically, writing exercises encourage students to practice self-assessment, self-evaluation, active learning, and knowledge transfer, all while reinforcing the basics…

  17. Twilight of the Slogans: A Heuristic Investigation of Linguistic Memes Using Mixed Methods

    ERIC Educational Resources Information Center

    Duffy, Curt Paul

    2013-01-01

    Slogans, or linguistic memes, are short, memorable phrases that are present in commercial, political, and everyday discourse. Slogans propagate similarly to other memes, or cultural units, through an evolutionary mechanism first proposed by Dawkins (1976). Heuristic inquiry, as presented by Moustakas (1990), provided a template from which to…

  18. Improving Critical Thinking Skills Using Learning Model Logan Avenue Problem Solving (LAPS)-Heuristic

    ERIC Educational Resources Information Center

    Anggrianto, Desi; Churiyah, Madziatul; Arief, Mohammad

    2016-01-01

    This research was conducted in order to know the effect of Logan Avenue Problem Solving (LAPS)-Heuristic learning model towards critical thinking skills of students of class X Office Administration (APK) in SMK Negeri 1 Ngawi, East Java, Indonesia on material curve and equilibrium of demand and supply, subject Introduction to Economics and…

  19. Heuristics in Problem Solving: The Role of Direction in Controlling Search Space

    ERIC Educational Resources Information Center

    Chu, Yun; Li, Zheng; Su, Yong; Pizlo, Zygmunt

    2010-01-01

    Isomorphs of a puzzle called m+m resulted in faster solution times and an easily reproduced solution path in a labeled version of the problem compared to a more difficult binary version. We conjecture that performance is related to a type of heuristic called direction that not only constrains search space in the labeled version, but also…

  20. The Measurement of Creativity: From Definitional Consensus to the Introduction of a New Heuristic Framework

    ERIC Educational Resources Information Center

    Batey, Mark

    2012-01-01

    The scientific study of creativity has proven a difficult undertaking. Researchers have employed a diversity of definitions and measurement methods. As a result, creativity research is underrepresented in the literature and the findings of different studies often prove difficult to draw into a coherent body of understanding. A heuristic framework…

  1. Prachanda: The Mastermind Behind the Maoist Insurgency in Nepal

    DTIC Science & Technology

    2010-12-01

    promoting an outdated ideology and practices in the remote Kingdom of Nepal to supposedly serve the illiterate and economically and socially destitute...Centre) had promoted a violent general strike in Nepal, but the Nepali Congress Party’s government suppressed the strike. The repression by the ruling... hostel facilities, he had to stay outside in a rented house, where he got an opportunity to make connections with communist leaders and had access to

  2. Ernst Rüdin: Hitler's Racial Hygiene Mastermind.

    PubMed

    Joseph, Jay; Wetzel, Norbert A

    2013-01-01

    Ernst Rüdin (1874-1952) was the founder of psychiatric genetics and was also a founder of the German racial hygiene movement. Throughout his long career he played a major role in promoting eugenic ideas and policies in Germany, including helping formulate the 1933 Nazi eugenic sterilization law and other governmental policies directed against the alleged carriers of genetic defects. In the 1940s Rüdin supported the killing of children and mental patients under a Nazi program euphemistically called "Euthanasia." The authors document these crimes and discuss their implications, and also present translations of two publications Rüdin co-authored in 1938 showing his strong support for Hitler and his policies. The authors also document what they see as revisionist historical accounts by leading psychiatric genetic authors. They outline three categories of contemporary psychiatric genetic accounts of Rüdin and his work: (A) those who write about German psychiatric genetics in the Nazi period, but either fail to mention Rüdin at all, or cast him in a favorable light; (B) those who acknowledge that Rüdin helped promote eugenic sterilization and/or may have worked with the Nazis, but generally paint a positive picture of Rüdin's research and fail to mention his participation in the "euthanasia" killing program; and (C) those who have written that Rüdin committed and supported unspeakable atrocities. The authors conclude by calling on the leaders of psychiatric genetics to produce a detailed and complete account of their field's history, including all of the documented crimes committed by Rüdin and his associates.

  3. The cellular mastermind(?) – Mechanotransduction and the nucleus

    PubMed Central

    Kaminski, Ashley; Fedorchak, Gregory R.; Lammerding, Jan

    2015-01-01

    Cells respond to mechanical stimulation by activation of specific signaling pathways and genes that allow the cell to adapt to its dynamic physical environment. How cells sense the various mechanical inputs and translate them into biochemical signals remains an area of active investigation. Recent reports suggest that the cell nucleus may be directly implicated in this cellular mechanotransduction process. In this chapter, we discuss how forces applied to the cell surface and cytoplasm induce changes in nuclear structure and organization, which could directly affect gene expression, while also highlighting the complex interplay between nuclear structural proteins and transcriptional regulators that may further modulate mechanotransduction signaling. Taken together, these findings paint a picture of the nucleus as a central hub in cellular mechanotransduction—both structurally and biochemically—with important implications in physiology and disease. PMID:25081618

  4. Iterative Refinement of a Tailored System for Self-Care Management of Depressive Symptoms in People Living With HIV/AIDS through Heuristic Evaluation and End User Testing

    PubMed Central

    Lai, Tsai-Ya

    2007-01-01

    Background: HIV TIDES — tailored interventions for self-care management of depressive symptoms for people living with HIV/AIDS (PLWHA) — provides assessment of depression and tailored education on self-care strategies to decrease the risk of developing clinical depressive disorders. The iterative refinement of the prototype is an important process during system development to ensure that the design of the system is easy to use and useful. Methods: The heuristic evaluation and usability testing methodologies were used to guide the iteration of the HIV TIDES. Results: The system's compliance with the majority of usability concepts and current standards was confirmed by three experts on human-computer interaction in the heuristic evaluation. However, a number of usability problems were identified. Refinements were made based on experts' recommendations prior to the usability testing. The usability testing included six PLWHA with various levels of computer experience. Data from this iterative testing informed the refinement of key pages and the development of new features. Conclusions: The final version of HIV TIDES consists of 73 messages. The average readability level of the messages is 6.0 based on the Flesch-Kincaid Grade Level and the average word count is 103. PMID:17616431

  5. Simulated trust: a cheap social learning strategy.

    PubMed

    Vanderelst, Dieter; Ahn, René M C; Barakova, Emilia I

    2009-11-01

    Animals use heuristic strategies to determine from which conspecifics to learn socially. This leads to directed social learning. Directed social learning protects them from copying non-adaptive information. So far, the strategies of animals, leading to directed social learning, are assumed to rely on (possibly indirect) inferences about the demonstrator's success. As an alternative to this assumption, we propose a strategy that only uses self-established estimates of the pay-offs of behavior. We evaluate the strategy in a number of agent-based simulations. Critically, the strategy's success is warranted by the inclusion of an incremental learning mechanism. Our findings point out new theoretical opportunities to regulate social learning for animals. More broadly, our simulations emphasize the need to include a realistic learning mechanism in game-theoretic studies of social learning strategies, and call for re-evaluation of previous findings.

  6. Neural substrates of similarity and rule-based strategies in judgment

    PubMed Central

    von Helversen, Bettina; Karlsson, Linnea; Rasch, Björn; Rieskamp, Jörg

    2014-01-01

    Making accurate judgments is a core human competence and a prerequisite for success in many areas of life. Plenty of evidence exists that people can employ different judgment strategies to solve identical judgment problems. In categorization, it has been demonstrated that similarity-based and rule-based strategies are associated with activity in different brain regions. Building on this research, the present work tests whether solving two identical judgment problems recruits different neural substrates depending on people's judgment strategies. Combining cognitive modeling of judgment strategies at the behavioral level with functional magnetic resonance imaging (fMRI), we compare brain activity when using two archetypal judgment strategies: a similarity-based exemplar strategy and a rule-based heuristic strategy. Using an exemplar-based strategy should recruit areas involved in long-term memory processes to a larger extent than a heuristic strategy. In contrast, using a heuristic strategy should recruit areas involved in the application of rules to a larger extent than an exemplar-based strategy. Largely consistent with our hypotheses, we found that using an exemplar-based strategy led to relatively higher BOLD activity in the anterior prefrontal and inferior parietal cortex, presumably related to retrieval and selective attention processes. In contrast, using a heuristic strategy led to relatively higher activity in areas in the dorsolateral prefrontal and the temporal-parietal cortex associated with cognitive control and information integration. Thus, even when people solve identical judgment problems, different neural substrates can be recruited depending on the judgment strategy involved. PMID:25360099

  7. Ontology Alignment Repair through Modularization and Confidence-Based Heuristics.

    PubMed

    Santos, Emanuel; Faria, Daniel; Pesquita, Catia; Couto, Francisco M

    2015-01-01

    Ontology Matching aims at identifying a set of semantic correspondences, called an alignment, between related ontologies. In recent years, there has been a growing interest in efficient and effective matching methods for large ontologies. However, alignments produced for large ontologies are often logically incoherent. It was only recently that the use of repair techniques to improve the coherence of ontology alignments began to be explored. This paper presents a novel modularization technique for ontology alignment repair which extracts fragments of the input ontologies that only contain the necessary classes and relations to resolve all detectable incoherences. The paper presents also an alignment repair algorithm that uses a global repair strategy to minimize both the degree of incoherence and the number of mappings removed from the alignment, while overcoming the scalability problem by employing the proposed modularization technique. Our evaluation shows that our modularization technique produces significantly small fragments of the ontologies and that our repair algorithm produces more complete alignments than other current alignment repair systems, while obtaining an equivalent degree of incoherence. Additionally, we also present a variant of our repair algorithm that makes use of the confidence values of the mappings to improve alignment repair. Our repair algorithm was implemented as part of AgreementMakerLight, a free and open-source ontology matching system.

  8. Ontology Alignment Repair through Modularization and Confidence-Based Heuristics

    PubMed Central

    Santos, Emanuel; Faria, Daniel; Pesquita, Catia; Couto, Francisco M.

    2015-01-01

    Ontology Matching aims at identifying a set of semantic correspondences, called an alignment, between related ontologies. In recent years, there has been a growing interest in efficient and effective matching methods for large ontologies. However, alignments produced for large ontologies are often logically incoherent. It was only recently that the use of repair techniques to improve the coherence of ontology alignments began to be explored. This paper presents a novel modularization technique for ontology alignment repair which extracts fragments of the input ontologies that only contain the necessary classes and relations to resolve all detectable incoherences. The paper presents also an alignment repair algorithm that uses a global repair strategy to minimize both the degree of incoherence and the number of mappings removed from the alignment, while overcoming the scalability problem by employing the proposed modularization technique. Our evaluation shows that our modularization technique produces significantly small fragments of the ontologies and that our repair algorithm produces more complete alignments than other current alignment repair systems, while obtaining an equivalent degree of incoherence. Additionally, we also present a variant of our repair algorithm that makes use of the confidence values of the mappings to improve alignment repair. Our repair algorithm was implemented as part of AgreementMakerLight, a free and open-source ontology matching system. PMID:26710335

  9. Performance tradeoffs in static and dynamic load balancing strategies

    NASA Technical Reports Server (NTRS)

    Iqbal, M. A.; Saltz, J. H.; Bokhart, S. H.

    1986-01-01

    The problem of uniformly distributing the load of a parallel program over a multiprocessor system was considered. A program was analyzed whose structure permits the computation of the optimal static solution. Then four strategies for load balancing were described and their performance compared. The strategies are: (1) the optimal static assignment algorithm which is guaranteed to yield the best static solution, (2) the static binary dissection method which is very fast but sub-optimal, (3) the greedy algorithm, a static fully polynomial time approximation scheme, which estimates the optimal solution to arbitrary accuracy, and (4) the predictive dynamic load balancing heuristic which uses information on the precedence relationships within the program and outperforms any of the static methods. It is also shown that the overhead incurred by the dynamic heuristic is reduced considerably if it is started off with a static assignment provided by either of the other three strategies.

  10. A comparative analysis of static and dynamic load balancing strategies

    NASA Technical Reports Server (NTRS)

    Iqbal, M. Ashraf; Bokhari, Shahid H.; Saltz, Joel H.

    1986-01-01

    The problem of uniformly distributing the load of a parallel program over a multiprocessor system was considered. A program was analyzed whose structure permits the computation of the optimal static solution. Then four strategies for load balancing were described and their performance compared. The strategies are: (1) the optimal static assignment algorithm which is guaranteed to yield the best static solution, (2) the static binary dissection method which is very fast but suboptimal, (3) the greedy algorithm, a static fully polynomial time approximation scheme, which estimates the optimal solution to arbitrary accuracy, and (4) the predictive dynamic load balancing heuristic which uses information on the precedence relationships within the program and outperforms any of the static methods. It is also shown that the overhead incurred by the dynamic heuristic is reduced considerably if it is started off with a static assignment provided by either of the three strategies.

  11. Heuristic Scheme for Home Circuit Grouping andWavelength Assignment in LOBS-HC Networks

    NASA Astrophysics Data System (ADS)

    Yang, Ximin; Yi, Bo; Tang, Wan; Li, Jingcong

    2014-09-01

    Grouping the Home Circuits (HCs) with the same source is a critical issue of Labeled Optical Burst Switching with Home Circuit (LOBS-HC). To maximize the wavelength utilization in LOBS-HC ring networks, an HC grouping and wavelength assignment scheme, called Longest Path Matching and Graph Coloring (LPMGC), is proposed. LPMGC consists of two phases: grouping and wavelength assignment. First, a heuristic algorithm, named Longest Path Matching (LPM), is proposed to group the HCs according to the longest common path matching between HCs and to make each group as large as possible. And then, Graph Coloring (GC) is introduced to assign wavelengths for HC groups. The numerical results show that the proposed scheme performances better than Complementary HC Assignment (CHA) and some other heuristics in both unidirectional and bidirectional LOBS-HC ring networks in terms of wavelength utilization.

  12. A heuristic multi-criteria classification approach incorporating data quality information for choropleth mapping

    PubMed Central

    Sun, Min; Wong, David; Kronenfeld, Barry

    2016-01-01

    Despite conceptual and technology advancements in cartography over the decades, choropleth map design and classification fail to address a fundamental issue: estimates that are statistically indifferent may be assigned to different classes on maps or vice versa. Recently, the class separability concept was introduced as a map classification criterion to evaluate the likelihood that estimates in two classes are statistical different. Unfortunately, choropleth maps created according to the separability criterion usually have highly unbalanced classes. To produce reasonably separable but more balanced classes, we propose a heuristic classification approach to consider not just the class separability criterion but also other classification criteria such as evenness and intra-class variability. A geovisual-analytic package was developed to support the heuristic mapping process to evaluate the trade-off between relevant criteria and to select the most preferable classification. Class break values can be adjusted to improve the performance of a classification. PMID:28286426

  13. RSQRT: AN HEURISTIC FOR ESTIMATING THE NUMBER OF CLUSTERS TO REPORT.

    PubMed

    Carlis, John; Bruso, Kelsey

    2012-03-01

    Clustering can be a valuable tool for analyzing large datasets, such as in e-commerce applications. Anyone who clusters must choose how many item clusters, K, to report. Unfortunately, one must guess at K or some related parameter. Elsewhere we introduced a strongly-supported heuristic, RSQRT, which predicts K as a function of the attribute or item count, depending on attribute scales. We conducted a second analysis where we sought confirmation of the heuristic, analyzing data sets from theUCImachine learning benchmark repository. For the 25 studies where sufficient detail was available, we again found strong support. Also, in a side-by-side comparison of 28 studies, RSQRT best-predicted K and the Bayesian information criterion (BIC) predicted K are the same. RSQRT has a lower cost of O(log log n) versus O(n(2)) for BIC, and is more widely applicable. Using RSQRT prospectively could be much better than merely guessing.

  14. Greedy heuristic algorithm for solving series of eee components classification problems*

    NASA Astrophysics Data System (ADS)

    Kazakovtsev, A. L.; Antamoshkin, A. N.; Fedosov, V. V.

    2016-04-01

    Algorithms based on using the agglomerative greedy heuristics demonstrate precise and stable results for clustering problems based on k- means and p-median models. Such algorithms are successfully implemented in the processes of production of specialized EEE components for using in space systems which include testing each EEE device and detection of homogeneous production batches of the EEE components based on results of the tests using p-median models. In this paper, authors propose a new version of the genetic algorithm with the greedy agglomerative heuristic which allows solving series of problems. Such algorithm is useful for solving the k-means and p-median clustering problems when the number of clusters is unknown. Computational experiments on real data show that the preciseness of the result decreases insignificantly in comparison with the initial genetic algorithm for solving a single problem.

  15. A heuristic to bandwidth allocation and sales limit setting for Internet service providers

    NASA Astrophysics Data System (ADS)

    You, Peng Sheng; Hsieh, Yi-Chih; Ikuta, Seizo

    2012-11-01

    When requesting on-line, many subscribers have experienced the situation in which their on-line requests are denied or their connection speeds are far below their contracted speed limits. This bad customer experience may result from the situation in which Internet service providers (ISPs) accept customers' subscriptions without setting sales limits. As subscribers are potential on-line users, controlling the number of subscribers can be considered as an approach to overcome this problem. The goal of this article is to develop decisions to maximise revenues of ISPs while guaranteeing the expected service quality for distinct service classes. The developed model was a resource constrained nonlinear integer problem, and a heuristic approach was provided to acquire a near-optimal solution. Limited numerical results showed that the proposed heuristic approach can solve this problem efficiently.

  16. Judgement heuristics and bias in evidence interpretation: The effects of computer generated exhibits.

    PubMed

    Norris, Gareth

    2015-01-01

    The increasing use of multi-media applications, trial presentation software and computer generated exhibits (CGE) has raised questions as to the potential impact of the use of presentation technology on juror decision making. A significant amount of the commentary on the manner in which CGE exerts legal influence is largely anecdotal; empirical examinations too are often devoid of established theoretical rationalisations. This paper will examine a range of established judgement heuristics (for example, the attribution error, representativeness, simulation), in order to establish their appropriate application for comprehending legal decisions. Analysis of both past cases and empirical studies will highlight the potential for heuristics and biases to be restricted or confounded by the use of CGE. The paper will conclude with some wider discussion on admissibility, access to justice, and emerging issues in the use of multi-media in court.

  17. A novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems

    NASA Astrophysics Data System (ADS)

    Abtahi, Amir-Reza; Bijari, Afsane

    2017-09-01

    In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition, the proposed hybrid algorithm uses SA to make a balance between exploration and exploitation phases. The proposed hybrid algorithm is compared with several meta-heuristic methods, including genetic algorithm (GA), HS, and ICA on several well-known benchmark instances. The comprehensive experiments and statistical analysis on standard benchmark functions certify the superiority of the proposed method over the other algorithms. The efficacy of the proposed hybrid algorithm is promising and can be used in several real-life engineering and management problems.

  18. A Library of Local Search Heuristics for the Vehicle Routing Problem

    SciTech Connect

    Groer, Christopher S; Golden, Bruce; Edward, Wasil

    2010-01-01

    The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allow one to quickly generate good solutions to VRP instances. The code has a logical, object-oriented design and uses efficient data structures to store and modify solutions. The core of the library is the implementation of seven local search operators that share a similar interface and are designed to be extended to handle additional options with minimal code change. The code is well-documented, is straightforward to compile, and is freely available for download at http://sites.google.com/site/vrphlibrary/ . The distribution of the code contains several applications that can be used to generate solutions to instances of the capacitated VRP.

  19. Local search heuristic for the discrete leader-follower problem with multiple follower objectives

    NASA Astrophysics Data System (ADS)

    Kochetov, Yury; Alekseeva, Ekaterina; Mezmaz, Mohand

    2016-10-01

    We study a discrete bilevel problem, called as well as leader-follower problem, with multiple objectives at the lower level. It is assumed that constraints at the upper level can include variables of both levels. For such ill-posed problem we define feasible and optimal solutions for pessimistic case. A central point of this work is a two stage method to get a feasible solution under the pessimistic case, given a leader decision. The target of the first stage is a follower solution that violates the leader constraints. The target of the second stage is a pessimistic feasible solution. Each stage calls a heuristic and a solver for a series of particular mixed integer programs. The method is integrated inside a local search based heuristic that is designed to find near-optimal leader solutions.

  20. PROOF OF CONCEPT FOR A HUMAN RELIABILITY ANALYSIS METHOD FOR HEURISTIC USABILITY EVALUATION OF SOFTWARE

    SciTech Connect

    Ronald L. Boring; David I. Gertman; Jeffrey C. Joe; Julie L. Marble

    2005-09-01

    An ongoing issue within human-computer interaction (HCI) is the need for simplified or “discount” methods. The current economic slowdown has necessitated innovative methods that are results driven and cost effective. The myriad methods of design and usability are currently being cost-justified, and new techniques are actively being explored that meet current budgets and needs. Recent efforts in human reliability analysis (HRA) are highlighted by the ten-year development of the Standardized Plant Analysis Risk HRA (SPAR-H) method. The SPAR-H method has been used primarily for determining humancentered risk at nuclear power plants. The SPAR-H method, however, shares task analysis underpinnings with HCI. Despite this methodological overlap, there is currently no HRA approach deployed in heuristic usability evaluation. This paper presents an extension of the existing SPAR-H method to be used as part of heuristic usability evaluation in HCI.

  1. A novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems

    NASA Astrophysics Data System (ADS)

    Abtahi, Amir-Reza; Bijari, Afsane

    2016-09-01

    In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition, the proposed hybrid algorithm uses SA to make a balance between exploration and exploitation phases. The proposed hybrid algorithm is compared with several meta-heuristic methods, including genetic algorithm (GA), HS, and ICA on several well-known benchmark instances. The comprehensive experiments and statistical analysis on standard benchmark functions certify the superiority of the proposed method over the other algorithms. The efficacy of the proposed hybrid algorithm is promising and can be used in several real-life engineering and management problems.

  2. An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics

    NASA Technical Reports Server (NTRS)

    Baluja, Shumeet

    1995-01-01

    This report is a repository of the results obtained from a large scale empirical comparison of seven iterative and evolution-based optimization heuristics. Twenty-seven static optimization problems, spanning six sets of problem classes which are commonly explored in genetic algorithm literature, are examined. The problem sets include job-shop scheduling, traveling salesman, knapsack, binpacking, neural network weight optimization, and standard numerical optimization. The search spaces in these problems range from 2368 to 22040. The results indicate that using genetic algorithms for the optimization of static functions does not yield a benefit, in terms of the final answer obtained, over simpler optimization heuristics. Descriptions of the algorithms tested and the encodings of the problems are described in detail for reproducibility.

  3. Integrating heuristic evaluation with cognitive walkthrough: development of a hybrid usability inspection method.

    PubMed

    Kushniruk, Andre W; Monkman, Helen; Tuden, Danica; Bellwood, Paule; Borycki, Elizabeth M

    2015-01-01

    Developing more usable healthcare information systems has become an important goal in health informatics. Although methods from usability engineering have appeared and been effectively applied in the design and evaluation of healthcare systems, there continues to be reports of deployment of unusable systems and issues with adoption of healthcare IT worldwide. In this paper we propose a new cost-effective usability engineering approach for healthcare IT that integrates two of the major usability inspection approaches (heuristic evaluation and cognitive walkthrough) into one combined approach that leverages the advantages of both heuristic evaluation and cognitive walkthrough. The approach will be described as will a pilot application of the method in evaluating the usability of a well-known electronic health record system. Implications and future work will also be described.

  4. A comparison of the decision tree approach and the neural-networks-based heuristic dynamic programming approach for subcircuit extraction problem

    NASA Astrophysics Data System (ADS)

    Zhang, Nian; Wunsch, Donald C., II

    2003-08-01

    The applications of non-standard logic device are increasing fast in the industry. Many of these applications require high speed, low power, functionality and flexibility, which cannot be obtained by standard logic device. These special logic cells can be constructed by the topology design strategy automatically or manually. However, the need arises for the topology design verification. The layout versus schematic (LVS) analysis is an essential part of topology design verification, and subcircuit extraction is one of the operations in the LVS testing. In this paper, we first provided an efficient decision tree approach to the graph isomorphism problem, and then effectively applied it to the subcircuit extraction problem based on the solution to the graph isomorphism problem. To evaluate its performance, we compare it with the neural networks based heuristic dynamic programming algorithm (SubHDP) which is by far one of the fastest algorithms for subcircuit extraction problem.

  5. Improving Multi-Component Maintenance Acquisition with a Greedy Heuristic Local Algorithm

    DTIC Science & Technology

    2013-04-01

    need to improve the decision making process for system sustainment including maintenance, repair, and overhaul ( MRO ) operations and the acquisition of... MRO parts. To help address the link between sustainment policies and acquisition, this work develops a greedy heuristic?based local search algorithm to...concerns, there is a need to improve the decision making process for system sustainment, including maintenance, repair, and overhaul ( MRO

  6. An approach to combining heuristic and qualitative reasoning in an expert system

    NASA Technical Reports Server (NTRS)

    Jiang, Wei-Si; Han, Chia Yung; Tsai, Lian Cheng; Wee, William G.

    1988-01-01

    An approach to combining the heuristic reasoning from shallow knowledge and the qualitative reasoning from deep knowledge is described. The shallow knowledge is represented in production rules and under the direct control of the inference engine. The deep knowledge is represented in frames, which may be put in a relational DataBase Management System. This approach takes advantage of both reasoning schemes and results in improved efficiency as well as expanded problem solving ability.

  7. Algorithms and Heuristics for Time-Window-Constrained Traveling Salesman Problems.

    DTIC Science & Technology

    1985-09-01

    California G0 lI DTIC S-. E CTE 985 THESIS ALGORITHMS AND HEURISTICS FOR TIME-WI NDOW-CONSTRAINED TRAVELING SALESMAN PROBLEMS by Chun, Bock Jin and Lee...strained Traveling Salesman Problems September 1985 6. PERFORMING ORo. REPORT NUMBER 7. AUTHOR() 0. CONTRACT OR GRANT NUMBER(e) Chun, Bock Jin Lee...Penalty Cost, Traveling Salesman Problem, State-Space Relaxation 20. ABSTRACT (Continue on reverse side It necessary and Identify by block ns ber) This

  8. Exploring Heuristics for the Vehicle Routing Problem with Split Deliveries and Time Windows

    DTIC Science & Technology

    2014-09-18

    nomenclature given by Stutzle [63], our MMAS implementation includes α = 1 and β = 2, meaning the heuristic information is considered twice as important as the...later time period, or lost sales , in which case the shortage is not filled. Alternatively, the inventory may be restricted to be non-negative. In... nomenclature offered by Coelho et al. does not adequately describe the MILIRP. The MILIRP models the customer demand deterministically but Coelho

  9. User Interface Problems of a Nationwide Inpatient Information System: A Heuristic Evaluation

    PubMed Central

    Atashi, Alireza; Azizi, Amirabbas; Dadashi, Ali

    2016-01-01

    Summary Introduction While studies have shown that usability evaluation could uncover many design problems of health information systems, the usability of health information systems in developing countries using their native language is poorly studied. The objective of this study was to evaluate the usability of a nationwide inpatient information system used in many academic hospitals in Iran. Material and Methods Three trained usability evaluators independently evaluated the system using Nielsen’s 10 usability heuristics. The evaluators combined identified problems in a single list and independently rated the severity of the problems. We statistically compared the number and severity of problems identified by HIS experienced and non-experienced evaluators. Results A total of 158 usability problems were identified. After removing duplications 99 unique problems were left. The highest mismatch with usability principles was related to “Consistency and standards” heuristic (25%) and the lowest related to “Flexibility and efficiency of use” (4%). The average severity of problems ranged from 2.4 (Major problem) to 3.3 (Catastrophe problem). The experienced evaluator with HIS identified significantly more problems and gave higher severities to problems (p<0.02). Discussion Heuristic Evaluation identified a high number of usability problems in a widely used inpatient information system in many academic hospitals. These problems, if remain unsolved, may waste users’ and patients’ time, increase errors and finally threaten patient’s safety. Many of them can be fixed with simple redesign solutions such as using clear labels and better layouts. This study suggests conducting further studies to confirm the findings concerning effect of evaluator experience on the results of Heuristic Evaluation. PMID:27081409

  10. A Result on the Computational Complexity of Heuristic Estimates for the A Algorithm.

    DTIC Science & Technology

    1983-01-01

    compare these algorithms according to the criterion ’number of node expansions," which is discussed and general - ly accepted in the published...alla Teoria doi Problemi." i i 4 a..... . - 22 - P__ e£jnjs of AICA 1980, Bari, Italy, 177-193 (in Italian). [HNRaph68] Hart, Peter A., Nils J. Nilsson...Intoijigence, 15 (1980), pp. 241-254. [Kibler82] Kibler, Dennis. "Natural Generation of Admissible Heuristics." Technical Report TR-188, Information and

  11. A heuristic based fuzzy reasoning approach for distribution system service restoration

    SciTech Connect

    Hsu, Y.Y.; Kuo, H.C. . Dept. of Electrical Engineering)

    1994-04-01

    A fuzzy reasoning approach is proposed for the service restoration of a distribution system. After the location of a fault has been identified and the faulted zone has been isolated, it is important for the operators to reach a proper service restoration plan in order to restore the electricity service outside the faulted zone. The operators tend to use their past experience and heuristic rules to devise such a restoration plan because it must satisfy a lot of practical needs and objectives such as minimal number of switching operations, no interrupted customers, no overloaded components,..., etc. Thus, service restoration is a multiple-objective problem with some objectives contradictory to each other. In most cases, compromise must be made in order to reach a plan which meets the operators' practical needs. In addition, the operators' needs and heuristic rules are often expressed in imprecise linguistic terms. In this paper, fuzzy set notation is employed to deal with these imprecise linguistic variables and a set of fuzzy reasoning procedures are developed to implement the operators' heuristic rules. These procedures can be employed to solve the multiple-objective problem of service restoration described in imprecise linguistic variables. To demonstrate the effectiveness of the proposed fuzzy reasoning approach, service restoration on a distribution system within the service area of Taipei West District Office of Taiwan Power Company is examined. It is found that a proper restoration plan can be reached very efficiently by the proposed approach.

  12. Experimental test of the mass dependence of the heuristic drift model

    NASA Astrophysics Data System (ADS)

    Makowski, M. A.; Osborne, T. H.; Leonard, A. W.; Bortolon, A.; Nazikian, R.

    2016-10-01

    An empirical scaling for the heat flux scrape-off-layer (SOL) width has been developed, but the physics setting the heat flux width has yet to be established. However, a heuristic model for the width scaling has been developed which is consistent with currently available data. Recent experiments in helium discharges and in which the pedestal and SOL had > 75 % impurity (He, Li, C, N, or Ne) content, provide a means of testing the mass scaling of the heuristic model. Preliminary results indicate either no or a weakly negative scaling of the measured heat flux width with mass. This result lies between the predicted approximate √{ A / Z } (electron drift dominated) and √{ A /Z3 } (ion drift dominated) dependencies predicted by the model, indicating a complicated interplay between the electrons and multiple ion species present in the SOL. These and other results related to the heuristic model will be presented. Supported by US DOE under DE AC52 07NA27344, DE-FC02-04ER54698, and DE-AC02-09CH11466.

  13. A New Improved Hybrid Meta-Heuristics Method for Unit Commitment with Nonlinear Fuel Cost Function

    NASA Astrophysics Data System (ADS)

    Okawa, Kenta; Mori, Hiroyuki

    In this paper, a new improved hybrid meta-heuristic method is proposed to solve the unit commitment problem effectively. The objective is to minimize operation cost while satisfying the power balance constraints and so on. It may be formulated as a nonlinear mixed-integer problem. In other words, the unit commitment problem is hard to solve. Therefore, this paper makes use of a hybrid meta-heuristic method with two layers. Layer 1 determines the on/off conditions of generators with tabu search (TS) while Layer 2 evaluates output of generators with evolutionary particle swarm optimization (EPSO). The construction phase of Greedy Randomized Adaptive Search Procedure (GRASP) is used to create initial feasible solutions efficiently. Three kinds of meta-heuristic methods such as TS, EPSO and GRASP are combined to solve the problem. In addition, a parallel scheme of EPSO is developed to improve the computational efficient as well as the accuracy. The effectiveness of the proposed method is tested in sample systems.

  14. Applied tagmemics: A heuristic approach to the use of graphic aids in technical writing

    NASA Technical Reports Server (NTRS)

    Brownlee, P. P.; Kirtz, M. K.

    1981-01-01

    In technical report writing, two needs which must be met if reports are to be useable by an audience are the language needs and the technical needs of that particular audience. A heuristic analysis helps to decide the most suitable format for information; that is, whether the information should be presented verbally or visually. The report writing process should be seen as an organic whole which can be divided and subdivided according to the writer's purpose, but which always functions as a totality. The tagmemic heuristic, because it itself follows a process of deconstructing and reconstructing information, lends itself to being a useful approach to the teaching of technical writing. By applying the abstract questions this heuristic asks to specific parts of the report. The language and technical needs of the audience are analyzed by examining the viability of the solution within the givens of the corporate structure, and by deciding which graphic or verbal format will best suit the writer's purpose. By following such a method, answers which are both specific and thorough in their range of application are found.

  15. A Dominant Social Comparison Heuristic Unites Alternative Mechanisms for the Evolution of Indirect Reciprocity

    PubMed Central

    Whitaker, Roger M.; Colombo, Gualtiero B.; Allen, Stuart M.; Dunbar, Robin I. M.

    2016-01-01

    Cooperation is a fundamental human trait but our understanding of how it functions remains incomplete. Indirect reciprocity is a particular case in point, where one-shot donations are made to unrelated beneficiaries without any guarantee of payback. Existing insights are largely from two independent perspectives: i) individual-level cognitive behaviour in decision making, and ii) identification of conditions that favour evolution of cooperation. We identify a fundamental connection between these two areas by examining social comparison as a means through which indirect reciprocity can evolve. Social comparison is well established as an inherent human disposition through which humans navigate the social world by self-referential evaluation of others. Donating to those that are at least as reputable as oneself emerges as a dominant heuristic, which represents aspirational homophily. This heuristic is found to be implicitly present in the current knowledge of conditions that favour indirect reciprocity. The effective social norms for updating reputation are also observed to support this heuristic. We hypothesise that the cognitive challenge associated with social comparison has contributed to cerebral expansion and the disproportionate human brain size, consistent with the social complexity hypothesis. The findings have relevance for the evolution of autonomous systems that are characterised by one-shot interactions. PMID:27515119

  16. Reconciliation of Decision-Making Heuristics Based on Decision Trees Topologies and Incomplete Fuzzy Probabilities Sets

    PubMed Central

    Doubravsky, Karel; Dohnal, Mirko

    2015-01-01

    Complex decision making tasks of different natures, e.g. economics, safety engineering, ecology and biology, are based on vague, sparse, partially inconsistent and subjective knowledge. Moreover, decision making economists / engineers are usually not willing to invest too much time into study of complex formal theories. They require such decisions which can be (re)checked by human like common sense reasoning. One important problem related to realistic decision making tasks are incomplete data sets required by the chosen decision making algorithm. This paper presents a relatively simple algorithm how some missing III (input information items) can be generated using mainly decision tree topologies and integrated into incomplete data sets. The algorithm is based on an easy to understand heuristics, e.g. a longer decision tree sub-path is less probable. This heuristic can solve decision problems under total ignorance, i.e. the decision tree topology is the only information available. But in a practice, isolated information items e.g. some vaguely known probabilities (e.g. fuzzy probabilities) are usually available. It means that a realistic problem is analysed under partial ignorance. The proposed algorithm reconciles topology related heuristics and additional fuzzy sets using fuzzy linear programming. The case study, represented by a tree with six lotteries and one fuzzy probability, is presented in details. PMID:26158662

  17. Slime moulds use heuristics based on within-patch experience to decide when to leave.

    PubMed

    Latty, Tanya; Beekman, Madeleine

    2015-04-15

    Animals foraging in patchy, non-renewing or slowly renewing environments must make decisions about how long to remain within a patch. Organisms can use heuristics ('rules of thumb') based on available information to decide when to leave the patch. Here, we investigated proximate patch-departure heuristics in two species of giant, brainless amoeba: the slime moulds Didymium bahiense and Physarum polycephalum. We explicitly tested the importance of information obtained through experience by eliminating chemosensory cues of patch quality. In P. polycephalum, patch departure was influenced by the consumption of high, and to a much lesser extent low, quality food items such that engulfing a food item increased patch-residency time. Physarum polycephalum also tended to forage for longer in darkened, 'safe' patches. In D. bahiense, engulfment of any food item increased patch residency irrespective of that food item's quality. Exposure to light had no effect on the patch-residency time of D. bahiense. Given that these organisms lack a brain, our results illustrate how the use of simple heuristics can give the impression that individuals make sophisticated foraging decisions.

  18. Anticipation and choice heuristics in the dynamic consumption of pain relief.

    PubMed

    Story, Giles W; Vlaev, Ivo; Dayan, Peter; Seymour, Ben; Darzi, Ara; Dolan, Raymond J

    2015-03-01

    Humans frequently need to allocate resources across multiple time-steps. Economic theory proposes that subjects do so according to a stable set of intertemporal preferences, but the computational demands of such decisions encourage the use of formally less competent heuristics. Few empirical studies have examined dynamic resource allocation decisions systematically. Here we conducted an experiment involving the dynamic consumption over approximately 15 minutes of a limited budget of relief from moderately painful stimuli. We had previously elicited the participants' time preferences for the same painful stimuli in one-off choices, allowing us to assess self-consistency. Participants exhibited three characteristic behaviors: saving relief until the end, spreading relief across time, and early spending, of which the last was markedly less prominent. The likelihood that behavior was heuristic rather than normative is suggested by the weak correspondence between one-off and dynamic choices. We show that the consumption choices are consistent with a combination of simple heuristics involving early-spending, spreading or saving of relief until the end, with subjects predominantly exhibiting the last two.

  19. A new heuristic method for approximating the number of local minima in partial RNA energy landscapes.

    PubMed

    Albrecht, Andreas A; Day, Luke; Abdelhadi Ep Souki, Ouala; Steinhöfel, Kathleen

    2016-02-01

    The analysis of energy landscapes plays an important role in mathematical modelling, simulation and optimisation. Among the main features of interest are the number and distribution of local minima within the energy landscape. Granier and Kallel proposed in 2002 a new sampling procedure for estimating the number of local minima. In the present paper, we focus on improved heuristic implementations of the general framework devised by Granier and Kallel with regard to run-time behaviour and accuracy of predictions. The new heuristic method is demonstrated for the case of partial energy landscapes induced by RNA secondary structures. While the computation of minimum free energy RNA secondary structures has been studied for a long time, the analysis of folding landscapes has gained momentum over the past years in the context of co-transcriptional folding and deeper insights into cell processes. The new approach has been applied to ten RNA instances of length between 99 nt and 504 nt and their respective partial energy landscapes defined by secondary structures within an energy offset ΔE above the minimum free energy conformation. The number of local minima within the partial energy landscapes ranges from 1440 to 3441. Our heuristic method produces for the best approximations on average a deviation below 3.0% from the true number of local minima.

  20. A Heuristic Initialized Stochastic Memetic Algorithm for MDPVRP With Interdependent Depot Operations.

    PubMed

    Azad, Abdus Salam; Islam, Md Monirul; Chakraborty, Saikat

    2017-01-27

    The vehicle routing problem (VRP) is a widely studied combinatorial optimization problem. We introduce a variant of the multidepot and periodic VRP (MDPVRP) and propose a heuristic initialized stochastic memetic algorithm to solve it. The main challenge in designing such an algorithm for a large combinatorial optimization problem is to avoid premature convergence by maintaining a balance between exploration and exploitation of the search space. We employ intelligent initialization and stochastic learning to address this challenge. The intelligent initialization technique constructs a population by a mix of random and heuristic generated solutions. The stochastic learning enhances the solutions' quality selectively using simulated annealing with a set of random and heuristic operators. The hybridization of randomness and greediness in the initialization and learning process helps to maintain the balance between exploration and exploitation. Our proposed algorithm has been tested extensively on the existing benchmark problems and outperformed the baseline algorithms by a large margin. We further compared our results with that of the state-of-the-art algorithms working under MDPVRP formulation and found a significant improvement over their results.

  1. A Dominant Social Comparison Heuristic Unites Alternative Mechanisms for the Evolution of Indirect Reciprocity

    NASA Astrophysics Data System (ADS)

    Whitaker, Roger M.; Colombo, Gualtiero B.; Allen, Stuart M.; Dunbar, Robin I. M.

    2016-08-01

    Cooperation is a fundamental human trait but our understanding of how it functions remains incomplete. Indirect reciprocity is a particular case in point, where one-shot donations are made to unrelated beneficiaries without any guarantee of payback. Existing insights are largely from two independent perspectives: i) individual-level cognitive behaviour in decision making, and ii) identification of conditions that favour evolution of cooperation. We identify a fundamental connection between these two areas by examining social comparison as a means through which indirect reciprocity can evolve. Social comparison is well established as an inherent human disposition through which humans navigate the social world by self-referential evaluation of others. Donating to those that are at least as reputable as oneself emerges as a dominant heuristic, which represents aspirational homophily. This heuristic is found to be implicitly present in the current knowledge of conditions that favour indirect reciprocity. The effective social norms for updating reputation are also observed to support this heuristic. We hypothesise that the cognitive challenge associated with social comparison has contributed to cerebral expansion and the disproportionate human brain size, consistent with the social complexity hypothesis. The findings have relevance for the evolution of autonomous systems that are characterised by one-shot interactions.

  2. Reconciliation of Decision-Making Heuristics Based on Decision Trees Topologies and Incomplete Fuzzy Probabilities Sets.

    PubMed

    Doubravsky, Karel; Dohnal, Mirko

    2015-01-01

    Complex decision making tasks of different natures, e.g. economics, safety engineering, ecology and biology, are based on vague, sparse, partially inconsistent and subjective knowledge. Moreover, decision making economists / engineers are usually not willing to invest too much time into study of complex formal theories. They require such decisions which can be (re)checked by human like common sense reasoning. One important problem related to realistic decision making tasks are incomplete data sets required by the chosen decision making algorithm. This paper presents a relatively simple algorithm how some missing III (input information items) can be generated using mainly decision tree topologies and integrated into incomplete data sets. The algorithm is based on an easy to understand heuristics, e.g. a longer decision tree sub-path is less probable. This heuristic can solve decision problems under total ignorance, i.e. the decision tree topology is the only information available. But in a practice, isolated information items e.g. some vaguely known probabilities (e.g. fuzzy probabilities) are usually available. It means that a realistic problem is analysed under partial ignorance. The proposed algorithm reconciles topology related heuristics and additional fuzzy sets using fuzzy linear programming. The case study, represented by a tree with six lotteries and one fuzzy probability, is presented in details.

  3. Comparing the performance of expert user heuristics and an integer linear program in aircraft carrier deck operations.

    PubMed

    Ryan, Jason C; Banerjee, Ashis Gopal; Cummings, Mary L; Roy, Nicholas

    2014-06-01

    Planning operations across a number of domains can be considered as resource allocation problems with timing constraints. An unexplored instance of such a problem domain is the aircraft carrier flight deck, where, in current operations, replanning is done without the aid of any computerized decision support. Rather, veteran operators employ a set of experience-based heuristics to quickly generate new operating schedules. These expert user heuristics are neither codified nor evaluated by the United States Navy; they have grown solely from the convergent experiences of supervisory staff. As unmanned aerial vehicles (UAVs) are introduced in the aircraft carrier domain, these heuristics may require alterations due to differing capabilities. The inclusion of UAVs also allows for new opportunities for on-line planning and control, providing an alternative to the current heuristic-based replanning methodology. To investigate these issues formally, we have developed a decision support system for flight deck operations that utilizes a conventional integer linear program-based planning algorithm. In this system, a human operator sets both the goals and constraints for the algorithm, which then returns a proposed schedule for operator approval. As a part of validating this system, the performance of this collaborative human-automation planner was compared with that of the expert user heuristics over a set of test scenarios. The resulting analysis shows that human heuristics often outperform the plans produced by an optimization algorithm, but are also often more conservative.

  4. Expert intuitions: how to model the decision strategies of airport customs officers?

    PubMed

    Pachur, Thorsten; Marinello, Gianmarco

    2013-09-01

    How does expertise impact the selection of decision strategies? We asked airport customs officers and a novice control group to decide which passengers (described on several cue dimensions) they would submit to a search. Additionally, participants estimated the validities of the different cues. Then we modeled the decisions using compensatory strategies, which integrate many cues, and a noncompensatory heuristic, which relies on one-reason decision making. The majority of the customs officers were best described by the noncompensatory heuristic, whereas the majority of the novices were best described by a compensatory strategy. We also found that the experts' subjective cue validity estimates showed a higher dispersion across the cues and that differences in cue dispersion partially mediated differences in strategy use between experts and novices. Our results suggest that experts often rely on one-reason decision making and that expert-novice differences in strategy selection may reflect a response to the internal representation of the environment.

  5. [Group communication and decision-making strategies].

    PubMed

    García-Retamero, Rocío; Takezawa, Masanori; Gigerenzer, Gerd

    2008-11-01

    In daily life, people frequently make inferences about current and future states of the world. Most of these inferences are not made individually, but by exchanging information about which strategies could be used with other people. In an experiment, we analyzed whether exchanging information socially increased the probability of selecting the most adaptive strategy. In our experiment, take-the-best (TTB; Gigerenzer & Goldstein, 1996), a simple heuristic that employs one-reason decision making, achieved the highest payoff. Results showed that the fit of TTB increased substantially across trial blocks when participants were allowed to exchange information with other group members. In contrast, when participants made inferences individually, they did not select the most adaptive strategy even after seven trial blocks. Overall, our results support the hypothesis that group communication increases the likelihood that participants select the most adaptive strategy for making inferences.

  6. A learning heuristic for space mapping and searching self-organizing systems using adaptive mesh refinement

    NASA Astrophysics Data System (ADS)

    Phillips, Carolyn L.

    2014-09-01

    In a complex self-organizing system, small changes in the interactions between the system's components can result in different emergent macrostructures or macrobehavior. In chemical engineering and material science, such spontaneously self-assembling systems, using polymers, nanoscale or colloidal-scale particles, DNA, or other precursors, are an attractive way to create materials that are precisely engineered at a fine scale. Changes to the interactions can often be described by a set of parameters. Different contiguous regions in this parameter space correspond to different ordered states. Since these ordered states are emergent, often experiment, not analysis, is necessary to create a diagram of ordered states over the parameter space. By issuing queries to points in the parameter space (e.g., performing a computational or physical experiment), ordered states can be discovered and mapped. Queries can be costly in terms of resources or time, however. In general, one would like to learn the most information using the fewest queries. Here we introduce a learning heuristic for issuing queries to map and search a two-dimensional parameter space. Using a method inspired by adaptive mesh refinement, the heuristic iteratively issues batches of queries to be executed in parallel based on past information. By adjusting the search criteria, different types of searches (for example, a uniform search, exploring boundaries, sampling all regions equally) can be flexibly implemented. We show that this method will densely search the space, while preferentially targeting certain features. Using numerical examples, including a study simulating the self-assembly of complex crystals, we show how this heuristic can discover new regions and map boundaries more accurately than a uniformly distributed set of queries.

  7. Heuristic Evaluation of Ehealth Interventions: Establishing Standards That Relate to the Therapeutic Process Perspective

    PubMed Central

    Muench, Fred

    2016-01-01

    In recent years, the number of available eHealth interventions aimed at treating behavioral and mental health challenges has been growing. From the perspective of health care providers, there is a need for eHealth interventions to be evaluated prior to clinical trials and for the limited resources allocated to empirical research to be invested in the most promising products. Following a literature review, a gap was found in the availability of eHealth interventions evaluation principles related to the patient experience of the therapeutic process. This paper introduces principles and concepts for the evaluation of eHealth interventions developed as a first step in a process to outline general evaluation guidelines that relate to the clinical context from health care providers’ perspective. Our approach was to conduct a review of literature that relates to the examination of eHealth interventions. We identified the literature that was most relevant to our study and used it to define guidelines that relate to the clinical context. We then compiled a list of heuristics we found to be useful for the evaluation of eHealth intervention products’ suitability for empirical examination. Four heuristics were identified with respect to the therapeutic process: (1) the product’s ease of use (ie, usability), (2) the eHealth intervention’s compatibility with the clinical setting, (3) the presence of tools that make it easier for the user to engage in therapeutic activities, and (4) the provision of a feasible therapeutic pathway to growth. We then used this set of heuristics to conduct a detailed examination of MyFitnessPal. This line of work could help to set the bar higher for product developers and to inform health care providers about preferred eHealth intervention designs. PMID:26764209

  8. Walking tree heuristics for biological string alignment, gene location, and phylogenies

    NASA Astrophysics Data System (ADS)

    Cull, P.; Holloway, J. L.; Cavener, J. D.

    1999-03-01

    Basic biological information is stored in strings of nucleic acids (DNA, RNA) or amino acids (proteins). Teasing out the meaning of these strings is a central problem of modern biology. Matching and aligning strings brings out their shared characteristics. Although string matching is well-understood in the edit-distance model, biological strings with transpositions and inversions violate this model's assumptions. We propose a family of heuristics called walking trees to align biologically reasonable strings. Both edit-distance and walking tree methods can locate specific genes within a large string when the genes' sequences are given. When we attempt to match whole strings, the walking tree matches most genes, while the edit-distance method fails. We also give examples in which the walking tree matches substrings even if they have been moved or inverted. The edit-distance method was not designed to handle these problems. We include an example in which the walking tree "discovered" a gene. Calculating scores for whole genome matches gives a method for approximating evolutionary distance. We show two evolutionary trees for the picornaviruses which were computed by the walking tree heuristic. Both of these trees show great similarity to previously constructed trees. The point of this demonstration is that WHOLE genomes can be matched and distances calculated. The first tree was created on a Sequent parallel computer and demonstrates that the walking tree heuristic can be efficiently parallelized. The second tree was created using a network of work stations and demonstrates that there is suffient parallelism in the phylogenetic tree calculation that the sequential walking tree can be used effectively on a network.

  9. Estimation of post-test probabilities by residents: Bayesian reasoning versus heuristics?

    PubMed

    Hall, Stacey; Phang, Sen Han; Schaefer, Jeffrey P; Ghali, William; Wright, Bruce; McLaughlin, Kevin

    2014-08-01

    Although the process of diagnosing invariably begins with a heuristic, we encourage our learners to support their diagnoses by analytical cognitive processes, such as Bayesian reasoning, in an attempt to mitigate the effects of heuristics on diagnosing. There are, however, limited data on the use ± impact of Bayesian reasoning on the accuracy of disease probability estimates. In this study our objective was to explore whether Internal Medicine residents use a Bayesian process to estimate disease probabilities by comparing their disease probability estimates to literature-derived Bayesian post-test probabilities. We gave 35 Internal Medicine residents four clinical vignettes in the form of a referral letter and asked them to estimate the post-test probability of the target condition in each case. We then compared these to literature-derived probabilities. For each vignette the estimated probability was significantly different from the literature-derived probability. For the two cases with low literature-derived probability our participants significantly overestimated the probability of these target conditions being the correct diagnosis, whereas for the two cases with high literature-derived probability the estimated probability was significantly lower than the calculated value. Our results suggest that residents generate inaccurate post-test probability estimates. Possible explanations for this include ineffective application of Bayesian reasoning, attribute substitution whereby a complex cognitive task is replaced by an easier one (e.g., a heuristic), or systematic rater bias, such as central tendency bias. Further studies are needed to identify the reasons for inaccuracy of disease probability estimates and to explore ways of improving accuracy.

  10. Pain as a fact and heuristic: how pain neuroimaging illuminates moral dimensions of law.

    PubMed

    Pustilnik, Amanda C

    2012-05-01

    In legal domains ranging from tort to torture, pain and its degree do important definitional work by delimiting boundaries of lawfulness and of entitlements. Yet, for all the work done by pain as a term in legal texts and practice, it has a confounding lack of external verifiability. Now, neuroimaging is rendering pain and myriad other subjective states at least partly ascertainable. This emerging ability to ascertain and quantify subjective states is prompting a "hedonic" or a "subjectivist" turn in legal scholarship, which has sparked a vigorous debate as to whether the quantification of subjective states might affect legal theory and practice. Subjectivists contend that much values-talk in law has been a necessary but poor substitute for quantitative determinations of subjective states--determinations that will be possible in the law's "experiential future." This Article argues the converse: that pain discourse in law frequently is a heuristic for values. Drawing on interviews and laboratory visits with neuroimaging researchers, this Article shows current and in-principle limitations of pain quantification through neuroimaging. It then presents case studies on torture-murder, torture, the death penalty, and abortion to show the largely heuristic role of pain discourse in law. Introducing the theory of "embodied morality," the Article describes how moral conceptions of rights and duties are informed by human physicality and constrained by the limits of empathic identification. Pain neuroimaging helps reveal this dual factual and heuristic nature of pain in the law, and thus itself points to the translational work required for neuroimaging to influence, much less transform, legal practice and doctrine.

  11. A Branch and Bound Based Heuristic for Solving the Quadratic Assignment Problem,

    DTIC Science & Technology

    1981-10-01

    the Quadratic Assignment Problem M. S. Bazaraa and 0. Kirca FDRC-81-13 V Contract N~o. N00014-8O-k-0709 A Branch and Bound Based Heuristic for...Solving the Quadratic Assignment Problem M. S. Bazaraa and 0. Kirca Abstract I\\ .... In this paper a branch and bound algorithm is proposed for solving the...concept of branch and bound or im- plicit enumeration, as in the works of Gilmore (1962), Lawler (1963), Craves and Whinston (1970), Bazaraa and Elshafei

  12. Optimum and Heuristic Algorithms for Finite State Machine Decomposition and Partitioning

    DTIC Science & Technology

    1989-09-01

    The codes 3 . If thle uniut iple-vaited iniput part of a prinse imilllirault p E G1,. G2for ,oils and Sal caii be the Salle if and only if the codes...sub- .N nel.O)macgiuies aiid tile prototype isachinen. It canl be observed from Table 1 [81 ( 3 . D~ e Nliclmeli. H. K. BrAyton. And A. SAigi a iii...Heuristic Algorithms for Finite State Machine Decomposition and Partitioning Pravnav Ashar, Srinivas Devadas, and A. Richard Newton , T E ’,’ .,jpf~s’!i3

  13. Heuristic Optimization Approach to Selecting a Transport Connection in City Public Transport

    NASA Astrophysics Data System (ADS)

    Kul'ka, Jozef; Mantič, Martin; Kopas, Melichar; Faltinová, Eva; Kachman, Daniel

    2017-02-01

    The article presents a heuristic optimization approach to select a suitable transport connection in the framework of a city public transport. This methodology was applied on a part of the public transport in Košice, because it is the second largest city in the Slovak Republic and its network of the public transport creates a complex transport system, which consists of three different transport modes, namely from the bus transport, tram transport and trolley-bus transport. This solution focused on examining the individual transport services and their interconnection in relevant interchange points.

  14. A heuristic approach based on Clarke-Wright algorithm for open vehicle routing problem.

    PubMed

    Pichpibul, Tantikorn; Kawtummachai, Ruengsak

    2013-01-01

    We propose a heuristic approach based on the Clarke-Wright algorithm (CW) to solve the open version of the well-known capacitated vehicle routing problem in which vehicles are not required to return to the depot after completing service. The proposed CW has been presented in four procedures composed of Clarke-Wright formula modification, open-route construction, two-phase selection, and route postimprovement. Computational results show that the proposed CW is competitive and outperforms classical CW in all directions. Moreover, the best known solution is also obtained in 97% of tested instances (60 out of 62).

  15. The Single and Multiple Vehicle Pickup and Delivery Problem: Exact and Heuristic Algorithms.

    DTIC Science & Technology

    1981-06-01

    4. 1 R;61tI) S TYPE OF REPORT & PERIOD COVERED e Single and Multiple Vehicle Pickup and 7U6DSETTO ’Deliveiry Problem : Exact and Heuristic...h, bi-* "&.0f ~ ATTACHED 81 10 27256 IDD 1413 EDOITION OF I NOV 6% IS OU1SOLETE UNCLASS ABSTRACT The pickup and delivery problem (PUUP) represents a...class of sequencing or routing problems where the key facet of the routing is that a pickup must precede the corresponding, subsequent delivery. Other

  16. A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Problem

    PubMed Central

    2013-01-01

    We propose a heuristic approach based on the Clarke-Wright algorithm (CW) to solve the open version of the well-known capacitated vehicle routing problem in which vehicles are not required to return to the depot after completing service. The proposed CW has been presented in four procedures composed of Clarke-Wright formula modification, open-route construction, two-phase selection, and route postimprovement. Computational results show that the proposed CW is competitive and outperforms classical CW in all directions. Moreover, the best known solution is also obtained in 97% of tested instances (60 out of 62). PMID:24382948

  17. Developing and Validating Personas in e-Commerce: A Heuristic Approach

    NASA Astrophysics Data System (ADS)

    Thoma, Volker; Williams, Bryn

    A multi-method persona development process in a large e-commerce business is described. Personas are fictional representations of customers that describe typical user attributes to facilitate a user-centered approach in interaction design. In the current project persona attributes were derived from various data sources, such as stakeholder interviews, user tests and interviews, data mining, customer surveys, and ethnographic (direct observation, diary studies) research. The heuristic approach of using these data sources conjointly allowed for an early validation of relevant persona dimensions.

  18. a New Hybrid Heuristic Technique for Unit Commitment Considering Spinning Reserve Probability

    NASA Astrophysics Data System (ADS)

    Abdollahi, A.; Ehsan, M.; Rashidinejad, M.; Purakbari-Kasmaie, M.

    2009-08-01

    This paper proposes a new approach for solving generation scheduling and ramp rate constrained unit commitment with considering spinning reserve probability. In order to simulate the probability of reserve in the formulation, the estimated probability that spinning reserve is called and generated has been considered. A hybrid heuristic method between genetic algorithm and lambdad iteration method is applied to solve the problem. The proposed approach is applied to two different cases such as a 10-unit base problem without considering probability of reserve and 10-unit problem with considering probability of reserve. The results are compared with other approaches results to exhibit the superiority of the proposed approach.

  19. A Modified User-Oriented Heuristic Evaluation of a Mobile Health System for Diabetes Self-management Support.

    PubMed

    Georgsson, Mattias; Staggers, Nancy; Weir, Charlene

    2016-02-01

    Mobile health platforms offer significant opportunities for improving diabetic self-care, but only if adequate usability exists. Expert evaluations such as heuristic evaluation can provide distinct usability information about systems. The purpose of this study was to complete a usability evaluation of a mobile health system for diabetes patients using a modified heuristic evaluation technique of (1) dual-domain experts (healthcare professionals, usability experts), (2) validated scenarios and user tasks related to patients' self-care, and (3) in-depth severity factor ratings. Experts identified 129 usability problems with 274 heuristic violations for the system. The categories Consistency and Standards dominated at 24.1% (n = 66), followed by Match Between System and Real World at 22.3% (n = 61). Average severity ratings across system views were 2.8 (of 4), with 9.3% (n = 12) rated as catastrophic and 53.5% (n = 69) as major. The large volume of violations with severe ratings indicated clear priorities for redesign. The modified heuristic approach allowed evaluators to identify unique and important issues, including ones related to self-management and patient safety. This article provides a template for one type of expert evaluation adding to the informaticists' toolbox when needing to conduct a fast, resource-efficient and user-oriented heuristic evaluation.

  20. A Modified User-Oriented Heuristic Evaluation of a Mobile Health System for Diabetes Self-management Support

    PubMed Central

    Georgsson, Mattias; Staggers, Nancy; Weir, Charlene

    2016-01-01

    Mobile health platforms offer significant opportunities for improving diabetic self-care, but only if adequate usability exists. Expert evaluations such as heuristic evaluation can provide distinct usability information about systems. The purpose of this study was to complete a usability evaluation of a mobile health system for diabetes patients using a modified heuristic evaluation technique of (1) dual-domain experts (healthcare professionals, usability experts), (2) validated scenarios and user tasks related to patients’ self-care, and (3) in-depth severity factor ratings. Experts identified 129 usability problems with 274 heuristic violations for the system. The categories Consistency and Standards dominated at 24.1% (n = 66), followed by Match Between System and Real World at 22.3% (n = 61). Average severity ratings across system views were 2.8 (of 4), with 9.3% (n = 12) rated as catastrophic and 53.5% (n = 69) as major. The large volume of violations with severe ratings indicated clear priorities for redesign. The modified heuristic approach allowed evaluators to identify unique and important issues, including ones related to self-management and patient safety. This article provides a template for one type of expert evaluation adding to the informaticists’ toolbox when needing to conduct a fast, resource-efficient and user-oriented heuristic evaluation. PMID:26657618

  1. Heuristic Classification.

    DTIC Science & Technology

    1985-08-01

    34 Similarly, we draw causal nets linking abnormal states, saying that brain-hematoma (mass of blood in the brain) is caused by brain-hemorrhage (bleeding...possible solutions (restricted to abnormal findings that must be explained or "non-specific" findings not already explained by active solutions). In...solutions are abnormal processes causing the observed symptoms. We say that the inferred model of the device, the diagnosis, explains the symptoms. In

  2. Put a limit on it: The protective effects of scarcity heuristics when self-control is low

    PubMed Central

    Cheung, Tracy TL; Kroese, Floor M; Fennis, Bob M; De Ridder, Denise TD

    2015-01-01

    Low self-control is a state in which consumers are assumed to be vulnerable to making impulsive choices that hurt long-term goals. Rather than increasing self-control, the current research exploits the tendency for heuristic-based thinking in low self-control by employing scarcity heuristics to promote better consumption choices. Results indicate that consumers low in self-control especially benefited and selected more healthy choices when marketed as “scarce” (Study 1), and that a demand (vs supply) scarcity heuristic was most effective in promoting utilitarian products (Study 2) suggests low self-control involves both an enhanced reward orientation and increased tendency to conform to descriptive norms. PMID:28070377

  3. Evidence-based Heuristics for Evaluating Demands on eHealth Literacy and Usability in a Mobile Consumer Health Application.

    PubMed

    Monkman, Helen; Griffith, Janessa; Kushniruk, Andre W

    2015-01-01

    Heuristic evaluations have proven to be valuable for identifying usability issues in systems. Commonly used sets of heuritics exist; however, they may not always be the most suitable, given the specific goal of the analysis. One such example is seeking to evaluate the demands on eHealth literacy and usability of consumer health information systems. In this study, eight essential heuristics and three optional heuristics subsumed from the evidence on eHealth/health literacy and usability were tested for their utility in assessing a mobile blood pressure tracking application (app). This evaluation revealed a variety of ways the design of the app could both benefit and impede users with limited eHealth literacy. This study demonstrated the utility of a low-cost, single evaluation approach for identifying both eHealth literacy and usability issues based on existing evidence in the literature.

  4. Comparison of function approximation, heuristic, and derivative-based methods for automatic calibration of computationally expensive groundwater bioremediation models

    NASA Astrophysics Data System (ADS)

    Mugunthan, Pradeep; Shoemaker, Christine A.; Regis, Rommel G.

    2005-11-01

    The performance of function approximation (FA) methods is compared to heuristic and derivative-based nonlinear optimization methods for automatic calibration of biokinetic parameters of a groundwater bioremediation model of chlorinated ethenes on a hypothetical and a real field case. For the hypothetical case, on the basis of 10 trials on two different objective functions, the FA methods had the lowest mean and smaller deviation of the objective function among all algorithms for a combined Nash-Sutcliffe objective and among all but the derivative-based algorithm for a total squared error objective. The best algorithms in the hypothetical case were applied to calibrate eight parameters to data obtained from a site in California. In three trials the FA methods outperformed heuristic and derivative-based methods for both objective functions. This study indicates that function approximation methods could be a more efficient alternative to heuristic and derivative-based methods for automatic calibration of computationally expensive bioremediation models.

  5. Minimizing impacts of land use change on ecosystem services using multi-criteria heuristic analysis.

    PubMed

    Keller, Arturo A; Fournier, Eric; Fox, Jessica

    2015-06-01

    Development of natural landscapes to support human activities impacts the capacity of the landscape to provide ecosystem services. Typically, several ecosystem services are impacted at a single development site and various footprint scenarios are possible, thus a multi-criteria analysis is needed. Restoration potential should also be considered for the area surrounding the permanent impact site. The primary objective of this research was to develop a heuristic approach to analyze multiple criteria (e.g. impacts to various ecosystem services) in a spatial configuration with many potential development sites. The approach was to: (1) quantify the magnitude of terrestrial ecosystem service (biodiversity, carbon sequestration, nutrient and sediment retention, and pollination) impacts associated with a suite of land use change scenarios using the InVEST model; (2) normalize results across categories of ecosystem services to allow cross-service comparison; (3) apply the multi-criteria heuristic algorithm to select sites with the least impact to ecosystem services, including a spatial criterion (separation between sites). As a case study, the multi-criteria impact minimization algorithm was applied to InVEST output to select 25 potential development sites out of 204 possible locations (selected by other criteria) within a 24,000 ha property. This study advanced a generally applicable spatial multi-criteria approach for 1) considering many land use footprint scenarios, 2) balancing impact decisions across a suite of ecosystem services, and 3) determining the restoration potential of ecosystem services after impacts.

  6. Maximizing the nurses' preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm

    NASA Astrophysics Data System (ADS)

    Jafari, Hamed; Salmasi, Nasser

    2015-04-01

    The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital's demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses' preferences for working shifts and weekends off by considering several important factors such as hospital's policies, labor laws, governmental regulations, and the status of nurses at the end of the previous planning horizon in one of the largest hospitals in Iran i.e., Milad Hospital. Due to the shortage of available nurses, at first, the minimum total number of required nurses is determined. Then, a mathematical programming model is proposed to solve the problem optimally. Since the proposed research problem is NP-hard, a meta-heuristic algorithm based on simulated annealing (SA) is applied to heuristically solve the problem in a reasonable time. An initial feasible solution generator and several novel neighborhood structures are applied to enhance performance of the SA algorithm. Inspired from our observations in Milad hospital, random test problems are generated to evaluate the performance of the SA algorithm. The results of computational experiments indicate that the applied SA algorithm provides solutions with average percentage gap of 5.49 % compared to the upper bounds obtained from the mathematical model. Moreover, the applied SA algorithm provides significantly better solutions in a reasonable time than the schedules provided by the head nurses.

  7. Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms

    SciTech Connect

    Rao, N.S.V.; Kareti, S.; Shi, Weimin; Iyengar, S.S.

    1993-07-01

    A formal framework for navigating a robot in a geometric terrain by an unknown set of obstacles is considered. Here the terrain model is not a priori known, but the robot is equipped with a sensor system (vision or touch) employed for the purpose of navigation. The focus is restricted to the non-heuristic algorithms which can be theoretically shown to be correct within a given framework of models for the robot, terrain and sensor system. These formulations, although abstract and simplified compared to real-life scenarios, provide foundations for practical systems by highlighting the underlying critical issues. First, the authors consider the algorithms that are shown to navigate correctly without much consideration given to the performance parameters such as distance traversed, etc. Second, they consider non-heuristic algorithms that guarantee bounds on the distance traversed or the ratio of the distance traversed to the shortest path length (computed if the terrain model is known). Then they consider the navigation of robots with very limited computational capabilities such as finite automata, etc.

  8. Heuristics for Multiobjective Optimization of Two-Sided Assembly Line Systems

    PubMed Central

    Jawahar, N.; Ponnambalam, S. G.; Sivakumar, K.; Thangadurai, V.

    2014-01-01

    Products such as cars, trucks, and heavy machinery are assembled by two-sided assembly line. Assembly line balancing has significant impacts on the performance and productivity of flow line manufacturing systems and is an active research area for several decades. This paper addresses the line balancing problem of a two-sided assembly line in which the tasks are to be assigned at L side or R side or any one side (addressed as E). Two objectives, minimum number of workstations and minimum unbalance time among workstations, have been considered for balancing the assembly line. There are two approaches to solve multiobjective optimization problem: first approach combines all the objectives into a single composite function or moves all but one objective to the constraint set; second approach determines the Pareto optimal solution set. This paper proposes two heuristics to evolve optimal Pareto front for the TALBP under consideration: Enumerative Heuristic Algorithm (EHA) to handle problems of small and medium size and Simulated Annealing Algorithm (SAA) for large-sized problems. The proposed approaches are illustrated with example problems and their performances are compared with a set of test problems. PMID:24790568

  9. Heuristics can produce surprisingly rational probability estimates: Comment on Costello and Watts (2014).

    PubMed

    Nilsson, Håkan; Juslin, Peter; Winman, Anders

    2016-01-01

    Costello and Watts (2014) present a model assuming that people's knowledge of probabilities adheres to probability theory, but that their probability judgments are perturbed by a random noise in the retrieval from memory. Predictions for the relationships between probability judgments for constituent events and their disjunctions and conjunctions, as well as for sums of such judgments were derived from probability theory. Costello and Watts (2014) report behavioral data showing that subjective probability judgments accord with these predictions. Based on the finding that subjective probability judgments follow probability theory, Costello and Watts (2014) conclude that the results imply that people's probability judgments embody the rules of probability theory and thereby refute theories of heuristic processing. Here, we demonstrate the invalidity of this conclusion by showing that all of the tested predictions follow straightforwardly from an account assuming heuristic probability integration (Nilsson, Winman, Juslin, & Hansson, 2009). We end with a discussion of a number of previous findings that harmonize very poorly with the predictions by the model suggested by Costello and Watts (2014).

  10. Parsimony score of phylogenetic networks: hardness results and a linear-time heuristic.

    PubMed

    Jin, Guohua; Nakhleh, Luay; Snir, Sagi; Tuller, Tamir

    2009-01-01

    Phylogenies-the evolutionary histories of groups of organisms-play a major role in representing the interrelationships among biological entities. Many methods for reconstructing and studying such phylogenies have been proposed, almost all of which assume that the underlying history of a given set of species can be represented by a binary tree. Although many biological processes can be effectively modeled and summarized in this fashion, others cannot: recombination, hybrid speciation, and horizontal gene transfer result in networks of relationships rather than trees of relationships. In previous works, we formulated a maximum parsimony (MP) criterion for reconstructing and evaluating phylogenetic networks, and demonstrated its quality on biological as well as synthetic data sets. In this paper, we provide further theoretical results as well as a very fast heuristic algorithm for the MP criterion of phylogenetic networks. In particular, we provide a novel combinatorial definition of phylogenetic networks in terms of "forbidden cycles," and provide detailed hardness and hardness of approximation proofs for the "small" MP problem. We demonstrate the performance of our heuristic in terms of time and accuracy on both biological and synthetic data sets. Finally, we explain the difference between our model and a similar one formulated by Nguyen et al., and describe the implications of this difference on the hardness and approximation results.

  11. Monte Carlo method with heuristic adjustment for irregularly shaped food product volume measurement.

    PubMed

    Siswantoro, Joko; Prabuwono, Anton Satria; Abdullah, Azizi; Idrus, Bahari

    2014-01-01

    Volume measurement plays an important role in the production and processing of food products. Various methods have been proposed to measure the volume of food products with irregular shapes based on 3D reconstruction. However, 3D reconstruction comes with a high-priced computational cost. Furthermore, some of the volume measurement methods based on 3D reconstruction have a low accuracy. Another method for measuring volume of objects uses Monte Carlo method. Monte Carlo method performs volume measurements using random points. Monte Carlo method only requires information regarding whether random points fall inside or outside an object and does not require a 3D reconstruction. This paper proposes volume measurement using a computer vision system for irregularly shaped food products without 3D reconstruction based on Monte Carlo method with heuristic adjustment. Five images of food product were captured using five cameras and processed to produce binary images. Monte Carlo integration with heuristic adjustment was performed to measure the volume based on the information extracted from binary images. The experimental results show that the proposed method provided high accuracy and precision compared to the water displacement method. In addition, the proposed method is more accurate and faster than the space carving method.

  12. Job-shop scheduling with a combination of evolutionary and heuristic methods

    NASA Astrophysics Data System (ADS)

    Patkai, Bela; Torvinen, Seppo

    1999-08-01

    Since almost all of the scheduling problems are NP-hard-- cannot be solved in polynomial time--those companies that need a realistic scheduling system face serious limitations of available methods for finding an optimal schedule, especially if the given environment requires adaptation to dynamic variations. Exact methods do find an optimal schedule, but the size of the problem they can solve is very limited, excluding this way the required scalability. The solution presented in this paper is a simple, multi-pass heuristic method, which aims to avoid the limitations of other well-known formulations. Even though the dispatching rules are fast and provide near-optimal solutions in most cases, they are severely limited in efficiency--especially in case the schedule builder satisfies a significant number of constraints. That is the main motivation for adding a simplified genetic algorithm to the dispatching rules, which--due to its stochastic nature--belongs to heuristic, too. The scheduling problem is of a middle size Finnish factory, throughout the investigations their up-to-date manufacturing data has been used for the sake of realistic calculations.

  13. The scarcity heuristic impacts reward processing within the medial-frontal cortex.

    PubMed

    Williams, Chad C; Saffer, Boaz Y; McCulloch, Robert B; Krigolson, Olave E

    2016-05-04

    Objects that are rare are often perceived to be inherently more valuable than objects that are abundant - a bias brought about in part by the scarcity heuristic. In the present study, we sought to test whether perception of rarity impacted reward evaluation within the human medial-frontal cortex. Here, participants played a gambling game in which they flipped rare and abundant 'cards' on a computer screen to win financial rewards while electroencephalographic data were recorded. Unbeknownst to participants, reward outcome and frequency was random and equivalent for both rare and abundant cards; thus, only a perception of scarcity was true. Analysis of the electroencephalographic data indicated that the P300 component of the event-related brain potential differed in amplitude for wins and losses following the selection of rare cards, but not following the selection of abundant cards. Importantly, then, we found that the perception of card rarity impacted reward processing even though reward feedback was independent of and subsequent to card selection. Our data indicate a top-down influence of the scarcity heuristic on reward evaluation, and specifically the processing of reward magnitude, within the human medial-frontal cortex.

  14. Social heuristics and social roles: Intuition favors altruism for women but not for men.

    PubMed

    Rand, David G; Brescoll, Victoria L; Everett, Jim A C; Capraro, Valerio; Barcelo, Hélène

    2016-04-01

    Are humans intuitively altruistic, or does altruism require self-control? A theory of social heuristics, whereby intuitive responses favor typically successful behaviors, suggests that the answer may depend on who you are. In particular, evidence suggests that women are expected to behave altruistically, and are punished for failing to be altruistic, to a much greater extent than men. Thus, women (but not men) may internalize altruism as their intuitive response. Indeed, a meta-analysis of 13 new experiments and 9 experiments from other groups found that promoting intuition relative to deliberation increased giving in a Dictator Game among women, but not among men (Study 1, N = 4,366). Furthermore, this effect was shown to be moderated by explicit sex role identification (Study 2, N = 1,831): the more women described themselves using traditionally masculine attributes (e.g., dominance, independence) relative to traditionally feminine attributes (e.g., warmth, tenderness), the more deliberation reduced their altruism. Our findings shed light on the connection between gender and altruism, and highlight the importance of social heuristics in human prosociality.

  15. Self-organised manifold learning and heuristic charting via adaptive metrics

    NASA Astrophysics Data System (ADS)

    Horvath, Denis; Ulicny, Jozef; Brutovsky, Branislav

    2016-01-01

    Classical metric and non-metric multidimensional scaling (MDS) variants represent the well-known manifold learning (ML) methods which enable construction of low-dimensional representation (projections) of high-dimensional data inputs. However, their use is limited to the cases when data are inherently reducible to low dimensionality. In general, drawbacks and limitations of these, as well as pure, MDS variants become more apparent when the exploration (learning) is exposed to the structured data of high intrinsic dimension. As we demonstrate on artificial as well as real-world datasets, the over-determination problem can be solved by means of the hybrid and multi-component discrete-continuous multi-modal optimisation heuristics. A remarkable feature of the approach is that projections onto 2D are constructed simultaneously with the data categorisation compensating in part for the loss of original input information. We observed that the optimisation module integrated with ML modelling, metric learning and categorisation leads to a nontrivial mechanism resulting in heuristic charting of data.

  16. Visualization for Hyper-Heuristics. Front-End Graphical User Interface

    SciTech Connect

    Kroenung, Lauren

    2015-03-01

    Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. While such automated design has great advantages, it can often be difficult to understand exactly how a design was derived and why it should be trusted. This project aims to address these issues of usability by creating an easy-to-use graphical user interface (GUI) for hyper-heuristics to support practitioners, as well as scientific visualization of the produced automated designs. My contributions to this project are exhibited in the user-facing portion of the developed system and the detailed scientific visualizations created from back-end data.

  17. Investigation into the efficiency of different bionic algorithm combinations for a COBRA meta-heuristic

    NASA Astrophysics Data System (ADS)

    Akhmedova, Sh; Semenkin, E.

    2017-02-01

    Previously, a meta-heuristic approach, called Co-Operation of Biology-Related Algorithms or COBRA, for solving real-parameter optimization problems was introduced and described. COBRA’s basic idea consists of a cooperative work of five well-known bionic algorithms such as Particle Swarm Optimization, the Wolf Pack Search, the Firefly Algorithm, the Cuckoo Search Algorithm and the Bat Algorithm, which were chosen due to the similarity of their schemes. The performance of this meta-heuristic was evaluated on a set of test functions and its workability was demonstrated. Thus it was established that the idea of the algorithms’ cooperative work is useful. However, it is unclear which bionic algorithms should be included in this cooperation and how many of them. Therefore, the five above-listed algorithms and additionally the Fish School Search algorithm were used for the development of five different modifications of COBRA by varying the number of component-algorithms. These modifications were tested on the same set of functions and the best of them was found. Ways of further improving the COBRA algorithm are then discussed.

  18. Neural bases for basic processes in heuristic problem solving: Take solving Sudoku puzzles as an example.

    PubMed

    Qin, Yulin; Xiang, Jie; Wang, Rifeng; Zhou, Haiyan; Li, Kuncheng; Zhong, Ning

    2012-12-01

    Newell and Simon postulated that the basic steps in human problem-solving involve iteratively applying operators to transform the state of the problem to eventually achieve a goal. To check the neural basis of this framework, the present study focused on the basic processes in human heuristic problem-solving that the participants identified the current problem state and then recalled and applied the corresponding heuristic rules to change the problem state. A new paradigm, solving simplified Sudoku puzzles, was developed for an event-related functional magnetic resonance imaging (fMRI) study in problem solving. Regions of interest (ROIs), including the left prefrontal cortex, the bilateral posterior parietal cortex, the anterior cingulated cortex, the bilateral caudate nuclei, the bilateral fusiform, as well as the bilateral frontal eye fields, were found to be involved in the task. To obtain convergent evidence, in addition to traditional statistical analysis, we used the multivariate voxel classification method to check the accuracy of the predictions for the condition of the task from the blood oxygen level dependent (BOLD) response of the ROIs, using a new classifier developed in this study for fMRI data. To reveal the roles that the ROIs play in problem solving, we developed an ACT-R computational model of the information-processing processes in human problem solving, and tried to predict the BOLD response of the ROIs from the task. Advances in human problem-solving research after Newell and Simon are then briefly discussed.

  19. Non-uniform cosine modulated filter banks using meta-heuristic algorithms in CSD space

    PubMed Central

    Kalathil, Shaeen; Elias, Elizabeth

    2014-01-01

    This paper presents an efficient design of non-uniform cosine modulated filter banks (CMFB) using canonic signed digit (CSD) coefficients. CMFB has got an easy and efficient design approach. Non-uniform decomposition can be easily obtained by merging the appropriate filters of a uniform filter bank. Only the prototype filter needs to be designed and optimized. In this paper, the prototype filter is designed using window method, weighted Chebyshev approximation and weighted constrained least square approximation. The coefficients are quantized into CSD, using a look-up-table. The finite precision CSD rounding, deteriorates the filter bank performances. The performances of the filter bank are improved using suitably modified meta-heuristic algorithms. The different meta-heuristic algorithms which are modified and used in this paper are Artificial Bee Colony algorithm, Gravitational Search algorithm, Harmony Search algorithm and Genetic algorithm and they result in filter banks with less implementation complexity, power consumption and area requirements when compared with those of the conventional continuous coefficient non-uniform CMFB. PMID:26644921

  20. Heuristics for multiobjective optimization of two-sided assembly line systems.

    PubMed

    Jawahar, N; Ponnambalam, S G; Sivakumar, K; Thangadurai, V

    2014-01-01

    Products such as cars, trucks, and heavy machinery are assembled by two-sided assembly line. Assembly line balancing has significant impacts on the performance and productivity of flow line manufacturing systems and is an active research area for several decades. This paper addresses the line balancing problem of a two-sided assembly line in which the tasks are to be assigned at L side or R side or any one side (addressed as E). Two objectives, minimum number of workstations and minimum unbalance time among workstations, have been considered for balancing the assembly line. There are two approaches to solve multiobjective optimization problem: first approach combines all the objectives into a single composite function or moves all but one objective to the constraint set; second approach determines the Pareto optimal solution set. This paper proposes two heuristics to evolve optimal Pareto front for the TALBP under consideration: Enumerative Heuristic Algorithm (EHA) to handle problems of small and medium size and Simulated Annealing Algorithm (SAA) for large-sized problems. The proposed approaches are illustrated with example problems and their performances are compared with a set of test problems.

  1. An efficient approach to improve the usability of e-learning resources: the role of heuristic evaluation.

    PubMed

    Davids, Mogamat Razeen; Chikte, Usuf M E; Halperin, Mitchell L

    2013-09-01

    Optimizing the usability of e-learning materials is necessary to maximize their potential educational impact, but this is often neglected when time and other resources are limited, leading to the release of materials that cannot deliver the desired learning outcomes. As clinician-teachers in a resource-constrained environment, we investigated whether heuristic evaluation of our multimedia e-learning resource by a panel of experts would be an effective and efficient alternative to testing with end users. We engaged six inspectors, whose expertise included usability, e-learning, instructional design, medical informatics, and the content area of nephrology. They applied a set of commonly used heuristics to identify usability problems, assigning severity scores to each problem. The identification of serious problems was compared with problems previously found by user testing. The panel completed their evaluations within 1 wk and identified a total of 22 distinct usability problems, 11 of which were considered serious. The problems violated the heuristics of visibility of system status, user control and freedom, match with the real world, intuitive visual layout, consistency and conformity to standards, aesthetic and minimalist design, error prevention and tolerance, and help and documentation. Compared with user testing, heuristic evaluation found most, but not all, of the serious problems. Combining heuristic evaluation and user testing, with each involving a small number of participants, may be an effective and efficient way of improving the usability of e-learning materials. Heuristic evaluation should ideally be used first to identify the most obvious problems and, once these are fixed, should be followed by testing with typical end users.

  2. Midlife Women’s Symptom Cluster Heuristics: Evaluation of An iPad Application for Data Collection

    PubMed Central

    Woods, Nancy Fugate; Ismail, Rita; Linder, Lauri A.; Macpherson, Catherine Fiona

    2015-01-01

    their symptoms (“really annoying”), the time of occurrence (“night problem”), and symptoms in the cluster (“hot flash”). They attributed their clusters to menopause, life demands, and other symptoms, among other causes. Management strategies that women used included: over the counter preparations, sleep, rest, and other lifestyle changes. Some women requested a copy of their final symptom cluster diagram to discuss with their health care providers. Conclusion Using the C-SCAT M afforded women an opportunity to depict their symptoms and clusters and relationships between them, as well as to provide narrative data about their heuristics. Women’s unsolicited comments about using the cluster diagram to facilitate conversation about their symptoms with their health care providers suggest the potential value of modifying the C-SCAT M and evaluating its use in a health care setting. PMID:25803668

  3. Automatic protein design with all atom force-fields by exact and heuristic optimization.

    PubMed

    Wernisch, L; Hery, S; Wodak, S J

    2000-08-18

    A fully automatic procedure for predicting the amino acid sequences compatible with a given target structure is described. It is based on the CHARMM package, and uses an all atom force-field and rotamer libraries to describe and evaluate side-chain types and conformations. Sequences are ranked by a quantity akin to the free energy of folding, which incorporates hydration effects. Exact (Branch and Bound) and heuristic optimisation procedures are used to identifying highly scoring sequences from an astronomical number of possibilities. These sequences include the minimum free energy sequence, as well as all amino acid sequences whose free energy lies within a specified window from the minimum. Several applications of our procedure are illustrated. Prediction of side-chain conformations for a set of ten proteins yields results comparable to those of established side-chain placement programs. Applications to sequence optimisation comprise the re-design of the protein cores of c-Crk SH3 domain, the B1 domain of protein G and Ubiquitin, and of surface residues of the SH3 domain. In all calculations, no restrictions are imposed on the amino acid composition and identical parameter settings are used for core and surface residues. The best scoring sequences for the protein cores are virtually identical to wild-type. They feature no more than one to three mutations in a total of 11-16 variable positions. Tests suggest that this is due to the balance between various contributions in the force-field rather than to overwhelming influence from packing constraints. The effectiveness of our force-field is further supported by the sequence predictions for surface residues of the SH3 domain. More mutations are predicted than in the core, seemingly in order to optimise the network of complementary interactions between polar and charged groups. This appears to be an important energetic requirement in absence of the partner molecules with which the SH3 domain interacts, which were not

  4. Restart Operator Meta-heuristics for a Problem-Oriented Evolutionary Strategies Algorithm in Inverse Mathematical MISO Modelling Problem Solving

    NASA Astrophysics Data System (ADS)

    Ryzhikov, I. S.; Semenkin, E. S.

    2017-02-01

    This study is focused on solving an inverse mathematical modelling problem for dynamical systems based on observation data and control inputs. The mathematical model is being searched in the form of a linear differential equation, which determines the system with multiple inputs and a single output, and a vector of the initial point coordinates. The described problem is complex and multimodal and for this reason the proposed evolutionary-based optimization technique, which is oriented on a dynamical system identification problem, was applied. To improve its performance an algorithm restart operator was implemented.

  5. Effects of Cognitive Strategy Interventions and Cognitive Moderators on Word Problem Solving in Children at Risk for Problem Solving Difficulties

    ERIC Educational Resources Information Center

    Swanson, H. Lee; Lussier, Cathy; Orosco, Michael

    2013-01-01

    This study investigated the role of strategy instruction and cognitive abilities on word problem solving accuracy in children with math difficulties (MD). Elementary school children (N = 120) with and without MD were randomly assigned to 1 of 4 conditions: general-heuristic (e.g., underline question sentence), visual-schematic presentation…

  6. What Makes an Insight Problem? The Roles of Heuristics, Goal Conception, and Solution Recoding in Knowledge-Lean Problems

    ERIC Educational Resources Information Center

    Chronicle, Edward P.; MacGregor, James N.; Ormerod, Thomas C.

    2004-01-01

    Four experiments investigated transformation problems with insight characteristics. In Experiment 1, performance on a version of the 6-coin problem that had a concrete and visualizable solution followed a hill-climbing heuristic. Experiment 2 demonstrated that the difficulty of a version of the problem that potentially required insight for…

  7. SHRIF, a General-Purpose System for Heuristic Retrieval of Information and Facts, Applied to Medical Knowledge Processing.

    ERIC Educational Resources Information Center

    Findler, Nicholas V.; And Others

    1992-01-01

    Describes SHRIF, a System for Heuristic Retrieval of Information and Facts, and the medical knowledge base that was used in its development. Highlights include design decisions; the user-machine interface, including the language processor; and the organization of the knowledge base in an artificial intelligence (AI) project like this one. (57…

  8. Answer First: Applying the Heuristic-Analytic Theory of Reasoning to Examine Student Intuitive Thinking in the Context of Physics

    ERIC Educational Resources Information Center

    Kryjevskaia, Mila; Stetzer, MacKenzie R.; Grosz, Nathaniel

    2014-01-01

    We have applied the heuristic-analytic theory of reasoning to interpret inconsistencies in student reasoning approaches to physics problems. This study was motivated by an emerging body of evidence that suggests that student conceptual and reasoning competence demonstrated on one task often fails to be exhibited on another. Indeed, even after…

  9. The Tip-of-the-Tongue Heuristic: How Tip-of-the-Tongue States Confer Perceptibility on Inaccessible Words

    ERIC Educational Resources Information Center

    Cleary, Anne M.; Claxton, Alexander B.

    2015-01-01

    This study shows that the presence of a tip-of-the-tongue (TOT) state--the sense that a word is in memory when its retrieval fails--is used as a heuristic for inferring that an inaccessible word has characteristics that are consistent with greater word perceptibility. When reporting a TOT state, people judged an unretrieved word as more likely to…

  10. What Is behind the Priority Heuristic? A Mathematical Analysis and Comment on Brandstatter, Gigerenzer, and Hertwig (2006)

    ERIC Educational Resources Information Center

    Rieger, Marc Oliver; Wang, Mei

    2008-01-01

    Comments on the article by E. Brandstatter, G. Gigerenzer, and R. Hertwig (2006). The authors discuss the priority heuristic, a recent model for decisions under risk. They reanalyze the experimental validity of this approach and discuss how these results compare with cumulative prospect theory, the currently most established model in behavioral…

  11. Effects of Simultaneous or Sequential Sequences and the Presence of a Heuristic Rule in Teaching Coordinate Concepts.

    ERIC Educational Resources Information Center

    Olsen, James B.; And Others

    A total of 169 college students participated in two experiments investigating the effects of eight instructional sequences and the presence of a heuristic rule in the teaching of four coordinate concepts: trochaic, iambic, dactylic, and anapestic poetic meters. A four-factor experimental design was used: pure simultaneous or sequential…

  12. High School Students' Attitudes and Beliefs on Using the Science Writing Heuristic in an Advanced Placement Chemistry Class

    ERIC Educational Resources Information Center

    Putti, Alice

    2011-01-01

    This paper discusses student attitudes and beliefs on using the Science Writing Heuristic (SWH) in an advanced placement (AP) chemistry classroom. During the 2007 school year, the SWH was used in a class of 24 AP chemistry students. Using a Likert-type survey, student attitudes and beliefs on the process were determined. Methods for the study are…

  13. Human and nature-caused hazards: the affect heuristic causes biased decisions.

    PubMed

    Siegrist, Michael; Sütterlin, Bernadette

    2014-08-01

    People are more concerned about the negative consequences of human hazards compared with natural hazards. Results of four experiments show that the same negative outcome (e.g., number of birds killed by an oil spill) was more negatively evaluated when caused by humans than when caused by nature. Results further show that when identical risk information was provided, participants evaluated nuclear power more negatively compared with solar power. The affect associated with the hazard per se influenced the interpretation of the new information. Furthermore, the affect experienced in the situation fully mediated the evaluation of the negative outcomes of a hazard. People's reliance on the affect heuristic is a challenge for acceptance of cost-benefit analyses because equally negative outcomes are differently evaluated depending on the cause. Symbolically significant information and the affect evoked by this information may result in biased and riskier decisions.

  14. An efficient heuristic method for dynamic portfolio selection problem under transaction costs and uncertain conditions

    NASA Astrophysics Data System (ADS)

    Najafi, Amir Abbas; Pourahmadi, Zahra

    2016-04-01

    Selecting the optimal combination of assets in a portfolio is one of the most important decisions in investment management. As investment is a long term concept, looking into a portfolio optimization problem just in a single period may cause loss of some opportunities that could be exploited in a long term view. Hence, it is tried to extend the problem from single to multi-period model. We include trading costs and uncertain conditions to this model which made it more realistic and complex. Hence, we propose an efficient heuristic method to tackle this problem. The efficiency of the method is examined and compared with the results of the rolling single-period optimization and the buy and hold method which shows the superiority of the proposed method.

  15. Multifrequency and multidirection optimizations of antenna arrays using heuristic algorithms and the multilevel fast multipole algorithm

    NASA Astrophysics Data System (ADS)

    Önol, Can; Alkış, Sena; Gökçe, Özer; Ergül, Özgür

    2016-07-01

    We consider fast and efficient optimizations of arrays involving three-dimensional antennas with arbitrary shapes and geometries. Heuristic algorithms, particularly genetic algorithms, are used for optimizations, while the required solutions are carried out accurately and efficiently via the multilevel fast multipole algorithm (MLFMA). The superposition principle is employed to reduce the number of MLFMA solutions to the number of array elements per frequency. The developed mechanism is used to optimize arrays for multifrequency and/or multidirection operations, i.e., to find the most suitable set of antenna excitations for desired radiation characteristics simultaneously at different frequencies and/or directions. The capabilities of the optimization environment are demonstrated on arrays of bowtie and Vivaldi antennas.

  16. A Heuristic Approach to the Determination of the Effective Thermal Conductivity Coefficients of Biperiodic Composite Media

    NASA Astrophysics Data System (ADS)

    Yankovskii, A. P.

    2016-11-01

    A heuristic approach to determining the effective thermal conductivity coefficients of unidirectionally reinforced biperiodic composite media is suggested allowing one to substantially refine the calculated values of the effective coefficients of transverse thermal conductivity of the indicated compositions by using the simplest partitioning of a periodicity cell into thin layers (subelements) with subsequent application of the simplest formulas of averaging by simple and inverse mixture rules. A comparison of the calculated values of these coefficients with familiar experimental data is made. The good agreement of the prediction with experiment allows an assumption that the method developed can be used for practical calculations of the thermophysical characteristics of fibrous media with biperiodic structure. At the present time the accuracy of more complex structural models of the thermal conductivity of unidirectionally reinforced composites lacks a strict experimental justification.

  17. Radial distribution function for hard spheres in fractal dimensions: A heuristic approximation.

    PubMed

    Santos, Andrés; de Haro, Mariano López

    2016-06-01

    Analytic approximations for the radial distribution function, the structure factor, and the equation of state of hard-core fluids in fractal dimension d (1≤d≤3) are developed as heuristic interpolations from the knowledge of the exact and Percus-Yevick results for the hard-rod and hard-sphere fluids, respectively. In order to assess their value, such approximate results are compared with those of recent Monte Carlo simulations and numerical solutions of the Percus-Yevick equation for a fractal dimension [M. Heinen et al., Phys. Rev. Lett. 115, 097801 (2015)PRLTAO0031-900710.1103/PhysRevLett.115.097801], a good agreement being observed.

  18. A Heuristic Model of Consciousness with Applications to the Development of Science and Society

    NASA Technical Reports Server (NTRS)

    Curreri, Peter A.

    2010-01-01

    A working model of consciousness is fundamental to understanding of the interactions of the observer in science. This paper examines contemporary understanding of consciousness. A heuristic model of consciousness is suggested that is consistent with psycophysics measurements of bandwidth of consciousness relative to unconscious perception. While the self reference nature of consciousness confers a survival benefit by assuring the all points of view regarding a problem are experienced in sufficiently large population, conscious bandwidth is constrained by design to avoid chaotic behavior. The multiple hypotheses provided by conscious reflection enable the rapid progression of science and technology. The questions of free will and the problem of attention are discussed in relation to the model. Finally the combination of rapid technology growth with the assurance of many unpredictable points of view is considered in respect to contemporary constraints to the development of society.

  19. Implicit attitudes toward nuclear power and mobile phone base stations: support for the affect heuristic.

    PubMed

    Siegrist, Michael; Keller, Carmen; Cousin, Marie-Eve

    2006-08-01

    The implicit association test (IAT) measures automatic associations. In the present research, the IAT was adapted to measure implicit attitudes toward technological hazards. In Study 1, implicit and explicit attitudes toward nuclear power were examined. Implicit measures (i.e., the IAT) revealed negative attitudes toward nuclear power that were not detected by explicit measures (i.e., a questionnaire). In Study 2, implicit attitudes toward EMF (electro-magnetic field) hazards were examined. Results showed that cell phone base stations and power lines are judged to be similarly risky and, further, that base stations are more closely related to risk concepts than home appliances are. No differences between experts and lay people were observed. Results of the present studies are in line with the affect heuristic proposed by Slovic and colleagues. Affect seems to be an important factor in risk perception.

  20. Impact of variable body size on pedestrian dynamics by heuristics-based model

    NASA Astrophysics Data System (ADS)

    Guo, Ning; Hu, Mao-Bin; Jiang, Rui

    2017-01-01

    In the real world, pedestrians can arch the shoulders or rotate their bodies actively to across the narrow space. The method is helpful to reduce the effective size of the body. In this paper, the impact of variable body size on the direction choice has been investigated by an improved heuristic-based model. In the model, it is assumed that the cost of adjusting body size is a factor in the process to evaluate the optimal direction. In a typical simulation scenario, the pedestrian reluctant to adjust body size will pass by the blocks. On the contrary, the pedestrian caring little about body size will traverse through the exit. There is a direction-choice change behavior between bypass and traverse considering block width and the initial location of the pedestrian.

  1. Sequence heuristics to encode phase behaviour in intrinsically disordered protein polymers

    PubMed Central

    Quiroz, Felipe García; Chilkoti, Ashutosh

    2015-01-01

    Proteins and synthetic polymers that undergo aqueous phase transitions mediate self-assembly in nature and in man-made material systems. Yet little is known about how the phase behaviour of a protein is encoded in its amino acid sequence. Here, by synthesizing intrinsically disordered, repeat proteins to test motifs that we hypothesized would encode phase behaviour, we show that the proteins can be designed to exhibit tunable lower or upper critical solution temperature (LCST and UCST, respectively) transitions in physiological solutions. We also show that mutation of key residues at the repeat level abolishes phase behaviour or encodes an orthogonal transition. Furthermore, we provide heuristics to identify, at the proteome level, proteins that might exhibit phase behaviour and to design novel protein polymers consisting of biologically active peptide repeats that exhibit LCST or UCST transitions. These findings set the foundation for the prediction and encoding of phase behaviour at the sequence level. PMID:26390327

  2. Identifying and Addressing Stakeholder Interests in Design Science Research: An Analysis Using Critical Systems Heuristics

    NASA Astrophysics Data System (ADS)

    Venable, John R.

    This paper utilises the Critical Systems Heuristics (CSH) framework developed by Werner Ulrich to critically consider the stakeholders and design goals that should be considered as relevant by researchers conducing Design Science Research (DSR). CSH provides a philosophically and theoretically grounded framework and means for critical consideration of the choices of stakeholders considered to be relevant to any system under design consideration. The paper recommends that legitimately undertaken DSR should include witnesses to represent the interests of the future consumers of the outcomes of DSR, i.e., the future clients, decision makers, professionals, and other non-included stakeholders in the future use of the solution technologies to be invented in DSR. The paper further discusses options for how witnesses might be included, who should be witnessed for and obstacles to implementing the recommendations.

  3. An explanatory heuristic gives rise to the belief that words are well suited for their referents.

    PubMed

    Sutherland, Shelbie L; Cimpian, Andrei

    2015-10-01

    The mappings between the words of a language and their meanings are arbitrary. There is, for example, nothing inherently dog-like about the word dog. And yet, building on prior evidence (e.g., Brook, 1970; Piaget, 1967), the six studies reported here (N=1062) suggest that both children and (at least to some extent) adults see a special "fit" between objects and their names, as if names were particularly suitable or appropriate for the objects they denote. These studies also provide evidence for a novel proposal concerning the source of these nominal fit beliefs. Specifically, beliefs about nominal fit may be a byproduct of the heuristic processes that people use to make sense of the world more generally (Cimpian & Salomon, 2014a). In sum, the present studies provide new insights into how people conceive of language and demonstrate that these conceptions are rooted in the processes that underlie broader explanatory reasoning.

  4. An illustrated heuristic prototype facilitates scientific inventive problem solving: A functional magnetic resonance imaging study.

    PubMed

    Tong, Dandan; Li, Wenfu; Tang, Chaoying; Yang, Wenjing; Tian, Yan; Zhang, Lei; Zhang, Meng; Qiu, Jiang; Liu, Yijun; Zhang, Qinglin

    2015-07-01

    Many scientific inventions (SI) throughout history were inspired by heuristic prototypes (HPs). For instance, an event or piece of knowledge similar to displaced water from a tub inspired Archimedes' principle. However, the neural mechanisms underlying this insightful problem solving are not very clear. Thus, the present study explored the neural correlates used to solve SI problems facilitated by HPs. Each HP had two versions: a literal description with an illustration (LDI) and a literal description with no illustration (LDNI). Thirty-two participants were divided randomly into these two groups. Blood oxygenation level-dependent fMRI contrasts between LDI and LDNI groups were measured. Greater activity in the right middle occipital gyrus (RMOG, BA19), right precentral gyrus (RPCG, BA4), and left middle frontal gyrus (LMFG, BA46) were found within the LDI group as compared to the LDNI group. We discuss these results in terms cognitive functions within these regions related to problem solving and memory retrieval.

  5. Heuristic procedure for the assembly line balancing problem with postural load smoothness.

    PubMed

    Jaturanonda, Chorkaew; Nanthavanij, Suebsak; Das, Sanchoy K

    2013-01-01

    This paper presents a heuristic procedure for assigning assembly tasks to workstations where both productivity and ergonomics issues are considered concurrently. The procedure uses Kilbridge and Wester's algorithm to obtain an initial task-workstation assignment solution which minimizes the balance delay of an assembly line. A task reassignment algorithm was applied to improve the initial solution by exchanging assembly tasks, which smooth postural load among workers, between workstations. A composite index of variation was used to measure the effectiveness of the task-workstation assignment solution. On the basis of clothes assembling, it was found that the task-workstation assignment solution with a minimum composite index of variation can be obtained with relatively equal weights in balance delay and postural load.

  6. Direct heuristic dynamic programming for damping oscillations in a large power system.

    PubMed

    Lu, Chao; Si, Jennie; Xie, Xiaorong

    2008-08-01

    This paper applies a neural-network-based approximate dynamic programming method, namely, the direct heuristic dynamic programming (direct HDP), to a large power system stability control problem. The direct HDP is a learning- and approximation-based approach to addressing nonlinear coordinated control under uncertainty. One of the major design parameters, the controller learning objective function, is formulated to directly account for network-wide low-frequency oscillation with the presence of nonlinearity, uncertainty, and coupling effect among system components. Results include a novel learning control structure based on the direct HDP with applications to two power system problems. The first case involves static var compensator supplementary damping control, which is used to provide a comprehensive evaluation of the learning control performance. The second case aims at addressing a difficult complex system challenge by providing a new solution to a large interconnected power network oscillation damping control problem that frequently occurs in the China Southern Power Grid.

  7. Heuristic model of chemically induced electron spin polarization in two dimensions

    NASA Astrophysics Data System (ADS)

    Adrian, Frank J.

    2010-11-01

    A heuristic model of chemically induced electron spin polarization (CIDEP) that breaks the polarization mechanism into its component steps, with each step governed by an appropriate solution of the diffusion equation, is extended from a three to a two-dimensional system. The required solution of the 2D diffusion equation is provided by a relatively simple analytic approximation to the usual infinite series solution. The model yields the polarization and its time development for weak to strong singlet-triplet mixing in the radical pairs, whereas previous models are limited to very weak or very strong mixing. Its results agree with a variational solution of an integral equation of Monchick and are encouraging for observation of CIDEP in dimensionally restricted systems. The method also may be applicable to other diffusion-controlled, spin-dependent chemistry in spatially restricted environments.

  8. Heuristic optimization of pressurized water reactor fuel cycle design under general constraints

    SciTech Connect

    Moon, H.; Levine, S.H. ); Mahgerefteh, M. )

    1989-12-01

    Optimization techniques in fuel management have directed modern fuel cycle designs to use low-leakage loading patterns. Future optimization calculations involving low-leakage patterns must utilize nucleonic models that are both fast operationally and rigorous. A two-dimensional two-group diffusion theory code is developed and lattice homogenization constants are generated using a modified LEOPARD code to fulfill these criteria. Based on these two codes, a heuristic optimization study is performed that considers the general constraints (e.g., spent-fuel storage limit and mechanical burnup limit) given to a utility fuel cycle designer. The optimum cycle length that minimizes the fuel cost is {approximately} 600 effective full-power days for the conditions assumed.

  9. Heuristic Experiments of Threading and Equal Load Partitioning For Hierarchical Heterogeneous Cluster

    NASA Astrophysics Data System (ADS)

    Khalid, Noor Elaiza Abdul; Hashim, Rathiah; Noor, Noorhayati Mohamed; Helmi Rosli, Muhammad; Manaf, Mazani

    2016-11-01

    Presently, the issue of processing large data on a timely manner poses as a challenge to many ICT researchers. Most commodity computers are interconnected in a network forming a cluster computing resource simulating a super computer. This paper explores heuristically the performance of homogeneous, heterogeneous and multi-core clusters. This work consists of five experiments: Equal task partitioning according to the number of nodes in homogeneous cluster, number of nodes in heterogeneous cluster, number of nodes in heterogeneous cluster with multithreading, number of cores in heterogeneous cluster and number of cores in heterogeneous cluster with multithreading. The task is Sobel edge detection method tested with an array of images. The images are processed in three different sizes; 1K × 1K, 2K × 2K and 3K × 3K. The performance evaluations are based on processing speed. The results yield promising impact of equal partitioning and threading in parallel processing hierarchical heterogeneous cluster.

  10. Heuristic reduction of gyro drift in gyro-based vehicle tracking

    NASA Astrophysics Data System (ADS)

    Borenstein, Johann; Ojeda, Lauro

    2009-05-01

    This paper pertains to the reduction of measurement errors due to drift in rate gyros used for tracking the position of moving vehicles. In these applications, gyros and odometry are often used to augment GPS when GPS reception is unavailable. Drift in gyros causes the unbounded growth of errors in the estimation of heading, rendering low-cost gyros almost entirely useless in applications that require good accuracy for more than just a few seconds or minutes. Our proposed method, called "Heuristic Drift Reduction" (HDR), applies a unique closed-loop control system approach to estimate drift in real-time and remove the estimated drift instantaneously from the gyro reading. The paper presents results of experiments, in which a gyro-equipped car was driven hundreds of miles on highways, rural roads, and city streets. HDR reduced the average heading error over all of these drives by one order of magnitude.

  11. Applying heuristic evaluation to observation chart design to improve the detection of patient deterioration.

    PubMed

    Preece, Megan H W; Hill, Andrew; Horswill, Mark S; Karamatic, Rozemary; Hewett, David G; Watson, Marcus O

    2013-07-01

    A key goal for patient safety is to improve the early recognition and management of patients whose conditions deteriorate whilst in hospital. Paper-based observation charts are the main means of recording and monitoring patients' physiological stability, yet observations (e.g., blood pressure, heart rate, and respiratory rate) are not always correctly recorded or appropriately acted upon. No prior published study has applied usability heuristics to systematically compare the usability of multiple observation chart designs. In this study, five evaluators with human factors, applied psychology, or medical expertise inspected 25 observation charts for usability problems. Every chart was found to have substantial usability problems, potentially affecting the ability of hospital staff to accurately record observations or recognize patient deterioration. We proposed a new observation chart design, which avoids many of the previously observed usability problems.

  12. Sequence heuristics to encode phase behaviour in intrinsically disordered protein polymers.

    PubMed

    Quiroz, Felipe García; Chilkoti, Ashutosh

    2015-11-01

    Proteins and synthetic polymers that undergo aqueous phase transitions mediate self-assembly in nature and in man-made material systems. Yet little is known about how the phase behaviour of a protein is encoded in its amino acid sequence. Here, by synthesizing intrinsically disordered, repeat proteins to test motifs that we hypothesized would encode phase behaviour, we show that the proteins can be designed to exhibit tunable lower or upper critical solution temperature (LCST and UCST, respectively) transitions in physiological solutions. We also show that mutation of key residues at the repeat level abolishes phase behaviour or encodes an orthogonal transition. Furthermore, we provide heuristics to identify, at the proteome level, proteins that might exhibit phase behaviour and to design novel protein polymers consisting of biologically active peptide repeats that exhibit LCST or UCST transitions. These findings set the foundation for the prediction and encoding of phase behaviour at the sequence level.

  13. A simple heuristic for Internet-based evidence search in primary care: a randomized controlled trial

    PubMed Central

    Eberbach, Andreas; Becker, Annette; Rochon, Justine; Finkemeler, Holger; Wagner, Achim; Donner-Banzhoff, Norbert

    2016-01-01

    Background General practitioners (GPs) are confronted with a wide variety of clinical questions, many of which remain unanswered. Methods In order to assist GPs in finding quick, evidence-based answers, we developed a learning program (LP) with a short interactive workshop based on a simple three-step-heuristic to improve their search and appraisal competence (SAC). We evaluated the LP effectiveness with a randomized controlled trial (RCT). Participants (intervention group [IG] n=20; control group [CG] n=31) rated acceptance and satisfaction and also answered 39 knowledge questions to assess their SAC. We controlled for previous knowledge in content areas covered by the test. Results Main outcome – SAC: within both groups, the pre–post test shows significant (P=0.00) improvements in correctness (IG 15% vs CG 11%) and confidence (32% vs 26%) to find evidence-based answers. However, the SAC difference was not significant in the RCT. Other measures Most workshop participants rated “learning atmosphere” (90%), “skills acquired” (90%), and “relevancy to my practice” (86%) as good or very good. The LP-recommendations were implemented by 67% of the IG, whereas 15% of the CG already conformed to LP recommendations spontaneously (odds ratio 9.6, P=0.00). After literature search, the IG showed a (not significantly) higher satisfaction regarding “time spent” (IG 80% vs CG 65%), “quality of information” (65% vs 54%), and “amount of information” (53% vs 47%). Conclusion Long-standing established GPs have a good SAC. Despite high acceptance, strong learning effects, positive search experience, and significant increase of SAC in the pre–post test, the RCT of our LP showed no significant difference in SAC between IG and CG. However, we suggest that our simple decision heuristic merits further investigation. PMID:27563264

  14. A Heuristic Indication and Warning Staging Model for Detection and Assessment of Biological Events

    PubMed Central

    Wilson, James M.; Polyak, Marat G.; Blake, Jane W.; Collmann, Jeff

    2008-01-01

    Objective This paper presents a model designed to enable rapid detection and assessment of biological threats that may require swift intervention by the international public health community. Design We utilized Strauss’ grounded theory to develop an expanded model of social disruption due to biological events based on retrospective and prospective case studies. We then applied this model to the temporal domain and propose a heuristic staging model, the Wilson–Collmann Scale for assessing biological event evolution. Measurements We retrospectively and manually examined hard copy archival local media reports in the native vernacular for three biological events associated with substantial social disruption. The model was then tested prospectively through media harvesting based on keywords corresponding to the model parameters. Results Our heuristic staging model provides valuable information about the features of a biological event that can be used to determine the level of concern warranted, such as whether the pathogen in question is responding to established public health disease control measures, including the use of antimicrobials or vaccines; whether the public health and medical infrastructure of the country involved is adequate to mount the necessary response; whether the country’s officials are providing an appropriate level of information to international public health authorities; and whether the event poses a international threat. The approach is applicable for monitoring open-source (public-domain) media for indications and warnings of such events, and specifically for markers of the social disruption that commonly occur as these events unfold. These indications and warnings can then be used as the basis for staging the biological threat in the same manner that the United States National Weather Service currently uses storm warning models (such as the Saffir-Simpson Hurricane Scale) to detect and assess threatening weather conditions. Conclusion

  15. A set-covering based heuristic algorithm for the periodic vehicle routing problem.

    PubMed

    Cacchiani, V; Hemmelmayr, V C; Tricoire, F

    2014-01-30

    We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems.

  16. Simple heuristics in over-the-counter drug choices: a new hint for medical education and practice

    PubMed Central

    Riva, Silvia; Monti, Marco; Antonietti, Alessandro

    2011-01-01

    Introduction Over-the-counter (OTC) drugs are widely available and often purchased by consumers without advice from a health care provider. Many people rely on self-management of medications to treat common medical conditions. Although OTC medications are regulated by the National and the International Health and Drug Administration, many people are unaware of proper dosing, side effects, adverse drug reactions, and possible medication interactions. Purpose This study examined how subjects make their decisions to select an OTC drug, evaluating the role of cognitive heuristics which are simple and adaptive rules that help the decision-making process of people in everyday contexts. Subjects and methods By analyzing 70 subjects’ information-search and decision-making behavior when selecting OTC drugs, we examined the heuristics they applied in order to assess whether simple decision-making processes were also accurate and relevant. Subjects were tested with a sequence of two experimental tests based on a computerized Java system devised to analyze participants’ choices in a virtual environment. Results We found that subjects’ information-search behavior reflected the use of fast and frugal heuristics. In addition, although the heuristics which correctly predicted subjects’ decisions implied significantly fewer cues on average than the subjects did in the information-search task, they were accurate in describing order of information search. A simple combination of a fast and frugal tree and a tallying rule predicted more than 78% of subjects’ decisions. Conclusion The current emphasis in health care is to shift some responsibility onto the consumer through expansion of self medication. To know which cognitive mechanisms are behind the choice of OTC drugs is becoming a relevant purpose of current medical education. These findings have implications both for the validity of simple heuristics describing information searches in the field of OTC drug choices and

  17. How should "hot" players in basketball be defended? The use of fast-and-frugal heuristics by basketball coaches and players in response to streakiness.

    PubMed

    Csapo, Peter; Avugos, Simcha; Raab, Markus; Bar-Eli, Michael

    2015-01-01

    Previous research has shown that changes in shot difficulty may have rendered the hot-hand effect in basketball unobservable and are potentially a result of defensive adjustments. However, it has not been directly analysed whether strategic changes indeed take place in response to streakiness and whether they are effective with respect to winning games. The current work consists of an experimental study with 18 professional coaches and 20 players based on video sequences from National Basketball Association games, where the shown player displayed a streaky performance in half of the sequences. While coaches were asked to devise a defensive strategy after each viewed sequence, players had to assume the role of the shown player and decide whether to shoot or pass the ball. We find that coaches tended to increase the defensive pressure significantly more often on presumably hot players and thus make use of the hot-hand heuristic. Meanwhile, players chose to shoot more frequently in low-pressure and streaky situations but selected "pass" regardless of the previous performance when they faced increased defensive pressure. Assuming that a streaky player's performance is indeed elevated during hot phases, hot-hand behaviour can be considered adaptive in certain situations as it led hot players to pass instead of shoot.

  18. More equal than others: Equity norms as an integration of cognitive heuristics and contextual cues in bargaining games.

    PubMed

    Civai, Claudia; Rumiati, Raffaella Ida; Rustichini, Aldo

    2013-09-01

    Behavior in one-shot bargaining games, like the Ultimatum Game (UG), has been interpreted as an expression of social preferences, such as inequity aversion and negative reciprocity; however, the traditional UG design limits the range of possible psychological interpretation of the results. Here, we employed three different designs for ultimatum games, finding support for a more comprehensive theory: behavior is driven by cognitive factors implementing rules such as equal splitting, speaking up for the idea that equity works as a cognitive heuristic, applicable when the environment provides no reason to behave otherwise. Instead subjects deviate from this rule when environment changes, as, for instance, when personal interest is at stake. Results show that behavior varies systematically with contextual cues, balancing the self-interest with the automatic application of the equity heuristic. Thus, the context suggests the rule to be applied in a specific situation.

  19. Solving large-scale fixed cost integer linear programming models for grid-based location problems with heuristic techniques

    NASA Astrophysics Data System (ADS)

    Noor-E-Alam, Md.; Doucette, John

    2015-08-01

    Grid-based location problems (GBLPs) can be used to solve location problems in business, engineering, resource exploitation, and even in the field of medical sciences. To solve these decision problems, an integer linear programming (ILP) model is designed and developed to provide the optimal solution for GBLPs considering fixed cost criteria. Preliminary results show that the ILP model is efficient in solving small to moderate-sized problems. However, this ILP model becomes intractable in solving large-scale instances. Therefore, a decomposition heuristic is proposed to solve these large-scale GBLPs, which demonstrates significant reduction of solution runtimes. To benchmark the proposed heuristic, results are compared with the exact solution via ILP. The experimental results show that the proposed method significantly outperforms the exact method in runtime with minimal (and in most cases, no) loss of optimality.

  20. Helping Reasoners Succeed in the Wason Selection Task: When Executive Learning Discourages Heuristic Response but Does Not Necessarily Encourage Logic

    PubMed Central

    Rossi, Sandrine; Cassotti, Mathieu; Moutier, Sylvain; Delcroix, Nicolas; Houdé, Olivier

    2015-01-01

    Reasoners make systematic logical errors by giving heuristic responses that reflect deviations from the logical norm. Influential studies have suggested first that our reasoning is often biased because we minimize cognitive effort to surpass a cognitive conflict between heuristic response from system 1 and analytic response from system 2 thinking. Additionally, cognitive control processes might be necessary to inhibit system 1 responses to activate a system 2 response. Previous studies have shown a significant effect of executive learning (EL) on adults who have transferred knowledge acquired on the Wason selection task (WST) to another isomorphic task, the rule falsification task (RFT). The original paradigm consisted of teaching participants to inhibit a classical matching heuristic that sufficed the first problem and led to significant EL transfer on the second problem. Interestingly, the reasoning tasks differed in inhibiting-heuristic metacognitive cost. Success on the WST requires half-suppression of the matching elements. In contrast, the RFT necessitates a global rejection of the matching elements for a correct answer. Therefore, metacognitive learning difficulty most likely differs depending on whether one uses the first or second task during the learning phase. We aimed to investigate this difficulty and various matching-bias inhibition effects in a new (reversed) paradigm. In this case, the transfer effect from the RFT to the WST could be more difficult because the reasoner learns to reject all matching elements in the first task. We observed that the EL leads to a significant reduction in matching selections on the WST without increasing logical performances. Interestingly, the acquired metacognitive knowledge was too “strictly” transferred and discouraged matching rather than encouraging logic. This finding underlines the complexity of learning transfer and adds new evidence to the pedagogy of reasoning. PMID:25849555