Gigerenzer, Gerd
2009-01-01
In their comment on Marewski et al. (good judgments do not require complex cognition, 2009) Evans and Over (heuristic thinking and human intelligence: a commentary on Marewski, Gaissmaier and Gigerenzer, 2009) conjectured that heuristics can often lead to biases and are not error free. This is a most surprising critique. The computational models of heuristics we have tested allow for quantitative predictions of how many errors a given heuristic will make, and we and others have measured the amount of error by analysis, computer simulation, and experiment. This is clear progress over simply giving heuristics labels, such as availability, that do not allow for quantitative comparisons of errors. Evans and Over argue that the reason people rely on heuristics is the accuracy-effort trade-off. However, the comparison between heuristics and more effortful strategies, such as multiple regression, has shown that there are many situations in which a heuristic is more accurate with less effort. Finally, we do not see how the fast and frugal heuristics program could benefit from a dual-process framework unless the dual-process framework is made more precise. Instead, the dual-process framework could benefit if its two “black boxes” (Type 1 and Type 2 processes) were substituted by computational models of both heuristics and other processes. PMID:19784854
Near-Optimal Tracking Control of Mobile Robots Via Receding-Horizon Dual Heuristic Programming.
Lian, Chuanqiang; Xu, Xin; Chen, Hong; He, Haibo
2016-11-01
Trajectory tracking control of wheeled mobile robots (WMRs) has been an important research topic in control theory and robotics. Although various tracking control methods with stability have been developed for WMRs, it is still difficult to design optimal or near-optimal tracking controller under uncertainties and disturbances. In this paper, a near-optimal tracking control method is presented for WMRs based on receding-horizon dual heuristic programming (RHDHP). In the proposed method, a backstepping kinematic controller is designed to generate desired velocity profiles and the receding horizon strategy is used to decompose the infinite-horizon optimal control problem into a series of finite-horizon optimal control problems. In each horizon, a closed-loop tracking control policy is successively updated using a class of approximate dynamic programming algorithms called finite-horizon dual heuristic programming (DHP). The convergence property of the proposed method is analyzed and it is shown that the tracking control system based on RHDHP is asymptotically stable by using the Lyapunov approach. Simulation results on three tracking control problems demonstrate that the proposed method has improved control performance when compared with conventional model predictive control (MPC) and DHP. It is also illustrated that the proposed method has lower computational burden than conventional MPC, which is very beneficial for real-time tracking control.
Probabilistic dual heuristic programming-based adaptive critic
NASA Astrophysics Data System (ADS)
Herzallah, Randa
2010-02-01
Adaptive critic (AC) methods have common roots as generalisations of dynamic programming for neural reinforcement learning approaches. Since they approximate the dynamic programming solutions, they are potentially suitable for learning in noisy, non-linear and non-stationary environments. In this study, a novel probabilistic dual heuristic programming (DHP)-based AC controller is proposed. Distinct to current approaches, the proposed probabilistic (DHP) AC method takes uncertainties of forward model and inverse controller into consideration. Therefore, it is suitable for deterministic and stochastic control problems characterised by functional uncertainty. Theoretical development of the proposed method is validated by analytically evaluating the correct value of the cost function which satisfies the Bellman equation in a linear quadratic control problem. The target value of the probabilistic critic network is then calculated and shown to be equal to the analytically derived correct value. Full derivation of the Riccati solution for this non-standard stochastic linear quadratic control problem is also provided. Moreover, the performance of the proposed probabilistic controller is demonstrated on linear and non-linear control examples.
Adapting Nielsen’s Design Heuristics to Dual Processing for Clinical Decision Support
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
Adapting Nielsen's Design Heuristics to Dual Processing for Clinical Decision Support.
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.
On Dual Processing and Heuristic Approaches to Moral Cognition
ERIC Educational Resources Information Center
Lapsley, Daniel K.; Hill, Patrick L.
2008-01-01
We examine the implications of dual-processing theories of cognition for the moral domain, with particular emphasis upon "System 1" theories: the Social Intuitionist Model (Haidt), moral heuristics (Sunstein), fast-and-frugal moral heuristics (Gigerenzer), schema accessibility (Lapsley & Narvaez) and moral expertise (Narvaez). We argue that these…
Gr-GDHP: A New Architecture for Globalized Dual Heuristic Dynamic Programming.
Zhong, Xiangnan; Ni, Zhen; He, Haibo
2017-10-01
Goal representation globalized dual heuristic dynamic programming (Gr-GDHP) method is proposed in this paper. A goal neural network is integrated into the traditional GDHP method providing an internal reinforcement signal and its derivatives to help the control and learning process. From the proposed architecture, it is shown that the obtained internal reinforcement signal and its derivatives can be able to adjust themselves online over time rather than a fixed or predefined function in literature. Furthermore, the obtained derivatives can directly contribute to the objective function of the critic network, whose learning process is thus simplified. Numerical simulation studies are applied to show the performance of the proposed Gr-GDHP method and compare the results with other existing adaptive dynamic programming designs. We also investigate this method on a ball-and-beam balancing system. The statistical simulation results are presented for both the Gr-GDHP and the GDHP methods to demonstrate the improved learning and controlling performance.
Proportional reasoning as a heuristic-based process: time constraint and dual task considerations.
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.
Adaptive critic designs for discrete-time zero-sum games with application to H(infinity) control.
Al-Tamimi, Asma; Abu-Khalaf, Murad; Lewis, Frank L
2007-02-01
In this correspondence, adaptive critic approximate dynamic programming designs are derived to solve the discrete-time zero-sum game in which the state and action spaces are continuous. This results in a forward-in-time reinforcement learning algorithm that converges to the Nash equilibrium of the corresponding zero-sum game. The results in this correspondence can be thought of as a way to solve the Riccati equation of the well-known discrete-time H(infinity) optimal control problem forward in time. Two schemes are presented, namely: 1) a heuristic dynamic programming and 2) a dual-heuristic dynamic programming, to solve for the value function and the costate of the game, respectively. An H(infinity) autopilot design for an F-16 aircraft is presented to illustrate the results.
GrDHP: a general utility function representation for dual heuristic dynamic programming.
Ni, Zhen; He, Haibo; Zhao, Dongbin; Xu, Xin; Prokhorov, Danil V
2015-03-01
A general utility function representation is proposed to provide the required derivable and adjustable utility function for the dual heuristic dynamic programming (DHP) design. Goal representation DHP (GrDHP) is presented with a goal network being on top of the traditional DHP design. This goal network provides a general mapping between the system states and the derivatives of the utility function. With this proposed architecture, we can obtain the required derivatives of the utility function directly from the goal network. In addition, instead of a fixed predefined utility function in literature, we conduct an online learning process for the goal network so that the derivatives of the utility function can be adaptively tuned over time. We provide the control performance of both the proposed GrDHP and the traditional DHP approaches under the same environment and parameter settings. The statistical simulation results and the snapshot of the system variables are presented to demonstrate the improved learning and controlling performance. We also apply both approaches to a power system example to further demonstrate the control capabilities of the GrDHP approach.
De Neys, Wim
2006-06-01
Human reasoning has been shown to overly rely on intuitive, heuristic processing instead of a more demanding analytic inference process. Four experiments tested the central claim of current dual-process theories that analytic operations involve time-consuming executive processing whereas the heuristic system would operate automatically. Participants solved conjunction fallacy problems and indicative and deontic selection tasks. Experiment 1 established that making correct analytic inferences demanded more processing time than did making heuristic inferences. Experiment 2 showed that burdening the executive resources with an attention-demanding secondary task decreased correct, analytic responding and boosted the rate of conjunction fallacies and indicative matching card selections. Results were replicated in Experiments 3 and 4 with a different secondary-task procedure. Involvement of executive resources for the deontic selection task was less clear. Findings validate basic processing assumptions of the dual-process framework and complete the correlational research programme of K. E. Stanovich and R. F. West (2000).
Analytic and heuristic processes in the detection and resolution of conflict.
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.
Furlan, Sarah; Agnoli, Franca; Reyna, Valerie F
2013-08-01
Dual-process theories have been proposed to explain normative and heuristic responses to reasoning and decision-making problems. Standard unitary and dual-process theories predict that normative responses should increase with age. However, research has focused recently on exceptions to this standard pattern, including developmental increases in heuristic or intuitive responses. Developmental trends for normative and heuristic responses were investigated for 2 kinds of causal reasoning (if-only and covariation) problems in 2 experiments. To investigate the role of superstitious thinking in these developmental trends, in both experiments a superstitious element was added to the problem solved by half the participants. In the first experiment, 90 fifth graders, 99 seventh graders, and 153 adults responded to an if-only problem. Children performed better than adults, with normative responses decreasing and heuristic responses increasing with age. A superstitious jinx intended to reduce heuristic responses had little effect for all age groups. In the second experiment, 276 fifth graders, 344 seventh graders, and 90 adults responded to a covariation-detection problem. When win-loss ratios were equal, adults performed better than children, with normative responses increasing and heuristic responses decreasing with age. When win-loss ratios were strikingly different, however, even the youngest children were able to solve the problems correctly; participants of all ages responded about equally well. When the normative response required recognizing that a good-luck ritual led to better team performance, participants in all age groups responded skeptically that the ritual had no effect, illustrating belief bias. These results are discussed in terms of dual-process theories and the development of heuristic (or intuitive) and analytical processes. (PsycINFO Database Record (c) 2013 APA, all rights reserved).
S., Furlan; F., Agnoli; V. F., Reyna
2013-01-01
Dual-process theories have been proposed to explain normative and heuristic responses to reasoning and decision-making problems. Standard unitary and dual-process theories predict that normative responses should increase with age. However, research has focused recently on exceptions to this standard pattern, including developmental increases in heuristic or intuitive responses. Developmental trends for normative and heuristic responses were investigated for two kinds of causal reasoning (if-only and covariation) problems in two experiments. To investigate the role of superstitious thinking in these developmental trends, in both experiments a superstitious element was added to the problem solved by half the participants. In the first experiment, 90 fifth graders, 99 seventh graders, and 153 adults responded to an if-only problem. Children performed better than adults, with normative responses decreasing and heuristic responses increasing with age. A superstitious jinx intended to reduce heuristic responses had little effect for all age groups. In the second experiment, 276 fifth graders, 344 seventh graders, and 90 adults responded to a covariation-detection problem. When win-loss ratios were equal, adults performed better than children, with normative responses increasing and heuristic responses decreasing with age. When win-loss ratios were strikingly different, however, even the youngest children were able to solve the problems correctly; participants of all ages responded about equally well. When the normative response required recognizing that a good-luck ritual led to better team performance, participants in all age groups responded skeptically that the ritual had no effect, illustrating belief bias. These results are discussed in terms of dual process theories and the development of heuristic (or intuitive) and analytical processes. PMID:23148936
Clipping in neurocontrol by adaptive dynamic programming.
Fairbank, Michael; Prokhorov, Danil; Alonso, Eduardo
2014-10-01
In adaptive dynamic programming, neurocontrol, and reinforcement learning, the objective is for an agent to learn to choose actions so as to minimize a total cost function. In this paper, we show that when discretized time is used to model the motion of the agent, it can be very important to do clipping on the motion of the agent in the final time step of the trajectory. By clipping, we mean that the final time step of the trajectory is to be truncated such that the agent stops exactly at the first terminal state reached, and no distance further. We demonstrate that when clipping is omitted, learning performance can fail to reach the optimum, and when clipping is done properly, learning performance can improve significantly. The clipping problem we describe affects algorithms that use explicit derivatives of the model functions of the environment to calculate a learning gradient. These include backpropagation through time for control and methods based on dual heuristic programming. However, the clipping problem does not significantly affect methods based on heuristic dynamic programming, temporal differences learning, or policy-gradient learning algorithms.
Heuristic Biases in Mathematical Reasoning
ERIC Educational Resources Information Center
Inglis, Matthew; Simpson, Adrian
2005-01-01
In this paper we briefly describe the dual process account of reasoning, and explain the role of heuristic biases in human thought. Concentrating on the so-called matching bias effect, we describe a piece of research that indicates a correlation between success at advanced level mathematics and an ability to override innate and misleading…
CE dual-homing protection in layer 1 VPN
NASA Astrophysics Data System (ADS)
Du, Shu; Peng, Yunfeng; Long, Keping
2008-11-01
Layer 1 VPN (L1VPN) extends the notion of VPN to the optical domain to provide virtually dedicated circuit like leased lines, so that the security is more enhanced. Despite their secure gains from channel isolation, VPNs still suffer fragilities resulting from link-failures or node-failures. Extensive activities on survivability designs for wavelength-routed optical networks are proposed, including various protection and restoration schemes, but concerns on network edge are rare. Dual-homing is an effective skill to achieve survivability gains for L1VPNs. There are two dual-homing mode: Active/Standby mode and Load-Sharing mode In this paper, we investigate the problem of PE assignment, which is the key of dual-homing design and is NP-hard. We formulate it as an integer programming problem, and propose heuristic solutions. Simulation results show that the proposed solutions work in a correct and effective way and the Load-Sharing mode has higher bandwidth efficiency than Active/Standby mode.
Heuristic thinking and human intelligence: a commentary on Marewski, Gaissmaier and Gigerenzer.
Evans, Jonathan St B T; Over, David E
2010-05-01
Marewski, Gaissmaier and Gigerenzer (2009) present a review of research on fast and frugal heuristics, arguing that complex problems are best solved by simple heuristics, rather than the application of knowledge and logical reasoning. We argue that the case for such heuristics is overrated. First, we point out that heuristics can often lead to biases as well as effective responding. Second, we show that the application of logical reasoning can be both necessary and relatively simple. Finally, we argue that the evidence for a logical reasoning system that co-exists with simpler heuristic forms of thinking is overwhelming. Not only is it implausible a priori that we would have evolved such a system that is of no use to us, but extensive evidence from the literature on dual processing in reasoning and judgement shows that many problems can only be solved when this form of reasoning is used to inhibit and override heuristic thinking.
Wada, Kazushige; Nittono, Hiroshi
2004-06-01
The reasoning process in the Wason selection task was examined by measuring card inspection times in the letter-number and drinking-age problems. 24 students were asked to solve the problems presented on a computer screen. Only the card touched with a mouse pointer was visible, and the total exposure time of each card was measured. Participants were allowed to cancel their previous selections at any time. Although rethinking was encouraged, the cards once selected were rarely cancelled (10% of the total selections). Moreover, most of the cancelled cards were reselected (89% of the total cancellations). Consistent with previous findings, inspection times were longer for selected cards than for nonselected cards. These results suggest that card selections are determined largely by initial heuristic processes and rarely reversed by subsequent analytic processes. The present study gives further support for the heuristic-analytic dual process theory.
Conflict Monitoring in Dual Process Theories of Thinking
ERIC Educational Resources Information Center
De Neys, Wim; Glumicic, Tamara
2008-01-01
Popular dual process theories have characterized human thinking as an interplay between an intuitive-heuristic and demanding-analytic reasoning process. Although monitoring the output of the two systems for conflict is crucial to avoid decision making errors there are some widely different views on the efficiency of the process. Kahneman…
ERIC Educational Resources Information Center
Furlan, Sarah; Agnoli, Franca; Reyna, Valerie F.
2013-01-01
Dual-process theories have been proposed to explain normative and heuristic responses to reasoning and decision-making problems. Standard unitary and dual-process theories predict that normative responses should increase with age. However, research has focused recently on exceptions to this standard pattern, including developmental increases in…
Response demands and the recruitment of heuristic strategies in syllogistic reasoning.
Reverberi, Carlo; Rusconi, Patrice; Paulesu, Eraldo; Cherubini, Paolo
2009-03-01
Two experiments investigated whether dealing with a homogeneous subset of syllogisms with time-constrained responses encouraged participants to develop and use heuristics for abstract (Experiment 1) and thematic (Experiment 2) syllogisms. An atmosphere-based heuristic accounted for most responses with both abstract and thematic syllogisms. With thematic syllogisms, a weaker effect of a belief heuristic was also observed, mainly where the correct response was inconsistent with the atmosphere of the premises. Analytic processes appear to have played little role in the time-constrained condition, whereas their involvement increased in a self-paced, unconstrained condition. From a dual-process perspective, the results further specify how task demands affect the recruitment of heuristic and analytic systems of reasoning. Because the syllogisms and experimental procedure were the same as those used in a previous neuroimaging study by Goel, Buchel, Frith, and Dolan (2000), the result also deepen our understanding of the cognitive processes investigated by that study.
A Dual-Process Approach to Health Risk Decision Making: The Prototype Willingness Model
ERIC Educational Resources Information Center
Gerrard, Meg; Gibbons, Frederick X.; Houlihan, Amy E.; Stock, Michelle L.; Pomery, Elizabeth A.
2008-01-01
Although dual-process models in cognitive, personality, and social psychology have stimulated a large body of research about analytic and heuristic modes of decision making, these models have seldom been applied to the study of adolescent risk behaviors. In addition, the developmental course of these two kinds of information processing, and their…
Morsanyi, Kinga; Handley, Simon J
2008-01-01
We examined the relationship between cognitive capacity and heuristic responding on four types of reasoning and decision-making tasks. A total of 84 children, between 5 years 2 months and 11 years 7 months of age, participated in the study. There was a marked increase in heuristic responding with age that was related to increases in cognitive capacity. These findings are inconsistent with the predominant dual-process accounts of reasoning and decision making as applied to development. We offer an alternative explanation of the findings, considering them in the context of recent claims concerning the role of working memory in contextualized reasoning.
ERIC Educational Resources Information Center
Jackson, Luke M.
2017-01-01
This mixed method study was aimed at examining the influence of dual processing (Type 1 and Type 2 thinking) on the development of high school students' nature of science (NOS) views. Type 1 thinking is intuitive, experiential, and heuristic. Type 2 thinking is rational, analytical, and explicit. Three research questions were asked: (1) Do the…
Cardaci, Maurizio; Misuraca, Raffaella
2005-08-01
This paper raises some methodological problems in the dual process explanation provided by Wada and Nittono for their 2004 results using the Wason selection task. We maintain that the Nittono rethinking approach is weak and that it should be refined to grasp better the evidence of analytic processes.
Pathology resident and fellow education in a time of disruptive technologies.
Ziai, James M; Smith, Brian R
2012-12-01
The development of disruptive technologies is changing the practice of pathology. Their implementation challenges traditional educational paradigms. Training programs must adapt to these heuristic needs. The dual explosion of new medical knowledge and innovative methodologies adds new practice aspects to the pathologist's areas of expertise. This transformation potentially challenges the traditional core model of training. It raises questions as to how pathology should incorporate future expanding subspecialty needs into educational and practice models. This article examines the impact of these disruptive technologies on resident and fellow education and explores alternative educational and practice models that may better accommodate pathology's future. Copyright © 2012 Elsevier Inc. All rights reserved.
Chen, Nien-Tsu Nancy
2015-07-01
Major health behavior change models tend to consider health decisions as primarily resulting from a systematic appraisal of relevant beliefs, such as the perceived benefits and risks of a pharmacological intervention. Drawing on research from the disciplines of risk management, communication, and psychology, this study proposed the inclusion of a heuristic route in established theory and tested the direction of influence between heuristic and systematic process variables. Affect and social trust were included as key heuristics in the proposed dual-mode framework of health decision making. Furthermore, exposure to health-related coverage on television was considered potentially influential over both heuristic and systematic process variables. To test this framework, data were collected from a national probability sample of 584 adults in the United States in 2012 regarding their decision to vaccinate against a hypothetical avian flu. The results provided some support for the bidirectional influence between heuristic and systematic processing. Affect toward flu vaccination and trust in the Food and Drug Administration were found to be powerful predictors of vaccination intention, enhancing intention both directly and indirectly via certain systematic process variables. The direction of influence between perceived susceptibility and severity, on the one hand, and affect, on the other, is less clear, suggesting the need for further research. Contrary to the opinion of media critics, exposure to televised health coverage was negatively associated with the perceived risks of vaccination. Results from this study carry theoretical and practical implications, and applying this model to the acceptance of different health interventions constitutes an area for future inquiries. © 2015 Society for Risk Analysis.
Online learning control using adaptive critic designs with sparse kernel machines.
Xu, Xin; Hou, Zhongsheng; Lian, Chuanqiang; He, Haibo
2013-05-01
In the past decade, adaptive critic designs (ACDs), including heuristic dynamic programming (HDP), dual heuristic programming (DHP), and their action-dependent ones, have been widely studied to realize online learning control of dynamical systems. However, because neural networks with manually designed features are commonly used to deal with continuous state and action spaces, the generalization capability and learning efficiency of previous ACDs still need to be improved. In this paper, a novel framework of ACDs with sparse kernel machines is presented by integrating kernel methods into the critic of ACDs. To improve the generalization capability as well as the computational efficiency of kernel machines, a sparsification method based on the approximately linear dependence analysis is used. Using the sparse kernel machines, two kernel-based ACD algorithms, that is, kernel HDP (KHDP) and kernel DHP (KDHP), are proposed and their performance is analyzed both theoretically and empirically. Because of the representation learning and generalization capability of sparse kernel machines, KHDP and KDHP can obtain much better performance than previous HDP and DHP with manually designed neural networks. Simulation and experimental results of two nonlinear control problems, that is, a continuous-action inverted pendulum problem and a ball and plate control problem, demonstrate the effectiveness of the proposed kernel ACD methods.
Heuristic pattern correction scheme using adaptively trained generalized regression neural networks.
Hoya, T; Chambers, J A
2001-01-01
In many pattern classification problems, an intelligent neural system is required which can learn the newly encountered but misclassified patterns incrementally, while keeping a good classification performance over the past patterns stored in the network. In the paper, an heuristic pattern correction scheme is proposed using adaptively trained generalized regression neural networks (GRNNs). The scheme is based upon both network growing and dual-stage shrinking mechanisms. In the network growing phase, a subset of the misclassified patterns in each incoming data set is iteratively added into the network until all the patterns in the incoming data set are classified correctly. Then, the redundancy in the growing phase is removed in the dual-stage network shrinking. Both long- and short-term memory models are considered in the network shrinking, which are motivated from biological study of the brain. The learning capability of the proposed scheme is investigated through extensive simulation studies.
Tsujii, Takeo; Watanabe, Shigeru
2009-09-01
Recent dual-process reasoning theories have explained the belief-bias effect, the tendency for human reasoning to be erroneously biased when logical conclusions are incongruent with beliefs about the world, by proposing a belief-based automatic heuristic system and logic-based demanding analytic system. Although these claims are supported by the behavioral finding that high-load secondary tasks enhance the belief-bias effect, the neural correlates of dual-task reasoning remain unknown. The present study therefore examined the relationship between dual-task effect and activity in the inferior frontal cortex (IFC) during belief-bias reasoning by near-infrared spectroscopy (NIRS). Forty-eight subjects participated in this study (MA=23.46 years). They were required to perform congruent and incongruent reasoning trials while responding to high- and low-load secondary tasks. Behavioral analysis showed that the high-load secondary task impaired only incongruent reasoning performance. NIRS analysis found that the high-load secondary task decreased right IFC activity during incongruent trials. Correlation analysis showed that subjects with enhanced right IFC activity could perform better in the incongruent reasoning trials, though subjects for whom right IFC activity was impaired by the secondary task could not maintain better reasoning performance. These findings suggest that the right IFC may be responsible for the dual-task effect in conflicting reasoning processes. When secondary tasks impair right IFC activity, subjects may rely on the automatic heuristic system, which results in belief-bias responses. We therefore offer the first demonstration of neural correlates of dual-task effect on IFC activity in belief-bias reasoning.
Strategy selection in cue-based decision making.
Bryant, David J
2014-06-01
People can make use of a range of heuristic and rational, compensatory strategies to perform a multiple-cue judgment task. It has been proposed that people are sensitive to the amount of cognitive effort required to employ decision strategies. Experiment 1 employed a dual-task methodology to investigate whether participants' preference for heuristic versus compensatory decision strategies can be altered by increasing the cognitive demands of the task. As indicated by participants' decision times, a secondary task interfered more with the performance of a heuristic than compensatory decision strategy but did not affect the proportions of participants using either type of strategy. A stimulus set effect suggested that the conjunction of cue salience and cue validity might play a determining role in strategy selection. The results of Experiment 2 indicated that when a perceptually salient cue was also the most valid, the majority of participants preferred a single-cue heuristic strategy. Overall, the results contradict the view that heuristics are more likely to be adopted when a task is made more cognitively demanding. It is argued that people employ 2 learning processes during training, one an associative learning process in which cue-outcome associations are developed by sampling multiple cues, and another that involves the sequential examination of single cues to serve as a basis for a single-cue heuristic.
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
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.
Koenig, Cynthia S; Platt, Richard D; Griggs, Richard A
2007-07-01
Using the analogical transfer paradigm, the present study investigated the competing explanations of Girotto and Legrenzi (Psychological Research 51: 129-135, 1993) and Griggs, Platt, Newstead, and Jackson (Thinking and Reasoning 4: 1-14, 1998) for facilitation on the SARS version of the THOG problem, a hypothetico-deductive reasoning task. Girotto and Legrenzi argue that facilitation is based on logical analysis of the task [System 2 reasoning in Evans's (Trends in Cognitive Sciences 7: 454-459, 2003) dual-process account of reasoning] while Griggs et al. maintain that facilitation is due to an attentional heuristic produced by the wording of the problem (System 1 reasoning). If Girotto and Legrenzi are correct, then System 2 reasoning, which is volitional and responsible for deductive reasoning, should be elicited, and participants should comprehend the solution principle of the THOG task and exhibit analogical transfer. However, if Griggs et al. are correct, then System 1 reasoning, which is responsible for heuristic problem solving strategies such as an attentional heuristic, should occur, and participants should not abstract the solution principle and transfer should not occur. Significant facilitation (68 and 82% correct) was only observed for the two SARS source problems, but significant analogical transfer did not occur. This lack of transfer suggests that System 1 reasoning was responsible for the facilitation observed in the SARS problem, supporting Griggs et al.'s attentional heuristic explanation. The present results also underscore the explanatory value of using analogical transfer rather than facilitation as the criterion for problem understanding.
Fast logic?: Examining the time course assumption of dual process theory.
Bago, Bence; De Neys, Wim
2017-01-01
Influential dual process models of human thinking posit that reasoners typically produce a fast, intuitive heuristic (i.e., Type-1) response which might subsequently be overridden and corrected by slower, deliberative processing (i.e., Type-2). In this study we directly tested this time course assumption. We used a two response paradigm in which participants have to give an immediate answer and afterwards are allowed extra time before giving a final response. In four experiments we used a range of procedures (e.g., challenging response deadline, concurrent load) to knock out Type 2 processing and make sure that the initial response was intuitive in nature. Our key finding is that we frequently observe correct, logical responses as the first, immediate response. Response confidence and latency analyses indicate that these initial correct responses are given fast, with high confidence, and in the face of conflicting heuristic responses. Findings suggest that fast and automatic Type 1 processing also cues a correct logical response from the start. We sketch a revised dual process model in which the relative strength of different types of intuitions determines reasoning performance. Copyright © 2016 Elsevier B.V. All rights reserved.
A new approach for shaping of dual-reflector antennas
NASA Technical Reports Server (NTRS)
Lee, Teh-Hong; Burnside, W. D.; Rudduck, Roger C.
1987-01-01
The shaping of 2-D dual-reflector antenna systems to generate a prescribed distribution with uniform phase at the aperture of the second reflector is examined. This method is based on the geometrical nature of Cassegrain and Gregorian dual-reflector antennas. The method of syntheses satisfies the principles of geometrical optics which are the foundations of dual-reflector designs. Instead of setting up differential equations or heuristically designing the subreflector, a set of algebraic equations is formulated and solved numerically to obtain the desired surfaces. The caustics of the reflected rays from the subreflector can be obtained and examined. Several examples of 2-D dual-reflector shaping are shown to validate the study. Geometrical optics and physical optics are used to calculate the scattered fields from the reflectors.
Dual control and prevention of the turn-off phenomenon in a class of mimo systems
NASA Technical Reports Server (NTRS)
Mookerjee, P.; Bar-Shalom, Y.; Molusis, J. A.
1985-01-01
A recently developed methodology of adaptive dual control based upon sensitivity functions is applied here to a multivariable input-output model. The plant has constant but unknown parameters. It represents a simplified linear version of the relationship between the vibration output and the higher harmonic control input for a helicopter. The cautious and the new dual controller are examined. In many instances, the cautious controller is seen to turn off. The new dual controller modifies the cautious control design by numerator and denominator correction terms which depend upon the sensitivity functions of the expected future cost and avoids the turn-off and burst phenomena. Monte Carlo simulations and statistical tests of significance indicate the superiority of the dual controller over the cautious and the heuristic certainity equivalence controllers.
Negations in syllogistic reasoning: evidence for a heuristic-analytic conflict.
Stupple, Edward J N; Waterhouse, Eleanor F
2009-08-01
An experiment utilizing response time measures was conducted to test dominant processing strategies in syllogistic reasoning with the expanded quantifier set proposed by Roberts (2005). Through adding negations to existing quantifiers it is possible to change problem surface features without altering logical validity. Biases based on surface features such as atmosphere, matching, and the probability heuristics model (PHM; Chater & Oaksford, 1999; Wetherick & Gilhooly, 1995) would not be expected to show variance in response latencies, but participant responses should be highly sensitive to changes in the surface features of the quantifiers. In contrast, according to analytic accounts such as mental models theory and mental logic (e.g., Johnson-Laird & Byrne, 1991; Rips, 1994) participants should exhibit increased response times for negated premises, but not be overly impacted upon by the surface features of the conclusion. Data indicated that the dominant response strategy was based on a matching heuristic, but also provided evidence of a resource-demanding analytic procedure for dealing with double negatives. The authors propose that dual-process theories offer a stronger account of these data whereby participants employ competing heuristic and analytic strategies and fall back on a heuristic response when analytic processing fails.
Kokis, Judite V; Macpherson, Robyn; Toplak, Maggie E; West, Richard F; Stanovich, Keith E
2002-09-01
Developmental and individual differences in the tendency to favor analytic responses over heuristic responses were examined in children of two different ages (10- and 11-year-olds versus 13-year-olds), and of widely varying cognitive ability. Three tasks were examined that all required analytic processing to override heuristic processing: inductive reasoning, deductive reasoning under conditions of belief bias, and probabilistic reasoning. Significant increases in analytic responding with development were observed on the first two tasks. Cognitive ability was associated with analytic responding on all three tasks. Cognitive style measures such as actively open-minded thinking and need for cognition explained variance in analytic responding on the tasks after variance shared with cognitive ability had been controlled. The implications for dual-process theories of cognition and cognitive development are discussed.
Intuitive and Deliberate Judgments Are Based on Common Principles
ERIC Educational Resources Information Center
Kruglanski, Arie W.; Gigerenzer, Gerd
2011-01-01
A popular distinction in cognitive and social psychology has been between "intuitive" and "deliberate" judgments. This juxtaposition has aligned in dual-process theories of reasoning associative, unconscious, effortless, heuristic, and suboptimal processes (assumed to foster intuitive judgments) versus rule-based, conscious, effortful, analytic,…
Automatic and controlled components of judgment and decision making.
Ferreira, Mario B; Garcia-Marques, Leonel; Sherman, Steven J; Sherman, Jeffrey W
2006-11-01
The categorization of inductive reasoning into largely automatic processes (heuristic reasoning) and controlled analytical processes (rule-based reasoning) put forward by dual-process approaches of judgment under uncertainty (e.g., K. E. Stanovich & R. F. West, 2000) has been primarily a matter of assumption with a scarcity of direct empirical findings supporting it. The present authors use the process dissociation procedure (L. L. Jacoby, 1991) to provide convergent evidence validating a dual-process perspective to judgment under uncertainty based on the independent contributions of heuristic and rule-based reasoning. Process dissociations based on experimental manipulation of variables were derived from the most relevant theoretical properties typically used to contrast the two forms of reasoning. These include processing goals (Experiment 1), cognitive resources (Experiment 2), priming (Experiment 3), and formal training (Experiment 4); the results consistently support the author's perspective. They conclude that judgment under uncertainty is neither an automatic nor a controlled process but that it reflects both processes, with each making independent contributions.
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.
NASA Astrophysics Data System (ADS)
Edalati, Sh; Houshangi far, A.; Torabi, N.; Baneshi, Z.; Behjat, A.
2017-02-01
Poly(3,4-ethylendioxythiophene):poly(styrene sulfonate) (PEDOT:PSS) was deposited on a fluoride-doped tin oxide glass substrate using a heuristic method to fabricate platinum-free counter electrodes for dye-sensitized solar cells (DSSCs). In this heuristic method a thin layer of PEDOT:PPS is obtained by spin coating the PEDOT:PSS on a Cu substrate and then removing the substrate with FeCl3. The characteristics of the deposited PEDOT:PSS were studied by energy dispersive x-ray analysis and scanning electron microscopy, which revealed the micro-electronic specifications of the cathode. The aforementioned DSSCs exhibited a solar conversion efficiency of 3.90%, which is far higher than that of DSSCs with pure PEDOT:PSS (1.89%). This enhancement is attributed not only to the micro-electronic specifications but also to the HNO3 treatment through our heuristic method. The results of cyclic voltammetry, electrochemical impedance spectroscopy (EIS) and Tafel polarization plots show the modified cathode has a dual function, including excellent conductivity and electrocatalytic activity for iodine reduction.
[The role of gut instinct is an important subject].
Snoek, Jos W
2010-01-01
The role of gut instinct in general practice is an important topic. The reliance on gut instinct by experienced doctors is thought to be a form of intuitive decision-making which fits in with System 1 processes in the dual process model in higher cognition. Special mention is made of the theories on intuitive decision-making by the famous Dutch psychologist De Groot, who, when investigating thought processes of chess masters more than half a century ago, developed a fundamental theory on intuitive heuristics. Further studies on the determinants and conditions under which heuristics, such as the reliance on gut instinct, are applied in clinical practice are very welcome.
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.
Mathematical programming formulations for satellite synthesis
NASA Technical Reports Server (NTRS)
Bhasin, Puneet; Reilly, Charles H.
1987-01-01
The problem of satellite synthesis can be described as optimally allotting locations and sometimes frequencies and polarizations, to communication satellites so that interference from unwanted satellite signals does not exceed a specified threshold. In this report, mathematical programming models and optimization methods are used to solve satellite synthesis problems. A nonlinear programming formulation which is solved using Zoutendijk's method and a gradient search method is described. Nine mixed integer programming models are considered. Results of computer runs with these nine models and five geographically compatible scenarios are presented and evaluated. A heuristic solution procedure is also used to solve two of the models studied. Heuristic solutions to three large synthesis problems are presented. The results of our analysis show that the heuristic performs very well, both in terms of solution quality and solution time, on the two models to which it was applied. It is concluded that the heuristic procedure is the best of the methods considered for solving satellite synthesis problems.
Archer, Charles J [Rochester, MN; Blocksome, Michael A [Rochester, MN; Heidelberger, Philip [Cortlandt Manor, NY; Kumar, Sameer [White Plains, NY; Parker, Jeffrey J [Rochester, MN; Ratterman, Joseph D [Rochester, MN
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.
Usability of a patient education and motivation tool using heuristic evaluation.
Joshi, Ashish; Arora, Mohit; Dai, Liwei; Price, Kathleen; Vizer, Lisa; Sears, Andrew
2009-11-06
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. 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. 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. 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 for aesthetic and minimalist design (median severity = 2), 4 violations for help users recognize, diagnose, and recover from errors (median severity = 3), and 4 violations for help and documentation (median severity = 4). We describe the heuristic evaluation method employed to assess the usability of PEMT, a method which uncovers heuristic violations in the interface design in a quick and efficient manner. Bringing together usability experts and health professionals to evaluate a computer-mediated patient education program can help to identify problems in a timely manner. This makes this method particularly well suited to the iterative design process when developing other computer-mediated health education programs. Heuristic evaluations provided a means to assess the user interface of PEMT.
Usability of a Patient Education and Motivation Tool Using Heuristic Evaluation
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 for aesthetic and minimalist design (median severity = 2), 4 violations for help users recognize, diagnose, and recover from errors (median severity = 3), and 4 violations for help and documentation (median severity = 4). Conclusion We describe the heuristic evaluation method employed to assess the usability of PEMT, a method which uncovers heuristic violations in the interface design in a quick and efficient manner. Bringing together usability experts and health professionals to evaluate a computer-mediated patient education program can help to identify problems in a timely manner. This makes this method particularly well suited to the iterative design process when developing other computer-mediated health education programs. Heuristic evaluations provided a means to assess the user interface of PEMT. PMID:19897458
Conflict monitoring in dual process theories of thinking.
De Neys, Wim; Glumicic, Tamara
2008-03-01
Popular dual process theories have characterized human thinking as an interplay between an intuitive-heuristic and demanding-analytic reasoning process. Although monitoring the output of the two systems for conflict is crucial to avoid decision making errors there are some widely different views on the efficiency of the process. Kahneman [Kahneman, D. (2002). Maps of bounded rationality: A perspective on intuitive judgement and choice. Nobel Prize Lecture. Retrieved January 11, 2006, from: http://nobelprize.org/nobel_prizes/economics/laureates/2002/kahnemann-lecture.pdf] and Evans [Evans, J. St. B. T. (1984). Heuristic and analytic processing in reasoning. British Journal of Psychology, 75, 451-468], for example, claim that the monitoring of the heuristic system is typically quite lax whereas others such as Sloman [Sloman, S. A. (1996). The empirical case for two systems of reasoning. Psychological Bulletin, 119, 3-22] and Epstein [Epstein, S. (1994). Integration of the cognitive and psychodynamic unconscious. American Psychologists, 49, 709-724] claim it is flawless and people typically experience a struggle between what they "know" and "feel" in case of a conflict. The present study contrasted these views. Participants solved classic base rate neglect problems while thinking aloud. In these problems a stereotypical description cues a response that conflicts with the response based on the analytic base rate information. Verbal protocols showed no direct evidence for an explicitly experienced conflict. As Kahneman and Evans predicted, participants hardly ever mentioned the base rates and seemed to base their judgment exclusively on heuristic reasoning. However, more implicit measures of conflict detection such as participants' retrieval of the base rate information in an unannounced recall test, decision making latencies, and the tendency to review the base rates indicated that the base rates had been thoroughly processed. On control problems where base rates and description did not conflict this was not the case. Results suggest that whereas the popular characterization of conflict detection as an actively experienced struggle can be questioned there is nevertheless evidence for Sloman's and Epstein's basic claim about the flawless operation of the monitoring. Whenever the base rates and description disagree people will detect this conflict and consequently redirect attention towards a deeper processing of the base rates. Implications for the dual process framework and the rationality debate are discussed.
Toward Topology Dualism: Improving the Accuracy of AS Annotations for Routers
NASA Astrophysics Data System (ADS)
Huffaker, Bradley; Dhamdhere, Amogh; Fomenkov, Marina; Claffy, Kc
To describe, analyze, and model the topological and structural characteristics of the Internet, researchers use Internet maps constructed at the router or autonomous system (AS) level. Although progress has been made on each front individually, a dual graph representing connectivity of routers with AS labels remains an elusive goal. We take steps toward merging the router-level and AS-level views of the Internet. We start from a collection of traces, i.e. sequences of IP addresses obtained with large-scale traceroute measurements from a distributed set of vantage points. We use state-of-the-art alias resolution techniques to identify interfaces belonging to the same router. We develop novel heuristics to assign routers to ASes, producing an AS-router dual graph. We validate our router assignment heuristics using data provided by tier-1 and tier-2 ISPs and five research networks, and show that we successfully assign 80% of routers with interfaces from multiple ASes to the correct AS. When we include routers with interfaces from a single AS, the accuracy drops to 71%, due to the 24% of total inferred routers for which our measurement or alias resolution fails to find an interface belonging to the correct AS. We use our dual graph construct to estimate economic properties of the AS-router dual graph, such as the number of internal and border routers owned by different types of ASes. We also demonstrate how our techniques can improve IP-AS mapping, including resolving up to 62% of false loops we observed in AS paths derived from traceroutes.
Heuristic and analytic processing in online sports betting.
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.
Automating the packing heuristic design process with genetic programming.
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.
Masicampo, E J; Baumeister, Roy F
2008-03-01
This experiment used the attraction effect to test the hypothesis that ingestion of sugar can reduce reliance on intuitive, heuristic-based decision making. In the attraction effect, a difficult choice between two options is swayed by the presence of a seemingly irrelevant "decoy" option. We replicated this effect and the finding that the effect increases when people have depleted their mental resources performing a previous self-control task. Our hypothesis was based on the assumption that effortful processes require and consume relatively large amounts of glucose (brain fuel), and that this use of glucose is why people use heuristic strategies after exerting self-control. Before performing any tasks, some participants drank lemonade sweetened with sugar, which restores blood glucose, whereas others drank lemonade containing a sugar substitute. Only lemonade with sugar reduced the attraction effect. These results show one way in which the body (blood glucose) interacts with the mind (self-control and reliance on heuristics).
In conflict with ourselves? An investigation of heuristic and analytic processes in decision making.
Bonner, Carissa; Newell, Ben R
2010-03-01
Many theorists propose two types of processing: heuristic and analytic. In conflict tasks, in which these processing types lead to opposing responses, giving the analytic response may require both detection and resolution of the conflict. The ratio bias task, in which people tend to treat larger numbered ratios (e.g., 20/100) as indicating a higher likelihood of winning than do equivalent smaller numbered ratios (e.g., 2/10), is considered to induce such a conflict. Experiment 1 showed response time differences associated with conflict detection, resolution, and the amount of conflict induced. The conflict detection and resolution effects were replicated in Experiment 2 and were not affected by decreasing the influence of the heuristic response or decreasing the capacity to make the analytic response. The results are consistent with dual-process accounts, but a single-process account in which quantitative, rather than qualitative, differences in processing are assumed fares equally well in explaining the data.
Megías, Alberto; Navas, Juan Francisco; Petrova, Dafina; Cándido, Antonio; Maldonado, Antonio; Garcia-Retamero, Rocio; Catena, Andrés
2015-08-01
Dual-process theories have dominated the study of risk perception and risk-taking over the last two decades. However, there is a lack of objective brain-level evidence supporting the two systems of processing in every-day risky behavior. To address this issue, we propose the dissociation between evaluative and urgent behaviors as evidence of dual processing in risky driving situations. Our findings show a dissociation of evaluative and urgent behavior both at the behavioral and neural level. fMRI data showed an increase of activation in areas implicated in motor programming, emotional processing, and visuomotor integration in urgent behavior compared to evaluative behavior. These results support a more automatic processing of risk in urgent tasks, relying mainly on heuristics and experiential appraisal. The urgent task, which is characterized by strong time pressure and the possibility for negative consequences among others factors, creates a suitable context for the experiential-affective system to guide the decision-making process. Moreover, we observed greater frontal activation in the urgent task, suggesting the participation of cognitive control in safe behaviors. The findings of this research are relevant for the study of the neural mechanisms underlying dual process models in risky perception and decision-making, especially because of their proximity to everyday activities. © 2015 Wiley Periodicals, Inc.
NASA Astrophysics Data System (ADS)
Abeywickrama, Sandu; Furdek, Marija; Monti, Paolo; Wosinska, Lena; Wong, Elaine
2016-12-01
Core network survivability affects the reliability performance of telecommunication networks and remains one of the most important network design considerations. This paper critically examines the benefits arising from utilizing dual-homing in the optical access networks to provide resource-efficient protection against link and node failures in the optical core segment. Four novel, heuristic-based RWA algorithms that provide dedicated path protection in networks with dual-homing are proposed and studied. These algorithms protect against different failure scenarios (i.e. single link or node failures) and are implemented with different optimization objectives (i.e., minimization of wavelength usage and path length). Results obtained through simulations and comparison with baseline architectures indicate that exploiting dual-homed architecture in the access segment can bring significant improvements in terms of core network resource usage, connection availability, and power consumption.
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.
A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.
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.
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.
A comparison of Heuristic method and Llewellyn’s rules for identification of redundant constraints
NASA Astrophysics Data System (ADS)
Estiningsih, Y.; Farikhin; Tjahjana, R. H.
2018-03-01
Important techniques in linear programming is modelling and solving practical optimization. Redundant constraints are consider for their effects on general linear programming problems. Identification and reduce redundant constraints are for avoidance of all the calculations associated when solving an associated linear programming problems. Many researchers have been proposed for identification redundant constraints. This paper a compararison of Heuristic method and Llewellyn’s rules for identification of redundant constraints.
A Comparison of Genetic Programming Variants for Hyper-Heuristics
DOE Office of Scientific and Technical Information (OSTI.GOV)
Harris, Sean
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 inmore » 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.« less
NASA Astrophysics Data System (ADS)
Huang, J. D.; Liu, J. J.; Chen, Q. X.; Mao, N.
2017-06-01
Against a background of heat-treatment operations in mould manufacturing, a two-stage flow-shop scheduling problem is described for minimizing makespan with parallel batch-processing machines and re-entrant jobs. The weights and release dates of jobs are non-identical, but job processing times are equal. A mixed-integer linear programming model is developed and tested with small-scale scenarios. Given that the problem is NP hard, three heuristic construction methods with polynomial complexity are proposed. The worst case of the new constructive heuristic is analysed in detail. A method for computing lower bounds is proposed to test heuristic performance. Heuristic efficiency is tested with sets of scenarios. Compared with the two improved heuristics, the performance of the new constructive heuristic is superior.
Exact and heuristic algorithms for Space Information Flow.
Uwitonze, Alfred; Huang, Jiaqing; Ye, Yuanqing; Cheng, Wenqing; Li, Zongpeng
2018-01-01
Space Information Flow (SIF) is a new promising research area that studies network coding in geometric space, such as Euclidean space. The design of algorithms that compute the optimal SIF solutions remains one of the key open problems in SIF. This work proposes the first exact SIF algorithm and a heuristic SIF algorithm that compute min-cost multicast network coding for N (N ≥ 3) given terminal nodes in 2-D Euclidean space. Furthermore, we find that the Butterfly network in Euclidean space is the second example besides the Pentagram network where SIF is strictly better than Euclidean Steiner minimal tree. The exact algorithm design is based on two key techniques: Delaunay triangulation and linear programming. Delaunay triangulation technique helps to find practically good candidate relay nodes, after which a min-cost multicast linear programming model is solved over the terminal nodes and the candidate relay nodes, to compute the optimal multicast network topology, including the optimal relay nodes selected by linear programming from all the candidate relay nodes and the flow rates on the connection links. The heuristic algorithm design is also based on Delaunay triangulation and linear programming techniques. The exact algorithm can achieve the optimal SIF solution with an exponential computational complexity, while the heuristic algorithm can achieve the sub-optimal SIF solution with a polynomial computational complexity. We prove the correctness of the exact SIF algorithm. The simulation results show the effectiveness of the heuristic SIF algorithm.
The embodied embedded character of system 1 processing.
Bellini-Leite, Samuel de Castro
2013-01-01
In the last thirty years, a relatively large group of cognitive scientists have begun characterising the mind in terms of two distinct, relatively autonomous systems. To account for paradoxes in empirical results of studies mainly on reasoning, Dual Process Theories were developed. Such Dual Process Theories generally agree that System 1 is rapid, automatic, parallel, and heuristic-based and System 2 is slow, capacity-demanding, sequential, and related to consciousness. While System 2 can still be decently understood from a traditional cognitivist approach, I will argue that it is essential for System 1 processing to be comprehended in an Embodied Embedded approach to Cognition.
Amako, Jun; Shinozaki, Yu
2016-07-11
We report on a dual-wavelength diffractive beam splitter designed for use in parallel laser processing. This novel optical element generates two beam arrays of different wavelengths and allows their overlap at the process points on a workpiece. To design the deep surface-relief profile of a splitter using a simulated annealing algorithm, we introduce a heuristic but practical scheme to determine the maximum depth and the number of quantization levels. The designed corrugations were fabricated in a photoresist by maskless grayscale exposure using a high-resolution spatial light modulator. We characterized the photoresist splitter, thereby validating the proposed beam-splitting concept.
The Embodied Embedded Character of System 1 Processing
Bellini-Leite, Samuel de Castro
2013-01-01
In the last thirty years, a relatively large group of cognitive scientists have begun characterising the mind in terms of two distinct, relatively autonomous systems. To account for paradoxes in empirical results of studies mainly on reasoning, Dual Process Theories were developed. Such Dual Process Theories generally agree that System 1 is rapid, automatic, parallel, and heuristic-based and System 2 is slow, capacity-demanding, sequential, and related to consciousness. While System 2 can still be decently understood from a traditional cognitivist approach, I will argue that it is essential for System 1 processing to be comprehended in an Embodied Embedded approach to Cognition. PMID:23678245
A heuristic constraint programmed planner for deep space exploration problems
NASA Astrophysics Data System (ADS)
Jiang, Xiao; Xu, Rui; Cui, Pingyuan
2017-10-01
In recent years, the increasing numbers of scientific payloads and growing constraints on the probe have made constraint processing technology a hotspot in the deep space planning field. In the procedure of planning, the ordering of variables and values plays a vital role. This paper we present two heuristic ordering methods for variables and values. On this basis a graphplan-like constraint-programmed planner is proposed. In the planner we convert the traditional constraint satisfaction problem to a time-tagged form with different levels. Inspired by the most constrained first principle in constraint satisfaction problem (CSP), the variable heuristic is designed by the number of unassigned variables in the constraint and the value heuristic is designed by the completion degree of the support set. The simulation experiments show that the planner proposed is effective and its performance is competitive with other kind of planners.
Mohan, Deepika; Rosengart, Matthew R; Fischhoff, Baruch; Angus, Derek C; Farris, Coreen; Yealy, Donald M; Wallace, David J; Barnato, Amber E
2016-11-11
Between 30 and 40 % of patients with severe injuries receive treatment at non-trauma centers (under-triage), largely because of physician decision making. Existing interventions to improve triage by physicians ignore the role that intuition (heuristics) plays in these decisions. One such heuristic is to form an initial impression based on representativeness (how typical does a patient appear of one with severe injuries). We created a video game (Night Shift) to recalibrate physician's representativeness heuristic in trauma triage. We developed Night Shift in collaboration with emergency medicine physicians, trauma surgeons, behavioral scientists, and game designers. Players take on the persona of Andy Jordan, an emergency medicine physician, who accepts a new job in a small town. Through a series of cases that go awry, they gain experience with the contextual cues that distinguish patients with minor and severe injuries (based on the theory of analogical encoding) and receive emotionally-laden feedback on their performance (based on the theory of narrative engagement). The planned study will compare the effect of Night Shift with that of an educational program on physician triage decisions and on physician heuristics. Psychological theory predicts that cognitive load increases reliance on heuristics, thereby increasing the under-triage rate when heuristics are poorly calibrated. We will randomize physicians (n = 366) either to play the game or to review an educational program, and will assess performance using a validated virtual simulation. The validated simulation includes both control and cognitive load conditions. We will compare rates of under-triage after exposure to the two interventions (primary outcome) and will compare the effect of cognitive load on physicians' under-triage rates (secondary outcome). We hypothesize that: a) physicians exposed to Night Shift will have lower rates of under-triage compared to those exposed to the educational program, and b) cognitive load will not degrade triage performance among physicians exposed to Night Shift as much as it will among those exposed to the educational program. Serious games offer a new approach to the problem of poorly-calibrated heuristics in trauma triage. The results of this trial will contribute to the understanding of physician quality improvement and the efficacy of video games as behavioral interventions. clinicaltrials.gov; NCT02857348 ; August 2, 2016.
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.
Automated discovery of local search heuristics for satisfiability testing.
Fukunaga, Alex S
2008-01-01
The development of successful metaheuristic algorithms such as local search for a difficult problem such as satisfiability testing (SAT) is a challenging task. We investigate an evolutionary approach to automating the discovery of new local search heuristics for SAT. We show that several well-known SAT local search algorithms such as Walksat and Novelty are composite heuristics that are derived from novel combinations of a set of building blocks. Based on this observation, we developed CLASS, a genetic programming system that uses a simple composition operator to automatically discover SAT local search heuristics. New heuristics discovered by CLASS are shown to be competitive with the best Walksat variants, including Novelty+. Evolutionary algorithms have previously been applied to directly evolve a solution for a particular SAT instance. We show that the heuristics discovered by CLASS are also competitive with these previous, direct evolutionary approaches for SAT. We also analyze the local search behavior of the learned heuristics using the depth, mobility, and coverage metrics proposed by Schuurmans and Southey.
Model-Free Adaptive Control for Unknown Nonlinear Zero-Sum Differential Game.
Zhong, Xiangnan; He, Haibo; Wang, Ding; Ni, Zhen
2018-05-01
In this paper, we present a new model-free globalized dual heuristic dynamic programming (GDHP) approach for the discrete-time nonlinear zero-sum game problems. First, the online learning algorithm is proposed based on the GDHP method to solve the Hamilton-Jacobi-Isaacs equation associated with optimal regulation control problem. By setting backward one step of the definition of performance index, the requirement of system dynamics, or an identifier is relaxed in the proposed method. Then, three neural networks are established to approximate the optimal saddle point feedback control law, the disturbance law, and the performance index, respectively. The explicit updating rules for these three neural networks are provided based on the data generated during the online learning along the system trajectories. The stability analysis in terms of the neural network approximation errors is discussed based on the Lyapunov approach. Finally, two simulation examples are provided to show the effectiveness of the proposed method.
Probabilistic DHP adaptive critic for nonlinear stochastic control systems.
Herzallah, Randa
2013-06-01
Following the recently developed algorithms for fully probabilistic control design for general dynamic stochastic systems (Herzallah & Káarnáy, 2011; Kárný, 1996), this paper presents the solution to the probabilistic dual heuristic programming (DHP) adaptive critic method (Herzallah & Káarnáy, 2011) and randomized control algorithm for stochastic nonlinear dynamical systems. The purpose of the randomized control input design is to make the joint probability density function of the closed loop system as close as possible to a predetermined ideal joint probability density function. This paper completes the previous work (Herzallah & Káarnáy, 2011; Kárný, 1996) by formulating and solving the fully probabilistic control design problem on the more general case of nonlinear stochastic discrete time systems. A simulated example is used to demonstrate the use of the algorithm and encouraging results have been obtained. Copyright © 2013 Elsevier Ltd. All rights reserved.
Model for the design of distributed data bases
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ram, S.
This research focuses on developing a model to solve the File Allocation Problem (FAP). The model integrates two major design issues, namely Concurrently Control and Data Distribution. The central node locking mechanism is incorporated in developing a nonlinear integer programming model. Two solution algorithms are proposed, one of which was implemented in FORTRAN.V. The allocation of data bases and programs are examined using this heuristic. Several decision rules were also formulated based on the results of the heuristic. A second more comprehensive heuristic was proposed, based on the knapsack problem. The development and implementation of this algorithm has been leftmore » as a topic for future research.« less
Dual-systems and the development of reasoning: competence-procedural systems.
Overton, Willis F; Ricco, Robert B
2011-03-01
Dual-system, dual-process, accounts of adult cognitive processing are examined in the context of a self-organizing relational developmental systems approaches to cognitive growth. Contemporary adult dual-process accounts describe a linear architecture of mind entailing two split-off, but interacting systems; a domain general, content-free 'analytic' system (system 2) and a domain specific highly contextualized 'heuristic' system (system 1). In the developmental literature on deductive reasoning, a similar distinction has been made between a domain general competence (reflective, algorithmic) system and a domain specific procedural system. In contrast to the linear accounts offered by empiricist, nativist, and/or evolutionary explanations, the dual competence-procedural developmental perspective argues that the mature systems emerge through developmental transformations as differentiations and intercoordinations of an early relatively undifferentiated action matrix. This development, whose microscopic mechanism is action-in-the-world, is characterized as being embodied, nonlinear, and epigenetic. WIREs Cogni Sci 2011 2 231-237 DOI: 10.1002/wcs.120 For further resources related to this article, please visit the WIREs website. © 2010 John Wiley & Sons, Ltd.
NASA Astrophysics Data System (ADS)
Chun, Tae Yoon; Lee, Jae Young; Park, Jin Bae; Choi, Yoon Ho
2018-06-01
In this paper, we propose two multirate generalised policy iteration (GPI) algorithms applied to discrete-time linear quadratic regulation problems. The proposed algorithms are extensions of the existing GPI algorithm that consists of the approximate policy evaluation and policy improvement steps. The two proposed schemes, named heuristic dynamic programming (HDP) and dual HDP (DHP), based on multirate GPI, use multi-step estimation (M-step Bellman equation) at the approximate policy evaluation step for estimating the value function and its gradient called costate, respectively. Then, we show that these two methods with the same update horizon can be considered equivalent in the iteration domain. Furthermore, monotonically increasing and decreasing convergences, so called value iteration (VI)-mode and policy iteration (PI)-mode convergences, are proved to hold for the proposed multirate GPIs. Further, general convergence properties in terms of eigenvalues are also studied. The data-driven online implementation methods for the proposed HDP and DHP are demonstrated and finally, we present the results of numerical simulations performed to verify the effectiveness of the proposed methods.
AM: An Artificial Intelligence Approach to Discovery in Mathematics as Heuristic Search
1976-07-01
Artificial Intelligence Approach to Discovery in Mathematics as Heuristic Search by Douglas B. Len-t APPROVED FOR PUBLIC RELEASE; DISTRIBUTION IS UNLIMITED (A...570 AM: An Artificial Intelligence Approach to Discovery in Mathematics as Heuristic Search by Douglas B. Lenat ABSTRACT A program, called "AM", is...While AM’s " approach " to empirical research may be used in other scientific domains, the main limitation (reliance on hindsight) will probably recur
Unpacking students' atomistic uderstanding of stoichiometry
NASA Astrophysics Data System (ADS)
Baluyut, John Ysrael
Despite the use by instructors of particulate nature of matter (PNOM) diagrams in the general chemistry classroom, misconceptions on stoichiometry continue to prevail among students tasked with conceptual problems on concepts of limiting and excess reagents, and reaction yields. This dissertation set out to explore students' understanding of stoichiometry at the microscopic level as they solved problems that using PNOM diagrams. In particular, the study investigated how students coordinated symbolic and microscopic representations to demonstrate their knowledge of stoichiometric concepts, quantified the prevalence and explained the nature of stoichiometric misconceptions in terms of dual processing and dual coding theories, and used eye tracking to identify visual behaviors that accompanied cognitive processes students used to solve conceptual stoichiometry problems with PNOM diagrams. Interviews with students asked to draw diagrams for specific stoichiometric situations showed dual processing systems were in play. Many students were found to have used these processing systems in a heuristic-analytic sequence. Heuristics, such as the factor-label method and the least amount misconception, were often used by students to select information for further processing in an attempt to reduce the cognitive load of the subsequent analytic stage of the solution process. Diagrams drawn by students were used then to develop an instrument administered over a much larger sample of the general chemistry student population. The robustness of the dual processing theory was manifested by response patterns observed with large proportions of the student samples. These response patterns suggest that many students seemed to rely on heuristics to respond to a specific item for one of two diagrams given for the same chemical context, and then used a more analytic approach in dealing with the same item for the other diagram. It was also found that many students incorrectly treated items dealing with the same chemical context independently of each other instead of using a more integrative approach. A comparison of the visual behaviors of high-performing subjects with those of low-performers revealed that high performers relied heavily on the given diagrams to obtain information. They were found to have spent more time fixating on diagrams, looked between the chemical equation and the diagram for each problem more often, and used their episodic memory more heavily to collect information early on than low performers did. Retrospective think-alouds used with eye tracking also revealed specific strategies, such as counting and balancing of atoms and molecules across both sides of a diagram, as well as comparing ratios between atoms and molecules in a diagram with those given in a balanced equation, used by students to analyze PNOM diagrams.
A computational approach to animal breeding.
Berger-Wolf, Tanya Y; Moore, Cristopher; Saia, Jared
2007-02-07
We propose a computational model of mating strategies for controlled animal breeding programs. A mating strategy in a controlled breeding program is a heuristic with some optimization criteria as a goal. Thus, it is appropriate to use the computational tools available for analysis of optimization heuristics. In this paper, we propose the first discrete model of the controlled animal breeding problem and analyse heuristics for two possible objectives: (1) breeding for maximum diversity and (2) breeding a target individual. These two goals are representative of conservation biology and agricultural livestock management, respectively. We evaluate several mating strategies and provide upper and lower bounds for the expected number of matings. While the population parameters may vary and can change the actual number of matings for a particular strategy, the order of magnitude of the number of expected matings and the relative competitiveness of the mating heuristics remains the same. Thus, our simple discrete model of the animal breeding problem provides a novel viable and robust approach to designing and comparing breeding strategies in captive populations.
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.
NASA Astrophysics Data System (ADS)
Masuda, Kazuaki; Aiyoshi, Eitaro
We propose a method for solving optimal price decision problems for simultaneous multi-article auctions. An auction problem, originally formulated as a combinatorial problem, determines both every seller's whether or not to sell his/her article and every buyer's which article(s) to buy, so that the total utility of buyers and sellers will be maximized. Due to the duality theory, we transform it equivalently into a dual problem in which Lagrange multipliers are interpreted as articles' transaction price. As the dual problem is a continuous optimization problem with respect to the multipliers (i.e., the transaction prices), we propose a numerical method to solve it by applying heuristic global search methods. In this paper, Particle Swarm Optimization (PSO) is used to solve the dual problem, and experimental results are presented to show the validity of the proposed method.
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…
Usability and Instructional Design Heuristics for E-Learning Evaluation.
ERIC Educational Resources Information Center
Reeves, Thomas C.; Benson, Lisa; Elliott, Dean; Grant, Michael; Holschuh, Doug; Kim, Beaumie; Kim, Hyeonjin; Lauber, Erick; Loh, Sebastian
Heuristic evaluation is a methodology for investigating the usability of software originally developed by Nielsen (1993, 2000). Nielsen's protocol was modified and refined for evaluating e-learning programs by participants in a doctoral seminar held at the University of Georgia in 2001. The modifications primarily involved expanding Nielsen's…
[Dual process in large number estimation under uncertainty].
Matsumuro, Miki; Miwa, Kazuhisa; Terai, Hitoshi; Yamada, Kento
2016-08-01
According to dual process theory, there are two systems in the mind: an intuitive and automatic System 1 and a logical and effortful System 2. While many previous studies about number estimation have focused on simple heuristics and automatic processes, the deliberative System 2 process has not been sufficiently studied. This study focused on the System 2 process for large number estimation. First, we described an estimation process based on participants’ verbal reports. The task, corresponding to the problem-solving process, consisted of creating subgoals, retrieving values, and applying operations. Second, we investigated the influence of such deliberative process by System 2 on intuitive estimation by System 1, using anchoring effects. The results of the experiment showed that the System 2 process could mitigate anchoring effects.
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.
Précis of Simple heuristics that make us smart.
Todd, P M; Gigerenzer, G
2000-10-01
How can anyone be rational in a world where knowledge is limited, time is pressing, and deep thought is often an unattainable luxury? Traditional models of unbounded rationality and optimization in cognitive science, economics, and animal behavior have tended to view decision-makers as possessing supernatural powers of reason, limitless knowledge, and endless time. But understanding decisions in the real world requires a more psychologically plausible notion of bounded rationality. In Simple heuristics that make us smart (Gigerenzer et al. 1999), we explore fast and frugal heuristics--simple rules in the mind's adaptive toolbox for making decisions with realistic mental resources. These heuristics can enable both living organisms and artificial systems to make smart choices quickly and with a minimum of information by exploiting the way that information is structured in particular environments. In this précis, we show how simple building blocks that control information search, stop search, and make decisions can be put together to form classes of heuristics, including: ignorance-based and one-reason decision making for choice, elimination models for categorization, and satisficing heuristics for sequential search. These simple heuristics perform comparably to more complex algorithms, particularly when generalizing to new data--that is, simplicity leads to robustness. We present evidence regarding when people use simple heuristics and describe the challenges to be addressed by this research program.
Varying execution discipline to increase performance
DOE Office of Scientific and Technical Information (OSTI.GOV)
Campbell, P.L.; Maccabe, A.B.
1993-12-22
This research investigates the relationship between execution discipline and performance. The hypothesis has two parts: 1. Different execution disciplines exhibit different performance for different computations, and 2. These differences can be effectively predicted by heuristics. A machine model is developed that can vary its execution discipline. That is, the model can execute a given program using either the control-driven, data-driven or demand-driven execution discipline. This model is referred to as a ``variable-execution-discipline`` machine. The instruction set for the model is the Program Dependence Web (PDW). The first part of the hypothesis will be tested by simulating the execution of themore » machine model on a suite of computations, based on the Livermore Fortran Kernel (LFK) Test (a.k.a. the Livermore Loops), using all three execution disciplines. Heuristics are developed to predict relative performance. These heuristics predict (a) the execution time under each discipline for one iteration of each loop and (b) the number of iterations taken by that loop; then the heuristics use those predictions to develop a prediction for the execution of the entire loop. Similar calculations are performed for branch statements. The second part of the hypothesis will be tested by comparing the results of the simulated execution with the predictions produced by the heuristics. If the hypothesis is supported, then the door is open for the development of machines that can vary execution discipline to increase performance.« less
Dual adaptive dynamic control of mobile robots using neural networks.
Bugeja, Marvin K; Fabri, Simon G; Camilleri, Liberato
2009-02-01
This paper proposes two novel dual adaptive neural control schemes for the dynamic control of nonholonomic mobile robots. The two schemes are developed in discrete time, and the robot's nonlinear dynamic functions are assumed to be unknown. Gaussian radial basis function and sigmoidal multilayer perceptron neural networks are used for function approximation. In each scheme, the unknown network parameters are estimated stochastically in real time, and no preliminary offline neural network training is used. In contrast to other adaptive techniques hitherto proposed in the literature on mobile robots, the dual control laws presented in this paper do not rely on the heuristic certainty equivalence property but account for the uncertainty in the estimates. This results in a major improvement in tracking performance, despite the plant uncertainty and unmodeled dynamics. Monte Carlo simulation and statistical hypothesis testing are used to illustrate the effectiveness of the two proposed stochastic controllers as applied to the trajectory-tracking problem of a differentially driven wheeled mobile robot.
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.
Pain as a fact and heuristic: how pain neuroimaging illuminates moral dimensions of law.
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.
ERIC Educational Resources Information Center
Berg, A. I.; And Others
Five articles which were selected from a Russian language book on cybernetics and then translated are presented here. They deal with the topics of: computer-developed computers, heuristics and modern sciences, linguistics and practice, cybernetics and moral-ethical considerations, and computer chess programs. (Author/JY)
Chen, Pei-Hua
2017-05-01
This rejoinder responds to the commentary by van der Linden and Li entiled "Comment on Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" on the article "Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" by Chen. Van der Linden and Li made a strong statement calling for the cessation of test assembly heuristics development, and instead encouraged embracing mixed integer programming (MIP). This article points out the nondeterministic polynomial (NP)-hard nature of MIP problems and how solutions found using heuristics could be useful in an MIP context. Although van der Linden and Li provided several practical examples of test assembly supporting their view, the examples ignore the cases in which a slight change of constraints or item pool data might mean it would not be possible to obtain solutions as quickly as before. The article illustrates the use of heuristic solutions to improve both the performance of MIP solvers and the quality of solutions. Additional responses to the commentary by van der Linden and Li are included.
Albuquerque, Fabio; Beier, Paul
2015-01-01
Here we report that prioritizing sites in order of rarity-weighted richness (RWR) is a simple, reliable way to identify sites that represent all species in the fewest number of sites (minimum set problem) or to identify sites that represent the largest number of species within a given number of sites (maximum coverage problem). We compared the number of species represented in sites prioritized by RWR to numbers of species represented in sites prioritized by the Zonation software package for 11 datasets in which the size of individual planning units (sites) ranged from <1 ha to 2,500 km2. On average, RWR solutions were more efficient than Zonation solutions. Integer programming remains the only guaranteed way find an optimal solution, and heuristic algorithms remain superior for conservation prioritizations that consider compactness and multiple near-optimal solutions in addition to species representation. But because RWR can be implemented easily and quickly in R or a spreadsheet, it is an attractive alternative to integer programming or heuristic algorithms in some conservation prioritization contexts.
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.
Fear and Loving in Las Vegas: Evolution, Emotion, and Persuasion.
Griskevicius, Vladas; Goldstein, Noah J; Mortensen, Chad R; Sundie, Jill M; Cialdini, Robert B; Kenrick, Douglas T
2009-06-01
How do arousal-inducing contexts, such as frightening or romantic television programs, influence the effectiveness of basic persuasion heuristics? Different predictions are made by three theoretical models: A general arousal model predicts that arousal should increase effectiveness of heuristics; an affective valence model predicts that effectiveness should depend on whether the context elicits positive or negative affect; an evolutionary model predicts that persuasiveness should depend on both the specific emotion that is elicited and the content of the particular heuristic. Three experiments examined how fear-inducing versus romantic contexts influenced the effectiveness of two widely used heuristics-social proof (e.g., "most popular") and scarcity (e.g., "limited edition"). Results supported predictions from an evolutionary model, showing that fear can lead scarcity appeals to be counter-persuasive, and that romantic desire can lead social proof appeals to be counter-persuasive. The findings highlight how an evolutionary theoretical approach can lead to novel theoretical and practical marketing insights.
A practical implementation science heuristic for organizational readiness: R = MC2
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
A model for solving the prescribed burn planning problem.
Rachmawati, Ramya; Ozlen, Melih; Reinke, Karin J; Hearne, John W
2015-01-01
The increasing frequency of destructive wildfires, with a consequent loss of life and property, has led to fire and land management agencies initiating extensive fuel management programs. This involves long-term planning of fuel reduction activities such as prescribed burning or mechanical clearing. In this paper, we propose a mixed integer programming (MIP) model that determines when and where fuel reduction activities should take place. The model takes into account multiple vegetation types in the landscape, their tolerance to frequency of fire events, and keeps track of the age of each vegetation class in each treatment unit. The objective is to minimise fuel load over the planning horizon. The complexity of scheduling fuel reduction activities has led to the introduction of sophisticated mathematical optimisation methods. While these approaches can provide optimum solutions, they can be computationally expensive, particularly for fuel management planning which extends across the landscape and spans long term planning horizons. This raises the question of how much better do exact modelling approaches compare to simpler heuristic approaches in their solutions. To answer this question, the proposed model is run using an exact MIP (using commercial MIP solver) and two heuristic approaches that decompose the problem into multiple single-period sub problems. The Knapsack Problem (KP), which is the first heuristic approach, solves the single period problems, using an exact MIP approach. The second heuristic approach solves the single period sub problem using a greedy heuristic approach. The three methods are compared in term of model tractability, computational time and the objective values. The model was tested using randomised data from 711 treatment units in the Barwon-Otway district of Victoria, Australia. Solutions for the exact MIP could be obtained for up to a 15-year planning only using a standard implementation of CPLEX. Both heuristic approaches can solve significantly larger problems, involving 100-year or even longer planning horizons. Furthermore there are no substantial differences in the solutions produced by the three approaches. It is concluded that for practical purposes a heuristic method is to be preferred to the exact MIP approach.
Beyond patchwork precaution in the dual-use governance of synthetic biology.
Kelle, Alexander
2013-09-01
The emergence of synthetic biology holds the potential of a major breakthrough in the life sciences by transforming biology into a predictive science. The dual-use characteristics of similar breakthroughs during the twentieth century have led to the application of benignly intended research in e.g. virology, bacteriology and aerobiology in offensive biological weapons programmes. Against this background the article raises the question whether the precautionary governance of synthetic biology can aid in preventing this techno-science witnessing the same fate? In order to address this question, this paper proceeds in four steps: it firstly introduces the emerging techno-science of synthetic biology and presents some of its potential beneficial applications. It secondly analyses contributions to the bioethical discourse on synthetic biology as well as precautionary reasoning and its application to life science research in general and synthetic biology more specifically. The paper then identifies manifestations of a moderate precautionary principle in the emerging synthetic biology dual-use governance discourse. Using a dual-use governance matrix as heuristic device to analyse some of the proposed measures, it concludes that the identified measures can best be described as "patchwork precaution" and that a more systematic approach to construct a web of dual-use precaution for synthetic biology is needed in order to guard more effectively against the field's future misuse for harmful applications.
Runway Scheduling Using Generalized Dynamic Programming
NASA Technical Reports Server (NTRS)
Montoya, Justin; Wood, Zachary; Rathinam, Sivakumar
2011-01-01
A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway fight sequences that are optimal for both runway throughput and delay. Realistic time-based operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort Worth International airport and three baseline heuristics are used to illustrate preliminary benefits of using the generalized dynamic programming method. Simulated traffic levels ranged from 10 aircraft to 30 aircraft with each test case spanning 15 minutes. The optimal solution shows a 40-70 percent decrease in the expected delay per aircraft over the baseline schedulers. Computational results suggest that the algorithm is promising for real-time application with an average computation time of 4.5 seconds. For even faster computation times, two heuristics are developed. As compared to the optimal, the heuristics are within 5% of the expected delay per aircraft and 1% of the expected number of runway operations per hour ad can be 100x faster.
NASA Astrophysics Data System (ADS)
Niaz, Mansoor
Given the importance of epistemology and philosophy of science, the Lakatos (1970) methodology is particularly suited to evaluate competing research programs in science education. This article has two objectives: (a) to evaluate critically the interpretations of Gilbert and Swift (1985) and Rowell and Dawson (1989), and (b) to postulate a progressive problemshift between Piaget's epistemic subject and Pascual-Leone's metasubject. Regarding the Gilbert and Swift interpretation, it is concluded that the alternative conceptions movement at its present stage of development cannot explain the previous success of its rival (Piagetian school) nor supersede it by a further display of heuristic power as required by Lakatos. If we accept the Rowell and Dawson thesis it would amount to the postulation of Piagetian and integrated (Piagetian and schema) theories as rival research programs. It appears that the Rowell and Dawson approach would enrich Piagetian theory with descriptive content rather than explanatory constructs, and thus would not lead to a progressive problemshift. It is concluded that Pascual-Leone's theory extends Piaget's negative heuristic by introducing antecedent variables, and at the same time enriches the positive heuristic by introducing metasubjective task analysis, which leads to a progressive problemshift.
Development of a Teen-Friendly Health Education Program on Facebook: Lessons Learned.
Park, Bu Kyung; Nahm, Eun-Shim; Rogers, Valerie E
2016-01-01
Facebook is the most popular online platform among adolescents and can be an effective medium to deliver health education. Although Korean American (KA) adolescents are at risk of obesity, a culturally tailored health education program is not available for them. Thus, our research team developed a health education program for KA adolescents on Facebook called "Healthy Teens." The aim of this study was to discuss important lessons learned through the program development process. This program includes culturally tailored learning modules about healthy eating and physical activity. The program was developed on the basis of the social cognitive theory, and the online program was developed by applying Web usability principles for adolescents. Upon completion, the usability of the program was assessed using heuristic evaluation. The findings from the heuristic evaluation showed that the Healthy Teens program was usable for KA adolescents. The findings from this study will assist researchers who are planning to build similar Facebook-based health education programs. Copyright © 2016 National Association of Pediatric Nurse Practitioners. Published by Elsevier Inc. All rights reserved.
Qiao, Wei; Venayagamoorthy, Ganesh K; Harley, Ronald G
2008-01-01
Wide-area coordinating control is becoming an important issue and a challenging problem in the power industry. This paper proposes a novel optimal wide-area coordinating neurocontrol (WACNC), based on wide-area measurements, for a power system with power system stabilizers, a large wind farm and multiple flexible ac transmission system (FACTS) devices. An optimal wide-area monitor (OWAM), which is a radial basis function neural network (RBFNN), is designed to identify the input-output dynamics of the nonlinear power system. Its parameters are optimized through particle swarm optimization (PSO). Based on the OWAM, the WACNC is then designed by using the dual heuristic programming (DHP) method and RBFNNs, while considering the effect of signal transmission delays. The WACNC operates at a global level to coordinate the actions of local power system controllers. Each local controller communicates with the WACNC, receives remote control signals from the WACNC to enhance its dynamic performance and therefore helps improve system-wide dynamic and transient performance. The proposed control is verified by simulation studies on a multimachine power system.
NASA Technical Reports Server (NTRS)
Yan, Jerry C.
1987-01-01
In concurrent systems, a major responsibility of the resource management system is to decide how the application program is to be mapped onto the multi-processor. Instead of using abstract program and machine models, a generate-and-test framework known as 'post-game analysis' that is based on data gathered during program execution is proposed. Each iteration consists of (1) (a simulation of) an execution of the program; (2) analysis of the data gathered; and (3) the proposal of a new mapping that would have a smaller execution time. These heuristics are applied to predict execution time changes in response to small perturbations applied to the current mapping. An initial experiment was carried out using simple strategies on 'pipeline-like' applications. The results obtained from four simple strategies demonstrated that for this kind of application, even simple strategies can produce acceptable speed-up with a small number of iterations.
A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching Rules.
Nguyen, Su; Mei, Yi; Xue, Bing; Zhang, Mengjie
2018-06-04
Designing effective dispatching rules for production systems is a difficult and timeconsuming task if it is done manually. In the last decade, the growth of computing power, advanced machine learning, and optimisation techniques has made the automated design of dispatching rules possible and automatically discovered rules are competitive or outperform existing rules developed by researchers. Genetic programming is one of the most popular approaches to discovering dispatching rules in the literature, especially for complex production systems. However, the large heuristic search space may restrict genetic programming from finding near optimal dispatching rules. This paper develops a new hybrid genetic programming algorithm for dynamic job shop scheduling based on a new representation, a new local search heuristic, and efficient fitness evaluators. Experiments show that the new method is effective regarding the quality of evolved rules. Moreover, evolved rules are also significantly smaller and contain more relevant attributes.
Heuristic evaluation of online COPD respiratory therapy and education video resource center.
Stellefson, Michael; Chaney, Beth; Chaney, Don
2014-10-01
Abstract Purpose: Because of limited accessibility to pulmonary rehabilitation programs, patients with chronic obstructive pulmonary disease (COPD) are infrequently provided with patient education resources. To help educate patients with COPD on how to live a better life with diminished breathing capacity, we developed a novel social media resource center containing COPD respiratory therapy and education videos called "COPDFlix." A heuristic evaluation of COPDFlix was conducted as part of a larger study to determine whether the prototype was successful in adhering to formal Web site usability guidelines for older adults. A purposive sample of three experts, with expertise in Web design and health communications technology, was recruited (a) to identify usability violations and (b) to propose solutions to improve the functionality of the COPDFlix prototype. Each expert evaluated 18 heuristics in four categories of task-based criteria (i.e., interaction and navigation, information architecture, presentation design, and information design). Seventy-six subcriteria across these four categories were assessed. Quantitative ratings and qualitative comments from each expert were compiled into a single master list, noting the violated heuristic and type/location of problem(s). Sixty-one usability violations were identified across the 18 heuristics. Evaluators rated the majority of heuristic subcriteria as either a "minor hindrance" (n=32) or "no problem" (n=132). Moreover, only 2 of the 18 heuristic categories were noted as "major" violations, with mean severity scores of ≥3. Mixed-methods data analysis helped the multidisciplinary research team to categorize and prioritize usability problems and solutions, leading to 26 discrete design modifications within the COPDFlix prototype.
Approaches to eliminate waste and reduce cost for recycling glass.
Chao, Chien-Wen; Liao, Ching-Jong
2011-12-01
In recent years, the issue of environmental protection has received considerable attention. This paper adds to the literature by investigating a scheduling problem in the manufacturing of a glass recycling factory in Taiwan. The objective is to minimize the sum of the total holding cost and loss cost. We first represent the problem as an integer programming (IP) model, and then develop two heuristics based on the IP model to find near-optimal solutions for the problem. To validate the proposed heuristics, comparisons between optimal solutions from the IP model and solutions from the current method are conducted. The comparisons involve two problem sizes, small and large, where the small problems range from 15 to 45 jobs, and the large problems from 50 to 100 jobs. Finally, a genetic algorithm is applied to evaluate the proposed heuristics. Computational experiments show that the proposed heuristics can find good solutions in a reasonable time for the considered problem. Copyright © 2011 Elsevier Ltd. All rights reserved.
Development of heuristic bias detection in elementary school.
De Neys, Wim; Feremans, Vicky
2013-02-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 presented with child-friendly versions of classic base-rate problems in which a cued heuristic response could be inconsistent or consistent with the base rates. After each problem children were asked to indicate their subjective response confidence to assess their bias detection skills. Results indicated that 6th graders showed a clear confidence decrease when they gave a heuristic response that conflicted with the base rates. However, this confidence decrease was not observed for 3rd graders, suggesting that they did not yet acknowledge that their judgment was not fully warranted. Implications for the development of efficient training programs and the debate on human rationality are discussed. (c) 2013 APA, all rights reserved.
Determining the optimal number of Kanban in multi-products supply chain system
NASA Astrophysics Data System (ADS)
Widyadana, G. A.; Wee, H. M.; Chang, Jer-Yuan
2010-02-01
Kanban, a key element of just-in-time system, is a re-order card or signboard giving instruction or triggering the pull system to manufacture or supply a component based on actual usage of material. There are two types of Kanban: production Kanban and withdrawal Kanban. This study uses optimal and meta-heuristic methods to determine the Kanban quantity and withdrawal lot sizes in a supply chain system. Although the mix integer programming method gives an optimal solution, it is not time efficient. For this reason, the meta-heuristic methods are suggested. In this study, a genetic algorithm (GA) and a hybrid of genetic algorithm and simulated annealing (GASA) are used. The study compares the performance of GA and GASA with that of the optimal method using MIP. The given problems show that both GA and GASA result in a near optimal solution, and they outdo the optimal method in term of run time. In addition, the GASA heuristic method gives a better performance than the GA heuristic method.
The Dual Language Program Planner: A Guide for Designing and Implementing Dual Language Programs.
ERIC Educational Resources Information Center
Howard, Elizabeth R.; Olague, Natalie; Rogers, David
This guide offers a framework to facilitate the planning process for dual language programs, assuming at least a basic working knowledge of the central characteristics and essential features of dual language models. It provides an overview of the various models that serve linguistically diverse student populations, defining the term dual language…
Zhang, Huaguang; Song, Ruizhuo; Wei, Qinglai; Zhang, Tieyan
2011-12-01
In this paper, a novel heuristic dynamic programming (HDP) iteration algorithm is proposed to solve the optimal tracking control problem for a class of nonlinear discrete-time systems with time delays. The novel algorithm contains state updating, control policy iteration, and performance index iteration. To get the optimal states, the states are also updated. Furthermore, the "backward iteration" is applied to state updating. Two neural networks are used to approximate the performance index function and compute the optimal control policy for facilitating the implementation of HDP iteration algorithm. At last, we present two examples to demonstrate the effectiveness of the proposed HDP iteration algorithm.
MD/MBA Students: An Analysis of Medical Student Career Choice.
Sherrill, Windsor Westbrook
2004-12-01
An increasing number of medical schools are offering dual degree MD/MBA programs. Career choices and factors influencing students to enter these programs provide an indicator of the roles in which dual degree students will serve in health care as well as the future of dual degree programs. Using career choice theory as a conceptual framework, career goals and factors influencing decisions to enter dual degree programs were assessed among dual degree medical students. Students enrolled at dual degree programs at six medical schools were surveyed and interviewed. A control group of traditional medical students was also surveyed. Factors influencing students to seek both medical and business training are varied but are often related to a desire for leadership opportunities, concerns about change in medicine and job security and personal career goals. Most students expect to combine clinical and administrative roles. Students entering these programs do so for a variety of reasons and plan diverse careers. These findings can provide guidance for program development and recruitment for dual degree medical education programs.
Situated Research Design and Methodological Choices in Formative Program Evaluation
ERIC Educational Resources Information Center
Supovitz, Jonathan
2013-01-01
Design-based implementation research offers the opportunity to rethink the relationships between intervention, research, and situation to better attune research and evaluation to the program development process. Using a heuristic called the intervention development curve, I describe the rough trajectory that programs typically follow as they…
Using Curriculum-Based Measurements for Program Evaluation: Expanding Roles for School Psychologists
ERIC Educational Resources Information Center
Tusing, Mary E.; Breikjern, Nicholle A.
2017-01-01
Educators increasingly need to evaluate schoolwide reform efforts; however, complex program evaluations often are not feasible in schools. Through a case example, we provide a heuristic for program evaluation that is easily replicated in schools. Criterion-referenced interpretations of schoolwide screening data were used to evaluate outcomes…
ONR Conference on CAI Languages Held at Cambridge, Massachusetts, 2-3 March 1966.
ERIC Educational Resources Information Center
Entelek, Inc., Newburyport, MA.
An invitational meeting was held to consider computer-assisted instruction. Topics discussed included the BBM (Bolt, Beranek, Newman, Inc.) Mathematics program and programing languages, such as, Coursewriter, AUTHOR (Automatically Translating Heuristically Organized Routines), and PLATO/CATO (Programed Logic for Automatic Teaching Operations/PLATO…
Chumney, Elinor C.G.; Jones, Kathy J.
2008-01-01
Objective To evaluate the academic experience and satisfaction of students who completed a dual PharmD/MBA degree program and the program's long-term impact on the students' career choice and earning potential. Methods GPAs, job placement, and starting job salaries were compared between graduates who completed the dual PharmD/MBA program and those who completed only the PharmD program. A satisfaction survey instrument was administered to 17 students who completed the dual PharmD/MBA degree program in May 2007. Data from a standardized job placement and starting salary survey instrument completed by all PharmD graduates were also obtained, as well as all students' final grade point averages (GPAs). GPAs, job placement, and starting job salaries were compared between graduates who had completed the dual PharmD/MBA program and those who had completed only the PharmD program. Results The graduating GPAs of dual-degree students were higher than those of both pharmacy (3.52 vs 3.41, p > 0.10) and business (3.82 vs. 3.68, p = 0.018) students not enrolled in the dual-degree program. Dual-degree students were slightly less likely to enter a residency (17% vs. 27%, p = 0.44) than other pharmacy graduates. Among those who elected not to pursue a residency, both mean starting salaries ($111,090 vs. $101,965) and mean total first-year compensation ($127,290 vs. $110,388) were significantly higher for dual-degree graduates compared to the PharmD graduates. Conclusions Students enrolled in the dual-degree program did slightly better academically than students who completed only the MBA or PharmD programs and indicated a high level of satisfaction with the program. Dual-degree graduates reported increased career opportunities and were slated to earn significantly more during their first year in the workforce. These results affirm continuation of our program and make the case for support of similar programs across the nation. PMID:18483594
Configuring Airspace Sectors with Approximate Dynamic Programming
NASA Technical Reports Server (NTRS)
Bloem, Michael; Gupta, Pramod
2010-01-01
In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.
A Heuristics Approach for Classroom Scheduling Using Genetic Algorithm Technique
NASA Astrophysics Data System (ADS)
Ahmad, Izah R.; Sufahani, Suliadi; Ali, Maselan; Razali, Siti N. A. M.
2018-04-01
Reshuffling and arranging classroom based on the capacity of the audience, complete facilities, lecturing time and many more may lead to a complexity of classroom scheduling. While trying to enhance the productivity in classroom planning, this paper proposes a heuristic approach for timetabling optimization. A new algorithm was produced to take care of the timetabling problem in a university. The proposed of heuristics approach will prompt a superior utilization of the accessible classroom space for a given time table of courses at the university. Genetic Algorithm through Java programming languages were used in this study and aims at reducing the conflicts and optimizes the fitness. The algorithm considered the quantity of students in each class, class time, class size, time accessibility in each class and lecturer who in charge of the classes.
Heuristic Evaluation of Online COPD Respiratory Therapy and Education Video Resource Center
Chaney, Beth; Chaney, Don
2014-01-01
Abstract Purpose: Because of limited accessibility to pulmonary rehabilitation programs, patients with chronic obstructive pulmonary disease (COPD) are infrequently provided with patient education resources. To help educate patients with COPD on how to live a better life with diminished breathing capacity, we developed a novel social media resource center containing COPD respiratory therapy and education videos called “COPDFlix.” Methodology: A heuristic evaluation of COPDFlix was conducted as part of a larger study to determine whether the prototype was successful in adhering to formal Web site usability guidelines for older adults. A purposive sample of three experts, with expertise in Web design and health communications technology, was recruited (a) to identify usability violations and (b) to propose solutions to improve the functionality of the COPDFlix prototype. Each expert evaluated 18 heuristics in four categories of task-based criteria (i.e., interaction and navigation, information architecture, presentation design, and information design). Seventy-six subcriteria across these four categories were assessed. Quantitative ratings and qualitative comments from each expert were compiled into a single master list, noting the violated heuristic and type/location of problem(s). Results: Sixty-one usability violations were identified across the 18 heuristics. Evaluators rated the majority of heuristic subcriteria as either a “minor hindrance” (n=32) or “no problem” (n=132). Moreover, only 2 of the 18 heuristic categories were noted as “major” violations, with mean severity scores of ≥3. Conclusions: Mixed-methods data analysis helped the multidisciplinary research team to categorize and prioritize usability problems and solutions, leading to 26 discrete design modifications within the COPDFlix prototype. PMID:24650318
A Heuristic Model for Research on Prose Learning.
ERIC Educational Resources Information Center
Frase, Lawrence T.
Learning activities that are associated with programed materials can be applied to learning from ordinary text; in fact, there is no essential difference between programed and ordinary text. Active response so important to programed learning can be controlled in textual materials by carefully defined adjunct aids such as word lists, underlining,…
The Cognitive Domain: The Last Frontier. Final Report of the Regional Study Award Project.
ERIC Educational Resources Information Center
Clary, Joan; Mahaffy, John
The theoretical foundations of thinking skills models differ. One category of thinking skills programs uses the cognitive process approach on the premise that thinking abilities depend upon certain fundamental processes. Thinking skills programs that present a strategic approach to thinking are called heuristics-oriented programs, and focus on an…
A biologically inspired neural network model to transformation invariant object recognition
NASA Astrophysics Data System (ADS)
Iftekharuddin, Khan M.; Li, Yaqin; Siddiqui, Faraz
2007-09-01
Transformation invariant image recognition has been an active research area due to its widespread applications in a variety of fields such as military operations, robotics, medical practices, geographic scene analysis, and many others. The primary goal for this research is detection of objects in the presence of image transformations such as changes in resolution, rotation, translation, scale and occlusion. We investigate a biologically-inspired neural network (NN) model for such transformation-invariant object recognition. In a classical training-testing setup for NN, the performance is largely dependent on the range of transformation or orientation involved in training. However, an even more serious dilemma is that there may not be enough training data available for successful learning or even no training data at all. To alleviate this problem, a biologically inspired reinforcement learning (RL) approach is proposed. In this paper, the RL approach is explored for object recognition with different types of transformations such as changes in scale, size, resolution and rotation. The RL is implemented in an adaptive critic design (ACD) framework, which approximates the neuro-dynamic programming of an action network and a critic network, respectively. Two ACD algorithms such as Heuristic Dynamic Programming (HDP) and Dual Heuristic dynamic Programming (DHP) are investigated to obtain transformation invariant object recognition. The two learning algorithms are evaluated statistically using simulated transformations in images as well as with a large-scale UMIST face database with pose variations. In the face database authentication case, the 90° out-of-plane rotation of faces from 20 different subjects in the UMIST database is used. Our simulations show promising results for both designs for transformation-invariant object recognition and authentication of faces. Comparing the two algorithms, DHP outperforms HDP in learning capability, as DHP takes fewer steps to perform a successful recognition task in general. Further, the residual critic error in DHP is generally smaller than that of HDP, and DHP achieves a 100% success rate more frequently than HDP for individual objects/subjects. On the other hand, HDP is more robust than the DHP as far as success rate across the database is concerned when applied in a stochastic and uncertain environment, and the computational time involved in DHP is more.
Moving multiple sinks through wireless sensor networks for lifetime maximization.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Petrioli, Chiara; Carosi, Alessio; Basagni, Stefano
2008-01-01
Unattended sensor networks typically watch for some phenomena such as volcanic events, forest fires, pollution, or movements in animal populations. Sensors report to a collection point periodically or when they observe reportable events. When sensors are too far from the collection point to communicate directly, other sensors relay messages for them. If the collection point location is static, sensor nodes that are closer to the collection point relay far more messages than those on the periphery. Assuming all sensor nodes have roughly the same capabilities, those with high relay burden experience battery failure much faster than the rest of themore » network. However, since their death disconnects the live nodes from the collection point, the whole network is then dead. We consider the problem of moving a set of collectors (sinks) through a wireless sensor network to balance the energy used for relaying messages, maximizing the lifetime of the network. We show how to compute an upper bound on the lifetime for any instance using linear and integer programming. We present a centralized heuristic that produces sink movement schedules that produce network lifetimes within 1.4% of the upper bound for realistic settings. We also present a distributed heuristic that produces lifetimes at most 25:3% below the upper bound. More specifically, we formulate a linear program (LP) that is a relaxation of the scheduling problem. The variables are naturally continuous, but the LP relaxes some constraints. The LP has an exponential number of constraints, but we can satisfy them all by enforcing only a polynomial number using a separation algorithm. This separation algorithm is a p-median facility location problem, which we can solve efficiently in practice for huge instances using integer programming technology. This LP selects a set of good sensor configurations. Given the solution to the LP, we can find a feasible schedule by selecting a subset of these configurations, ordering them via a traveling salesman heuristic, and computing feasible transitions using matching algorithms. This algorithm assumes sinks can get a schedule from a central server or a leader sink. If the network owner prefers the sinks make independent decisions, they can use our distributed heuristic. In this heuristic, sinks maintain estimates of the energy distribution in the network and move greedily (with some coordination) based on local search. This application uses the new SUCASA (Solver Utility for Customization with Automatic Symbol Access) facility within the PICO (Parallel Integer and Combinatorial Optimizer) integer programming solver system. SUCASA allows rapid development of customized math programming (search-based) solvers using a problem's natural multidimensional representation. In this case, SUCASA also significantly improves runtime compared to implementations in the ampl math programming language or in perl.« less
A model for diagnosing and explaining multiple disorders.
Jamieson, P W
1991-08-01
The ability to diagnose multiple interacting disorders and explain them in a coherent causal framework has only partially been achieved in medical expert systems. This paper proposes a causal model for diagnosing and explaining multiple disorders whose key elements are: physician-directed hypotheses generation, object-oriented knowledge representation, and novel explanation heuristics. The heuristics modify and link the explanations to make the physician aware of diagnostic complexities. A computer program incorporating the model currently is in use for diagnosing peripheral nerve and muscle disorders. The program successfully diagnoses and explains interactions between diseases in terms of underlying pathophysiologic concepts. The model offers a new architecture for medical domains where reasoning from first principles is difficult but explanation of disease interactions is crucial for the system's operation.
Heuristic reusable dynamic programming: efficient updates of local sequence alignment.
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.
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.
Dong, Lu; Zhong, Xiangnan; Sun, Changyin; He, Haibo
2017-07-01
This paper presents the design of a novel adaptive event-triggered control method based on the heuristic dynamic programming (HDP) technique for nonlinear discrete-time systems with unknown system dynamics. In the proposed method, the control law is only updated when the event-triggered condition is violated. Compared with the periodic updates in the traditional adaptive dynamic programming (ADP) control, the proposed method can reduce the computation and transmission cost. An actor-critic framework is used to learn the optimal event-triggered control law and the value function. Furthermore, a model network is designed to estimate the system state vector. The main contribution of this paper is to design a new trigger threshold for discrete-time systems. A detailed Lyapunov stability analysis shows that our proposed event-triggered controller can asymptotically stabilize the discrete-time systems. Finally, we test our method on two different discrete-time systems, and the simulation results are included.
Direct heuristic dynamic programming for damping oscillations in a large power system.
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.
A boundedness result for the direct heuristic dynamic programming.
Liu, Feng; Sun, Jian; Si, Jennie; Guo, Wentao; Mei, Shengwei
2012-08-01
Approximate/adaptive dynamic programming (ADP) has been studied extensively in recent years for its potential scalability to solve large state and control space problems, including those involving continuous states and continuous controls. The applicability of ADP algorithms, especially the adaptive critic designs has been demonstrated in several case studies. Direct heuristic dynamic programming (direct HDP) is one of the ADP algorithms inspired by the adaptive critic designs. It has been shown applicable to industrial scale, realistic and complex control problems. In this paper, we provide a uniformly ultimately boundedness (UUB) result for the direct HDP learning controller under mild and intuitive conditions. By using a Lyapunov approach we show that the estimation errors of the learning parameters or the weights in the action and critic networks remain UUB. This result provides a useful controller convergence guarantee for the first time for the direct HDP design. Copyright © 2012 Elsevier Ltd. All rights reserved.
Dual Enrollment Programs. What Works Clearinghouse Intervention Report
ERIC Educational Resources Information Center
What Works Clearinghouse, 2017
2017-01-01
"Dual enrollment" programs allow high school students to take college courses and earn college credits while still attending high school. Such programs, also referred to as "dual credit" or early college programs, are designed to boost college access and degree attainment, especially for students typically underrepresented in…
Exact and Heuristic Algorithms for Runway Scheduling
NASA Technical Reports Server (NTRS)
Malik, Waqar A.; Jung, Yoon C.
2016-01-01
This paper explores the Single Runway Scheduling (SRS) problem with arrivals, departures, and crossing aircraft on the airport surface. Constraints for wake vortex separations, departure area navigation separations and departure time window restrictions are explicitly considered. The main objective of this research is to develop exact and heuristic based algorithms that can be used in real-time decision support tools for Air Traffic Control Tower (ATCT) controllers. The paper provides a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the SRS problem, but may prove unusable for application in real-time environment due to large computation times for moderate sized problems. We next propose a second algorithm that uses heuristics to restrict the search space for the DP based algorithm. A third algorithm based on a combination of insertion and local search (ILS) heuristics is then presented. Simulation conducted for the east side of Dallas/Fort Worth International Airport allows comparison of the three proposed algorithms and indicates that the ILS algorithm performs favorably in its ability to find efficient solutions and its computation times.
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.
Robust/optimal temperature profile control of a high-speed aerospace vehicle using neural networks.
Yadav, Vivek; Padhi, Radhakant; Balakrishnan, S N
2007-07-01
An approximate dynamic programming (ADP)-based suboptimal neurocontroller to obtain desired temperature for a high-speed aerospace vehicle is synthesized in this paper. A 1-D distributed parameter model of a fin is developed from basic thermal physics principles. "Snapshot" solutions of the dynamics are generated with a simple dynamic inversion-based feedback controller. Empirical basis functions are designed using the "proper orthogonal decomposition" (POD) technique and the snapshot solutions. A low-order nonlinear lumped parameter system to characterize the infinite dimensional system is obtained by carrying out a Galerkin projection. An ADP-based neurocontroller with a dual heuristic programming (DHP) formulation is obtained with a single-network-adaptive-critic (SNAC) controller for this approximate nonlinear model. Actual control in the original domain is calculated with the same POD basis functions through a reverse mapping. Further contribution of this paper includes development of an online robust neurocontroller to account for unmodeled dynamics and parametric uncertainties inherent in such a complex dynamic system. A neural network (NN) weight update rule that guarantees boundedness of the weights and relaxes the need for persistence of excitation (PE) condition is presented. Simulation studies show that in a fairly extensive but compact domain, any desired temperature profile can be achieved starting from any initial temperature profile. Therefore, the ADP and NN-based controllers appear to have the potential to become controller synthesis tools for nonlinear distributed parameter systems.
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.
A Case Study of Dual Language Program Administrators: The Teachers We Need
ERIC Educational Resources Information Center
Lachance, Joan R.
2017-01-01
In support of growing numbers of dual language programs nation-wide, dual language school administrators seek to find teachers who are specifically prepared to work with dual language learners for additive biliteracy. For this research the author utilized a case study design to explore practicing dual language administrators' perspectives…
ERIC Educational Resources Information Center
Palmer, Deborah
2010-01-01
Dual-language education is often lauded for providing high-caliber bilingual instruction in an integrated classroom. This is complicated, however, when a dual-language program does not include all members of a school community. This article examines a "strand" dual-language program that attracts middle-class white students to a predominantly black…
Optimal rail container shipment planning problem in multimodal transportation
NASA Astrophysics Data System (ADS)
Cao, Chengxuan; Gao, Ziyou; Li, Keping
2012-09-01
The optimal rail container shipment planning problem in multimodal transportation is studied in this article. The characteristics of the multi-period planning problem is presented and the problem is formulated as a large-scale 0-1 integer programming model, which maximizes the total profit generated by all freight bookings accepted in a multi-period planning horizon subject to the limited capacities. Two heuristic algorithms are proposed to obtain an approximate optimal solution of the problem. Finally, numerical experiments are conducted to demonstrate the proposed formulation and heuristic algorithms.
The Dual Participants: A High Risk Drinking Driver Target Group.
ERIC Educational Resources Information Center
Kline, Michael V.; And Others
1988-01-01
Studied dual participants (N=2,525), multiple offender drinking driver program participants who also attend non-drinking driver alcohol treatment programs. Findings support need for drinking driver programs to be aware of high risk dual participants and for alcohol-related treatment programs to provide drinking and driving education to all dual…
Positive emotional context eliminates the framing effect in decision-making.
Cassotti, Mathieu; Habib, Marianne; Poirel, Nicolas; Aïte, Ania; Houdé, Olivier; Moutier, Sylvain
2012-10-01
Dual-process theories have suggested that emotion plays a key role in the framing effect in decision-making. However, little is known about the potential impact of a specific positive or negative emotional context on this bias. We investigated this question with adult participants using an emotional priming paradigm. First, participants were presented with positive or negative affective pictures (i.e., pleasant vs. unpleasant photographs). Afterward, participants had to perform a financial decision-making task that was unrelated to the pictures previously presented. The results revealed that the presentation framed in terms of gain or loss no longer affected subjects' decision-making following specific exposure to emotionally pleasant pictures. Interestingly, a positive emotional context did not globally influence risk-taking behavior but specifically decreased the risk propensity in the loss frame. This finding confirmed that a positive emotional context can reduce loss aversion, and it strongly reinforced the dual-process view that the framing effect stems from an affective heuristic belonging to intuitive System 1.
Gibbons, Frederick X; Houlihan, Amy E; Gerrard, Meg
2009-05-01
A brief overview of theories of health behaviour that are based on the expectancy-value perspective is presented. This approach maintains that health behaviours are the result of a deliberative decision-making process that involves consideration of behavioural options along with anticipated outcomes associated with those options. It is argued that this perspective is effective at explaining and predicting many types of health behaviour, including health-promoting actions (e.g. UV protection, condom use, smoking cessation), but less effective at predicting risky health behaviours, such as unprotected, casual sex, drunk driving or binge drinking. These are behaviours that are less reasoned or premeditated - especially among adolescents. An argument is made for incorporating elements of dual-processing theories in an effort to improve the 'utility' of these models. Specifically, it is suggested that adolescent health behaviour involves both analytic and heuristic processing. Both types of processing are incorporated in the prototype-willingness (prototype) model, which is described in some detail. Studies of health behaviour based on the expectancy-value perspective (e.g. theory of reasoned action) are reviewed, along with studies based on the prototype model. These two sets of studies together suggest that the dual-processing perspective, in general, and the prototype model, in particular, add to the predictive validity of expectancy-value models for predicting adolescent health behaviour. Research and interventions that incorporate elements of dual-processing and elements of expectancy-value are more effective at explaining and changing adolescent health behaviour than are those based on expectancy-value theories alone.
NASA Technical Reports Server (NTRS)
Haftka, R. T.; Adelman, H. M.
1984-01-01
Orbiting spacecraft such as large space antennas have to maintain a highly accurate space to operate satisfactorily. Such structures require active and passive controls to mantain an accurate shape under a variety of disturbances. Methods for the optimum placement of control actuators for correcting static deformations are described. In particular, attention is focused on the case were control locations have to be selected from a large set of available sites, so that integer programing methods are called for. The effectiveness of three heuristic techniques for obtaining a near-optimal site selection is compared. In addition, efficient reanalysis techniques for the rapid assessment of control effectiveness are presented. Two examples are used to demonstrate the methods: a simple beam structure and a 55m space-truss-parabolic antenna.
Multilayer Optimization of Heterogeneous Networks Using Grammatical Genetic Programming.
Fenton, Michael; Lynch, David; Kucera, Stepan; Claussen, Holger; O'Neill, Michael
2017-09-01
Heterogeneous cellular networks are composed of macro cells (MCs) and small cells (SCs) in which all cells occupy the same bandwidth. Provision has been made under the third generation partnership project-long term evolution framework for enhanced intercell interference coordination (eICIC) between cell tiers. Expanding on previous works, this paper instruments grammatical genetic programming to evolve control heuristics for heterogeneous networks. Three aspects of the eICIC framework are addressed including setting SC powers and selection biases, MC duty cycles, and scheduling of user equipments (UEs) at SCs. The evolved heuristics yield minimum downlink rates three times higher than a baseline method, and twice that of a state-of-the-art benchmark. Furthermore, a greater number of UEs receive transmissions under the proposed scheme than in either the baseline or benchmark cases.
Theoretical domains: a heuristic for teaching behavioral theory in HIV/STD prevention courses.
Dolcini, M Margaret; Canin, Lisa; Gandelman, Alice; Skolnik, Heidi
2004-10-01
The HIV/STD epidemics have broadened the need for better behavioral intervention programs and highlighted the importance of providing training in behavioral theory to frontline program practitioners. However, there is a lack of effective methods for teaching theoretical concepts to people who may not have a background in behavioral science. This article presents a solution to this challenge by introducing a new heuristic for teaching theory and for placing individual theories/models in a broader context. Using a broad framework, we identify five domains that influence behavior: risk appraisal, self-perceptions, emotions and arousal, relationships and social influence, and environmental and structural factors. Each domain is described, and a brief overview of supporting literature is provided. Following the presentation of domains, we discuss course structure and activities.
Tsujii, Takeo; Sakatani, Kaoru; Masuda, Sayako; Akiyama, Takekazu; Watanabe, Shigeru
2011-09-15
This study used off-line repetitive transcranial magnetic stimulation (rTMS) to examine the roles of the superior parietal lobule (SPL) and inferior frontal gyrus (IFG) in a deductive reasoning task. Subjects performed a categorical syllogistic reasoning task involving congruent, incongruent, and abstract trials. Twenty four subjects received magnetic stimulation to the SPL region prior to the task. In the other 24 subjects, TMS was administered to the IFG region before the task. Stimulation lasted for 10min, with an inter-pulse frequency of 1Hz. We found that bilateral SPL (Brodmann area (BA) 7) stimulation disrupted performance on abstract and incongruent reasoning. Left IFG (BA 45) stimulation impaired congruent reasoning performance while paradoxically facilitating incongruent reasoning performance. This resulted in the elimination of the belief-bias. In contrast, right IFG stimulation only impaired incongruent reasoning performance, thus enhancing the belief-bias effect. These findings are largely consistent with the dual-process theory of reasoning, which proposes the existence of two different human reasoning systems: a belief-based heuristic system; and a logic-based analytic system. The present findings suggest that the left language-related IFG (BA 45) may correspond to the heuristic system, while bilateral SPL may underlie the analytic system. The right IFG may play a role in blocking the belief-based heuristic system for solving incongruent reasoning trials. This study could offer an insight about functional roles of distributed brain systems in human deductive reasoning by utilizing the rTMS approach. Copyright © 2011 Elsevier Inc. All rights reserved.
ERIC Educational Resources Information Center
Ulrici, Donna; And Others
1981-01-01
Provides a model for categorizing marital and family skill training programs according to their theoretical orientation. Describes emotional, reasoning, and action approaches to intervention which allow counselors to examine the relationship between client characteristics and intervention approaches. (JAC)
Optimal Assembly of Psychological and Educational Tests.
ERIC Educational Resources Information Center
van der Linden, Wim J.
1998-01-01
Reviews optimal test-assembly literature and introduces the contributions to this special issue. Discusses four approaches to computerized test assembly: (1) heuristic-based test assembly; (2) 0-1 linear programming; (3) network-flow programming; and (4) an optimal design approach. Contains a bibliography of 90 sources on test assembly.…
An Interactive Multiobjective Programming Approach to Combinatorial Data Analysis.
ERIC Educational Resources Information Center
Brusco, Michael J.; Stahl, Stephanie
2001-01-01
Describes an interactive procedure for multiobjective asymmetric unidimensional seriation problems that uses a dynamic-programming algorithm to generate partially the efficient set of sequences for small to medium-sized problems and a multioperational heuristic to estimate the efficient set for larger problems. Applies the procedure to an…
AN EVALUATION OF HEURISTICS FOR THRESHOLD-FUNCTION TEST-SYNTHESIS,
Linear programming offers the most attractive procedure for testing and obtaining optimal threshold gate realizations for functions generated in...The design of the experiments may be of general interest to students of automatic problem solving; the results should be of interest in threshold logic and linear programming. (Author)
NASA Astrophysics Data System (ADS)
Hara, Toshitsugu
Elementary education program for engineering by the dual system combined with workshop program and teaching program with practical subject was discussed. The dual system which consists of several workshop programs and fundamental subjects (such as mathematics, English and physics) with practical material has been performed for the freshmen. The elementary workshop program (primary course) has four workshops and the related lectures. Fundamental subjects are taught with the practical or engineering texts. English subjects are taught by specified teachers who have ever worked in engineering field with English. The dual system was supported by such systems as the center for success initiative and the English education center.
ERIC Educational Resources Information Center
Cook, Natalie Gail
2017-01-01
Dual enrollment numbers continue to increase in public school districts; therefore, dual credit programs must be effective for students, adequately challenging them academically and preparing them for the college environment (Flores, 2014). The intention of this study was to survey dual credit instructors and counselors to determine their opinions…
ERIC Educational Resources Information Center
Touchstone, Allison J. L.
2010-01-01
Dual credit programs have become increasingly popular with 71% U.S. public high schools offering dual credit courses in 2002-2003. As this popularity has grown, so have concerns regarding academic rigor, course quality, parity with college courses, and effects on higher education. Determining actual dual credit course equivalent in higher…
Assessment is Epistemic and Heuristic: The Role of Video Tape in the Public Speaking Course.
ERIC Educational Resources Information Center
Clyde, Glenda; And Others
With certifying end-of-program achievement as their goal, a group of educators conducted a pilot assessment program at Northeast Missouri State University in 1992. The program called for the videotaping of each student's third speech to be assessed by outside judges. The present study attempted to determine if videotaping and self-evaluation…
Investigation of air transportation technology at Princeton University, 1990-1991
NASA Technical Reports Server (NTRS)
Stengel, Robert F.
1991-01-01
The Air Transportation Technology Program at Princeton University is a program that emphasizes graduate and undergraduate student research. The program proceeded along six avenues during the past year: microburst hazards to aircraft, intelligent failure tolerant control, computer-aided heuristics for piloted flight, stochastic robustness of flight control systems, neural networks for flight control, and computer-aided control system design.
Dual Credit: Creating Career and Work Possibilities for Canadian Youth
ERIC Educational Resources Information Center
Watt-Malcolm, Bonnie
2011-01-01
In this article, I investigated the problems that educators are addressing with dual credit initiatives and consider tensions that have limited the seamless implementation of dual credit programming. Stakeholder representatives clearly identified common resources and support required to sustain their dual credit programs. Study participants noted…
Klaczynski, Paul A.
2014-01-01
In Stanovich's (2009a, 2011) dual-process theory, analytic processing occurs in the algorithmic and reflective minds. Thinking dispositions, indexes of reflective mind functioning, are believed to regulate operations at the algorithmic level, indexed by general cognitive ability. General limitations at the algorithmic level impose constraints on, and affect the adequacy of, specific strategies and abilities (e.g., numeracy). In a study of 216 undergraduates, the hypothesis that thinking dispositions and general ability moderate the relationship between numeracy (understanding of mathematical concepts and attention to numerical information) and normative responses on probabilistic heuristics and biases (HB) problems was tested. Although all three individual difference measures predicted normative responses, the numeracy-normative response association depended on thinking dispositions and general ability. Specifically, numeracy directly affected normative responding only at relatively high levels of thinking dispositions and general ability. At low levels of thinking dispositions, neither general ability nor numeric skills related to normative responses. Discussion focuses on the consistency of these findings with the hypothesis that the implementation of specific skills is constrained by limitations at both the reflective level and the algorithmic level, methodological limitations that prohibit definitive conclusions, and alternative explanations. PMID:25071639
Klaczynski, Paul A
2014-01-01
In Stanovich's (2009a, 2011) dual-process theory, analytic processing occurs in the algorithmic and reflective minds. Thinking dispositions, indexes of reflective mind functioning, are believed to regulate operations at the algorithmic level, indexed by general cognitive ability. General limitations at the algorithmic level impose constraints on, and affect the adequacy of, specific strategies and abilities (e.g., numeracy). In a study of 216 undergraduates, the hypothesis that thinking dispositions and general ability moderate the relationship between numeracy (understanding of mathematical concepts and attention to numerical information) and normative responses on probabilistic heuristics and biases (HB) problems was tested. Although all three individual difference measures predicted normative responses, the numeracy-normative response association depended on thinking dispositions and general ability. Specifically, numeracy directly affected normative responding only at relatively high levels of thinking dispositions and general ability. At low levels of thinking dispositions, neither general ability nor numeric skills related to normative responses. Discussion focuses on the consistency of these findings with the hypothesis that the implementation of specific skills is constrained by limitations at both the reflective level and the algorithmic level, methodological limitations that prohibit definitive conclusions, and alternative explanations.
ERIC Educational Resources Information Center
Gong, Wen; Rojewski, Jay W.
2015-01-01
A model describing the development of curriculum and coursework for dual certification programs in two-year postsecondary vocational education institutions throughout China is described. Dual certification programs allow students to obtain an academic diploma and a national vocational qualification certificate concurrently. Chinese educators and…
Establishing a framework for a physician assistant/bioethics dual degree program.
Carr, Mark F; Bergman, Brett A
2014-01-01
: Numerous medical schools currently offer a master of arts (MA) in bioethics dual degree for physicians. A degree in bioethics enhances the care physicians provide to patients and prepares physicians to serve on ethics committees and consult services. Additionally, they may work on institutional and public policy issues related to ethics. Several physician assistant (PA) programs currently offer a master of public health (MPH) dual degree for PAs. A degree in public health prepares PAs for leadership roles in meeting community health needs. With the success of PA/MPH dual degree programs, we argue here that a PA/bioethics dual degree would be another opportunity to advance the PA profession and consider how such a program might be implemented. The article includes the individual perspectives of the authors, one of whom completed a graduate-level certificate in bioethics concurrently with his 2-year PA program, while the other served as a bioethics program director.
ERIC Educational Resources Information Center
Smith, Karl
2014-01-01
Since 1990, high school students in Washington have had the choice of earning college credit through the Running Start program. Running start is a dual enrollment and dual credit program that allows eleventh and twelfth grade high school students to take college courses at any of Washington's 34 community and technical colleges, Central Washington…
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.
A Heuristic Model for Creating a Writer's Audience.
ERIC Educational Resources Information Center
Petrick, Joanne F.; Pfister, Fred R.
The design of a program for teaching audience awareness proceeds in a clear and logical order so that it can be incorporated into any writing syllabus concerned with traditional matters of form. The program begins with a brief questionnaire designed to elicit student problems with and feelings about audience. Class discussion of the questionnaire…
Rhetorical Consequences of the Computer Society: Expert Systems and Human Communication.
ERIC Educational Resources Information Center
Skopec, Eric Wm.
Expert systems are computer programs that solve selected problems by modelling domain-specific behaviors of human experts. These computer programs typically consist of an input/output system that feeds data into the computer and retrieves advice, an inference system using the reasoning and heuristic processes of human experts, and a knowledge…
ERIC Educational Resources Information Center
Brusco, Michael J.; Kohn, Hans-Friedrich; Stahl, Stephanie
2008-01-01
Dynamic programming methods for matrix permutation problems in combinatorial data analysis can produce globally-optimal solutions for matrices up to size 30x30, but are computationally infeasible for larger matrices because of enormous computer memory requirements. Branch-and-bound methods also guarantee globally-optimal solutions, but computation…
NASA Astrophysics Data System (ADS)
Eilbert, Richard F.; Krug, Kristoph D.
1993-04-01
The Vivid Rapid Explosives Detection Systems is a true dual energy x-ray machine employing precision x-ray data acquisition in combination with unique algorithms and massive computation capability. Data from the system's 960 detectors is digitally stored and processed by powerful supermicro-computers organized as an expandable array of parallel processors. The algorithms operate on the dual energy attenuation image data to recognize and define objects in the milieu of the baggage contents. Each object is then systematically examined for a match to a specific effective atomic number, density, and mass threshold. Material properties are determined by comparing the relative attenuations of the 75 kVp and 150 kVp beams and electronically separating the object from its local background. Other heuristic algorithms search for specific configurations and provide additional information. The machine automatically detects explosive materials and identifies bomb components in luggage with high specificity and throughput, X-ray dose is comparable to that of current airport x-ray machines. The machine is also configured to find heroin, cocaine, and US currency by selecting appropriate settings on-site. Since January 1992, production units have been operationally deployed at U.S. and European airports for improved screening of checked baggage.
ERIC Educational Resources Information Center
Edwards, Linsey; Hughes, Katherine L.; Weisberg, Alan
2011-01-01
Dual enrollment programs allow high school students to take college courses and earn college credit. While dual enrollment has historically focused on high-achieving students, these programs can have significant benefits for underperforming students as well, particularly if integrated with a career focus. This research shows that student…
Quasi-Optimal Elimination Trees for 2D Grids with Singularities
Paszyńska, A.; Paszyński, M.; Jopek, K.; ...
2015-01-01
We consmore » truct quasi-optimal elimination trees for 2D finite element meshes with singularities. These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal. We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost O N e log N e , where N e is the number of elements in the mesh. We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.« less
Quasi-Optimal Elimination Trees for 2D Grids with Singularities
DOE Office of Scientific and Technical Information (OSTI.GOV)
Paszyńska, A.; Paszyński, M.; Jopek, K.
We consmore » truct quasi-optimal elimination trees for 2D finite element meshes with singularities. These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal. We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost O N e log N e , where N e is the number of elements in the mesh. We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.« less
NASA Astrophysics Data System (ADS)
Gupta, Puneet; Kahng, Andrew B.; Kim, Youngmin; Sylvester, Dennis
2006-03-01
Focus is one of the major sources of linewidth variation. CD variation caused by defocus is largely systematic after the layout is finished. In particular, dense lines "smile" through focus while isolated lines "frown" in typical Bossung plots. This well-defined systematic behavior of focus-dependent CD variation allows us to develop a self-compensating design methodology. In this work, we propose a novel design methodology that allows explicit compensation of focus-dependent CD variation, either within a cell (self-compensated cells) or across cells in a critical path (self-compensated design). By creating iso and dense variants for each library cell, we can achieve designs that are more robust to focus variation. Optimization with a mixture of iso and dense cell variants is possible both for area and leakage power, with the latter providing an interesting complement to existing leakage reduction techniques such as dual-Vth. We implement both heuristic and Mixed-Integer Linear Programming (MILP) solution methods to address this optimization, and experimentally compare their results. Our results indicate that designing with a self-compensated cell library incurs ~12% area penalty and ~6% leakage increase over original layouts while compensating for focus-dependent CD variation (i.e., the design meets timing constraints across a large range of focus variation). We observe ~27% area penalty and ~7% leakage increase at the worst-case defocus condition using only single-pitch cells. The area penalty of circuits after using either the heuristic or MILP optimization approach is reduced to ~3% while maintaining timing. We also apply our optimizations to leakage, which traditionally shows very large variability due to its exponential relationship with gate CD. We conclude that a mixed iso/dense library combined with a sensitivity-based optimization approach yields much better area/timing/leakage tradeoffs than using a self-compensated cell library alone. Self-compensated design shows an average of 25% leakage reduction at the worst defocus condition for the benchmark designs that we have studied.
ERIC Educational Resources Information Center
Courtney, E. Wayne
The purpose of this document was to generate a rationale and a design for planning a conceptual basis for developing common curriculums in vocational teacher education training programs. A review of the literature discusses heuristic approaches to teacher education, the rational basis for common programs, empirical studies in teacher education,…
ERIC Educational Resources Information Center
Lile, Joy R.; Ottusch, Timothy M.; Jones, Terese; Richards, Leslie N.
2018-01-01
Dual-enrollment programs have been proposed as a useful way to ease students' transition from high school to community college. Several studies have shown that dual enrollment produces positive effects for students, but less is known about the mechanisms these programs use to support student success. Symbolic interactionism suggests that clarity…
Lexicographic goal programming and assessment tools for a combinatorial production problem.
DOT National Transportation Integrated Search
2008-01-01
NP-complete combinatorial problems often necessitate the use of near-optimal solution techniques including : heuristics and metaheuristics. The addition of multiple optimization criteria can further complicate : comparison of these solution technique...
Gartner, Daniel; Zhang, Yiye; Padman, Rema
2018-06-01
Order sets are a critical component in hospital information systems that are expected to substantially reduce physicians' physical and cognitive workload and improve patient safety. Order sets represent time interval-clustered order items, such as medications prescribed at hospital admission, that are administered to patients during their hospital stay. In this paper, we develop a mathematical programming model and an exact and a heuristic solution procedure with the objective of minimizing physicians' cognitive workload associated with prescribing order sets. Furthermore, we provide structural insights into the problem which lead us to a valid lower bound on the order set size. In a case study using order data on Asthma patients with moderate complexity from a major pediatric hospital, we compare the hospital's current solution with the exact and heuristic solutions on a variety of performance metrics. Our computational results confirm our lower bound and reveal that using a time interval decomposition approach substantially reduces computation times for the mathematical program, as does a K -means clustering based decomposition approach which, however, does not guarantee optimality because it violates the lower bound. The results of comparing the mathematical program with the current order set configuration in the hospital indicates that cognitive workload can be reduced by about 20.2% by allowing 1 to 5 order sets, respectively. The comparison of the K -means based decomposition with the hospital's current configuration reveals a cognitive workload reduction of about 19.5%, also by allowing 1 to 5 order sets, respectively. We finally provide a decision support system to help practitioners analyze the current order set configuration, the results of the mathematical program and the heuristic approach.
Health care utilization among Medicare-Medicaid dual eligibles: a count data analysis.
Moon, Sangho; Shin, Jaeun
2006-04-05
Medicare-Medicaid dual eligibles are the beneficiaries of both Medicare and Medicaid. Dual eligibles satisfy the eligibility conditions for Medicare benefit. Dual eligibles also qualify for Medicaid because they are aged, blind, or disabled and meet the income and asset requirements for receiving Supplement Security Income (SSI) assistance. The objective of this study is to explore the relationship between dual eligibility and health care utilization among Medicare beneficiaries. The household component of the nationally representative Medical Expenditure Panel Survey (MEPS) 1996-2000 is used for the analysis. Total 8,262 Medicare beneficiaries are selected from the MEPS data. The Medicare beneficiary sample includes individuals who are covered by Medicare and do not have private health insurance during a given year. Zero-inflated negative binomial (ZINB) regression model is used to analyse the count data regarding health care utilization: office-based physician visits, hospital inpatient nights, agency-sponsored home health provider days, and total dental visits. Dual eligibility is positively correlated with the likelihood of using hospital inpatient care and agency-sponsored home health services and the frequency of agency-sponsored home health days. Frequency of dental visits is inversely associated with dual eligibility. With respect to racial differences, dually eligible Afro-Americans use more office-based physician and dental services than white duals. Asian duals use more home health services than white duals at the 5% statistical significance level. The dual eligibility programs seem particularly beneficial to Afro-American duals. Dual eligibility has varied impact on health care utilization across service types. More utilization of home healthcare among dual eligibles appears to be the result of delayed realization of their unmet healthcare needs under the traditional Medicare-only program rather than the result of overutilization in response to the expanded benefits of the dual eligibility program. The dual eligibility program is particularly beneficial to Asian and Afro-American duals in association with the provision of home healthcare and dental benefits.
The Stratway Program for Strategic Conflict Resolution: User's Guide
NASA Technical Reports Server (NTRS)
Hagen, George E.; Butler, Ricky W.; Maddalon, Jeffrey M.
2016-01-01
Stratway is a strategic conflict detection and resolution program. It provides both intent-based conflict detection and conflict resolution for a single ownship in the presence of multiple traffic aircraft and weather cells defined by moving polygons. It relies on a set of heuristic search strategies to solve conflicts. These strategies are user configurable through multiple parameters. The program can be called from other programs through an application program interface (API) and can also be executed from a command line.
Ckmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming.
Wang, Haizhou; Song, Mingzhou
2011-12-01
The heuristic k -means algorithm, widely used for cluster analysis, does not guarantee optimality. We developed a dynamic programming algorithm for optimal one-dimensional clustering. The algorithm is implemented as an R package called Ckmeans.1d.dp . We demonstrate its advantage in optimality and runtime over the standard iterative k -means algorithm.
Dual Language Immersion Program Equity and Access: Is There Equity for All Students?
ERIC Educational Resources Information Center
Fernandez, Patricia Espinoza
2016-01-01
This is a mixed methods study of K-12 school administrators with dual language immersion school leadership expertise. The paramount research focus was to identify equity and access issues in dual language immersion programs serving grades K-12, as identified by school administrators who have led such programs. A total pool of 498 were invited to…
ERIC Educational Resources Information Center
Block, Nicholas
2011-01-01
Forty initially English-dominant Latino students in four 90:10 Spanish two-way dual-immersion programs and 62 of their peers in mainstream English programs were studied to find out if their attitudes toward Spanish and Spanish-dominant individuals differ. Significant differences were found on many variables, with two-way dual-immersion students…
NASA Astrophysics Data System (ADS)
Jitomirskaya, S.; Marx, C. A.
2012-11-01
We show how to extend (and with what limitations) Avila's global theory of analytic SL(2,C) cocycles to families of cocycles with singularities. This allows us to develop a strategy to determine the Lyapunov exponent for the extended Harper's model, for all values of parameters and all irrational frequencies. In particular, this includes the self-dual regime for which even heuristic results did not previously exist in physics literature. The extension of Avila's global theory is also shown to imply continuous behavior of the LE on the space of analytic {M_2({C})}-cocycles. This includes rational approximation of the frequency, which so far has not been available.
ACCESS 3. Approximation concepts code for efficient structural synthesis: User's guide
NASA Technical Reports Server (NTRS)
Fleury, C.; Schmit, L. A., Jr.
1980-01-01
A user's guide is presented for ACCESS-3, a research oriented program which combines dual methods and a collection of approximation concepts to achieve excellent efficiency in structural synthesis. The finite element method is used for structural analysis and dual algorithms of mathematical programming are applied in the design optimization procedure. This program retains all of the ACCESS-2 capabilities and the data preparation formats are fully compatible. Four distinct optimizer options were added: interior point penalty function method (NEWSUMT); second order primal projection method (PRIMAL2); second order Newton-type dual method (DUAL2); and first order gradient projection-type dual method (DUAL1). A pure discrete and mixed continuous-discrete design variable capability, and zero order approximation of the stress constraints are also included.
Efficient partitioning and assignment on programs for multiprocessor execution
NASA Technical Reports Server (NTRS)
Standley, Hilda M.
1993-01-01
The general problem studied is that of segmenting or partitioning programs for distribution across a multiprocessor system. Efficient partitioning and the assignment of program elements are of great importance since the time consumed in this overhead activity may easily dominate the computation, effectively eliminating any gains made by the use of the parallelism. In this study, the partitioning of sequentially structured programs (written in FORTRAN) is evaluated. Heuristics, developed for similar applications are examined. Finally, a model for queueing networks with finite queues is developed which may be used to analyze multiprocessor system architectures with a shared memory approach to the problem of partitioning. The properties of sequentially written programs form obstacles to large scale (at the procedure or subroutine level) parallelization. Data dependencies of even the minutest nature, reflecting the sequential development of the program, severely limit parallelism. The design of heuristic algorithms is tied to the experience gained in the parallel splitting. Parallelism obtained through the physical separation of data has seen some success, especially at the data element level. Data parallelism on a grander scale requires models that accurately reflect the effects of blocking caused by finite queues. A model for the approximation of the performance of finite queueing networks is developed. This model makes use of the decomposition approach combined with the efficiency of product form solutions.
Dual Enrollment Academy Programs
ERIC Educational Resources Information Center
Gonzalez, Nicolas; Chavez, Guadalupe
2009-01-01
Dual Enrollment Engineering (DEEA) and Medical Science (DEMSA) Academies are two-year dual enrollment programs for high school students. Students explore engineering and medical careers through college coursework. Students prepare for higher education in engineering and medical fields while completing associate degrees in biology or engineering…
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.
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
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.
ERIC Educational Resources Information Center
Stephenson, Lisa G.
2013-01-01
Credit-based transition programs provide high school students with opportunities to jump start their college education. The Kentucky Community and Technical College System (KCTCS) offers college credit through dual-credit programs. While KCTCS dual-credit offerings have been successful in helping high school students start their college education…
Dual Enrollment: The Missing Link to College Readiness
ERIC Educational Resources Information Center
Swanson, Joni
2010-01-01
Dual enrollment programs have sparked the interest of educational researchers and practitioners who want to determine whether offering college courses to high school students might positively affect their persistence in college or other postsecondary education. Current research suggests that participating in dual enrollment programs improves…
NASA Astrophysics Data System (ADS)
Pei, Jun; Liu, Xinbao; Pardalos, Panos M.; Fan, Wenjuan; Wang, Ling; Yang, Shanlin
2016-03-01
Motivated by applications in manufacturing industry, we consider a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times. The objective is to minimise the makespan by making batching and sequencing decisions. The problem is formalised as a mixed integer programming model and proved to be strongly NP-hard. Some structural properties are presented for both the general case and a special case. Based on these properties, a lower bound is derived, and a novel two-phase heuristic (TP-H) is developed to solve the problem, which guarantees to obtain a worst case performance ratio of ?. Computational experiments with a set of different sizes of random instances are conducted to evaluate the proposed approach TP-H, which is superior to another two heuristics proposed in the literature. Furthermore, the experimental results indicate that TP-H can effectively and efficiently solve large-size problems in a reasonable time.
Fear and Loving in Las Vegas: Evolution, Emotion, and Persuasion
Griskevicius, Vladas; Goldstein, Noah J.; Mortensen, Chad R.; Sundie, Jill M.; Cialdini, Robert B.; Kenrick, Douglas T.
2009-01-01
How do arousal-inducing contexts, such as frightening or romantic television programs, influence the effectiveness of basic persuasion heuristics? Different predictions are made by three theoretical models: A general arousal model predicts that arousal should increase effectiveness of heuristics; an affective valence model predicts that effectiveness should depend on whether the context elicits positive or negative affect; an evolutionary model predicts that persuasiveness should depend on both the specific emotion that is elicited and the content of the particular heuristic. Three experiments examined how fear-inducing versus romantic contexts influenced the effectiveness of two widely used heuristics—social proof (e.g., “most popular”) and scarcity (e.g., “limited edition”). Results supported predictions from an evolutionary model, showing that fear can lead scarcity appeals to be counter-persuasive, and that romantic desire can lead social proof appeals to be counter-persuasive. The findings highlight how an evolutionary theoretical approach can lead to novel theoretical and practical marketing insights. PMID:19727416
ERIC Educational Resources Information Center
Yoon, Hyung Joon; Cho, Yonjoo; Bong, Hyeon-Cheol
2012-01-01
The primary purpose of this article is to evaluate the impact of a dual-project action learning program (DPALP) conducted in South Korea. A dual-project program requires each participant to carry out both team and individual projects. Cho and Egan's [2009. Action learning research: A systematic review and conceptual framework. "Human Resource…
Abdolalizadeh, Parya; Pourhassan, Saeed; Gandomkar, Roghayeh; Heidari, Farrokh; Sohrabpour, Amir Ali
2017-01-01
Background: Despite the advantages of dual peer mentoring, there are a few reports of implementing and evaluating such programs for medical students. This study aimed at exploring the perceptions of mentors and mentees about the dual peer mentoring program for the first year undergraduate medical students of Tehran University of Medical Sciences. Methods: This qualitative study was conducted at the end of the first year of implementing the mentoring program. All mentees and mentors were invited to participate in focus group discussions. Data were analyzed using a qualitative content analysis. Results: All mentors (n= 12) and a group of mentees (n= 21) participated in focus group discussion sessions. We provided a variety of supports for the mentees including academic and psychosocial support and positive relationship; as a result, some developments occurred to the mentors We also explored participants’ views on some unique aspects of the program such as student-authorized, dual mentoring, and role model sessions. Conclusion: Our participants found the mentoring program beneficial in various academic achievements and psychosocial supports for both the mentors and the mentees. Dual peer mentoring program can be an alternative to school administered programs. PMID:28638809
Abdolalizadeh, Parya; Pourhassan, Saeed; Gandomkar, Roghayeh; Heidari, Farrokh; Sohrabpour, Amir Ali
2017-01-01
Background: Despite the advantages of dual peer mentoring, there are a few reports of implementing and evaluating such programs for medical students. This study aimed at exploring the perceptions of mentors and mentees about the dual peer mentoring program for the first year undergraduate medical students of Tehran University of Medical Sciences. Methods: This qualitative study was conducted at the end of the first year of implementing the mentoring program. All mentees and mentors were invited to participate in focus group discussions. Data were analyzed using a qualitative content analysis. Results: All mentors ( n= 12 ) and a group of mentees ( n= 21 ) participated in focus group discussion sessions. We provided a variety of supports for the mentees including academic and psychosocial support and positive relationship; as a result, some developments occurred to the mentors We also explored participants' views on some unique aspects of the program such as student-authorized, dual mentoring, and role model sessions. Conclusion: Our participants found the mentoring program beneficial in various academic achievements and psychosocial supports for both the mentors and the mentees. Dual peer mentoring program can be an alternative to school administered programs.
Konak, H E; Kibar, S; Ergin, E S
2016-11-01
Osteoporosis is a serious disease characterized by muscle weakness in the lower extremities, shortened length of trunk, and increased dorsal kyphosis leading to poor balance performance. Although balance impairment increases in adults with osteoporosis, falls and fall-related injuries have been shown to occur mainly during the dual-task performance. Several studies have shown that dual-task performance was improved with specific repetitive dual-task exercises. The aims of this study were to compare the effect of single- and dual-task balance exercise programs on static balance, dynamic balance, and activity-specific balance confidence in adults with osteoporosis and to assess the effectiveness of dual-task balance training on gait speed under dual-task conditions. Older adults (N = 42) (age range, 45-88 years) with osteoporosis were randomly assigned into two groups. Single-task balance training group was given single-task balance exercises for 4 weeks, whereas dual-task balance training group received dual-task balance exercises. Participants received 45-min individualized training session, three times a week. Static balance was evaluated by one-leg stance (OLS) and a kinesthetic ability trainer (KAT) device. Dynamic balance was measured by the Berg Balance Scale (BBS), Time Up and Go (TUG) test, and gait speed. Self-confidence was assessed with the Activities-specific Balance Confidence (ABC-6) scale. Assessments were performed at baseline and after the 4-week program. At the end of the treatment periods, KAT score, BBS score, time in OLS and TUG, gait speeds under single- and dual-task conditions, and ABC-6 scale scores improved significantly in all patients (p < 0.05). However, BBS and gait speeds under single- and dual-task conditions showed significantly greater improvement in the dual-task balance training group than in the single-task balance training group (p < 0.05). ABC-6 scale scores improved more in the single-task balance training group than in the dual-task balance training group (p < 0.05). A 4-week single- and dual-task balance exercise programs are effective in improving static balance, dynamic balance, and balance confidence during daily activities in older adults with osteoporosis. However, single- and dual-task gait speeds showed greater improvement following the application of a specific type of dual-task exercise programs. 24102014-2.
McGovern, Mark P.; Lambert-Harris, Chantal; Gotham, Heather J.; Claus, Ronald E.; Xie, Haiyi
2012-01-01
Despite increased awareness of the benefits of integrated services for persons with co-occurring substance use and psychiatric disorders, estimates of the availability of integrated services vary widely. The present study utilized standardized measures of program capacity to address co-occurring disorders, the Dual Diagnosis Capability in Addiction Treatment (DDCAT) and Dual Diagnosis Capability in Mental Health Treatment (DDCMHT) indexes, and sampled 256 programs across the United States. Approximately 18% of addiction treatment and 9% of mental health programs met criteria for dual diagnosis capable services. This is the first report on public access to integrated services using objective measures. PMID:23183873
Dual Nozzle Aerodynamic and Cooling Analysis Study.
1981-02-27
program and to the aerodynamic model computer program. This pro - cedure was used to define two secondary nozzle contours for the baseline con - figuration...both the dual-throat and dual-expander con - cepts. Advanced analytical techniques were utilized to provide quantitative estimates of the bleed flow...preliminary heat transfer analysis of both con - cepts, and (5) engineering analysis of data from the NASA/MSFC hot-fire testing of a dual-throat
ERIC Educational Resources Information Center
Sayre, Scott Alan
The ultimate goal of the science of artificial intelligence (AI) is to establish programs that will use algorithmic computer techniques to imitate the heuristic thought processes of humans. Most AI programs, especially expert systems, organize their knowledge into three specific areas: data storage, a rule set, and a control structure. Limitations…
NASA Astrophysics Data System (ADS)
Klages, Merle; Tjønnås, Johannes; Zenith, Federico; Halvorsen, Ivar J.; Scholta, Joachim
2016-12-01
Fuel impurities, fed to a polymer electrolyte membrane fuel cell, can affect stack performance by poisoning of catalyst layers. This paper describes the dynamic behaviour of a stack, including state-of-the-art membrane electrode assemblies (MEA) of three different manufacturers, at different operating conditions. The voltage transients of the step responses to CO poisoning as well as air bleed recovery are compared, revealing differences in performance loss: slow poisoning versus fast recovery, incomplete recovery and voltage oscillation. The recorded behaviour is used to develop a model, based on Tafel equation and first order dynamic response, which can be calibrated to each MEA type. Using this model to predict voltage response, a controller is built with the aim of reducing the total amount of air bleed and monitoring upstream stack processes without the need of sensors measuring the poisoning level. Two controllers are implemented in order to show the concept from a heuristic, easy to implement, and a more technical side allowing more detailed analysis of the synthesis. The heuristic algorithm, based on periodic perturbations of the manipulated variable (air-bleed), is validated on a real stack, revealing a stabilized performance without the need of detailed stack properties knowledge.
Cognitive Reflection, Decision Biases, and Response Times
Alós-Ferrer, Carlos; Garagnani, Michele; Hügelschäfer, Sabine
2016-01-01
We present novel evidence on response times and personality traits in standard questions from the decision-making literature where responses are relatively slow (medians around half a minute or above). To this end, we measured response times in a number of incentivized, framed items (decisions from description) including the Cognitive Reflection Test, two additional questions following the same logic, and a number of classic questions used to study decision biases in probability judgments (base-rate neglect, the conjunction fallacy, and the ratio bias). All questions create a conflict between an intuitive process and more deliberative thinking. For each item, we then created a non-conflict version by either making the intuitive impulse correct (resulting in an alignment question), shutting it down (creating a neutral question), or making it dominant (creating a heuristic question). For CRT questions, the differences in response times are as predicted by dual-process theories, with alignment and heuristic variants leading to faster responses and neutral questions to slower responses than the original, conflict questions. For decision biases (where responses are slower), evidence is mixed. To explore the possible influence of personality factors on both choices and response times, we used standard personality scales including the Rational-Experiential Inventory and the Big Five, and used them as controls in regression analysis. PMID:27713710
Cognitive Reflection, Decision Biases, and Response Times.
Alós-Ferrer, Carlos; Garagnani, Michele; Hügelschäfer, Sabine
2016-01-01
We present novel evidence on response times and personality traits in standard questions from the decision-making literature where responses are relatively slow (medians around half a minute or above). To this end, we measured response times in a number of incentivized, framed items (decisions from description) including the Cognitive Reflection Test, two additional questions following the same logic, and a number of classic questions used to study decision biases in probability judgments (base-rate neglect, the conjunction fallacy, and the ratio bias). All questions create a conflict between an intuitive process and more deliberative thinking. For each item, we then created a non-conflict version by either making the intuitive impulse correct (resulting in an alignment question), shutting it down (creating a neutral question), or making it dominant (creating a heuristic question). For CRT questions, the differences in response times are as predicted by dual-process theories, with alignment and heuristic variants leading to faster responses and neutral questions to slower responses than the original, conflict questions. For decision biases (where responses are slower), evidence is mixed. To explore the possible influence of personality factors on both choices and response times, we used standard personality scales including the Rational-Experiential Inventory and the Big Five, and used them as controls in regression analysis.
Leadership Practice in Elementary School Dual Language Programs: A Collective Case Study
ERIC Educational Resources Information Center
Monroy, Joanie K.
2012-01-01
Research in effective programming for English language learners has demonstrated the efficacy of dual language education as a model for closing persistent achievement gaps for this growing population of students. With goals of high academic achievement, linguistic proficiency in two languages, and cross-cultural proficiency, dual language…
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.
Centralized Planning for Multiple Exploratory Robots
NASA Technical Reports Server (NTRS)
Estlin, Tara; Rabideau, Gregg; Chien, Steve; Barrett, Anthony
2005-01-01
A computer program automatically generates plans for a group of robotic vehicles (rovers) engaged in geological exploration of terrain. The program rapidly generates multiple command sequences that can be executed simultaneously by the rovers. Starting from a set of high-level goals, the program creates a sequence of commands for each rover while respecting hardware constraints and limitations on resources of each rover and of hardware (e.g., a radio communication terminal) shared by all the rovers. First, a separate model of each rover is loaded into a centralized planning subprogram. The centralized planning software uses the models of the rovers plus an iterative repair algorithm to resolve conflicts posed by demands for resources and by constraints associated with the all the rovers and the shared hardware. During repair, heuristics are used to make planning decisions that will result in solutions that will be better and will be found faster than would otherwise be possible. In particular, techniques from prior solutions of the multiple-traveling- salesmen problem are used as heuristics to generate plans in which the paths taken by the rovers to assigned scientific targets are shorter than they would otherwise be.
Multitasking as a choice: a perspective.
Broeker, Laura; Liepelt, Roman; Poljac, Edita; Künzell, Stefan; Ewolds, Harald; de Oliveira, Rita F; Raab, Markus
2018-01-01
Performance decrements in multitasking have been explained by limitations in cognitive capacity, either modelled as static structural bottlenecks or as the scarcity of overall cognitive resources that prevent humans, or at least restrict them, from processing two tasks at the same time. However, recent research has shown that individual differences, flexible resource allocation, and prioritization of tasks cannot be fully explained by these accounts. We argue that understanding human multitasking as a choice and examining multitasking performance from the perspective of judgment and decision-making (JDM), may complement current dual-task theories. We outline two prominent theories from the area of JDM, namely Simple Heuristics and the Decision Field Theory, and adapt these theories to multitasking research. Here, we explain how computational modelling techniques and decision-making parameters used in JDM may provide a benefit to understanding multitasking costs and argue that these techniques and parameters have the potential to predict multitasking behavior in general, and also individual differences in behavior. Finally, we present the one-reason choice metaphor to explain a flexible use of limited capacity as well as changes in serial and parallel task processing. Based on this newly combined approach, we outline a concrete interdisciplinary future research program that we think will help to further develop multitasking research.
Exact and Heuristic Minimization of the Average Path Length in Decision Diagrams
2005-01-01
34$&%’ (*) &+#-,./&%1023 ’+/4%! 5637& 158+#&9 1 SHINOBU NAGAYAMA∗ , ALAN ...reviewers for constructive comments. REFERENCES [1] Ashar , P. and Malik, S. (1995). Fast functional simulation using branching programs, ICCAD’95, 408–412. [2
Heuristics to Evaluate Interactive Systems for Children with Autism Spectrum Disorder (ASD).
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.
C-Language Integrated Production System, Version 5.1
NASA Technical Reports Server (NTRS)
Riley, Gary; Donnell, Brian; Ly, Huyen-Anh VU; Culbert, Chris; Savely, Robert T.; Mccoy, Daniel J.; Giarratano, Joseph
1992-01-01
CLIPS 5.1 provides cohesive software tool for handling wide variety of knowledge with support for three different programming paradigms: rule-based, object-oriented, and procedural. Rule-based programming provides representation of knowledge by use of heuristics. Object-oriented programming enables modeling of complex systems as modular components. Procedural programming enables CLIPS to represent knowledge in ways similar to those allowed in such languages as C, Pascal, Ada, and LISP. Working with CLIPS 5.1, one can develop expert-system software by use of rule-based programming only, object-oriented programming only, procedural programming only, or combinations of the three.
Update on Research and Leadership, Fall 2001-Spring 2002.
ERIC Educational Resources Information Center
Barnett, Elisabeth, Ed.
2001-01-01
This issue of On Research and Leadership Update (v13 n1) focuses on the concerns surrounding dual enrollment and dual credit. "Dual Enrollment Programs: Assessing the American Dream," by Katherine Boswell, addresses the problems inherent in development of these programs when institutions fail to collaborate with one another in an effective way.…
Energy-aware virtual network embedding in flexi-grid optical networks
NASA Astrophysics Data System (ADS)
Lin, Rongping; Luo, Shan; Wang, Haoran; Wang, Sheng; Chen, Bin
2018-01-01
Virtual network embedding (VNE) problem is to map multiple heterogeneous virtual networks (VN) on a shared substrate network, which mitigate the ossification of the substrate network. Meanwhile, energy efficiency has been widely considered in the network design. In this paper, we aim to solve the energy-aware VNE problem in flexi-grid optical networks. We provide an integer linear programming (ILP) formulation to minimize the power increment of each arriving VN request. We also propose a polynomial-time heuristic algorithm where virtual links are embedded sequentially to keep a reasonable acceptance ratio and maintain a low energy consumption. Numerical results show the functionality of the heuristic algorithm in a 24-node network.
Coverage Metrics for Model Checking
NASA Technical Reports Server (NTRS)
Penix, John; Visser, Willem; Norvig, Peter (Technical Monitor)
2001-01-01
When using model checking to verify programs in practice, it is not usually possible to achieve complete coverage of the system. In this position paper we describe ongoing research within the Automated Software Engineering group at NASA Ames on the use of test coverage metrics to measure partial coverage and provide heuristic guidance for program model checking. We are specifically interested in applying and developing coverage metrics for concurrent programs that might be used to support certification of next generation avionics software.
A Model of Human Cognitive Behavior in Writing Code for Computer Programs. Volume 1
1975-05-01
nearly all programming languages, each line of code actually involves a great many decisions - basic statement types, variable and expression choices...labels, etc. - and any heuristic which evaluates code on the basis of a single decision is not likely to have sufficient power. Only the use of plans...recalculated in the following line because It was needed again. The second reason is that there are some decisions about the structure of a program
Heuristics to Evaluate Interactive Systems for Children with Autism Spectrum Disorder (ASD)
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
ERIC Educational Resources Information Center
Humphreys, Patrick; Wisudha, Ayleen
As a demonstration of the application of heuristic devices to decision-theoretical techniques, an interactive computer program known as MAUD (Multiattribute Utility Decomposition) has been designed to support decision or choice problems that can be decomposed into component factors, or to act as a tool for investigating the microstructure of a…
Computers Simulate Human Experts.
ERIC Educational Resources Information Center
Roberts, Steven K.
1983-01-01
Discusses recent progress in artificial intelligence in such narrowly defined areas as medical and electronic diagnosis. Also discusses use of expert systems, man-machine communication problems, novel programing environments (including comments on LISP and LISP machines), and types of knowledge used (factual, heuristic, and meta-knowledge). (JN)
Optimizing sensor cover energy for directional sensors
NASA Astrophysics Data System (ADS)
Astorino, Annabella; Gaudioso, Manlio; Miglionico, Giovanna
2016-10-01
The Directional Sensors Continuous Coverage Problem (DSCCP) aims at covering a given set of targets in a plane by means of a set of directional sensors. The location of these sensors is known in advance and they are characterized by a discrete set of possible radii and aperture angles. Decisions to be made are about orientation (which in our approach can vary continuously), radius and aperture angle of each sensor. The objective is to get a minimum cost coverage of all targets, if any. We introduce a MINLP formulation of the problem and define a Lagrangian heuristics based on a dual ascent procedure operating on one multiplier at a time. Finally we report the results of the implementation of the method on a set of test problems.
Designing a Successful Bidding Strategy Using Fuzzy Sets and Agent Attitudes
NASA Astrophysics Data System (ADS)
Ma, Jun; Goyal, Madhu Lata
To be successful in a multi-attribute auction, agents must be capable of adapting to continuously changing bidding price. This chapter presents a novel fuzzy attitude-based bidding strategy (FA-Bid), which employs dual assessment technique, i.e., assessment of multiple attributes of the goods as well as assessment of agents' attitude (eagerness) to procure an item in automated auction. The assessment of attributes adapts the fuzzy sets technique to handle uncertainty of the bidding process as well use heuristic rules to determine the attitude of bidding agents in simulated auctions to procure goods. The overall assessment is used to determine a price range based on current bid, which finally selects the best one as the new bid.
Familiarity and Recollection in Heuristic Decision Making
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
Familiarity and recollection in heuristic decision making.
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. PsycINFO Database Record (c) 2014 APA, all rights reserved.
School Leadership for Dual Language Education: A Social Justice Approach
ERIC Educational Resources Information Center
DeMatthews, David; Izquierdo, Elena
2016-01-01
This article examines how a dual language program can be developed within the framework of social justice leadership. The authors analyzed principal, teacher, and parent interview transcripts as well as field notes and key documents to understand the role of school leadership in creating inclusive dual language programs to close the Latina/o-White…
How Much of a "Running Start" Do Dual Enrollment Programs Provide Students? Working Paper 92
ERIC Educational Resources Information Center
Cowan, James; Goldhaber, Dan
2013-01-01
We study a popular dual enrollment program in Washington State using a new administrative database linking high school and postsecondary enrollments. Conditional on prior high school performance and basic demographic and economic covariates, dual enrollment students are more likely to attend any college, but they are no more likely to attend…
A set-covering based heuristic algorithm for the periodic vehicle routing problem.
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.
A set-covering based heuristic algorithm for the periodic vehicle routing problem
Cacchiani, V.; Hemmelmayr, V.C.; Tricoire, F.
2014-01-01
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. PMID:24748696
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. Copyright © 2016 Elsevier Ltd. All rights reserved.
A Program Evaluation Tool for Dual Enrollment Transition Programs
ERIC Educational Resources Information Center
Grigal, Meg; Dwyre, Amy; Emmett, Joyce; Emmett, Richard
2012-01-01
This article describes the development and use of a program evaluation tool designed to support self-assessment of college-based dual enrollment transition programs serving students with intellectual disabilities between the ages of 18-21 in college settings. The authors describe the need for such an evaluation tool, outline the areas addressed by…
ERIC Educational Resources Information Center
Davis, Elisabeth; Smither, Cameron; Zhu, Bo; Stephan, Jennifer
2017-01-01
Acceleration programs are academically challenging courses in which high school students can simultaneously earn credit toward a high school diploma and a postsecondary degree (dual credit). These programs include Advanced Placement courses, concurrent-enrollment courses, Postsecondary Enrollment Options courses (a dual-enrollment program in…
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…
Honda, Hidehito; Matsuka, Toshihiko; Ueda, Kazuhiro
2017-05-01
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. Copyright © 2016 Cognitive Science Society, Inc.
Cognitive distortions as a component and treatment focus of pathological gambling: a review.
Fortune, Erica E; Goodie, Adam S
2012-06-01
The literature on the role of cognitive distortions in the understanding and treatment of pathological gambling (PG) is reviewed, with sections focusing on (a) conceptual underpinnings of cognitive distortions, (b) cognitive distortions related to PG, (c) PG therapies that target cognitive distortions, (d) methodological factors and outcome variations, and (e) conclusions and prescriptive recommendations. The conceptual background for distortions related to PG lies in the program of heuristics and biases (Kahneman & Tversky, 1974) as well as other errors identified in basic psychology. The literature has focused on distortions arising from the representativeness heuristic (gambler's fallacy, overconfidence, and trends in number picking), the availability heuristic (illusory correlation, other individuals' wins, and inherent memory bias), and other sources (the illusion of control and double switching). Some therapies have incorporated cognitive restructuring within broader cognitive-behavioral therapies, with success. Other therapies have focused more narrowly on correcting distorted beliefs, more often with limited success. It is concluded that the literature establishes the role of cognitive distortions in PG and suggests therapies with particularly good promise, but is in need of further enrichment.
Derived heuristics-based consistent optimization of material flow in a gold processing plant
NASA Astrophysics Data System (ADS)
Myburgh, Christie; Deb, Kalyanmoy
2018-01-01
Material flow in a chemical processing plant often follows complicated control laws and involves plant capacity constraints. Importantly, the process involves discrete scenarios which when modelled in a programming format involves if-then-else statements. Therefore, a formulation of an optimization problem of such processes becomes complicated with nonlinear and non-differentiable objective and constraint functions. In handling such problems using classical point-based approaches, users often have to resort to modifications and indirect ways of representing the problem to suit the restrictions associated with classical methods. In a particular gold processing plant optimization problem, these facts are demonstrated by showing results from MATLAB®'s well-known fmincon routine. Thereafter, a customized evolutionary optimization procedure which is capable of handling all complexities offered by the problem is developed. Although the evolutionary approach produced results with comparatively less variance over multiple runs, the performance has been enhanced by introducing derived heuristics associated with the problem. In this article, the development and usage of derived heuristics in a practical problem are presented and their importance in a quick convergence of the overall algorithm is demonstrated.
An engineering approach to automatic programming
NASA Technical Reports Server (NTRS)
Rubin, Stuart H.
1990-01-01
An exploratory study of the automatic generation and optimization of symbolic programs using DECOM - a prototypical requirement specification model implemented in pure LISP was undertaken. It was concluded, on the basis of this study, that symbolic processing languages such as LISP can support a style of programming based upon formal transformation and dependent upon the expression of constraints in an object-oriented environment. Such languages can represent all aspects of the software generation process (including heuristic algorithms for effecting parallel search) as dynamic processes since data and program are represented in a uniform format.
Data analysis using scale-space filtering and Bayesian probabilistic reasoning
NASA Technical Reports Server (NTRS)
Kulkarni, Deepak; Kutulakos, Kiriakos; Robinson, Peter
1991-01-01
This paper describes a program for analysis of output curves from Differential Thermal Analyzer (DTA). The program first extracts probabilistic qualitative features from a DTA curve of a soil sample, and then uses Bayesian probabilistic reasoning to infer the mineral in the soil. The qualifier module employs a simple and efficient extension of scale-space filtering suitable for handling DTA data. We have observed that points can vanish from contours in the scale-space image when filtering operations are not highly accurate. To handle the problem of vanishing points, perceptual organizations heuristics are used to group the points into lines. Next, these lines are grouped into contours by using additional heuristics. Probabilities are associated with these contours using domain-specific correlations. A Bayes tree classifier processes probabilistic features to infer the presence of different minerals in the soil. Experiments show that the algorithm that uses domain-specific correlation to infer qualitative features outperforms a domain-independent algorithm that does not.
Experiences with serial and parallel algorithms for channel routing using simulated annealing
NASA Technical Reports Server (NTRS)
Brouwer, Randall Jay
1988-01-01
Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.
On orbital allotments for geostationary satellites
NASA Technical Reports Server (NTRS)
Gonsalvez, David J. A.; Reilly, Charles H.; Mount-Campbell, Clark A.
1986-01-01
The following satellite synthesis problem is addressed: communication satellites are to be allotted positions on the geostationary arc so that interference does not exceed a given acceptable level by enforcing conservative pairwise satellite separation. A desired location is specified for each satellite, and the objective is to minimize the sum of the deviations between the satellites' prescribed and desired locations. Two mixed integer programming models for the satellite synthesis problem are presented. Four solution strategies, branch-and-bound, Benders' decomposition, linear programming with restricted basis entry, and a switching heuristic, are used to find solutions to example synthesis problems. Computational results indicate the switching algorithm yields solutions of good quality in reasonable execution times when compared to the other solution methods. It is demonstrated that the switching algorithm can be applied to synthesis problems with the objective of minimizing the largest deviation between a prescribed location and the corresponding desired location. Furthermore, it is shown that the switching heuristic can use no conservative, location-dependent satellite separations in order to satisfy interference criteria.
A single cognitive heuristic process meets the complexity of domain-specific moral heuristics.
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).
ERIC Educational Resources Information Center
Forman, Stephanie
2016-01-01
Dual language immersion program models represent a potentially effective way to serve growing numbers of English language learners (ELLs) in schools and districts. However, local challenges, such as interpersonal conflict, can impact the process of implementing dual language policies and programs, limiting the extent to which they are able to meet…
ERIC Educational Resources Information Center
An, Brian P.
2013-01-01
I examine the influence of dual enrollment, a program that allows students to take college courses and earn college credits while in high school, on academic performance and college readiness. Advocates consider dual enrollment as a way to transition high school students into college, and they further claim that these programs benefit students…
Heuristic Programming Project: October 1979-September 1982
1985-03-27
the research on ROGET focused on acquiring the initial conceptual structure needed to design the knowedge base in the first place. ROGET’s special...the user in constructing and specifying the details of the components. A component is a collection of functions and variables that support conceptual ...other framwork , called the Backchain framework, is for building programs that use backward-chaind production rules as the primary mechanism of generating
ERIC Educational Resources Information Center
Powietrzynska, Malgorzata; Gangji, Al-Karim H.
2016-01-01
In this manuscript we bring to focus student perceptions of salience (or lack of thereof) of emotions in the undergraduate conceptual physics course (in the teacher education program) and their relevance to teaching and learning. Our analysis of student responses to the Mindfulness in Education Heuristic constitutes a feedback loop affording the…
An experimental evaluation of theory-based mother and mother-child programs for children of divorce.
Wolchik, S A; West, S G; Sandler, I N; Tein, J Y; Coatsworth, D; Lengua, L; Weiss, L; Anderson, E R; Greene, S M; Griffin, W A
2000-10-01
This study evaluated the efficacy of 2 theory-based preventive interventions for divorced families: a program for mothers and a dual component mother-child program. The mother program targeted mother-child relationship quality, discipline, interparental conflict, and the father-child relationship. The child program targeted active coping, avoidant coping, appraisals of divorce stressors, and mother-child relationship quality. Families with a 9- to 12-year-old child (N = 240) were randomly assigned to the mother, dual-component, or self-study program. Postintervention comparisons showed significant positive program effects of the mother program versus self-study condition on relationship quality, discipline, attitude toward father-child contact, and adjustment problems. For several outcomes, more positive effects occurred in families with poorer initial functioning. Program effects on externalizing problems were maintained at 6-month follow-up. A few additive effects of the dual-component program occurred for the putative mediators; none occurred for adjustment problems.
Dual-process models of health-related behaviour and cognition: a review of theory.
Houlihan, S
2018-03-01
The aim of this review was to synthesise a spectrum of theories incorporating dual-process models of health-related behaviour. Review of theory, adapted loosely from Cochrane-style systematic review methodology. Inclusion criteria were specified to identify all relevant dual-process models that explain decision-making in the context of decisions made about human health. Data analysis took the form of iterative template analysis (adapted from the conceptual synthesis framework used in other reviews of theory), and in this way theories were synthesised on the basis of shared theoretical constructs and causal pathways. Analysis and synthesis proceeded in turn, instead of moving uni-directionally from analysis of individual theories to synthesis of multiple theories. Namely, the reviewer considered and reconsidered individual theories and theoretical components in generating the narrative synthesis' main findings. Drawing on systematic review methodology, 11 electronic databases were searched for relevant dual-process theories. After de-duplication, 12,198 records remained. Screening of title and abstract led to the exclusion of 12,036 records, after which 162 full-text records were assessed. Of those, 21 records were included in the review. Moving back and forth between analysis of individual theories and the synthesis of theories grouped on the basis of theme or focus yielded additional insights into the orientation of a theory to an individual. Theories could be grouped in part on their treatment of an individual as an irrational actor, as social actor, as actor in a physical environment or as a self-regulated actor. Synthesising identified theories into a general dual-process model of health-related behaviour indicated that such behaviour is the result of both propositional and unconscious reasoning driven by an individual's response to internal cues (such as heuristics, attitude and affect), physical cues (social and physical environmental stimuli) as well as regulating factors (such as habit) that mediate between them. Copyright © 2017. Published by Elsevier Ltd.
NASA Astrophysics Data System (ADS)
Erkol, Şirag; Yücel, Gönenç
In this study, the problem of seed selection is investigated. This problem is mainly treated as an optimization problem, which is proved to be NP-hard. There are several heuristic approaches in the literature which mostly use algorithmic heuristics. These approaches mainly focus on the trade-off between computational complexity and accuracy. Although the accuracy of algorithmic heuristics are high, they also have high computational complexity. Furthermore, in the literature, it is generally assumed that complete information on the structure and features of a network is available, which is not the case in most of the times. For the study, a simulation model is constructed, which is capable of creating networks, performing seed selection heuristics, and simulating diffusion models. Novel metric-based seed selection heuristics that rely only on partial information are proposed and tested using the simulation model. These heuristics use local information available from nodes in the synthetically created networks. The performances of heuristics are comparatively analyzed on three different network types. The results clearly show that the performance of a heuristic depends on the structure of a network. A heuristic to be used should be selected after investigating the properties of the network at hand. More importantly, the approach of partial information provided promising results. In certain cases, selection heuristics that rely only on partial network information perform very close to similar heuristics that require complete network data.
Decentralized Bayesian search using approximate dynamic programming methods.
Zhao, Yijia; Patek, Stephen D; Beling, Peter A
2008-08-01
We consider decentralized Bayesian search problems that involve a team of multiple autonomous agents searching for targets on a network of search points operating under the following constraints: 1) interagent communication is limited; 2) the agents do not have the opportunity to agree in advance on how to resolve equivalent but incompatible strategies; and 3) each agent lacks the ability to control or predict with certainty the actions of the other agents. We formulate the multiagent search-path-planning problem as a decentralized optimal control problem and introduce approximate dynamic heuristics that can be implemented in a decentralized fashion. After establishing some analytical properties of the heuristics, we present computational results for a search problem involving two agents on a 5 x 5 grid.
Educator Language Ideologies and a Top-Down Dual Language Program
ERIC Educational Resources Information Center
Fitzsimmons-Doolan, Shannon; Palmer, Deborah; Henderson, Kathryn
2017-01-01
Dual language bilingual education (DLBE) programs are framed to reflect pluralist discourses (de Jong, E. [2013]. "Policy Discourses and U.S. Language in Education Policies." "Peabody Journal of Education" 88 (1): 98-111) and affiliated language ideologies. The continued expansion of DLBE programs not surprisingly brings to…
ERIC Educational Resources Information Center
Li, Jennifer; Steele, Jennifer; Slater, Robert; Bacon, Michael; Miller, Trey
2016-01-01
Many educators and policy makers look to two-way dual language immersion as one of the most promising options to close achievement gaps for English learners. However, the programs' effectiveness depends on the quality of their implementation. This article reports on a large-scale study of the implementation of dual language immersion across a…
ERIC Educational Resources Information Center
Wright, Adrienne C.
2017-01-01
Spanish-speaking parents choose to enroll their children in either an English only or English-Spanish dual immersion program when presented with both choices. This ethnographic study explored parent's perceptions of the purpose, advantages, and disadvantages of learning in school in English only or in a dual English-Spanish. Through focus group…
ERIC Educational Resources Information Center
Estacion, Angela; Cotner, Bridget A.; D'Souza, Stephanie; Smith, Chrystal A. S.; Borman, Kathryn M.
2011-01-01
This study of advanced-level high school courses that offer credit toward both a high school diploma and a college degree in Florida compares one such program (dual enrollment) with others, describing the number and characteristics of grade 11 and 12 students enrolled overall and by district. It also examines dual enrollment partnerships between…
ERIC Educational Resources Information Center
Estacion, Angela; Cotner, Bridget A.; D'Souza, Stephanie; Smith, Chrystal A. S.; Borman, Kathryn M.
2011-01-01
This study of advanced-level high school courses that offer credit toward both a high school diploma and a college degree in Florida compares one such program (dual enrollment) with others, describing the number and characteristics of grade 11 and 12 students enrolled overall and by district. It also examines dual enrollment partnerships between…
ERIC Educational Resources Information Center
Sunderman, Gail L.
2017-01-01
Dual enrollment programs offer high school students the chance to enroll in college courses and earn transferable college credit while they are still pursuing a high school diploma. Research shows that dual enrollment participants are more likely to enroll and persist in college, earn higher GPAs during college, and accumulate more college credit.…
Dual Enrollment at the Community College and High School: Where Do Students Hear about It?
ERIC Educational Resources Information Center
Brophy, Michael; Johnson, Todd
2007-01-01
Dual enrollment programs allow high school students to enroll in community college courses for credit while they are still enrolled in high school. The present study explored how 350 11th and 12th grade high school students learned about the dual enrollment program. The study also explored which of these sources of information were most predictive…
Kail, Robert V.
2013-01-01
According to dual-process models that include analytic and heuristic modes of processing, analytic processing is often expected to become more common with development. Consistent with this view, on reasoning problems, adolescents are more likely than children to select alternatives that are backed by statistical evidence. It is shown here that this pattern depends on the quality of the statistical evidence and the quality of the testimonial that is the typical alternative to statistical evidence. In Experiment 1, 9- and 13-year-olds (N = 64) were presented with scenarios in which solid statistical evidence was contrasted with casual or expert testimonial evidence. When testimony was casual, children relied on it but adolescents did not; when testimony was expert, both children and adolescents relied on it. In Experiment 2, 9- and 13-year-olds (N = 83) were presented with scenarios in which casual testimonial evidence was contrasted with weak or strong statistical evidence. When statistical evidence was weak, children and adolescents relied on both testimonial and statistical evidence; when statistical evidence was strong, most children and adolescents relied on it. Results are discussed in terms of their implications for dual-process accounts of cognitive development. PMID:23735681
Reasoning, biases and dual processes: The lasting impact of Wason (1960).
Evans, Jonathan St B T
2016-10-01
Wason (1960) published a relatively short experimental paper, in which he introduced the 2-4-6 problem as a test of inductive reasoning. This paper became one of the most highly cited to be published in the Quarterly Journal of Experimental Psychology and is significant for a number of reasons. First, the 2-4-6 task itself was ingenious and yielded evidence of error and bias in the intelligent participants who attempted it. Research on the 2-4-6 problem continues to the present day. More importantly, it was Wason's first paper on reasoning and one which made strong claims for bias and irrationality in a period dominated by rationalist writers like Piaget. It set in motion the study of cognitive biases in thinking and reasoning, well before the start of Tversky and Kahneman's famous heuristics and biases research programme. I also show here something for which Wason has received insufficient credit. It was Wason's work on this task and his later studies of his four card selection task that led to the first development of the dual process theory of reasoning which is so dominant in the current literature on the topic more than half a century later.
NASA Astrophysics Data System (ADS)
Paksi, A. B. N.; Ma'ruf, A.
2016-02-01
In general, both machines and human resources are needed for processing a job on production floor. However, most classical scheduling problems have ignored the possible constraint caused by availability of workers and have considered only machines as a limited resource. In addition, along with production technology development, routing flexibility appears as a consequence of high product variety and medium demand for each product. Routing flexibility is caused by capability of machines that offers more than one machining process. This paper presents a method to address scheduling problem constrained by both machines and workers, considering routing flexibility. Scheduling in a Dual-Resource Constrained shop is categorized as NP-hard problem that needs long computational time. Meta-heuristic approach, based on Genetic Algorithm, is used due to its practical implementation in industry. Developed Genetic Algorithm uses indirect chromosome representative and procedure to transform chromosome into Gantt chart. Genetic operators, namely selection, elitism, crossover, and mutation are developed to search the best fitness value until steady state condition is achieved. A case study in a manufacturing SME is used to minimize tardiness as objective function. The algorithm has shown 25.6% reduction of tardiness, equal to 43.5 hours.
Intuitive and deliberate judgments are based on common principles.
Kruglanski, Arie W; Gigerenzer, Gerd
2011-01-01
A popular distinction in cognitive and social psychology has been between intuitive and deliberate judgments. This juxtaposition has aligned in dual-process theories of reasoning associative, unconscious, effortless, heuristic, and suboptimal processes (assumed to foster intuitive judgments) versus rule-based, conscious, effortful, analytic, and rational processes (assumed to characterize deliberate judgments). In contrast, we provide convergent arguments and evidence for a unified theoretical approach to both intuitive and deliberative judgments. Both are rule-based, and in fact, the very same rules can underlie both intuitive and deliberate judgments. The important open question is that of rule selection, and we propose a 2-step process in which the task itself and the individual's memory constrain the set of applicable rules, whereas the individual's processing potential and the (perceived) ecological rationality of the rule for the task guide the final selection from that set. Deliberate judgments are not generally more accurate than intuitive judgments; in both cases, accuracy depends on the match between rule and environment: the rules' ecological rationality. Heuristics that are less effortful and in which parts of the information are ignored can be more accurate than cognitive strategies that have more information and computation. The proposed framework adumbrates a unified approach that specifies the critical dimensions on which judgmental situations may vary and the environmental conditions under which rules can be expected to be successful.
Gu, Qian; Koenig, Lane; Faerberg, Jennifer; Steinberg, Caroline Rossi; Vaz, Christopher; Wheatley, Mary P
2014-06-01
To explore the impact of the Hospital Readmissions Reduction Program (HRRP) on hospitals serving vulnerable populations. Medicare inpatient claims to calculate condition-specific readmission rates. Medicare cost reports and other sources to determine a hospital's share of duals, profit margin, and characteristics. Regression analyses and projections were used to estimate risk-adjusted readmission rates and financial penalties under the HRRP. Findings were compared across groups of hospitals, determined based on their share of duals, to assess differential impacts of the HRRP. Both patient dual-eligible status and a hospital's dual-eligible share of Medicare discharges have a positive impact on risk-adjusted hospital readmission rates. Under current Centers for Medicare and Medicaid Service methodology, which does not adjust for socioeconomic status, high-dual hospitals are more likely to have excess readmissions than low-dual hospitals. As a result, HRRP penalties will disproportionately fall on high-dual hospitals, which are more likely to have negative all-payer margins, raising concerns of unintended consequences of the program for vulnerable populations. Policies to reduce hospital readmissions must balance the need to ensure continued access to quality care for vulnerable populations. © Health Research and Educational Trust.
Gu, Qian; Koenig, Lane; Faerberg, Jennifer; Steinberg, Caroline Rossi; Vaz, Christopher; Wheatley, Mary P
2014-01-01
Objective To explore the impact of the Hospital Readmissions Reduction Program (HRRP) on hospitals serving vulnerable populations. Data Sources/Study Setting Medicare inpatient claims to calculate condition-specific readmission rates. Medicare cost reports and other sources to determine a hospital's share of duals, profit margin, and characteristics. Study Design Regression analyses and projections were used to estimate risk-adjusted readmission rates and financial penalties under the HRRP. Findings were compared across groups of hospitals, determined based on their share of duals, to assess differential impacts of the HRRP. Principal Findings Both patient dual-eligible status and a hospital's dual-eligible share of Medicare discharges have a positive impact on risk-adjusted hospital readmission rates. Under current Centers for Medicare and Medicaid Service methodology, which does not adjust for socioeconomic status, high-dual hospitals are more likely to have excess readmissions than low-dual hospitals. As a result, HRRP penalties will disproportionately fall on high-dual hospitals, which are more likely to have negative all-payer margins, raising concerns of unintended consequences of the program for vulnerable populations. Conclusions Policies to reduce hospital readmissions must balance the need to ensure continued access to quality care for vulnerable populations. PMID:24417309
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…
Conflict and bias in heuristic judgment.
Bhatia, Sudeep
2017-02-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. We tested this prediction in experiments involving judgments of argument strength and word frequency, and found that participants are more likely to avoid heuristic bias and respond correctly in settings with 2 incorrect heuristic response options compared with similar settings with only 1 heuristic response option. Our results provide strong evidence for conflict as a mechanism influencing the interaction between heuristic and deliberative thought, and illustrate how accuracy can be increased through simple changes to the response sets offered to participants. (PsycINFO Database Record (c) 2017 APA, all rights reserved).
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.
DOT National Transportation Integrated Search
2012-06-01
The mobility allowance shuttle transit (MAST) system is a hybrid transit system in which vehicles are : allowed to deviate from a fixed route to serve flexible demand. A mixed integer programming (MIP) : formulation for the static scheduling problem ...
Learning to Work with Immigrant Families: An Experiment in Experiential Learning
ERIC Educational Resources Information Center
Ali, Mehrunnisa A.; Bishop, Susan; Martin, Beth
2017-01-01
This study examined what students in three professional programs--Nursing, Social Work, and Early Childhood Studies--could learn about working with immigrant families using narrative inquiry as a heuristic device. Data collected from the students in focus groups demonstrated their capacity for ethical caring by recognizing individual…
Veterans as Adult Learners in Composition Courses
ERIC Educational Resources Information Center
Navarre Cleary, Michelle; Wozniak, Kathryn
2013-01-01
Considering veterans in the context of research on adult and nontraditional students in college writing classes, this article proposes Malcolm Knowles's six principles for adult learning as an asset-based heuristic for investigating how writing programs and writing teachers might build upon existing resources to support veteran students.
Monitoring California Hardwood Rangeland Resources: An Adaptive Approach
Raul Tuazon
1991-01-01
This paper describes monitoring hardwood rangelands in California within the context of an adaptive or anticipatory approach. A heuristic process of policy evolution under conditions of complexity and uncertainty is presented. Long-term, short-term and program effectiveness monitoring for hardwood rangelands are discussed relative to the process described. The...
Australian NAPLAN Testing: In What Ways Is This a "Wicked" Problem?
ERIC Educational Resources Information Center
Johnston, Jenny
2017-01-01
This article employs Rittel and Webber's "wicked" problem as a heuristic device for enhancing understanding about National Assessment Program--Literacy and Numeracy (NAPLAN) testing in the Australian education context. Using a research project with seven independent schools in New South Wales, Australia, which analysed NAPLAN data from…
An Evaluation of a Program to Help Dual-Earner Couples Share the Second Shift.
ERIC Educational Resources Information Center
Hawkins, Alan J.; And Others
1994-01-01
Used both traditional scientific and feminist methodologies to evaluate effectiveness of family life education program designed to help dual-earner couples (n=14 couples) share domestic labor. Both quantitative and qualitative data suggest that program produced small increases in husbands' involvement in both housework and child care and large…
Conducting a Statewide Dual-Purpose Program for Pesticide Applicators and County Extension Agents
ERIC Educational Resources Information Center
Fishel, Fred; Liu, Guodong David
2014-01-01
The University of Florida Cooperative Extension conducted a statewide program with a dual role during 2013 and 2014 to enhance efficiency. The program provided in-service training to county Extension agents and provided continuing education to meet requirements needed by licensed pesticide applicators. Using Polycom distance technology, the event…
Two Universities, Two Degrees: A Dual Degree Program for Pharmacists.
ERIC Educational Resources Information Center
Milio, Frank
2001-01-01
Describes a dual degree program between Towson University and the University of Maryland School of Pharmacy, which allows a student to receive both a B.S. degree in Medicinal Chemistry and a Doctor of Pharmacy degree in a combined 7-year program. It also allows flexibility in pursuing alternate career goals. (EV)
NASA Astrophysics Data System (ADS)
Negrello, Camille; Gosselet, Pierre; Rey, Christian
2018-05-01
An efficient method for solving large nonlinear problems combines Newton solvers and Domain Decomposition Methods (DDM). In the DDM framework, the boundary conditions can be chosen to be primal, dual or mixed. The mixed approach presents the advantage to be eligible for the research of an optimal interface parameter (often called impedance) which can increase the convergence rate. The optimal value for this parameter is often too expensive to be computed exactly in practice: an approximate version has to be sought for, along with a compromise between efficiency and computational cost. In the context of parallel algorithms for solving nonlinear structural mechanical problems, we propose a new heuristic for the impedance which combines short and long range effects at a low computational cost.
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.
Gigerenzer, Gerd; Gaissmaier, Wolfgang
2011-01-01
As reflected in the amount of controversy, few areas in psychology have undergone such dramatic conceptual changes in the past decade as the emerging science of heuristics. Heuristics are efficient cognitive processes, conscious or unconscious, that ignore part of the information. Because using heuristics saves effort, the classical view has been that heuristic decisions imply greater errors than do "rational" decisions as defined by logic or statistical models. However, for many decisions, the assumptions of rational models are not met, and it is an empirical rather than an a priori issue how well cognitive heuristics function in an uncertain world. To answer both the descriptive question ("Which heuristics do people use in which situations?") and the prescriptive question ("When should people rely on a given heuristic rather than a complex strategy to make better judgments?"), formal models are indispensable. We review research that tests formal models of heuristic inference, including in business organizations, health care, and legal institutions. This research indicates that (a) individuals and organizations often rely on simple heuristics in an adaptive way, and (b) ignoring part of the information can lead to more accurate judgments than weighting and adding all information, for instance for low predictability and small samples. The big future challenge is to develop a systematic theory of the building blocks of heuristics as well as the core capacities and environmental structures these exploit.
"The Gaze Heuristic:" Biography of an Adaptively Rational Decision Process.
Hamlin, Robert P
2017-04-01
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. Copyright © 2017 Cognitive Science Society, Inc.
Heuristic decision making in medicine
Marewski, Julian N.; Gigerenzer, Gerd
2012-01-01
Can less information be more helpful when it comes to making medical decisions? Contrary to the common intuition that more information is always better, the use of heuristics can help both physicians and patients to make sound decisions. Heuristics are simple decision strategies that ignore part of the available information, basing decisions on only a few relevant predictors. We discuss: (i) how doctors and patients use heuristics; and (ii) when heuristics outperform information-greedy methods, such as regressions in medical diagnosis. Furthermore, we outline those features of heuristics that make them useful in health care settings. These features include their surprising accuracy, transparency, and wide accessibility, as well as the low costs and little time required to employ them. We close by explaining one of the statistical reasons why heuristics are accurate, and by pointing to psychiatry as one area for future research on heuristics in health care. PMID:22577307
Reconsidering "evidence" for fast-and-frugal heuristics.
Hilbig, Benjamin E
2010-12-01
In several recent reviews, authors have argued for the pervasive use of fast-and-frugal heuristics in human judgment. They have provided an overview of heuristics and have reiterated findings corroborating that such heuristics can be very valid strategies leading to high accuracy. They also have reviewed previous work that implies that simple heuristics are actually used by decision makers. Unfortunately, concerning the latter point, these reviews appear to be somewhat incomplete. More important, previous conclusions have been derived from investigations that bear some noteworthy methodological limitations. I demonstrate these by proposing a new heuristic and provide some novel critical findings. Also, I review some of the relevant literature often not-or only partially-considered. Overall, although some fast-and-frugal heuristics indeed seem to predict behavior at times, there is little to no evidence for others. More generally, the empirical evidence available does not warrant the conclusion that heuristics are pervasively used.
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.
Assessing the use of cognitive heuristic representativeness in clinical reasoning.
Payne, Velma L; Crowley, Rebecca S; Crowley, Rebecca
2008-11-06
We performed a pilot study to investigate use of the cognitive heuristic Representativeness in clinical reasoning. We tested a set of tasks and assessments to determine whether subjects used the heuristics in reasoning, to obtain initial frequencies of heuristic use and related cognitive errors, and to collect cognitive process data using think-aloud techniques. The study investigates two aspects of the Representativeness heuristic - judging by perceived frequency and representativeness as causal beliefs. Results show that subjects apply both aspects of the heuristic during reasoning, and make errors related to misapplication of these heuristics. Subjects in this study rarely used base rates, showed significant variability in their recall of base rates, demonstrated limited ability to use provided base rates, and favored causal data in diagnosis. We conclude that the tasks and assessments we have developed provide a suitable test-bed to study the cognitive processes underlying heuristic errors.
Assessing Use of Cognitive Heuristic Representativeness in Clinical Reasoning
Payne, Velma L.; Crowley, Rebecca S.
2008-01-01
We performed a pilot study to investigate use of the cognitive heuristic Representativeness in clinical reasoning. We tested a set of tasks and assessments to determine whether subjects used the heuristics in reasoning, to obtain initial frequencies of heuristic use and related cognitive errors, and to collect cognitive process data using think-aloud techniques. The study investigates two aspects of the Representativeness heuristic - judging by perceived frequency and representativeness as causal beliefs. Results show that subjects apply both aspects of the heuristic during reasoning, and make errors related to misapplication of these heuristics. Subjects in this study rarely used base rates, showed significant variability in their recall of base rates, demonstrated limited ability to use provided base rates, and favored causal data in diagnosis. We conclude that the tasks and assessments we have developed provide a suitable test-bed to study the cognitive processes underlying heuristic errors. PMID:18999140
Heuristic decision making in medicine.
Marewski, Julian N; Gigerenzer, Gerd
2012-03-01
Can less information be more helpful when it comes to making medical decisions? Contrary to the common intuition that more information is always better, the use of heuristics can help both physicians and patients to make sound decisions. Heuristics are simple decision strategies that ignore part of the available information, basing decisions on only a few relevant predictors. We discuss: (i) how doctors and patients use heuristics; and (ii) when heuristics outperform information-greedy methods, such as regressions in medical diagnosis. Furthermore, we outline those features of heuristics that make them useful in health care settings. These features include their surprising accuracy, transparency, and wide accessibility, as well as the low costs and little time required to employ them. We close by explaining one of the statistical reasons why heuristics are accurate, and by pointing to psychiatry as one area for future research on heuristics in health care.
Cultural heuristics in risk assessment of HIV/AIDS.
Bailey, Ajay; Hutter, Inge
2006-01-01
Behaviour change models in HIV prevention tend to consider that risky sexual behaviours reflect risk assessments and that by changing risk assessments behaviour can be changed. Risk assessment is however culturally constructed. Individuals use heuristics or bounded cognitive devices derived from broader cultural meaning systems to rationalize uncertainty. In this study, we identify some of the cultural heuristics used by migrant men in Goa, India to assess their risk of HIV infection from different sexual partners. Data derives from a series of in-depth interviews and a locally informed survey. Cultural heuristics identified include visual heuristics, heuristics of gender roles, vigilance and trust. The paper argues that, for more culturally informed HIV/AIDS behaviour change interventions, knowledge of cultural heuristics is essential.
Fast or Frugal, but Not Both: Decision Heuristics Under Time Pressure
2017-01-01
Heuristics are simple, yet effective, strategies that people use to make decisions. Because heuristics do not require all available information, they are thought to be easy to implement and to not tax limited cognitive resources, which has led heuristics to be characterized as fast-and-frugal. We question this monolithic conception of heuristics by contrasting the cognitive demands of two popular heuristics, Tallying and Take-the-Best. We contend that heuristics that are frugal in terms of information usage may not always be fast because of the attentional control required to implement this focus in certain contexts. In support of this hypothesis, we find that Take-the-Best, while being more frugal in terms of information usage, is slower to implement and fares worse under time pressure manipulations than Tallying. This effect is then reversed when search costs for Take-the-Best are reduced by changing the format of the stimuli. These findings suggest that heuristics are heterogeneous and should be unpacked according to their cognitive demands to determine the circumstances a heuristic best applies. PMID:28557503
Fast or frugal, but not both: Decision heuristics under time pressure.
Bobadilla-Suarez, Sebastian; Love, Bradley C
2018-01-01
Heuristics are simple, yet effective, strategies that people use to make decisions. Because heuristics do not require all available information, they are thought to be easy to implement and to not tax limited cognitive resources, which has led heuristics to be characterized as fast-and-frugal. We question this monolithic conception of heuristics by contrasting the cognitive demands of two popular heuristics, Tallying and Take-the-Best. We contend that heuristics that are frugal in terms of information usage may not always be fast because of the attentional control required to implement this focus in certain contexts. In support of this hypothesis, we find that Take-the-Best, while being more frugal in terms of information usage, is slower to implement and fares worse under time pressure manipulations than Tallying. This effect is then reversed when search costs for Take-the-Best are reduced by changing the format of the stimuli. These findings suggest that heuristics are heterogeneous and should be unpacked according to their cognitive demands to determine the circumstances a heuristic best applies. (PsycINFO Database Record (c) 2018 APA, all rights reserved).
Empirical comparison of heuristic load distribution in point-to-point multicomputer networks
NASA Technical Reports Server (NTRS)
Grunwald, Dirk C.; Nazief, Bobby A. A.; Reed, Daniel A.
1990-01-01
The study compared several load placement algorithms using instrumented programs and synthetic program models. Salient characteristics of these program traces (total computation time, total number of messages sent, and average message time) span two orders of magnitude. Load distribution algorithms determine the initial placement for processes, a precursor to the more general problem of load redistribution. It is found that desirable workload distribution strategies will place new processes globally, rather than locally, to spread processes rapidly, but that local information should be used to refine global placement.
The TACT-Mentor Program: A Dual Introduction into College Teaching. Final Report.
ERIC Educational Resources Information Center
Murray, Robert C.
A two-part effort called "The TACT Mentor Program: A Dual Introduction into College Teaching," designed to assist new faculty in their first year of teaching at Heidelberg College, Ohio, is described and evaluated. The first part of the program, TACT (Teachers and College Teaching) consisted of weekly discussions based on the book…
ERIC Educational Resources Information Center
Kibler, Amanda; Salerno, April; Hardigree, Christine
2014-01-01
Much of the debate regarding outcomes of various types of dual-language programs has focused on linguistic and academic results, and with good reason: improving the educational outcomes of language minorities and supporting societal multilingualism are vital goals. More rarely explored, however, are these programs' ethnolinguistic outcomes: the…
ERIC Educational Resources Information Center
Ascenzi-Moreno, Laura
2016-01-01
This study examines how elementary teachers (grades three through five) in dual-language, bilingual programs (Spanish/English) view informal reading inventories (IRIs) to support their students' reading growth. The research, conducted in an urban district in the Northeastern United States, draws on interviews with 20 teachers in these programs.…
Traffic routing in a switched regenerative satellite. Volume 1, task 3: Traffic assignment
NASA Astrophysics Data System (ADS)
1982-12-01
Time plan assignment in a multibeam SS-TDMA is discussed. System features fixed by the designer, such as the number and the speed of ground terminals installed in each station, and the number and the speed of satellite transponders working in each spot are described. Linkage among terminals and transponders is also discussed, including having more than one transponder linked to one terminal. A procedure to achieve a switching plan with high efficiency, taking into account all system constraints such as no bursts breaking and two transmission rates harmonization is proposed. Algorithms to be implemented are: the Hungarian method; branch and bound; the INSERT heuristic; and the HOLE heuristic. Computer programs were developed, and a time plan for a European Satellite System is produced.
Ant Colony Optimization for Markowitz Mean-Variance Portfolio Model
NASA Astrophysics Data System (ADS)
Deng, Guang-Feng; Lin, Woo-Tsong
This work presents Ant Colony Optimization (ACO), which was initially developed to be a meta-heuristic for combinatorial optimization, for solving the cardinality constraints Markowitz mean-variance portfolio model (nonlinear mixed quadratic programming problem). To our knowledge, an efficient algorithmic solution for this problem has not been proposed until now. Using heuristic algorithms in this case is imperative. Numerical solutions are obtained for five analyses of weekly price data for the following indices for the period March, 1992 to September, 1997: Hang Seng 31 in Hong Kong, DAX 100 in Germany, FTSE 100 in UK, S&P 100 in USA and Nikkei 225 in Japan. The test results indicate that the ACO is much more robust and effective than Particle swarm optimization (PSO), especially for low-risk investment portfolios.
Luo, Zhihao; Liu, Zhong; Shi, Jianmai
2017-05-17
In this paper, a two-echelon cooperated routing problem for the ground vehicle (GV) and its carried unmanned aerial vehicle (UAV) is investigated, where the GV travels on the road network and its UAV travels in areas beyond the road to visit a number of targets unreached by the GV. In contrast to the classical two-echelon routing problem, the UAV has to launch and land on the GV frequently to change or charge its battery while the GV is moving on the road network. A new 0-1 integer programming model is developed to formulate the problem, where the constraints on the spatial and temporal cooperation of GV and UAV routes are included. Two heuristics are proposed to solve the model: the first heuristic (H1) constructs a complete tour for all targets and splits it by GV routes, while the second heuristic (H2) constructs the GV tour and assigns UAV flights to it. Random instances with six different sizes (25-200 targets, 12-80 rendezvous nodes) are used to test the algorithms. Computational results show that H1 performs slightly better than H2, while H2 uses less time and is more stable.
Reexamining our bias against heuristics.
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.
Not so fast! (and not so frugal!): rethinking the recognition heuristic.
Oppenheimer, Daniel M
2003-11-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 postulates that judgment sometimes relies solely on recognition. However, the studies that have investigated usage of the recognition heuristic have confounded recognition with other cues that could also lead to similar judgments. This paper tests whether mere recognition is actually driving the findings in support of the recognition heuristic. Two studies provide evidence that judgments do not conform to the recognition heuristic when these confounds are accounted for. Implications for the study of simple heuristics are discussed.
Focus of attention in an activity-based scheduler
NASA Technical Reports Server (NTRS)
Sadeh, Norman; Fox, Mark S.
1989-01-01
Earlier research in job shop scheduling has demonstrated the advantages of opportunistically combining order-based and resource-based scheduling techniques. An even more flexible approach is investigated where each activity is considered a decision point by itself. Heuristics to opportunistically select the next decision point on which to focus attention (i.e., variable ordering heuristics) and the next decision to be tried at this point (i.e., value ordering heuristics) are described that probabilistically account for both activity precedence and resource requirement interactions. Preliminary experimental results indicate that the variable ordering heuristic greatly increases search efficiency. While least constraining value ordering heuristics have been advocated in the literature, the experimental results suggest that other value ordering heuristics combined with our variable-ordering heuristic can produce much better schedules without significantly increasing search.
Performance of Optimization Heuristics for the Operational Planning of Multi-energy Storage Systems
NASA Astrophysics Data System (ADS)
Haas, J.; Schradi, J.; Nowak, W.
2016-12-01
In the transition to low-carbon energy sources, energy storage systems (ESS) will play an increasingly important role. Particularly in the context of solar power challenges (variability, uncertainty), ESS can provide valuable services: energy shifting, ramping, robustness against forecast errors, frequency support, etc. However, these qualities are rarely modelled in the operational planning of power systems because of the involved computational burden, especially when multiple ESS technologies are involved. This work assesses two optimization heuristics for speeding up the optimal operation problem. It compares their accuracy (in terms of costs) and speed against a reference solution. The first heuristic (H1) is based on a merit order. Here, the ESS are sorted from lower to higher operational costs (including cycling costs). For each time step, the cheapest available ESS is used first, followed by the second one and so on, until matching the net load (demand minus available renewable generation). The second heuristic (H2) uses the Fourier transform to detect the main frequencies that compose the net load. A specific ESS is assigned to each frequency range, aiming to smoothen the net load. Finally, the reference solution is obtained with a mixed integer linear program (MILP). H1, H2 and MILP are subject to technical constraints (energy/power balance, ramping rates, on/off states...). Costs due to operation, replacement (cycling) and unserved energy are considered. Four typical days of a system with a high share of solar energy were used in several test cases, varying the resolution from one second to fifteen minutes. H1 and H2 achieve accuracies of about 90% and 95% in average, and speed-up times of two to three and one to two orders of magnitude, respectively. The use of the heuristics looks promising in the context of planning the expansion of power systems, especially when their loss of accuracy is outweighed by solar or wind forecast errors.
Aiding USAF/UPT (Undergraduate Pilot Training) Aircrew Scheduling Using Network Flow Models.
1986-06-01
51 3.4 Heuristic Modifications ............ 55 CHAPTER 4 STUDENT SCHEDULING PROBLEM (LEVEL 2) 4.0 Introduction 4.01 Constraints ............. 60 4.02...Covering" Complete Enumeration . . .. . 71 4.14 Heuristics . ............. 72 4.2 Heuristic Method for the Level 2 Problem 4.21 Step I ............... 73...4.22 Step 2 ............... 74 4.23 Advantages to the Heuristic Method. .... .. 78 4.24 Problems with the Heuristic Method. . ... 79 :,., . * CHAPTER5
DOT National Transportation Integrated Search
1973-12-01
Various forms of Dual Mode Transportation were analyzed in order to assess the economic viability of the Dual Mode concept. A Dual Mode vehicle is one which operates under manual control on a streee network for some portionof its trip, and operates u...
Discrete-continuous variable structural synthesis using dual methods
NASA Technical Reports Server (NTRS)
Schmit, L. A.; Fleury, C.
1980-01-01
Approximation concepts and dual methods are extended to solve structural synthesis problems involving a mix of discrete and continuous sizing type of design variables. Pure discrete and pure continuous variable problems can be handled as special cases. The basic mathematical programming statement of the structural synthesis problem is converted into a sequence of explicit approximate primal problems of separable form. These problems are solved by constructing continuous explicit dual functions, which are maximized subject to simple nonnegativity constraints on the dual variables. A newly devised gradient projection type of algorithm called DUAL 1, which includes special features for handling dual function gradient discontinuities that arise from the discrete primal variables, is used to find the solution of each dual problem. Computational implementation is accomplished by incorporating the DUAL 1 algorithm into the ACCESS 3 program as a new optimizer option. The power of the method set forth is demonstrated by presenting numerical results for several example problems, including a pure discrete variable treatment of a metallic swept wing and a mixed discrete-continuous variable solution for a thin delta wing with fiber composite skins.
Optimization Techniques for Analysis of Biological and Social Networks
2012-03-28
analyzing a new metaheuristic technique, variable objective search. 3. Experimentation and application: Implement the proposed algorithms , test and fine...alternative mathematical programming formulations, their theoretical analysis, the development of exact algorithms , and heuristics. Originally, clusters...systematic fashion under a unifying theoretical and algorithmic framework. Optimization, Complex Networks, Social Network Analysis, Computational
Applying Rhetorical Genre Studies to a Stand-Alone Online Professional Writing Course
ERIC Educational Resources Information Center
Adams, Heather Brook; Jenkins, Patricia
2015-01-01
This program profile explains and illustrates a pedagogical application of Rhetorical Genre Studies (RGS) to a one-semester, upper-division online Professional Writing course. We explain our use of a heuristic, which we liken to "night-vision goggles," that enables students to systematically analyze field data that they gather from a…
Artificial Intelligence: Themes in the Second Decade. Memo Number 67.
ERIC Educational Resources Information Center
Feigenbaum, Edward A.
The text of an invited address on artificial intelligence (AI) research over the 1963-1968 period is presented. A survey of recent studies on the computer simulation of intellective processes emphasizes developments in heuristic programing, problem-solving and closely related learning models. Progress and problems in these areas are indicated by…
A chance constraint estimation approach to optimizing resource management under uncertainty
Michael Bevers
2007-01-01
Chance-constrained optimization is an important method for managing risk arising from random variations in natural resource systems, but the probabilistic formulations often pose mathematical programming problems that cannot be solved with exact methods. A heuristic estimation method for these problems is presented that combines a formulation for order statistic...
Empowering Catholic Communicators: A Trivium Heuristic for First-Year Writing Courses
ERIC Educational Resources Information Center
Hurley, Gavin F.
2017-01-01
First-year writing courses at Catholic colleges and universities can provide students the communicative tools to intellectually engage with Catholic doctrines and beliefs in the public sphere. However, writing programs can neglect to balance grammar, logic, and rhetoric. This article provides a practical Catholic first-year writing course design…
Backtrack Programming: A Computer-Based Approach to Group Problem Solving.
ERIC Educational Resources Information Center
Scott, Michael D.; Bodaken, Edward M.
Backtrack problem-solving appears to be a viable alternative to current problem-solving methodologies. It appears to have considerable heuristic potential as a conceptual and operational framework for small group communication research, as well as functional utility for the student group in the small group class or the management team in the…
A Computer Model of Simple Forms of Learning.
ERIC Educational Resources Information Center
Jones, Thomas L.
A basic unsolved problem in science is that of understanding learning, the process by which people and machines use their experience in a situation to guide future action in similar situations. The ideas of Piaget, Pavlov, Hull, and other learning theorists, as well as previous heuristic programing models of human intelligence, stimulated this…
Order-Constrained Solutions in K-Means Clustering: Even Better than Being Globally Optimal
ERIC Educational Resources Information Center
Steinley, Douglas; Hubert, Lawrence
2008-01-01
This paper proposes an order-constrained K-means cluster analysis strategy, and implements that strategy through an auxiliary quadratic assignment optimization heuristic that identifies an initial object order. A subsequent dynamic programming recursion is applied to optimally subdivide the object set subject to the order constraint. We show that…
Alarcon, Gene M; Gamble, Rose F; Ryan, Tyler J; Walter, Charles; Jessup, Sarah A; Wood, David W; Capiola, August
2018-07-01
Computer programs are a ubiquitous part of modern society, yet little is known about the psychological processes that underlie reviewing code. We applied the heuristic-systematic model (HSM) to investigate the influence of computer code comments on perceptions of code trustworthiness. The study explored the influence of validity, placement, and style of comments in code on trustworthiness perceptions and time spent on code. Results indicated valid comments led to higher trust assessments and more time spent on the code. Properly placed comments led to lower trust assessments and had a marginal effect on time spent on code; however, the effect was no longer significant after controlling for effects of the source code. Low style comments led to marginally higher trustworthiness assessments, but high style comments led to longer time spent on the code. Several interactions were also found. Our findings suggest the relationship between code comments and perceptions of code trustworthiness is not as straightforward as previously thought. Additionally, the current paper extends the HSM to the programming literature. Copyright © 2018 Elsevier Ltd. All rights reserved.
NASA Technical Reports Server (NTRS)
Sargent, Jeff Scott
1988-01-01
A new row-based parallel algorithm for standard-cell placement targeted for execution on a hypercube multiprocessor is presented. Key features of this implementation include a dynamic simulated-annealing schedule, row-partitioning of the VLSI chip image, and two novel new approaches to controlling error in parallel cell-placement algorithms; Heuristic Cell-Coloring and Adaptive (Parallel Move) Sequence Control. Heuristic Cell-Coloring identifies sets of noninteracting cells that can be moved repeatedly, and in parallel, with no buildup of error in the placement cost. Adaptive Sequence Control allows multiple parallel cell moves to take place between global cell-position updates. This feedback mechanism is based on an error bound derived analytically from the traditional annealing move-acceptance profile. Placement results are presented for real industry circuits and the performance is summarized of an implementation on the Intel iPSC/2 Hypercube. The runtime of this algorithm is 5 to 16 times faster than a previous program developed for the Hypercube, while producing equivalent quality placement. An integrated place and route program for the Intel iPSC/2 Hypercube is currently being developed.
New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
NASA Astrophysics Data System (ADS)
Kia, Hamidreza; Ghodsypour, Seyed Hassan; Davoudpour, Hamid
2017-09-01
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0-1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.
Should bilingual children learn reading in two languages at the same time or in sequence?
Berens, Melody S.; Kovelman, Ioulia; Petitto, Laura-Ann
2013-01-01
Is it best to learn reading in two languages simultaneously or sequentially? We observed 2nd and 3rd grade children in two-way dual-language learning contexts: (i) 50:50 or Simultaneous dual-language (two languages within same developmental period) and (ii) 90:10 or Sequential dual-language (one language, followed gradually by the other). They were compared to matched monolingual English-only children in single-language English schools. Bilinguals (home language was Spanish only, English-only, or Spanish and English in dual-language schools), were tested in both languages, and monolingual children were tested in English using standardized reading and language tasks. Bilinguals in 50:50 programs performed better than bilinguals in 90:10 programs on English Irregular Words and Passage Comprehension tasks, suggesting language and reading facilitation for underlying grammatical class and linguistic structure analyses. By contrast, bilinguals in 90:10 programs performed better than bilinguals in the 50:50 programs on English Phonological Awareness and Reading Decoding tasks, suggesting language and reading facilitation for surface phonological regularity analysis. Notably, children from English-only homes in dual-language learning contexts performed equally well, or better than, children from monolingual English-only homes in single-language learning contexts. Overall, the findings provide tantalizing evidence that dual-language learning during the same developmental period may provide bilingual reading advantages. PMID:23794952
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.
Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems.
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.
Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems
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
Hyper-heuristics with low level parameter adaptation.
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.
Deriving a Set of Privacy Specific Heuristics for the Assessment of PHRs (Personal Health Records).
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.
ERIC Educational Resources Information Center
Gerena, Linda
2011-01-01
In an attempt to operationalize an equitable educational program, a dual immersion program was established. After 2 years of field observations, a series of focus group interviews was conducted to examine the perceptions and viewpoints of parents whose children had participated in the program for 2 years. These interviews offered parents an…
Exploring the Educational and Career Plans of Urban Minority Students in a Dual Enrollment Program
ERIC Educational Resources Information Center
Medvide, Mary Beth; Blustein, David L.
2010-01-01
This qualitative study examined the educational and career plans of a sample of urban minority high school students who voluntarily participated in a dual enrollment program at a private, technology-based community college in a metropolitan center in the northeastern United States. This program allows students to take college courses in science,…
ERIC Educational Resources Information Center
Li, Jennifer J.; Steele, Jennifer L.; Slater, Robert; Bacon, Michael; Miller, Trey
2016-01-01
Dual-language immersion programs--in which students learn core subjects (language arts, math, science, and social studies) in both English and a "partner" language--have been gaining in popularity across the United States. Such programs may use a "two-way model," in which roughly half the students are native speakers of the…
A Variable-Selection Heuristic for K-Means Clustering.
ERIC Educational Resources Information Center
Brusco, Michael J.; Cradit, J. Dennis
2001-01-01
Presents a variable selection heuristic for nonhierarchical (K-means) cluster analysis based on the adjusted Rand index for measuring cluster recovery. Subjected the heuristic to Monte Carlo testing across more than 2,200 datasets. Results indicate that the heuristic is extremely effective at eliminating masking variables. (SLD)
A polynomial primal-dual Dikin-type algorithm for linear programming
DOE Office of Scientific and Technical Information (OSTI.GOV)
Jansen, B.; Roos, R.; Terlaky, T.
1994-12-31
We present a new primal-dual affine scaling method for linear programming. The search direction is obtained by using Dikin`s original idea: minimize the objective function (which is the duality gap in a primal-dual algorithm) over a suitable ellipsoid. The search direction has no obvious relationship with the directions proposed in the literature so far. It guarantees a significant decrease in the duality gap in each iteration, and at the same time drives the iterates to the central path. The method admits a polynomial complexity bound that is better than the one for Monteiro et al.`s original primal-dual affine scaling method.
7 CFR 247.19 - Dual participation.
Code of Federal Regulations, 2010 CFR
2010-01-01
... Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.19 Dual participation. (a) What must... determines that disqualification would result in a serious health risk. The local agency must also initiate a...
7 CFR 247.19 - Dual participation.
Code of Federal Regulations, 2012 CFR
2012-01-01
... Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.19 Dual participation. (a) What must... with § 247.30(c). (Approved by the Office of Management and Budget under control number 0584-0293) ...
7 CFR 247.19 - Dual participation.
Code of Federal Regulations, 2013 CFR
2013-01-01
... Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.19 Dual participation. (a) What must... with § 247.30(c). (Approved by the Office of Management and Budget under control number 0584-0293) ...
7 CFR 247.19 - Dual participation.
Code of Federal Regulations, 2011 CFR
2011-01-01
... Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.19 Dual participation. (a) What must... with § 247.30(c). (Approved by the Office of Management and Budget under control number 0584-0293) ...
7 CFR 247.19 - Dual participation.
Code of Federal Regulations, 2014 CFR
2014-01-01
... Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.19 Dual participation. (a) What must... with § 247.30(c). (Approved by the Office of Management and Budget under control number 0584-0293) ...
Gourley, Dick R.; Rowell, Crescent; Wingate, LaMarcus; Yates, Charles R.; Gourley, Greta K.; Miller, Duane D.; Vleet, Van
2006-01-01
Objectives To describe the University of Tennessee PharmD/PhD program and assess the prevalence and characteristics of PharmD/PhD programs in the United States. Methods Survey instruments were mailed in May 2004 to UT dual-degree program participants and deans of US colleges and schools of pharmacy. Results University of Tennessee PharmD/PhD students completed more than 30 hours of graduate credit before obtaining their PharmD and 72.2% agreed or strongly agreed that the program met their professional goals. More than 40% of US pharmacy colleges and schools have or plan to have PharmD/PhD programs. A wide variation exists in the level of integration, PhD concentrations offered, entrance requirements, and student benefits. Most schools with PharmD/PhD programs had few students enrolled in the program, but attrition rates were low (<20%) for 69% of the schools. Conclusions Dual-degree programs attract and retain pharmacy students in research programs and 47.6% of graduates entered academia and industry. PMID:17149422
The effect of dual accreditation on family medicine residency programs.
Mims, Lisa D; Bressler, Lindsey C; Wannamaker, Louise R; Carek, Peter J
2015-04-01
In 1985, the American Osteopathic Association (AOA) Board of Trustees agreed to allow residency programs to become dually accredited by the AOA and Accreditation Council for Graduate Medical Education (ACGME). Despite the increase in such programs, there has been minimal research comparing these programs to exclusively ACGME-accredited residencies. This study examines the association between dual accreditation and suggested markers of quality. Standard characteristics such as regional location, program structure (community or university based), postgraduate year one (PGY-1) positions offered, and salary (PGY-1) were obtained for each residency program. In addition, the faculty to resident ratio in the family medicine clinic and the number of half days residents spent in the clinic each week were recorded. Initial Match rates and pass rates of new graduates on the ABFM examination from 2009 to 2013 were also obtained. Variables were analyzed using chi-square and Student's t test. Logistic regression models were then created to predict a program's 5-year aggregate initial Match rate and Board pass rate in the top tertile as compared to the lowest tertile. Dual accreditation was obtained by 117 (27.0%) of programs. Initial analyses revealed associations between dually accredited programs and mean year of initial ACGME program accreditation, regional location, program structure, tracks, and alternative medicine curriculum. When evaluated in logistic regression, dual accreditation status was not associated with Match rates or ABFM pass rates. By examining suggested markers of program quality for dually accredited programs in comparison to ACGME-only accredited programs, this study successfully established both differences and similarities among the two types.
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.…
Ideology in Writing Instruction: Reconsidering Invention Heuristics.
ERIC Educational Resources Information Center
Byard, Vicki
Modern writing textbooks tend to offer no heuristics, treat heuristics as if they do not have different impacts on inquiry, or take the view that heuristics are ideologically neutral pedagogies. Yet theory about language demonstrates that ideological neutrality is impossible. Any use of language in attempting to represent reality will inevitably…
An Effective Exercise for Teaching Cognitive Heuristics
ERIC Educational Resources Information Center
Swinkels, Alan
2003-01-01
This article describes a brief heuristics demonstration and offers suggestions for personalizing examples of heuristics by making them relevant to students. Students complete a handout asking for 4 judgments illustrative of such heuristics. The decisions are cast in the context of students' daily lives at their particular university. After the…
Dual nozzle aerodynamic and cooling analysis study. [dual throat and dual expander nozzles
NASA Technical Reports Server (NTRS)
Meagher, G. M.
1980-01-01
Geometric, aerodynamic flow field, performance prediction, and heat transfer analyses are considered for two advanced chamber nozzle concepts applicable to Earth-to-orbit engine systems. Topics covered include improvements to the dual throat aerodynamic and performance prediction program; geometric and flow field analyses of the dual expander concept; heat transfer analysis of both concepts, and engineering analysis of data from the NASA/MSFC hot-fire testing of a dual throat thruster model thrust chamber assembly. Preliminary results obtained are presented in graphs.
A New Powered Lower Limb Prosthesis Control Framework Based on Adaptive Dynamic Programming.
Wen, Yue; Si, Jennie; Gao, Xiang; Huang, Stephanie; Huang, He Helen
2017-09-01
This brief presents a novel application of adaptive dynamic programming (ADP) for optimal adaptive control of powered lower limb prostheses, a type of wearable robots to assist the motor function of the limb amputees. Current control of these robotic devices typically relies on finite state impedance control (FS-IC), which lacks adaptability to the user's physical condition. As a result, joint impedance settings are often customized manually and heuristically in clinics, which greatly hinder the wide use of these advanced medical devices. This simulation study aimed at demonstrating the feasibility of ADP for automatic tuning of the twelve knee joint impedance parameters during a complete gait cycle to achieve balanced walking. Given that the accurate models of human walking dynamics are difficult to obtain, the model-free ADP control algorithms were considered. First, direct heuristic dynamic programming (dHDP) was applied to the control problem, and its performance was evaluated on OpenSim, an often-used dynamic walking simulator. For the comparison purposes, we selected another established ADP algorithm, the neural fitted Q with continuous action (NFQCA). In both cases, the ADP controllers learned to control the right knee joint and achieved balanced walking, but dHDP outperformed NFQCA in this application during a 200 gait cycle-based testing.
Lin, Zibei; Shi, Fan; Hayes, Ben J; Daetwyler, Hans D
2017-05-01
Heuristic genomic inbreeding controls reduce inbreeding in genomic breeding schemes without reducing genetic gain. Genomic selection is increasingly being implemented in plant breeding programs to accelerate genetic gain of economically important traits. However, it may cause significant loss of genetic diversity when compared with traditional schemes using phenotypic selection. We propose heuristic strategies to control the rate of inbreeding in outbred plants, which can be categorised into three types: controls during mate allocation, during selection, and simultaneous selection and mate allocation. The proposed mate allocation measure GminF allocates two or more parents for mating in mating groups that minimise coancestry using a genomic relationship matrix. Two types of relationship-adjusted genomic breeding values for parent selection candidates ([Formula: see text]) and potential offspring ([Formula: see text]) are devised to control inbreeding during selection and even enabling simultaneous selection and mate allocation. These strategies were tested in a case study using a simulated perennial ryegrass breeding scheme. As compared to the genomic selection scheme without controls, all proposed strategies could significantly decrease inbreeding while achieving comparable genetic gain. In particular, the scenario using [Formula: see text] in simultaneous selection and mate allocation reduced inbreeding to one-third of the original genomic selection scheme. The proposed strategies are readily applicable in any outbred plant breeding program.
Optimizing the Placement of Burnable Poisons in PWRs
DOE Office of Scientific and Technical Information (OSTI.GOV)
Yilmaz, Serkan; Ivanov, Kostadin; Levine, Samuel
2005-07-15
The principal focus of this work is on developing a practical tool for designing the minimum amount of burnable poisons (BPs) for a pressurized water reactor using a typical Three Mile Island Unit 1 2-yr cycle as the reference design. The results of this study are to be applied to future reload designs. A new method, the Modified Power Shape Forced Diffusion (MPSFD) method, is presented that initially computes the BP cross section to force the power distribution into a desired shape. The method employs a simple formula that expresses the BP cross section as a function of the differencemore » between the calculated radial power distributions (RPDs) and the limit set for the maximum RPD. This method places BPs into all fresh fuel assemblies (FAs) having an RPD greater than the limit. The MPSFD method then reduces the BP content by reducing the BPs in fresh FAs with the lowest RPDs. Finally, the minimum BP content is attained via a heuristic fine-tuning procedure.This new BP design program has been automated by incorporating the new MPSFD method in conjunction with the heuristic fine-tuning program. The program has automatically produced excellent results for the reference core, and has the potential to reduce fuel costs and save manpower.« less
Students' Perceptions of Bilingualism in Spanish and Mandarin Dual Language Programs
ERIC Educational Resources Information Center
Lindholm-Leary, Kathryn
2016-01-01
Considerable research documents students' outcomes in dual language (DL) programs, but there is little examination of students' perceptions of bilingualism and its impact on students' cognitive functioning and social relationships, especially with comparative studies across different target languages and student backgrounds. This study, which…
A Small Business Management Entrepreneurship Curriculum: A Dual Progression Experience.
ERIC Educational Resources Information Center
Kuratko, Donald; LaFollette, William R.
1986-01-01
Describes Ball State University's "dual progression" curriculum for the small business management program. The program seeks to combine the best elements of entrepreneurial theory with the difficult facets of practical experience. The five major component courses (small business ventures, entrepreneurship, management information systems,…
Learning to improve iterative repair scheduling
NASA Technical Reports Server (NTRS)
Zweben, Monte; Davis, Eugene
1992-01-01
This paper presents a general learning method for dynamically selecting between repair heuristics in an iterative repair scheduling system. The system employs a version of explanation-based learning called Plausible Explanation-Based Learning (PEBL) that uses multiple examples to confirm conjectured explanations. The basic approach is to conjecture contradictions between a heuristic and statistics that measure the quality of the heuristic. When these contradictions are confirmed, a different heuristic is selected. To motivate the utility of this approach we present an empirical evaluation of the performance of a scheduling system with respect to two different repair strategies. We show that the scheduler that learns to choose between the heuristics outperforms the same scheduler with any one of two heuristics alone.
Heuristic and optimal policy computations in the human brain during sequential decision-making.
Korn, Christoph W; Bach, Dominik R
2018-01-23
Optimal decisions across extended time horizons require value calculations over multiple probabilistic future states. Humans may circumvent such complex computations by resorting to easy-to-compute heuristics that approximate optimal solutions. To probe the potential interplay between heuristic and optimal computations, we develop a novel sequential decision-making task, framed as virtual foraging in which participants have to avoid virtual starvation. Rewards depend only on final outcomes over five-trial blocks, necessitating planning over five sequential decisions and probabilistic outcomes. Here, we report model comparisons demonstrating that participants primarily rely on the best available heuristic but also use the normatively optimal policy. FMRI signals in medial prefrontal cortex (MPFC) relate to heuristic and optimal policies and associated choice uncertainties. Crucially, reaction times and dorsal MPFC activity scale with discrepancies between heuristic and optimal policies. Thus, sequential decision-making in humans may emerge from integration between heuristic and optimal policies, implemented by controllers in MPFC.
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,…
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…
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…
Sequence-based heuristics for faster annotation of non-coding RNA families.
Weinberg, Zasha; Ruzzo, Walter L
2006-01-01
Non-coding RNAs (ncRNAs) are functional RNA molecules that do not code for proteins. Covariance Models (CMs) are a useful statistical tool to find new members of an ncRNA gene family in a large genome database, using both sequence and, importantly, RNA secondary structure information. Unfortunately, CM searches are extremely slow. Previously, we created rigorous filters, which provably sacrifice none of a CM's accuracy, while making searches significantly faster for virtually all ncRNA families. However, these rigorous filters make searches slower than heuristics could be. In this paper we introduce profile HMM-based heuristic filters. We show that their accuracy is usually superior to heuristics based on BLAST. Moreover, we compared our heuristics with those used in tRNAscan-SE, whose heuristics incorporate a significant amount of work specific to tRNAs, where our heuristics are generic to any ncRNA. Performance was roughly comparable, so we expect that our heuristics provide a high-quality solution that--unlike family-specific solutions--can scale to hundreds of ncRNA families. The source code is available under GNU Public License at the supplementary web site.
ERIC Educational Resources Information Center
Fabregas-Janeiro, Maria G.; de la Parra, Pablo Nuno
2012-01-01
In 2006, UPAEP (Universidad Popular Autonoma del Estado de Puebla) and OSU (Oklahoma State University) signed a MOU (memorandum of understanding) to develop more than 20 dual master's degree programs. This special partnership has allowed students from Mexico and the United States to study two master degree programs, in two languages, in two…
Automated detection of heuristics and biases among pathologists in a computer-based system.
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.
Standards Policies to Support Young Dual Language Learners
ERIC Educational Resources Information Center
Rendon, Thomas; Harjusola-Webb, Sanna; Gatmaitan, Michelle
2014-01-01
In response to increasing numbers of young dual language learners (DLL) in American early childhood programs, teachers and administrators have made many and varied attempts to address the unique needs of this population. Educational success for DLLs comes through skilled educators who address relevant content through high-quality programs and…
Acknowledging Spanish and English Resources during Mathematical Reasoning
ERIC Educational Resources Information Center
LópezLeiva, Carlos A.; Torres, Zayoni; Khisty, Lena L.
2013-01-01
As English-only efforts continue in the US schooling system, dual-language programs have served as attempts to preserve students' home language. An after-school, dual-language, Spanish-English, mathematics program, Los Rayos was developed in a predominantly Mexican/Mexican-American neighborhood in Chicago. As participant observers with a…
Students with Dual Diagnosis: Can School-Based Mental Health Services Play a Role?
ERIC Educational Resources Information Center
Lambros, Katina; Kraemer, Bonnie; Wager, James Derek; Culver, Shirley; Angulo, Aidee; Saragosa, Marie
2016-01-01
This article describes and investigates initial findings from the Esperanza Mental Health Services (EMHS) Program, which is an intensive outpatient program that provides individual and group mental health services for students with "dual diagnosis" or developmental disabilities and co-occurring mental health problems. Previous research…
Generation of structural topologies using efficient technique based on sorted compliances
NASA Astrophysics Data System (ADS)
Mazur, Monika; Tajs-Zielińska, Katarzyna; Bochenek, Bogdan
2018-01-01
Topology optimization, although well recognized is still widely developed. It has gained recently more attention since large computational ability become available for designers. This process is stimulated simultaneously by variety of emerging, innovative optimization methods. It is observed that traditional gradient-based mathematical programming algorithms, in many cases, are replaced by novel and e cient heuristic methods inspired by biological, chemical or physical phenomena. These methods become useful tools for structural optimization because of their versatility and easy numerical implementation. In this paper engineering implementation of a novel heuristic algorithm for minimum compliance topology optimization is discussed. The performance of the topology generator is based on implementation of a special function utilizing information of compliance distribution within the design space. With a view to cope with engineering problems the algorithm has been combined with structural analysis system Ansys.
NASA Astrophysics Data System (ADS)
Suthikarnnarunai, N.; Olinick, E.
2009-01-01
We present a case study on the application of techniques for solving the Vehicle Routing Problem (VRP) to improve the transportation service provided by the University of The Thai Chamber of Commerce to its staff. The problem is modeled as VRP with time windows, split deliveries, and a mixed fleet. An exact algorithm and a heuristic solution procedure are developed to solve the problem and implemented in the AMPL modeling language and CPLEX Integer Programming solver. Empirical results indicate that the heuristic can find relatively good solutions in a small fraction of the time required by the exact method. We also perform sensitivity analysis and find that a savings in outsourcing cost can be achieved with a small increase in vehicle capacity.
Optimization Models for Scheduling of Jobs
Indika, S. H. Sathish; Shier, Douglas R.
2006-01-01
This work is motivated by a particular scheduling problem that is faced by logistics centers that perform aircraft maintenance and modification. Here we concentrate on a single facility (hangar) which is equipped with several work stations (bays). Specifically, a number of jobs have already been scheduled for processing at the facility; the starting times, durations, and work station assignments for these jobs are assumed to be known. We are interested in how best to schedule a number of new jobs that the facility will be processing in the near future. We first develop a mixed integer quadratic programming model (MIQP) for this problem. Since the exact solution of this MIQP formulation is time consuming, we develop a heuristic procedure, based on existing bin packing techniques. This heuristic is further enhanced by application of certain local optimality conditions. PMID:27274921
IMPLICIT DUAL CONTROL BASED ON PARTICLE FILTERING AND FORWARD DYNAMIC PROGRAMMING.
Bayard, David S; Schumitzky, Alan
2010-03-01
This paper develops a sampling-based approach to implicit dual control. Implicit dual control methods synthesize stochastic control policies by systematically approximating the stochastic dynamic programming equations of Bellman, in contrast to explicit dual control methods that artificially induce probing into the control law by modifying the cost function to include a term that rewards learning. The proposed implicit dual control approach is novel in that it combines a particle filter with a policy-iteration method for forward dynamic programming. The integration of the two methods provides a complete sampling-based approach to the problem. Implementation of the approach is simplified by making use of a specific architecture denoted as an H-block. Practical suggestions are given for reducing computational loads within the H-block for real-time applications. As an example, the method is applied to the control of a stochastic pendulum model having unknown mass, length, initial position and velocity, and unknown sign of its dc gain. Simulation results indicate that active controllers based on the described method can systematically improve closed-loop performance with respect to other more common stochastic control approaches.
Learning as a Problem Solving Tool. Technical Report CS74018-R.
ERIC Educational Resources Information Center
Claybrook, Billy G.
This paper explores the use of learning as a practical tool in problem solving. The idea that learning should and eventually will be a vital component of most Artificial Intelligence programs is pursued. Current techniques in learning systems are compared. A detailed discussion of the problems of representing, modifying, and creating heuristics is…
Methods and Models for the Construction of Weakly Parallel Tests. Research Report 90-4.
ERIC Educational Resources Information Center
Adema, Jos J.
Methods are proposed for the construction of weakly parallel tests, that is, tests with the same test information function. A mathematical programing model for constructing tests with a prespecified test information function and a heuristic for assigning items to tests such that their information functions are equal play an important role in the…
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…
Fast or Frugal, but Not Both: Decision Heuristics under Time Pressure
ERIC Educational Resources Information Center
Bobadilla-Suarez, Sebastian; Love, Bradley C.
2018-01-01
Heuristics are simple, yet effective, strategies that people use to make decisions. Because heuristics do not require all available information, they are thought to be easy to implement and to not tax limited cognitive resources, which has led heuristics to be characterized as fast-and-frugal. We question this monolithic conception of heuristics…
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…
Gigerenzer, Gerd
2008-01-01
The adaptive toolbox is a Darwinian-inspired theory that conceives of the mind as a modular system that is composed of heuristics, their building blocks, and evolved capacities. The study of the adaptive toolbox is descriptive and analyzes the selection and structure of heuristics in social and physical environments. The study of ecological rationality is prescriptive and identifies the structure of environments in which specific heuristics either succeed or fail. Results have been used for designing heuristics and environments to improve professional decision making in the real world. © 2008 Association for Psychological Science.
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.
Heuristics: foundations for a novel approach to medical decision making.
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.
Kail, Robert V
2013-11-01
According to dual-process models that include analytic and heuristic modes of processing, analytic processing is often expected to become more common with development. Consistent with this view, on reasoning problems, adolescents are more likely than children to select alternatives that are backed by statistical evidence. It is shown here that this pattern depends on the quality of the statistical evidence and the quality of the testimonial that is the typical alternative to statistical evidence. In Experiment 1, 9- and 13-year-olds (N=64) were presented with scenarios in which solid statistical evidence was contrasted with casual or expert testimonial evidence. When testimony was casual, children relied on it but adolescents did not; when testimony was expert, both children and adolescents relied on it. In Experiment 2, 9- and 13-year-olds (N=83) were presented with scenarios in which casual testimonial evidence was contrasted with weak or strong statistical evidence. When statistical evidence was weak, children and adolescents relied on both testimonial and statistical evidence; when statistical evidence was strong, most children and adolescents relied on it. Results are discussed in terms of their implications for dual-process accounts of cognitive development. Copyright © 2013 Elsevier Inc. All rights reserved.
ERIC Educational Resources Information Center
Carlson, Gregory Dean
2013-01-01
The purpose of this Delphi study was to determine the essential components of dual credit in New Mexico. Dual credit experts from colleges and high schools in New Mexico were asked to participate in a three-round Delphi study to determine what the future policy of dual credit should be, and why it should be that way. Definitions of dual credit may…
How the twain can meet: Prospect theory and models of heuristics in risky choice.
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. Copyright © 2017 Elsevier Inc. All rights reserved.
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…
The recognition heuristic: a review of theory and tests.
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).
Perceived breast cancer risk: heuristic reasoning and search for a dominance structure.
Katapodi, Maria C; Facione, Noreen C; Humphreys, Janice C; Dodd, Marylin J
2005-01-01
Studies suggest that people construct their risk perceptions by using inferential rules called heuristics. The purpose of this study was to identify heuristics that influence perceived breast cancer risk. We examined 11 interviews from women of diverse ethnic/cultural backgrounds who were recruited from community settings. Narratives in which women elaborated about their own breast cancer risk were analyzed with Argument and Heuristic Reasoning Analysis methodology, which is based on applied logic. The availability, simulation, representativeness, affect, and perceived control heuristics, and search for a dominance structure were commonly used for making risk assessments. Risk assessments were based on experiences with an abnormal breast symptom, experiences with affected family members and friends, beliefs about living a healthy lifestyle, and trust in health providers. Assessment of the potential threat of a breast symptom was facilitated by the search for a dominance structure. Experiences with family members and friends were incorporated into risk assessments through the availability, simulation, representativeness, and affect heuristics. Mistrust in health providers led to an inappropriate dependence on the perceived control heuristic. Identified heuristics appear to create predictable biases and suggest that perceived breast cancer risk is based on common cognitive patterns.
Cognitive load during route selection increases reliance on spatial heuristics.
Brunyé, Tad T; Martis, Shaina B; Taylor, Holly A
2018-05-01
Planning routes from maps involves perceiving the symbolic environment, identifying alternate routes and applying explicit strategies and implicit heuristics to select an option. Two implicit heuristics have received considerable attention, the southern route preference and initial segment strategy. This study tested a prediction from decision-making theory that increasing cognitive load during route planning will increase reliance on these heuristics. In two experiments, participants planned routes while under conditions of minimal (0-back) or high (2-back) working memory load. In Experiment 1, we examined how memory load impacts the southern route heuristic. In Experiment 2, we examined how memory load impacts the initial segment heuristic. Results replicated earlier results demonstrating a southern route preference (Experiment 1) and initial segment strategy (Experiment 2) and further demonstrated that evidence for heuristic reliance is more likely under conditions of concurrent working memory load. Furthermore, the extent to which participants maintained efficient route selection latencies in the 2-back condition predicted the magnitude of this effect. Together, results demonstrate that working memory load increases the application of heuristics during spatial decision making, particularly when participants attempt to maintain quick decisions while managing concurrent task demands.
Dual Enrollment in a Rural Environment: A Descriptive Quantitative Study
ERIC Educational Resources Information Center
Dodge, Mary Beth
2012-01-01
Dual enrollment is a federally funded program that offers high school students the opportunity to earn both high school and postsecondary credits for the same course. While the phenomenon of concurrent enrollment in postsecondary and college educational programs is not new, political support and public funding has drawn focus to the policies of…
Community College Dual Enrollment Faculty Orientation: A Utilization-Focused Approach
ERIC Educational Resources Information Center
Charlier, Hara D.; Duggan, Molly H.
2010-01-01
The current climate of accountability demands that institutions engage in data-driven program evaluation. In order to promote quality dual enrollment (DE) programs, institutions must support the adjunct faculty teaching college courses in high schools. This study uses Patton's utilization-focused model (1997) to conduct a formative evaluation of a…
Systematic Alignment of Dual Teacher Preparation
ERIC Educational Resources Information Center
Anderson, Kelly; Smith, JaneDiane; Olsen, Jacob; Algozzine, Bob
2015-01-01
Given the rapid growth of diversity in schools across the country, teacher educators are turning to innovative ways to redesign their programs. In this article, we describe efforts of a dual licensure program in which undergraduate teachers-in-training acquired knowledge and skills in core content, as well as evidence-based pedagogy and discipline…
A Quantitative Study Identifying Political Strategies Used by Principals of Dual Language Programs
ERIC Educational Resources Information Center
Girard, Guadalupe
2017-01-01
Purpose. The purpose of this quantitative study was to identify the external and internal political strategies used by principals that allow them to successfully navigate the political environment surrounding dual language programs. Methodology. This quantitative study used descriptive research to collect, analyze, and report data that identified…
Equity in Spanish/English Dual Language Education: Practitioners' Perspectives
ERIC Educational Resources Information Center
Sugarman, Julie Sarice
2012-01-01
Dual language programs have been shown to be one of the most successful models for closing the achievement gap between English-speaking and English-learning students, which can be considered a strong indicator of educational equity. However, questions remains about how equity is achieved within these programs and what equity means to…
Luo, Zhihao; Liu, Zhong; Shi, Jianmai
2017-01-01
In this paper, a two-echelon cooperated routing problem for the ground vehicle (GV) and its carried unmanned aerial vehicle (UAV) is investigated, where the GV travels on the road network and its UAV travels in areas beyond the road to visit a number of targets unreached by the GV. In contrast to the classical two-echelon routing problem, the UAV has to launch and land on the GV frequently to change or charge its battery while the GV is moving on the road network. A new 0–1 integer programming model is developed to formulate the problem, where the constraints on the spatial and temporal cooperation of GV and UAV routes are included. Two heuristics are proposed to solve the model: the first heuristic (H1) constructs a complete tour for all targets and splits it by GV routes, while the second heuristic (H2) constructs the GV tour and assigns UAV flights to it. Random instances with six different sizes (25–200 targets, 12–80 rendezvous nodes) are used to test the algorithms. Computational results show that H1 performs slightly better than H2, while H2 uses less time and is more stable. PMID:28513552
Optimal dynamic remapping of parallel computations
NASA Technical Reports Server (NTRS)
Nicol, David M.; Reynolds, Paul F., Jr.
1987-01-01
A large class of computations are characterized by a sequence of phases, with phase changes occurring unpredictably. The decision problem was considered regarding the remapping of workload to processors in a parallel computation when the utility of remapping and the future behavior of the workload is uncertain, and phases exhibit stable execution requirements during a given phase, but requirements may change radically between phases. For these problems a workload assignment generated for one phase may hinder performance during the next phase. This problem is treated formally for a probabilistic model of computation with at most two phases. The fundamental problem of balancing the expected remapping performance gain against the delay cost was addressed. Stochastic dynamic programming is used to show that the remapping decision policy minimizing the expected running time of the computation has an extremely simple structure. Because the gain may not be predictable, the performance of a heuristic policy that does not require estimnation of the gain is examined. The heuristic method's feasibility is demonstrated by its use on an adaptive fluid dynamics code on a multiprocessor. The results suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change. The results also suggest that this heuristic is applicable to computations with more than two phases.
Heuristic Diagrams as a Tool to Teach History of Science
NASA Astrophysics Data System (ADS)
Chamizo, José A.
2012-05-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 left side originally related in Gowin's Vee with philosophies, theories, models, laws or regularities now agrees with Toulmin's concepts (language, models as representation techniques and application procedures). Mexican science teachers without experience in science education research used the heuristic diagram to learn about the history of chemistry considering also in the left side two different historical times: past and present. Through a semantic differential scale teachers' attitude to the heuristic diagram was evaluated and its usefulness was demonstrated.
ERIC Educational Resources Information Center
Guzman-Orth, Danielle; Lopez, Alexis A.; Tolentino, Florencia
2017-01-01
Dual language learners (DLLs) and the various educational programs that serve them are increasing in number across the country. This framework lays out a conceptual approach for dual language assessment tasks designed to measure the language and literacy skills of young DLLs entering kindergarten in the United States. Although our examples focus…
NASA Astrophysics Data System (ADS)
Yamamoto, Takanori; Bannai, Hideo; Nagasaki, Masao; Miyano, Satoru
We present new decomposition heuristics for finding the optimal solution for the maximum-weight connected graph problem, which is known to be NP-hard. Previous optimal algorithms for solving the problem decompose the input graph into subgraphs using heuristics based on node degree. We propose new heuristics based on betweenness centrality measures, and show through computational experiments that our new heuristics tend to reduce the number of subgraphs in the decomposition, and therefore could lead to the reduction in computational time for finding the optimal solution. The method is further applied to analysis of biological pathway data.
Dual diagnosis resource needs in Spain: a national survey of professionals.
Szerman, Nestor; Vega, Pablo; Grau-López, Lara; Barral, Carmen; Basurte-Villamor, Ignacio; Mesías, Beatriz; Rodríguez-Cintas, Laia; Martínez-Raga, José; Casas, Miguel; Roncero, Carlos
2014-01-01
Since provision of integrated services for patients with dual pathology or dual disorders (coexistence of an addictive disorder and another mental health disorder) is an important challenge in mental health, this study assessed health care professionals' perceptions and knowledge of the current state of specific resources for patients with dual pathology in Spain. We conducted a national survey of health care professionals seeing patients with dual pathology in treatment facilities throughout Spain. Participants completed a specific online questionnaire about the needs of and available resources for patients with dual pathology. A total of 659 professionals, mostly psychologists (n = 286, 43.4%) or psychiatrists (n = 217, 32.9%), participated in the study. Nearly all participants who responded to these items reported that specific resources for dual pathology were needed (n = 592/635, 93.2%); 76.7% (n = 487) identified intermediate resources, 68.8% (n = 437) acute detoxification units, and 64.6% (n = 410) medium-stay rehabilitation units as particularly necessary. In the opinion of 54.0% of respondents (n = 343), integrated mental health and addiction treatment services were available. Of the participants who answered these items, only a small proportion (n = 162/605, 26.8%) reported that there were appropriate outpatient programs for dual pathology, 30.4% (n = 184/605) specific hospitalization units, 16.9% (n = 99/587) subacute inpatient units, 34.2% (n = 201/587) outpatient intermediate resources, 15.5% (n = 91/587) day hospitals, and 21.5% (n = 126/587) day centers. Conversely, 62.5% (n = 378/587) of participants reported a greater presence of specific detoxification/withdrawal units, 47.3% (n = 286/587) psychiatric acute admission units, and 41.9% (n = 246/587) therapeutic communities. In the professionals' opinion, the presence of specialty programs was low; 11.6% of respondents (n = 68/587) reported that vocational programs and 16.7% (n = 98/587) reported that occupational rehabilitation programs were available. Employee turnover was common: 51.9% of respondents (n = 314/605) stated that employee turnover was occasional to frequent. According to the professionals surveyed, specific health care resources for the management of dual pathology are currently insufficient, underlining the need for additional efforts and strategies for treating individuals with comorbid disorders.
Design principles for engaging and retaining virtual citizen scientists.
Wald, Dara M; Longo, Justin; Dobell, A R
2016-06-01
Citizen science initiatives encourage volunteer participants to collect and interpret data and contribute to formal scientific projects. The growth of virtual citizen science (VCS), facilitated through websites and mobile applications since the mid-2000s, has been driven by a combination of software innovations and mobile technologies, growing scientific data flows without commensurate increases in resources to handle them, and the desire of internet-connected participants to contribute to collective outputs. However, the increasing availability of internet-based activities requires individual VCS projects to compete for the attention of volunteers and promote their long-term retention. We examined program and platform design principles that might allow VCS initiatives to compete more effectively for volunteers, increase productivity of project participants, and retain contributors over time. We surveyed key personnel engaged in managing a sample of VCS projects to identify the principles and practices they pursued for these purposes and led a team in a heuristic evaluation of volunteer engagement, website or application usability, and participant retention. We received 40 completed survey responses (33% response rate) and completed a heuristic evaluation of 20 VCS program sites. The majority of the VCS programs focused on scientific outcomes, whereas the educational and social benefits of program participation, variables that are consistently ranked as important for volunteer engagement and retention, were incidental. Evaluators indicated usability, across most of the VCS program sites, was higher and less variable than the ratings for participant engagement and retention. In the context of growing competition for the attention of internet volunteers, increased attention to the motivations of virtual citizen scientists may help VCS programs sustain the necessary engagement and retention of their volunteers. © 2016 Society for Conservation Biology.
ERIC Educational Resources Information Center
Payton-Adams, Minnie
2014-01-01
The purpose of this quantitative study was to examine the impact of the number of college credits earned in Technical College Preparation (Tech Prep) and Dual Credit (College Now) programs as a predictor of continued success after high school, as measured by first-year college GPA at a Midwest Community College. This study looked at how the…
Heuristic evaluation of infusion pumps: implications for patient safety in Intensive Care Units.
Graham, Mark J; Kubose, Tate K; Jordan, Desmond; Zhang, Jiajie; Johnson, Todd R; Patel, Vimla L
2004-11-01
The goal of this research was to use a heuristic evaluation methodology to uncover design and interface deficiencies of infusion pumps that are currently in use in Intensive Care Units (ICUs). Because these infusion systems cannot be readily replaced due to lease agreements and large-scale institutional purchasing procedures, we argue that it is essential to systematically identify the existing usability problems so that the possible causes of errors can be better understood, passed on to the end-users (e.g., critical care nurses), and used to make policy recommendations. Four raters conducted the heuristic evaluation of the three-channel infusion pump interface. Three raters had a cognitive science background as well as experience with the heuristic evaluation methodology. The fourth rater was a veteran critical care nurse who had extensive experience operating the pumps. The usability experts and the domain expert independently evaluated the user interface and physical design of the infusion pump and generated a list of heuristic violations based upon a set of 14 heuristics developed in previous research. The lists were compiled and then rated on the severity of the violation. From 14 usability heuristics considered in this evaluation of the Infusion Pump, there were 231 violations. Two heuristics, "Consistency" and "Language", were found to have the most violations. The one with fewest violations was "Document". While some heuristic evaluation categories had more violations than others, the most severe ones were not confined to one type. The Primary interface location (e.g., where loading the pump, changing doses, and confirming drug settings takes place) had the most occurrences of heuristic violations. We believe that the Heuristic Evaluation methodology provides a simple and cost-effective approach to discovering medical device deficiencies that affect a patient's general well being. While this methodology provides information for the infusion pump designs of the future, it also identifies important insights concerning equipment that is currently in use in critical care environments.
Reframing Language Allocation Policy in Dual Language Bilingual Education
ERIC Educational Resources Information Center
Sánchez, María Teresa; García, Ofelia; Solorza, Cristian
2018-01-01
This article addresses language allocation policies in what is increasingly called "Dual Language Education" (DLE) in the U.S., offering a challenge to the strict language separation policies in those programs and a proposal for flexibility that transforms them into "Dual Language Bilingual Education" (DLBE). The article offers…
Blumenthal-Barby, J S; Krieger, Heather
2015-05-01
The role of cognitive biases and heuristics in medical decision making is of growing interest. The purpose of this study was to determine whether studies on cognitive biases and heuristics in medical decision making are based on actual or hypothetical decisions and are conducted with populations that are representative of those who typically make the medical decision; to categorize the types of cognitive biases and heuristics found and whether they are found in patients or in medical personnel; and to critically review the studies based on standard methodological quality criteria. Data sources were original, peer-reviewed, empirical studies on cognitive biases and heuristics in medical decision making found in Ovid Medline, PsycINFO, and the CINAHL databases published in 1980-2013. Predefined exclusion criteria were used to identify 213 studies. During data extraction, information was collected on type of bias or heuristic studied, respondent population, decision type, study type (actual or hypothetical), study method, and study conclusion. Of the 213 studies analyzed, 164 (77%) were based on hypothetical vignettes, and 175 (82%) were conducted with representative populations. Nineteen types of cognitive biases and heuristics were found. Only 34% of studies (n = 73) investigated medical personnel, and 68% (n = 145) confirmed the presence of a bias or heuristic. Each methodological quality criterion was satisfied by more than 50% of the studies, except for sample size and validated instruments/questions. Limitations are that existing terms were used to inform search terms, and study inclusion criteria focused strictly on decision making. Most of the studies on biases and heuristics in medical decision making are based on hypothetical vignettes, raising concerns about applicability of these findings to actual decision making. Biases and heuristics have been underinvestigated in medical personnel compared with patients. © The Author(s) 2014.
Makizako, Hyuma; Doi, Takehiko; Shimada, Hiroyuki; Yoshida, Daisuke; Tsutsumimoto, Kota; Uemura, Kazuki; Suzuki, Takao
2012-12-01
There has been much interest in exercise interventions as a primary behavioral prevention strategy against cognitive decline. The aim of this study was to evaluate the effect of a multicomponent exercise program on physical and dual-task performances in community-dwelling older adults with amnestic mild cognitive impairment (aMCI). Fifty older adults (23 women) with aMCI (mean age, 76 years) were randomized to an intervention (n=25) or a control group (n=25). The intervention group received a multicomponent exercise program for 90 minutes/day, 2 days/week, or 40 times over six months. The multicomponent exercises included aerobic exercise, muscle strength training and postural balance retraining, which was conducted under multi-task conditions to stimulate attention and memory. Participants in the control group attended two health promotion education classes within six months. Physical and dual-task performances were measured before randomization and after six months. Dual-task performances using reaction times with balance and cognitive demands were measured. The improvement effects on dual-task performances with both balance and cognitive demands were not statistically significant: reaction time with balance demand F1,45=3.3, p=0.07, and cognitive demand F1,45=2.6, p=0.12. However, there was a significant group-by-time interaction on maximal walking speed, which decreased significantly in the control group (F1,45=5.9, p=0.02). This six-month multicomponent exercise program improved maximal walking speed in older adults with aMCI; however, it did not improve dual-task performances assessed by reaction times.
2013-01-01
Background Elective patient admission and assignment planning is an important task of the strategic and operational management of a hospital and early on became a central topic of clinical operations research. The management of hospital beds is an important subtask. Various approaches have been proposed, involving the computation of efficient assignments with regard to the patients’ condition, the necessity of the treatment, and the patients’ preferences. However, these approaches are mostly based on static, unadaptable estimates of the length of stay and, thus, do not take into account the uncertainty of the patient’s recovery. Furthermore, the effect of aggregated bed capacities have not been investigated in this context. Computer supported bed management, combining an adaptable length of stay estimation with the treatment of shared resources (aggregated bed capacities) has not yet been sufficiently investigated. The aim of our work is: 1) to define a cost function for patient admission taking into account adaptable length of stay estimations and aggregated resources, 2) to define a mathematical program formally modeling the assignment problem and an architecture for decision support, 3) to investigate four algorithmic methodologies addressing the assignment problem and one base-line approach, and 4) to evaluate these methodologies w.r.t. cost outcome, performance, and dismissal ratio. Methods The expected free ward capacity is calculated based on individual length of stay estimates, introducing Bernoulli distributed random variables for the ward occupation states and approximating the probability densities. The assignment problem is represented as a binary integer program. Four strategies for solving the problem are applied and compared: an exact approach, using the mixed integer programming solver SCIP; and three heuristic strategies, namely the longest expected processing time, the shortest expected processing time, and random choice. A baseline approach serves to compare these optimization strategies with a simple model of the status quo. All the approaches are evaluated by a realistic discrete event simulation: the outcomes are the ratio of successful assignments and dismissals, the computation time, and the model’s cost factors. Results A discrete event simulation of 226,000 cases shows a reduction of the dismissal rate compared to the baseline by more than 30 percentage points (from a mean dismissal ratio of 74.7% to 40.06% comparing the status quo with the optimization strategies). Each of the optimization strategies leads to an improved assignment. The exact approach has only a marginal advantage over the heuristic strategies in the model’s cost factors (≤3%). Moreover,this marginal advantage was only achieved at the price of a computational time fifty times that of the heuristic models (an average computing time of 141 s using the exact method, vs. 2.6 s for the heuristic strategy). Conclusions In terms of its performance and the quality of its solution, the heuristic strategy RAND is the preferred method for bed assignment in the case of shared resources. Future research is needed to investigate whether an equally marked improvement can be achieved in a large scale clinical application study, ideally one comprising all the departments involved in admission and assignment planning. PMID:23289448
Schmidt, Robert; Geisler, Sandra; Spreckelsen, Cord
2013-01-07
Elective patient admission and assignment planning is an important task of the strategic and operational management of a hospital and early on became a central topic of clinical operations research. The management of hospital beds is an important subtask. Various approaches have been proposed, involving the computation of efficient assignments with regard to the patients' condition, the necessity of the treatment, and the patients' preferences. However, these approaches are mostly based on static, unadaptable estimates of the length of stay and, thus, do not take into account the uncertainty of the patient's recovery. Furthermore, the effect of aggregated bed capacities have not been investigated in this context. Computer supported bed management, combining an adaptable length of stay estimation with the treatment of shared resources (aggregated bed capacities) has not yet been sufficiently investigated. The aim of our work is: 1) to define a cost function for patient admission taking into account adaptable length of stay estimations and aggregated resources, 2) to define a mathematical program formally modeling the assignment problem and an architecture for decision support, 3) to investigate four algorithmic methodologies addressing the assignment problem and one base-line approach, and 4) to evaluate these methodologies w.r.t. cost outcome, performance, and dismissal ratio. The expected free ward capacity is calculated based on individual length of stay estimates, introducing Bernoulli distributed random variables for the ward occupation states and approximating the probability densities. The assignment problem is represented as a binary integer program. Four strategies for solving the problem are applied and compared: an exact approach, using the mixed integer programming solver SCIP; and three heuristic strategies, namely the longest expected processing time, the shortest expected processing time, and random choice. A baseline approach serves to compare these optimization strategies with a simple model of the status quo. All the approaches are evaluated by a realistic discrete event simulation: the outcomes are the ratio of successful assignments and dismissals, the computation time, and the model's cost factors. A discrete event simulation of 226,000 cases shows a reduction of the dismissal rate compared to the baseline by more than 30 percentage points (from a mean dismissal ratio of 74.7% to 40.06% comparing the status quo with the optimization strategies). Each of the optimization strategies leads to an improved assignment. The exact approach has only a marginal advantage over the heuristic strategies in the model's cost factors (≤3%). Moreover,this marginal advantage was only achieved at the price of a computational time fifty times that of the heuristic models (an average computing time of 141 s using the exact method, vs. 2.6 s for the heuristic strategy). In terms of its performance and the quality of its solution, the heuristic strategy RAND is the preferred method for bed assignment in the case of shared resources. Future research is needed to investigate whether an equally marked improvement can be achieved in a large scale clinical application study, ideally one comprising all the departments involved in admission and assignment planning.
ERIC Educational Resources Information Center
Mitchell, Eugene E., Ed.
A do-it-yourself laboratory course in automated systems designed at the University of Florida is described. Using a working model of a warehouse interfaced with a minicomputer as a working laboratory, the student gains hands-on experience in operations programing and applications of scheduling, materials handling, and heuristic optimization. (BT)
Current Barriers to Successful Implementation of FIST Principles
2013-07-01
risks will surface during development that could not have been predicted. Managing a thin budget with no schedule slack for these unknown-unknowns is...Fleischer » Keywords: Fast, Inexpensive, Simple, Tiny (FIST); Program Management ; Heuristics; Innovation; Oversight Current Barriers to Successful...Implementation of FIST Principles Capt Brandon Keller, USAF, and Lt Col J. Robert Wirthlin, USAF The Fast, Inexpensive, Simple, and Tiny (FIST
Development of a 3D log sawing optimization system for small sawmills in central Appalachia, US
Wenshu Lin; Jingxin Wang; Edward Thomas
2011-01-01
A 3D log sawing optimization system was developed to perform log generation, opening face determination, sawing simulation, and lumber grading using 3D modeling techniques. Heuristic and dynamic programming algorithms were used to determine opening face and grade sawing optimization. Positions and shapes of internal log defects were predicted using a model developed by...
NASA Technical Reports Server (NTRS)
Malik, Waqar
2016-01-01
Provide an overview of algorithms used in SARDA (Spot and Runway Departure Advisor) HITL (Human-in-the-Loop) simulation for Dallas Fort-Worth International Airport and Charlotte Douglas International airport. Outline a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the single runway scheduling (SRS) problem, and discuss heuristics to restrict the search space for the DP based algorithm and provide improvements.
Simulation-based planning for theater air warfare
NASA Astrophysics Data System (ADS)
Popken, Douglas A.; Cox, Louis A., Jr.
2004-08-01
Planning for Theatre Air Warfare can be represented as a hierarchy of decisions. At the top level, surviving airframes must be assigned to roles (e.g., Air Defense, Counter Air, Close Air Support, and AAF Suppression) in each time period in response to changing enemy air defense capabilities, remaining targets, and roles of opposing aircraft. At the middle level, aircraft are allocated to specific targets to support their assigned roles. At the lowest level, routing and engagement decisions are made for individual missions. The decisions at each level form a set of time-sequenced Courses of Action taken by opposing forces. This paper introduces a set of simulation-based optimization heuristics operating within this planning hierarchy to optimize allocations of aircraft. The algorithms estimate distributions for stochastic outcomes of the pairs of Red/Blue decisions. Rather than using traditional stochastic dynamic programming to determine optimal strategies, we use an innovative combination of heuristics, simulation-optimization, and mathematical programming. Blue decisions are guided by a stochastic hill-climbing search algorithm while Red decisions are found by optimizing over a continuous representation of the decision space. Stochastic outcomes are then provided by fast, Lanchester-type attrition simulations. This paper summarizes preliminary results from top and middle level models.
An application of artificial intelligence to the interpretation of mass spectra.
NASA Technical Reports Server (NTRS)
Buchanan, B. G.; Duffield, A. M.; Robertson, A. V.
1971-01-01
Description of the DENDRAL (Dendritic Algorithm) project, the objectives of which were to base the computer program on an alogorithm that generates an exhaustive, nonredundant list of all the structural isomers of a given chemical composition, and to devise a computer program that would perform an organic structure determination, given a molecular formula and a mass spectrum. This program is called 'Heuristic DENDRAL' and it operates by using the known structure/spectrum correlations to constrain the DENDRAL isomer generator to produce a single isomer for that composition. The collaboration of chemists and computer scientists has produced a tool of some practical utility from the chemical viewpoint, and an interesting program from the viewpoint of artificial intelligence.
Dual-Modulation, Dual-Wavelength, Optical Polarimetry System for Glucose Monitoring
2016-08-26
dual-wavelength, optical polarimetry system for glucose monitoring 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER N/A 6. AUTHOR(S) 5d...JBO.21.8.087001] 14. ABSTRACT A dual modulation optical polarimetry system utilizing both laser intensity and polarization modulation was designed...varying birefringence, which is one of the major limitations to the realization of polarimetry for glucose monitoring in the eye. The high-speed less
ERIC Educational Resources Information Center
Alfaro, Cristina; Durán, Richard; Hunt, Alexandra; Aragón, María José
2014-01-01
Recent education reforms have begun to reframe academic discussion and teacher practice surrounding bilingual educational approaches for preparing "21st century, college and career ready" citizens. Given this broader context, in this article we examine ways that we might join implementation of dual language programs, Common Core State…
ERIC Educational Resources Information Center
Hernandez, Sera J.
2017-01-01
This manuscript draws from a 2-year multiple-case ethnography on the educational experiences of Mexican immigrant families with California middle schools. The article explores the influence of the political landscape and raciolinguistic ideologies surrounding the nature and implementation of a middle school dual language bilingual program, and it…
ERIC Educational Resources Information Center
Henderson, Kathryn I.; Palmer, Deborah K.
2015-01-01
This article provides an in-depth exploration of the language ecologies of two classrooms attempting to implement a two-way dual language (TWDL) program and its mediating conditions. Drawing on ethnographic methods and a sociocultural understanding of language, we examined both teachers' and students' language ideologies and language practices,…
Expanding the Reach of Dual-Enrollment Programs
ERIC Educational Resources Information Center
Bailey, Thomas; Karp, Melinda Mechur
2005-01-01
Dual-enrollment programs, which allow high school students to enroll in college courses and earn college and high school credit simultaneously, are one method to introduce students to the idea of college and to its academic and social demands. The college credits that high school students potentially can earn also tend to be free or low-cost--a…
The Implementation of Dual Credit Programs in Six Nonurban Kentucky School Districts. REL 2016-136
ERIC Educational Resources Information Center
Piontek, Mary E.; Kannapel, Patricia J.; Flory, Michael; Stewart, Molly S.
2016-01-01
A key strategy of the Kentucky Department of Education's and Council on Postsecondary Education's College and Career Readiness Delivery plan is to provide opportunities for high school students to earn college credit. Districts across Kentucky are implementing dual credit programs, but there is little sharing of information about the…
How Much of a "Running Start" Do Dual Enrollment Programs Provide Students?
ERIC Educational Resources Information Center
Cowan, James; Goldhaber, Dan
2015-01-01
We study a popular dual enrollment program in Washington State, "Running Start" using a new administrative database that links high school and postsecondary data. Conditional on prior high school performance, we find that students participating in Running Start are more likely to attend any college but less likely to attend four-year…
ERIC Educational Resources Information Center
Hernandez, Donald J.; Napierala, Jeffrey S.
2014-01-01
Policies and programs aimed at increasing educational and economic opportunities typically target either low-income children or their mothers, but not both, which limits their impact in fostering intergenerational mobility. This insight undergirds the development and implementation of dual-generation strategies, which focus simultaneously on both…
ERIC Educational Resources Information Center
Gruman, Daniel H.
2013-01-01
A substantial amount of research examines the benefits of high school college-credit attainment programs against non-participation. The growth in popularity of these programs, particularly Advanced Placement (AP) and dual enrollment (DE), has them competing against one another for student attention. However, students, schools, and policymakers do…
ERIC Educational Resources Information Center
Block, Nicholas C.
2012-01-01
This study examined how participation of Latino students in two-way dual immersion versus mainstream programs might have impacted students' relationships with Spanish-speaking adults, thus affecting contexts for students to develop resiliency. Participants were parents of 90 fifth- and sixth-grade students (initially English proficient [EP] as…
The Recognition Heuristic: A Review of Theory and Tests
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
The MICA Case Conference Program at Tewksbury Hospital, Mass.: an integrated treatment model.
Clodfelter, Reynolds C; Albanese, Mark J; Baker, Gregg; Domoto, Katherine; Gui, Amy L; Khantzian, Edward J
2003-01-01
This report describes the MICA (Mentally Ill Chemically Abusing) Program at the Tewksbury Hospital campus in Tewksbury, Massachusetts. Several campus facilities collaborate in the MICA Program. Through Expert Case Conferences, principles of integrated psychosocial treatment with dual diagnosis patients are demonstrated. An expert clinician focuses on the interplay between psychological pain, characterological traits, defenses, and the patient's drug of choice. Patients who have participated in the program have reported positive experiences. The staff reported that the program has resulted in facility improvement in assessment and treatment of complex dual diagnosis patients.
NASA Astrophysics Data System (ADS)
Mahnam, Mehdi; Gendreau, Michel; Lahrichi, Nadia; Rousseau, Louis-Martin
2017-07-01
In this paper, we propose a novel heuristic algorithm for the volumetric-modulated arc therapy treatment planning problem, optimizing the trade-off between delivery time and treatment quality. We present a new mixed integer programming model in which the multi-leaf collimator leaf positions, gantry speed, and dose rate are determined simultaneously. Our heuristic is based on column generation; the aperture configuration is modeled in the columns and the dose distribution and time restriction in the rows. To reduce the number of voxels and increase the efficiency of the master model, we aggregate similar voxels using a clustering technique. The efficiency of the algorithm and the treatment quality are evaluated on a benchmark clinical prostate cancer case. The computational results show that a high-quality treatment is achievable using a four-thread CPU. Finally, we analyze the effects of the various parameters and two leaf-motion strategies.
NASA Astrophysics Data System (ADS)
Li, Chen; Lu, Zhiqiang; Han, Xiaole; Zhang, Yuejun; Wang, Li
2016-03-01
The integrated scheduling of container handling systems aims to optimize the coordination and overall utilization of all handling equipment, so as to minimize the makespan of a given set of container tasks. A modified disjunctive graph is proposed and a mixed 0-1 programming model is formulated. A heuristic algorithm is presented, in which the original problem is divided into two subproblems. In the first subproblem, contiguous bay crane operations are applied to obtain a good quay crane schedule. In the second subproblem, proper internal truck and yard crane schedules are generated to match the given quay crane schedule. Furthermore, a genetic algorithm based on the heuristic algorithm is developed to search for better solutions. The computational results show that the proposed algorithm can efficiently find high-quality solutions. They also indicate the effectiveness of simultaneous loading and discharging operations compared with separate ones.
Fast half-sibling population reconstruction: theory and algorithms.
Dexter, Daniel; Brown, Daniel G
2013-07-12
Kinship inference is the task of identifying genealogically related individuals. Kinship information is important for determining mating structures, notably in endangered populations. Although many solutions exist for reconstructing full sibling relationships, few exist for half-siblings. We consider the problem of determining whether a proposed half-sibling population reconstruction is valid under Mendelian inheritance assumptions. We show that this problem is NP-complete and provide a 0/1 integer program that identifies the minimum number of individuals that must be removed from a population in order for the reconstruction to become valid. We also present SibJoin, a heuristic-based clustering approach based on Mendelian genetics, which is strikingly fast. The software is available at http://github.com/ddexter/SibJoin.git+. Our SibJoin algorithm is reasonably accurate and thousands of times faster than existing algorithms. The heuristic is used to infer a half-sibling structure for a population which was, until recently, too large to evaluate.
Benefit of adaptive FEC in shared backup path protected elastic optical network.
Guo, Hong; Dai, Hua; Wang, Chao; Li, Yongcheng; Bose, Sanjay K; Shen, Gangxiang
2015-07-27
We apply an adaptive forward error correction (FEC) allocation strategy to an Elastic Optical Network (EON) operated with shared backup path protection (SBPP). To maximize the protected network capacity that can be carried, an Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed. Simulation results show that the FEC coding overhead required by the adaptive FEC scheme is significantly lower than that needed by a fixed FEC allocation strategy resulting in higher network capacity for the adaptive strategy. The adaptive FEC allocation strategy can also significantly outperform the fixed FEC allocation strategy both in terms of the spare capacity redundancy and the average FEC coding overhead needed per optical channel. The proposed heuristic algorithm is efficient and not only performs closer to the ILP model but also does much better than the shortest-path algorithm.
Energy-aware virtual network embedding in flexi-grid networks.
Lin, Rongping; Luo, Shan; Wang, Haoran; Wang, Sheng
2017-11-27
Network virtualization technology has been proposed to allow multiple heterogeneous virtual networks (VNs) to coexist on a shared substrate network, which increases the utilization of the substrate network. Efficiently mapping VNs on the substrate network is a major challenge on account of the VN embedding (VNE) problem. Meanwhile, energy efficiency has been widely considered in the network design in terms of operation expenses and the ecological awareness. In this paper, we aim to solve the energy-aware VNE problem in flexi-grid optical networks. We provide an integer linear programming (ILP) formulation to minimize the electricity cost of each arriving VN request. We also propose a polynomial-time heuristic algorithm where virtual links are embedded sequentially to keep a reasonable acceptance ratio and maintain a low electricity cost. Numerical results show that the heuristic algorithm performs closely to the ILP for a small size network, and we also demonstrate its applicability to larger networks.
Optimisation algorithms for ECG data compression.
Haugland, D; Heber, J G; Husøy, J H
1997-07-01
The use of exact optimisation algorithms for compressing digital electrocardiograms (ECGs) is demonstrated. As opposed to traditional time-domain methods, which use heuristics to select a small subset of representative signal samples, the problem of selecting the subset is formulated in rigorous mathematical terms. This approach makes it possible to derive algorithms guaranteeing the smallest possible reconstruction error when a bounded selection of signal samples is interpolated. The proposed model resembles well-known network models and is solved by a cubic dynamic programming algorithm. When applied to standard test problems, the algorithm produces a compressed representation for which the distortion is about one-half of that obtained by traditional time-domain compression techniques at reasonable compression ratios. This illustrates that, in terms of the accuracy of decoded signals, existing time-domain heuristics for ECG compression may be far from what is theoretically achievable. The paper is an attempt to bridge this gap.
Collins, Brian A.
2014-01-01
Latino dual language children typically enter school with a wide range of proficiencies in Spanish and English, many with low proficiency in both languages, yet do make gains in one or both languages during their first school years. Dual language development is associated with how language is used at home and school, as well as the type of instructional program children receive at school. The present study investigates how changes in both Spanish and English proficiencies of Latino, second-generation immigrant children (n =163) from kindergarten to second grade relate to instructional program type as well as language use at home and school. A series of MANCOVAs demonstrated significant dual language gains in children who were in bilingual classrooms and schools where Spanish was used among the teachers, students, and staff. Furthermore, only in classrooms where both Spanish and English were used did children reach age-appropriate levels of academic proficiency in both languages. Home language use was also significantly associated with dual language gains as was maternal Spanish vocabulary knowledge before controlling for maternal education. Educational implications and potential benefits associated with bilingualism are discussed. PMID:25264401
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. © The Author(s) 2015.
Marzilli Ericson, Keith M.; White, John Myles; Laibson, David; Cohen, Jonathan D.
2015-01-01
Heuristic models have been proposed for many domains of choice. We compare heuristic models of intertemporal choice, which can account for many of the known intertemporal choice anomalies, to discounting models. We conduct an out-of-sample, cross-validated comparison of intertemporal choice models. Heuristic models outperform traditional utility discounting models, including models of exponential and hyperbolic discounting. The best performing models predict choices by using a weighted average of absolute differences and relative (percentage) differences of the attributes of the goods in a choice set. We conclude that heuristic models explain time-money tradeoff choices in experiments better than utility discounting models. PMID:25911124
Heuristics and Problem Solving.
ERIC Educational Resources Information Center
Abel, Charles F.
2003-01-01
Defines heuristics as cognitive "rules of thumb" that can help problem solvers work more efficiently and effectively. Professors can use a heuristic model of problem solving to guide students in all disciplines through the steps of problem-solving. (SWM)
Better ILP models for haplotype assembly.
Etemadi, Maryam; Bagherian, Mehri; Chen, Zhi-Zhong; Wang, Lusheng
2018-02-19
The haplotype assembly problem for diploid is to find a pair of haplotypes from a given set of aligned Single Nucleotide Polymorphism (SNP) fragments (reads). It has many applications in association studies, drug design, and genetic research. Since this problem is computationally hard, both heuristic and exact algorithms have been designed for it. Although exact algorithms are much slower, they are still of great interest because they usually output significantly better solutions than heuristic algorithms in terms of popular measures such as the Minimum Error Correction (MEC) score, the number of switch errors, and the QAN50 score. Exact algorithms are also valuable because they can be used to witness how good a heuristic algorithm is. The best known exact algorithm is based on integer linear programming (ILP) and it is known that ILP can also be used to improve the output quality of every heuristic algorithm with a little decline in speed. Therefore, faster ILP models for the problem are highly demanded. As in previous studies, we consider not only the general case of the problem but also its all-heterozygous case where we assume that if a column of the input read matrix contains at least one 0 and one 1, then it corresponds to a heterozygous SNP site. For both cases, we design new ILP models for the haplotype assembly problem which aim at minimizing the MEC score. The new models are theoretically better because they contain significantly fewer constraints. More importantly, our experimental results show that for both simulated and real datasets, the new model for the all-heterozygous (respectively, general) case can usually be solved via CPLEX (an ILP solver) at least 5 times (respectively, twice) faster than the previous bests. Indeed, the running time can sometimes be 41 times better. This paper proposes a new ILP model for the haplotype assembly problem and its all-heterozygous case, respectively. Experiments with both real and simulated datasets show that the new models can be solved within much shorter time by CPLEX than the previous bests. We believe that the models can be used to improve heuristic algorithms as well.
An adaptive toolbox approach to the route to expertise in sport.
de Oliveira, Rita F; Lobinger, Babett H; Raab, Markus
2014-01-01
Expertise is characterized by fast decision-making which is highly adaptive to new situations. Here we propose that athletes use a toolbox of heuristics which they develop on their route to expertise. The development of heuristics occurs within the context of the athletes' natural abilities, past experiences, developed skills, and situational context, but does not pertain to any of these factors separately. This is a novel approach because it integrates separate factors into a comprehensive heuristic description. The novelty of this approach lies within the integration of separate factors determining expertise into a comprehensive heuristic description. It is our contention that talent identification methods and talent development models should therefore be geared toward the assessment and development of specific heuristics. Specifically, in addition to identifying and developing separate natural abilities and skills as per usual, heuristics should be identified and developed. The application of heuristics to talent and expertise models can bring the field one step away from dichotomized models of nature and nurture toward a comprehensive approach to the route to expertise.
Heuristic thinking makes a chemist smart.
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.
An adaptive toolbox approach to the route to expertise in sport
de Oliveira, Rita F.; Lobinger, Babett H.; Raab, Markus
2014-01-01
Expertise is characterized by fast decision-making which is highly adaptive to new situations. Here we propose that athletes use a toolbox of heuristics which they develop on their route to expertise. The development of heuristics occurs within the context of the athletes’ natural abilities, past experiences, developed skills, and situational context, but does not pertain to any of these factors separately. This is a novel approach because it integrates separate factors into a comprehensive heuristic description. The novelty of this approach lies within the integration of separate factors determining expertise into a comprehensive heuristic description. It is our contention that talent identification methods and talent development models should therefore be geared toward the assessment and development of specific heuristics. Specifically, in addition to identifying and developing separate natural abilities and skills as per usual, heuristics should be identified and developed. The application of heuristics to talent and expertise models can bring the field one step away from dichotomized models of nature and nurture toward a comprehensive approach to the route to expertise. PMID:25071673
Dual use technology -- it's good for everyone
DOE Office of Scientific and Technical Information (OSTI.GOV)
Schario, K.
1998-07-01
Dual use technology is defined as technology that has both military and commercial applications. The main benefit to dual use technology is that it encourages research and development (R and D) partnerships between the government and industry that lead to the development of common products for military and commercial purposes instead of application-unique products, as in the past. Commonality, in turn, leads to better, more affordable products for all. These partnerships are cost-shared so that neither party has to bear the entire cost of development. Why is this good? Neither the military nor commercial world can afford to fully fundmore » all R and D efforts required to maintain their technological edge in the international market. How do you determine which R and D programs have enough commercial potential to motivate industry to invest in the development? This paper explores the issues involved in establishing a dual use program, and how to take advantage of the flexibility of these programs.« less
Equilibrium paths analysis of materials with rheological properties by using the chaos theory
NASA Astrophysics Data System (ADS)
Bednarek, Paweł; Rządkowski, Jan
2018-01-01
The numerical equilibrium path analysis of the material with random rheological properties by using standard procedures and specialist computer programs was not successful. The proper solution for the analysed heuristic model of the material was obtained on the base of chaos theory elements and neural networks. The paper deals with mathematical reasons of used computer programs and also are elaborated the properties of the attractor used in analysis. There are presented results of conducted numerical analysis both in a numerical and in graphical form for the used procedures.
Geeraert, Nicolas
2013-09-01
A known consequence of stereotype suppression is post-suppressional rebound (PSR), an ironic activation of the suppressed stereotype. This is typically explained as an unintended by-product from a dual-process model of mental control. Relying on this model, stereotype rebound is believed to be conceptual. Alternative accounts predict PSR to be featural or procedural. According to the latter account, stereotype rebound would not be limited to the suppressed social category, but could occur for a target from any social category. The occurrence of procedural stereotype rebound was examined across five experiments. Suppression of one particular stereotype consistently led to rebound for social targets belonging to the same or a different stereotype in an essay-writing task (Experiments 1-3) and led to facilitation in recognition of stereotype-consistent words (Experiment 4). Finally, stereotype suppression was shown to impact on assessments of stereotype use but not on heuristic thinking (Experiment 5).
Psychodynamic psychotherapy: a core conceptual model and its application.
Corradi, Richard B
2006-01-01
Contemporary American psychiatry, influenced by the "biologic revolution" with its emphasis on a brain-disease model of mental illness, and operating in a managed care delivery system, is in danger of relinquishing its listening and talking functions--psychotherapy--in favor of prescribing drugs. However, despite remarkable advances in the neurosciences, there is still no pharmaceutical magic bullet. The author argues for the continued relevancy of psychotherapy and outlines a practical psychodynamic approach that utilizes fundamental analytic concepts. These concepts--transference, the dual theory of drives, the repetition compulsion, and mechanisms of defense--are described and their clinical application is illustrated. This core conceptual model has significant heuristic value in treating patients and in teaching psychotherapy to psychiatric residents. With its emphasis on the power of the doctor-patient relationship, it teaches residents an effective body of knowledge that helps them define their professional identity-as psychiatrists whose most effective therapeutic tool is themselves, not the drugs they dispense.
Coordination of health coverage for Medicare enrollees: living with HIV/AIDS in California.
Eichner, J; Kahn, J G
2001-08-01
Because Medicare does not cover a large part of the health care that its enrollees living with HIV/AIDS require, they need other coverage to supplement Medicare. Medicaid is a major source of that supplemental coverage. In California, Medicare enrollees with HIV/AIDS who were also enrolled in Medi-Cal (California's Medicaid program) had total payments from both programs of $177 million, or an average of $28,956 per person in the fee-for-service-system in 1998. Of that total, Medicare paid for 38 percent, mainly for inpatient visits and ambulatory care, while Medi-Cal paid 62 percent, mainly for prescription drugs. For these dual enrollees, many of Medicare's benefit gaps--including a large share of prescription drugs, nursing facility services and home care--are being filled by Medi-Cal. Data in this Medicare Brief indicate that the incremental cost to the federal government of filling gaps in the Medicare benefits package would be considerably less than the full cost of the additional benefits. Through Medicaid and other programs, the federal government is already paying a substantial part of public program expenditures for dual enrollees with HIV/AIDS. Other issues to consider are how the dual Medicare-Medicaid funding streams affect the programs' cost efficiency, and from the perspective of Medicare enrollees and providers, how well the dual programs coordinate to meet the needs of people with HIV/AIDS and other chronic conditions.
Sales, Jessica M.; Latham, Teaniese P.; DiClemente, Ralph J.; Rose, Eve
2013-01-01
Objectives To characterize dual-method protection users and report the prevalence of dual-method use among young adult African American women residing in the Southeastern United States. Design Analysis of baseline data from a randomized controlled trial. Setting A clinic-based sample of young women enrolled in a randomized trial of a human immunodeficiency virus (HIV)–prevention program in Atlanta, Georgia, from June 2005 to June 2007. Participants African American women aged 14 to 20 years who reported unprotected sexual activity in the past 6months. Of the eligible adolescents, 94% (N=701) were enrolled in the study and completed baseline assessments. Outcome Measures Dual-method protection use as well as sociodemographic, individual-level, interpersonal-level, and community-level factors and interpersonal communication skills. Only data from the baseline assessment, before randomization, were used for the analysis. Results A total of 102 participants (14.6%) were classified as dual-method protection users. After controlling for age and clinic, significant differences between dual-method users and non–dual-method users were found for impulsivity, self-esteem, social support, relationship style, partner communication self-efficacy, and fear of condom negotiation. Conclusions Dual-method protection use is low. Identification of factors that differentiate dual-method users from non–dual-method users at the individual, interpersonal, and community levels in this young African American sample suggests that HIV, sexually transmitted disease, and unintended pregnancy risk–reduction programs should address factors at each level, not simply the individual level, and that this may involve structural and/or clinical counseling practice changes in clinics that serve young women, to optimally facilitate dual-method protection use among young African American women in the Southeastern United States. PMID:21135341
Heuristics Reasoning in Diagnostic Judgment.
ERIC Educational Resources Information Center
O'Neill, Eileen S.
1995-01-01
Describes three heuristics--short-cut mental strategies that streamline information--relevant to diagnostic reasoning: accessibility, similarity, and anchoring and adjustment. Analyzes factors thought to influence heuristic reasoning and presents interventions to be tested for nursing practice and education. (JOW)
2017-03-01
ARL-TN-0814 ● MAR 2017 US Army Research Laboratory Usability Study and Heuristic Evaluation of the Applied Robotics for...ARL-TN-0814 ● MAR 2017 US Army Research Laboratory Usability Study and Heuristic Evaluation of the Applied Robotics for...Heuristic Evaluation of the Applied Robotics for Installations and Base Operations (ARIBO) Driverless Vehicle Reservation Application ARIBO Mobile 5a
Fluency heuristic: a model of how the mind exploits a by-product of information retrieval.
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. (c) 2008 APA, all rights reserved.
NASA Astrophysics Data System (ADS)
Tian, Wenli; Cao, Chengxuan
2017-03-01
A generalized interval fuzzy mixed integer programming model is proposed for the multimodal freight transportation problem under uncertainty, in which the optimal mode of transport and the optimal amount of each type of freight transported through each path need to be decided. For practical purposes, three mathematical methods, i.e. the interval ranking method, fuzzy linear programming method and linear weighted summation method, are applied to obtain equivalents of constraints and parameters, and then a fuzzy expected value model is presented. A heuristic algorithm based on a greedy criterion and the linear relaxation algorithm are designed to solve the model.
The Dual Labor Market Theory: Implications for the Community College.
ERIC Educational Resources Information Center
Nation, William C.
This paper reviews existing manpower training programs in light of the dual labor market theory, and discusses the implications for community colleges in addressing the needs of the unemployed within their service areas. The dual labor market theory postulates that there are two distinct spheres of employment: a primary labor market in which…
An Evaluation of Instructor Qualifications for Teaching Dual Enrollment Classes
ERIC Educational Resources Information Center
Abdul-Karim, Barbara Daaiyah
2010-01-01
This study examined instructor qualifications for teaching dual enrollment students, college-level work. This research focused on Maryland dual enrollment programs that offered both high school and college credit to high school students for each college Associate of Arts and Associate of Science transfer course taken. One significant goal of dual…
Predicting Participation in Dual Language Immersion Using Theory of Planned Behavior
ERIC Educational Resources Information Center
Call, Andrea; Domenech Rodríguez, Melanie M.; Vázquez, Alejandro L.; Corralejo, Samantha M.
2018-01-01
Dual language immersion programs are increasing in popularity. Yet little is known about what motivates parents to enroll their children in dual language immersion. The theory of planned behavior posits that behavior is based on attitudes, subjective norms, and perceived behavioral control. The current study was an exploratory evaluation of the…
Applying heuristic evaluation to improve the usability of a telemedicine system.
Tang, Zhihua; Johnson, Todd R; Tindall, R Douglas; Zhang, Jiajie
2006-02-01
The development of a telemedicine system should not only take advantage of technological advances but also pay close attention to users and the human issues involved. In this paper we examine the utility of heuristic evaluation in improving the usability of a digital emergency medical services (EMS) system equipped on an ambulance. The digital EMS system used advanced communication technologies to help remotely located trauma specialists gain access to patient data in real-time and direct life-saving measures in a timely fashion. To improve its usability, three experts inspected prototypes of the system according to 14 software usability heuristics. The analyses revealed information on the prevalence, severity, and nature of heuristic violations in the user interface design. The results were subsequently utilized to guide the iterative software design process. A comparison between two consecutive prototypes showed that the second design had only half as many usability violations as the first prototype and had considerable improvement in a number of usability heuristic categories. The validity of heuristic evaluation was examined in an ethnographic study of paramedics using a prototype of the system in their work environment. Users' task performances partially verified heuristic evaluation results. However, they also revealed problems that were not identified in heuristic evaluation but only became prominent during field observation. In conclusion, we argue that usability should be given high priority in the development of a telemedicine system, and that heuristic evaluation can be an effective and efficient way to identify usability problems in the early stage of software development.
Climate adaptation heuristics and the science/policy divide
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
ERIC Educational Resources Information Center
Horn, Aaron S.; Reinert, Leah; Jang, Sung Tae; Zinth, Jennifer Dounay
2016-01-01
As dual enrollment programs continue to expand, a critical challenge is to ensure that the quality of such courses offered in high schools is equivalent to the quality of courses taught in postsecondary institutions. Standards for faculty qualifications have historically constituted one facet of efforts to regulate educational quality, and thus…
ERIC Educational Resources Information Center
Cridland, Elizabeth K.; Deane, Frank P.; Hsu, Ching-I; Kelly, Peter J.
2012-01-01
The co-occurrence of substance use and mental health problems, often referred to as dual diagnosis (DD), is increasingly recognised as commonplace within substance abuse treatment programs. Two-hundred and thirty-four individuals from 9 Australian Salvation Army drug and alcohol rehabilitation programs completed a 3-month post-discharge telephone…
Meaning Making and Translanguaging in a Two-Way Dual-Language Program on the U.S.-Mexico Border
ERIC Educational Resources Information Center
Esquinca, Alberto; Araujo, Blanca; de la Piedra, María Teresa
2014-01-01
The article analyzes meaning-making practices in a two-way dual-language (TWDL) program on the U.S.-Mexico border among "transfronterizo" and Mexican-origin youth. In the article, we show that emergent bilingual learners and their teacher participate in activities that mediate understanding of science content knowledge. We show how the…
ERIC Educational Resources Information Center
Brown, DiAnn; Gaar, Sara J.
This final report describes activities and accomplishments of Alaska's 3-year program on services for children and youth with dual sensory impairments. The project provided technical assistance to local education agencies, infant learning programs, and other educators. It also provided support and training to families of children with…
Exploring the Influence of 21st Century Skills in a Dual Language Program: A Case Study
ERIC Educational Resources Information Center
Heinrichs, Christine R.
2016-01-01
Preparing students as 21st century learners is a key reform in education. The Partnership for 21st Century Skills developed a framework that identifies outcomes needed for successful implementation of rigorous standards. The Dual Language (DL) program was identified as a structure for reform with systems and practices which can be used to prepare…
ERIC Educational Resources Information Center
Smith, Andrea Christine
2010-01-01
Students at the National College of Natural Medicine (NCNM) are eligible to concurrently study both Western medicine, as reflected by the Doctor of Naturopathic Medicine (ND) program, and Eastern medicine, as exhibited by the Master of Science in Oriental Medicine (MSOM) degree program. The dual track is unique in that the dominant Western…
ERIC Educational Resources Information Center
Shih, Ching-Hsiang; Chung, Chiao-Chen; Chiang, Ming-Shan; Shih, Ching-Tien
2010-01-01
This study evaluated whether two persons with developmental disabilities would be able to improve their pointing performance through a Dual Cursor Automatic Pointing Assistive Program (DCAPAP) with a newly developed mouse driver (i.e., a new mouse driver replaces standard mouse driver, and is able to intercept/detect mouse movement action). First,…
ERIC Educational Resources Information Center
Cowan, James; Goldhaber, Dan
2014-01-01
We study a popular dual enrollment program in Washington State, "Running Start" using a new administrative database that links high school and postsecondary data. Conditional on prior high school performance, we find that students participating in Running Start are more likely to attend any college but less likely to attend four-year…
ERIC Educational Resources Information Center
US Department of Health and Human Services, 2016
2016-01-01
The purpose of this policy statement is to support early childhood programs and States by providing recommendations that promote the development and learning of young children, birth to age five, who are dual language learners (DLLs). The statement also provides support to tribal communities in their language revitalization efforts within tribal…
Social Work and Public Health: Comparing Graduates from a Dual-Degree Program
ERIC Educational Resources Information Center
Ruth, Betty J.; Wyatt, Jamie; Chiasson, Emily; Geron, Scott Miyake; Bachman, Sally
2006-01-01
This study compared dual-degree master of social work/master of public health (MSW/MPH) and MSW-only graduates with 3 or more years of postgraduate experience. Thirty graduates from an MSW/MPH program were matched with 30 MSW-only graduates. All subjects were randomly selected from the alumni directory and interviewed via telephone. Results showed…
ERIC Educational Resources Information Center
Tinsley, Helen M.
2017-01-01
The purpose of this qualitative, narrative inquiry was to explore and analyze the narrative stories of native English speaking adults who matriculated through a multicultural, dual language program from prekindergarten to 6th grade to understand the influence of the program on their lives, and the relationship between those experiences and their…
Complex Chemical Reaction Networks from Heuristics-Aided Quantum Chemistry.
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.
HEURISTIC OPTIMIZATION AND ALGORITHM TUNING APPLIED TO SORPTIVE BARRIER DESIGN
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 ...
BOLD response to semantic and syntactic processing during hypoglycemia is load-dependent.
Schafer, Robin J; Page, Kathleen A; Arora, Jagriti; Sherwin, Robert; Constable, R Todd
2012-01-01
This study investigates how syntactic and semantic load factors impact sentence comprehension and BOLD signal under moderate hypoglycemia. A dual session, whole brain fMRI study was conducted on 16 healthy participants using the glucose clamp technique. In one session, they experienced insulin-induced hypoglycemia (plasma glucose at ∼50mg/dL); in the other, plasma glucose was maintained at euglycemic levels (∼100mg/dL). During scans subjects were presented with sentences of contrasting syntactic (embedding vs. conjunction) and semantic (reversibility vs. irreversibility) load. Semantic factors dominated the overall load effects on both performance (p<0.001) and BOLD response (p<0.01, corrected). Differential BOLD signal was observed in frontal, temporal, temporo-parietal and medio-temporal regions. Hypoglycemia and syntactic factors significantly impacted performance (p=0.002) and BOLD response (p<0.01, corrected) in the reversible clause conditions, more extensively in reversible-embedded than in reversible-conjoined clauses. Hypoglycemia resulted in a robust decrease in performance on reversible clauses and exerted attenuating effects on BOLD unselectively across cortical circuits. The dominance of reversibility in all measures underscores the distinction between the syntactic and semantic contrasts. The syntactic is based in a quantitative difference in algorithms interpreting embedded and conjoined structures. We suggest that the semantic is based in a qualitative difference between algorithmic mapping of arguments in reversible clauses and heuristic linking in irreversible clauses. Because heuristics drastically reduce resource demand, the operations they support would resist the load-dependent cognitive consequences of hypoglycemia. © 2011 Elsevier Inc. All rights reserved.
Education and Thinking: The Role of Knowledge
1983-06-21
failing to construct a representation of the problem. Through carefully designed problem " exercises , the program elicits procedures for reasoning and...guiding spirits. Polya -. .,• . . .. ~ -, • ° -. -- , ",r , • , , . . .. • . . , . .-r. Page9 9 recommends that explicit attention be paid to heuristic...reflects, according to Carey, a reorganization of knowledge brought about by school learning and world knowledge: for 4- to 7-year olds, biological
2009-05-27
should not be interpreted as representing the official policies, either expressed or implied, of the Defence Advanced Research Project Agency or the... neurobiological interpretation of E-states? 36 8.5 The statistical molecular dynamics of E-states 37 8.6 The C++ program EPMM 40 9 Promising...have an intuitive link between E-machines and neural networks. Such a link provides a source of neurobiological heuristic considerations for the design
Simulation Experiments with Goal-Seeking Adaptive Elements.
1984-02-01
when it comes to cognition and particularly bad when it comes to remote sensing, goal seeking, adaptation and decision making, where brains excel. In...Erlbaum 1981, 161-187 Hinton, G. E., & Sejnowski, T. J. Analyzing Cooperative Computation. Proceedings of the Fifth Annual Conference of the Cognitive ...Algorithms and Applications. Springer-Verlag, 1981. Lenat, D. B., Hayes-Roth, F., Klahr, P. Cognitive economy. Stanford Heuristic Program- ming Project HPP
Applying heuristic inquiry to nurse migration from the UK to Australia.
Vafeas, Caroline; Hendricks, Joyce
2017-01-23
Background Heuristic inquiry is a research approach that improves understanding of the essence of an experience. This qualitative method relies on researchers' ability to discover and interpret their own experience while exploring those of others. Aim To present a discussion of heuristic inquiry's methodology and its application to the experience of nurse migration. Discussion The researcher's commitment to the research is central to heuristic inquiry. It is immersive, reflective, reiterative and a personally-affecting method of gathering knowledge. Researchers are acknowledged as the only people who can validate the findings of the research by exploring their own experiences while also examining those of others with the same experiences to truly understand the phenomena being researched. This paper presents the ways in which the heuristic process guides this discovery in relation to traditional research steps. Conclusion Heuristic inquiry is an appropriate method for exploring nurses' experiences of migration because nurse researchers can tell their own stories and it brings understanding of themselves and the phenomenon as experienced by others. Implications for practice Although not a popular method in nursing research, heuristic inquiry offers a depth of exploration and understanding that may not be revealed by other methods.
ERIC Educational Resources Information Center
Caradona, Sally Lynn
2012-01-01
The purpose of this study was to build on the previous work of articulation practices of Virginia's public school divisions and community colleges participating in dual enrollment partnerships, and to understand the role of the community college in initiating, developing, and implementing dual enrollment programs. The primary focus involved…
ERIC Educational Resources Information Center
Palmer, Deborah K.; Martínez, Ramón Antontio; Mateus, Suzanne G.; Henderson, Kathryn
2014-01-01
The policy of strict separation of languages for academic instruction dominates dual language bilingual education programming. This article explores the dynamic bilingual practices of two experienced bilingual teachers in a two-way dual language public school in Texas and contributes to current research problematizing language separation. Data…
Translanguaging and Positioning in Two-Way Dual Language Classrooms: A Case for Criticality
ERIC Educational Resources Information Center
Hamman, Laura
2018-01-01
This article examines the role of translanguaging practices and pedagogies in two-way dual language classrooms. Much of the recent expansion of dual language programs across the US has occurred in mid-sized cities and rural communities where English monolingualism is the norm; however, the extant literature on flexible language practices in…
ERIC Educational Resources Information Center
Rodriguez, Olga; Hughes, Katherine L.; Belfield, Clive
2012-01-01
The Concurrent Courses Initiative (CCI), funded by The James Irvine Foundation from 2008 until 2011, comprised eight secondary/postsecondary partnerships across California that offered dual enrollment programs with supplemental student supports. The goal of the CCI was to expand access to supportive, career-focused dual enrollment for students…
Smooth Constrained Heuristic Optimization of a Combinatorial Chemical Space
2015-05-01
ARL-TR-7294•MAY 2015 US Army Research Laboratory Smooth ConstrainedHeuristic Optimization of a Combinatorial Chemical Space by Berend Christopher...7294•MAY 2015 US Army Research Laboratory Smooth ConstrainedHeuristic Optimization of a Combinatorial Chemical Space by Berend Christopher...
Heuristic approach to Satellite Range Scheduling with Bounds using Lagrangian Relaxation.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Brown, Nathanael J. K.; Arguello, Bryan; Nozick, Linda Karen
This paper focuses on scheduling antennas to track satellites using a heuristic method. In order to validate the performance of the heuristic, bounds are developed using Lagrangian relaxation. The performance of the algorithm is established using several illustrative problems.
Neural basis of scientific innovation induced by heuristic prototype.
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.
Neural Basis of Scientific Innovation Induced by Heuristic Prototype
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
Path Finding for Maximum Value of Information in Multi-Modal Underwater Wireless Sensor Networks
DOE Office of Scientific and Technical Information (OSTI.GOV)
Gjanci, Petrika; Petrioli, Chiara; Basagni, Stefano
Here, we consider underwater multi-modal wireless sensor networks (UWSNs) suitable for applications on submarine surveillance and monitoring, where nodes offload data to a mobile autonomous underwater vehicle (AUV) via optical technology, and coordinate using acoustic communication. Sensed data are associated with a value, decaying in time. In this scenario, we address the problem of finding the path of the AUV so that the Value of Information (VoI) of the data delivered to a sink on the surface is maximized. We define a Greedy and Adaptive AUV Path-finding (GAAP) heuristic that drives the AUV to collect data from nodes depending onmore » the VoI of their data. For benchmarking the performance of AUV path-finding heuristics, we define an integer linear programming (ILP) formulation that accurately models the considered scenario, deriving a path that drives the AUV to collect and deliver data with the maximum VoI. In our experiments GAAP consistently delivers more than 80 percent of the theoretical maximum VoI determined by the ILP model. We also compare the performance of GAAP with that of other strategies for driving the AUV among sensing nodes, namely, random paths, TSP-based paths and a “lawn mower”-like strategy. Our results show that GAAP always outperforms every other heuristic in terms of delivered VoI, also obtaining higher energy efficiency.« less
Path Finding for Maximum Value of Information in Multi-Modal Underwater Wireless Sensor Networks
Gjanci, Petrika; Petrioli, Chiara; Basagni, Stefano; ...
2017-05-19
Here, we consider underwater multi-modal wireless sensor networks (UWSNs) suitable for applications on submarine surveillance and monitoring, where nodes offload data to a mobile autonomous underwater vehicle (AUV) via optical technology, and coordinate using acoustic communication. Sensed data are associated with a value, decaying in time. In this scenario, we address the problem of finding the path of the AUV so that the Value of Information (VoI) of the data delivered to a sink on the surface is maximized. We define a Greedy and Adaptive AUV Path-finding (GAAP) heuristic that drives the AUV to collect data from nodes depending onmore » the VoI of their data. For benchmarking the performance of AUV path-finding heuristics, we define an integer linear programming (ILP) formulation that accurately models the considered scenario, deriving a path that drives the AUV to collect and deliver data with the maximum VoI. In our experiments GAAP consistently delivers more than 80 percent of the theoretical maximum VoI determined by the ILP model. We also compare the performance of GAAP with that of other strategies for driving the AUV among sensing nodes, namely, random paths, TSP-based paths and a “lawn mower”-like strategy. Our results show that GAAP always outperforms every other heuristic in terms of delivered VoI, also obtaining higher energy efficiency.« less
A hybrid heuristic for the multiple choice multidimensional knapsack problem
NASA Astrophysics Data System (ADS)
Mansi, Raïd; Alves, Cláudio; Valério de Carvalho, J. M.; Hanafi, Saïd
2013-08-01
In this article, a new solution approach for the multiple choice multidimensional knapsack problem is described. The problem is a variant of the multidimensional knapsack problem where items are divided into classes, and exactly one item per class has to be chosen. Both problems are NP-hard. However, the multiple choice multidimensional knapsack problem appears to be more difficult to solve in part because of its choice constraints. Many real applications lead to very large scale multiple choice multidimensional knapsack problems that can hardly be addressed using exact algorithms. A new hybrid heuristic is proposed that embeds several new procedures for this problem. The approach is based on the resolution of linear programming relaxations of the problem and reduced problems that are obtained by fixing some variables of the problem. The solutions of these problems are used to update the global lower and upper bounds for the optimal solution value. A new strategy for defining the reduced problems is explored, together with a new family of cuts and a reformulation procedure that is used at each iteration to improve the performance of the heuristic. An extensive set of computational experiments is reported for benchmark instances from the literature and for a large set of hard instances generated randomly. The results show that the approach outperforms other state-of-the-art methods described so far, providing the best known solution for a significant number of benchmark instances.
Analysis of a generalized dual reflector antenna system using physical optics
NASA Technical Reports Server (NTRS)
Acosta, Roberto J.; Lagin, Alan R.
1992-01-01
Reflector antennas are widely used in communication satellite systems because they provide high gain at low cost. Offset-fed single paraboloids and dual reflector offset Cassegrain and Gregorian antennas with multiple focal region feeds provide a simple, blockage-free means of forming multiple, shaped, and isolated beams with low sidelobes. Such antennas are applicable to communications satellite frequency reuse systems and earth stations requiring access to several satellites. While the single offset paraboloid has been the most extensively used configuration for the satellite multiple-beam antenna, the trend toward large apertures requiring minimum scanned beam degradation over the field of view 18 degrees for full earth coverage from geostationary orbit may lead to impractically long focal length and large feed arrays. Dual reflector antennas offer packaging advantages and more degrees of design freedom to improve beam scanning and cross-polarization properties. The Cassegrain and Gregorian antennas are the most commonly used dual reflector antennas. A computer program for calculating the secondary pattern and directivity of a generalized dual reflector antenna system was developed and implemented at LeRC. The theoretical foundation for this program is based on the use of physical optics methodology for describing the induced currents on the sub-reflector and main reflector. The resulting induced currents on the main reflector are integrated to obtain the antenna far-zone electric fields. The computer program is verified with other physical optics programs and with measured antenna patterns. The comparison shows good agreement in far-field sidelobe reproduction and directivity.
NASA Astrophysics Data System (ADS)
Shiangjen, Kanokwatt; Chaijaruwanich, Jeerayut; Srisujjalertwaja, Wijak; Unachak, Prakarn; Somhom, Samerkae
2018-02-01
This article presents an efficient heuristic placement algorithm, namely, a bidirectional heuristic placement, for solving the two-dimensional rectangular knapsack packing problem. The heuristic demonstrates ways to maximize space utilization by fitting the appropriate rectangle from both sides of the wall of the current residual space layer by layer. The iterative local search along with a shift strategy is developed and applied to the heuristic to balance the exploitation and exploration tasks in the solution space without the tuning of any parameters. The experimental results on many scales of packing problems show that this approach can produce high-quality solutions for most of the benchmark datasets, especially for large-scale problems, within a reasonable duration of computational time.
It looks easy! Heuristics for combinatorial optimization problems.
Chronicle, Edward P; MacGregor, James N; Ormerod, Thomas C; Burr, Alistair
2006-04-01
Human performance on instances of computationally intractable optimization problems, such as the travelling salesperson problem (TSP), can be excellent. We have proposed a boundary-following heuristic to account for this finding. We report three experiments with TSPs where the capacity to employ this heuristic was varied. In Experiment 1, participants free to use the heuristic produced solutions significantly closer to optimal than did those prevented from doing so. Experiments 2 and 3 together replicated this finding in larger problems and demonstrated that a potential confound had no effect. In all three experiments, performance was closely matched by a boundary-following model. The results implicate global rather than purely local processes. Humans may have access to simple, perceptually based, heuristics that are suited to some combinatorial optimization tasks.
An O({radical}nL) primal-dual affine scaling algorithm for linear programming
DOE Office of Scientific and Technical Information (OSTI.GOV)
Huang, Siming
1994-12-31
We present a new primal-dual affine scaling algorithm for linear programming. The search direction of the algorithm is a combination of classical affine scaling direction of Dikin and a recent new affine scaling direction of Jansen, Roos and Terlaky. The algorithm has an iteration complexity of O({radical}nL), comparing to O(nL) complexity of Jansen, Roos and Terlaky.
Dual Mission Scenarios for the Human Lunar Campaign - Performance, Cost and Risk Benefits
NASA Technical Reports Server (NTRS)
Saucillo, Rudolph J.; Reeves, David M.; Chrone, Jonathan D.; Stromgren, Chel; Reeves, John D.; North, David D.
2008-01-01
Scenarios for human lunar operations with capabilities significantly beyond Constellation Program baseline missions are potentially feasible based on the concept of dual, sequential missions utilizing a common crew and a single Ares I/CEV (Crew Exploration Vehicle). For example, scenarios possible within the scope of baseline technology planning include outpost-based sortie missions and dual sortie missions. Top level cost benefits of these dual sortie scenarios may be estimated by comparison to the Constellation Program reference two-mission-per-year lunar campaign. The primary cost benefit is the accomplishment of Mission B with a "single launch solution" since no Ares I launch is required. Cumulative risk to the crew is lowered since crew exposure to launch risks and Earth return risks are reduced versus comparable Constellation Program reference two-mission-per-year scenarios. Payload-to-the-lunar-surface capability is substantially increased in the Mission B sortie as a result of additional propellant available for Lunar Lander #2 descent. This additional propellant is a result of EDS #2 transferring a smaller stack through trans-lunar injection and using remaining propellant to perform a portion of the lunar orbit insertion (LOI) maneuver. This paper describes these dual mission concepts, including cost, risk and performance benefits per lunar sortie site, and provides an initial feasibility assessment.
A Symposium on Heuristic Teaching.
ERIC Educational Resources Information Center
Snow, Richard E., Ed.
In order to explore diverse philosophical, psychological, and pedagogical views on the concept of heuristic teaching and the question whether basic teaching skills can be "content free," a symposium on the subject of heuristic teaching was organized with resource papers being requested from scholars representing several disciplines and…
Heuristic errors in clinical reasoning.
Rylander, Melanie; Guerrasio, Jeannette
2016-08-01
Errors in clinical reasoning contribute to patient morbidity and mortality. The purpose of this study was to determine the types of heuristic errors made by third-year medical students and first-year residents. This study surveyed approximately 150 clinical educators inquiring about the types of heuristic errors they observed in third-year medical students and first-year residents. Anchoring and premature closure were the two most common errors observed amongst third-year medical students and first-year residents. There was no difference in the types of errors observed in the two groups. Errors in clinical reasoning contribute to patient morbidity and mortality Clinical educators perceived that both third-year medical students and first-year residents committed similar heuristic errors, implying that additional medical knowledge and clinical experience do not affect the types of heuristic errors made. Further work is needed to help identify methods that can be used to reduce heuristic errors early in a clinician's education. © 2015 John Wiley & Sons Ltd.
NASA Astrophysics Data System (ADS)
Wahid, Juliana; Hussin, Naimah Mohd
2016-08-01
The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution. This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions. The graph heuristics were set as single and combination of two heuristics. In addition, several ways of assigning courses into room and timeslot are implemented. All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced. The result shows that combination of saturation degree followed by largest degree heuristic produce the highest number of population of initial solutions. The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions.
The power of simplicity: a fast-and-frugal heuristics approach to performance science.
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.
The power of simplicity: a fast-and-frugal heuristics approach to performance science
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
Array distribution in data-parallel programs
NASA Technical Reports Server (NTRS)
Chatterjee, Siddhartha; Gilbert, John R.; Schreiber, Robert; Sheffler, Thomas J.
1994-01-01
We consider distribution at compile time of the array data in a distributed-memory implementation of a data-parallel program written in a language like Fortran 90. We allow dynamic redistribution of data and define a heuristic algorithmic framework that chooses distribution parameters to minimize an estimate of program completion time. We represent the program as an alignment-distribution graph. We propose a divide-and-conquer algorithm for distribution that initially assigns a common distribution to each node of the graph and successively refines this assignment, taking computation, realignment, and redistribution costs into account. We explain how to estimate the effect of distribution on computation cost and how to choose a candidate set of distributions. We present the results of an implementation of our algorithms on several test problems.
Federal Register 2010, 2011, 2012, 2013, 2014
2013-04-18
... Basic Impulse Level 4. Dual/Multiple-Voltage Primary Windings 5. Dual/Multiple-Voltage Secondary Windings 6. Loading B. Technological Feasibility 1. General 2. Maximum Technologically Feasible Levels C...
Program Model Checking: A Practitioner's Guide
NASA Technical Reports Server (NTRS)
Pressburger, Thomas T.; Mansouri-Samani, Masoud; Mehlitz, Peter C.; Pasareanu, Corina S.; Markosian, Lawrence Z.; Penix, John J.; Brat, Guillaume P.; Visser, Willem C.
2008-01-01
Program model checking is a verification technology that uses state-space exploration to evaluate large numbers of potential program executions. Program model checking provides improved coverage over testing by systematically evaluating all possible test inputs and all possible interleavings of threads in a multithreaded system. Model-checking algorithms use several classes of optimizations to reduce the time and memory requirements for analysis, as well as heuristics for meaningful analysis of partial areas of the state space Our goal in this guidebook is to assemble, distill, and demonstrate emerging best practices for applying program model checking. We offer it as a starting point and introduction for those who want to apply model checking to software verification and validation. The guidebook will not discuss any specific tool in great detail, but we provide references for specific tools.
van der Linden, Sander
2014-01-01
Examining the conceptual relationship between personal experience, affect, and risk perception is crucial in improving our understanding of how emotional and cognitive process mechanisms shape public perceptions of climate change. This study is the first to investigate the interrelated nature of these variables by contrasting three prominent social-psychological theories. In the first model, affect is viewed as a fast and associative information processing heuristic that guides perceptions of risk. In the second model, affect is seen as flowing from cognitive appraisals (i.e., affect is thought of as a post-cognitive process). Lastly, a third, dual-process model is advanced that integrates aspects from both theoretical perspectives. Four structural equation models were tested on a national sample (N = 808) of British respondents. Results initially provide support for the “cognitive” model, where personal experience with extreme weather is best conceptualized as a predictor of climate change risk perception and, in turn, risk perception a predictor of affect. Yet, closer examination strongly indicates that at the same time, risk perception and affect reciprocally influence each other in a stable feedback system. It is therefore concluded that both theoretical claims are valid and that a dual-process perspective provides a superior fit to the data. Implications for theory and risk communication are discussed. © 2014 The Authors. European Journal of Social Psychology published by John Wiley & Sons, Ltd. PMID:25678723
Hayes, Brett K; Stephens, Rachel G; Ngo, Jeremy; Dunn, John C
2018-02-01
Three-experiments examined the number of qualitatively different processing dimensions needed to account for inductive and deductive reasoning. In each study, participants were presented with arguments that varied in logical validity and consistency with background knowledge (believability), and evaluated them according to deductive criteria (whether the conclusion was necessarily true given the premises) or inductive criteria (whether the conclusion was plausible given the premises). We examined factors including working memory load (Experiments 1 and 2), individual working memory capacity (Experiments 1 and 2), and decision time (Experiment 3), which according to dual-processing theories, modulate the contribution of heuristic and analytic processes to reasoning. A number of empirical dissociations were found. Argument validity affected deduction more than induction. Argument believability affected induction more than deduction. Lower working memory capacity reduced sensitivity to argument validity and increased sensitivity to argument believability, especially under induction instructions. Reduced decision time led to decreased sensitivity to argument validity. State-trace analyses of each experiment, however, found that only a single underlying dimension was required to explain patterns of inductive and deductive judgments. These results show that the dissociations, which have traditionally been seen as supporting dual-processing models of reasoning, are consistent with a single-process model that assumes a common evidentiary scale for induction and deduction. (PsycINFO Database Record (c) 2018 APA, all rights reserved).
DOE Office of Scientific and Technical Information (OSTI.GOV)
Preston, Benjamin L.; Mustelin, Johanna; Maloney, Megan C.
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
Internal Medicine residents use heuristics to estimate disease probability.
Phang, Sen Han; Ravani, Pietro; Schaefer, Jeffrey; Wright, Bruce; McLaughlin, Kevin
2015-01-01
Training in Bayesian reasoning may have limited impact on accuracy of probability estimates. In this study, our goal was to explore whether residents previously exposed to Bayesian reasoning use heuristics rather than Bayesian reasoning to estimate disease probabilities. We predicted that if residents use heuristics then post-test probability estimates would be increased by non-discriminating clinical features or a high anchor for a target condition. We randomized 55 Internal Medicine residents to different versions of four clinical vignettes and asked them to estimate probabilities of target conditions. We manipulated the clinical data for each vignette to be consistent with either 1) using a representative heuristic, by adding non-discriminating prototypical clinical features of the target condition, or 2) using anchoring with adjustment heuristic, by providing a high or low anchor for the target condition. When presented with additional non-discriminating data the odds of diagnosing the target condition were increased (odds ratio (OR) 2.83, 95% confidence interval [1.30, 6.15], p = 0.009). Similarly, the odds of diagnosing the target condition were increased when a high anchor preceded the vignette (OR 2.04, [1.09, 3.81], p = 0.025). Our findings suggest that despite previous exposure to the use of Bayesian reasoning, residents use heuristics, such as the representative heuristic and anchoring with adjustment, to estimate probabilities. Potential reasons for attribute substitution include the relative cognitive ease of heuristics vs. Bayesian reasoning or perhaps residents in their clinical practice use gist traces rather than precise probability estimates when diagnosing.
The Probability Heuristics Model of Syllogistic Reasoning.
ERIC Educational Resources Information Center
Chater, Nick; Oaksford, Mike
1999-01-01
Proposes a probability heuristic model for syllogistic reasoning and confirms the rationality of this heuristic by an analysis of the probabilistic validity of syllogistic reasoning that treats logical inference as a limiting case of probabilistic inference. Meta-analysis and two experiments involving 40 adult participants and using generalized…
Cacchione, Pamela Z; Eible, Lisa; Gill, Le'Roi L; Huege, Steven F
2016-05-01
Providing person-centered care (PCC) to older adults with dual diagnosis, co-occurring serious mental illness (SMI), and substance misuse is complex and requires an interprofessional team. Older adults, who qualify for both Medicaid and Medicare (i.e., dual-eligibles) are overrepresented in the population of older adults with SMI and substance misuse. Programs of All-Inclusive Care for the Elderly (PACE) exist to support community living needs of nursing home-eligible older adults and are increasingly in a position to serve older adults with SMI and substance misuse issues. PACE programs provide integrated person-centered mental health care to address the serious medical, social, and emotional complications posed by having SMI and substance misuse disorders. The case study presented illustrates PCC provided to a dual-diagnosis PACE participant, illustrating the impact of recent and past trauma on current psychopathology and substance misuse. Finally, recommendations for addressing PCC of dual diagnosis within the PACE model are provided. [Journal of Gerontological Nursing, 42(5), 11-17.]. Copyright 2016, SLACK Incorporated.
Costs and energy efficiency of a dual-mode system
NASA Technical Reports Server (NTRS)
Heft, R. C.
1977-01-01
The life cycle costs of a dual mode system for both public and semiprivate ownership are examined, and the costs in terms of levelized required revenue per passenger mile are presented. The energy use of the dual mode vehicle is analyzed by means of a detailed vehicle simulation program for the control policy and guideway system. Several different propulsion systems are considered.
The Dual System of Vocational Training in Germany. BASIS-INFO 11-1995. Social Policy.
ERIC Educational Resources Information Center
Kraemer, Dagmar
The dual system of vocational training is a joint government-industry program and part of the general educational system in Germany. It provides hands-on training in private businesses coupled with specialized instruction in public vocational schools at no cost to students. The objective of the dual system is to provide young people with the best…
Dual Enrollment in Maryland and Baltimore City: An Examination of Program Components and Design
ERIC Educational Resources Information Center
Sunderman, Gail L.
2017-01-01
Maryland's College and Career Act of 2013 recognized the potential of dual enrollment and called for the expansion of it in the state. According to a December 2016 report to the Maryland General Assembly, however, only 2% of Baltimore City public 12th grade students participated in dual enrollment opportunities in 2015 as compared with a state…
ERIC Educational Resources Information Center
Howes, Carollee, Ed.; Downer, Jason T., Ed.; Pianta, Robert C., Ed.
2011-01-01
The school readiness of young dual language learners depends on high-quality preschool programs that meet their needs--but how should schools promote and measure the progress of children learning two languages? Find out what the research says in this authoritative resource, which investigates the experiences of dual language learners in preschool…
ERIC Educational Resources Information Center
Wang, Xueli; Chan, Hsun-yu; Phelps, L. Allen; Washbon, Janet I.
2015-01-01
Objective: Despite the fairly substantial body of literature devoted to understanding whether dual enrollment programs are related to academic success in college, less is known regarding how dual enrollment transmits its potentially positive influence, especially among two-year college students. In this study, we fill this gap by delving into the…
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 &…
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…
A Priori Knowledge and Heuristic Reasoning in Architectural Design.
ERIC Educational Resources Information Center
Rowe, Peter G.
1982-01-01
It is proposed that the various classes of a priori knowledge incorporated in heuristic reasoning processes exert a strong influence over architectural design activity. Some design problems require exercise of some provisional set of rules, inference, or plausible strategy which requires heuristic reasoning. A case study illustrates this concept.…
An heuristic for the study of the effects of emotion on memory.
Whissell, C
1991-02-01
This report contains an heuristic (a systematic set of questions) addressing issues of concern in the emotion-memory literature. Four experiments (ns of 73, 24, 160, and 34) are described in terms of the heuristic and its potential for describing the literature is examined.
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.
Impact of heuristics in clustering large biological networks.
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. Copyright © 2015 Elsevier Ltd. All rights reserved.
The Priority Heuristic: Making Choices Without Trade-Offs
Brandstätter, Eduard; Gigerenzer, Gerd; Hertwig, Ralph
2010-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, we generalize the framework of fast and frugal heuristics from inferences to preferences. The priority heuristic predicts (i) Allais' paradox, (ii) risk aversion for gains if probabilities are high, (iii) risk seeking for gains if probabilities are low (lottery tickets), (iv) risk aversion for losses if probabilities are low (buying insurance), (v) risk seeking for losses if probabilities are high, (vi) certainty effect, (vii) possibility effect, and (viii) intransitivities. We test how accurately the heuristic predicts people's choices, compared to previously proposed heuristics and three modifications of expected utility theory: security-potential/aspiration theory, transfer-of-attention-exchange model, and cumulative prospect theory. PMID:16637767
Heuristic and algorithmic processing in English, mathematics, and science education.
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.
Using heuristic evaluations to assess the safety of health information systems.
Carvalho, Christopher J; Borycki, Elizabeth M; Kushniruk, Andre W
2009-01-01
Health information systems (HISs) are typically seen as a mechanism for reducing medical errors. There is, however, evidence to prove that technology may actually be the cause of errors. As a result, it is crucial to fully test any system prior to its implementation. At present, evidence-based evaluation heuristics do not exist for assessing aspects of interface design that lead to medical errors. A three phase study was conducted to develop evidence-based heuristics for evaluating interfaces. Phase 1 consisted of a systematic review of the literature. In Phase 2 a comprehensive list of 33 evaluation heuristics was developed based on the review that could be used to test for potential technology induced errors. Phase 3 involved applying these healthcare specific heuristics to evaluate a HIS.
New insights into diversification of hyper-heuristics.
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.
Birnbaum, Michael H
2008-01-01
E. Brandstätter, G. Gigerenzer, and R. Hertwig (2006) contended that their priority heuristic, a type of lexicographic semiorder model, is more accurate than cumulative prospect theory (CPT) or transfer of attention exchange (TAX) models in describing risky decisions. However, there are 4 problems with their argument. First, their heuristic is not descriptive of certain data that they did not review. Second, their analysis relied on a global index of fit, percentage of correct predictions of the modal choice. Such analyses can lead to wrong conclusions when parameters are not properly estimated from the data. When parameters are estimated from the data, CPT and TAX fit the D. Kahneman and A. Tversky (1979) data perfectly. Reanalysis shows that TAX and CPT do as well as the priority heuristic for 2 of the data sets reviewed and outperform the priority heuristic for the other 3. Third, when 2 of these sets of data are reexamined, the priority heuristic is seen to make systematic violations. Fourth, new critical implications have been devised for testing the family of lexicographic semiorders including the priority heuristic; new results with these critical tests show systematic evidence against lexicographic semiorder models. (c) 2008 APA, all rights reserved
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.
DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.
Wehe, André; Bansal, Mukul S; Burleigh, J Gordon; Eulenstein, Oliver
2008-07-01
DupTree is a new software program for inferring rooted species trees from collections of gene trees using the gene tree parsimony approach. The program implements a novel algorithm that significantly improves upon the run time of standard search heuristics for gene tree parsimony, and enables the first truly genome-scale phylogenetic analyses. In addition, DupTree allows users to examine alternate rootings and to weight the reconciliation costs for gene trees. DupTree is an open source project written in C++. DupTree for Mac OS X, Windows, and Linux along with a sample dataset and an on-line manual are available at http://genome.cs.iastate.edu/CBL/DupTree
DOE Office of Scientific and Technical Information (OSTI.GOV)
Gosnell, Thomas B.; Chavez, Joseph R.; Rowland, Mark S.
2014-02-26
RadID is a new gamma-ray spectrum analysis program for rapid screening of HPGe gamma-ray data to reveal the presence of radionuclide signatures. It is an autonomous, rule-based heuristic system that can identify well over 200 radioactive sources with particular interest in uranium and plutonium characteristics. It executes in about one second. RadID does not require knowledge of the detector efficiency, the source-to-detector distance, or the geometry of the inspected radiation source—including any shielding. In this first of a three-document series we sketch the RadID program’s origin, its minimal requirements, the user experience, and the program operation.
Kane, Robert L; Wysocki, Andrea; Parashuram, Shriram; Shippee, Tetyana; Lum, Terry
2013-01-01
Background: Dual eligible Medicare and Medicaid beneficiaries consume disproportionate shares of both programs. Objectives: To compare Medicare and Medicaid expenditures of elderly dual eligible beneficiaries with non-dual eligible beneficiaries based on their long-term care (LTC) use. Research Design: Secondary analysis of linked MAX and Medicare data in seven states. Subjects: Dual eligible adults (65+) receiving LTC in institutions, in the community, or not at all; and Medicare non-dual eligibles. Measures: Medicaid acute medical and LTC expenditures per beneficiary year, Medicare expenditures. Results: Among dual eligibles and non-dual eligibles, the average number of diseases and case mix scores are higher for LTC users. Adjusting for case mix virtually eliminates the difference for medical costs, but not for LTC expenditures. Adjusting for LTC status reduces the difference in LTC costs, but increases the difference in medical costs. Conclusions: Efforts to control costs for dual eligibles should target those in LTC while better coordinating medical and LTC expenditures. PMID:24753971
Barnett, Jason; Watson, Jean -Paul; Woodruff, David L.
2016-11-27
Progressive hedging, though an effective heuristic for solving stochastic mixed integer programs (SMIPs), is not guaranteed to converge in this case. Here, we describe BBPH, a branch and bound algorithm that uses PH at each node in the search tree such that, given sufficient time, it will always converge to a globally optimal solution. Additionally, to providing a theoretically convergent “wrapper” for PH applied to SMIPs, computational results demonstrate that for some difficult problem instances branch and bound can find improved solutions after exploring only a few nodes.
The Newell Test Should Commit to Diagnosing Dysfunctions
NASA Technical Reports Server (NTRS)
Clancey, William J.
2003-01-01
"Conceptual coordination" analysis bridges connectionism and symbolic approaches by posting a "process memory" by which categories are physically coordinated (as neural networks) in time. Focusing on dysfunctions and odd behaviors like slips reveals the function of consciousness, especially taken-for-granted constructive processes, different from conventional programming constructs. Newell strongly endorsed identifying architectural limits; the heuristic of "diagnose unusual behaviors" will provide targets of opportunity that greatly strengthens the Newell Test.
An Investigation of Mental Coding Mechanisms and Heuristics Used in Electronics Troubleshooting.
1980-04-01
that is, the particular program to be used for the decision making or problem solving exercise at hand. The relationships between LTM, the processor...stimulus input according to previously learned classifications. Norman continued by writing that the encoded information is the material which is stored...the manipulation of algebraic or other mathematical symbols according to the rules embodied in mathematical logic. Once these essentially content free
Chinese-English Automation and Computer Technology Dictionary, Volume 2.
1980-08-01
The purpose of the series is to provide rapid reference tools for translators, abstractors, and research analysts concerned with scientific and...tansuo search; searching; 25 exploration; explore: research ; hunting; trace; seek tansuo dianxian tracer wire 26 884 tansuxd . ., heuristic 01 tansuofa...xunwen -v Ij ;I system interrogation 22 xitong yanjiu A f IC system research 23 xitong yinqyong chengxiud -A, i M 1 R N- #1 , system utility program 24
Routing UAVs to Co-Optimize Mission Effectiveness and Network Performance with Dynamic Programming
2011-03-01
Heuristics on Hexagonal Connected Dominating Sets to Model Routing Dissemination," in Communication Theory, Reliability, and Quality of Service (CTRQ...24] Matthew Capt. USAF Compton, Improving the Quality of Service and Security of Military Networks with a Network Tasking Order Process, 2010. [25...Wesley, 2006. [32] James Haught, "Adaptive Quality of Service Engine with Dynamic Queue Control," Air Force Institute of Technology, Wright
Linking indices for biodiversity monitoring to extinction risk theory.
McCarthy, Michael A; Moore, Alana L; Krauss, Jochen; Morgan, John W; Clements, Christopher F
2014-12-01
Biodiversity indices often combine data from different species when used in monitoring programs. Heuristic properties can suggest preferred indices, but we lack objective ways to discriminate between indices with similar heuristics. Biodiversity indices can be evaluated by determining how well they reflect management objectives that a monitoring program aims to support. For example, the Convention on Biological Diversity requires reporting about extinction rates, so simple indices that reflect extinction risk would be valuable. We developed 3 biodiversity indices that are based on simple models of population viability that relate extinction risk to abundance. We based the first index on the geometric mean abundance of species and the second on a more general power mean. In a third index, we integrated the geometric mean abundance and trend. These indices require the same data as previous indices, but they also relate directly to extinction risk. Field data for butterflies and woodland plants and experimental studies of protozoan communities show that the indices correlate with local extinction rates. Applying the index based on the geometric mean to global data on changes in avian abundance suggested that the average extinction probability of birds has increased approximately 1% from 1970 to 2009. © 2014 The Authors. Conservation Biology published by Wiley Periodicals, Inc., on behalf of the Society for Conservation Biology.
A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model
NASA Astrophysics Data System (ADS)
Küçükaydın, Hande; Aras, Necati; Altınel, I. Kuban
We consider a problem in which a firm or franchise enters a market by locating new facilities where there are existing facilities belonging to a competitor. The firm aims at finding the location and attractiveness of each facility to be opened so as to maximize its profit. The competitor, on the other hand, can react by adjusting the attractiveness of its existing facilities, opening new facilities and/or closing existing ones with the objective of maximizing its own profit. The demand is assumed to be aggregated at certain points in the plane and the facilities of the firm can be located at prespecified candidate sites. We employ Huff's gravity-based rule in modeling the behavior of the customers where the fraction of customers at a demand point that visit a certain facility is proportional to the facility attractiveness and inversely proportional to the distance between the facility site and demand point. We formulate a bilevel mixed-integer nonlinear programming model where the firm entering the market is the leader and the competitor is the follower. In order to find a feasible solution of this model, we develop a hybrid tabu search heuristic which makes use of two exact methods as subroutines: a gradient ascent method and a branch-and-bound algorithm with nonlinear programming relaxation.