WorldWideScience

Sample records for intelligence heuristic search

  1. Heuristic Search Theory and Applications

    CERN Document Server

    Edelkamp, Stefan

    2011-01-01

    Search has been vital to artificial intelligence from the very beginning as a core technique in problem solving. The authors present a thorough overview of heuristic search with a balance of discussion between theoretical analysis and efficient implementation and application to real-world problems. Current developments in search such as pattern databases and search with efficient use of external memory and parallel processing units on main boards and graphics cards are detailed. Heuristic search as a problem solving tool is demonstrated in applications for puzzle solving, game playing, constra

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

    Science.gov (United States)

    1976-07-01

    deficiency . The idea of "Intuitions" facets was a flop. Intuitions were meant to model reality, at least little pieces of it, so that AM could...Discovery in Mathematic, as Heuristic Search -323- s Tk2 ** Check examples of Single-ADD, because many examples have recently been found, but not yet

  3. Intelligent System Design Using Hyper-Heuristics

    Directory of Open Access Journals (Sweden)

    Nelishia Pillay

    2015-07-01

    Full Text Available Determining the most appropriate search method or artificial intelligence technique to solve a problem is not always evident and usually requires implementation of the different approaches to ascertain this. In some instances a single approach may not be sufficient and hybridization of methods may be needed to find a solution. This process can be time consuming. The paper proposes the use of hyper-heuristics as a means of identifying which method or combination of approaches is needed to solve a problem. The research presented forms part of a larger initiative aimed at using hyper-heuristics to develop intelligent hybrid systems. As an initial step in this direction, this paper investigates this for classical artificial intelligence uninformed and informed search methods, namely depth first search, breadth first search, best first search, hill-climbing and the A* algorithm. The hyper-heuristic determines the search or combination of searches to use to solve the problem. An evolutionary algorithm hyper-heuristic is implemented for this purpose and its performance is evaluated in solving the 8-Puzzle, Towers of Hanoi and Blocks World problems. The hyper-heuristic employs a generational evolutionary algorithm which iteratively refines an initial population using tournament selection to select parents, which the mutation and crossover operators are applied to for regeneration. The hyper-heuristic was able to identify a search or combination of searches to produce solutions for the twenty 8-Puzzle, five Towers of Hanoi and five Blocks World problems. Furthermore, admissible solutions were produced for all problem instances.

  4. Efficient heuristics for maximum common substructure search.

    Science.gov (United States)

    Englert, Péter; Kovács, Péter

    2015-05-26

    Maximum common substructure search is a computationally hard optimization problem with diverse applications in the field of cheminformatics, including similarity search, lead optimization, molecule alignment, and clustering. Most of these applications have strict constraints on running time, so heuristic methods are often preferred. However, the development of an algorithm that is both fast enough and accurate enough for most practical purposes is still a challenge. Moreover, in some applications, the quality of a common substructure depends not only on its size but also on various topological features of the one-to-one atom correspondence it defines. Two state-of-the-art heuristic algorithms for finding maximum common substructures have been implemented at ChemAxon Ltd., and effective heuristics have been developed to improve both their efficiency and the relevance of the atom mappings they provide. The implementations have been thoroughly evaluated and compared with existing solutions (KCOMBU and Indigo). The heuristics have been found to greatly improve the performance and applicability of the algorithms. The purpose of this paper is to introduce the applied methods and present the experimental results.

  5. Using heuristic search for optimizing maintenance plans

    International Nuclear Information System (INIS)

    Mutanen, Teemu

    2012-01-01

    This work addresses the maintenance action selection process. Maintenance personnel need to evaluate maintenance actions and costs to keep the machines in working condition. Group of actions are evaluated together as maintenance plans. The maintenance plans as output provide information to the user about which actions to take if any and what future actions should be prepared for. The heuristic search method is implemented as part of general use toolbox for analysis of measurements from movable work machines. Impacts from machine's usage restrictions and maintenance activities are analysed. The results show that once put on a temporal perspective, the prioritized order of the actions is different and provide additional information to the user.

  6. Solving Large Clustering Problems with Meta-Heuristic Search

    DEFF Research Database (Denmark)

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

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

  7. Theory of Randomized Search Heuristics in Combinatorial Optimization

    DEFF Research Database (Denmark)

    The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS), the Metr......The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS...... analysis of randomized algorithms to RSHs. Mostly, the expected runtime of RSHs on selected problems is analzyed. Thereby, we understand why and when RSHs are efficient optimizers and, conversely, when they cannot be efficient. The tutorial will give an overview on the analysis of RSHs for solving...

  8. Search for extraterrestrial intelligence (SETI)

    International Nuclear Information System (INIS)

    Morrison, P.; Billingham, J.; Wolfe, J.

    1977-01-01

    Findings are presented of a series of workshops on the existence of extraterrestrial intelligent life and ways in which extraterrestrial intelligence might be detected. The coverage includes the cosmic and cultural evolutions, search strategies, detection of other planetary systems, alternate methods of communication, and radio frequency interference. 17 references

  9. Heuristic decision model for intelligent nuclear power systems design

    International Nuclear Information System (INIS)

    Nassersharif, B.; Portal, M.G.; Gaeta, M.J.

    1989-01-01

    The objective of this project was to investigate intelligent nuclear power systems design. A theoretical model of the design process has been developed. A fundamental process in this model is the heuristic decision making for design (i.e., selection of methods, components, materials, etc.). Rule-based expert systems do not provide the completeness that is necessary to generate good design. A new method, based on the fuzzy set theory, has been developed and is presented here. A feedwater system knowledge base (KB) was developed for a prototype software experiment to benchmark the theory

  10. Improving the Bin Packing Heuristic through Grammatical Evolution Based on Swarm Intelligence

    Directory of Open Access Journals (Sweden)

    Marco Aurelio Sotelo-Figueroa

    2014-01-01

    Full Text Available In recent years Grammatical Evolution (GE has been used as a representation of Genetic Programming (GP which has been applied to many optimization problems such as symbolic regression, classification, Boolean functions, constructed problems, and algorithmic problems. GE can use a diversity of searching strategies including Swarm Intelligence (SI. Particle Swarm Optimisation (PSO is an algorithm of SI that has two main problems: premature convergence and poor diversity. Particle Evolutionary Swarm Optimization (PESO is a recent and novel algorithm which is also part of SI. PESO uses two perturbations to avoid PSO’s problems. In this paper we propose using PESO and PSO in the frame of GE as strategies to generate heuristics that solve the Bin Packing Problem (BPP; it is possible however to apply this methodology to other kinds of problems using another Grammar designed for that problem. A comparison between PESO, PSO, and BPP’s heuristics is performed through the nonparametric Friedman test. The main contribution of this paper is proposing a Grammar to generate online and offline heuristics depending on the test instance trying to improve the heuristics generated by other grammars and humans; it also proposes a way to implement different algorithms as search strategies in GE like PESO to obtain better results than those obtained by PSO.

  11. Heuristic method for searching global maximum of multimodal unknown function

    Energy Technology Data Exchange (ETDEWEB)

    Kamei, K; Araki, Y; Inoue, K

    1983-06-01

    The method is composed of three kinds of searches. They are called g (grasping)-mode search, f (finding)-mode search and c (confirming)-mode search. In the g-mode search and the c-mode search, a heuristic method is used which was extracted from search behaviors of human subjects. In f-mode search, the simplex method is used which is well known as a search method for unimodal unknown function. Each mode search and its transitions are shown in the form of flowchart. The numerical results for one-dimensional through six-dimensional multimodal functions prove the proposed search method to be an effective one. 11 references.

  12. Complex Sequencing Problems and Local Search Heuristics

    NARCIS (Netherlands)

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

    1996-01-01

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

  13. Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift

    DEFF Research Database (Denmark)

    Lehre, Per Kristian; Witt, Carsten

    2014-01-01

    Drift analysis is one of the state-of-the-art techniques for the runtime analysis of randomized search heuristics (RSHs) such as evolutionary algorithms (EAs), simulated annealing etc. The vast majority of existing drift theorems yield bounds on the expected value of the hitting time for a target...

  14. Heuristics for Relevancy Ranking of Earth Dataset Search Results

    Science.gov (United States)

    Lynnes, Christopher; Quinn, Patrick; Norton, James

    2016-01-01

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

  15. Artificial Intelligence: Bayesian versus Heuristic Method for Diagnostic Decision Support.

    Science.gov (United States)

    Elkin, Peter L; Schlegel, Daniel R; Anderson, Michael; Komm, Jordan; Ficheur, Gregoire; Bisson, Leslie

    2018-04-01

    Evoking strength is one of the important contributions of the field of Biomedical Informatics to the discipline of Artificial Intelligence. The University at Buffalo's Orthopedics Department wanted to create an expert system to assist patients with self-diagnosis of knee problems and to thereby facilitate referral to the right orthopedic subspecialist. They had two independent sports medicine physicians review 469 cases. A board-certified orthopedic sports medicine practitioner, L.B., reviewed any disagreements until a gold standard diagnosis was reached. For each case, the patients entered 126 potential answers to 26 questions into a Web interface. These were modeled by an expert sports medicine physician and the answers were reviewed by L.B. For each finding, the clinician specified the sensitivity (term frequency) and both specificity (Sp) and the heuristic evoking strength (ES). Heuristics are methods of reasoning with only partial evidence. An expert system was constructed that reflected the posttest odds of disease-ranked list for each case. We compare the accuracy of using Sp to that of using ES (original model, p  < 0.0008; term importance * disease importance [DItimesTI] model, p  < 0.0001: Wilcoxon ranked sum test). For patient referral assignment, Sp in the DItimesTI model was superior to the use of ES. By the fifth diagnosis, the advantage was lost and so there is no difference between the techniques when serving as a reminder system. Schattauer GmbH Stuttgart.

  16. A Heuristic Hierarchical Scheme for Academic Search and Retrieval

    DEFF Research Database (Denmark)

    Amolochitis, Emmanouil; Christou, Ioannis T.; Tan, Zheng-Hua

    2013-01-01

    and a graph-theoretic computed score that relates the paper’s index terms with each other. We designed and developed a meta-search engine that submits user queries to standard digital repositories of academic publications and re-ranks the repository results using the hierarchical heuristic scheme. We evaluate......, and by more than 907.5% in terms of LEX. We also re-rank the top-10 results of a subset of the original 58 user queries produced by Google Scholar, Microsoft Academic Search, and ArnetMiner; the results show that PubSearch compares very well against these search engines as well. The proposed scheme can...... be easily plugged in any existing search engine for retrieval of academic publications....

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

    DEFF Research Database (Denmark)

    Ho, Sin C.; Haugland, Dag

    2011-01-01

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

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

    DEFF Research Database (Denmark)

    Gamst, Mette

    2014-01-01

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

  19. Mode analysis of heuristic behavior of searching for multimodal optimum point

    Energy Technology Data Exchange (ETDEWEB)

    Kamei, K; Araki, Y; Inoue, K

    1982-01-01

    Describes an experimental study of a heuristic behavior of searching for the global optimum (maximum) point of a two-dimensional, multimodal, nonlinear and unknown function. First, the authors define three modes dealing with the trial purposes, called the purpose modes and show the heuristic search behaviors expressed by the purpose modes which the human subjects select in the search experiments. Second, the authors classify the heuristic search behaviors into three types according to the mode transitions and extracts eight states of searches which cause the mode transitions. Third, a model of the heuristic search behavior is composed of the eight mode transitions. The analysis of the heuristic search behaviors by use of the purpose modes plays an important role in the heuristic search techniques. 6 references.

  20. Intelligent process mapping through systematic improvement of heuristics

    Science.gov (United States)

    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.

  1. Intelligent search in Big Data

    Science.gov (United States)

    Birialtsev, E.; Bukharaev, N.; Gusenkov, A.

    2017-10-01

    An approach to data integration, aimed on the ontology-based intelligent search in Big Data, is considered in the case when information objects are represented in the form of relational databases (RDB), structurally marked by their schemes. The source of information for constructing an ontology and, later on, the organization of the search are texts in natural language, treated as semi-structured data. For the RDBs, these are comments on the names of tables and their attributes. Formal definition of RDBs integration model in terms of ontologies is given. Within framework of the model universal RDB representation ontology, oil production subject domain ontology and linguistic thesaurus of subject domain language are built. Technique of automatic SQL queries generation for subject domain specialists is proposed. On the base of it, information system for TATNEFT oil-producing company RDBs was implemented. Exploitation of the system showed good relevance with majority of queries.

  2. A proposed heuristic methodology for searching reloading pattern

    International Nuclear Information System (INIS)

    Choi, K. Y.; Yoon, Y. K.

    1993-01-01

    A new heuristic method for loading pattern search has been developed to overcome shortcomings of the algorithmic approach. To reduce the size of vast solution space, general shuffling rules, a regionwise shuffling method, and a pattern grouping method were introduced. The entropy theory was applied to classify possible loading patterns into groups with similarity between them. The pattern search program was implemented with use of the PROLOG language. A two-group nodal code MEDIUM-2D was used for analysis of power distribution in the core. The above mentioned methodology has been tested to show effectiveness in reducing of solution space down to a few hundred pattern groups. Burnable poison rods were then arranged in each pattern group in accordance with burnable poison distribution rules, which led to further reduction of the solution space to several scores of acceptable pattern groups. The method of maximizing cycle length (MCL) and minimizing power-peaking factor (MPF) were applied to search for specific useful loading patterns from the acceptable pattern groups. Thus, several specific loading patterns that have low power-peaking factor and large cycle length were successfully searched from the selected pattern groups. (Author)

  3. Model of intelligent information searching system

    International Nuclear Information System (INIS)

    Yastrebkov, D.I.

    2004-01-01

    A brief description of the technique to search for electronic documents in large archives as well as drawbacks is presented. A solution close to intelligent information searching systems is proposed. (author)

  4. A comparative study of the A* heuristic search algorithm used to solve efficiently a puzzle game

    Science.gov (United States)

    Iordan, A. E.

    2018-01-01

    The puzzle game presented in this paper consists in polyhedra (prisms, pyramids or pyramidal frustums) which can be moved using the free available spaces. The problem requires to be found the minimum number of movements in order the game reaches to a goal configuration starting from an initial configuration. Because the problem is enough complex, the principal difficulty in solving it is given by dimension of search space, that leads to necessity of a heuristic search. The improving of the search method consists into determination of a strong estimation by the heuristic function which will guide the search process to the most promising side of the search tree. The comparative study is realized among Manhattan heuristic and the Hamming heuristic using A* search algorithm implemented in Java. This paper also presents the necessary stages in object oriented development of a software used to solve efficiently this puzzle game. The modelling of the software is achieved through specific UML diagrams representing the phases of analysis, design and implementation, the system thus being described in a clear and practical manner. With the purpose to confirm the theoretical results which demonstrates that Manhattan heuristic is more efficient was used space complexity criterion. The space complexity was measured by the number of generated nodes from the search tree, by the number of the expanded nodes and by the effective branching factor. From the experimental results obtained by using the Manhattan heuristic, improvements were observed regarding space complexity of A* algorithm versus Hamming heuristic.

  5. Proximity search heuristics for wind farm optimal layout

    DEFF Research Database (Denmark)

    Fischetti, Martina; Monaci, Michele

    2016-01-01

    A heuristic framework for turbine layout optimization in a wind farm is proposed that combines ad-hoc heuristics and mixed-integer linear programming. In our framework, large-scale mixed-integer programming models are used to iteratively refine the current best solution according to the recently...

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

    DEFF Research Database (Denmark)

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

    2016-01-01

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

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

    Science.gov (United States)

    Nallaperuma, Samadhi; Neumann, Frank; Sudholt, Dirk

    2017-01-01

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

  8. The Search for Extraterrestrial Intelligence (SETI)

    Science.gov (United States)

    Tarter, Jill

    The search for evidence of extraterrestrial intelligence is placed in the broader astronomical context of the search for extrasolar planets and biomarkers of primitive life elsewhere in the universe. A decision tree of possible search strategies is presented as well as a brief history of the search for extraterrestrial intelligence (SETI) projects since 1960. The characteristics of 14 SETI projects currently operating on telescopes are discussed and compared using one of many possible figures of merit. Plans for SETI searches in the immediate and more distant future are outlined. Plans for success, the significance of null results, and some opinions on deliberate transmission of signals (as well as listening) are also included. SETI results to date are negative, but in reality, not much searching has yet been done.

  9. Perceived breast cancer risk: heuristic reasoning and search for a dominance structure.

    Science.gov (United States)

    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.

  10. Competing intelligent search agents in global optimization

    Energy Technology Data Exchange (ETDEWEB)

    Streltsov, S.; Vakili, P. [Boston Univ., MA (United States); Muchnik, I. [Rutgers Univ., Piscataway, NJ (United States)

    1996-12-31

    In this paper we present a new search methodology that we view as a development of intelligent agent approach to the analysis of complex system. The main idea is to consider search process as a competition mechanism between concurrent adaptive intelligent agents. Agents cooperate in achieving a common search goal and at the same time compete with each other for computational resources. We propose a statistical selection approach to resource allocation between agents that leads to simple and efficient on average index allocation policies. We use global optimization as the most general setting that encompasses many types of search problems, and show how proposed selection policies can be used to improve and combine various global optimization methods.

  11. Intelligent bioinformatics : the application of artificial intelligence techniques to bioinformatics problems

    National Research Council Canada - National Science Library

    Keedwell, Edward

    2005-01-01

    ... Intelligence and Computer Science 3.1 Introduction to search 3.2 Search algorithms 3.3 Heuristic search methods 3.4 Optimal search strategies 3.5 Problems with search techniques 3.6 Complexity of...

  12. Intelligent Search on XML Data

    NARCIS (Netherlands)

    Blanken, Henk; Grabs, T.; Schek, H-J.; Schenkel, R.; Weikum, G.; Unknown, [Unknown

    2003-01-01

    Recently, we have seen a steep increase in the popularity and adoption of XML, in areas such as traditional databases, e-business, the scientific environment, and on the web. Querying XML documents and data efficiently is a challenging issue; this book approaches search on XML data by combining

  13. Intelligent Heuristic Techniques for the Optimization of the Transshipment and Storage Operations at Maritime Container Terminals

    Directory of Open Access Journals (Sweden)

    Christopher Expósito-Izquierdo

    2017-02-01

    Full Text Available This paper summarizes the main contributions of the Ph.D. thesis of Christopher Exp\\'osito-Izquierdo. This thesis seeks to develop a wide set of intelligent heuristic and meta-heuristic algorithms aimed at solving some of the most highlighted optimization problems associated with the transshipment and storage of containers at conventional maritime container terminals. Under the premise that no optimization technique can have a better performance than any other technique under all possible assumptions, the main point of interest in the domain of maritime logistics is to propose optimization techniques superior in terms of effectiveness and computational efficiency to previous proposals found in the scientific literature when solving individual optimization problems under realistic scenarios. Simultaneously, these optimization techniques should be enough competitive to be potentially implemented in practice. }}

  14. Cognitive biases and heuristics in medical decision making: a critical review using a systematic search strategy.

    Science.gov (United States)

    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.

  15. Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation

    DEFF Research Database (Denmark)

    Witt, Carsten

    2012-01-01

    The analysis of randomized search heuristics on classes of functions is fundamental for the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of the simple (1...

  16. Fitness levels with tail bounds for the analysis of randomized search heuristics

    DEFF Research Database (Denmark)

    Witt, Carsten

    2014-01-01

    The fitness-level method, also called the method of f-based partitions, is an intuitive and widely used technique for the running time analysis of randomized search heuristics. It was originally defined to prove upper and lower bounds on the expected running time. Recently, upper tail bounds were...

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

    NARCIS (Netherlands)

    Buson, Erika; Roberti, Roberto; Toth, Paolo

    2014-01-01

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

  18. Modelling antibody side chain conformations using heuristic database search.

    Science.gov (United States)

    Ritchie, D W; Kemp, G J

    1997-01-01

    We have developed a knowledge-based system which models the side chain conformations of residues in the variable domains of antibody Fv fragments. The system is written in Prolog and uses an object-oriented database of aligned antibody structures in conjunction with a side chain rotamer library. The antibody database provides 3-dimensional clusters of side chain conformations which can be copied en masse into the model structure. The object-oriented database architecture facilitates a navigational style of database access, necessary to assemble side chains clusters. Around 60% of the model is built using side chain clusters and this eliminates much of the combinatorial complexity associated with many other side chain placement algorithms. Construction and placement of side chain clusters is guided by a heuristic cost function based on a simple model of side chain packing interactions. Even with a simple model, we find that a large proportion of side chain conformations are modelled accurately. We expect our approach could be used with other homologous protein families, in addition to antibodies, both to improve the quality of model structures and to give a "smart start" to the side chain placement problem.

  19. Pylogeny: an open-source Python framework for phylogenetic tree reconstruction and search space heuristics

    Directory of Open Access Journals (Sweden)

    Alexander Safatli

    2015-06-01

    Full Text Available Summary. Pylogeny is a cross-platform library for the Python programming language that provides an object-oriented application programming interface for phylogenetic heuristic searches. Its primary function is to permit both heuristic search and analysis of the phylogenetic tree search space, as well as to enable the design of novel algorithms to search this space. To this end, the framework supports the structural manipulation of phylogenetic trees, in particular using rearrangement operators such as NNI, SPR, and TBR, the scoring of trees using parsimony and likelihood methods, the construction of a tree search space graph, and the programmatic execution of a few existing heuristic programs. The library supports a range of common phylogenetic file formats and can be used for both nucleotide and protein data. Furthermore, it is also capable of supporting GPU likelihood calculation on nucleotide character data through the BEAGLE library.Availability. Existing development and source code is available for contribution and for download by the public from GitHub (http://github.com/AlexSafatli/Pylogeny. A stable release of this framework is available for download through PyPi (Python Package Index at http://pypi.python.org/pypi/pylogeny.

  20. A hybridised variable neighbourhood tabu search heuristic to increase security in a utility network

    International Nuclear Information System (INIS)

    Janssens, Jochen; Talarico, Luca; Sörensen, Kenneth

    2016-01-01

    We propose a decision model aimed at increasing security in a utility network (e.g., electricity, gas, water or communication network). The network is modelled as a graph, the edges of which are unreliable. We assume that all edges (e.g., pipes, cables) have a certain, not necessarily equal, probability of failure, which can be reduced by selecting edge-specific security strategies. We develop a mathematical programming model and a metaheuristic approach that uses a greedy random adaptive search procedure to find an initial solution and uses tabu search hybridised with iterated local search and a variable neighbourhood descend heuristic to improve this solution. The main goal is to reduce the risk of service failure between an origin and a destination node by selecting the right combination of security measures for each network edge given a limited security budget. - Highlights: • A decision model aimed at increasing security in a utility network is proposed. • The goal is to reduce the risk of service failure given a limited security budget. • An exact approach and a variable neighbourhood tabu search heuristic are developed. • A generator for realistic networks is built and used to test the solution methods. • The hybridised heuristic reduces the total risk on average with 32%.

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

    Directory of Open Access Journals (Sweden)

    Gilmar D'Agostini Oliveira Casalinho

    2014-08-01

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

  2. A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times

    DEFF Research Database (Denmark)

    Muller, Laurent Flindt; Spoorendonk, Simon; Pisinger, David

    2012-01-01

    This paper presents a hybrid of a general heuristic framework and a general purpose mixed-integer programming (MIP) solver. The framework is based on local search and an adaptive procedure which chooses between a set of large neighborhoods to be searched. A mixed integer programming solver and its......, and the upper bounds found by the commercial MIP solver ILOG CPLEX using state-of-the-art MIP formulations. Furthermore, we improve the best known solutions on 60 out of 100 and improve the lower bound on all 100 instances from the literature...

  3. A learning heuristic for space mapping and searching self-organizing systems using adaptive mesh refinement

    Science.gov (United States)

    Phillips, Carolyn L.

    2014-09-01

    In a complex self-organizing system, small changes in the interactions between the system's components can result in different emergent macrostructures or macrobehavior. In chemical engineering and material science, such spontaneously self-assembling systems, using polymers, nanoscale or colloidal-scale particles, DNA, or other precursors, are an attractive way to create materials that are precisely engineered at a fine scale. Changes to the interactions can often be described by a set of parameters. Different contiguous regions in this parameter space correspond to different ordered states. Since these ordered states are emergent, often experiment, not analysis, is necessary to create a diagram of ordered states over the parameter space. By issuing queries to points in the parameter space (e.g., performing a computational or physical experiment), ordered states can be discovered and mapped. Queries can be costly in terms of resources or time, however. In general, one would like to learn the most information using the fewest queries. Here we introduce a learning heuristic for issuing queries to map and search a two-dimensional parameter space. Using a method inspired by adaptive mesh refinement, the heuristic iteratively issues batches of queries to be executed in parallel based on past information. By adjusting the search criteria, different types of searches (for example, a uniform search, exploring boundaries, sampling all regions equally) can be flexibly implemented. We show that this method will densely search the space, while preferentially targeting certain features. Using numerical examples, including a study simulating the self-assembly of complex crystals, we show how this heuristic can discover new regions and map boundaries more accurately than a uniformly distributed set of queries.

  4. Application of a heuristic search method for generation of fuel reload configurations

    International Nuclear Information System (INIS)

    Galperin, A.; Nissan, E.

    1988-01-01

    A computerized heuristic search method for the generation and optimization of fuel reload configurations is proposed and investigated. The heuristic knowledge is expressed modularly in the form of ''IF-THEN'' production rules. The method was implemented in a program coded in the Franz LISP programming language and executed under the UNIX operating system. A test problem was formulated, based on a typical light water reactor reload problem with a few simplifications assumed, in order to allow formulation of the reload strategy into a relatively small number of rules. A computer run of the problem was performed with a VAX-780 machine. A set of 312 solutions was generated in -- 20 min of execution time. Testing of a few arbitrarily chosen configurations demonstrated reasonably good performance for the computer-generated solutions. A computerized generator of reload configurations may be used for the fast generation or modification of reload patterns and as a tool for the formulation, tuning, and testing of the heuristic knowledge rules used by an ''expert'' fuel manager

  5. Hierarchical heuristic search using a Gaussian mixture model for UAV coverage planning.

    Science.gov (United States)

    Lin, Lanny; Goodrich, Michael A

    2014-12-01

    During unmanned aerial vehicle (UAV) search missions, efficient use of UAV flight time requires flight paths that maximize the probability of finding the desired subject. The probability of detecting the desired subject based on UAV sensor information can vary in different search areas due to environment elements like varying vegetation density or lighting conditions, making it likely that the UAV can only partially detect the subject. This adds another dimension of complexity to the already difficult (NP-Hard) problem of finding an optimal search path. We present a new class of algorithms that account for partial detection in the form of a task difficulty map and produce paths that approximate the payoff of optimal solutions. The algorithms use the mode goodness ratio heuristic that uses a Gaussian mixture model to prioritize search subregions. The algorithms search for effective paths through the parameter space at different levels of resolution. We compare the performance of the new algorithms against two published algorithms (Bourgault's algorithm and LHC-GW-CONV algorithm) in simulated searches with three real search and rescue scenarios, and show that the new algorithms outperform existing algorithms significantly and can yield efficient paths that yield payoffs near the optimal.

  6. The Breakthrough Listen Search for Intelligent Life

    Science.gov (United States)

    Croft, Steve; Siemion, Andrew; De Boer, David; Enriquez, J. Emilio; Foster, Griffin; Gajjar, Vishal; Hellbourg, Greg; Hickish, Jack; Isaacson, Howard; Lebofsky, Matt; MacMahon, David; Price, Daniel; Werthimer, Dan

    2018-01-01

    The $100M, 10-year philanthropic "Breakthrough Listen" project is driving an unprecedented expansion of the search for intelligent life beyond Earth. Modern instruments allow ever larger regions of parameter space (luminosity function, duty cycle, beaming fraction, frequency coverage) to be explored, which is enabling us to place meaningful physical limits on the prevalence of transmitting civilizations. Data volumes are huge, and preclude long-term storage of the raw data products, so real-time and machine learning processing techniques must be employed to identify candidate signals as well as simultaneously classifying interfering sources. However, the Galaxy is now known to be a target-rich environment, teeming with habitable planets.Data from Breakthrough Listen can also be used by researchers in other areas of astronomy to study pulsars, fast radio bursts, and a range of other science targets. Breakthrough Listen is already underway in the optical and radio bands, and is also engaging with facilities across the world, including Square Kilometer Array precursors and pathfinders. I will give an overview of the technology, science goals, data products, and roadmap of Breakthrough Listen, as we attempt to answer one of humanity's oldest questions: Are we alone?

  7. Heuristic thinking and human intelligence: a commentary on Marewski, Gaissmaier and Gigerenzer.

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi

    2018-04-01

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

  9. Heuristic rules analysis on the fuel cells design using greedy search

    International Nuclear Information System (INIS)

    Ortiz, J. J.; Castillo, J. A.; Montes, J. L.; Hernandez, J. L.

    2009-10-01

    This work approaches the study of one of the heuristic rules of fuel cells design for boiling water nuclear reactors. This rule requires that the minor uranium enrichment is placed in the corners of the fuel cell. Also the search greedy is applied for the fuel cells design where explicitly does not take in count this rule, allowing the possibility to place any uranium enrichment with the condition that it does not contain gadolinium. Results are shown in the quality of the obtained cell by search greedy when it considers the rule and when not. The cell quality is measured with the value of the power pick factor obtained, as well as of the neutrons multiplication factor in an infinite medium. Cells were analyzed with 1 and 2 gadolinium concentrations low operation conditions at 120% of the nominal power of the reactors of the nuclear power plant of Laguna Verde. The results show that not to consider the rule in cells with a single gadolinium concentration, it has as repercussion that the greedy search has a minor performance. On the other hand with cells of two gadolinium concentrations, the performance of the greedy search was better. (Author)

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

    DEFF Research Database (Denmark)

    Wen, Min; Krapper, Emil; Larsen, Jesper

    2011-01-01

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

  11. Meta-heuristic cuckoo search algorithm for the correction of faulty array antenna

    International Nuclear Information System (INIS)

    Khan, S.U.; Qureshi, I.M.

    2015-01-01

    In this article, we introduce a CSA (Cuckoo Search Algorithm) for compensation of faulty array antenna. It is assumed that the faulty elemental location is also known. When the sensor fails, it disturbs the power pattern, owing to which its SLL (Sidelobe Level) raises and nulls are shifted from their required positions. In this approach, the CSA optimizes the weights of the active elements for the reduction of SLL and null position in the desired direction. The meta-heuristic CSA is used for the control of SLL and steering of nulls at their required positions. The CSA is based on the necessitated kids bloodsucking behavior of cuckoo sort in arrangement with the Levy flight manners. The fitness function is used to reduce the error between the preferred and probable pattern along with null constraints. Imitational consequences for various scenarios are given to exhibit the validity and presentation of the proposed method. (author)

  12. Intelligent Search Optimization using Artificial Fuzzy Logics

    OpenAIRE

    Manral, Jai

    2015-01-01

    Information on the web is prodigious; searching relevant information is difficult making web users to rely on search engines for finding relevant information on the web. Search engines index and categorize web pages according to their contents using crawlers and rank them accordingly. For given user query they retrieve millions of webpages and display them to users according to web-page rank. Every search engine has their own algorithms based on certain parameters for ranking web-pages. Searc...

  13. Knowledge in Artificial Intelligence Systems: Searching the Strategies for Application

    OpenAIRE

    Kornienko, Alla A.; Kornienko, Anatoly V.; Fofanov, Oleg B.; Chubik, Maxim P.

    2015-01-01

    The studies based on auto-epistemic logic are pointed out as an advanced direction for development of artificial intelligence (AI). Artificial intelligence is taken as a system that imitates the solution of complicated problems by human during the course of life. The structure of symbols and operations, by which intellectual solution is performed, as well as searching the strategic reference points for those solutions, which are caused by certain structures of symbols and operations, – are co...

  14. Funding the Search for Extraterrestrial Intelligence with a Lottery Bond

    OpenAIRE

    Haqq-Misra, Jacob

    2013-01-01

    I propose the establishment of a SETI Lottery Bond to provide a continued source of funding for the search for extraterrestrial intelligence (SETI). The SETI Lottery Bond is a fixed rate perpetual bond with a lottery at maturity, where maturity occurs only upon discovery and confirmation of extraterrestrial intelligent life. Investors in the SETI Lottery Bond purchase shares that yield a fixed rate of interest that continues indefinitely until SETI succeeds---at which point a random subset of...

  15. A simple heuristic for Internet-based evidence search in primary care: a randomized controlled trial

    Directory of Open Access Journals (Sweden)

    Eberbach A

    2016-08-01

    Full Text Available Andreas Eberbach,1 Annette Becker,1 Justine Rochon,2 Holger Finkemeler,1Achim Wagner,3 Norbert Donner-Banzhoff1 1Department of Family and Community Medicine, Philipp University of Marburg, Marburg, Germany; 2Institute of Medical Biometry and Informatics, University of Heidelberg, Heidelberg, Germany; 3Department of Sport Medicine, Justus-Liebig-University of Giessen, Giessen, Germany Background: General practitioners (GPs are confronted with a wide variety of clinical questions, many of which remain unanswered. Methods: In order to assist GPs in finding quick, evidence-based answers, we developed a learning program (LP with a short interactive workshop based on a simple ­three-step-heuristic to improve their search and appraisal competence (SAC. We evaluated the LP ­effectiveness with a randomized controlled trial (RCT. Participants (intervention group [IG] n=20; ­control group [CG] n=31 rated acceptance and satisfaction and also answered 39 ­knowledge ­questions to assess their SAC. We controlled for previous knowledge in content areas covered by the test. Results: Main outcome – SAC: within both groups, the pre–post test shows significant (P=0.00 improvements in correctness (IG 15% vs CG 11% and confidence (32% vs 26% to find evidence-based answers. However, the SAC difference was not significant in the RCT. Other measures: Most workshop participants rated “learning atmosphere” (90%, “skills acquired” (90%, and “relevancy to my practice” (86% as good or very good. The ­LP-recommendations were implemented by 67% of the IG, whereas 15% of the CG already conformed to LP recommendations spontaneously (odds ratio 9.6, P=0.00. After literature search, the IG showed a (not significantly higher satisfaction regarding “time spent” (IG 80% vs CG 65%, “quality of information” (65% vs 54%, and “amount of information” (53% vs 47%.Conclusion: Long-standing established GPs have a good SAC. Despite high acceptance, strong

  16. Psycholinguistics and the Search for Extraterrestrial Intelligence

    Directory of Open Access Journals (Sweden)

    Lidija Krotenko

    2017-09-01

    Full Text Available The author of the article reveals the possibilities of psycholinguistics in the identifi cation and interpretation of languages and texts of Alien Civilizations. The author combines modern interdisciplinary research in psycholinguistics with the theory “Evolving Matter” proposed by Oleg Bazaluk and concludes that the identifi cation of languages and texts of Alien Civilizations, as well as the communication of terrestrial civilization with Extraterrestrial Intelligence, is in principle possible. To that end, it is necessary to achieve the required level of the modeling of neurophilosophy and to include these achievements of modern psycholinguistics studies: а language acquisition; b language comprehension; c language production; d second language acquisition. On the one hand, the possibilities of neurophilosophy to accumulate and model advanced neuroscience research; on the other hand, highly specialized psycholinguistic studies in language evolution are able to provide the communication of terrestrial civilization with Extraterrestrial Intelligence.

  17. Heuristic Search for Planning with Different Forced Goal-Ordering Constraints

    Directory of Open Access Journals (Sweden)

    Jiangfeng Luo

    2013-01-01

    Full Text Available Planning with forced goal-ordering (FGO constraints has been proposed many times over the years, but there are still major difficulties in realizing these FGOs in plan generation. In certain planning domains, all the FGOs exist in the initial state. No matter which approach is adopted to achieve a subgoal, all the subgoals should be achieved in a given sequence from the initial state. Otherwise, the planning may arrive at a deadlock. For some other planning domains, there is no FGO in the initial state. However, FGO may occur during the planning process if certain subgoal is achieved by an inappropriate approach. This paper contributes to illustrate that it is the excludable constraints among the goal achievement operations (GAO of different subgoals that introduce the FGOs into the planning problem, and planning with FGO is still a challenge for the heuristic search based planners. Then, a novel multistep forward search algorithm is proposed which can solve the planning problem with different FGOs efficiently.

  18. Perceived breast cancer risk: Heuristic reasoning and search for a dominance structure

    OpenAIRE

    Katapodi, M. C.; Facione, N. C.; Humphreys, J. C.; Dodd, MJ.

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

  19. In Search of Prototypes and Feminist Bank-Tellers: Exploring the Representativeness Heuristic

    OpenAIRE

    Nilsson, Håkan

    2008-01-01

    According to the heuristics and biases approach, the representativeness heuristic (RH) is one of the heuristics available for assessing subjective probabilities (A. Tversky & D. Kahneman, 1974). A subjective probability assessed by the RH is determined by how representative the target object is of the target category. Several aspects of the RH are argued to cause systematic biases, for example: (i) When the RH is used, the category is represented by one single prototypical exemplar. This ...

  20. Effect of Undergraduates’ Emotional Intelligence on Information Search Behavior

    Directory of Open Access Journals (Sweden)

    Wang Haocheng

    2017-06-01

    Full Text Available [Purpose/significance] Information search capability is the focus of information literacy education. This paper explores the relationship between emotional intelligence and information search behavior. [Method/process] Based on the data from the questionnaires by 250 undergraduates, this paper used IBM SPSS Statistics 19.0 for statistical data analysis. [Result/conclusion]The correlation between emotional intelligence and information search capability is positively obvious. When it comes to all variables in the regression equation, information search behavior is mainly affected by regulation and utilization of the dimension of emotion. Utilization of emotion mainly affects retrieval strategies, information evaluation, behavior adjustment and total score; regulation of emotions mainly affects the information reference.

  1. Optimization of Transformation Coefficients Using Direct Search and Swarm Intelligence

    Directory of Open Access Journals (Sweden)

    Manusov V.Z.

    2017-04-01

    Full Text Available This research considers optimization of tap position of transformers in power systems to reduce power losses. Now, methods based on heuristic rules and fuzzy logic, or methods that optimize parts of the whole system separately, are applied to this problem. The first approach requires expert knowledge about processes in the network. The second methods are not able to consider all the interrelations of system’s parts, while changes in segment affect the entire system. Both approaches are tough to implement and require adjustment to the tasks solved. It needs to implement algorithms that can take into account complex interrelations of optimized variables and self-adapt to optimization task. It is advisable to use algorithms given complex interrelations of optimized variables and independently adapting from optimization tasks. Such algorithms include Swarm Intelligence algorithms. Their main features are self-organization, which allows them to automatically adapt to conditions of tasks, and the ability to efficiently exit from local extremes. Thus, they do not require specialized knowledge of the system, in contrast to fuzzy logic. In addition, they can efficiently find quasi-optimal solutions converging to the global optimum. This research applies Particle Swarm Optimization algorithm (PSO. The model of Tajik power system used in experiments. It was found out that PSO is much more efficient than greedy heuristics and more flexible and easier to use than fuzzy logic. PSO allows reducing active power losses from 48.01 to 45.83 MW (4.5%. With al, the effect of using greedy heuristics or fuzzy logic is two times smaller (2.3%.

  2. Intelligent Chatter Bot for Regulation Search

    Science.gov (United States)

    De Luise, María Daniela López; Pascal, Andrés; Saad, Ben; Álvarez, Claudia; Pescio, Pablo; Carrilero, Patricio; Malgor, Rafael; Díaz, Joaquín

    2016-01-01

    This communication presents a functional prototype, named PTAH, implementing a linguistic model focused on regulations in Spanish. Its global architecture, the reasoning model and short statistics are provided for the prototype. It is mainly a conversational robot linked to an Expert System by a module with many intelligent linguistic filters, implementing the reasoning model of an expert. It is focused on bylaws, regulations, jurisprudence and customized background representing entity mission, vision and profile. This Structure and model are generic enough to self-adapt to any regulatory environment, but as a first step, it was limited to an academic field. This way it is possible to limit the slang and data numbers. The foundations of the linguistic model are also outlined and the way the architecture implements the key features of the behavior.

  3. A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model

    Science.gov (United States)

    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.

  4. Intelligent Information Systems for Web Product Search

    NARCIS (Netherlands)

    D. Vandic (Damir)

    2017-01-01

    markdownabstractOver the last few years, we have experienced an increase in online shopping. Consequently, there is a need for efficient and effective product search engines. The rapid growth of e-commerce, however, has also introduced some challenges. Studies show that users can get overwhelmed by

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

    Directory of Open Access Journals (Sweden)

    Mário Mestria

    2013-08-01

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

  6. A Hybrid Computational Intelligence Approach Combining Genetic Programming And Heuristic Classification for Pap-Smear Diagnosis

    DEFF Research Database (Denmark)

    Tsakonas, Athanasios; Dounias, Georgios; Jantzen, Jan

    2001-01-01

    The paper suggests the combined use of different computational intelligence (CI) techniques in a hybrid scheme, as an effective approach to medical diagnosis. Getting to know the advantages and disadvantages of each computational intelligence technique in the recent years, the time has come...

  7. Search techniques in intelligent classification systems

    CERN Document Server

    Savchenko, Andrey V

    2016-01-01

    A unified methodology for categorizing various complex objects is presented in this book. Through probability theory, novel asymptotically minimax criteria suitable for practical applications in imaging and data analysis are examined including the special cases such as the Jensen-Shannon divergence and the probabilistic neural network. An optimal approximate nearest neighbor search algorithm, which allows faster classification of databases is featured. Rough set theory, sequential analysis and granular computing are used to improve performance of the hierarchical classifiers. Practical examples in face identification (including deep neural networks), isolated commands recognition in voice control system and classification of visemes captured by the Kinect depth camera are included. This approach creates fast and accurate search procedures by using exact probability densities of applied dissimilarity measures. This book can be used as a guide for independent study and as supplementary material for a technicall...

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

    DEFF Research Database (Denmark)

    Wen, Min; Krapper, Emil; Larsen, Jesper

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

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

    Directory of Open Access Journals (Sweden)

    Orhan TÜRKBEY

    2002-02-01

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

  10. Searching for exoplanets using artificial intelligence

    Science.gov (United States)

    Pearson, Kyle A.; Palafox, Leon; Griffith, Caitlin A.

    2018-02-01

    In the last decade, over a million stars were monitored to detect transiting planets. Manual interpretation of potential exoplanet candidates is labor intensive and subject to human error, the results of which are difficult to quantify. Here we present a new method of detecting exoplanet candidates in large planetary search projects which, unlike current methods uses a neural network. Neural networks, also called "deep learning" or "deep nets" are designed to give a computer perception into a specific problem by training it to recognize patterns. Unlike past transit detection algorithms deep nets learn to recognize planet features instead of relying on hand-coded metrics that humans perceive as the most representative. Our convolutional neural network is capable of detecting Earth-like exoplanets in noisy time-series data with a greater accuracy than a least-squares method. Deep nets are highly generalizable allowing data to be evaluated from different time series after interpolation without compromising performance. As validated by our deep net analysis of Kepler light curves, we detect periodic transits consistent with the true period without any model fitting. Our study indicates that machine learning will facilitate the characterization of exoplanets in future analysis of large astronomy data sets.

  11. Searching for Exoplanets using Artificial Intelligence

    Science.gov (United States)

    Pearson, Kyle Alexander; Palafox, Leon; Griffith, Caitlin Ann

    2017-10-01

    In the last decade, over a million stars were monitored to detect transiting planets. The large volume of data obtained from current and future missions (e.g. Kepler, K2, TESS and LSST) requires automated methods to detect the signature of a planet. Manual interpretation of potential exoplanet candidates is labor intensive and subject to human error, the results of which are difficult to quantify. Here we present a new method of detecting exoplanet candidates in large planetary search projects which, unlike current methods uses a neural network. Neural networks, also called ``deep learning'' or ``deep nets'', are a state of the art machine learning technique designed to give a computer perception into a specific problem by training it to recognize patterns. Unlike past transit detection algorithms, the deep net learns to characterize the data instead of relying on hand-coded metrics that humans perceive as the most representative. Exoplanet transits have different shapes, as a result of, e.g. the planet's and stellar atmosphere and transit geometry. Thus, a simple template does not suffice to capture the subtle details, especially if the signal is below the noise or strong systematics are present. Current false-positive rates from the Kepler data are estimated around 12.3% for Earth-like planets and there has been no study of the false negative rates. It is therefore important to ask how the properties of current algorithms exactly affect the results of the Kepler mission and, future missions such as TESS, which flies next year. These uncertainties affect the fundamental research derived from missions, such as the discovery of habitable planets, estimates of their occurrence rates and our understanding about the nature and evolution of planetary systems.

  12. SETI pioneers scientists talk about their search for extraterrestrial intelligence

    CERN Document Server

    Swift, David W.

    1990-01-01

    Why did some scientists decide to conduct a search for extraterrestrial intelligence (SETI)? What factors in their personal development predisposed them to such a quest? What obstacles did they encounter along the way? David Swift interviewed the first scientists involved in the search & offers a fascinating overview of the emergence of this modern scientific endeavor. He allows some of the most imaginative scientific thinkers of our time to hold forth on their views regarding SETI & extraterrestrial life & on how the field has developed. Readers will react with a range of opinions as broad as those concerning the likelihood of success in SETI itself. ''A goldmine of original information.''

  13. The internet and intelligent machines: search engines, agents and robots

    International Nuclear Information System (INIS)

    Achenbach, S.; Alfke, H.

    2000-01-01

    The internet plays an important role in a growing number of medical applications. Finding relevant information is not always easy as the amount of available information on the Web is rising quickly. Even the best Search Engines can only collect links to a fraction of all existing Web pages. In addition, many of these indexed documents have been changed or deleted. The vast majority of information on the Web is not searchable with conventional methods. New search strategies, technologies and standards are combined in Intelligent Search Agents (ISA) an Robots, which can retrieve desired information in a specific approach. Conclusion: The article describes differences between ISAs and conventional Search Engines and how communication between Agents improves their ability to find information. Examples of existing ISAs are given and the possible influences on the current and future work in radiology is discussed. (orig.) [de

  14. EIIS: An Educational Information Intelligent Search Engine Supported by Semantic Services

    Science.gov (United States)

    Huang, Chang-Qin; Duan, Ru-Lin; Tang, Yong; Zhu, Zhi-Ting; Yan, Yong-Jian; Guo, Yu-Qing

    2011-01-01

    The semantic web brings a new opportunity for efficient information organization and search. To meet the special requirements of the educational field, this paper proposes an intelligent search engine enabled by educational semantic support service, where three kinds of searches are integrated into Educational Information Intelligent Search (EIIS)…

  15. The Heuristic of George Polya and Its Relation to Artificial Intelligence

    Science.gov (United States)

    1981-07-01

    entitled Mathematical methods in physical science -- odd, in not being the standard freshman fare of physics, chemistry , western civilization and...the questions teachers should use. The first I I Having used a linguistic variation lo convey a matter of substance, a comment on etymology is in...Intelligence to Chemistry : The DEN ORAL project. New York- McGraw-Hill 1980. McDermott, J. Learning to use analogies. Proceedings of the International Joint

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

    Directory of Open Access Journals (Sweden)

    Vatutin Eduard

    2017-12-01

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

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

    Science.gov (United States)

    Vatutin, Eduard

    2017-12-01

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

  18. Science, religion, and the search for extraterrestrial intelligence

    CERN Document Server

    Wilkinson, David

    2013-01-01

    If the discovery of life elsewhere in the universe is just around the corner, what would be the consequences for religion? Would it represent another major conflict between science and religion, even leading to the death of faith? Some would suggest that the discovery of any suggestion of extraterrestrial life would have a greater impact than even the Copernican and Darwinian revolutions. It is now over 50 years since the first modern scientific papers were published on the search for extraterrestrial intelligence (SETI). Yet the religious implications of this search and possible discovery have never been systematically addressed in the scientific or theological arena. SETI is now entering its most important era of scientific development. New observation techniques are leading to the discovery of extra-solar planets daily, and the Kepler mission has already collected over 1000 planetary candidates. This deluge of data is transforming the scientific and popular view of the existence of extraterrestrial intel...

  19. Recent advances in intelligent image search and video retrieval

    CERN Document Server

    2017-01-01

    This book initially reviews the major feature representation and extraction methods and effective learning and recognition approaches, which have broad applications in the context of intelligent image search and video retrieval. It subsequently presents novel methods, such as improved soft assignment coding, Inheritable Color Space (InCS) and the Generalized InCS framework, the sparse kernel manifold learner method, the efficient Support Vector Machine (eSVM), and the Scale-Invariant Feature Transform (SIFT) features in multiple color spaces. Lastly, the book presents clothing analysis for subject identification and retrieval, and performance evaluation methods of video analytics for traffic monitoring. Digital images and videos are proliferating at an amazing speed in the fields of science, engineering and technology, media and entertainment. With the huge accumulation of such data, keyword searches and manual annotation schemes may no longer be able to meet the practical demand for retrieving relevant conte...

  20. WANDERER IN THE MIST: THE SEARCH FOR INTELLIGENCE, SURVEILLANCE, AND RECONNAISSANCE (ISR) STRATEGY

    Science.gov (United States)

    2017-06-01

    the production of over 383,000 photographic prints to support various intelligence , mapping, and 15...WANDERER IN THE MIST: THE SEARCH FOR INTELLIGENCE , SURVEILLANCE, AND RECONNAISSANCE (ISR) STRATEGY BY MAJOR RYAN D. SKAGGS, USAF...program from the University of California at Los Angeles (UCLA) in 2004. He is a career intelligence officer with over 13 years of experience across a

  1. Application of Meta-Heuristic Hybrid Artificial Intelligence Techniques for Modeling of Bonding Strength of Plywood Panels

    Directory of Open Access Journals (Sweden)

    Cenk Demirkır

    2014-04-01

    Full Text Available Plywood, which is one of the most important wood based panels, has many usage areas changing from traffic signs to building constructions in many countries. It is known that the high quality plywood panel manufacturing has been achieved with a good bonding under the optimum pressure conditions depending on adhesive type. This is a study of determining the using possibilities of modern meta-heuristic hybrid artificial intelligence techniques such as IKE and AANN methods for prediction of bonding strength of plywood panels. This study has composed of two main parts as experimental and analytical. Scots pine, maritime pine and European black pine logs were used as wood species. The pine veneers peeled at 32°C and 50°C were dried at 110°C, 140°C and 160°C temperatures. Phenol formaldehyde and melamine urea formaldehyde resins were used as adhesive types. EN 314-1 standard was used to determine the bonding shear strength values of plywood panels in experimental part of this study. Then the intuitive k-nearest neighbor estimator (IKE and adaptive artificial neural network (AANN were used to estimate bonding strength of plywood panels. The best estimation performance was obtained from MA metric for k-value=10. The most effective factor on bonding strength was determined as adhesive type. Error rates were determined less than 5% for both of the IKE and AANN. It may be recommended that proposed methods could be used in applying to estimation of bonding strength values of plywood panels.

  2. Searching for Extraterrestrial Intelligence SETI Past, Present, and Future

    CERN Document Server

    Shuch, H Paul

    2011-01-01

    This book is a collection of essays written by the very scientists and engineers who have led, and continue to lead, the scientific quest known as SETI, the search for extraterrestrial intelligence. Divided into three parts, the first section, ‘The Spirit of SETI Past’, written by the surviving pioneers of this then emerging discipline, reviews the major projects undertaken during the first 50 years of SETI science and the results of that research. In the second section, ‘The Spirit of SETI Present’, the present-day science and technology is discussed in detail, providing the technical background to contemporary SETI instruments, experiments, and analytical techniques, including the processing of the received signals to extract potential alien communications. In the third and final section, ‘The Spirit of SETI Future’, the book looks ahead to the possible directions that SETI will take in the next 50 years, addressing such important topics as interstellar message construction, the risks and assump...

  3. A Heuristic Dynamically Dimensioned Search with Sensitivity Information (HDDS-S and Application to River Basin Management

    Directory of Open Access Journals (Sweden)

    Jinggang Chu

    2015-05-01

    Full Text Available River basin simulation and multi-reservoir optimal operation have been critical for river basin management. Due to the intense interaction between human activities and river basin systems, the river basin model and multi-reservoir operation model are complicated with a large number of parameters. Therefore, fast and stable optimization algorithms are required for river basin management under the changing conditions of climate and current human activities. This study presents a new global optimization algorithm, named as heuristic dynamically dimensioned search with sensitivity information (HDDS-S, to effectively perform river basin simulation and multi-reservoir optimal operation during river basin management. The HDDS-S algorithm is built on the dynamically dimensioned search (DDS algorithm; and has an improved computational efficiency while maintaining its search capacity compared to the original DDS algorithm. This is mainly due to the non-uniform probability assigned to each decision variable on the basis of its changing sensitivity to the optimization objectives during the adaptive change from global to local search with dimensionality reduced. This study evaluates the new algorithm by comparing its performance with the DDS algorithm on a river basin model calibration problem and a multi-reservoir optimal operation problem. The results obtained indicate that the HDDS-S algorithm outperforms the DDS algorithm in terms of search ability and computational efficiency in the two specific problems. In addition; similar to the DDS algorithm; the HDDS-S algorithm is easy to use as it does not require any parameter tuning and automatically adjusts its search to find good solutions given an available computational budget.

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

    Science.gov (United States)

    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.

  5. Heuristic space diversity control for improved meta-hyper-heuristic performance

    CSIR Research Space (South Africa)

    Grobler, J

    2015-04-01

    Full Text Available This paper expands on the concept of heuristic space diversity and investigates various strategies for the management of heuristic space diversity within the context of a meta-hyper-heuristic algorithm in search of greater performance benefits...

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

    Science.gov (United States)

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

    2012-01-01

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

  7. A Hybrid Heuristic Optimization Approach for Leak Detection in Pipe Networks Using Ordinal Optimization Approach and the Symbiotic Organism Search

    Directory of Open Access Journals (Sweden)

    Chao-Chih Lin

    2017-10-01

    Full Text Available A new transient-based hybrid heuristic approach is developed to optimize a transient generation process and to detect leaks in pipe networks. The approach couples the ordinal optimization approach (OOA and the symbiotic organism search (SOS to solve the optimization problem by means of iterations. A pipe network analysis model (PNSOS is first used to determine steady-state head distribution and pipe flow rates. The best transient generation point and its relevant valve operation parameters are optimized by maximizing the objective function of transient energy. The transient event is created at the chosen point, and the method of characteristics (MOC is used to analyze the transient flow. The OOA is applied to sift through the candidate pipes and the initial organisms with leak information. The SOS is employed to determine the leaks by minimizing the sum of differences between simulated and computed head at the observation points. Two synthetic leaking scenarios, a simple pipe network and a water distribution network (WDN, are chosen to test the performance of leak detection ordinal symbiotic organism search (LDOSOS. Leak information can be accurately identified by the proposed approach for both of the scenarios. The presented technique makes a remarkable contribution to the success of leak detection in the pipe networks.

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

    Science.gov (United States)

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

    2012-12-01

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

  9. A meta-heuristic cuckoo search and eigen permutation approach for ...

    Indian Academy of Sciences (India)

    Akhilesh Kumar Gupta

    2018-04-17

    Apr 17, 2018 ... system (HOS) into a simplified lower order model of rea- sonable accuracy by ..... dom walk whose flight step length is dependent on a power law formula often ..... In: IEEE International Conference on Electric. Power and Energy ... hybrid cuckoo search and genetic algorithm for reliability– redundancy ...

  10. Automatic figure ranking and user interfacing for intelligent figure search.

    Directory of Open Access Journals (Sweden)

    Hong Yu

    2010-10-01

    Full Text Available Figures are important experimental results that are typically reported in full-text bioscience articles. Bioscience researchers need to access figures to validate research facts and to formulate or to test novel research hypotheses. On the other hand, the sheer volume of bioscience literature has made it difficult to access figures. Therefore, we are developing an intelligent figure search engine (http://figuresearch.askhermes.org. Existing research in figure search treats each figure equally, but we introduce a novel concept of "figure ranking": figures appearing in a full-text biomedical article can be ranked by their contribution to the knowledge discovery.We empirically validated the hypothesis of figure ranking with over 100 bioscience researchers, and then developed unsupervised natural language processing (NLP approaches to automatically rank figures. Evaluating on a collection of 202 full-text articles in which authors have ranked the figures based on importance, our best system achieved a weighted error rate of 0.2, which is significantly better than several other baseline systems we explored. We further explored a user interfacing application in which we built novel user interfaces (UIs incorporating figure ranking, allowing bioscience researchers to efficiently access important figures. Our evaluation results show that 92% of the bioscience researchers prefer as the top two choices the user interfaces in which the most important figures are enlarged. With our automatic figure ranking NLP system, bioscience researchers preferred the UIs in which the most important figures were predicted by our NLP system than the UIs in which the most important figures were randomly assigned. In addition, our results show that there was no statistical difference in bioscience researchers' preference in the UIs generated by automatic figure ranking and UIs by human ranking annotation.The evaluation results conclude that automatic figure ranking and user

  11. Transport energy modeling with meta-heuristic harmony search algorithm, an application to Turkey

    Energy Technology Data Exchange (ETDEWEB)

    Ceylan, Huseyin; Ceylan, Halim; Haldenbilen, Soner; Baskan, Ozgur [Department of Civil Engineering, Engineering Faculty, Pamukkale University, Muh. Fak. Denizli 20017 (Turkey)

    2008-07-15

    This study proposes a new method for estimating transport energy demand using a harmony search (HS) approach. HArmony Search Transport Energy Demand Estimation (HASTEDE) models are developed taking population, gross domestic product and vehicle kilometers as an input. The HASTEDE models are in forms of linear, exponential and quadratic mathematical expressions and they are applied to Turkish Transportation sector energy consumption. Optimum or near-optimum values of the HS parameters are obtained with sensitivity analysis (SA). Performance of all models is compared with the Ministry of Energy and Natural Resources (MENR) projections. Results showed that HS algorithm may be used for energy modeling, but SA is required to obtain best values of the HS parameters. The quadratic form of HASTEDE will overestimate transport sector energy consumption by about 26% and linear and exponential forms underestimate by about 21% when they are compared with the MENR projections. This may happen due to the modeling procedure and selected parameters for models, but determining the upper and lower values of transportation sector energy consumption will provide a framework and flexibility for setting up energy policies. (author)

  12. SP-100 shield design automation process using expert system and heuristic search techniques

    International Nuclear Information System (INIS)

    Marcille, T.F.; Protsik, R.; Deane, N.A.; Hoover, D.G.

    1993-01-01

    The SP-100 shield subsystem design process has been modified to utilize the GE Corporate Reserch and Development program, ENGINEOUS (Tong 1990). ENGINEOUS is a software system that automates the use of Computer Aided Engineering (CAE) analysis programs in the engineering design process. The shield subsystem design process incorporates a nuclear subsystems design and performance code, a two-dimensional neutral particle transport code, several input processors and two general purpose neutronic output processors. Coupling these programs within ENGINEOUS provides automatic transition paths between applications, with no source code modifications. ENGINEOUS captures human design knowledge, as well as information about the specific CAE applications and stores this information in knowledge base files. The knowledge base information is used by the ENGINEOUS expert system to drive knowledge directed and knowledge supplemented search modules to find an optimum shield design for a given reactor definition, ensuring that specified constraints are satisfied. Alternate designs, not accommodated in the optimization design rules, can readily be explored through the use of a parametric study capability

  13. A Tutorial on Heuristic Methods

    DEFF Research Database (Denmark)

    Vidal, Rene Victor Valqui; Werra, D. de; Silver, E.

    1980-01-01

    In this paper we define a heuristic method as a procedure for solving a well-defined mathematical problem by an intuitive approach in which the structure of the problem can be interpreted and exploited intelligently to obtain a reasonable solution. Issues discussed include: (i) the measurement...... of the quality of a heuristic method, (ii) different types of heuristic procedures, (iii) the interactive role of human beings and (iv) factors that may influence the choice or testing of heuristic methods. A large number of references are included....

  14. A Secured Cognitive Agent based Multi-strategic Intelligent Search System

    Directory of Open Access Journals (Sweden)

    Neha Gulati

    2018-04-01

    Full Text Available Search Engine (SE is the most preferred information retrieval tool ubiquitously used. In spite of vast scale involvement of users in SE’s, their limited capabilities to understand the user/searcher context and emotions places high cognitive, perceptual and learning load on the user to maintain the search momentum. In this regard, the present work discusses a Cognitive Agent (CA based approach to support the user in Web-based search process. The work suggests a framework called Secured Cognitive Agent based Multi-strategic Intelligent Search System (CAbMsISS to assist the user in search process. It helps to reduce the contextual and emotional mismatch between the SE’s and user. After implementation of the proposed framework, performance analysis shows that CAbMsISS framework improves Query Retrieval Time (QRT and effectiveness for retrieving relevant results as compared to Present Search Engine (PSE. Supplementary to this, it also provides search suggestions when user accesses a resource previously tagged with negative emotions. Overall, the goal of the system is to enhance the search experience for keeping the user motivated. The framework provides suggestions through the search log that tracks the queries searched, resources accessed and emotions experienced during the search. The implemented framework also considers user security. Keywords: BDI model, Cognitive Agent, Emotion, Information retrieval, Intelligent search, Search Engine

  15. Information theory, animal communication, and the search for extraterrestrial intelligence

    Science.gov (United States)

    Doyle, Laurance R.; McCowan, Brenda; Johnston, Simon; Hanser, Sean F.

    2011-02-01

    We present ongoing research in the application of information theory to animal communication systems with the goal of developing additional detectors and estimators for possible extraterrestrial intelligent signals. Regardless of the species, for intelligence (i.e., complex knowledge) to be transmitted certain rules of information theory must still be obeyed. We demonstrate some preliminary results of applying information theory to socially complex marine mammal species (bottlenose dolphins and humpback whales) as well as arboreal squirrel monkeys, because they almost exclusively rely on vocal signals for their communications, producing signals which can be readily characterized by signal analysis. Metrics such as Zipf's Law and higher-order information-entropic structure are emerging as indicators of the communicative complexity characteristic of an "intelligent message" content within these animals' signals, perhaps not surprising given these species' social complexity. In addition to human languages, for comparison we also apply these metrics to pulsar signals—perhaps (arguably) the most "organized" of stellar systems—as an example of astrophysical systems that would have to be distinguished from an extraterrestrial intelligence message by such information theoretic filters. We also look at a message transmitted from Earth (Arecibo Observatory) that contains a lot of meaning but little information in the mathematical sense we define it here. We conclude that the study of non-human communication systems on our own planet can make a valuable contribution to the detection of extraterrestrial intelligence by providing quantitative general measures of communicative complexity. Studying the complex communication systems of other intelligent species on our own planet may also be one of the best ways to deprovincialize our thinking about extraterrestrial communication systems in general.

  16. Meta-hierarchical-heuristic-mathematical- model of loading problems in flexible manufacturing system for development of an intelligent approach

    Directory of Open Access Journals (Sweden)

    Ranbir Singh

    2016-04-01

    Full Text Available Flexible manufacturing system (FMS promises a wide range of manufacturing benefits in terms of flexibility and productivity. These benefits are targeted by efficient production planning. Part type selection, machine grouping, deciding production ratio, resource allocation and machine loading are five identified production planning problems. Machine loading is the most identified complex problem solved with aid of computers. System up gradation and newer technology adoption are the primary needs of efficient FMS generating new scopes of research in the field. The literature review is carried and the critical analysis is being executed in the present work. This paper presents the outcomes of the mathematical modelling techniques for loading of machines in FMS’s. It was also analysed that the mathematical modelling is necessary for accurate and reliable analysis for practical applications. However, excessive computations need to be avoided and heuristics have to be used for real-world problems. This paper presents the heuristics-mathematical modelling of loading problem with machine processing time as primary input. The aim of the present work is to solve a real-world machine loading problem with an objective of balancing the workload of the FMS with decreased computational time. A Matlab code is developed for the solution and the results are found most accurate and reliable as presented in the paper.

  17. Development of intelligent semantic search system for rubber research data in Thailand

    Science.gov (United States)

    Kaewboonma, Nattapong; Panawong, Jirapong; Pianhanuruk, Ekkawit; Buranarach, Marut

    2017-10-01

    The rubber production of Thailand increased not only by strong demand from the world market, but was also stimulated strongly through the replanting program of the Thai Government from 1961 onwards. With the continuous growth of rubber research data volume on the Web, the search for information has become a challenging task. Ontologies are used to improve the accuracy of information retrieval from the web by incorporating a degree of semantic analysis during the search. In this context, we propose an intelligent semantic search system for rubber research data in Thailand. The research methods included 1) analyzing domain knowledge, 2) ontologies development, and 3) intelligent semantic search system development to curate research data in trusted digital repositories may be shared among the wider Thailand rubber research community.

  18. Heuristic Artificial Bee Colony Algorithm for Uncovering Community in Complex Networks

    Directory of Open Access Journals (Sweden)

    Yuquan Guo

    2017-01-01

    Full Text Available Community structure is important for us to understand the functions and structure of the complex networks. In this paper, Heuristic Artificial Bee Colony (HABC algorithm based on swarm intelligence is proposed for uncovering community. The proposed HABC includes initialization, employed bee searching, onlooker searching, and scout bee searching. In initialization stage, the nectar sources with simple community structure are generated through network dynamic algorithm associated with complete subgraph. In employed bee searching and onlooker searching stages, the searching function is redefined to address the community problem. The efficiency of searching progress can be improved by a heuristic function which is an average agglomerate probability of two neighbor communities. Experiments are carried out on artificial and real world networks, and the results demonstrate that HABC will have better performance in terms of comparing with the state-of-the-art algorithms.

  19. Cybervetting internet searches for vetting, investigations, and open-source intelligence

    CERN Document Server

    Appel, Edward J

    2014-01-01

    Section I Behavior and TechnologyThe Internet's Potential for Investigators and Intelligence OfficersIntroductionGrowth of Internet UseA Practitioner's PerspectiveThe SearchInternet Posts and the People They ProfileFinding the NeedlesThe Need for SpeedSufficiency of SearchesNotesBehavior OnlineInternet Use GrowthEvolution of Internet UsesPhysical World, Virtual ActivitiesConnections and DisconnectingNotesUse and Abuse: Crime and Mis

  20. Intelligent Robot-assisted Humanitarian Search and Rescue System

    Directory of Open Access Journals (Sweden)

    Henry Y. K. Lau

    2009-11-01

    Full Text Available The unprecedented scale and number of natural and man-made disasters in the past decade has urged international emergency search and rescue communities to seek for novel technology to enhance operation efficiency. Tele-operated search and rescue robots that can navigate deep into rubble to search for victims and to transfer critical field data back to the control console has gained much interest among emergency response institutions. In response to this need, a low-cost autonomous mini robot equipped with thermal sensor, accelerometer, sonar, pin-hole camera, microphone, ultra-bright LED and wireless communication module is developed to study the control of a group of decentralized mini search and rescue robots. The robot can navigate autonomously between voids to look for living body heat and can send back audio and video information to allow the operator to determine if the found object is a living human. This paper introduces the design and control of a low-cost robotic search and rescue system based on an immuno control framework developed for controlling decentralized systems. Design and development of the physical prototype and the immunity-based control system are described in this paper.

  1. Intelligent Robot-Assisted Humanitarian Search and Rescue System

    Directory of Open Access Journals (Sweden)

    Albert W. Y. Ko

    2009-06-01

    Full Text Available The unprecedented scale and number of natural and man-made disasters in the past decade has urged international emergency search and rescue communities to seek for novel technology to enhance operation efficiency. Tele-operated search and rescue robots that can navigate deep into rubble to search for victims and to transfer critical field data back to the control console has gained much interest among emergency response institutions. In response to this need, a low-cost autonomous mini robot equipped with thermal sensor, accelerometer, sonar, pin-hole camera, microphone, ultra-bright LED and wireless communication module is developed to study the control of a group of decentralized mini search and rescue robots. The robot can navigate autonomously between voids to look for living body heat and can send back audio and video information to allow the operator to determine if the found object is a living human. This paper introduces the design and control of a low-cost robotic search and rescue system based on an immuno control framework developed for controlling decentralized systems. Design and development of the physical prototype and the immunity-based control system are described in this paper.

  2. A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems

    Directory of Open Access Journals (Sweden)

    Nader Ghaffari-Nasab

    2010-07-01

    Full Text Available During the past two decades, there have been increasing interests on permutation flow shop with different types of objective functions such as minimizing the makespan, the weighted mean flow-time etc. The permutation flow shop is formulated as a mixed integer programming and it is classified as NP-Hard problem. Therefore, a direct solution is not available and meta-heuristic approaches need to be used to find the near-optimal solutions. In this paper, we present a new discrete firefly meta-heuristic to minimize the makespan for the permutation flow shop scheduling problem. The results of implementation of the proposed method are compared with other existing ant colony optimization technique. The preliminary results indicate that the new proposed method performs better than the ant colony for some well known benchmark problems.

  3. Optimizing Vector-Quantization Processor Architecture for Intelligent Query-Search Applications

    Science.gov (United States)

    Xu, Huaiyu; Mita, Yoshio; Shibata, Tadashi

    2002-04-01

    The architecture of a very large scale integration (VLSI) vector-quantization processor (VQP) has been optimized to develop a general-purpose intelligent query-search agent. The agent performs a similarity-based search in a large-volume database. Although similarity-based search processing is computationally very expensive, latency-free searches have become possible due to the highly parallel maximum-likelihood search architecture of the VQP chip. Three architectures of the VQP chip have been studied and their performances are compared. In order to give reasonable searching results according to the different policies, the concept of penalty function has been introduced into the VQP. An E-commerce real-estate agency system has been developed using the VQP chip implemented in a field-programmable gate array (FPGA) and the effectiveness of such an agency system has been demonstrated.

  4. What Friends Are For: Collaborative Intelligence Analysis and Search

    Science.gov (United States)

    2014-06-01

    preferences, then the similarity measure could then be some type of vector angularity measurement. Regardless of how similarity is computed, once 26 the...III. In addition to implementing the model, the software supports analysis of search performance. The program is written in Java and Python and...profiles within the profile database are encoded in XML format, as seen in Figure 13. Profiler is written in both Java and Python and is dependent upon

  5. L factor: hope and fear in the search for extraterrestrial intelligence

    Science.gov (United States)

    Rubin, Charles T.

    2001-08-01

    The L factor in the Drake equation is widely understood to account for most of the variance in estimates of the number of extraterrestrial intelligences that might be contacted by the search for extraterrestrial intelligence (SETI). It is also among the hardest to quantify. An examination of discussions of the L factor in the popular and technical SETI literature suggests that attempts to estimate L involve a variety of potentially conflicting assumptions about civilizational lifespan that reflect hopes and fears about the human future.

  6. Graphics-based intelligent search and abstracting using Data Modeling

    Science.gov (United States)

    Jaenisch, Holger M.; Handley, James W.; Case, Carl T.; Songy, Claude G.

    2002-11-01

    This paper presents an autonomous text and context-mining algorithm that converts text documents into point clouds for visual search cues. This algorithm is applied to the task of data-mining a scriptural database comprised of the Old and New Testaments from the Bible and the Book of Mormon, Doctrine and Covenants, and the Pearl of Great Price. Results are generated which graphically show the scripture that represents the average concept of the database and the mining of the documents down to the verse level.

  7. In search of a consumer-focused food classification system. An experimental heuristic approach to differentiate degrees of quality.

    Science.gov (United States)

    Torres-Ruiz, Francisco J; Marano-Marcolini, Carla; Lopez-Zafra, Esther

    2018-06-01

    The present paper focuses on the problems that arise in food classification systems (FCSs), especially when the food product type has different levels or grades of quality. Despite the principal function of these systems being to assist the consumer (to inform, clarify and facilitate choice and purchase), they frequently have the opposite effect. Thus, the main aim of the present research involves providing orientations for the design of effective food classification systems. To address this objective, considering the context of food product consumption (related to heuristic processing), we conducted an experimental study with 720 participants. We analysed the usefulness of heuristic elements by a factorial 2 (category length: short and long) × 3 (visual signs: colours, numbers and images) design in relation to recall and recognition activities. The results showed that the elements used to make the classification more effective for consumers vary depending on whether the user seeks to prioritize the recall or the recognition of product categories. Thus, long categories with images significantly improve recognition, and short categories with colours improve recall. A series of recommendations are provided that can help to enhance FCSs and to make them more intuitive and easier to understand for consumers. Implications with regard to theory and practice are discussed. Copyright © 2018 Elsevier Ltd. All rights reserved.

  8. Intelligent energy allocation strategy for PHEV charging station using gravitational search algorithm

    Science.gov (United States)

    Rahman, Imran; Vasant, Pandian M.; Singh, Balbir Singh Mahinder; Abdullah-Al-Wadud, M.

    2014-10-01

    Recent researches towards the use of green technologies to reduce pollution and increase penetration of renewable energy sources in the transportation sector are gaining popularity. The development of the smart grid environment focusing on PHEVs may also heal some of the prevailing grid problems by enabling the implementation of Vehicle-to-Grid (V2G) concept. Intelligent energy management is an important issue which has already drawn much attention to researchers. Most of these works require formulation of mathematical models which extensively use computational intelligence-based optimization techniques to solve many technical problems. Higher penetration of PHEVs require adequate charging infrastructure as well as smart charging strategies. We used Gravitational Search Algorithm (GSA) to intelligently allocate energy to the PHEVs considering constraints such as energy price, remaining battery capacity, and remaining charging time.

  9. Anthropomorphism in the search for extra-terrestrial intelligence - The limits of cognition?

    Science.gov (United States)

    Bohlmann, Ulrike M.; Bürger, Moritz J. F.

    2018-02-01

    The question "Are we alone?" lingers in the human mind since ancient times. Early human civilisations populated the heavens above with a multitude of Gods endowed with some all too human characteristics - from their outer appearance to their innermost motivations. En passant they created thereby their own cultural founding myths on which they built their understanding of the world and its phenomena and deduced as well rules for the functioning of their own society. Advancing technology has enabled us to conduct this human quest for knowledge with more scientific means: optical and radio-wavelengths are being monitored for messages by an extra-terrestrial intelligence and active messaging attempts have also been undertaken. Scenarios have been developed for a possible detection of extra-terrestrial intelligence and post-detection guidelines and protocols have been elaborated. The human responses to the whole array of questions concerning the potential existence, discovery of and communication/interaction with an extra-terrestrial intelligence share as one clear thread a profound anthropomorphism, which ascribes classical human behavioural patterns also to an extra-terrestrial intelligence in much the same way as our ancestors attributed comparable conducts to mythological figures. This paper aims at pinpointing this thread in a number of classical reactions to basic questions related to the search for extra-terrestrial intelligence. Many of these reactions are based on human motives such as curiosity and fear, rationalised by experience and historical analogy and modelled in the Science Fiction Culture by literature and movies. Scrutinising the classical hypothetical explanations of the Fermi paradox under the angle of a potentially undue anthropomorphism, this paper intends to assist in understanding our human epistemological limitations in the search for extra-terrestrial intelligence. This attempt is structured into a series of questions: I. Can we be alone? II

  10. A Geographical Heuristic Routing Protocol for VANETs

    Science.gov (United States)

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

    2016-01-01

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

  11. Heuristic rules analysis on the fuel cells design using greedy search;Analisis de reglas heuristicas en el diseno de celdas de combustible usando busqueda greedy

    Energy Technology Data Exchange (ETDEWEB)

    Ortiz, J. J.; Castillo, J. A.; Montes, J. L.; Hernandez, J. L., E-mail: juanjose.ortiz@inin.gob.m [ININ, Carretera Mexico-Toluca s/n, 52750 Ocoyoacac, Estado de Mexico (Mexico)

    2009-10-15

    This work approaches the study of one of the heuristic rules of fuel cells design for boiling water nuclear reactors. This rule requires that the minor uranium enrichment is placed in the corners of the fuel cell. Also the search greedy is applied for the fuel cells design where explicitly does not take in count this rule, allowing the possibility to place any uranium enrichment with the condition that it does not contain gadolinium. Results are shown in the quality of the obtained cell by search greedy when it considers the rule and when not. The cell quality is measured with the value of the power pick factor obtained, as well as of the neutrons multiplication factor in an infinite medium. Cells were analyzed with 1 and 2 gadolinium concentrations low operation conditions at 120% of the nominal power of the reactors of the nuclear power plant of Laguna Verde. The results show that not to consider the rule in cells with a single gadolinium concentration, it has as repercussion that the greedy search has a minor performance. On the other hand with cells of two gadolinium concentrations, the performance of the greedy search was better. (Author)

  12. The Breakthrough Listen Initiative and the Future of the Search for Intelligent Life

    Science.gov (United States)

    Enriquez, J. Emilio; Siemion, Andrew; Croft, Steve; Hellbourg, Greg; Lebofsky, Matt; MacMahon, David; Price, Danny; DeBoer, David; Werthimer, Dan

    2017-05-01

    Unprecedented recent results in the fields of exoplanets and astrobiology have dramatically increased the interest in the potential existence of intelligent life elsewhere in the galaxy. Additionally, the capabilities of modern Searches for Extraterrestrial Intelligence (SETI) have increased tremendously. Much of this improvement is due to the ongoing development of wide bandwidth radio instruments and the Moore's Law increase in computing power over the previous decades. Together, these instrumentation improvements allow for narrow band signal searches of billions of frequency channels at once.The Breakthrough Listen Initiative (BL) was launched on July 20, 2015 at the Royal Society in London, UK with the goal to conduct the most comprehensive and sensitive search for advanced life in humanity's history. Here we detail important milestones achieved during the first year and a half of the program. We describe the key BL SETI surveys and briefly describe current facilities, including the Green Bank Telescope, the Automated Planet Finder and the Parkes Observatory. We also mention the ongoing and potential collaborations focused on complementary sciences, these include pulse searches of pulsars and FRBs, as well as astrophysically powered radio emission from stars targeted by our program.We conclude with a brief view towards future SETI searches with upcoming next-generation radio facilities such as SKA and ngVLA.

  13. Application of heuristic and machine-learning approach to engine model calibration

    Science.gov (United States)

    Cheng, Jie; Ryu, Kwang R.; Newman, C. E.; Davis, George C.

    1993-03-01

    Automation of engine model calibration procedures is a very challenging task because (1) the calibration process searches for a goal state in a huge, continuous state space, (2) calibration is often a lengthy and frustrating task because of complicated mutual interference among the target parameters, and (3) the calibration problem is heuristic by nature, and often heuristic knowledge for constraining a search cannot be easily acquired from domain experts. A combined heuristic and machine learning approach has, therefore, been adopted to improve the efficiency of model calibration. We developed an intelligent calibration program called ICALIB. It has been used on a daily basis for engine model applications, and has reduced the time required for model calibrations from many hours to a few minutes on average. In this paper, we describe the heuristic control strategies employed in ICALIB such as a hill-climbing search based on a state distance estimation function, incremental problem solution refinement by using a dynamic tolerance window, and calibration target parameter ordering for guiding the search. In addition, we present the application of a machine learning program called GID3* for automatic acquisition of heuristic rules for ordering target parameters.

  14. A framework for intelligent data acquisition and real-time database searching for shotgun proteomics.

    Science.gov (United States)

    Graumann, Johannes; Scheltema, Richard A; Zhang, Yong; Cox, Jürgen; Mann, Matthias

    2012-03-01

    In the analysis of complex peptide mixtures by MS-based proteomics, many more peptides elute at any given time than can be identified and quantified by the mass spectrometer. This makes it desirable to optimally allocate peptide sequencing and narrow mass range quantification events. In computer science, intelligent agents are frequently used to make autonomous decisions in complex environments. Here we develop and describe a framework for intelligent data acquisition and real-time database searching and showcase selected examples. The intelligent agent is implemented in the MaxQuant computational proteomics environment, termed MaxQuant Real-Time. It analyzes data as it is acquired on the mass spectrometer, constructs isotope patterns and SILAC pair information as well as controls MS and tandem MS events based on real-time and prior MS data or external knowledge. Re-implementing a top10 method in the intelligent agent yields similar performance to the data dependent methods running on the mass spectrometer itself. We demonstrate the capabilities of MaxQuant Real-Time by creating a real-time search engine capable of identifying peptides "on-the-fly" within 30 ms, well within the time constraints of a shotgun fragmentation "topN" method. The agent can focus sequencing events onto peptides of specific interest, such as those originating from a specific gene ontology (GO) term, or peptides that are likely modified versions of already identified peptides. Finally, we demonstrate enhanced quantification of SILAC pairs whose ratios were poorly defined in survey spectra. MaxQuant Real-Time is flexible and can be applied to a large number of scenarios that would benefit from intelligent, directed data acquisition. Our framework should be especially useful for new instrument types, such as the quadrupole-Orbitrap, that are currently becoming available.

  15. A swarm intelligence framework for reconstructing gene networks: searching for biologically plausible architectures.

    Science.gov (United States)

    Kentzoglanakis, Kyriakos; Poole, Matthew

    2012-01-01

    In this paper, we investigate the problem of reverse engineering the topology of gene regulatory networks from temporal gene expression data. We adopt a computational intelligence approach comprising swarm intelligence techniques, namely particle swarm optimization (PSO) and ant colony optimization (ACO). In addition, the recurrent neural network (RNN) formalism is employed for modeling the dynamical behavior of gene regulatory systems. More specifically, ACO is used for searching the discrete space of network architectures and PSO for searching the corresponding continuous space of RNN model parameters. We propose a novel solution construction process in the context of ACO for generating biologically plausible candidate architectures. The objective is to concentrate the search effort into areas of the structure space that contain architectures which are feasible in terms of their topological resemblance to real-world networks. The proposed framework is initially applied to the reconstruction of a small artificial network that has previously been studied in the context of gene network reverse engineering. Subsequently, we consider an artificial data set with added noise for reconstructing a subnetwork of the genetic interaction network of S. cerevisiae (yeast). Finally, the framework is applied to a real-world data set for reverse engineering the SOS response system of the bacterium Escherichia coli. Results demonstrate the relative advantage of utilizing problem-specific knowledge regarding biologically plausible structural properties of gene networks over conducting a problem-agnostic search in the vast space of network architectures.

  16. Application of artificial intelligence to search ground-state geometry of clusters

    International Nuclear Information System (INIS)

    Lemes, Mauricio Ruv; Marim, L.R.; Dal Pino, A. Jr.

    2002-01-01

    We introduce a global optimization procedure, the neural-assisted genetic algorithm (NAGA). It combines the power of an artificial neural network (ANN) with the versatility of the genetic algorithm. This method is suitable to solve optimization problems that depend on some kind of heuristics to limit the search space. If a reasonable amount of data is available, the ANN can 'understand' the problem and provide the genetic algorithm with a selected population of elements that will speed up the search for the optimum solution. We tested the method in a search for the ground-state geometry of silicon clusters. We trained the ANN with information about the geometry and energetics of small silicon clusters. Next, the ANN learned how to restrict the configurational space for larger silicon clusters. For Si 10 and Si 20 , we noticed that the NAGA is at least three times faster than the 'pure' genetic algorithm. As the size of the cluster increases, it is expected that the gain in terms of time will increase as well

  17. Artificial intelligence search techniques for optimization of the cold source geometry

    International Nuclear Information System (INIS)

    Azmy, Y.Y.

    1988-01-01

    Most optimization studies of cold neutron sources have concentrated on the numerical prediction or experimental measurement of the cold moderator optimum thickness which produces the largest cold neutron leakage for a given thermal neutron source. Optimizing the geometrical shape of the cold source, however, is a more difficult problem because the optimized quantity, the cold neutron leakage, is an implicit function of the shape which is the unknown in such a study. We draw an analogy between this problem and a state space search, then we use a simple Artificial Intelligence (AI) search technique to determine the optimum cold source shape based on a two-group, r-z diffusion model. We implemented this AI design concept in the computer program AID which consists of two modules, a physical model module and a search module, which can be independently modified, improved, or made more sophisticated. 7 refs., 1 fig

  18. Artificial intelligence search techniques for the optimization of cold source geometry

    International Nuclear Information System (INIS)

    Azmy, Y.Y.

    1988-01-01

    Most optimization studies of cold neutron sources have concentrated on the numerical prediction or experimental measurement of the cold moderator optimum thickness that produces the largest cold neutron leakage for a given thermal neutron source. Optimizing the geometric shape of the cold source, however, is a more difficult problem because the optimized quantity, the cold neutron leakage, is an implicit function of the shape, which is the unknown in such a study. An analogy is drawn between this problem and a state space search, then a simple artificial intelligence (AI) search technique is used to determine the optimum cold source shape based on a two-group, r-z diffusion model. This AI design concept was implemented in the computer program AID, which consists of two modules, a physical model module, and a search module, which can be independently modified, improved, or made more sophisticated

  19. The Search for Extraterrestrial Intelligence in the 1960s: Science in Popular Culture

    Science.gov (United States)

    Smith, Sierra

    2012-01-01

    Building upon the advancement of technology during the Second World War and the important scientific discoveries which have been made about the structure and components of the universe, scientists, especially in radio astronomy and physics, began seriously addressing the possibility of extraterrestrial intelligence in the 1960s. The Search for Extraterrestrial Intelligence (SETI) quickly became one of the most controversial scientific issues in the post Second World War period. The controversy played out, not only in scientific and technical journals, but in newspapers and in popular literature. Proponents for SETI, including Frank Drake, Carl Sagan, and Philip Morrison, actively used a strategy of engagement with the public by using popular media to lobby for exposure and funding. This paper will examine the use of popular media by scientists interested in SETI to popularize and heighten public awareness and also to examine the effects of popularization on SETI's early development. My research has been generously supported by the National Radio Astronomy Observatory.

  20. Simultaneous determination of aquifer parameters and zone structures with fuzzy c-means clustering and meta-heuristic harmony search algorithm

    Science.gov (United States)

    Ayvaz, M. Tamer

    2007-11-01

    This study proposes an inverse solution algorithm through which both the aquifer parameters and the zone structure of these parameters can be determined based on a given set of observations on piezometric heads. In the zone structure identification problem fuzzy c-means ( FCM) clustering method is used. The association of the zone structure with the transmissivity distribution is accomplished through an optimization model. The meta-heuristic harmony search ( HS) algorithm, which is conceptualized using the musical process of searching for a perfect state of harmony, is used as an optimization technique. The optimum parameter zone structure is identified based on three criteria which are the residual error, parameter uncertainty, and structure discrimination. A numerical example given in the literature is solved to demonstrate the performance of the proposed algorithm. Also, a sensitivity analysis is performed to test the performance of the HS algorithm for different sets of solution parameters. Results indicate that the proposed solution algorithm is an effective way in the simultaneous identification of aquifer parameters and their corresponding zone structures.

  1. A Privacy-Preserving Intelligent Medical Diagnosis System Based on Oblivious Keyword Search

    Directory of Open Access Journals (Sweden)

    Zhaowen Lin

    2017-01-01

    Full Text Available One of the concerns people have is how to get the diagnosis online without privacy being jeopardized. In this paper, we propose a privacy-preserving intelligent medical diagnosis system (IMDS, which can efficiently solve the problem. In IMDS, users submit their health examination parameters to the server in a protected form; this submitting process is based on Paillier cryptosystem and will not reveal any information about their data. And then the server retrieves the most likely disease (or multiple diseases from the database and returns it to the users. In the above search process, we use the oblivious keyword search (OKS as a basic framework, which makes the server maintain the computational ability but cannot learn any personal information over the data of users. Besides, this paper also provides a preprocessing method for data stored in the server, to make our protocol more efficient.

  2. Optimization process planning using hybrid genetic algorithm and intelligent search for job shop machining.

    Science.gov (United States)

    Salehi, Mojtaba; Bahreininejad, Ardeshir

    2011-08-01

    Optimization of process planning is considered as the key technology for computer-aided process planning which is a rather complex and difficult procedure. A good process plan of a part is built up based on two elements: (1) the optimized sequence of the operations of the part; and (2) the optimized selection of the machine, cutting tool and Tool Access Direction (TAD) for each operation. In the present work, the process planning is divided into preliminary planning, and secondary/detailed planning. In the preliminary stage, based on the analysis of order and clustering constraints as a compulsive constraint aggregation in operation sequencing and using an intelligent searching strategy, the feasible sequences are generated. Then, in the detailed planning stage, using the genetic algorithm which prunes the initial feasible sequences, the optimized operation sequence and the optimized selection of the machine, cutting tool and TAD for each operation based on optimization constraints as an additive constraint aggregation are obtained. The main contribution of this work is the optimization of sequence of the operations of the part, and optimization of machine selection, cutting tool and TAD for each operation using the intelligent search and genetic algorithm simultaneously.

  3. A database of linear codes over F_13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm

    Directory of Open Access Journals (Sweden)

    Eric Z. Chen

    2015-01-01

    Full Text Available Error control codes have been widely used in data communications and storage systems. One central problem in coding theory is to optimize the parameters of a linear code and construct codes with best possible parameters. There are tables of best-known linear codes over finite fields of sizes up to 9. Recently, there has been a growing interest in codes over $\\mathbb{F}_{13}$ and other fields of size greater than 9. The main purpose of this work is to present a database of best-known linear codes over the field $\\mathbb{F}_{13}$ together with upper bounds on the minimum distances. To find good linear codes to establish lower bounds on minimum distances, an iterative heuristic computer search algorithm is employed to construct quasi-twisted (QT codes over the field $\\mathbb{F}_{13}$ with high minimum distances. A large number of new linear codes have been found, improving previously best-known results. Tables of $[pm, m]$ QT codes over $\\mathbb{F}_{13}$ with best-known minimum distances as well as a table of lower and upper bounds on the minimum distances for linear codes of length up to 150 and dimension up to 6 are presented.

  4. Core design optimization by integration of a fast 3-D nodal code in a heuristic search procedure

    Energy Technology Data Exchange (ETDEWEB)

    Geemert, R. van; Leege, P.F.A. de; Hoogenboom, J.E.; Quist, A.J. [Delft University of Technology, NL-2629 JB Delft (Netherlands)

    1998-07-01

    An automated design tool is being developed for the Hoger Onderwijs Reactor (HOR) in Delft, the Netherlands, which is a 2 MWth swimming-pool type research reactor. As a black box evaluator, the 3-D nodal code SILWER, which up to now has been used only for evaluation of predetermined core designs, is integrated in the core optimization procedure. SILWER is a part of PSl's ELCOS package and features optional additional thermal-hydraulic, control rods and xenon poisoning calculations. This allows for fast and accurate evaluation of different core designs during the optimization search. Special attention is paid to handling the in- and output files for SILWER such that no adjustment of the code itself is required for its integration in the optimization programme. The optimization objective, the safety and operation constraints, as well as the optimization procedure, are discussed. (author)

  5. Core design optimization by integration of a fast 3-D nodal code in a heuristic search procedure

    International Nuclear Information System (INIS)

    Geemert, R. van; Leege, P.F.A. de; Hoogenboom, J.E.; Quist, A.J.

    1998-01-01

    An automated design tool is being developed for the Hoger Onderwijs Reactor (HOR) in Delft, the Netherlands, which is a 2 MWth swimming-pool type research reactor. As a black box evaluator, the 3-D nodal code SILWER, which up to now has been used only for evaluation of predetermined core designs, is integrated in the core optimization procedure. SILWER is a part of PSl's ELCOS package and features optional additional thermal-hydraulic, control rods and xenon poisoning calculations. This allows for fast and accurate evaluation of different core designs during the optimization search. Special attention is paid to handling the in- and output files for SILWER such that no adjustment of the code itself is required for its integration in the optimization programme. The optimization objective, the safety and operation constraints, as well as the optimization procedure, are discussed. (author)

  6. Design and economic investigation of shell and tube heat exchangers using Improved Intelligent Tuned Harmony Search algorithm

    Directory of Open Access Journals (Sweden)

    Oguz Emrah Turgut

    2014-12-01

    Full Text Available This study explores the thermal design of shell and tube heat exchangers by using Improved Intelligent Tuned Harmony Search (I-ITHS algorithm. Intelligent Tuned Harmony Search (ITHS is an upgraded version of harmony search algorithm which has an advantage of deciding intensification and diversification processes by applying proper pitch adjusting strategy. In this study, we aim to improve the search capacity of ITHS algorithm by utilizing chaotic sequences instead of uniformly distributed random numbers and applying alternative search strategies inspired by Artificial Bee Colony algorithm and Opposition Based Learning on promising areas (best solutions. Design variables including baffle spacing, shell diameter, tube outer diameter and number of tube passes are used to minimize total cost of heat exchanger that incorporates capital investment and the sum of discounted annual energy expenditures related to pumping and heat exchanger area. Results show that I-ITHS can be utilized in optimizing shell and tube heat exchangers.

  7. Durham Zoo: Powering a Search-&-Innovation Engine with Collective Intelligence

    Directory of Open Access Journals (Sweden)

    Richard Absalom

    2015-02-01

    Full Text Available Purpose – Durham Zoo (hereinafter – DZ is a project to design and operate a concept search engine for science and technology. In DZ, a concept includes a solution to a problem in a particular context.Design – Concept searching is rendered complex by the fuzzy nature of a concept, the many possible implementations of the same concept, and the many more ways that the many implementations can be expressed in natural language. An additional complexity is the diversity of languages and formats, in which the concepts can be disclosed.Humans understand language, inference, implication and abstraction and, hence, concepts much better than computers, that in turn are much better at storing and processing vast amounts of data.We are 7 billion on the planet and we have the Internet as the backbone for Collective Intelligence. So, our concept search engine uses humans to store concepts via a shorthand that can be stored, processed and searched by computers: so, humans IN and computers OUT.The shorthand is classification: metadata in a structure that can define the content of a disclosure. The classification is designed to be powerful in terms of defining and searching concepts, whilst suited to a crowdsourcing effort. It is simple and intuitive to use. Most importantly, it is adapted to restrict ambiguity, which is the poison of classification, without imposing a restrictive centralised management.In the classification scheme, each entity is shown together in a graphical representation with related entities. The entities are arranged on a sliding scale of similarity. This sliding scale is effectively fuzzy classification.Findings – The authors of the paper have been developing a first classification scheme for the technology of traffic cones, this in preparation for a trial of a working system. The process has enabled the authors to further explore the practicalities of concept classification. The CmapTools knowledge modelling kit to develop the

  8. Are We Alone? GAVRT Search for Extra Terrestrial Intelligence (SETI) Project

    Science.gov (United States)

    Bensel, Holly; Cool, Ian; St. Mary's High School Astronomy Club; St. Mary's Middle School Astronomy Club

    2017-01-01

    The Goldstone Apple Valley Radio Telescope Program (GAVRT) is a partnership between NASA’s Jet Propulsion Laboratory and the Lewis Center for Educational Research. The program is an authentic science investigation program for students in grades K through 12 and offers them the ability to learn how to be a part of a science team while they are making a real contribution to scientific knowledge.Using the internet from their classroom, students take control of a 34-meter decommissioned NASA radio telescope located at the Goldstone Deep Space Network complex in California. Students collect data on strong radio sources and work in collaboration with professional radio astronomers to analyze the data.Throughout history man has wondered if we were alone in the Universe. SETI - or the Search for Extra Terrestrial Intelligence - is one of the programs offered through GAVRT that is designed to help answer that question. By participating in SETI, students learn about science by doing real science and maybe, if they get very lucky, they might make the most important discovery of our lifetime: Intelligent life beyond Earth!At St. Mary’s School, students in grades 6-12 have participated in the project since its inception. The St. Mary’s Middle School Astronomy Club is leading the way in their relentless search for ET and radio telescope studies. Students use the radio telescope to select a very small portion of the Milky Way Galaxy - or galactic plane - and scan across it over and over in the hopes of finding a signal that is not coming from humans or radio interference. The possibility of being the first to discover an alien signal has kept some students searching for the past three years. For them to discover something of this magnitude is like winning the lottery: small chance of winning - big payoff. To that end, the club is focusing on several portions of the Milky Way where they have detected a strong candidate in the past. The hope is to pick it up a second and

  9. Polyphase-discrete Fourier transform spectrum analysis for the Search for Extraterrestrial Intelligence sky survey

    Science.gov (United States)

    Zimmerman, G. A.; Gulkis, S.

    1991-01-01

    The sensitivity of a matched filter-detection system to a finite-duration continuous wave (CW) tone is compared with the sensitivities of a windowed discrete Fourier transform (DFT) system and an ideal bandpass filter-bank system. These comparisons are made in the context of the NASA Search for Extraterrestrial Intelligence (SETI) microwave observing project (MOP) sky survey. A review of the theory of polyphase-DFT filter banks and its relationship to the well-known windowed-DFT process is presented. The polyphase-DFT system approximates the ideal bandpass filter bank by using as few as eight filter taps per polyphase branch. An improvement in sensitivity of approx. 3 dB over a windowed-DFT system can be obtained by using the polyphase-DFT approach. Sidelobe rejection of the polyphase-DFT system is vastly superior to the windowed-DFT system, thereby improving its performance in the presence of radio frequency interference (RFI).

  10. Heuristic reasoning

    CERN Document Server

    2015-01-01

    How can we advance knowledge? Which methods do we need in order to make new discoveries? How can we rationally evaluate, reconstruct and offer discoveries as a means of improving the ‘method’ of discovery itself? And how can we use findings about scientific discovery to boost funding policies, thus fostering a deeper impact of scientific discovery itself? The respective chapters in this book provide readers with answers to these questions. They focus on a set of issues that are essential to the development of types of reasoning for advancing knowledge, such as models for both revolutionary findings and paradigm shifts; ways of rationally addressing scientific disagreement, e.g. when a revolutionary discovery sparks considerable disagreement inside the scientific community; frameworks for both discovery and inference methods; and heuristics for economics and the social sciences.

  11. Intelligent systems for urban search and rescue: challenges and lessons learned

    Science.gov (United States)

    Jacoff, Adam; Messina, Elena; Weiss, Brian A.

    2003-09-01

    Urban search and rescue (USAR) is one of the most dangerous and time-critical non-wartime activities. Researchers have been developing hardware and software to enable robots to perform some search and rescue functions so as to minimize the exposure of human rescue personnel to danger and maximize the survival of victims. Significant progress has been achieved, but much work remains. USAR demands a blending of numerous specialized technologies. An effective USAR robot must be endowed with key competencies, such as being able to negotiate collapsed structures, find victims and assess their condition, identify potential hazards, generate maps of the structure and victim locations, and communicate with rescue personnel. These competencies bring to bear work in numerous sub-disciplines of intelligent systems (or artificial intelligence) such as sensory processing, world modeling, behavior generation, path planning, and human-robot interaction, in addition to work in communications, mechanism design and advanced sensors. In an attempt to stimulate progress in the field, reference USAR challenges are being developed and propagated worldwide. In order to make efficient use of finite research resources, the robotic USAR community must share a common understanding of what is required, technologically, to attain each competency, and have a rigorous measure of the current level of effectiveness of various technologies. NIST is working with partner organizations to measure the performance of robotic USAR competencies and technologies. In this paper, we describe the reference test arenas for USAR robots, assess the current challenges within the field, and discuss experiences thus far in the testing effort.

  12. Intelligence

    Science.gov (United States)

    Sternberg, Robert J.

    2012-01-01

    Intelligence is the ability to learn from experience and to adapt to, shape, and select environments. Intelligence as measured by (raw scores on) conventional standardized tests varies across the lifespan, and also across generations. Intelligence can be understood in part in terms of the biology of the brain—especially with regard to the functioning in the prefrontal cortex—and also correlates with brain size, at least within humans. Studies of the effects of genes and environment suggest that the heritability coefficient (ratio of genetic to phenotypic variation) is between .4 and .8, although heritability varies as a function of socioeconomic status and other factors. Racial differences in measured intelligence have been observed, but race is a socially constructed rather than biological variable, so such differences are difficult to interpret. PMID:22577301

  13. Intelligence.

    Science.gov (United States)

    Sternberg, Robert J

    2012-03-01

    Intelligence is the ability to learn from experience and to adapt to, shape, and select environments. Intelligence as measured by (raw scores on) conventional standardized tests varies across the lifespan, and also across generations. Intelligence can be understood in part in terms of the biology of the brain-especially with regard to the functioning in the prefrontal cortex-and also correlates with brain size, at least within humans. Studies of the effects of genes and environment suggest that the heritability coefficient (ratio of genetic to phenotypic variation) is between .4 and .8, although heritability varies as a function of socioeconomic status and other factors. Racial differences in measured intelligence have been observed, but race is a socially constructed rather than biological variable, so such differences are difficult to interpret.

  14. The ontology supported intelligent system for experiment search in the scientific Research center

    Directory of Open Access Journals (Sweden)

    Cvjetković Vladimir

    2014-01-01

    Full Text Available Ontologies and corresponding knowledge bases can be quite successfully used for many tasks that rely on domain knowledge and semantic structures, which should be available for machine processing and sharing. Using SPARQL queries for retrieval of required elements from ontologies and knowledge bases, can significantly simplify modeling of arbitrary structures of concepts and data, and implementation of required functionalities. This paper describes developed ontology for support of Research Centre for testing of active substances that conducts scientific experiments. According to created ontology corresponding knowledge base was made and populated with real experimental data. Developed ontology and knowledge base are directly used for an intelligent system of experiment search which is based on many criteria from ontology. Proposed system gets the desired search result, which is actually an experiment in the form of a written report. Presented solution and implementation are very flexible and adaptable, and can be used as kind of a template by similar information system dealing with biological or similar complex system.

  15. Optimum energy re-establishment in distribution systems: a comparison between the search performance using fuzzy heuristics and genetic algorithms; Restabelecimento otimo de energia em sistemas de distribuicao: uma comparacao entre o desempenho de busca com heuristica fuzzy e algoritmos geneticos

    Energy Technology Data Exchange (ETDEWEB)

    Delbem, Alexandre C.B.; Bretas, Newton G. [Sao Paulo Univ., Sao Carlos, SP (Brazil). Dept. de Engenharia Eletrica; Carvalho, Andre C.P.L.F. [Sao Paulo Univ., Sao Carlos, SP (Brazil). Dept. de Ciencias de Computacao e Estatistica

    1996-11-01

    A search approach using fuzzy heuristics and a neural network parameter was developed for service restoration of a distribution system. The goal was to restore energy for an un-faulted zone after a fault had been identified and isolated. The restoration plan must be carried out in a very short period. However, the combinatorial feature of the problem constrained the application of automatic energy restoration planners. To overcome this problem, an heuristic search approach using fuzzy heuristics was proposed. As a result, a genetic algorithm approach was developed to achieve the optimal energy restoration plan. The effectiveness of these approaches were tested in a simplified distribution system based on the complex distribution system of Sao Carlos city, Sao Paulo State - southeast Brazil. It was noticed that the genetic algorithm provided better performance than the fuzzy heuristic search in this problem. 11 refs., 10 figs.

  16. Modeling reproductive decisions with simple heuristics

    Directory of Open Access Journals (Sweden)

    Peter Todd

    2013-10-01

    Full Text Available BACKGROUND Many of the reproductive decisions that humans make happen without much planning or forethought, arising instead through the use of simple choice rules or heuristics that involve relatively little information and processing. Nonetheless, these heuristic-guided decisions are typically beneficial, owing to humans' ecological rationality - the evolved fit between our constrained decision mechanisms and the adaptive problems we face. OBJECTIVE This paper reviews research on the ecological rationality of human decision making in the domain of reproduction, showing how fertility-related decisions are commonly made using various simple heuristics matched to the structure of the environment in which they are applied, rather than being made with information-hungry mechanisms based on optimization or rational economic choice. METHODS First, heuristics for sequential mate search are covered; these heuristics determine when to stop the process of mate search by deciding that a good-enough mate who is also mutually interested has been found, using a process of aspiration-level setting and assessing. These models are tested via computer simulation and comparison to demographic age-at-first-marriage data. Next, a heuristic process of feature-based mate comparison and choice is discussed, in which mate choices are determined by a simple process of feature-matching with relaxing standards over time. Parental investment heuristics used to divide resources among offspring are summarized. Finally, methods for testing the use of such mate choice heuristics in a specific population over time are then described.

  17. Complete local search with memory

    NARCIS (Netherlands)

    Ghosh, D.; Sierksma, G.

    2000-01-01

    Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we introduce a new neighborhood search heuristic

  18. The Breakthrough Listen Search for Intelligent Life: the first SETI results and other future science.

    Science.gov (United States)

    Enriquez, J. Emilio; Breakthrough Listen Team

    2018-01-01

    The Breakthrough Listen (BL) Initiative is the largest campaign in human history on the search for extraterrestrial intelligence. The work presented here is the first BL search for engineered signals. This comprises a sample of 692 nearby stars within 50 pc. We used the Green Bank Telescope (GBT) to conduct observations over 1.1-1.9 GHz (L-band). Our observing strategy allows us to reject most of the detected signals as terrestrial interference. During the analysis, eleven stars show events that passed our thresholding algorithm, but detailed analysis of their properties indicates they are consistent with known examples of anthropogenic radio frequency interference. This small number of false positives and their understood properties give confidence on the techniques used for this search. We conclude that, at the time of our observations none of the observed systems host high-duty-cycle radio transmitters emitting at the observed frequencies with an EIRP of 10^13 W, readily achievable by our own civilization.We can place limits on the presence of engineered signals from putative extraterrestrial civilizations inhabiting the environs of the target stars. Our results suggest that fewer than ~0.1% of the stellar systems within 50 pc possess the type of transmitters searched in this survey. This work provides the most stringent limit on the number of low power radio transmitters around nearby stars to date. We explored several metics to compare our results to previous SETI efforts. We developed a new figure-of-merit that can encompass a wider set of parameters and can be used on future SETI experiments for a meaningful comparison.We note that the current BL state-of-the-art digital backend installed at the Green Bank Observatory is the fastest ever used for a SETI experiment by a factor of a few. Here we will describe the potential use of the BL backend by other groups on complementary science, as well as a mention the ongoing and potential collaborations focused in

  19. AN OPPORTUNISTIC SEARCH FOR EXTRATERRESTRIAL INTELLIGENCE (SETI) WITH THE MURCHISON WIDEFIELD ARRAY

    Energy Technology Data Exchange (ETDEWEB)

    Tingay, S. J.; Tremblay, C.; Walsh, A.; Urquhart, R. [International Centre for Radio Astronomy Research (ICRAR), Curtin University, Bentley, WA 6102 (Australia)

    2016-08-20

    A spectral line image cube generated from 115 minutes of MWA data that covers a field of view of 400 sq, deg. around the Galactic Center is used to perform the first Search for ExtraTerrestrial Intelligence (SETI) with the Murchison Widefield Array (MWA). Our work constitutes the first modern SETI experiment at low radio frequencies, here between 103 and 133 MHz, paving the way for large-scale searches with the MWA and, in the future, the low-frequency Square Kilometre Array. Limits of a few hundred mJy beam{sup −1} for narrowband emission (10 kHz) are derived from our data, across our 400 sq. deg. field of view. Within this field, 45 exoplanets in 38 planetary systems are known. We extract spectra at the locations of these systems from our image cube to place limits on the presence of narrow line emission from these systems. We then derive minimum isotropic transmitter powers for these exoplanets; a small handful of the closest objects (10 s of pc) yield our best limits of order 10{sup 14} W (Equivalent Isotropic Radiated Power). These limits lie above the highest power directional transmitters near these frequencies currently operational on Earth. A SETI experiment with the MWA covering the full accessible sky and its full frequency range would require approximately one month of observing time. The MWA frequency range, its southern hemisphere location on an extraordinarily radio quiet site, its very large field of view, and its high sensitivity make it a unique facility for SETI.

  20. Teaching Planetary Science as Part of the Search for Extraterrestrial Intelligence (SETI)

    Science.gov (United States)

    Margot, Jean-Luc; Greenberg, Adam H.

    2017-10-01

    In Spring 2016 and 2017, UCLA offered a course titled "EPSS C179/279 - Search for Extraterrestrial Intelligence: Theory and Applications". The course is designed for advanced undergraduate students and graduate students in the science, technical, engineering, and mathematical fields. Each year, students designed an observing sequence for the Green Bank telescope, observed known planetary systems remotely, wrote a sophisticated and modular data processing pipeline, analyzed the data, and presented their results. In 2016, 15 students participated in the course (9U, 5G; 11M, 3F) and observed 14 planetary systems in the Kepler field. In 2017, 17 students participated (15U, 2G; 10M, 7F) and observed 10 planetary systems in the Kepler field, TRAPPIST-1, and LHS 1140. In order to select suitable targets, students learned about planetary systems, planetary habitability, and planetary dynamics. In addition to planetary science fundamentals, students learned radio astronomy fundamentals, collaborative software development, signal processing techniques, and statistics. Evaluations indicate that the course is challenging but that students are eager to learn because of the engrossing nature of SETI. Students particularly value the teamwork approach, the observing experience, and working with their own data. The next offering of the course will be in Spring 2018. Additional information about our SETI work is available at seti.ucla.edu.

  1. Search for design intelligence: A field study on the role of emotional intelligence in architectural design studios

    OpenAIRE

    Nazidizaji, Sajjad; Tomé, Ana; Regateiro, Francisco

    2017-01-01

    The design studio is the core of the architecture curriculum. Interpersonal interactions have a key role during the processes of design and critique. The influence of emotional intelligence (EQ) on interpersonal communication skills has been widely proven. This study examines the correlation between EQ and architectural design competence. To achieve this, 78 architecture students were selected via a simple random sampling method and tested using an EQ test questionnaire developed by Bradbury ...

  2. Multiobjective hyper heuristic scheme for system design and optimization

    Science.gov (United States)

    Rafique, Amer Farhan

    2012-11-01

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

  3. Automatic Generation of Heuristics for Scheduling

    Science.gov (United States)

    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.

  4. Characterizing web heuristics

    NARCIS (Netherlands)

    de Jong, Menno D.T.; van der Geest, Thea

    2000-01-01

    This article is intended to make Web designers more aware of the qualities of heuristics by presenting a framework for analyzing the characteristics of heuristics. The framework is meant to support Web designers in choosing among alternative heuristics. We hope that better knowledge of the

  5. A HYBRID HEURISTIC ALGORITHM FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM

    Directory of Open Access Journals (Sweden)

    Mário Mestria

    2016-04-01

    Full Text Available ABSTRACT This paper proposes a hybrid heuristic algorithm, based on the metaheuristics Greedy Randomized Adaptive Search Procedure, Iterated Local Search and Variable Neighborhood Descent, to solve the Clustered Traveling Salesman Problem (CTSP. Hybrid Heuristic algorithm uses several variable neighborhood structures combining the intensification (using local search operators and diversification (constructive heuristic and perturbation routine. In the CTSP, the vertices are partitioned into clusters and all vertices of each cluster have to be visited contiguously. The CTSP is -hard since it includes the well-known Traveling Salesman Problem (TSP as a special case. Our hybrid heuristic is compared with three heuristics from the literature and an exact method. Computational experiments are reported for different classes of instances. Experimental results show that the proposed hybrid heuristic obtains competitive results within reasonable computational time.

  6. The Breakthrough Listen Search for Intelligent Life: Radio Frequency Interference in the Green Bank Telescope

    Science.gov (United States)

    Dana, Ryan

    2018-01-01

    In the search for extra terrestrial intelligence, the vast majority of our “signals of interest,” are simply satellite radio frequency interference. The goal to my research, therefore, was to accurately predict the exact locations of satellites in our sky to analyze specific satellites causing the interference as well as potentially predict when satellites will cross in the way of our beams so that we can further optimize our scripts and get more usable data.I have built an algorithm that plots the exact location in altitude and azimuth of any grouping of satellites that you want in the sky from any position on earth in latitude, longitude, and elevation. From there, you can input a specific right ascension and declination of the location you are trying to track in the sky with a telescope. Using these inputs, we can calculate the angular and positional distance of certain satellites to our beam to further analyze satellite radio frequency interference.The process begins by importing a list of Two Line Element information that the algorithm reads in. Two Line Elements are how Satellites are organized and are updated frequently. They give a variety of information ranging from the Satellite ID to its Mean Motion or anomaly. From there, the code breaks up the information given by these elements to predict their location. The algorithm can also plot in 3D coordinates around an earthlike sphere to conceptualize the route that each Satellite has taken.The code has been used in a variety of ways but most notably to identify satellites interfering with the beam for Arecibo’s Ross 128 Candidate signal. From here, the code will be the backbone to calculating drift rates, Doppler shifts and intensity of certain satellites and why our team consistently receives estranged satellite signals of interest. Furthermore, in the case of a serious candidate signal in the near future, it will be important to analyze satellites interfering in the beam.

  7. Search for design intelligence: A field study on the role of emotional intelligence in architectural design studios

    Directory of Open Access Journals (Sweden)

    Sajjad Nazidizaji

    2014-12-01

    Full Text Available The design studio is the core of the architecture curriculum. Interpersonal interactions have a key role during the processes of design and critique. The influence of emotional intelligence (EQ on interpersonal communication skills has been widely proven. This study examines the correlation between EQ and architectural design competence. To achieve this, 78 architecture students were selected via a simple random sampling method and tested using an EQ test questionnaire developed by Bradbury and Greaves (2006. The scores of five architectural design studio courses (ADS-1, ADS-2, ADS-3, ADS-4, and ADS-5 were used as indicators of the progress in design of the students. Descriptive and inferential statistics methods were both employed to analyze the research data. The methods included correlation analysis, mean comparison t-test for independent samples, and single sample t-test. Findings showed no significant relationship between EQ and any of the indicators.

  8. Path-Wise Test Data Generation Based on Heuristic Look-Ahead Methods

    Directory of Open Access Journals (Sweden)

    Ying Xing

    2014-01-01

    Full Text Available Path-wise test data generation is generally considered an important problem in the automation of software testing. In essence, it is a constraint optimization problem, which is often solved by search methods such as backtracking algorithms. In this paper, the backtracking algorithm branch and bound and state space search in artificial intelligence are introduced to tackle the problem of path-wise test data generation. The former is utilized to explore the space of potential solutions and the latter is adopted to construct the search tree dynamically. Heuristics are employed in the look-ahead stage of the search. Dynamic variable ordering is presented with a heuristic rule to break ties, values of a variable are determined by the monotonicity analysis on branching conditions, and maintaining path consistency is achieved through analysis on the result of interval arithmetic. An optimization method is also proposed to reduce the search space. The results of empirical experiments show that the search is conducted in a basically backtrack-free manner, which ensures both test data generation with promising performance and its excellence over some currently existing static and dynamic methods in terms of coverage. The results also demonstrate that the proposed method is applicable in engineering.

  9. The Search for Extraterrestrial Intelligence (SETI) and Whether to send 'Messages' (METI): A Case for Conversation, Patience and Due Diligence

    Science.gov (United States)

    Brin, D.

    Understanding the controversy over "Messages to Extra Terrestrial Intelligence" or METI requires a grounding in the history and rationale of SETI (Search for ETI). Insights since the turn of the century have changed SETI's scientific basis. Continued null results from the radio search do not invalidate continuing effort, but they do raise questions about long-held assumptions. Modified search strategies are discussed. The Great Silence or Fermi Paradox is appraised, along with the disruptive plausibility of interstellar travel. Psychological motivations for METI are considered. With this underpinning, we consider why a small cadre of SETI-ist radio astronomers have resisted the notion of international consultations before humanity takes a brash and irreversible step into METI, shouting our presence into the cosmos.

  10. Heuristic thinking makes a chemist smart.

    Science.gov (United States)

    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.

  11. Search for microorganisms on Europa and Mars in relation with the evolution of intelligent behavior on other worlds

    International Nuclear Information System (INIS)

    Chela-Flores, Julian

    2001-11-01

    Within the context of how to search for life in the Solar System, we discuss the need to consider universal evolutionary biomarkers, in addition to those of biochemical nature that have already been selected for in the biology experiments of the old Viking and future Beagle-2 landers. For the wider problem of the evolution of intelligent behavior on other worlds (the SETI program), the type of experiments suggested below aim at establishing a direct connection between Solar System exploration and the first steps along the pathway toward the evolution of intelligent behavior. The two leading sites for the implementation of the proposed first whole-cell experiments would be, firstly, Europa after the Europa-Orbiter mission, either on the ice-crust, or in the ocean itself by means of a submersible; secondly, such experiments could be implemented once isolated liquid water oases are identified in the Martian substratum. (author)

  12. Sampling the Radio Transient Universe: Studies of Pulsars and the Search for Extraterrestrial Intelligence

    Science.gov (United States)

    Chennamangalam, Jayanth

    The transient radio universe is a relatively unexplored area of astronomy, offering a variety of phenomena, from solar and Jovian bursts, to flare stars, pulsars, and bursts of Galactic and potentially even cosmological origin. Among these, perhaps the most widely studied radio transients, pulsars are fast-spinning neutron stars that emit radio beams from their magnetic poles. In spite of over 40 years of research on pulsars, we have more questions than answers on these exotic compact objects, chief among them the nature of their emission mechanism. Nevertheless, the wealth of phenomena exhibited by pulsars make them one of the most useful astrophysical tools. With their high densities, pulsars are probes of the nature of ultra-dense matter. Characterized by their high timing stability, pulsars can be used to verify the predictions of general relativity, discover planets around them, study bodies in the solar system, and even serve as an interplanetary (and possibly some day, interstellar) navigation aid. Pulsars are also used to study the nature of the interstellar medium, much like a flashlight illuminating airborne dust in a dark room. Studies of pulsars in the Galactic center can help answer questions about the massive black hole in the region and the star formation history in its vicinity. Millisecond pulsars in globular clusters are long-lived tracers of their progenitors, low-mass X-ray binaries, and can be used to study the dynamical history of those clusters. Another source of interest in radio transient astronomy is the hitherto undetected engineered signal from extraterrestrial intelligence. The Search for Extraterrestrial Intelligence (SETI) is an ongoing attempt at discovering the presence of technological life elsewhere in the Galaxy. In this work, I present my forays into two aspects of the study of the radio transient universe---pulsars and SETI. Firstly, I describe my work on the luminosity function and population size of pulsars in the globular

  13. Heuristic decision making.

    Science.gov (United States)

    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.

  14. Creativity Styles and Emotional Intelligence of Filipino Student Teachers: A Search for Congruity

    Directory of Open Access Journals (Sweden)

    Gilbert C. Magulod Jr.

    2017-02-01

    Full Text Available The purpose of this study is to determine the congruity between the creativity styles and emotional intelligence of Filipino student teachers. Descriptive correlational research design was employed. The participants of the study were the 76 fourth year students of Bachelor in Elementary Education (BEED and Bachelor in Secondary Education (BSED in one state university in the Philippines. Data of the study were obtained using two standardized instruments relating to creativity styles and emotional intelligence. Findings of the study revealed that the student teachers espoused themselves to have high creative capacity while they assessed themselves to have high creativity styles along belief in unconscious processes, use of techniques, use of other people and final product orientation. With regards to their emotional intelligence, they assessed themselves to have high attributes on self-awareness, management of emotions, self-motivation, empathy and social skills. Significantly, this study also revealed that gender, birth order, course and scholastic standing in high school spelled differences on the creativity styles of Filipino student teachers. Moreover, test of difference also showed that scholastic standing in high school and family income defined differences along emotional intelligence. Finally, it was also revealed in the study that there is a significant relationship between creativity styles and emotional intelligence of Filipino student teachers. Implications of the congruity between emotional intelligence and creativity styles would help Teacher Education Institutions (TEIs to implement curriculum enhancement which is vital to the preparation of twenty-first century teachers.

  15. The internet and intelligent machines: search engines, agents and robots; Radiologische Informationssuche im Internet: Datenbanken, Suchmaschinen und intelligente Agenten

    Energy Technology Data Exchange (ETDEWEB)

    Achenbach, S; Alfke, H [Marburg Univ. (Germany). Abt. fuer Strahlendiagnostik

    2000-04-01

    The internet plays an important role in a growing number of medical applications. Finding relevant information is not always easy as the amount of available information on the Web is rising quickly. Even the best Search Engines can only collect links to a fraction of all existing Web pages. In addition, many of these indexed documents have been changed or deleted. The vast majority of information on the Web is not searchable with conventional methods. New search strategies, technologies and standards are combined in Intelligent Search Agents (ISA) an Robots, which can retrieve desired information in a specific approach. Conclusion: The article describes differences between ISAs and conventional Search Engines and how communication between Agents improves their ability to find information. Examples of existing ISAs are given and the possible influences on the current and future work in radiology is discussed. (orig.) [German] Das Internet findet zunehmend in medizinischen Anwendungen Verbreitung, jedoch ist das Auffinden relevanter Informationen nicht immer leicht. Die Anzahl der verfuegbaren Dokumente im World wide web nimmt so schnell zu, dass die Suche zunehmend Probleme bereitet: Auch gute Suchmaschinen erfassen nur einige Prozent der vorhandenen Seiten in Ihren Datenbanken. Zusaetzlich sorgen staendige Veraenderungen dafuer, dass nur ein Teil dieser durchsuchbaren Dokumente ueberhaupt noch existiert. Der Grossteil des Internets ist daher mit konventionellen Methoden nicht zu erschliessen. Neue Standards, Suchstrategien und Technologien vereinen sich in den Suchagenten und Robots, die gezielter und intelligenter Inhalte ermitteln koennen. Schlussfolgerung: Der Artikel stellt dar, wie sich ein Intelligent search agent (ISA) von einer Suchmaschine unterscheidet und durch Kooperation mit anderen Agenten die Anforderungen der Benutzer besser erfuellen kann. Neben den Grundlagen werden exemplarische Anwendungen gezeigt, die heute im Netz existieren, und ein Ausblick

  16. A grouping hyper-heuristic framework: application on graph colouring

    OpenAIRE

    Elhag, Anas; Özcan, Ender

    2015-01-01

    Grouping problems are hard to solve combinatorial optimisation problems which require partitioning of objects into a minimum number of subsets while a given objective is simultaneously optimised. Selection hyper-heuristics are high level general purpose search methodologies that operate on a space formed by a set of low level heuristics rather than solutions. Most of the recently proposed selection hyper-heuristics are iterative and make use of two key methods which are employed successively;...

  17. Adaptive Large Neighbourhood Search

    DEFF Research Database (Denmark)

    Røpke, Stefan

    Large neighborhood search is a metaheuristic that has gained popularity in recent years. The heuristic repeatedly moves from solution to solution by first partially destroying the solution and then repairing it. The best solution observed during this search is presented as the final solution....... This tutorial introduces the large neighborhood search metaheuristic and the variant adaptive large neighborhood search that dynamically tunes parameters of the heuristic while it is running. Both heuristics belong to a broader class of heuristics that are searching a solution space using very large...... neighborhoods. The tutorial also present applications of the adaptive large neighborhood search, mostly related to vehicle routing problems for which the heuristic has been extremely successful. We discuss how the heuristic can be parallelized and thereby take advantage of modern desktop computers...

  18. HEURISTICS IN DECISION MAKING

    Directory of Open Access Journals (Sweden)

    I PUTU SUDANA

    2011-01-01

    Full Text Available Prinsip heuristics tidak dapat dikatakan sebagai sebuah pendekatanpengambilan keputusan yang non-rasional, karena penerapan atau penggunaanyang unconscious atau subtle mind tidak dapat dianggap sebagai tindakanyang irrational. Dengan alasan tersebut, terdapat cukup alasan untukmenyatakan bahwa pengklasifikasian pendekatan-pendekatan keputusansemestinya menggunakan terminologi analytical dan experiential, dan bukanmemakai istilah rational dan non-rational seperti yang umumnya diikuti.Penerapan pendekatan heuristics dapat ditemukan pada berbagai disiplin,termasuk bisnis dan akuntansi. Topik heuristics semestinya mendapatperhatian yang cukup luas dari para periset di bidang akuntansi. Bidangbehavioral research in accounting menawarkan banyak kemungkinan untukdikaji, karena prinsip heuristics bertautan erat dengan aspek manusia sebagaipelaku dalam pengambilan keputusan.

  19. iPixel: a visual content-based and semantic search engine for retrieving digitized mammograms by using collective intelligence.

    Science.gov (United States)

    Alor-Hernández, Giner; Pérez-Gallardo, Yuliana; Posada-Gómez, Rubén; Cortes-Robles, Guillermo; Rodríguez-González, Alejandro; Aguilar-Laserre, Alberto A

    2012-09-01

    Nowadays, traditional search engines such as Google, Yahoo and Bing facilitate the retrieval of information in the format of images, but the results are not always useful for the users. This is mainly due to two problems: (1) the semantic keywords are not taken into consideration and (2) it is not always possible to establish a query using the image features. This issue has been covered in different domains in order to develop content-based image retrieval (CBIR) systems. The expert community has focussed their attention on the healthcare domain, where a lot of visual information for medical analysis is available. This paper provides a solution called iPixel Visual Search Engine, which involves semantics and content issues in order to search for digitized mammograms. iPixel offers the possibility of retrieving mammogram features using collective intelligence and implementing a CBIR algorithm. Our proposal compares not only features with similar semantic meaning, but also visual features. In this sense, the comparisons are made in different ways: by the number of regions per image, by maximum and minimum size of regions per image and by average intensity level of each region. iPixel Visual Search Engine supports the medical community in differential diagnoses related to the diseases of the breast. The iPixel Visual Search Engine has been validated by experts in the healthcare domain, such as radiologists, in addition to experts in digital image analysis.

  20. Searching for South Asian intelligence: psychometry in British India, 1919-1940.

    Science.gov (United States)

    Setlur, Shivrang

    2014-01-01

    This paper describes the introduction and development of intelligence testing in British India. Between 1919 and 1940 experimenters such as C. Herbert Rice, Prasanta Chandra Mahalanobis, and Venkatrao Vithal Kamat imported a number of intelligence tests, adapting them to suit a variety of South Asian languages and contexts. Charting South Asian psychometry's gradual move from American missionary efforts toward the state, this paper argues that political reforms in the 1920s and 1930s affected how psychometry was "indigenized" in South Asia. Describing how approaches to race and caste shifted across instruments and over time, this paper charts the gradual recession, within South Asian psychometry, of a "race" theory of caste. Describing some of the ways in which this "late colonial" period affected the postcolonial landscape, the paper concludes by suggesting potential lines for further inquiry into the later career of intelligence testing in India and Pakistan. © 2014 Wiley Periodicals, Inc.

  1. Intelligible Artificial Intelligence

    OpenAIRE

    Weld, Daniel S.; Bansal, Gagan

    2018-01-01

    Since Artificial Intelligence (AI) software uses techniques like deep lookahead search and stochastic optimization of huge neural networks to fit mammoth datasets, it often results in complex behavior that is difficult for people to understand. Yet organizations are deploying AI algorithms in many mission-critical settings. In order to trust their behavior, we must make it intelligible --- either by using inherently interpretable models or by developing methods for explaining otherwise overwh...

  2. Interface Design Concepts in the Development of ELSA, an Intelligent Electronic Library Search Assistant.

    Science.gov (United States)

    Denning, Rebecca; Smith, Philip J.

    1994-01-01

    Describes issues and advances in the design of appropriate inference engines and knowledge structures needed by commercially feasible intelligent intermediary systems for information retrieval. Issues associated with the design of interfaces to such functions are discussed in detail. Design principles for guiding implementation of these interfaces…

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

    Science.gov (United States)

    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 &…

  4. Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems

    OpenAIRE

    Petrovic, Sanja; Qu, Rong

    2002-01-01

    This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given timetabling problems according to the knowledge stored in the case base. KD in CBR is a 2-stage iterative process on both case representation and the case base. Experimental results are analysed and related research issues for future work are dis...

  5. When is Information Sufficient for Action Search with Unreliable Yet Informative Intelligence

    Science.gov (United States)

    2016-03-30

    specificity. Math . Methods Oper. Res. 68(3): 539–549. Lange R-J (2012) Brownian motion and multidimensional decision making. Unpublished doctoral...intelligence assets, political ramifications, etc. We describe the problem in §2 and formulate the mathe - matical model in §3. The cases of n= 2 and n...boundary problem in n dimensions. When n> 2 cells, our problem relates to the family of multinomial selection problems (Kim and Nelson 2006) in which an

  6. Using tree diversity to compare phylogenetic heuristics.

    Science.gov (United States)

    Sul, Seung-Jin; Matthews, Suzanne; Williams, Tiffani L

    2009-04-29

    Evolutionary trees are family trees that represent the relationships between a group of organisms. Phylogenetic heuristics are used to search stochastically for the best-scoring trees in tree space. Given that better tree scores are believed to be better approximations of the true phylogeny, traditional evaluation techniques have used tree scores to determine the heuristics that find the best scores in the fastest time. We develop new techniques to evaluate phylogenetic heuristics based on both tree scores and topologies to compare Pauprat and Rec-I-DCM3, two popular Maximum Parsimony search algorithms. Our results show that although Pauprat and Rec-I-DCM3 find the trees with the same best scores, topologically these trees are quite different. Furthermore, the Rec-I-DCM3 trees cluster distinctly from the Pauprat trees. In addition to our heatmap visualizations of using parsimony scores and the Robinson-Foulds distance to compare best-scoring trees found by the two heuristics, we also develop entropy-based methods to show the diversity of the trees found. Overall, Pauprat identifies more diverse trees than Rec-I-DCM3. Overall, our work shows that there is value to comparing heuristics beyond the parsimony scores that they find. Pauprat is a slower heuristic than Rec-I-DCM3. However, our work shows that there is tremendous value in using Pauprat to reconstruct trees-especially since it finds identical scoring but topologically distinct trees. Hence, instead of discounting Pauprat, effort should go in improving its implementation. Ultimately, improved performance measures lead to better phylogenetic heuristics and will result in better approximations of the true evolutionary history of the organisms of interest.

  7. We favor formal models of heuristics rather than lists of loose dichotomies : A reply to Evans and Over

    OpenAIRE

    Marewski, J.; Gaissmaier, W.; Gigerenzer, G.

    2010-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 a...

  8. The role of heuristics in automated theorem proving J.A Robinson's resolution principle

    OpenAIRE

    Coderschi, Roberto

    1996-01-01

    The aim of this paper is to show how J.A. Robinson's resolution principle was perceived and discussed in the AI community between the mid sixties and the first seventies. During this time the so called ``heuristic search paradigm" was still influential in the AI community, and both resolution principle and certain resolution based, apparently human-like, search strategies were matched with those problem solving heuristic procedures which were representative of the AI heuristic search paradigm.

  9. The Breakthrough Listen Search for Intelligent Life: 1.1-1.9 GHz Observations of 692 Nearby Stars

    Science.gov (United States)

    Enriquez, J. Emilio; Siemion, Andrew; Foster, Griffin; Gajjar, Vishal; Hellbourg, Greg; Hickish, Jack; Isaacson, Howard; Price, Danny C.; Croft, Steve; DeBoer, David; Lebofsky, Matt; MacMahon, David H. E.; Werthimer, Dan

    2017-11-01

    We report on a search for engineered signals from a sample of 692 nearby stars using the Robert C. Byrd Green Bank Telescope, undertaken as part of the Breakthrough Listen Initiative search for extraterrestrial intelligence. Observations were made over 1.1-1.9 GHz (L band), with three sets of five-minute observations of the 692 primary targets, interspersed with five-minute observations of secondary targets. By comparing the “ON” and “OFF” observations, we are able to identify terrestrial interference and place limits on the presence of engineered signals from putative extraterrestrial civilizations inhabiting the environs of the target stars. During the analysis, 11 events passed our thresholding algorithm, but a detailed analysis of their properties indicates that they are consistent with known examples of anthropogenic radio-frequency interference. We conclude that, at the time of our observations, none of the observed systems host high-duty-cycle radio transmitters emitting between 1.1 and 1.9 GHz with an Equivalent Isotropic Radiated Power of ˜1013 W, which is readily achievable by our own civilization. Our results suggest that fewer than ˜0.1% of the stellar systems within 50 pc possess the type of transmitters searched in this survey.

  10. Pitfalls in Teaching Judgment Heuristics

    Science.gov (United States)

    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…

  11. An analysis of generalised heuristics for vehicle routing and personnel rostering problems

    OpenAIRE

    Mustafa Misir; Pieter Smet; Greet Vanden Berghe

    2015-01-01

    The present study investigates the performance of heuristics while solving problems with routing and rostering characteristics. The target problems include scheduling and routing home care, security and maintenance personnel. In analysing the behaviour of the heuristics and determining the requirements for solving the aforementioned problems, the winning hyper-heuristic from the first International Cross-domain Heuristic Search Challenge (CHeSC 2011) is employed. The completely new applicatio...

  12. An integral heuristic

    International Nuclear Information System (INIS)

    Kauffman, L.H.

    1990-01-01

    This paper gives a heuristic derivation of the skein relation for the Homfly polynomial in an integral formalism. The derivation is formally correct but highly simplified. In the light of Witten's proposal for invariants of links via functional integrals, it is useful to have a formal pattern to compare with the complexities of the full approach. The formalism is a heuristic. However, it is closely related to the actual structure of the Witten functional integral

  13. Intelligence Ethics:

    DEFF Research Database (Denmark)

    Rønn, Kira Vrist

    2016-01-01

    Questions concerning what constitutes a morally justified conduct of intelligence activities have received increased attention in recent decades. However, intelligence ethics is not yet homogeneous or embedded as a solid research field. The aim of this article is to sketch the state of the art...... of intelligence ethics and point out subjects for further scrutiny in future research. The review clusters the literature on intelligence ethics into two groups: respectively, contributions on external topics (i.e., the accountability of and the public trust in intelligence agencies) and internal topics (i.......e., the search for an ideal ethical framework for intelligence actions). The article concludes that there are many holes to fill for future studies on intelligence ethics both in external and internal discussions. Thus, the article is an invitation – especially, to moral philosophers and political theorists...

  14. Hyper-heuristics with low level parameter adaptation.

    Science.gov (United States)

    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.

  15. Modeling an Optical and Infrared Search for Extraterrestrial Intelligence Survey with Exoplanet Direct Imaging

    Science.gov (United States)

    Vides, Christina; Macintosh, Bruce; Ruffio, Jean-Baptiste; Nielsen, Eric; Povich, Matthew Samuel

    2018-01-01

    Gemini Planet Imager (GPI) is a direct high contrast imaging instrument coupled to the Gemini South Telescope. Its purpose is to image extrasolar planets around young (~Intelligence), we modeled GPI’s capabilities to detect an extraterrestrial continuous wave (CW) laser broadcasted within the H-band have been modeled. By using sensitivity evaluated for actual GPI observations of young target stars, we produced models of the CW laser power as a function of distance from the star that could be detected if GPI were to observe nearby (~ 3-5 pc) planet-hosting G-type stars. We took a variety of transmitters into consideration in producing these modeled values. GPI is known to be sensitive to both pulsed and CW coherent electromagnetic radiation. The results were compared to similar studies and it was found that these values are competitive to other optical and infrared observations.

  16. Searching for a neurologic injury's Wechsler Adult Intelligence Scale-Third Edition profile.

    Science.gov (United States)

    Gonçalves, Marta A; Moura, Octávio; Castro-Caldas, Alexandre; Simões, Mário R

    2017-01-01

    This study aimed to investigate the presence of a Wechsler Adult Intelligence Scale-Third Edition (WAIS-III) cognitive profile in a Portuguese neurologic injured sample. The Portuguese WAIS-III was administered to 81 mixed neurologic patients and 81 healthy matched controls selected from the Portuguese standardization sample. Although the mixed neurologic injury group performed significantly lower than the healthy controls for the majority of the WAIS-III scores (i.e., composite measures, discrepancies, and subtests), the mean scores were within the normal range and, therefore, at risk of being unobserved in a clinical evaluation. ROC curves analysis showed poor to acceptable diagnostic accuracy for the WAIS-III composite measures and subtests (Working Memory Index and Digit Span revealed the highest accuracy for discriminating between participants, respectively). Multiple regression analysis showed that both literacy and the presence of brain injury were significant predictors for all of the composite measures. In addition, multiple regression analysis also showed that literacy, age of injury onset, and years of survival predicted all seven composite measures for the mixed neurologic injured group. Despite the failure to find a WAIS-III cognitive profile for mixed neurologic patients, the results showed a significant influence of brain lesion and literacy in the performance of the WAIS-III.

  17. A genetic algorithm selection perturbative hyper-heuristic for solving ...

    African Journals Online (AJOL)

    Table 1: A summary of the characteristics of the artificial school timetabling problems. ..... One of the disadvantages of hyper-heuristics is the higher runtimes as a result .... 455–464 in AI 2002: Advances in Artificial Intelligence, Springer Berlin ...

  18. A literature search tool for intelligent extraction of disease-associated genes.

    Science.gov (United States)

    Jung, Jae-Yoon; DeLuca, Todd F; Nelson, Tristan H; Wall, Dennis P

    2014-01-01

    To extract disorder-associated genes from the scientific literature in PubMed with greater sensitivity for literature-based support than existing methods. We developed a PubMed query to retrieve disorder-related, original research articles. Then we applied a rule-based text-mining algorithm with keyword matching to extract target disorders, genes with significant results, and the type of study described by the article. We compared our resulting candidate disorder genes and supporting references with existing databases. We demonstrated that our candidate gene set covers nearly all genes in manually curated databases, and that the references supporting the disorder-gene link are more extensive and accurate than other general purpose gene-to-disorder association databases. We implemented a novel publication search tool to find target articles, specifically focused on links between disorders and genotypes. Through comparison against gold-standard manually updated gene-disorder databases and comparison with automated databases of similar functionality we show that our tool can search through the entirety of PubMed to extract the main gene findings for human diseases rapidly and accurately.

  19. SIGNAL - Search for Intelligence in the Galactic Nucleus with the Array of the Lowlands

    International Nuclear Information System (INIS)

    Shostak, G.S.; Tarter, J.

    1982-01-01

    In August, 1981, the Westerbork Synthesis Radio Telescope was used for 4 hours to search for narrow-band radio beacons in the direction of the Galactic Center. By using both the spatial discrimination and temporal stability available to an interferometric measurement, weak intermittent signals can be detected even in the face of the strong, naturally-caused radiation from this region. A radio beacon within the bandwidth used here, centered on the 21-cm neutral hydrogen line, would be recognizable if it had a repetition period between 40 sec and several hours. The rms sensitivity to point sources is approximately 20 mJy, or many orders of magnitude better than typical sensitivities achieved by scanning single-dish instruments

  20. Heuristic approach to train rescheduling

    Directory of Open Access Journals (Sweden)

    Mladenović Snežana

    2007-01-01

    Full Text Available Starting from the defined network topology and the timetable assigned beforehand, the paper considers a train rescheduling in respond to disturbances that have occurred. Assuming that the train trips are jobs, which require the elements of infrastructure - resources, it was done by the mapping of the initial problem into a special case of job shop scheduling problem. In order to solve the given problem, a constraint programming approach has been used. A support to fast finding "enough good" schedules is offered by original separation, bound and search heuristic algorithms. In addition, to improve the time performance, instead of the actual objective function with a large domain, a surrogate objective function is used with a smaller domain, if there is such. .

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

    Directory of Open Access Journals (Sweden)

    Mostefa RAHLI

    2006-07-01

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

  2. Heuristics for the economic dispatch problem

    Energy Technology Data Exchange (ETDEWEB)

    Flores, Benjamin Carpio [Centro Nacional de Controle de Energia (CENACE), Mexico, D.F. (Mexico). Dept. de Planificacion Economica de Largo Plazo], E-mail: benjamin.carpo@cfe.gob.mx; Laureano Cruces, A L; Lopez Bracho, R; Ramirez Rodriguez, J. [Universidad Autonoma Metropolitana (UAM), Mexico, D.F. (Brazil). Dept. de Sistemas], Emails: clc@correo.azc.uam.mx, rlb@correo.azc.uam.mx, jararo@correo.azc.uam.mx

    2009-07-01

    This paper presents GRASP (Greedy Randomized Adaptive Search Procedure), Simulated Annealing (SAA), Genetic (GA), and Hybrid Genetic (HGA) Algorithms for the economic dispatch problem (EDP), considering non-convex cost functions and dead zones the only restrictions, showing the results obtained. We also present parameter settings that are specifically applicable to the EDP, and a comparative table of results for each heuristic. It is shown that these methods outperform the classical methods without the need to assume convexity of the target function. (author)

  3. The Breakthrough Listen Search for Intelligent Life: Data Calibration using Pulsars

    Science.gov (United States)

    Brinkman-Traverse, Casey Lynn; Gajjar, Vishal; BSRC

    2018-01-01

    The ability to distinguish ET signals requires a deep understanding of the radio telescopes with which we search; therefore, before we observe stars of interest, the Breathrough Listen scientists at Berkeley SETI Research Center first observe a Pulsar with well-documented flux and polarization properties. The process of calibrating the flux and polarization is a lengthy process by hand, so we produced a pipeline code that will automatically calibrate the pulsar in under an hour. Using PSRCHIVE the code coherently dedisperses the pulsed radio signals, and then calibrates the flux using observation files with a noise diode turning on and off. The code was developed using PSR B1937+ 21 and is primarily used on PSR B0329+54. This will expedite the process of assessing the quality of data collected from the Green Bank Telescope in West Virginia and will allow us to more efficiently find life beyond Planet Earth. Additionally, the stability of the B0329+54 calibration data will allow us to analyze data taken on FRB's with confidence of its cosmic origin.

  4. Heuristic decision making in medicine

    Science.gov (United States)

    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

  5. Heuristic decision making in medicine.

    Science.gov (United States)

    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.

  6. Efficient heuristics for the Rural Postman Problem

    Directory of Open Access Journals (Sweden)

    GW Groves

    2005-06-01

    Full Text Available A local search framework for the (undirected Rural Postman Problem (RPP is presented in this paper. The framework allows local search approaches that have been applied successfully to the well–known Travelling Salesman Problem also to be applied to the RPP. New heuristics for the RPP, based on this framework, are introduced and these are capable of solving significantly larger instances of the RPP than have been reported in the literature. Test results are presented for a number of benchmark RPP instances in a bid to compare efficiency and solution quality against known methods.

  7. Heuristics for the Robust Coloring Problem

    Directory of Open Access Journals (Sweden)

    Miguel Ángel Gutiérrez Andrade

    2011-03-01

    Full Text Available Let $G$ and $\\bar{G}$ be complementary graphs. Given a penalty function defined on the edges of $G$, we will say that the rigidity of a $k$-coloring of $G$ is the sum of the penalties of the edges of G joining vertices of the same color. Based on the previous definition, the Robust Coloring Problem (RCP is stated as the search of the minimum rigidity $k$-coloring. In this work a comparison of heuristics based on simulated annealing, GRASP and scatter search is presented. These are the best results for the RCP that have been obtained.

  8. Heuristics in Conflict Resolution

    OpenAIRE

    Drescher, Christian; Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten

    2010-01-01

    Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven learning and related techniques constitute key features whose application is enabled by conflict analysis. Although various conflict analysis schemes have been proposed, implemented, and studied both theoretically and practically in the SAT area, the heuristic aspects involved in conflict analysis have not yet receive...

  9. Large Neighborhood Search

    DEFF Research Database (Denmark)

    Pisinger, David; Røpke, Stefan

    2010-01-01

    Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better...... candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method,we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood...

  10. Exact and Heuristic Algorithms for Runway Scheduling

    Science.gov (United States)

    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.

  11. A System for Automatically Generating Scheduling Heuristics

    Science.gov (United States)

    Morris, Robert

    1996-01-01

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

  12. Heuristics for Multidimensional Packing Problems

    DEFF Research Database (Denmark)

    Egeblad, Jens

    for a minimum height container required for the items. The main contributions of the thesis are three new heuristics for strip-packing and knapsack packing problems where items are both rectangular and irregular. In the two first papers we describe a heuristic for the multidimensional strip-packing problem...... that is based on a relaxed placement principle. The heuristic starts with a random overlapping placement of items and large container dimensions. From the overlapping placement overlap is reduced iteratively until a non-overlapping placement is found and a new problem is solved with a smaller container size...... of this heuristic are among the best published in the literature both for two- and three-dimensional strip-packing problems for irregular shapes. In the third paper, we introduce a heuristic for two- and three-dimensional rectangular knapsack packing problems. The two-dimensional heuristic uses the sequence pair...

  13. Artificial Intelligence and Moral intelligence

    Directory of Open Access Journals (Sweden)

    Laura Pana

    2008-07-01

    Full Text Available We discuss the thesis that the implementation of a moral code in the behaviour of artificial intelligent systems needs a specific form of human and artificial intelligence, not just an abstract intelligence. We present intelligence as a system with an internal structure and the structural levels of the moral system, as well as certain characteristics of artificial intelligent agents which can/must be treated as 1- individual entities (with a complex, specialized, autonomous or selfdetermined, even unpredictable conduct, 2- entities endowed with diverse or even multiple intelligence forms, like moral intelligence, 3- open and, even, free-conduct performing systems (with specific, flexible and heuristic mechanisms and procedures of decision, 4 – systems which are open to education, not just to instruction, 5- entities with “lifegraphy”, not just “stategraphy”, 6- equipped not just with automatisms but with beliefs (cognitive and affective complexes, 7- capable even of reflection (“moral life” is a form of spiritual, not just of conscious activity, 8 – elements/members of some real (corporal or virtual community, 9 – cultural beings: free conduct gives cultural value to the action of a ”natural” or artificial being. Implementation of such characteristics does not necessarily suppose efforts to design, construct and educate machines like human beings. The human moral code is irremediably imperfect: it is a morality of preference, of accountability (not of responsibility and a morality of non-liberty, which cannot be remedied by the invention of ethical systems, by the circulation of ideal values and by ethical (even computing education. But such an imperfect morality needs perfect instruments for its implementation: applications of special logic fields; efficient psychological (theoretical and technical attainments to endow the machine not just with intelligence, but with conscience and even spirit; comprehensive technical

  14. An Heuristic Framework for Non-Conscious Reasoning

    Directory of Open Access Journals (Sweden)

    Felipe Lara-Rosano

    2017-11-01

    Full Text Available Human non-conscious reasoning is one of the most successful procedures evolved for the purposes of solving everyday problems in an efficient way. This is why the field of artificial intelligence should analyze, formalize and emulate the multiple ways of non-conscious reasoning with the purpose of applying them in human problem solving tasks, like medical diagnostics and treatments, educational diagnostics and intervention, organizational and political decision making, artificial intelligence knowledge based systems and neurocomputers, automatic control systems and similar devices for aiding people in the problem-solving process. In this paper, a heuristic framework for those non-conscious ways of reasoning is presented based on neurocognitive representations, heuristics, and fuzzy sets.

  15. General k-opt submoves for the Lin-Kernighan TSP heuristic

    DEFF Research Database (Denmark)

    Helsgaun, Keld

    2009-01-01

    Local search with k-exchange neighborhoods, k-opt, is the most widely used heuristic method for the traveling salesman problem (TSP). This paper presents an effective implementation of k-opt in LKH-2, a variant of the Lin–Kernighan TSP heuristic. The effectiveness of the implementation...

  16. An Effective Implementation of K-opt Moves for the Lin-Kernighan TSP Heuristic

    DEFF Research Database (Denmark)

    Helsgaun, Keld

    Local search with k-change neighborhoods, k-opt, is the most widely used heuristic method for the traveling salesman problem (TSP). This report presents an effective implementation of k-opt for the Lin- Kernighan TSP heuristic. The effectiveness of the implementation is demonstrated with extensive...

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

    Science.gov (United States)

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

    2011-01-01

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

  18. Heuristics Reasoning in Diagnostic Judgment.

    Science.gov (United States)

    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)

  19. Reexamining Our Bias against Heuristics

    Science.gov (United States)

    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…

  20. HEURISTIC APPROACHES FOR PORTFOLIO OPTIMIZATION

    OpenAIRE

    Manfred Gilli, Evis Kellezi

    2000-01-01

    The paper first compares the use of optimization heuristics to the classical optimization techniques for the selection of optimal portfolios. Second, the heuristic approach is applied to problems other than those in the standard mean-variance framework where the classical optimization fails.

  1. Paranoid thinking as a heuristic.

    Science.gov (United States)

    Preti, Antonio; Cella, Matteo

    2010-08-01

    Paranoid thinking can be viewed as a human heuristic used by individuals to deal with uncertainty during stressful situations. Under stress, individuals are likely to emphasize the threatening value of neutral stimuli and increase the reliance on paranoia-based heuristic to interpreter events and guide their decisions. Paranoid thinking can also be activated by stress arising from the possibility of losing a good opportunity; this may result in an abnormal allocation of attentional resources to social agents. A better understanding of the interplay between cognitive heuristics and emotional processes may help to detect situations in which paranoid thinking is likely to exacerbate and improve intervention for individuals with delusional disorders.

  2. Structural Sustainability - Heuristic Approach

    Science.gov (United States)

    Rostański, Krzysztof

    2017-10-01

    Nowadays, we are faced with a challenge of having to join building structures with elements of nature, which seems to be the paradigm of modern planning and design. The questions arise, however, with reference to the following categories: the leading idea, the relation between elements of nature and buildings, the features of a structure combining such elements and, finally, our perception of this structure. If we consider both the overwhelming globalization and our attempts to preserve local values, the only reasonable solution is to develop naturalistic greenery. It can add its uniqueness to any building and to any developed area. Our holistic model, presented in this paper, contains the above mentioned categories within the scope of naturalism. The model is divided into principles, actions related, and possible effects to be obtained. It provides a useful tool for determining the ways and priorities of our design. Although it is not possible to consider all possible actions and solutions in order to support sustainability in any particular design, we can choose, however, a proper mode for our design according to the local conditions by turning to the heuristic method, which helps to choose priorities and targets. Our approach is an attempt to follow the ways of nature as in the natural environment it is optimal solutions that appear and survive, idealism being the domain of mankind only. We try to describe various natural processes in a manner comprehensible to us, which is always a generalization. Such definitions, however, called artificial by naturalists, are presented as art or the current state of knowledge by artists and engineers. Reality, in fact, is always more complicated than its definitions. The heuristic method demonstrates the way how to optimize our design. It requires that all possible information about the local environment should be gathered, as the more is known, the fewer mistakes are made. Following the unquestionable principles, we can

  3. Extended-Search, Bézier Curve-Based Lane Detection and Reconstruction System for an Intelligent Vehicle

    Directory of Open Access Journals (Sweden)

    Xiaoyun Huang

    2015-09-01

    Full Text Available To improve the real-time performance and detection rate of a Lane Detection and Reconstruction (LDR system, an extended-search-based lane detection method and a Bézier curve-based lane reconstruction algorithm are proposed in this paper. The extended-search-based lane detection method is designed to search boundary blocks from the initial position, in an upwards direction and along the lane, with small search areas including continuous search, discontinuous search and bending search in order to detect different lane boundaries. The Bézier curve-based lane reconstruction algorithm is employed to describe a wide range of lane boundary forms with comparatively simple expressions. In addition, two Bézier curves are adopted to reconstruct the lanes' outer boundaries with large curvature variation. The lane detection and reconstruction algorithm — including initial-blocks' determining, extended search, binarization processing and lane boundaries' fitting in different scenarios — is verified in road tests. The results show that this algorithm is robust against different shadows and illumination variations; the average processing time per frame is 13 ms. Significantly, it presents an 88.6% high-detection rate on curved lanes with large or variable curvatures, where the accident rate is higher than that of straight lanes.

  4. Heuristic introduction to gravitational waves

    International Nuclear Information System (INIS)

    Sandberg, V.D.

    1982-01-01

    The purpose of this article is to provide a rough and somewhat heuristic theoretical background and introduction to gravitational radiation, its generation, and its detection based on Einstein's general theory of relativity

  5. We favor formal models of heuristics rather than lists of loose dichotomies: a reply to Evans and Over

    Science.gov (United States)

    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

  6. Crowd-Sourced Intelligence Agency: Prototyping counterveillance

    OpenAIRE

    Jennifer Gradecki; Derek Curry

    2017-01-01

    This paper discusses how an interactive artwork, the Crowd-Sourced Intelligence Agency (CSIA), can contribute to discussions of Big Data intelligence analytics. The CSIA is a publicly accessible Open Source Intelligence (OSINT) system that was constructed using information gathered from technical manuals, research reports, academic papers, leaked documents, and Freedom of Information Act files. Using a visceral heuristic, the CSIA demonstrates how the statistical correlations made by automate...

  7. Heuristic reasoning and relative incompleteness

    OpenAIRE

    Treur, J.

    1993-01-01

    In this paper an approach is presented in which heuristic reasoning is interpreted as strategic reasoning. This type of reasoning enables one to derive which hypothesis to investigate, and which observable information to acquire next (to be able to verify the chosen hypothesis). A compositional architecture for reasoning systems that perform such heuristic reasoning is introduced, called SIX (for Strategic Interactive eXpert systems). This compositional architecture enables user interaction a...

  8. On the Construction of a Micro-World and the Design of a Path Finding Intelligent Agent with Applications in Robotics and Game Design

    Directory of Open Access Journals (Sweden)

    Cristian Moldovan

    2017-12-01

    Full Text Available This paper presents research regarding the behavior of an IA (Intelligent Agent in a MW (Micro-World, a maze-like environment, when it has to find a path from Start to Target position. The IA’s behavior is controlled via an Informed Search Algorithm. Its perception is limited only to one tile in the N, V, S and E direction, it has no prior knowledge of the search space, it has memory on the co-ordinates of already visited path and we implement a heuristic function to direct the IA to the Target.

  9. Heuristic space diversity management in a meta-hyper-heuristic framework

    CSIR Research Space (South Africa)

    Grobler, J

    2014-07-01

    Full Text Available This paper introduces the concept of heuristic space diversity and investigates various strategies for the management of heuristic space diversity within the context of a meta-hyper-heuristic algorithm. Evaluation on a diverse set of floating...

  10. Intelligence in Artificial Intelligence

    OpenAIRE

    Datta, Shoumen Palit Austin

    2016-01-01

    The elusive quest for intelligence in artificial intelligence prompts us to consider that instituting human-level intelligence in systems may be (still) in the realm of utopia. In about a quarter century, we have witnessed the winter of AI (1990) being transformed and transported to the zenith of tabloid fodder about AI (2015). The discussion at hand is about the elements that constitute the canonical idea of intelligence. The delivery of intelligence as a pay-per-use-service, popping out of ...

  11. Sequence-based heuristics for faster annotation of non-coding RNA families.

    Science.gov (United States)

    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.

  12. Modified meta-heuristics using random mutation for truss topology optimization with static and dynamic constraints

    Directory of Open Access Journals (Sweden)

    Vimal J. Savsani

    2017-04-01

    The static and dynamic responses to the TTO problems are challenging due to its search space, which is implicit, non-convex, non-linear, and often leading to divergence. Modified meta-heuristics are effective optimization methods to handle such problems in actual fact. In this paper, modified versions of Teaching–Learning-Based Optimization (TLBO, Heat Transfer Search (HTS, Water Wave Optimization (WWO, and Passing Vehicle Search (PVS are proposed by integrating the random mutation-based search technique with them. This paper compares the performance of four modified and four basic meta-heuristics to solve discrete TTO problems.

  13. Heuristic errors in clinical reasoning.

    Science.gov (United States)

    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.

  14. The SP Theory of Intelligence: An Overview

    Directory of Open Access Journals (Sweden)

    J Gerard Wolff

    2013-08-01

    Full Text Available This article is an overview of the SP theory of intelligence, which aims to simplify and integrate concepts across artificial intelligence, mainstream computing and human perception and cognition, with information compression as a unifying theme. It is conceived of as a brain-like system that receives "New" information and stores some or all of it in compressed form as "Old" information; and it is realised in the form of a computer model, a first version of the SP machine. The matching and unification of patterns and the concept of multiple alignment are central ideas. Using heuristic techniques, the system builds multiple alignments that are "good" in terms of information compression. For each multiple alignment, probabilities may be calculated for associated inferences. Unsupervised learning is done by deriving new structures from partial matches between patterns and via heuristic search for sets of structures that are "good" in terms of information compression. These are normally ones that people judge to be "natural", in accordance with the "DONSVIC" principle—the discovery of natural structures via information compression. The SP theory provides an interpretation for concepts and phenomena in several other areas, including "computing", aspects of mathematics and logic, the representation of knowledge, natural language processing, pattern recognition, several kinds of reasoning, information storage and retrieval, planning and problem solving, information compression, neuroscience and human perception and cognition. Examples include the parsing and production of language with discontinuous dependencies in syntax, pattern recognition at multiple levels of abstraction and its integration with part-whole relations, nonmonotonic reasoning and reasoning with default values, reasoning in Bayesian networks, including "explaining away", causal diagnosis, and the solving of a geometric analogy problem.

  15. The 2P1/2 → 2P3/2 laser transition in atomic iodine and the problem of search for signals from extraterrestrial intelligence

    International Nuclear Information System (INIS)

    Kutaev, Yu F; Mankevich, S K; Nosach, O Yu; Orlov, E P

    2007-01-01

    It is proposed to search for signals from extraterrestrial intelligence (ETI) at a wavelength of 1.315 μm of the laser 2 P 1/2 → 2 P 3/2 transition in the atomic iodine, which can be used for this purpose as the natural frequency reference. The search at this wavelength is promising because active quantum filters (AQFs) with the quantum sensitivity limit have been developed for this wavelength, which are capable of receiving laser signals, consisting of only a few photons, against the background of emission from a star under study. In addition, high-power iodine lasers emitting diffraction-limited radiation at 1.315 μm have been created, which highly developed ETI also can have. If a ETI sends in our direction a diffraction-limited 10-ns, 1-kJ laser pulse with the beam diameter of 10 m, a receiver with an AQF mounted on a ten-meter extra-atmospheric optical telescope can detect this signal at a distance of up to 300 light years, irrespective of the ETI position on the celestial sphere. The realisation of the projects for manufacturing optical telescopes of diameter 30 m will increase the research range up to 2700 light years. A weak absorption of the 1.315-μm radiation in the Earth atmosphere (the signal is attenuated by less than 20%) allows the search for ETI signals by using ground telescopes equipped with adaptive optical systems. (laser applications and other topics in quantum electronics)

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

    Science.gov (United States)

    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.

  17. A novel heuristic algorithm for capacitated vehicle routing problem

    Science.gov (United States)

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

    2017-09-01

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

  18. A New Approach to Tuning Heuristic Parameters of Genetic Algorithms

    Czech Academy of Sciences Publication Activity Database

    Holeňa, Martin

    2006-01-01

    Roč. 3, č. 3 (2006), s. 562-569 ISSN 1790-0832. [AIKED'06. WSEAS International Conference on Artificial Intelligence , Knowledge Engineering and Data Bases. Madrid, 15.02.2006-17.02.2006] R&D Projects: GA ČR(CZ) GA201/05/0325; GA ČR(CZ) GA201/05/0557 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary optimization * genetic algorithms * heuristic parameters * parameter tuning * artificial neural networks * convergence speed * population diversity Subject RIV: IN - Informatics, Computer Science

  19. A flow-first route-next heuristic for liner shipping network design

    DEFF Research Database (Denmark)

    Krogsgaard, Alexander; Pisinger, David; Thorsen, Jesper

    2018-01-01

    Having a well-designed liner shipping network is paramount to ensure competitive freight rates, adequate capacity on trade-lanes, and reasonable transportation times.The most successful algorithms for liner shipping network design make use of a two-phase approach, where they first design the routes...... different operators are used to modify the network. Since each iteration of the local search method involves solving a very complex multi-commodity flow problem to route the containers through the network, the flow problem is solved heuristically by use of a fast Lagrange heuristic. Although the Lagrange...... heuristic for flowing containers is 2–5% from the optimal solution, the solution quality is sufficiently good to guide the variable neighborhood search method in designing the network. Computational results are reported, showing that the developed heuristic is able to find improved solutions for large...

  20. Heuristic Biases in Mathematical Reasoning

    Science.gov (United States)

    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…

  1. Heuristic reasoning and relative incompleteness

    NARCIS (Netherlands)

    Treur, J.

    1993-01-01

    In this paper an approach is presented in which heuristic reasoning is interpreted as strategic reasoning. This type of reasoning enables one to derive which hypothesis to investigate, and which observable information to acquire next (to be able to verify the chosen hypothesis). A compositional

  2. A Computational Investigation of Heuristic Algorithms for 2-Edge-Connectivity Augmentation

    DEFF Research Database (Denmark)

    Bang-Jensen, Jørgen; Chiarandini, Marco; Morling, Peter

    2010-01-01

    an equivalent set covering   formulation.  The results indicate that exact solutions by means of a   basic integer programming model can be obtained in reasonably short   time even on networks with 800 vertices and around 287,000   edges. Alternatively, an advanced heuristic algorithm based on   subgradient...... programming, simple construction heuristics and   metaheuristics. As part of the design of heuristics, we consider   different neighborhood structures for local search, among which is a very   large scale neighborhood. In all cases, we exploit approaches through   the graph formulation as well as through...

  3. Comparison of Heuristics for Generating All-partition Arrays in the Style of Milton Babbitt

    DEFF Research Database (Denmark)

    Bemman, Brian; Meredith, David

    2015-01-01

    aggregate or an incomplete one that can be made complete by adding OARPs. It is noteworthy that, when constructing an all-partition array, Babbitt started out with a non-self-contained sequence of partitions. In this paper, we use a known self-contained sequence as a basis for forming two heuristics...... that select integer partitions likely to have been chosen by Babbitt. We suggest these heuristics will select integer partitions more likely to produce a self-contained sequence and we present it as a means for efficiently searching the space of possible sequences. We apply our heuristics to both types...

  4. Intelligent Data Storage and Retrieval for Design Optimisation – an Overview

    Directory of Open Access Journals (Sweden)

    C. Peebles

    2005-01-01

    Full Text Available This paper documents the findings of a literature review conducted by the Sir Lawrence Wackett Centre for Aerospace Design Technology at RMIT University. The review investigates aspects of a proposed system for intelligent design optimisation. Such a system would be capable of efficiently storing (and compressing if required a range of types of design data into an intelligent database. This database would be accessed by the system during subsequent design processes, allowing for search of relevant design data for re-use in later designs, allowing it to become very efficient in reducing the time for later designs as the database grows in size. Extensive research has been performed, in both theoretical aspects of the project, and practical examples of current similar systems. This research covers the areas of database systems, database queries, representation and compression of design data, geometric representation and heuristic methods for design applications. 

  5. The use of meta-heuristics for airport gate assignment

    DEFF Research Database (Denmark)

    Cheng, Chun-Hung; Ho, Sin C.; Kwan, Cheuk-Lam

    2012-01-01

    proposed to generate good solutions within a reasonable timeframe. In this work, we attempt to assess the performance of three meta-heuristics, namely, genetic algorithm (GA), tabu search (TS), simulated annealing (SA) and a hybrid approach based on SA and TS. Flight data from Incheon International Airport...... are collected to carry out the computational comparison. Although the literature has documented these algorithms, this work may be a first attempt to evaluate their performance using a set of realistic flight data....

  6. Heuristics for NP-hard optimization problems - simpler is better!?

    Directory of Open Access Journals (Sweden)

    Žerovnik Janez

    2015-11-01

    Full Text Available We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possibilities. In this critical survey, selected examples discussed include the traveling salesman, the resource-constrained project scheduling, the channel assignment, and computation of bounds for the Shannon capacity.

  7. Combined heuristic with fuzzy system to transmission system expansion planning

    Energy Technology Data Exchange (ETDEWEB)

    Silva Sousa, Aldir; Asada, Eduardo N. [University of Sao Paulo, Sao Carlos School of Engineering, Department of Electrical Engineering Av. Trabalhador Sao-carlense, 400, 13566-590 Sao Carlos, SP (Brazil)

    2011-01-15

    A heuristic algorithm that employs fuzzy logic is proposed to the power system transmission expansion planning problem. The algorithm is based on the divide to conquer strategy, which is controlled by the fuzzy system. The algorithm provides high quality solutions with the use of fuzzy decision making, which is based on nondeterministic criteria to guide the search. The fuzzy system provides a self-adjusting mechanism that eliminates the manual adjustment of parameters to each system being solved. (author)

  8. examining the predictive power of the VRIO-Framework and the Recognition Heuristic

    OpenAIRE

    Powalla, Christian

    2010-01-01

    Boundedly rational managers regularly have to make complex strategic decisions under uncertainty. In this context heuristics can play an important supporting role. They are used to reasonably structure the decision making process, to reduce the information search, and to achieve a good solution with an acceptable problem-solving effort. This empirical research project analyzes the practical usefulness of several selected heuristic techniques, which can be used within strategic analysis, by...

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

    Science.gov (United States)

    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.

  10. Efficient heuristics for the Rural Postman Problem | Groves | ORiON

    African Journals Online (AJOL)

    A local search framework for the (undirected) Rural Postman Problem (RPP) is presented in this paper. The framework allows local search approaches that have been applied successfully to the well–known Travelling Salesman Problem also to be applied to the RPP. New heuristics for the RPP, based on this framework, ...

  11. Familiarity and recollection in heuristic decision making.

    Science.gov (United States)

    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.

  12. An intelligent stochastic optimization routine for nuclear fuel cycle design

    International Nuclear Information System (INIS)

    Parks, G.T.

    1990-01-01

    A simulated annealing (Metropolis algorithm) optimization routine named AMETROP, which has been developed for use on realistic nuclear fuel cycle problems, is introduced. Each stage of the algorithm is described and the means by which it overcomes or avoids the difficulties posed to conventional optimization routines by such problems are explained. Special attention is given to innovations that enhance AMETROP's performance both through artificial intelligence features, in which the routine uses the accumulation of data to influence its future actions, and through a family of simple performance aids, which allow the designer to use his heuristic knowledge to guide the routine's essentially random search. Using examples from a typical fuel cycle optimization problem, the performance of the stochastic Metropolis algorithm is compared to that of the only suitable deterministic routine in a standard software library, showing AMETROP to have many advantages

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

    Science.gov (United States)

    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.

  14. The Breakthrough Listen Search for Intelligent Life: A Wideband Data Recorder System for the Robert C. Byrd Green Bank Telescope

    Science.gov (United States)

    MacMahon, David H. E.; Price, Danny C.; Lebofsky, Matthew; Siemion, Andrew P. V.; Croft, Steve; DeBoer, David; Enriquez, J. Emilio; Gajjar, Vishal; Hellbourg, Gregory; Isaacson, Howard; Werthimer, Dan; Abdurashidova, Zuhra; Bloss, Marty; Brandt, Joe; Creager, Ramon; Ford, John; Lynch, Ryan S.; Maddalena, Ronald J.; McCullough, Randy; Ray, Jason; Whitehead, Mark; Woody, Dave

    2018-04-01

    The Breakthrough Listen Initiative is undertaking a comprehensive search for radio and optical signatures from extraterrestrial civilizations. An integral component of the project is the design and implementation of wide-bandwidth data recorder and signal processing systems. The capabilities of these systems, particularly at radio frequencies, directly determine survey speed; further, given a fixed observing time and spectral coverage, they determine sensitivity as well. Here, we detail the Breakthrough Listen wide-bandwidth data recording system deployed at the 100 m aperture Robert C. Byrd Green Bank Telescope. The system digitizes up to 6 GHz of bandwidth at 8 bits for both polarizations, storing the resultant 24 GB s‑1 of data to disk. This system is among the highest data rate baseband recording systems in use in radio astronomy. A future system expansion will double recording capacity, to achieve a total Nyquist bandwidth of 12 GHz in two polarizations. In this paper, we present details of the system architecture, along with salient configuration and disk-write optimizations used to achieve high-throughput data capture on commodity compute servers and consumer-class hard disk drives.

  15. Special relativity a heuristic approach

    CERN Document Server

    Hassani, Sadri

    2017-01-01

    Special Relativity: A Heuristic Approach provides a qualitative exposition of relativity theory on the basis of the constancy of the speed of light. Using Einstein's signal velocity as the defining idea for the notion of simultaneity and the fact that the speed of light is independent of the motion of its source, chapters delve into a qualitative exposition of the relativity of time and length, discuss the time dilation formula using the standard light clock, explore the Minkowski four-dimensional space-time distance based on how the time dilation formula is derived, and define the components of the two-dimensional space-time velocity, amongst other topics. Provides a heuristic derivation of the Minkowski distance formula Uses relativistic photography to see Lorentz transformation and vector algebra manipulation in action Includes worked examples to elucidate and complement the topic being discussed Written in a very accessible style

  16. OAST Space Theme Workshop. Volume 2: Theme summary. 3: Search for extraterrestrial intelligence (no. 9). A: Theme statement. B. 26 April 1976 presentation. C. Summary. D. Newer initiatives (form 4). E. Initiative actions (form 5)

    Science.gov (United States)

    1976-01-01

    Preliminary (1977-1983), intermediate (1982-1988), and long term (1989+) phases of the search for extraterrestrial intelligence (SETI) program are examined as well as the benefits to be derived in radioastronomy and the problems to be surmounted in radio frequency interference. The priorities, intrinsic value, criteria, and strategy for the search are discussed for both terrestrial and lunar-based CYCLOPS and for a space SETI system located at lunar liberation point L4. New initiatives related to antenna independent technology, multichannel analyzers, and radio frequency interference shielding are listed. Projected SETI program costs are included.

  17. Micro-seismic waveform matching inversion based on gravitational search algorithm and parallel computation

    Science.gov (United States)

    Jiang, Y.; Xing, H. L.

    2016-12-01

    Micro-seismic events induced by water injection, mining activity or oil/gas extraction are quite informative, the interpretation of which can be applied for the reconstruction of underground stress and monitoring of hydraulic fracturing progress in oil/gas reservoirs. The source characterises and locations are crucial parameters that required for these purposes, which can be obtained through the waveform matching inversion (WMI) method. Therefore it is imperative to develop a WMI algorithm with high accuracy and convergence speed. Heuristic algorithm, as a category of nonlinear method, possesses a very high convergence speed and good capacity to overcome local minimal values, and has been well applied for many areas (e.g. image processing, artificial intelligence). However, its effectiveness for micro-seismic WMI is still poorly investigated; very few literatures exits that addressing this subject. In this research an advanced heuristic algorithm, gravitational search algorithm (GSA) , is proposed to estimate the focal mechanism (angle of strike, dip and rake) and source locations in three dimension. Unlike traditional inversion methods, the heuristic algorithm inversion does not require the approximation of green function. The method directly interacts with a CPU parallelized finite difference forward modelling engine, and updating the model parameters under GSA criterions. The effectiveness of this method is tested with synthetic data form a multi-layered elastic model; the results indicate GSA can be well applied on WMI and has its unique advantages. Keywords: Micro-seismicity, Waveform matching inversion, gravitational search algorithm, parallel computation

  18. Social biases determine spatiotemporal sparseness of ciliate mating heuristics.

    Science.gov (United States)

    Clark, Kevin B

    2012-01-01

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

  19. Social biases determine spatiotemporal sparseness of ciliate mating heuristics

    Science.gov (United States)

    2012-01-01

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

  20. A nuclear heuristic for application to metaheuristics in-core fuel management optimization

    Energy Technology Data Exchange (ETDEWEB)

    Meneses, Anderson Alvarenga de Moura, E-mail: ameneses@lmp.ufrj.b [COPPE/Federal University of Rio de Janeiro, RJ (Brazil). Nuclear Engineering Program; Dalle Molle Institute for Artificial Intelligence (IDSIA), Manno-Lugano, TI (Switzerland); Gambardella, Luca Maria, E-mail: luca@idsia.c [Dalle Molle Institute for Artificial Intelligence (IDSIA), Manno-Lugano, TI (Switzerland); Schirru, Roberto, E-mail: schirru@lmp.ufrj.b [COPPE/Federal University of Rio de Janeiro, RJ (Brazil). Nuclear Engineering Program

    2009-07-01

    The In-Core Fuel Management Optimization (ICFMO) is a well-known problem of nuclear engineering whose features are complexity, high number of feasible solutions, and a complex evaluation process with high computational cost, thus it is prohibitive to have a great number of evaluations during an optimization process. Heuristics are criteria or principles for deciding which among several alternative courses of action are more effective with respect to some goal. In this paper, we propose a new approach for the use of relational heuristics for the search in the ICFMO. The Heuristic is based on the reactivity of the fuel assemblies and their position into the reactor core. It was applied to random search, resulting in less computational effort concerning the number of evaluations of loading patterns during the search. The experiments demonstrate that it is possible to achieve results comparable to results in the literature, for future application to metaheuristics in the ICFMO. (author)

  1. A nuclear heuristic for application to metaheuristics in-core fuel management optimization

    International Nuclear Information System (INIS)

    Meneses, Anderson Alvarenga de Moura; Gambardella, Luca Maria; Schirru, Roberto

    2009-01-01

    The In-Core Fuel Management Optimization (ICFMO) is a well-known problem of nuclear engineering whose features are complexity, high number of feasible solutions, and a complex evaluation process with high computational cost, thus it is prohibitive to have a great number of evaluations during an optimization process. Heuristics are criteria or principles for deciding which among several alternative courses of action are more effective with respect to some goal. In this paper, we propose a new approach for the use of relational heuristics for the search in the ICFMO. The Heuristic is based on the reactivity of the fuel assemblies and their position into the reactor core. It was applied to random search, resulting in less computational effort concerning the number of evaluations of loading patterns during the search. The experiments demonstrate that it is possible to achieve results comparable to results in the literature, for future application to metaheuristics in the ICFMO. (author)

  2. Heuristic Synthesis of Reversible Logic – A Comparative Study

    Directory of Open Access Journals (Sweden)

    Chua Shin Cheng

    2014-01-01

    Full Text Available Reversible logic circuits have been historically motivated by theoretical research in low-power, and recently attracted interest as components of the quantum algorithm, optical computing and nanotechnology. However due to the intrinsic property of reversible logic, traditional irreversible logic design and synthesis methods cannot be carried out. Thus a new set of algorithms are developed correctly to synthesize reversible logic circuit. This paper presents a comprehensive literature review with comparative study on heuristic based reversible logic synthesis. It reviews a range of heuristic based reversible logic synthesis techniques reported by researchers (BDD-based, cycle-based, search-based, non-search-based, rule-based, transformation-based, and ESOP-based. All techniques are described in detail and summarized in a table based on their features, limitation, library used and their consideration metric. Benchmark comparison of gate count and quantum cost are analysed for each synthesis technique. Comparing the synthesis algorithm outputs over the years, it can be observed that different approach has been used for the synthesis of reversible circuit. However, the improvements are not significant. Quantum cost and gate count has improved over the years, but arguments and debates are still on certain issues such as the issue of garbage outputs that remain the same. This paper provides the information of all heuristic based synthesis of reversible logic method proposed over the years. All techniques are explained in detail and thus informative for new reversible logic researchers and bridging the knowledge gap in this area.

  3. Artificial Intelligence Techniques: Applications for Courseware Development.

    Science.gov (United States)

    Dear, Brian L.

    1986-01-01

    Introduces some general concepts and techniques of artificial intelligence (natural language interfaces, expert systems, knowledge bases and knowledge representation, heuristics, user-interface metaphors, and object-based environments) and investigates ways these techniques might be applied to analysis, design, development, implementation, and…

  4. An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem

    Science.gov (United States)

    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.

  5. A Heuristic Procedure for the Outbound Container Relocation Problem during Export Loading Operations

    Directory of Open Access Journals (Sweden)

    Roberto Guerra-Olivares

    2015-01-01

    Full Text Available During export ship loading operations, it is often necessary to perform relocation movements with containers that interfere with access to the desired container in the ship loading sequence. This paper presents a real-time heuristic procedure for the container relocation problem employing reachstacker vehicles as container handling equipment. The proposed heuristic searches for good relocation coordinates within a set of nearby bays. The heuristic has a parameter that determines how far from the original bay a container may be relocated. The tradeoff between reducing relocation movements and limiting vehicle travel distances is examined and the performance of the heuristic is compared with a common practice in the smaller container terminals in Chile and Mexico. Finally, a mathematical model for the container relocation problem is presented.

  6. Heuristic Approach for Balancing Shift Schedules

    International Nuclear Information System (INIS)

    Kim, Dae Ho; Yun, Young Su; Lee, Yong Hee

    2005-01-01

    In this paper, a heuristic approach for balancing shift schedules is proposed. For the shift schedules, various constraints which have usually been considered in realworld industry are used, and the objective is to minimize the differences of the workloads in each workgroup. The constraints and objective function are implemented in the proposed heuristic approach. Using a simple instance, the efficiency of the proposed heuristic approach is proved

  7. Exact and heuristic solutions to the Double TSP with Multiple Stacks

    DEFF Research Database (Denmark)

    Petersen, Hanne Løhmann; Archetti, Claudia; Madsen, Oli B.G.

    -pallet, which can be loaded in 3 stacks in a standard 40 foot container. Different exact and heuristic solution approaches to the DTSPMS have been implemented and tested. The exact approaches are based on different mathematical formulations of the problem which are solved using branch-and-cut. One formulation...... instances. The implemented heuristics include tabu search, simulated annealing and large neighbourhood search. Particularly the LNS approach shows promising results. It finds the known optimal solution of smaller instances (15 orders) within 10 seconds in most cases, and in 3 minutes it finds solutions...

  8. A States of Matter Search-Based Approach for Solving the Problem of Intelligent Power Allocation in Plug-in Hybrid Electric Vehicles

    Directory of Open Access Journals (Sweden)

    Arturo Valdivia-Gonzalez

    2017-01-01

    Full Text Available Recently, many researchers have proved that the electrification of the transport sector is a key for reducing both the emissions of green-house pollutants and the dependence on oil for transportation. As a result, Plug-in Hybrid Electric Vehicles (or PHEVs are receiving never before seen increased attention. Consequently, large-scale penetration of PHEVs into the market is expected to take place in the near future, however, an unattended increase in the PHEVs needs may cause several technical problems which could potentially compromise the stability of power systems. As a result of the growing necessity for addressing such issues, topics related to the optimization of PHEVs’ charging infrastructures have captured the attention of many researchers. Related to this, several state-of-the-art swarm optimization methods (such as the well-known Particle Swarm Optimization (PSO or the recently proposed Gravitational Search Algorithm (GSA approach have been successfully applied in the optimization of the average State of Charge (SoC, which represents one of the most important performance indicators in the context of PHEVs’ intelligent power allocation. Many of these swarm optimization methods, however, are known to be subject to several critical flaws, including premature convergence and a lack of balance between the exploration and exploitation of solutions. Such problems are usually related to the evolutionary operators employed by each of the methods on the exploration and exploitation of new solutions. In this paper, the recently proposed States of Matter Search (SMS swarm optimization method is proposed for maximizing the average State of Charge of PHEVs within a charging station. In our experiments, several different scenarios consisting on different numbers of PHEVs were considered. To test the feasibility of the proposed approach, comparative experiments were performed against other popular PHEVs’ State of Charge maximization approaches

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

    Science.gov (United States)

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

  10. Heuristics for multiobjective multiple sequence alignment.

    Science.gov (United States)

    Abbasi, Maryam; Paquete, Luís; Pereira, Francisco B

    2016-07-15

    Aligning multiple sequences arises in many tasks in Bioinformatics. However, the alignments produced by the current software packages are highly dependent on the parameters setting, such as the relative importance of opening gaps with respect to the increase of similarity. Choosing only one parameter setting may provide an undesirable bias in further steps of the analysis and give too simplistic interpretations. In this work, we reformulate multiple sequence alignment from a multiobjective point of view. The goal is to generate several sequence alignments that represent a trade-off between maximizing the substitution score and minimizing the number of indels/gaps in the sum-of-pairs score function. This trade-off gives to the practitioner further information about the similarity of the sequences, from which she could analyse and choose the most plausible alignment. We introduce several heuristic approaches, based on local search procedures, that compute a set of sequence alignments, which are representative of the trade-off between the two objectives (substitution score and indels). Several algorithm design options are discussed and analysed, with particular emphasis on the influence of the starting alignment and neighborhood search definitions on the overall performance. A perturbation technique is proposed to improve the local search, which provides a wide range of high-quality alignments. The proposed approach is tested experimentally on a wide range of instances. We performed several experiments with sequences obtained from the benchmark database BAliBASE 3.0. To evaluate the quality of the results, we calculate the hypervolume indicator of the set of score vectors returned by the algorithms. The results obtained allow us to identify reasonably good choices of parameters for our approach. Further, we compared our method in terms of correctly aligned pairs ratio and columns correctly aligned ratio with respect to reference alignments. Experimental results show

  11. PENDEKATAN ACTIVITY-BASED COSTING DAN METODE PENCARIAN HEURISTIC UNTUK MENYELESAIKAN PROBLEM PEMILIHAN PERALATAN PADA FLEXIBLE MANUFACTURING SYSTEMS (FMS

    Directory of Open Access Journals (Sweden)

    Gregorius Satia Budhi

    2002-01-01

    Full Text Available The application of Activity Based Costing (ABC approach to select the set-machine that is used in the production of Flexible Manufacture System (FMS based on technical and economical criteria can be useful for producers to design FMS by considering the minimum production cost. In the other hand, Heuristic Search is known to have a short searching time. Algorithm Heuristic that using ABC approach as the weight in finding the solution to shorten the equipment selection time during the design / redesign process of the FMS in less than exponential time was designed in this research. The increasing speed is useful because with the faster time in design / redesign process, therefore the flexibility level of part variety that can be processed will become better. Theoretical and empirical analysis in Algorithm Heuristic shows that time searching to get appropriate set of equipment is not too long, so that we can assume that the designed Algorithm Heuristic can be implemented in the real world. By comparing the empirical result of Algorithm Heuristic to the Algorithm Exhaustive, we can also assume that Algorithm Heuristic that using ABC method as the weight for finding solution can optimise the equipment selection problem of FMS based on economical criteria too. Abstract in Bahasa Indonesia : Penggunaan pendekatan Activity Based Costing (ABC untuk memilih set mesin yang digunakan dalam produksi pada Flexible Manufacture Systems (FMS berdasar atas kriteria teknis dan ekonomis, dapat membantu pelaku produksi untuk mendisain FMS dengan pertimbangan minimalisasi biaya produksi. Sementara itu, Heuristic Search dikenal memiliki waktu pencarian yang singkat. Pada riset ini didisain sebuah Algoritma Heuristic yang menggunakan pendekatan ABC sebagai bobot dalam pencarian solusi, untuk mempersingkat waktu pemilihan peralatan saat desain/redisain FMS dalam waktu kurang dari waktu Eksponensial. Peningkatan kecepatan ini bermanfaat, karena dengan cepatnya waktu

  12. SHRIF, a General-Purpose System for Heuristic Retrieval of Information and Facts, Applied to Medical Knowledge Processing.

    Science.gov (United States)

    Findler, Nicholas V.; And Others

    1992-01-01

    Describes SHRIF, a System for Heuristic Retrieval of Information and Facts, and the medical knowledge base that was used in its development. Highlights include design decisions; the user-machine interface, including the language processor; and the organization of the knowledge base in an artificial intelligence (AI) project like this one. (57…

  13. Search-based model identification of smart-structure damage

    Science.gov (United States)

    Glass, B. J.; Macalou, A.

    1991-01-01

    This paper describes the use of a combined model and parameter identification approach, based on modal analysis and artificial intelligence (AI) techniques, for identifying damage or flaws in a rotating truss structure incorporating embedded piezoceramic sensors. This smart structure example is representative of a class of structures commonly found in aerospace systems and next generation space structures. Artificial intelligence techniques of classification, heuristic search, and an object-oriented knowledge base are used in an AI-based model identification approach. A finite model space is classified into a search tree, over which a variant of best-first search is used to identify the model whose stored response most closely matches that of the input. Newly-encountered models can be incorporated into the model space. This adaptativeness demonstrates the potential for learning control. Following this output-error model identification, numerical parameter identification is used to further refine the identified model. Given the rotating truss example in this paper, noisy data corresponding to various damage configurations are input to both this approach and a conventional parameter identification method. The combination of the AI-based model identification with parameter identification is shown to lead to smaller parameter corrections than required by the use of parameter identification alone.

  14. Artificial intelligence in medicine.

    OpenAIRE

    Ramesh, A. N.; Kambhampati, C.; Monson, J. R. T.; Drew, P. J.

    2004-01-01

    INTRODUCTION: Artificial intelligence is a branch of computer science capable of analysing complex medical data. Their potential to exploit meaningful relationship with in a data set can be used in the diagnosis, treatment and predicting outcome in many clinical scenarios. METHODS: Medline and internet searches were carried out using the keywords 'artificial intelligence' and 'neural networks (computer)'. Further references were obtained by cross-referencing from key articles. An overview of ...

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

    Science.gov (United States)

    Clark, Kevin B

    2010-03-01

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

  16. The application of artificial intelligence on the optimal solution of the operating conditions of continuous casting; Aplicacao da inteligencia artificial na solucao otima das condicoes operacionais do lingotamento continuo

    Energy Technology Data Exchange (ETDEWEB)

    Spim Junior, J.A.; Ierardi, M.C.F.; Garcia, A. [Universidade Estadual de Campinas, SP (Brazil). Faculdade de Engenharia Mecanica

    1995-12-31

    This work presents the development of a software that incorporates artificial intelligence techniques, directly applied to the metallurgical industry, particularly to those using the continuous casting process for ingot production. The essential parts of the continuous casting equipment which must be subjected to monitoring are presented, and a methodology of physical settlements in each cooling region as well. The modification performed by the intelligent program taking into account the critical rules conducting to an efficient solidification, are compared with real time simulation of ingot surface temperatures. The efficiency of the intelligent system is assured by final product quality parameters. This approach is applied to the real dimension of a slab continuous caster under real operation conditions, demonstrating that very good results can be attained by using an heuristic search 11 refs., 4 figs., 4 tabs.

  17. Conspicuous Waste and Representativeness Heuristic

    Directory of Open Access Journals (Sweden)

    Tatiana M. Shishkina

    2017-12-01

    Full Text Available The article deals with the similarities between conspicuous waste and representativeness heuristic. The conspicuous waste is analyzed according to the classic Veblen’ interpretation as a strategy to increase social status through conspicuous consumption and conspicuous leisure. In “The Theory of the Leisure Class” Veblen introduced two different types of utility – conspicuous and functional. The article focuses on the possible benefits of the analysis of conspicuous utility not only in terms of institutional economic theory, but also in terms of behavioral economics. To this end, the representativeness heuristics is considered, on the one hand, as a way to optimize the decision-making process, which allows to examine it in comparison with procedural rationality by Simon. On the other hand, it is also analyzed as cognitive bias within the Kahneman and Twersky’ approach. The article provides the analysis of the patterns in the deviations from the rational behavior strategy that could be observed in case of conspicuous waste both in modern market economies in the form of conspicuous consumption and in archaic economies in the form of gift-exchange. The article also focuses on the marketing strategies for luxury consumption’ advertisement. It highlights the impact of the symbolic capital (in Bourdieu’ interpretation on the social and symbolic payments that actors get from the act of conspicuous waste. This allows to perform a analysis of conspicuous consumption both as a rational way to get the particular kind of payments, and, at the same time, as a form of institutionalized cognitive bias.

  18. Robotics Vision-based Heuristic Reasoning for Underwater Target Tracking and Navigation

    OpenAIRE

    Kia, Chua; Arshad, Mohd Rizal

    2006-01-01

    This paper presents a robotics vision-based heuristic reasoning system for underwater target tracking and navigation. This system is introduced to improve the level of automation of underwater Remote Operated Vehicles (ROVs) operations. A prototype which combines computer vision with an underwater robotics system is successfully designed and developed to perform target tracking and intelligent navigation. This study focuses on developing image processing algorithms and fuzzy inference system ...

  19. Design of application for graph's handling with heuristic algorithms of analysis

    OpenAIRE

    López, Carlos Andrés; Ardila Urueña, William

    2008-01-01

    El siguiente artículo muestra la manera de desarrollar una sencilla aplicación de entorno grafico sobre la cual se puede experimentar diversas técnicas, desde algoritmos de resolución de grafos hasta heurísticas empleadas en inteligencia artificial. The next section shows how to develop a simple graphical application environment on which to experiment with various techniques, from algorithms resolution graph until heuristics used in artificial intelligence.

  20. The Probability Heuristics Model of Syllogistic Reasoning.

    Science.gov (United States)

    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…

  1. Cooperative heuristic multi-agent planning

    NARCIS (Netherlands)

    De Weerdt, M.M.; Tonino, J.F.M.; Witteveen, C.

    2001-01-01

    In this paper we will use the framework to study cooperative heuristic multi-agent planning. During the construction of their plans, the agents use a heuristic function inspired by the FF planner (l3l). At any time in the process of planning the agents may exchange available resources, or they may

  2. "A Heuristic for Visual Thinking in History"

    Science.gov (United States)

    Staley, David J.

    2007-01-01

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

  3. Effective Heuristics for New Venture Formation

    NARCIS (Netherlands)

    Kraaijenbrink, Jeroen

    2010-01-01

    Entrepreneurs are often under time pressure and may only have a short window of opportunity to launch their new venture. This means they often have no time for rational analytical decisions and rather rely on heuristics. Past research on entrepreneurial heuristics has primarily focused on predictive

  4. Religion, Heuristics, and Intergenerational Risk Management

    OpenAIRE

    Rupert Read; Nassim Nicholas Taleb

    2014-01-01

    Religions come with risk-​managing interdicts and heuristics, and they carry such interdicts and heuristics across generations. We remark on such facets of religion in relation to a propensity among some decision scientists and others to regard practices that they cannot understand as being irrational, biased, and so on.

  5. A heuristic algorithm for a multi-product four-layer capacitated location-routing problem

    Directory of Open Access Journals (Sweden)

    Mohsen Hamidi

    2014-01-01

    Full Text Available The purpose of this study is to solve a complex multi-product four-layer capacitated location-routing problem (LRP in which two specific constraints are taken into account: 1 plants have limited production capacity, and 2 central depots have limited capacity for storing and transshipping products. The LRP represents a multi-product four-layer distribution network that consists of plants, central depots, regional depots, and customers. A heuristic algorithm is developed to solve the four-layer LRP. The heuristic uses GRASP (Greedy Randomized Adaptive Search Procedure and two probabilistic tabu search strategies of intensification and diversification to tackle the problem. Results show that the heuristic solves the problem effectively.

  6. Gene selection heuristic algorithm for nutrigenomics studies.

    Science.gov (United States)

    Valour, D; Hue, I; Grimard, B; Valour, B

    2013-07-15

    Large datasets from -omics studies need to be deeply investigated. The aim of this paper is to provide a new method (LEM method) for the search of transcriptome and metabolome connections. The heuristic algorithm here described extends the classical canonical correlation analysis (CCA) to a high number of variables (without regularization) and combines well-conditioning and fast-computing in "R." Reduced CCA models are summarized in PageRank matrices, the product of which gives a stochastic matrix that resumes the self-avoiding walk covered by the algorithm. Then, a homogeneous Markov process applied to this stochastic matrix converges the probabilities of interconnection between genes, providing a selection of disjointed subsets of genes. This is an alternative to regularized generalized CCA for the determination of blocks within the structure matrix. Each gene subset is thus linked to the whole metabolic or clinical dataset that represents the biological phenotype of interest. Moreover, this selection process reaches the aim of biologists who often need small sets of genes for further validation or extended phenotyping. The algorithm is shown to work efficiently on three published datasets, resulting in meaningfully broadened gene networks.

  7. Comparison of Heuristics for Inhibitory Rule Optimization

    KAUST Repository

    Alsolami, Fawaz; Chikalov, Igor; Moshkov, Mikhail

    2014-01-01

    Friedman test with Nemenyi post-hoc are used to compare the greedy algorithms statistically against each other for length and coverage. The experiments are carried out on real datasets from UCI Machine Learning Repository. For leading heuristics, the constructed rules are compared with optimal ones obtained based on dynamic programming approach. The results seem to be promising for the best heuristics: the average relative difference between length (coverage) of constructed and optimal rules is at most 2.27% (7%, respectively). Furthermore, the quality of classifiers based on sets of inhibitory rules constructed by the considered heuristics are compared against each other, and the results show that the three best heuristics from the point of view classification accuracy coincides with the three well-performed heuristics from the point of view of rule length minimization.

  8. 3rd International Conference on Harmony Search Algorithm

    CERN Document Server

    2017-01-01

    This book presents state-of-the-art technical contributions based around one of the most successful evolutionary optimization algorithms published to date: Harmony Search. Contributions span from novel technical derivations of this algorithm to applications in the broad fields of civil engineering, energy, transportation & mobility and health, among many others and focus not only on its cross-domain applicability, but also on its core evolutionary operators, including elements inspired from other meta-heuristics. The global scientific community is witnessing an upsurge in groundbreaking, new advances in all areas of computational intelligence, with a particular flurry of research focusing on evolutionary computation and bio-inspired optimization. Observed processes in nature and sociology have provided the basis for innovative algorithmic developments aimed at leveraging the inherent capability to adapt characterized by various animals, including ants, fireflies, wolves and humans. However, it is the beha...

  9. Application of artificial intelligence to triple quadrupole mass spectrometry (TQMS)

    International Nuclear Information System (INIS)

    Wong, C.M.; Crawford, R.W.; Kehler, T.P.; Kunz, J.C.

    1984-01-01

    At Lawrence Livermore National Laboratory the authors have designed a totally computerized triple quadrupole mass spectrometer with the ultimate goal of using it as a prototype for ''knowledge-based'' instrument control. As an ''intelligent'' instrument, with its computer-based data acquisition and control system, it has the ability to learn and respond quickly. The intelligence is encoded in the system using the representation and rule-based reasoning heuristic techniques of Artificial Intelligence. These techniques are used to encode heuristic knowledge, or the intuition, formal and informal rules, and experiential knowledge that the human expert normally uses to make decisions and arrive at solutions in a specific domain problem. In this specific case, the knowledge the authors are encoding is a tuning procedure for the spectrometer, including heuristics to describe a self-adaptive, feedback control process for real-time optimization or tuning of the data acquisition procedure throughout the entire data collection process

  10. A review of parameters and heuristics for guiding metabolic pathfinding.

    Science.gov (United States)

    Kim, Sarah M; Peña, Matthew I; Moll, Mark; Bennett, George N; Kavraki, Lydia E

    2017-09-15

    Recent developments in metabolic engineering have led to the successful biosynthesis of valuable products, such as the precursor of the antimalarial compound, artemisinin, and opioid precursor, thebaine. Synthesizing these traditionally plant-derived compounds in genetically modified yeast cells introduces the possibility of significantly reducing the total time and resources required for their production, and in turn, allows these valuable compounds to become cheaper and more readily available. Most biosynthesis pathways used in metabolic engineering applications have been discovered manually, requiring a tedious search of existing literature and metabolic databases. However, the recent rapid development of available metabolic information has enabled the development of automated approaches for identifying novel pathways. Computer-assisted pathfinding has the potential to save biochemists time in the initial discovery steps of metabolic engineering. In this paper, we review the parameters and heuristics used to guide the search in recent pathfinding algorithms. These parameters and heuristics capture information on the metabolic network structure, compound structures, reaction features, and organism-specificity of pathways. No one metabolic pathfinding algorithm or search parameter stands out as the best to use broadly for solving the pathfinding problem, as each method and parameter has its own strengths and shortcomings. As assisted pathfinding approaches continue to become more sophisticated, the development of better methods for visualizing pathway results and integrating these results into existing metabolic engineering practices is also important for encouraging wider use of these pathfinding methods.

  11. Heuristic Strategies in Systems Biology

    Directory of Open Access Journals (Sweden)

    Fridolin Gross

    2016-06-01

    Full Text Available Systems biology is sometimes presented as providing a superior approach to the problem of biological complexity. Its use of ‘unbiased’ methods and formal quantitative tools might lead to the impression that the human factor is effectively eliminated. However, a closer look reveals that this impression is misguided. Systems biologists cannot simply assemble molecular information and compute biological behavior. Instead, systems biology’s main contribution is to accelerate the discovery of mechanisms by applying models as heuristic tools. These models rely on a variety of idealizing and simplifying assumptions in order to be efficient for this purpose. The strategies of systems biologists are similar to those of experimentalists in that they attempt to reduce the complexity of the discovery process. Analyzing and comparing these strategies, or ‘heuristics’, reveals the importance of the human factor in computational approaches and helps to situate systems biology within the epistemic landscape of the life sciences.

  12. THE HEURISTIC FUNCTION OF SPORT

    Directory of Open Access Journals (Sweden)

    Adam Petrović

    2012-09-01

    Full Text Available Being a significant area of human activity, sport has multiple functions. One of the more important functions of sport, especially top sport, is the inventive heuristic function. Creative work, being a process of creating new values, represents a significant possibility for advancement of sport. This paper aims at pointing at the various dimensions of human creative work, at the creative work which can be seen in sport (in a narrow sense and at the scientific and practical areas which borderline sport. The method of theoretical analysis of different approaches to the phenomenon of creative work , both in general and in sport, was applied in this paper. This area can be systematized according to various criterion : the level of creative work, different fields where it appears, the subjects of creative work - creators etc. Case analysis shows that the field of creative work in sport is widening and deepening constantly. There are different levels of creativity not only in the system of training and competition, but in a wider social context of sport as well. As a process of human spirit and mind the creative work belongs not just to athletes and coaches, but also to all the people and social groups who's creative power manifests itself in sport. The classification of creative work in sport according to various criterion allows for heuristic function of sport to be explained comprehensively and to create an image how do the sparks of human spirit improve the micro cosmos of sport. A thorough classification of creative work in sport allows for a detailed analysis of all the elements of creative work and each of it’s area in sport. In this way the progress in sport , as a consequence of innovations in both competitions and athletes’ training and of everything that goes with those activities, can be guided into the needed direction more easily as well as studied and applied.

  13. Simple heuristics and rules of thumb: where psychologists and behavioural biologists might meet.

    Science.gov (United States)

    Hutchinson, John M C; Gigerenzer, Gerd

    2005-05-31

    The Centre for Adaptive Behaviour and Cognition (ABC) has hypothesised that much human decision-making can be described by simple algorithmic process models (heuristics). This paper explains this approach and relates it to research in biology on rules of thumb, which we also review. As an example of a simple heuristic, consider the lexicographic strategy of Take The Best for choosing between two alternatives: cues are searched in turn until one discriminates, then search stops and all other cues are ignored. Heuristics consist of building blocks, and building blocks exploit evolved or learned abilities such as recognition memory; it is the complexity of these abilities that allows the heuristics to be simple. Simple heuristics have an advantage in making decisions fast and with little information, and in avoiding overfitting. Furthermore, humans are observed to use simple heuristics. Simulations show that the statistical structures of different environments affect which heuristics perform better, a relationship referred to as ecological rationality. We contrast ecological rationality with the stronger claim of adaptation. Rules of thumb from biology provide clearer examples of adaptation because animals can be studied in the environments in which they evolved. The range of examples is also much more diverse. To investigate them, biologists have sometimes used similar simulation techniques to ABC, but many examples depend on empirically driven approaches. ABC's theoretical framework can be useful in connecting some of these examples, particularly the scattered literature on how information from different cues is integrated. Optimality modelling is usually used to explain less detailed aspects of behaviour but might more often be redirected to investigate rules of thumb.

  14. Meta-Heuristics for Dynamic Lot Sizing: a review and comparison of solution approaches

    NARCIS (Netherlands)

    R.F. Jans (Raf); Z. Degraeve (Zeger)

    2004-01-01

    textabstractProofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have been proposed to solve them. In the past decade, meta-heuristics such as tabu search,

  15. Comparison of Heuristics for Inhibitory Rule Optimization

    KAUST Repository

    Alsolami, Fawaz

    2014-09-13

    Knowledge representation and extraction are very important tasks in data mining. In this work, we proposed a variety of rule-based greedy algorithms that able to obtain knowledge contained in a given dataset as a series of inhibitory rules containing an expression “attribute ≠ value” on the right-hand side. The main goal of this paper is to determine based on rule characteristics, rule length and coverage, whether the proposed rule heuristics are statistically significantly different or not; if so, we aim to identify the best performing rule heuristics for minimization of rule length and maximization of rule coverage. Friedman test with Nemenyi post-hoc are used to compare the greedy algorithms statistically against each other for length and coverage. The experiments are carried out on real datasets from UCI Machine Learning Repository. For leading heuristics, the constructed rules are compared with optimal ones obtained based on dynamic programming approach. The results seem to be promising for the best heuristics: the average relative difference between length (coverage) of constructed and optimal rules is at most 2.27% (7%, respectively). Furthermore, the quality of classifiers based on sets of inhibitory rules constructed by the considered heuristics are compared against each other, and the results show that the three best heuristics from the point of view classification accuracy coincides with the three well-performed heuristics from the point of view of rule length minimization.

  16. Artificial intelligence

    CERN Document Server

    Hunt, Earl B

    1975-01-01

    Artificial Intelligence provides information pertinent to the fundamental aspects of artificial intelligence. This book presents the basic mathematical and computational approaches to problems in the artificial intelligence field.Organized into four parts encompassing 16 chapters, this book begins with an overview of the various fields of artificial intelligence. This text then attempts to connect artificial intelligence problems to some of the notions of computability and abstract computing devices. Other chapters consider the general notion of computability, with focus on the interaction bet

  17. Intelligent mechatronics; Intelligent mechatronics

    Energy Technology Data Exchange (ETDEWEB)

    Hashimoto, H. [The University of Tokyo, Tokyo (Japan). Institute of Industrial Science

    1995-10-01

    Intelligent mechatronics (IM) was explained as follows: a study of IM essentially targets realization of a robot namely, but in the present stage the target is a creation of new values by intellectualization of machine, that is, a combination of the information infrastructure and the intelligent machine system. IM is also thought to be constituted of computers positively used and micromechatronics. The paper next introduces examples of IM study, mainly those the author is concerned with as shown below: sensor gloves, robot hands, robot eyes, tele operation, three-dimensional object recognition, mobile robot, magnetic bearing, construction of remote controlled unmanned dam, robot network, sensitivity communication using neuro baby, etc. 27 figs.

  18. Computer simulation of nuclear reactor control by means of heuristic learning controller

    International Nuclear Information System (INIS)

    Bubak, M.; Moscinski, J.

    1976-01-01

    A trial of application of two techniques of Artificial Intelligence: heuristic Programming and Learning Machines Theory for nuclear reactor control is presented. Considering complexity of the mathematical models describing satisfactorily the nuclear reactors, value changes of these models parameters in course of operation, knowledge of some parameters value with too small exactness, there appear diffucluties in the classical approach application for these objects control systems design. The classical approach consists in definition of the permissible control actions set on the base of the set performance index and the object mathematical model. The Artificial Intelligence methods enable construction of the control system, which gets during work an information being a priori inaccessible and uses it for its action change for the control to be the optimum one. Applying these methods we have elaborated the reactor power control system. As the performance index there has been taken the integral of the error square. For the control system there are only accessible: the set power trajectory, the reactor power and the control rod position. The set power trajectory has been divided into time intervals called heuristic intervals. At the beginning of every heuristic interval, on the base of the obtained experience, the control system chooses from the control (heuristic) set the optimum control. The heuristic set it is the set of relations between the control rod rate and the state variables, the set and the obtained power, similar to simplifications applied by nuclear reactors operators. The results obtained for the different control rod rates and different reactor (simulated on the digital computer) show the proper work of the system. (author)

  19. An efficient heuristic for the multi-compartment vehicle routing problem

    OpenAIRE

    Paulo Vitor Silvestrin

    2016-01-01

    We study a variant of the vehicle routing problem that allows vehicles with multiple compartments. The need for multiple compartments frequently arises in practical applications when there are several products of different quality or type, that must be kept or handled separately. The resulting problem is called the multi-compartment vehicle routing problem (MCVRP). We propose a tabu search heuristic and embed it into an iterated local search to solve the MCVRP. In several experiments we analy...

  20. The Effect of Incentive Structure on Heuristic Decision Making: The Proportion Heuristic

    OpenAIRE

    Robert Oxoby

    2007-01-01

    When making judgments, individuals often utilize heuristics to interpret information. We report on a series of experiments designed to test the ways in which incentive mechanisms influence the use of a particular heuristic in decision-making. Specifically, we demonstrate how information regarding the number of available practice problems influences the behaviors of individuals preparing for an exam (the proportion heuristic). More importantly the extent to which this information influences be...

  1. An LP-based heuristic for the fixed charge transportation problem

    DEFF Research Database (Denmark)

    Klose, Andreas

    2007-01-01

    The fixed charge transportation problem consists in finding a minimum cost network flow from a set of suppliers to a set of customers. Beside costs proportional to quantities transported, transportation costs also include a fixed charge. The paper describes a linear programming based heuristic...... approach for computing lower and upper bounds on the minimal cost. To this end, the LP relaxation is iteratively strengthened by means of adding cuts; in each iteration the current LP solution is then used to guide a local search heuristic. In addition to standard polyhedral cuts as lifted cover...

  2. Artificial Intelligence and Moral intelligence

    OpenAIRE

    Laura Pana

    2008-01-01

    We discuss the thesis that the implementation of a moral code in the behaviour of artificial intelligent systems needs a specific form of human and artificial intelligence, not just an abstract intelligence. We present intelligence as a system with an internal structure and the structural levels of the moral system, as well as certain characteristics of artificial intelligent agents which can/must be treated as 1- individual entities (with a complex, specialized, autonomous or selfdetermined,...

  3. Heuristic attacks against graphical password generators

    CSIR Research Space (South Africa)

    Peach, S

    2010-05-01

    Full Text Available In this paper the authors explore heuristic attacks against graphical password generators. A new trend is emerging to use user clickable pictures to generate passwords. This technique of authentication can be successfully used for - for example...

  4. A Direct Heuristic Algorithm for Linear Programming

    Indian Academy of Sciences (India)

    Abstract. An (3) mathematically non-iterative heuristic procedure that needs no artificial variable is presented for solving linear programming problems. An optimality test is included. Numerical experiments depict the utility/scope of such a procedure.

  5. Intelligent Systems For Aerospace Engineering: An Overview

    Science.gov (United States)

    KrishnaKumar, K.

    2003-01-01

    Intelligent systems are nature-inspired, mathematically sound, computationally intensive problem solving tools and methodologies that have become extremely important for advancing the current trends in information technology. Artificially intelligent systems currently utilize computers to emulate various faculties of human intelligence and biological metaphors. They use a combination of symbolic and sub-symbolic systems capable of evolving human cognitive skills and intelligence, not just systems capable of doing things humans do not do well. Intelligent systems are ideally suited for tasks such as search and optimization, pattern recognition and matching, planning, uncertainty management, control, and adaptation. In this paper, the intelligent system technologies and their application potential are highlighted via several examples.

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

    Science.gov (United States)

    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.

  7. Database in Artificial Intelligence.

    Science.gov (United States)

    Wilkinson, Julia

    1986-01-01

    Describes a specialist bibliographic database of literature in the field of artificial intelligence created by the Turing Institute (Glasgow, Scotland) using the BRS/Search information retrieval software. The subscription method for end-users--i.e., annual fee entitles user to unlimited access to database, document provision, and printed awareness…

  8. RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM

    OpenAIRE

    Umetani, Shunji; Yagiura, Mutsunori; 柳浦, 睦憲

    2007-01-01

    The set covering problem (SCP) is one of representative combinatorial optimization problems, which has many practical applications. The continuous development of mathematical programming has derived a number of impressive heuristic algorithms as well as exact branch-and-bound algorithms, which can solve huge SCP instances of bus, railway and airline crew scheduling problems. We survey heuristic algorithms for SCP focusing mainly on contributions of mathematical programming techniques to heuri...

  9. A heuristic forecasting model for stock decision

    OpenAIRE

    Zhang, D.; Jiang, Q.; Li, X.

    2005-01-01

    This paper describes a heuristic forecasting model based on neural networks for stock decision-making. Some heuristic strategies are presented for enhancing the learning capability of neural networks and obtaining better trading performance. The China Shanghai Composite Index is used as case study. The forecasting model can forecast the buying and selling signs according to the result of neural network prediction. Results are compared with a benchmark buy-and-hold strategy. ...

  10. Psychology into economics: fast and frugal heuristics

    OpenAIRE

    Schilirò, Daniele

    2015-01-01

    The present essay focuses on the fast and frugal heuristics program set forth by Gerd Gigerenzer and his fellows. In particular it examines the contribution of Gigerenzer and Goldstein (1996) ‘Reasoning the Fast and Frugal Way: Models of Bounded Rationality’. This essay, following the theoretical propositions and the empirical evidence of Gigerenzer and Goldstein, points out that simple cognitive mechanisms such as fast and frugal heuristics can be capable of successful performance in real wo...

  11. Arational heuristic model of economic decision making

    OpenAIRE

    Grandori, Anna

    2010-01-01

    The article discuss the limits of both the rational actor and the behavioral paradigms in explaining and guiding innovative decision making and outlines a model of economic decision making that in the course of being 'heuristic' (research and discovery oriented) is also 'rational' (in the broad sense of following correct reasoning and scientific methods, non 'biasing'). The model specifies a set of 'rational heuristics' for innovative decision making, for the various sub-processes of problem ...

  12. Intelligence, Academic Self-Concept, and Information Literacy: The Role of Adequate Perceptions of Academic Ability in the Acquisition of Knowledge about Information Searching

    Science.gov (United States)

    Rosman, Tom; Mayer, Anne-Kathrin; Krampen, Günter

    2015-01-01

    Introduction: The present paper argues that adequate self-perceptions of academic ability are essential for students' realization of their intellectual potential, thereby fostering learning of complex skills, e.g., information-seeking skills. Thus, academic self-concept should moderate the relationship between intelligence and information…

  13. Social heuristics shape intuitive cooperation.

    Science.gov (United States)

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

    2014-04-22

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

  14. Heuristics as Bayesian inference under extreme priors.

    Science.gov (United States)

    Parpart, Paula; Jones, Matt; Love, Bradley C

    2018-05-01

    Simple heuristics are often regarded as tractable decision strategies because they ignore a great deal of information in the input data. One puzzle is why heuristics can outperform full-information models, such as linear regression, which make full use of the available information. These "less-is-more" effects, in which a relatively simpler model outperforms a more complex model, are prevalent throughout cognitive science, and are frequently argued to demonstrate an inherent advantage of simplifying computation or ignoring information. In contrast, we show at the computational level (where algorithmic restrictions are set aside) that it is never optimal to discard information. Through a formal Bayesian analysis, we prove that popular heuristics, such as tallying and take-the-best, are formally equivalent to Bayesian inference under the limit of infinitely strong priors. Varying the strength of the prior yields a continuum of Bayesian models with the heuristics at one end and ordinary regression at the other. Critically, intermediate models perform better across all our simulations, suggesting that down-weighting information with the appropriate prior is preferable to entirely ignoring it. Rather than because of their simplicity, our analyses suggest heuristics perform well because they implement strong priors that approximate the actual structure of the environment. We end by considering how new heuristics could be derived by infinitely strengthening the priors of other Bayesian models. These formal results have implications for work in psychology, machine learning and economics. Copyright © 2017 The Authors. Published by Elsevier Inc. All rights reserved.

  15. Implementation of a Tabu Search Heuristic for the Examinations ...

    African Journals Online (AJOL)

    Log in or Register to get access to full text downloads. ... The Examinations Timetabling Problem is the problem of assigning examinations and candidates to ... Generally, timetabling problems are NP-Hard and therefore very difficult to solve.

  16. Best-First Heuristic Search for Multicore Machines

    Science.gov (United States)

    2010-01-01

    Otto, 1998) to implement an asynchronous version of PRA* that they call Hash Distributed A* ( HDA *). HDA * distributes nodes using a hash function in...nodes which are being communicated between peers are in transit. In contact with the authors of HDA *, we have created an implementation of HDA * for...Also, our implementation of HDA * allows us to make a fair comparison between algorithms by sharing common data structures such as priority queues and

  17. Static and Dynamic Path Planning Using Incremental Heuristic Search

    OpenAIRE

    Khattab, Asem

    2018-01-01

    Path planning is an important component in any highly automated vehicle system. In this report, the general problem of path planning is considered first in partially known static environments where only static obstacles are present but the layout of the environment is changing as the agent acquires new information. Attention is then given to the problem of path planning in dynamic environments where there are moving obstacles in addition to the static ones. Specifically, a 2D car-like agent t...

  18. The Impact of Parametrization on Randomized Search Heuristics

    DEFF Research Database (Denmark)

    Gießen, Christian

    with mutation probability c/n on ONEMAX, where c > 0 and λ are constant. We present an improved variable drift theorem that weakens the requirement that no large steps towards the optimum may occur in the process to a stochastic one, reducing the analysis of the expected optimization time to finding an exact...... algorithms. It consists of creating half the offspring with a higher and the rest with a lower mutation rate. The mutation rate is then adjusted, based on the success of the subpopulations. We show that the (1+λ) EA optimizes ONEMAX in an expected optimization time of O(nλ/logλ + nlogn) which has been shown...... evaluation. On classical test functions, such noise makes optimization by the simple (1+1) EA hillclimber infeasible even in exponential time. Interestingly, the use of parent and offspring populations of only logarithmic size turns the algorithm into an efficient one. The results are obtained by drift...

  19. Two efficient heuristics to solve the integrated load distribution and production planning problem

    International Nuclear Information System (INIS)

    Gajpal, Yuvraj; Nourelfath, Mustapha

    2015-01-01

    This paper considers a multi-period production system where a set of machines are arranged in parallel. The machines are unreliable and the failure rate of machine depends on the load assigned to the machine. The expected production rate of the system is considered to be a non-monotonic function of its load. Because of the machine failure rate, the total production output depends on the combination of loads assigned to different machines. We consider the integration of load distribution decisions with production planning decision. The product demands are considered to be known in advance. The objective is to minimize the sum of holding costs, backorder costs, production costs, setup costs, capacity change costs and unused capacity costs while satisfying the demand over specified time horizon. The constraint is not to exceed available repair resources required to repair the machine breakdown. The paper develops two heuristics to solve the integrated load distribution and production planning problem. The first heuristic consists of a three-phase approach, while the second one is based on tabu search metaheuristic. The efficiency of the proposed heuristics is tested through the randomly generated problem instances. - Highlights: • The expected performance of the system is a non-monotonic function of its load. • We consider the integration of load distribution and production planning decisions. • The paper proposes three phase and tabu search based heuristics to solve the problem. • Lower bound has been developed for checking the effectiveness of the heuristics. • The efficiency of the heuristic is tested through randomly generated instances.

  20. Choosing a heuristic and root node for edge ordering in BDD-based network reliability analysis

    International Nuclear Information System (INIS)

    Mo, Yuchang; Xing, Liudong; Zhong, Farong; Pan, Zhusheng; Chen, Zhongyu

    2014-01-01

    In the Binary Decision Diagram (BDD)-based network reliability analysis, heuristics have been widely used to obtain a reasonably good ordering of edge variables. Orderings generated using different heuristics can lead to dramatically different sizes of BDDs, and thus dramatically different running times and memory usages for the analysis of the same network. Unfortunately, due to the nature of the ordering problem (i.e., being an NP-complete problem) no formal guidelines or rules are available for choosing a good heuristic or for choosing a high-performance root node to perform edge searching using a particular heuristic. In this work, we make novel contributions by proposing heuristic and root node selection methods based on the concept of boundary sets for the BDD-based network reliability analysis. Empirical studies show that the proposed selection methods can help to generate high-performance edge ordering for most of studied cases, enabling the efficient BDD-based reliability analysis of large-scale networks. The proposed methods are demonstrated on different types of networks, including square lattice networks, torus lattice networks and de Bruijn networks

  1. A business intelligence approach using web search tools and online data reduction techniques to examine the value of product-enabled services

    DEFF Research Database (Denmark)

    Tanev, Stoyan; Liotta, Giacomo; Kleismantas, Andrius

    2015-01-01

    in Canada and Europe. It adopts an innovative methodology based on online textual data that could be implemented in advanced business intelligence tools aiming at the facilitation of innovation, marketing and business decision making. Combinations of keywords referring to different aspects of service value......-service innovation as a competitive advantage on the marketplace. On the other hand, the focus of EU firms on innovative hybrid offerings is not explicitly related to business differentiation and competitiveness....

  2. Artificial Intelligence.

    Science.gov (United States)

    Information Technology Quarterly, 1985

    1985-01-01

    This issue of "Information Technology Quarterly" is devoted to the theme of "Artificial Intelligence." It contains two major articles: (1) Artificial Intelligence and Law" (D. Peter O'Neill and George D. Wood); (2) "Artificial Intelligence: A Long and Winding Road" (John J. Simon, Jr.). In addition, it contains two sidebars: (1) "Calculating and…

  3. Competitive Intelligence.

    Science.gov (United States)

    Bergeron, Pierrette; Hiller, Christine A.

    2002-01-01

    Reviews the evolution of competitive intelligence since 1994, including terminology and definitions and analytical techniques. Addresses the issue of ethics; explores how information technology supports the competitive intelligence process; and discusses education and training opportunities for competitive intelligence, including core competencies…

  4. Prediction-based dynamic load-sharing heuristics

    Science.gov (United States)

    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.

  5. Accelerated Profile HMM Searches.

    Directory of Open Access Journals (Sweden)

    Sean R Eddy

    2011-10-01

    Full Text Available Profile hidden Markov models (profile HMMs and probabilistic inference methods have made important contributions to the theory of sequence database homology search. However, practical use of profile HMM methods has been hindered by the computational expense of existing software implementations. Here I describe an acceleration heuristic for profile HMMs, the "multiple segment Viterbi" (MSV algorithm. The MSV algorithm computes an optimal sum of multiple ungapped local alignment segments using a striped vector-parallel approach previously described for fast Smith/Waterman alignment. MSV scores follow the same statistical distribution as gapped optimal local alignment scores, allowing rapid evaluation of significance of an MSV score and thus facilitating its use as a heuristic filter. I also describe a 20-fold acceleration of the standard profile HMM Forward/Backward algorithms using a method I call "sparse rescaling". These methods are assembled in a pipeline in which high-scoring MSV hits are passed on for reanalysis with the full HMM Forward/Backward algorithm. This accelerated pipeline is implemented in the freely available HMMER3 software package. Performance benchmarks show that the use of the heuristic MSV filter sacrifices negligible sensitivity compared to unaccelerated profile HMM searches. HMMER3 is substantially more sensitive and 100- to 1000-fold faster than HMMER2. HMMER3 is now about as fast as BLAST for protein searches.

  6. Quantifying Heuristic Bias: Anchoring, Availability, and Representativeness.

    Science.gov (United States)

    Richie, Megan; Josephson, S Andrew

    2018-01-01

    Construct: Authors examined whether a new vignette-based instrument could isolate and quantify heuristic bias. Heuristics are cognitive shortcuts that may introduce bias and contribute to error. There is no standardized instrument available to quantify heuristic bias in clinical decision making, limiting future study of educational interventions designed to improve calibration of medical decisions. This study presents validity data to support a vignette-based instrument quantifying bias due to the anchoring, availability, and representativeness heuristics. Participants completed questionnaires requiring assignment of probabilities to potential outcomes of medical and nonmedical scenarios. The instrument randomly presented scenarios in one of two versions: Version A, encouraging heuristic bias, and Version B, worded neutrally. The primary outcome was the difference in probability judgments for Version A versus Version B scenario options. Of 167 participants recruited, 139 enrolled. Participants assigned significantly higher mean probability values to Version A scenario options (M = 9.56, SD = 3.75) than Version B (M = 8.98, SD = 3.76), t(1801) = 3.27, p = .001. This result remained significant analyzing medical scenarios alone (Version A, M = 9.41, SD = 3.92; Version B, M = 8.86, SD = 4.09), t(1204) = 2.36, p = .02. Analyzing medical scenarios by heuristic revealed a significant difference between Version A and B for availability (Version A, M = 6.52, SD = 3.32; Version B, M = 5.52, SD = 3.05), t(404) = 3.04, p = .003, and representativeness (Version A, M = 11.45, SD = 3.12; Version B, M = 10.67, SD = 3.71), t(396) = 2.28, p = .02, but not anchoring. Stratifying by training level, students maintained a significant difference between Version A and B medical scenarios (Version A, M = 9.83, SD = 3.75; Version B, M = 9.00, SD = 3.98), t(465) = 2.29, p = .02, but not residents or attendings. Stratifying by heuristic and training level, availability maintained

  7. A novel optimization method, Gravitational Search Algorithm (GSA), for PWR core optimization

    International Nuclear Information System (INIS)

    Mahmoudi, S.M.; Aghaie, M.; Bahonar, M.; Poursalehi, N.

    2016-01-01

    Highlights: • The Gravitational Search Algorithm (GSA) is introduced. • The advantage of GSA is verified in Shekel’s Foxholes. • Reload optimizing in WWER-1000 and WWER-440 cases are performed. • Maximizing K eff , minimizing PPFs and flattening power density is considered. - Abstract: In-core fuel management optimization (ICFMO) is one of the most challenging concepts of nuclear engineering. In recent decades several meta-heuristic algorithms or computational intelligence methods have been expanded to optimize reactor core loading pattern. This paper presents a new method of using Gravitational Search Algorithm (GSA) for in-core fuel management optimization. The GSA is constructed based on the law of gravity and the notion of mass interactions. It uses the theory of Newtonian physics and searcher agents are the collection of masses. In this work, at the first step, GSA method is compared with other meta-heuristic algorithms on Shekel’s Foxholes problem. In the second step for finding the best core, the GSA algorithm has been performed for three PWR test cases including WWER-1000 and WWER-440 reactors. In these cases, Multi objective optimizations with the following goals are considered, increment of multiplication factor (K eff ), decrement of power peaking factor (PPF) and power density flattening. It is notable that for neutronic calculation, PARCS (Purdue Advanced Reactor Core Simulator) code is used. The results demonstrate that GSA algorithm have promising performance and could be proposed for other optimization problems of nuclear engineering field.

  8. Black-Box Search by Unbiased Variation

    DEFF Research Database (Denmark)

    Lehre, Per Kristian; Witt, Carsten

    2012-01-01

    The complexity theory for black-box algorithms, introduced by Droste, Jansen, and Wegener (Theory Comput. Syst. 39:525–544, 2006), describes common limits on the efficiency of a broad class of randomised search heuristics. There is an obvious trade-off between the generality of the black-box model...... and the strength of the bounds that can be proven in such a model. In particular, the original black-box model provides for well-known benchmark problems relatively small lower bounds, which seem unrealistic in certain cases and are typically not met by popular search heuristics.In this paper, we introduce a more...... restricted black-box model for optimisation of pseudo-Boolean functions which we claim captures the working principles of many randomised search heuristics including simulated annealing, evolutionary algorithms, randomised local search, and others. The key concept worked out is an unbiased variation operator...

  9. Can we trust module-respect heuristics?

    International Nuclear Information System (INIS)

    Mo, Yuchang

    2013-01-01

    BDD (Binary Decision Diagrams) have proven to be a very efficient tool to assess Fault Trees. However, the size of BDD, and therefore the efficiency of the whole methodology, depends dramatically on the choice of variable ordering. The determination of the best variable ordering is intractable. Therefore, heuristics have been designed to select reasonably good variable orderings. One very important common feature for good static heuristics is to respect modules. In this paper, the notion of module-respect is studied in a systematic way. It is proved that under certain condition there always exists an optimal ordering that respects modules. This condition is that for each module there is always a smallest module BDD and each included module variable appears only once. On the other hand, it is shown that for the trees not satisfying the above sufficient condition the optimal orderings may not be able to be directly generated using module-respect heuristics, even when the shuffling strategy is used.

  10. Judgment under Uncertainty: Heuristics and Biases.

    Science.gov (United States)

    Tversky, A; Kahneman, D

    1974-09-27

    This article described three heuristics that are employed in making judgements under uncertainty: (i) representativeness, which is usually employed when people are asked to judge the probability that an object or event A belongs to class or process B; (ii) availability of instances or scenarios, which is often employed when people are asked to assess the frequency of a class or the plausibility of a particular development; and (iii) adjustment from an anchor, which is usually employed in numerical prediction when a relevant value is available. These heuristics are highly economical and usually effective, but they lead to systematic and predictable errors. A better understanding of these heuristics and of the biases to which they lead could improve judgements and decisions in situations of uncertainty.

  11. Fuel lattice design using heuristics and new strategies

    Energy Technology Data Exchange (ETDEWEB)

    Ortiz S, J. J.; Castillo M, J. A.; Torres V, M.; Perusquia del Cueto, R. [ININ, Carretera Mexico-Toluca s/n, Ocoyoacac 52750, Estado de Mexico (Mexico); Pelta, D. A. [ETS Ingenieria Informatica y Telecomunicaciones, Universidad de Granada, Daniel Saucedo Aranda s/n, 18071 Granada (Spain); Campos S, Y., E-mail: juanjose.ortiz@inin.gob.m [IPN, Escuela Superior de Fisica y Matematicas, Unidad Profesional Adolfo Lopez Mateos, Edif. 9, 07738 Mexico D. F. (Mexico)

    2010-10-15

    This work show some results of the fuel lattice design in BWRs when some allocation pin rod rules are not taking into account. Heuristics techniques like Path Re linking and Greedy to design fuel lattices were used. The scope of this work is to search about how do classical rules in design fuel lattices affect the heuristics techniques results and the fuel lattice quality. The fuel lattices quality is measured by Power Peaking Factor and Infinite Multiplication Factor at the beginning of the fuel lattice life. CASMO-4 code to calculate these parameters was used. The analyzed rules are the following: pin rods with lowest uranium enrichment are only allocated in the fuel lattice corner, and pin rods with gadolinium cannot allocated in the fuel lattice edge. Fuel lattices with and without gadolinium in the main diagonal were studied. Some fuel lattices were simulated in an equilibrium cycle fuel reload, using Simulate-3 to verify their performance. So, the effective multiplication factor and thermal limits can be verified. The obtained results show a good performance in some fuel lattices designed, even thought, the knowing rules were not implemented. A fuel lattice performance and fuel lattice design characteristics analysis was made. To the realized tests, a dell workstation was used, under Li nux platform. (Author)

  12. Heuristics Miner for E-Commerce Visitor Access Pattern Representation

    Directory of Open Access Journals (Sweden)

    Kartina Diah Kesuma Wardhani

    2017-06-01

    Full Text Available E-commerce click stream data can form a certain pattern that describe visitor behavior while surfing the e-commerce website. This pattern can be used to initiate a design to determine alternative access sequence on the website. This research use heuristic miner algorithm to determine the pattern. σ-Algorithm and Genetic Mining are methods used for pattern recognition with frequent sequence item set approach. Heuristic Miner is an evolved form of those methods. σ-Algorithm assume that an activity in a website, that has been recorded in the data log, is a complete sequence from start to finish, without any tolerance to incomplete data or data with noise. On the other hand, Genetic Mining is a method that tolerate incomplete data or data with noise, so it can generate a more detailed e-commerce visitor access pattern. In this study, the same sequence of events obtained from six-generated patterns. The resulting pattern of visitor access is that visitors are often access the home page and then the product category page or the home page and then the full text search page.

  13. Fuel lattice design using heuristics and new strategies

    International Nuclear Information System (INIS)

    Ortiz S, J. J.; Castillo M, J. A.; Torres V, M.; Perusquia del Cueto, R.; Pelta, D. A.; Campos S, Y.

    2010-10-01

    This work show some results of the fuel lattice design in BWRs when some allocation pin rod rules are not taking into account. Heuristics techniques like Path Re linking and Greedy to design fuel lattices were used. The scope of this work is to search about how do classical rules in design fuel lattices affect the heuristics techniques results and the fuel lattice quality. The fuel lattices quality is measured by Power Peaking Factor and Infinite Multiplication Factor at the beginning of the fuel lattice life. CASMO-4 code to calculate these parameters was used. The analyzed rules are the following: pin rods with lowest uranium enrichment are only allocated in the fuel lattice corner, and pin rods with gadolinium cannot allocated in the fuel lattice edge. Fuel lattices with and without gadolinium in the main diagonal were studied. Some fuel lattices were simulated in an equilibrium cycle fuel reload, using Simulate-3 to verify their performance. So, the effective multiplication factor and thermal limits can be verified. The obtained results show a good performance in some fuel lattices designed, even thought, the knowing rules were not implemented. A fuel lattice performance and fuel lattice design characteristics analysis was made. To the realized tests, a dell workstation was used, under Li nux platform. (Author)

  14. Intelligence Naturelle et Intelligence Artificielle

    OpenAIRE

    Dubois, Daniel

    2011-01-01

    Cet article présente une approche systémique du concept d’intelligence naturelle en ayant pour objectif de créer une intelligence artificielle. Ainsi, l’intelligence naturelle, humaine et animale non-humaine, est une fonction composée de facultés permettant de connaître et de comprendre. De plus, l'intelligence naturelle reste indissociable de la structure, à savoir les organes du cerveau et du corps. La tentation est grande de doter les systèmes informatiques d’une intelligence artificielle ...

  15. A HYBRID HEURISTIC ALGORITHM FOR SOLVING THE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM (RCPSP

    Directory of Open Access Journals (Sweden)

    Juan Carlos Rivera

    Full Text Available The Resource Constrained Project Scheduling Problem (RCPSP is a problem of great interest for the scientific community because it belongs to the class of NP-Hard problems and no methods are known that can solve it accurately in polynomial processing times. For this reason heuristic methods are used to solve it in an efficient way though there is no guarantee that an optimal solution can be obtained. This research presents a hybrid heuristic search algorithm to solve the RCPSP efficiently, combining elements of the heuristic Greedy Randomized Adaptive Search Procedure (GRASP, Scatter Search and Justification. The efficiency obtained is measured taking into account the presence of the new elements added to the GRASP algorithm taken as base: Justification and Scatter Search. The algorithms are evaluated using three data bases of instances of the problem: 480 instances of 30 activities, 480 of 60, and 600 of 120 activities respectively, taken from the library PSPLIB available online. The solutions obtained by the developed algorithm for the instances of 30, 60 and 120 are compared with results obtained by other researchers at international level, where a prominent place is obtained, according to Chen (2011.

  16. Heuristics for container loading of furniture

    DEFF Research Database (Denmark)

    Egeblad, Jens; Garavelli, Claudio; Lisi, Stefano

    2010-01-01

    . In the studied company, the problem arises hundreds of times daily during transport planning. Instances may contain more than one hundred different items with irregular shapes. To solve this complex problem we apply a set of heuristics successively that each solve one part of the problem. Large items...... are combined in specific structures to ensure proper protection of the items during transportation and to simplify the problem. The solutions generated by the heuristic has an average loading utilization of 91.3% for the most general instances with average running times around 100 seconds....

  17. Heuristic extension of the Schwarzschild metric

    International Nuclear Information System (INIS)

    Espinosa, J.M.

    1982-01-01

    The Schwarzschild solution of Einstein's equations of gravitation has several singularities. It is known that the singularity at r = 2Gm/c 2 is only apparent, a result of the coordinates in which the solution was found. Paradoxical results occuring near the singularity show the system of coordinates is incomplete. We introduce a simple, two-dimensional metric with an apparent singularity that makes it incomplete. By a straightforward, heuristic procedure we extend and complete this simple metric. We then use the same procedure to give a heuristic derivation of the Kruskal system of coordinates, which is known to extend the Schwarzschild manifold past its apparent singularity and produce a complete manifold

  18. Age Effects and Heuristics in Decision Making.

    Science.gov (United States)

    Besedeš, Tibor; Deck, Cary; Sarangi, Sudipta; Shor, Mikhael

    2012-05-01

    Using controlled experiments, we examine how individuals make choices when faced with multiple options. Choice tasks are designed to mimic the selection of health insurance, prescription drug, or retirement savings plans. In our experiment, available options can be objectively ranked allowing us to examine optimal decision making. First, the probability of a person selecting the optimal option declines as the number of options increases, with the decline being more pronounced for older subjects. Second, heuristics differ by age with older subjects relying more on suboptimal decision rules. In a heuristics validation experiment, older subjects make worse decisions than younger subjects.

  19. Challenging problems and solutions in intelligent systems

    CERN Document Server

    Grzegorzewski, Przemysław; Kacprzyk, Janusz; Owsiński, Jan; Penczek, Wojciech; Zadrożny, Sławomir

    2016-01-01

    This volume presents recent research, challenging problems and solutions in Intelligent Systems– covering the following disciplines: artificial and computational intelligence, fuzzy logic and other non-classic logics, intelligent database systems, information retrieval, information fusion, intelligent search (engines), data mining, cluster analysis, unsupervised learning, machine learning, intelligent data analysis, (group) decision support systems, intelligent agents and multi-agent systems, knowledge-based systems, imprecision and uncertainty handling, electronic commerce, distributed systems, etc. The book defines a common ground for sometimes seemingly disparate problems and addresses them by using the paradigm of broadly perceived intelligent systems. It presents a broad panorama of a multitude of theoretical and practical problems which have been successfully dealt with using the paradigm of intelligent computing.

  20. Intelligent environmental data warehouse

    International Nuclear Information System (INIS)

    Ekechukwu, B.

    1998-01-01

    Making quick and effective decisions in environment management are based on multiple and complex parameters, a data warehouse is a powerful tool for the over all management of massive environmental information. Selecting the right data from a warehouse is an important factor consideration for end-users. This paper proposed an intelligent environmental data warehouse system. It consists of data warehouse to feed an environmental researchers and managers with desire environmental information needs to their research studies and decision in form of geometric and attribute data for study area, and a metadata for the other sources of environmental information. In addition, the proposed intelligent search engine works according to a set of rule, which enables the system to be aware of the environmental data wanted by the end-user. The system development process passes through four stages. These are data preparation, warehouse development, intelligent engine development and internet platform system development. (author)

  1. A Combination of Meta-heuristic and Heuristic Algorithms for the VRP, OVRP and VRP with Simultaneous Pickup and Delivery

    Directory of Open Access Journals (Sweden)

    Maryam Ashouri

    2017-07-01

    Full Text Available Vehicle routing problem (VRP is a Nondeterministic Polynomial Hard combinatorial optimization problem to serve the consumers from central depots and returned back to the originated depots with given vehicles. Furthermore, two of the most important extensions of the VRPs are the open vehicle routing problem (OVRP and VRP with simultaneous pickup and delivery (VRPSPD. In OVRP, the vehicles have not return to the depot after last visit and in VRPSPD, customers require simultaneous delivery and pick-up service. The aim of this paper is to present a combined effective ant colony optimization (CEACO which includes sweep and several local search algorithms which is different with common ant colony optimization (ACO. An extensive numerical experiment is performed on benchmark problem instances addressed in the literature. The computational result shows that suggested CEACO approach not only presented a very satisfying scalability, but also was competitive with other meta-heuristic algorithms in the literature for solving VRP, OVRP and VRPSPD problems. Keywords: Meta-heuristic algorithms, Vehicle Routing Problem, Open Vehicle Routing Problem, Simultaneously Pickup and Delivery, Ant Colony Optimization.

  2. Greedy Local Search and Vertex Cover in Sparse Random Graphs

    DEFF Research Database (Denmark)

    Witt, Carsten

    2009-01-01

    . This work starts with a rigorous explanation for this claim based on the refined analysis of the Karp-Sipser algorithm by Aronson et al. Subsequently, theoretical supplements are given to experimental studies of search heuristics on random graphs. For c 1, a greedy and randomized local-search heuristic...... finds an optimal cover in polynomial time with a probability arbitrarily close to 1. This behavior relies on the absence of a giant component. As an additional insight into the randomized search, it is shown that the heuristic fails badly also on graphs consisting of a single tree component of maximum......Recently, various randomized search heuristics have been studied for the solution of the minimum vertex cover problem, in particular for sparse random instances according to the G(n, c/n) model, where c > 0 is a constant. Methods from statistical physics suggest that the problem is easy if c

  3. Adaptive switching gravitational search algorithm: an attempt to ...

    Indian Academy of Sciences (India)

    Nor Azlina Ab Aziz

    An adaptive gravitational search algorithm (GSA) that switches between synchronous and ... genetic algorithm (GA), bat-inspired algorithm (BA) and grey wolf optimizer (GWO). ...... heuristic with applications in applied electromagnetics. Prog.

  4. Artificial Intelligence in Civil Engineering

    Directory of Open Access Journals (Sweden)

    Pengzhen Lu

    2012-01-01

    Full Text Available Artificial intelligence is a branch of computer science, involved in the research, design, and application of intelligent computer. Traditional methods for modeling and optimizing complex structure systems require huge amounts of computing resources, and artificial-intelligence-based solutions can often provide valuable alternatives for efficiently solving problems in the civil engineering. This paper summarizes recently developed methods and theories in the developing direction for applications of artificial intelligence in civil engineering, including evolutionary computation, neural networks, fuzzy systems, expert system, reasoning, classification, and learning, as well as others like chaos theory, cuckoo search, firefly algorithm, knowledge-based engineering, and simulated annealing. The main research trends are also pointed out in the end. The paper provides an overview of the advances of artificial intelligence applied in civil engineering.

  5. Heuristic Optimization for the Discrete Virtual Power Plant Dispatch Problem

    DEFF Research Database (Denmark)

    Petersen, Mette Kirschmeyer; Hansen, Lars Henrik; Bendtsen, Jan Dimon

    2014-01-01

    We consider a Virtual Power Plant, which is given the task of dispatching a fluctuating power supply to a portfolio of flexible consumers. The flexible consumers are modeled as discrete batch processes, and the associated optimization problem is denoted the Discrete Virtual Power Plant Dispatch...... Problem. First NP-completeness of the Discrete Virtual Power Plant Dispatch Problem is proved formally. We then proceed to develop tailored versions of the meta-heuristic algorithms Hill Climber and Greedy Randomized Adaptive Search Procedure (GRASP). The algorithms are tuned and tested on portfolios...... of varying sizes. We find that all the tailored algorithms perform satisfactorily in the sense that they are able to find sub-optimal, but usable, solutions to very large problems (on the order of 10 5 units) at computation times on the scale of just 10 seconds, which is far beyond the capabilities...

  6. Assessing Use of Cognitive Heuristic Representativeness in Clinical Reasoning

    OpenAIRE

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

  7. Automated generation of constructive ordering heuristics for educational timetabling

    OpenAIRE

    Pillay, Nelishia; Özcan, Ender

    2017-01-01

    Construction heuristics play an important role in solving combinatorial optimization problems. These heuristics are usually used to create an initial solution to the problem which is improved using optimization techniques such as metaheuristics. For examination timetabling and university course timetabling problems essentially graph colouring heuristics have been used for this purpose. The process of deriving heuristics manually for educational timetabling is a time consuming task. Furthermor...

  8. Adaptive selection of heuristics for improving exam timetables

    OpenAIRE

    Burke, Edmund; Qu, Rong; Soghier, Amr

    2014-01-01

    This paper presents a hyper-heuristic approach which hybridises low-level heuristic moves to improve timetables. Exams which cause a soft-constraint violation in the timetable are ordered and rescheduled to produce a better timetable. It is observed that both the order in which exams are rescheduled and the heuristic moves used to reschedule the exams and improve the timetable affect the quality of the solution produced. After testing different combinations in a hybrid hyper-heuristic approac...

  9. A comparative analysis of meta-heuristic methods for power management of a dual energy storage system for electric vehicles

    International Nuclear Information System (INIS)

    Trovão, João P.; Antunes, Carlos Henggeler

    2015-01-01

    Highlights: • Two meta-heuristic approaches are evaluated for multi-ESS management in electric vehicles. • An online global energy management strategy with two different layers is studied. • Meta-heuristic techniques are used to define optimized energy sharing mechanisms. • A comparative analysis for ARTEMIS driving cycle is addressed. • The effectiveness of the double-layer management with meta-heuristic is presented. - Abstract: This work is focused on the performance evaluation of two meta-heuristic approaches, simulated annealing and particle swarm optimization, to deal with power management of a dual energy storage system for electric vehicles. The proposed strategy is based on a global energy management system with two layers: long-term (energy) and short-term (power) management. A rule-based system deals with the long-term (strategic) layer and for the short-term (action) layer meta-heuristic techniques are developed to define optimized online energy sharing mechanisms. Simulations have been made for several driving cycles to validate the proposed strategy. A comparative analysis for ARTEMIS driving cycle is presented evaluating three performance indicators (computation time, final value of battery state of charge, and minimum value of supercapacitors state of charge) as a function of input parameters. The results show the effectiveness of an implementation based on a double-layer management system using meta-heuristic methods for online power management supported by a rule set that restricts the search space

  10. Applying usability heuristics to radiotherapy systems

    International Nuclear Information System (INIS)

    Chan, Alvita J.; Islam, Mohammad K.; Rosewall, Tara; Jaffray, David A.; Easty, Anthony C.; Cafazzo, Joseph A.

    2012-01-01

    Background and purpose: Heuristic evaluations have been used to evaluate safety of medical devices by identifying and assessing usability issues. Since radiotherapy treatment delivery systems often consist of multiple complex user-interfaces, a heuristic evaluation was conducted to assess the potential safety issues of such a system. Material and methods: A heuristic evaluation was conducted to evaluate the treatment delivery system at Princess Margaret Hospital (Toronto, Canada). Two independent evaluators identified usability issues with the user-interfaces and rated the severity of each issue. Results: The evaluators identified 75 usability issues in total. Eighteen of them were rated as high severity, indicating the potential to have a major impact on patient safety. A majority of issues were found on the record and verify system, and many were associated with the patient setup process. While the hospital has processes in place to ensure patient safety, recommendations were developed to further mitigate the risks of potential consequences. Conclusions: Heuristic evaluation is an efficient and inexpensive method that can be successfully applied to radiotherapy delivery systems to identify usability issues and improve patient safety. Although this study was conducted only at one site, the findings may have broad implications for the design of these systems.

  11. Can the inherence heuristic explain vitalistic reasoning?

    Science.gov (United States)

    Bastian, Brock

    2014-10-01

    Inherence is an important component of psychological essentialism. By drawing on vitalism as a way in which to explain this link, however, the authors appear to conflate causal explanations based on fixed features with those based on general causal forces. The disjuncture between these two types of explanatory principles highlights potential new avenues for the inherence heuristic.

  12. Fast heuristics for a dynamic paratransit problem

    NARCIS (Netherlands)

    Cremers, M.L.A.G.; Klein Haneveld, W.K.; van der Vlerk, M.H.

    2008-01-01

    In a previous paper we developed a non-standard two-stage recourse model for the dynamic day-ahead paratransit planning problem. Two heuristics, which are frequently applied in the recourse model, contain many details which leads to large CPU times to solve instances of relatively small size. In

  13. A Heuristic for Improving Transmedia Exhibition Experience

    DEFF Research Database (Denmark)

    Selvadurai, Vashanth; Rosenstand, Claus Andreas Foss

    2017-01-01

    in the scientific field of designing transmedia experience in an exhibition context that links the pre- and post-activities to the actual visit (during-activities). The result of this study is a preliminary heuristic for establishing a relation between the platform and content complexity in transmedia exhibitions....

  14. Heuristics for speeding up gaze estimation

    DEFF Research Database (Denmark)

    Leimberg, Denis; Vester-Christensen, Martin; Ersbøll, Bjarne Kjær

    2005-01-01

    A deformable template method for eye tracking on full face images is presented. The strengths of the method are that it is fast and retains accuracy independently of the resolution. We compare the method with a state of the art active contour approach, showing that the heuristic method is more...

  15. The Heuristic Interpretation of Box Plots

    Science.gov (United States)

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

    2013-01-01

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

  16. Heuristic Classification. Technical Report Number 12.

    Science.gov (United States)

    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…

  17. Engineering applications of heuristic multilevel optimization methods

    Science.gov (United States)

    Barthelemy, Jean-Francois M.

    1989-01-01

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

  18. A Heuristic for the Teaching of Persuasion.

    Science.gov (United States)

    Schell, John F.

    Interpreting Aristotle's criteria for persuasive writing--ethos, logos, and pathos--as a concern for writer, language, and audience creates both an effective model for persuasive writing and a structure around which to organize discussions of relevant rhetorical issues. Use of this heuristic to analyze writing style, organization, and content…

  19. Fourth Graders' Heuristic Problem-Solving Behavior.

    Science.gov (United States)

    Lee, Kil S.

    1982-01-01

    Eight boys and eight girls from a rural elementary school participated in the investigation. Specific heuristics were adopted from Polya; and the students selected represented two substages of Piaget's concrete operational stage. Five hypotheses were generated, based on observed results and the study's theoretical rationale. (MP)

  20. Heuristic Decision Making in Network Linking

    NARCIS (Netherlands)

    M.J.W. Harmsen - Van Hout (Marjolein); B.G.C. Dellaert (Benedict); P.J.J. Herings (Jean-Jacques)

    2015-01-01

    textabstractNetwork formation among individuals constitutes an important part of many OR processes, but relatively little is known about how individuals make their linking decisions in networks. This article provides an investigation of heuristic effects in individual linking decisions for

  1. Investigating Heuristic Evaluation: A Case Study.

    Science.gov (United States)

    Goldman, Kate Haley; Bendoly, Laura

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

  2. Internal Medicine residents use heuristics to estimate disease probability

    Directory of Open Access Journals (Sweden)

    Sen Phang

    2015-12-01

    Conclusions: 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.

  3. Heuristics Made Easy: An Effort-Reduction Framework

    Science.gov (United States)

    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…

  4. A Variable-Selection Heuristic for K-Means Clustering.

    Science.gov (United States)

    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)

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

    Science.gov (United States)

    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…

  6. A hybrid heuristic algorithm for the open-pit-mining operational planning problem.

    OpenAIRE

    Souza, Marcone Jamilson Freitas; Coelho, Igor Machado; Ribas, Sabir; Santos, Haroldo Gambini; Merschmann, Luiz Henrique de Campos

    2010-01-01

    This paper deals with the Open-Pit-Mining Operational Planning problem with dynamic truck allocation. The objective is to optimize mineral extraction in the mines by minimizing the number of mining trucks used to meet production goals and quality requirements. According to the literature, this problem is NPhard, so a heuristic strategy is justified. We present a hybrid algorithm that combines characteristics of two metaheuristics: Greedy Randomized Adaptive Search Procedures and General Varia...

  7. Heuristics structure and pervade formal risk assessment.

    Science.gov (United States)

    MacGillivray, Brian H

    2014-04-01

    Lay perceptions of risk appear rooted more in heuristics than in reason. A major concern of the risk regulation literature is that such "error-strewn" perceptions may be replicated in policy, as governments respond to the (mis)fears of the citizenry. This has led many to advocate a relatively technocratic approach to regulating risk, characterized by high reliance on formal risk and cost-benefit analysis. However, through two studies of chemicals regulation, we show that the formal assessment of risk is pervaded by its own set of heuristics. These include rules to categorize potential threats, define what constitutes valid data, guide causal inference, and to select and apply formal models. Some of these heuristics lay claim to theoretical or empirical justifications, others are more back-of-the-envelope calculations, while still more purport not to reflect some truth but simply to constrain discretion or perform a desk-clearing function. These heuristics can be understood as a way of authenticating or formalizing risk assessment as a scientific practice, representing a series of rules for bounding problems, collecting data, and interpreting evidence (a methodology). Heuristics are indispensable elements of induction. And so they are not problematic per se, but they can become so when treated as laws rather than as contingent and provisional rules. Pitfalls include the potential for systematic error, masking uncertainties, strategic manipulation, and entrenchment. Our central claim is that by studying the rules of risk assessment qua rules, we develop a novel representation of the methods, conventions, and biases of the prior art. © 2013 Society for Risk Analysis.

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

    Science.gov (United States)

    Krozel, James A.

    1988-01-01

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

  9. DESIGN OF A WEB SEMI-INTELLIGENT METADATA SEARCH MODEL APPLIED IN DATA WAREHOUSING SYSTEMS DISEÑO DE UN MODELO SEMIINTELIGENTE DE BÚSQUEDA DE METADATOS EN LA WEB, APLICADO A SISTEMAS DATA WAREHOUSING

    Directory of Open Access Journals (Sweden)

    Enrique Luna Ramírez

    2008-12-01

    Full Text Available In this paper, the design of a Web metadata search model with semi-intelligent features is proposed. The search model is oriented to retrieve the metadata associated to a data warehouse in a fast, flexible and reliable way. Our proposal includes a set of distinctive functionalities, which consist of the temporary storage of the frequently used metadata in an exclusive store, different to the global data warehouse metadata store, and of the use of control processes to retrieve information from both stores through aliases of concepts.En este artículo se propone el diseño de un modelo para la búsqueda Web de metadatos con características semiinteligentes. El modelo ha sido concebido para recuperar de manera rápida, flexible y fiable los metadatos asociados a un data warehouse corporativo. Nuestra propuesta incluye un conjunto de funcionalidades distintivas consistentes en el almacenamiento temporal de los metadatos de uso frecuente en un almacén exclusivo, diferente al almacén global de metadatos, y al uso de procesos de control para recuperar información de ambos almacenes a través de alias de conceptos.

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

    Science.gov (United States)

    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…

  11. Artificial Intelligence.

    Science.gov (United States)

    Wash, Darrel Patrick

    1989-01-01

    Making a machine seem intelligent is not easy. As a consequence, demand has been rising for computer professionals skilled in artificial intelligence and is likely to continue to go up. These workers develop expert systems and solve the mysteries of machine vision, natural language processing, and neural networks. (Editor)

  12. Intelligent Design

    DEFF Research Database (Denmark)

    Hjorth, Poul G.

    2005-01-01

    Forestillingen om at naturen er designet af en guddommelig 'intelligens' er et smukt filosofisk princip. Teorier om Intelligent Design som en naturvidenskabeligt baseret teori er derimod helt forfærdelig.......Forestillingen om at naturen er designet af en guddommelig 'intelligens' er et smukt filosofisk princip. Teorier om Intelligent Design som en naturvidenskabeligt baseret teori er derimod helt forfærdelig....

  13. Identifying product development crises: The potential of adaptive heuristics

    DEFF Research Database (Denmark)

    Münzberger, C.; Stingl, Verena; Oehmen, Josef

    2017-01-01

    This paper introduces adaptive heuristics as a tool to identify crises in design projects and highlights potential applications of these heuristics as decision support tool for crisis identification. Crises may emerge slowly or suddenly, and often have ambiguous signals. Thus the identification...... for the application of heuristics in design sciences. To achieve this, the paper compares crises to 'business as usual', and presents sixteen indicators for emerging crises. These indicators are potential cues for adaptive heuristics. Specifically three adaptive heuristics, One-single-cue, Fast-and-Frugal-Trees...

  14. Learning process mapping heuristics under stochastic sampling overheads

    Science.gov (United States)

    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.

  15. Project Scheduling Heuristics-Based Standard PSO for Task-Resource Assignment in Heterogeneous Grid

    Directory of Open Access Journals (Sweden)

    Ruey-Maw Chen

    2011-01-01

    Full Text Available The task scheduling problem has been widely studied for assigning resources to tasks in heterogeneous grid environment. Effective task scheduling is an important issue for the performance of grid computing. Meanwhile, the task scheduling problem is an NP-complete problem. Hence, this investigation introduces a named “standard“ particle swarm optimization (PSO metaheuristic approach to efficiently solve the task scheduling problems in grid. Meanwhile, two promising heuristics based on multimode project scheduling are proposed to help in solving interesting scheduling problems. They are the best performance resource heuristic and the latest finish time heuristic. These two heuristics applied to the PSO scheme are for speeding up the search of the particle and improving the capability of finding a sound schedule. Moreover, both global communication topology and local ring communication topology are also investigated for efficient study of proposed scheme. Simulation results demonstrate that the proposed approach in this investigation can successfully solve the task-resource assignment problems in grid computing and similar scheduling problems.

  16. Commercial Territory Design for a Distribution Firm with New Constructive and Destructive Heuristics

    Directory of Open Access Journals (Sweden)

    Jaime

    2012-02-01

    Full Text Available A commercial territory design problem with compactness maximization criterion subject to territory balancing and connectivity is addressed. Four new heuristics based on Greedy Randomized Adaptive Search Procedures within a location-allocation scheme for this NP-hard combinatorial optimization problem are proposed. The first three (named GRLH1, GRLH2, and GRDL build the territories simultaneously. Their construction phase consists of two parts: a location phase where territory seeds are identified, and an allocation phase where the remaining basic units are iteratively assigned to a territory. In contrast, the other heuristic (named SLA builds the territories one at a time. Empirical results reveals that GRLH1 and GRLH2 find near-optimal or optimal solutions to relatively small instances, where exact solutions could be found. The proposed procedures are relatively fast. We carried out a comparison between the proposed heuristic procedures and the existing method in larger instances. It was observed the proposed heuristic GRLH1 produced competitive results with respect to the existing approach.

  17. Assessing the use of cognitive heuristic representativeness in clinical reasoning.

    Science.gov (United States)

    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.

  18. Assessing Use of Cognitive Heuristic Representativeness in Clinical Reasoning

    Science.gov (United States)

    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

  19. Reconsidering "evidence" for fast-and-frugal heuristics.

    Science.gov (United States)

    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.

  20. Simple heuristics in over-the-counter drug choices: a new hint for medical education and practice.

    Science.gov (United States)

    Riva, Silvia; Monti, Marco; Antonietti, Alessandro

    2011-01-01

    Over-the-counter (OTC) drugs are widely available and often purchased by consumers without advice from a health care provider. Many people rely on self-management of medications to treat common medical conditions. Although OTC medications are regulated by the National and the International Health and Drug Administration, many people are unaware of proper dosing, side effects, adverse drug reactions, and possible medication interactions. This study examined how subjects make their decisions to select an OTC drug, evaluating the role of cognitive heuristics which are simple and adaptive rules that help the decision-making process of people in everyday contexts. By analyzing 70 subjects' information-search and decision-making behavior when selecting OTC drugs, we examined the heuristics they applied in order to assess whether simple decision-making processes were also accurate and relevant. Subjects were tested with a sequence of two experimental tests based on a computerized Java system devised to analyze participants' choices in a virtual environment. We found that subjects' information-search behavior reflected the use of fast and frugal heuristics. In addition, although the heuristics which correctly predicted subjects' decisions implied significantly fewer cues on average than the subjects did in the information-search task, they were accurate in describing order of information search. A simple combination of a fast and frugal tree and a tallying rule predicted more than 78% of subjects' decisions. The current emphasis in health care is to shift some responsibility onto the consumer through expansion of self medication. To know which cognitive mechanisms are behind the choice of OTC drugs is becoming a relevant purpose of current medical education. These findings have implications both for the validity of simple heuristics describing information searches in the field of OTC drug choices and for current medical education, which has to prepare competent health

  1. Simple heuristics in over-the-counter drug choices: a new hint for medical education and practice

    Science.gov (United States)

    Riva, Silvia; Monti, Marco; Antonietti, Alessandro

    2011-01-01

    Introduction Over-the-counter (OTC) drugs are widely available and often purchased by consumers without advice from a health care provider. Many people rely on self-management of medications to treat common medical conditions. Although OTC medications are regulated by the National and the International Health and Drug Administration, many people are unaware of proper dosing, side effects, adverse drug reactions, and possible medication interactions. Purpose This study examined how subjects make their decisions to select an OTC drug, evaluating the role of cognitive heuristics which are simple and adaptive rules that help the decision-making process of people in everyday contexts. Subjects and methods By analyzing 70 subjects’ information-search and decision-making behavior when selecting OTC drugs, we examined the heuristics they applied in order to assess whether simple decision-making processes were also accurate and relevant. Subjects were tested with a sequence of two experimental tests based on a computerized Java system devised to analyze participants’ choices in a virtual environment. Results We found that subjects’ information-search behavior reflected the use of fast and frugal heuristics. In addition, although the heuristics which correctly predicted subjects’ decisions implied significantly fewer cues on average than the subjects did in the information-search task, they were accurate in describing order of information search. A simple combination of a fast and frugal tree and a tallying rule predicted more than 78% of subjects’ decisions. Conclusion The current emphasis in health care is to shift some responsibility onto the consumer through expansion of self medication. To know which cognitive mechanisms are behind the choice of OTC drugs is becoming a relevant purpose of current medical education. These findings have implications both for the validity of simple heuristics describing information searches in the field of OTC drug choices and

  2. Heuristic learning parameter identification for surveillance and diagnostics of nuclear power plants

    International Nuclear Information System (INIS)

    Machado, E.L.

    1983-01-01

    A new method of heuristic reinforcement learning was developed for parameter identification purposes. In essence, this new parameter identification technique is based on the idea of breaking a multidimensional search for the minimum of a given functional into a set of unidirectional searches in parameter space. Each search situation is associated with one block in a memory organized into cells, where the information learned about the situations is stored (e.g. the optimal directions in parameter space). Whenever the search falls into an existing memory cell, the system chooses the learned direction. For new search situations, the system creates additional memory cells. This algorithm imitates the following cognitive process: 1) characterize a situation, 2) select an optimal action, 3) evaluate the consequences of the action, and 4) memorize the results for future use. As a result, this algorithm is trainable in the sense that it can learn from previous experience within a specific class of parameter identification problems

  3. Software Development for Auto-Generation of Interlocking Knowledge base using Artificial Intelligence Approach

    Energy Technology Data Exchange (ETDEWEB)

    Ko, Yun Seok [Nanseoul University (Korea); Kim, JOng Sun [Kwangwoon University (Korea)

    1999-06-01

    This paper proposes IIKBAG (Intelligent Interlocking Knowledge Base Generator) which can build automatically the interlocking knowledge base utilized as the real-time interlocking strategy of the electronic interlocking system in order to enhance it's reliability and expansion. The IIKBAG consists of the inference engine and the knowledge base. The former has an auto-learning function which searches all the train routes for the given station model based on heuristic search technique while dynamically searching the model, and then generates automatically the interlocking patterns obtained from the interlocking relations of signal facilities on the routes. The latter is designed as the structure which the real-time expert system embedded on IS (Interlocking System) can use directly in order to enhances the reliability and accuracy. The IIKBAG is implemented in C computer language for the purpose of the build and interface of the station structure database. And, a typical station model is simulated to prove the validity of the proposed IIKBAG. (author). 13 refs., 5 figs., 2 tabs.

  4. Heuristics and Cognitive Error in Medical Imaging.

    Science.gov (United States)

    Itri, Jason N; Patel, Sohil H

    2018-05-01

    The field of cognitive science has provided important insights into mental processes underlying the interpretation of imaging examinations. Despite these insights, diagnostic error remains a major obstacle in the goal to improve quality in radiology. In this article, we describe several types of cognitive bias that lead to diagnostic errors in imaging and discuss approaches to mitigate cognitive biases and diagnostic error. Radiologists rely on heuristic principles to reduce complex tasks of assessing probabilities and predicting values into simpler judgmental operations. These mental shortcuts allow rapid problem solving based on assumptions and past experiences. Heuristics used in the interpretation of imaging studies are generally helpful but can sometimes result in cognitive biases that lead to significant errors. An understanding of the causes of cognitive biases can lead to the development of educational content and systematic improvements that mitigate errors and improve the quality of care provided by radiologists.

  5. Heuristic program to design Relational Databases

    Directory of Open Access Journals (Sweden)

    Manuel Pereira Rosa

    2009-09-01

    Full Text Available The great development of today’s world determines that the world level of information increases day after day, however, the time allowed to transmit this information in the classrooms has not changed. Thus, the rational work in this respect is more than necessary. Besides, if for the solution of a given type of problem we do not have a working algorism, we have, first to look for a correct solution, then the heuristic programs are of paramount importance to succeed in these aspects. Having into consideration that the design of the database is, essentially, a process of problem resolution, this article aims at proposing a heuristic program for the design of the relating database.

  6. Heuristic Evaluation for Novice Programming Systems

    OpenAIRE

    Kölling, Michael; McKay, Fraser

    2016-01-01

    The past few years has seen a proliferation of novice programming tools. The availability of a large number of systems has made it difficult for many users to choose among them. Even for education researchers, comparing the relative quality of these tools, or judging their respective suitability for a given context, is hard in many instances. For designers of such systems, assessing the respective quality of competing design decisions can be equally difficult.\\ud Heuristic evaluation provides...

  7. Entrepreneurial Learning, Heuristics and Venture Creation

    OpenAIRE

    RAUF, MIAN SHAMS; ZAINULLAH, MOHAMMAD

    2009-01-01

    After rigorous criticism on trait approach and with the emergence of behavioral approach in entrepreneurship during 1980s, the researchers started to introduce learning and cognitive theories in entrepreneurship to describe and explain the dynamic nature of entrepreneurship. Many researchers have described venture creation as a core and the single most important element of entrepreneurship. This thesis will discuss and present the role of entrepreneurial learning and heuristics in venture cre...

  8. Intelligent playgrounds

    DEFF Research Database (Denmark)

    Larsen, Lasse Juel

    2009-01-01

    This paper examines play, gaming and learning in regard to intelligent playware developed for outdoor use. The key questions are how does these novel artefacts influence the concept of play, gaming and learning. Up until now play and game have been understood as different activities. This paper...... examines if the sharp differentiation between the two can be uphold in regard to intelligent playware for outdoor use. Play and game activities will be analysed and viewed in conjunction with learning contexts. This paper will stipulate that intelligent playware facilitates rapid shifts in contexts...

  9. Artificial intelligence

    CERN Document Server

    Ennals, J R

    1987-01-01

    Artificial Intelligence: State of the Art Report is a two-part report consisting of the invited papers and the analysis. The editor first gives an introduction to the invited papers before presenting each paper and the analysis, and then concludes with the list of references related to the study. The invited papers explore the various aspects of artificial intelligence. The analysis part assesses the major advances in artificial intelligence and provides a balanced analysis of the state of the art in this field. The Bibliography compiles the most important published material on the subject of

  10. Artificial Intelligence

    CERN Document Server

    Warwick, Kevin

    2011-01-01

    if AI is outside your field, or you know something of the subject and would like to know more then Artificial Intelligence: The Basics is a brilliant primer.' - Nick Smith, Engineering and Technology Magazine November 2011 Artificial Intelligence: The Basics is a concise and cutting-edge introduction to the fast moving world of AI. The author Kevin Warwick, a pioneer in the field, examines issues of what it means to be man or machine and looks at advances in robotics which have blurred the boundaries. Topics covered include: how intelligence can be defined whether machines can 'think' sensory

  11. Intelligent Decision Support and Big Data for Logistics and Supply Chain Management

    DEFF Research Database (Denmark)

    Voss, Stefan; Sebastian, Hans-Jürgen; Pahl, Julia

    2017-01-01

    Intelligent Decision Support and Big Data for Logistics and Supply Chain Management” features theoretical developments, real-world applications and information systems related to solving decision problems in logistics and supply chain management. Methods include optimization, heuristics, metaheur......Intelligent Decision Support and Big Data for Logistics and Supply Chain Management” features theoretical developments, real-world applications and information systems related to solving decision problems in logistics and supply chain management. Methods include optimization, heuristics......, metaheuristics and matheuristics, simulation, agent technologies, and descriptive methods. In a sense, we were and are representing the future of logistics over the years....

  12. The affect heuristic in occupational safety.

    Science.gov (United States)

    Savadori, Lucia; Caovilla, Jessica; Zaniboni, Sara; Fraccaroli, Franco

    2015-07-08

    The affect heuristic is a rule of thumb according to which, in the process of making a judgment or decision, people use affect as a cue. If a stimulus elicits positive affect then risks associated to that stimulus are viewed as low and benefits as high; conversely, if the stimulus elicits negative affect, then risks are perceived as high and benefits as low. The basic tenet of this study is that affect heuristic guides worker's judgment and decision making in a risk situation. The more the worker likes her/his organization the less she/he will perceive the risks as high. A sample of 115 employers and 65 employees working in small family agricultural businesses completed a questionnaire measuring perceived safety costs, psychological safety climate, affective commitment and safety compliance. A multi-sample structural analysis supported the thesis that safety compliance can be explained through an affect-based heuristic reasoning, but only for employers. Positive affective commitment towards their family business reduced employers' compliance with safety procedures by increasing the perceived cost of implementing them.

  13. A general heuristic for genome rearrangement problems.

    Science.gov (United States)

    Dias, Ulisses; Galvão, Gustavo Rodrigues; Lintzmayer, Carla Négri; Dias, Zanoni

    2014-06-01

    In this paper, we present a general heuristic for several problems in the genome rearrangement field. Our heuristic does not solve any problem directly, it is rather used to improve the solutions provided by any non-optimal algorithm that solve them. Therefore, we have implemented several algorithms described in the literature and several algorithms developed by ourselves. As a whole, we implemented 23 algorithms for 9 well known problems in the genome rearrangement field. A total of 13 algorithms were implemented for problems that use the notions of prefix and suffix operations. In addition, we worked on 5 algorithms for the classic problem of sorting by transposition and we conclude the experiments by presenting results for 3 approximation algorithms for the sorting by reversals and transpositions problem and 2 approximation algorithms for the sorting by reversals problem. Another algorithm with better approximation ratio can be found for the last genome rearrangement problem, but it is purely theoretical with no practical implementation. The algorithms we implemented in addition to our heuristic lead to the best practical results in each case. In particular, we were able to improve results on the sorting by transpositions problem, which is a very special case because many efforts have been made to generate algorithms with good results in practice and some of these algorithms provide results that equal the optimum solutions in many cases. Our source codes and benchmarks are freely available upon request from the authors so that it will be easier to compare new approaches against our results.

  14. When decision heuristics and science collide.

    Science.gov (United States)

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

    2014-04-01

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

  15. The recognition heuristic: A decade of research

    Directory of Open Access Journals (Sweden)

    Gerd Gigerenzer

    2011-02-01

    Full Text Available The recognition heuristic exploits the basic psychological capacity for recognition in order to make inferences about unknown quantities in the world. In this article, we review and clarify issues that emerged from our initial work (Goldstein and Gigerenzer, 1999, 2002, including the distinction between a recognition and an evaluation process. There is now considerable evidence that (i the recognition heuristic predicts the inferences of a substantial proportion of individuals consistently, even in the presence of one or more contradicting cues, (ii people are adaptive decision makers in that accordance increases with larger recognition validity and decreases in situations when the validity is low or wholly indeterminable, and (iii in the presence of contradicting cues, some individuals appear to select different strategies. Little is known about these individual differences, or how to precisely model the alternative strategies. Although some researchers have attributed judgments inconsistent with the use of the recognition heuristic to compensatory processing, little research on such compensatory models has been reported. We discuss extensions of the recognition model, open questions, unanticipated results, and the surprising predictive power of recognition in forecasting.

  16. Crowd-Sourced Intelligence Agency: Prototyping counterveillance

    Directory of Open Access Journals (Sweden)

    Jennifer Gradecki

    2017-02-01

    Full Text Available This paper discusses how an interactive artwork, the Crowd-Sourced Intelligence Agency (CSIA, can contribute to discussions of Big Data intelligence analytics. The CSIA is a publicly accessible Open Source Intelligence (OSINT system that was constructed using information gathered from technical manuals, research reports, academic papers, leaked documents, and Freedom of Information Act files. Using a visceral heuristic, the CSIA demonstrates how the statistical correlations made by automated classification systems are different from human judgment and can produce false-positives, as well as how the display of information through an interface can affect the judgment of an intelligence agent. The public has the right to ask questions about how a computer program determines if they are a threat to national security and to question the practicality of using statistical pattern recognition algorithms in place of human judgment. Currently, the public’s lack of access to both Big Data and the actual datasets intelligence agencies use to train their classification algorithms keeps the possibility of performing effective sous-dataveillance out of reach. Without this data, the results returned by the CSIA will not be identical to those of intelligence agencies. Because we have replicated how OSINT is processed, however, our results will resemble the type of results and mistakes made by OSINT systems. The CSIA takes some initial steps toward contributing to an informed public debate about large-scale monitoring of open source, social media data and provides a prototype for counterveillance and sousveillance tools for citizens.

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

    Science.gov (United States)

    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.

  18. Penjadwalan Produksi Garment Menggunakan Algoritma Heuristic Pour

    Directory of Open Access Journals (Sweden)

    Rizal Rachman

    2018-04-01

    Full Text Available Abstrak Penjadwalan merupakan suatu kegiatan pengalokasian sumber daya yang terbatas untuk mengerjakan sejumlah pekerjaan. Proses penjadwalan timbul jika terdapat keterbatasan sumber daya yang dimiliki, karena pada saat ini perusahaan menerapkan sistem penjadwalan manual dimana dengan penjadwalan tersebut masih terdapat beberapa produk yang terlewati sehingga menyebabkan keterlambatan dalam proses produksi, aturan ini sering tidak menguntungkan bagi order yang membutuhkan waktu proses pendek karena apabila order itu berada dibelakang antrian maka harus menunggu lama sebelum diproses dan menyebabkan waktu penyelesaian seluruh order menjadi panjang, sehingga diperlukan adanya pengaturan sumber-sumber daya yang ada secara efisien. Adapun dasar perhitungan Penjadwalan dengan menggunakan algoritma Heuristic Pour. Tahapan-tahapan penelitian terdiri dari pengumpulan data, perhitungan waktu standar, perhitungan total waktu proses berdasarkan job, penjadwalan dengan metode awal perusahaan, penjadwalan dengan metode Heuristik Pour. Berdasarkan hasil penjadwalan menggunakan Heuristik Pour diperoleh penghematan dibanding dengan metode perusahaan saat ini, sehingga dapat digunakan sebagai alternatif metode dalam melakukan penjadwalan pengerjaan proses produksi di perusahaan Garment tersebut. Kata kunci: Penjadwalan Produksi, Algoritma, Heuristic Pour. Abstract Scheduling is a limited resource allocation activity to do a number of jobs. The scheduling process arises if there are limited resources available, because at this time the company implement a manual scheduling system where the scheduling is still there are some products passed so as to cause delays in the production process, this rule is often not profitable for orders that require short processing time because if the order is behind the queue then it must wait a long time before it is processed and cause the completion time of all orders to be long, so it is necessary to regulate the existing

  19. Intelligent Advertising

    OpenAIRE

    Díaz Pinedo, Edilfredo Eliot

    2012-01-01

    Intelligent Advertisement diseña e implementa un sistema de publicidad para dispositivos móviles en un centro comercial, donde los clientes reciben publicidad de forma pasiva en sus dispositivos mientras están dentro.

  20. Hydro-Thermal-Wind Generation Scheduling Considering Economic and Environmental Factors Using Heuristic Algorithms

    Directory of Open Access Journals (Sweden)

    Suresh K. Damodaran

    2018-02-01

    Full Text Available Hydro-thermal-wind generation scheduling (HTWGS with economic and environmental factors is a multi-objective complex nonlinear power system optimization problem with many equality and inequality constraints. The objective of the problem is to generate an hour-by-hour optimum schedule of hydro-thermal-wind power plants to attain the least emission of pollutants from thermal plants and a reduced generation cost of thermal and wind plants for a 24-h period, satisfying the system constraints. The paper presents a detailed framework of the HTWGS problem and proposes a modified particle swarm optimization (MPSO algorithm for evolving a solution. The competency of selected heuristic algorithms, representing different heuristic groups, viz. the binary coded genetic algorithm (BCGA, particle swarm optimization (PSO, improved harmony search (IHS, and JAYA algorithm, for searching for an optimal solution to HTWGS considering economic and environmental factors was investigated in a trial system consisting of a multi-stream cascaded system with four reservoirs, three thermal plants, and two wind plants. Appropriate mathematical models were used for representing the water discharge, generation cost, and pollutant emission of respective power plants incorporated in the system. Statistical analysis was performed to check the consistency and reliability of the proposed algorithm. The simulation results indicated that the proposed MPSO algorithm provided a better solution to the problem of HTWGS, with a reduced generation cost and the least emission, when compared with the other heuristic algorithms considered.

  1. Need for closure and heuristic information processing: the moderating role of the ability to achieve the need for closure.

    Science.gov (United States)

    Kossowska, Małgorzata; Bar-Tal, Yoram

    2013-11-01

    In contrast to the ample research that shows a positive relationship between the need for closure (NFC) and heuristic information processing, this research examines the hypothesis that this relationship is moderated by the ability to achieve closure (AAC), that is, the ability to use information-processing strategies consistent with the level of NFC. Three different operationalizations of heuristic information processing were used: recall of information consistent with the impression (Study 1); pre-decisional information search (Study 2); and stereotypic impression formation (Study 3). The results of the studies showed that there were positive relationships between NFC and heuristic information processing when participants assessed themselves as being able to use cognitive strategies consistent with their level of NFC (high AAC). For individuals with low AAC, the relationships were negative. Our data show that motivation-cognition interactions influence the information-processing style. © 2012 The British Psychological Society.

  2. BUSINESS INTELLIGENCE

    OpenAIRE

    Bogdan Mohor Dumitrita

    2011-01-01

    The purpose of this work is to present business intelligence systems. These systems can be extremely complex and important in modern market competition. Its effectiveness also reflects in price, so we have to exlore their financial potential before investment. The systems have 20 years long history and during that time many of such tools have been developed, but they are rarely still in use. Business intelligence system consists of three main areas: Data Warehouse, ETL tools and tools f...

  3. Intelligent indexing

    International Nuclear Information System (INIS)

    Farkas, J.

    1992-01-01

    In this paper we discuss the relevance of artificial intelligence to the automatic indexing of natural language text. We describe the use of domain-specific semantically-based thesauruses and address the problem of creating adequate knowledge bases for intelligent indexing systems. We also discuss the relevance of the Hilbert space ι 2 to the compact representation of documents and to the definition of the similarity of natural language texts. (author). 17 refs., 2 figs

  4. Intelligent indexing

    Energy Technology Data Exchange (ETDEWEB)

    Farkas, J

    1993-12-31

    In this paper we discuss the relevance of artificial intelligence to the automatic indexing of natural language text. We describe the use of domain-specific semantically-based thesauruses and address the problem of creating adequate knowledge bases for intelligent indexing systems. We also discuss the relevance of the Hilbert space {iota}{sup 2} to the compact representation of documents and to the definition of the similarity of natural language texts. (author). 17 refs., 2 figs.

  5. Budget constraints and optimization in sponsored search auctions

    CERN Document Server

    Yang, Yanwu

    2013-01-01

    The Intelligent Systems Series publishes reference works and handbooks in three core sub-topic areas: Intelligent Automation, Intelligent Transportation Systems, and Intelligent Computing. They include theoretical studies, design methods, and real-world implementations and applications. The series' readership is broad, but focuses on engineering, electronics, and computer science. Budget constraints and optimization in sponsored search auctions takes into account consideration of the entire life cycle of campaigns for researchers and developers working on search systems and ROI maximization

  6. Artificial Intelligence: Applications in Education.

    Science.gov (United States)

    Thorkildsen, Ron J.; And Others

    1986-01-01

    Artificial intelligence techniques are used in computer programs to search out rapidly and retrieve information from very large databases. Programing advances have also led to the development of systems that provide expert consultation (expert systems). These systems, as applied to education, are the primary emphasis of this article. (LMO)

  7. Ambient intelligence : visualising the future

    NARCIS (Netherlands)

    Aarts, E.H.L.

    2005-01-01

    Ambient Intelligence systems are aimed at making user-system interaction and content consumption a truly positive experience. The endless search for nifty information visualisation mechanism to squeeze yet one more piece of information onto a visual display is surpassed by the challenge to embed

  8. A Novel Approach for Bi-Level Segmentation of Tuberculosis Bacilli Based on Meta-Heuristic Algorithms

    Directory of Open Access Journals (Sweden)

    AYAS, S.

    2018-02-01

    Full Text Available Image thresholding is the most crucial step in microscopic image analysis to distinguish bacilli objects causing of tuberculosis disease. Therefore, several bi-level thresholding algorithms are widely used to increase the bacilli segmentation accuracy. However, bi-level microscopic image thresholding problem has not been solved using optimization algorithms. This paper introduces a novel approach for the segmentation problem using heuristic algorithms and presents visual and quantitative comparisons of heuristic and state-of-art thresholding algorithms. In this study, well-known heuristic algorithms such as Firefly Algorithm, Particle Swarm Optimization, Cuckoo Search, Flower Pollination are used to solve bi-level microscopic image thresholding problem, and the results are compared with the state-of-art thresholding algorithms such as K-Means, Fuzzy C-Means, Fast Marching. Kapur's entropy is chosen as the entropy measure to be maximized. Experiments are performed to make comparisons in terms of evaluation metrics and execution time. The quantitative results are calculated based on ground truth segmentation. According to the visual results, heuristic algorithms have better performance and the quantitative results are in accord with the visual results. Furthermore, experimental time comparisons show the superiority and effectiveness of the heuristic algorithms over traditional thresholding algorithms.

  9. Optimization of Charge/Discharge Coordination to Satisfy Network Requirements Using Heuristic Algorithms in Vehicle-to-Grid Concept

    Directory of Open Access Journals (Sweden)

    DOGAN, A.

    2018-02-01

    Full Text Available Image thresholding is the most crucial step in microscopic image analysis to distinguish bacilli objects causing of tuberculosis disease. Therefore, several bi-level thresholding algorithms are widely used to increase the bacilli segmentation accuracy. However, bi-level microscopic image thresholding problem has not been solved using optimization algorithms. This paper introduces a novel approach for the segmentation problem using heuristic algorithms and presents visual and quantitative comparisons of heuristic and state-of-art thresholding algorithms. In this study, well-known heuristic algorithms such as Firefly Algorithm, Particle Swarm Optimization, Cuckoo Search, Flower Pollination are used to solve bi-level microscopic image thresholding problem, and the results are compared with the state-of-art thresholding algorithms such as K-Means, Fuzzy C-Means, Fast Marching. Kapur's entropy is chosen as the entropy measure to be maximized. Experiments are performed to make comparisons in terms of evaluation metrics and execution time. The quantitative results are calculated based on ground truth segmentation. According to the visual results, heuristic algorithms have better performance and the quantitative results are in accord with the visual results. Furthermore, experimental time comparisons show the superiority and effectiveness of the heuristic algorithms over traditional thresholding algorithms.

  10. An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics

    Science.gov (United States)

    Baluja, Shumeet

    1995-01-01

    This report is a repository of the results obtained from a large scale empirical comparison of seven iterative and evolution-based optimization heuristics. Twenty-seven static optimization problems, spanning six sets of problem classes which are commonly explored in genetic algorithm literature, are examined. The problem sets include job-shop scheduling, traveling salesman, knapsack, binpacking, neural network weight optimization, and standard numerical optimization. The search spaces in these problems range from 2368 to 22040. The results indicate that using genetic algorithms for the optimization of static functions does not yield a benefit, in terms of the final answer obtained, over simpler optimization heuristics. Descriptions of the algorithms tested and the encodings of the problems are described in detail for reproducibility.

  11. An ordering heuristic for building Binary Decision Diagrams for fault-trees

    Energy Technology Data Exchange (ETDEWEB)

    Bouissou, M. [Electricite de France (EDF), 75 - Paris (France)

    1997-12-31

    Binary Decision Diagrams (BDD) have recently made a noticeable entry in the RAMS field. This kind of representation for boolean functions makes possible the assessment of complex fault-trees, both qualitatively (minimal cut-sets search) and quantitatively (exact calculation of top event probability). The object of the paper is to present a pre-processing of the fault-tree which ensures that the results given by different heuristics on the `optimized` fault-tree are not too sensitive to the way the tree is written. This property is based on a theoretical proof. In contrast with some well known heuristics, the method proposed is not based only on intuition and practical experiments. (author) 12 refs.

  12. An ordering heuristic for building Binary Decision Diagrams for fault-trees

    International Nuclear Information System (INIS)

    Bouissou, M.

    1997-01-01

    Binary Decision Diagrams (BDD) have recently made a noticeable entry in the RAMS field. This kind of representation for boolean functions makes possible the assessment of complex fault-trees, both qualitatively (minimal cut-sets search) and quantitatively (exact calculation of top event probability). The object of the paper is to present a pre-processing of the fault-tree which ensures that the results given by different heuristics on the 'optimized' fault-tree are not too sensitive to the way the tree is written. This property is based on a theoretical proof. In contrast with some well known heuristics, the method proposed is not based only on intuition and practical experiments. (author)

  13. Cultural heuristics in risk assessment of HIV/AIDS.

    Science.gov (United States)

    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.

  14. Parameter estimation with bio-inspired meta-heuristic optimization: modeling the dynamics of endocytosis

    Directory of Open Access Journals (Sweden)

    Tashkova Katerina

    2011-10-01

    Full Text Available Abstract Background We address the task of parameter estimation in models of the dynamics of biological systems based on ordinary differential equations (ODEs from measured data, where the models are typically non-linear and have many parameters, the measurements are imperfect due to noise, and the studied system can often be only partially observed. A representative task is to estimate the parameters in a model of the dynamics of endocytosis, i.e., endosome maturation, reflected in a cut-out switch transition between the Rab5 and Rab7 domain protein concentrations, from experimental measurements of these concentrations. The general parameter estimation task and the specific instance considered here are challenging optimization problems, calling for the use of advanced meta-heuristic optimization methods, such as evolutionary or swarm-based methods. Results We apply three global-search meta-heuristic algorithms for numerical optimization, i.e., differential ant-stigmergy algorithm (DASA, particle-swarm optimization (PSO, and differential evolution (DE, as well as a local-search derivative-based algorithm 717 (A717 to the task of estimating parameters in ODEs. We evaluate their performance on the considered representative task along a number of metrics, including the quality of reconstructing the system output and the complete dynamics, as well as the speed of convergence, both on real-experimental data and on artificial pseudo-experimental data with varying amounts of noise. We compare the four optimization methods under a range of observation scenarios, where data of different completeness and accuracy of interpretation are given as input. Conclusions Overall, the global meta-heuristic methods (DASA, PSO, and DE clearly and significantly outperform the local derivative-based method (A717. Among the three meta-heuristics, differential evolution (DE performs best in terms of the objective function, i.e., reconstructing the output, and in terms of

  15. Parameter estimation with bio-inspired meta-heuristic optimization: modeling the dynamics of endocytosis.

    Science.gov (United States)

    Tashkova, Katerina; Korošec, Peter; Silc, Jurij; Todorovski, Ljupčo; Džeroski, Sašo

    2011-10-11

    We address the task of parameter estimation in models of the dynamics of biological systems based on ordinary differential equations (ODEs) from measured data, where the models are typically non-linear and have many parameters, the measurements are imperfect due to noise, and the studied system can often be only partially observed. A representative task is to estimate the parameters in a model of the dynamics of endocytosis, i.e., endosome maturation, reflected in a cut-out switch transition between the Rab5 and Rab7 domain protein concentrations, from experimental measurements of these concentrations. The general parameter estimation task and the specific instance considered here are challenging optimization problems, calling for the use of advanced meta-heuristic optimization methods, such as evolutionary or swarm-based methods. We apply three global-search meta-heuristic algorithms for numerical optimization, i.e., differential ant-stigmergy algorithm (DASA), particle-swarm optimization (PSO), and differential evolution (DE), as well as a local-search derivative-based algorithm 717 (A717) to the task of estimating parameters in ODEs. We evaluate their performance on the considered representative task along a number of metrics, including the quality of reconstructing the system output and the complete dynamics, as well as the speed of convergence, both on real-experimental data and on artificial pseudo-experimental data with varying amounts of noise. We compare the four optimization methods under a range of observation scenarios, where data of different completeness and accuracy of interpretation are given as input. Overall, the global meta-heuristic methods (DASA, PSO, and DE) clearly and significantly outperform the local derivative-based method (A717). Among the three meta-heuristics, differential evolution (DE) performs best in terms of the objective function, i.e., reconstructing the output, and in terms of convergence. These results hold for both real and

  16. Development of a user-friendly interface for the searching of a data base in natural language while using concepts and means of artificial intelligence

    International Nuclear Information System (INIS)

    Pujo, Pascal

    1989-01-01

    This research thesis aimed at the development of a natural-language-based user-friendly interface for the searching of relational data bases. The author first addresses how to store data which will be accessible through an interface in natural language: this organisation must result in as few constraints as possible in query formulation. He briefly presents techniques related to the automatic processing of natural language, and highlights the need for a more user-friendly interface. Then, he presents the developed interface and outlines the user-friendliness and ergonomics of implemented procedures. He shows how the interface has been designed to deliver information and explanations on its processing. This allows the user to control the relevance of the answer. He also indicates the classification of mistakes and errors which may be present in queries in natural language. He finally gives an overview of possible evolutions of the interface, briefly presents deductive functionalities which could expand data management. The handling of complex objects is also addressed [fr

  17. Identifying Onboarding Heuristics for Free-to-Play Mobile Games

    DEFF Research Database (Denmark)

    Thomsen, Line Ebdrup; Weigert Petersen, Falko; Drachen, Anders

    2016-01-01

    a set of heuristics for the design of onboarding phases in mobile games is presented. The heuristics are identified by a lab-based mixed-methods experiment, utilizing lightweight psycho-physiological measures together with self-reported player responses, across three titles that cross the genres...... of puzzle games, base builders and arcade games, and utilize different onboarding phase design approaches. Results showcase how heuristics can be used to design engaging onboarding phases in mobile games....

  18. The recognition heuristic : A review of theory and tests

    OpenAIRE

    Pachur, T.; Todd, P.; Gigerenzer, G.; Schooler, L.; Goldstein, D.

    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) th...

  19. Proposing New Heuristic Approaches for Preventive Maintenance Scheduling

    Directory of Open Access Journals (Sweden)

    majid Esmailian

    2013-08-01

    Full Text Available The purpose of preventive maintenance management is to perform a series of tasks that prevent or minimize production breakdowns and improve reliability of production facilities. An important objective of preventive maintenance management is to minimize downtime of production facilities. In order to accomplish this objective, personnel should efficiently allocate resources and determine an effective maintenance schedule. Gopalakrishnan (1997 developed a mathematical model and four heuristic approaches to solve the preventive maintenance scheduling problem of assigning skilled personnel to work with tasks that require a set of corresponding skills. However, there are several limitations in the prior work in this area of research. The craft combination problem has not been solved because the craft combination is assumed as given. The craft combination problem concerns the computation of all combinations of assigning multi skilled workers to accomplishment of a particular task. In fact, determining craft combinations is difficult because of the exponential number of craft combinations that are possible. This research provides a heuristic approach for determining the craft combination and four new heuristic approach solution for the preventive maintenance scheduling problem with multi skilled workforce constraints. In order to examine the new heuristic approach and to compare the new heuristic approach with heuristic approach of Gopalakrishnan (1997, 81 standard problems have been generated based on the criterion suggested by from Gopalakrishnan (1997. The average solution quality (SQ of the new heuristic approaches is 1.86% and in old heuristic approaches is 8.32%. The solution time of new heuristic approaches are shorter than old heuristic approaches. The solution time of new heuristic approaches is 0.78 second and old heuristic approaches is 6.43 second, but the solution time of mathematical model provided by Gopalakrishnan (1997 is 152 second.

  20. A heuristic evaluation of the Facebook's advertising tool beacon

    OpenAIRE

    Jamal, A; Cole, M

    2009-01-01

    Interface usability is critical to the successful adoption of information systems. The aim of this study is to evaluate interface of Facebook's advertising tool Beacon by using privacy heuristics [4]. Beacon represents an interesting case study because of the negative media and user backlash it received. The findings of heuristic evaluation suggest violation of privacy heuristics [4]. Here, analysis identified concerns about user choice and consent, integrity and security of data, and awarene...

  1. Interliminal Design: Understanding cognitive heuristics to mitigate design distortion

    OpenAIRE

    Andrew McCollough; DeAunne Denmark; Donald Harker

    2014-01-01

    Cognitive heuristics are mental shortcuts adapted over time to enable rapid interpretation of our complex environment. They are intrinsic to human cognition and resist modification. Heuristics applied outside the context to which they are best suited are termed cognitive bias, and are the cause of systematic errors in judgment and reasoning. As both a cognitive and intuitive discipline, design by individuals is vulnerable to context-inappropriate heuristic usage. Designing in groups can act p...

  2. Hybridisations of Variable Neighbourhood Search and Modified Simplex Elements to Harmony Search and Shuffled Frog Leaping Algorithms for Process Optimisations

    Science.gov (United States)

    Aungkulanon, P.; Luangpaiboon, P.

    2010-10-01

    Nowadays, the engineering problem systems are large and complicated. An effective finite sequence of instructions for solving these problems can be categorised into optimisation and meta-heuristic algorithms. Though the best decision variable levels from some sets of available alternatives cannot be done, meta-heuristics is an alternative for experience-based techniques that rapidly help in problem solving, learning and discovery in the hope of obtaining a more efficient or more robust procedure. All meta-heuristics provide auxiliary procedures in terms of their own tooled box functions. It has been shown that the effectiveness of all meta-heuristics depends almost exclusively on these auxiliary functions. In fact, the auxiliary procedure from one can be implemented into other meta-heuristics. Well-known meta-heuristics of harmony search (HSA) and shuffled frog-leaping algorithms (SFLA) are compared with their hybridisations. HSA is used to produce a near optimal solution under a consideration of the perfect state of harmony of the improvisation process of musicians. A meta-heuristic of the SFLA, based on a population, is a cooperative search metaphor inspired by natural memetics. It includes elements of local search and global information exchange. This study presents solution procedures via constrained and unconstrained problems with different natures of single and multi peak surfaces including a curved ridge surface. Both meta-heuristics are modified via variable neighbourhood search method (VNSM) philosophy including a modified simplex method (MSM). The basic idea is the change of neighbourhoods during searching for a better solution. The hybridisations proceed by a descent method to a local minimum exploring then, systematically or at random, increasingly distant neighbourhoods of this local solution. The results show that the variant of HSA with VNSM and MSM seems to be better in terms of the mean and variance of design points and yields.

  3. Heuristic Portfolio Trading Rules with Capital Gain Taxes

    DEFF Research Database (Denmark)

    Fischer, Marcel; Gallmeyer, Michael

    in some cases. Overlaying simple tax trading heuristics on these trading strategies improves out-of-sample performance. In particular, the 1/N trading strategy's welfare gains improve when a variety of tax trading heuristics are also imposed. For medium to large transaction costs, no trading strategy can...... outperform a 1/N trading strategy augmented with a tax heuristic, not even the most tax- and transaction-cost efficient buy-and-hold strategy. Overall, the best strategy is 1/N augmented with a heuristic that allows for a fixed deviation in absolute portfolio weights. Our results show that the best trading...

  4. Research and applications: Artificial intelligence

    Science.gov (United States)

    Raphael, B.; Fikes, R. E.; Chaitin, L. J.; Hart, P. E.; Duda, R. O.; Nilsson, N. J.

    1971-01-01

    A program of research in the field of artificial intelligence is presented. The research areas discussed include automatic theorem proving, representations of real-world environments, problem-solving methods, the design of a programming system for problem-solving research, techniques for general scene analysis based upon television data, and the problems of assembling an integrated robot system. Major accomplishments include the development of a new problem-solving system that uses both formal logical inference and informal heuristic methods, the development of a method of automatic learning by generalization, and the design of the overall structure of a new complete robot system. Eight appendices to the report contain extensive technical details of the work described.

  5. Machine intelligence and signal processing

    CERN Document Server

    Vatsa, Mayank; Majumdar, Angshul; Kumar, Ajay

    2016-01-01

    This book comprises chapters on key problems in machine learning and signal processing arenas. The contents of the book are a result of a 2014 Workshop on Machine Intelligence and Signal Processing held at the Indraprastha Institute of Information Technology. Traditionally, signal processing and machine learning were considered to be separate areas of research. However in recent times the two communities are getting closer. In a very abstract fashion, signal processing is the study of operator design. The contributions of signal processing had been to device operators for restoration, compression, etc. Applied Mathematicians were more interested in operator analysis. Nowadays signal processing research is gravitating towards operator learning – instead of designing operators based on heuristics (for example wavelets), the trend is to learn these operators (for example dictionary learning). And thus, the gap between signal processing and machine learning is fast converging. The 2014 Workshop on Machine Intel...

  6. Advances in heuristic signal processing and applications

    CERN Document Server

    Chatterjee, Amitava; Siarry, Patrick

    2013-01-01

    There have been significant developments in the design and application of algorithms for both one-dimensional signal processing and multidimensional signal processing, namely image and video processing, with the recent focus changing from a step-by-step procedure of designing the algorithm first and following up with in-depth analysis and performance improvement to instead applying heuristic-based methods to solve signal-processing problems. In this book the contributing authors demonstrate both general-purpose algorithms and those aimed at solving specialized application problems, with a spec

  7. Further heuristics for $k$-means: The merge-and-split heuristic and the $(k,l)$-means

    OpenAIRE

    Nielsen, Frank; Nock, Richard

    2014-01-01

    Finding the optimal $k$-means clustering is NP-hard in general and many heuristics have been designed for minimizing monotonically the $k$-means objective. We first show how to extend Lloyd's batched relocation heuristic and Hartigan's single-point relocation heuristic to take into account empty-cluster and single-point cluster events, respectively. Those events tend to increasingly occur when $k$ or $d$ increases, or when performing several restarts. First, we show that those special events ...

  8. Tabu search for target-radar assignment

    DEFF Research Database (Denmark)

    Hindsberger, Magnus; Vidal, Rene Victor Valqui

    2000-01-01

    In the paper the problem of assigning air-defense illumination radars to enemy targets is presented. A tabu search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches, implementation and experimental aspects are discussed. It is argued ...

  9. Applications of artificial intelligence V; Proceedings of the Meeting, Orlando, FL, May 18-20, 1987

    Science.gov (United States)

    Gilmore, John F. (Editor)

    1987-01-01

    The papers contained in this volume focus on current trends in applications of artificial intelligence. Topics discussed include expert systems, image understanding, artificial intelligence tools, knowledge-based systems, heuristic systems, manufacturing applications, and image analysis. Papers are presented on expert system issues in automated, autonomous space vehicle rendezvous; traditional versus rule-based programming techniques; applications to the control of optional flight information; methodology for evaluating knowledge-based systems; and real-time advisory system for airborne early warning.

  10. Humans, Intelligent Technology, and Their Interface: A Study of Brown’s Point

    Science.gov (United States)

    2017-12-01

    INTELLIGENT TECHNOLOGY , AND THEIR INTERFACE: A STUDY OF BROWN’S POINT by Jackie L. J. White December 2017 Thesis Advisor: Carolyn Halladay...REPORT TYPE AND DATES COVERED Master’s thesis 4. TITLE AND SUBTITLE HUMANS, INTELLIGENT TECHNOLOGY , AND THEIR INTERFACE: A STUDY OF BROWN’S POINT...with the technology before and during the accident. I combined the findings from the accident investigation with various heuristics regarding the human

  11. Intelligent systems

    CERN Document Server

    Irwin, J David

    2011-01-01

    Technology has now progressed to the point that intelligent systems are replacing humans in the decision making processes as well as aiding in the solution of very complex problems. In many cases intelligent systems are already outperforming human activities. Artificial neural networks are not only capable of learning how to classify patterns, such images or sequence of events, but they can also effectively model complex nonlinear systems. Their ability to classify sequences of events is probably more popular in industrial applications where there is an inherent need to model nonlinear system

  12. Intelligent Universe

    Energy Technology Data Exchange (ETDEWEB)

    Hoyle, F

    1983-01-01

    The subject is covered in chapters, entitled: chance and the universe (synthesis of proteins; the primordial soup); the gospel according to Darwin (discussion of Darwin theory of evolution); life did not originate on earth (fossils from space; life in space); the interstellar connection (living dust between the stars; bacteria in space falling to the earth; interplanetary dust); evolution by cosmic control (microorganisms; genetics); why aren't the others here (a cosmic origin of life); after the big bang (big bang and steady state); the information rich universe; what is intelligence up to; the intelligent universe.

  13. Artificial intelligence

    International Nuclear Information System (INIS)

    Perret-Galix, D.

    1992-01-01

    A vivid example of the growing need for frontier physics experiments to make use of frontier technology is in the field of artificial intelligence and related themes. This was reflected in the second international workshop on 'Software Engineering, Artificial Intelligence and Expert Systems in High Energy and Nuclear Physics' which took place from 13-18 January at France Telecom's Agelonde site at La Londe des Maures, Provence. It was the second in a series, the first having been held at Lyon in 1990

  14. Intelligence Is What the Intelligence Test Measures. Seriously

    Directory of Open Access Journals (Sweden)

    Han L. J. van der Maas

    2014-02-01

    Full Text Available The mutualism model, an alternative for the g-factor model of intelligence, implies a formative measurement model in which “g” is an index variable without a causal role. If this model is accurate, the search for a genetic of brain instantiation of “g” is deemed useless. This also implies that the (weighted sum score of items of an intelligence test is just what it is: a weighted sum score. Preference for one index above the other is a pragmatic issue that rests mainly on predictive value.

  15. Combined Heuristic Attack Strategy on Complex Networks

    Directory of Open Access Journals (Sweden)

    Marek Šimon

    2017-01-01

    Full Text Available Usually, the existence of a complex network is considered an advantage feature and efforts are made to increase its robustness against an attack. However, there exist also harmful and/or malicious networks, from social ones like spreading hoax, corruption, phishing, extremist ideology, and terrorist support up to computer networks spreading computer viruses or DDoS attack software or even biological networks of carriers or transport centers spreading disease among the population. New attack strategy can be therefore used against malicious networks, as well as in a worst-case scenario test for robustness of a useful network. A common measure of robustness of networks is their disintegration level after removal of a fraction of nodes. This robustness can be calculated as a ratio of the number of nodes of the greatest remaining network component against the number of nodes in the original network. Our paper presents a combination of heuristics optimized for an attack on a complex network to achieve its greatest disintegration. Nodes are deleted sequentially based on a heuristic criterion. Efficiency of classical attack approaches is compared to the proposed approach on Barabási-Albert, scale-free with tunable power-law exponent, and Erdős-Rényi models of complex networks and on real-world networks. Our attack strategy results in a faster disintegration, which is counterbalanced by its slightly increased computational demands.

  16. Advances in heuristically based generalized perturbation theory

    International Nuclear Information System (INIS)

    Gandini, A.

    1994-01-01

    A distinctive feature of heuristically based generalized perturbation theory methodology consists in the systematic use of importance conservation concepts. As well known, this use leads to fundamental reciprocity relationship. Instead, the alternative variational and differential one approaches make a consistent use of the properties and adjoint functions. The equivalence between the importance and the adjoint functions have been demonstrated in important cases. There are some instances, however, in which the commonly known operator governing the adjoint function are not adequate. In this paper ways proposed to generalize this rules, as adopted with the heuristic generalized perturbation theory methodology, are illustrated. When applied to the neutron/nuclide field characterizing the core evolution in a power reactor system, in which also an intensive control variable (ρ) is defined, these rules leas to an orthogonality relationship connected to this same control variable. A set of ρ-mode eigenfunctions may be correspondingly defined and an extended concept of reactivity (generalizing that commonly associated with the multiplication factor) proposed as more directly indicative of the controllability of a critical reactor system. (author). 25 refs

  17. Intelligent mobile robots

    International Nuclear Information System (INIS)

    Ichikawa, Yoshiaki; Senoo, Makoto

    1984-01-01

    For the purpose of the application to remote working apparatuses in nuclear power plants and others, the software and moving mechanism of mobile robots that automatically accomplish the movement by only specifying the destination were manufactured for trial. The software has the function of searching a path to determine the quasi-shortest path and the function of controlling execution to control the action of the robots and guide to the destination. By taking heuristics into the method of searching a path and utilizing ultrasonic waves for the function of sight as they can easily detect distance though the information quantity is small, the execution was accelerated. By the simulation examination and the experiment using a mobile apparatus made for trial, it was confirmed that the route plan was able to be made almost in real time, and the appearance of an unknown obstacle was detected before collision and able to be reasonably avoided by the revision of the plan. An environment model, a route planner, the program for controlling execution, the makeup and control of moving function and the experiment on the movement are reported. The shortening of the processing time by dealing with unconfirmed echo and simplifying the writing in a map is a future problem. (Kako, I.)

  18. A Slicing Tree Representation and QCP-Model-Based Heuristic Algorithm for the Unequal-Area Block Facility Layout Problem

    Directory of Open Access Journals (Sweden)

    Mei-Shiang Chang

    2013-01-01

    Full Text Available The facility layout problem is a typical combinational optimization problem. In this research, a slicing tree representation and a quadratically constrained program model are combined with harmony search to develop a heuristic method for solving the unequal-area block layout problem. Because of characteristics of slicing tree structure, we propose a regional structure of harmony memory to memorize facility layout solutions and two kinds of harmony improvisation to enhance global search ability of the proposed heuristic method. The proposed harmony search based heuristic is tested on 10 well-known unequal-area facility layout problems from the literature. The results are compared with the previously best-known solutions obtained by genetic algorithm, tabu search, and ant system as well as exact methods. For problems O7, O9, vC10Ra, M11*, and Nug12, new best solutions are found. For other problems, the proposed approach can find solutions that are very similar to previous best-known solutions.

  19. Artificial intelligence application to diagnosis and supervision of nuclear power plants

    International Nuclear Information System (INIS)

    Corvalan, P.J.

    1991-06-01

    A diagnostic expert system was developed, in the Process Control Division at the Centro Atomico Bariloche, for the Embalse nuclear power plant simulator. The diagnostic system task is to interpret and show the probable cause of an abnormal transitory behaviour in the simulated process. The system was developed using artificial intelligence techniques such as: knowledge representation using rules, heuristic programming, inference under uncertainty and fuzzy sets. The diagnostic technique used consists of finding the possible cause of failure using the fault hypothesis confirmation. The faults hypothesis are organized in hierarchical form into a tree structure. The Best First search strategy is used to direct the search to those hypothesis which are confirmed with a higher degree of certainty. The diagnostic is finished when a specific hypothesis is confirmed with a high certainty factor. The diagnostic result obtained by different process fault simulation is shown. An alternative diagnostic technique is presented where the knowlegde of process structure and behaviour are represented in the form of mathematical constraints. This diagnostic method detects a suspicious component through constraints satisfaction and localizes it through constraints suspension. The validity of the method is shown by an easy example. (Author) [es

  20. Identification of time-varying structural dynamic systems - An artificial intelligence approach

    Science.gov (United States)

    Glass, B. J.; Hanagud, S.

    1992-01-01

    An application of the artificial intelligence-derived methodologies of heuristic search and object-oriented programming to the problem of identifying the form of the model and the associated parameters of a time-varying structural dynamic system is presented in this paper. Possible model variations due to changes in boundary conditions or configurations of a structure are organized into a taxonomy of models, and a variant of best-first search is used to identify the model whose simulated response best matches that of the current physical structure. Simulated model responses are verified experimentally. An output-error approach is used in a discontinuous model space, and an equation-error approach is used in the parameter space. The advantages of the AI methods used, compared with conventional programming techniques for implementing knowledge structuring and inheritance, are discussed. Convergence conditions and example problems have been discussed. In the example problem, both the time-varying model and its new parameters have been identified when changes occur.

  1. Generalised Adaptive Harmony Search: A Comparative Analysis of Modern Harmony Search

    Directory of Open Access Journals (Sweden)

    Jaco Fourie

    2013-01-01

    Full Text Available Harmony search (HS was introduced in 2001 as a heuristic population-based optimisation algorithm. Since then HS has become a popular alternative to other heuristic algorithms like simulated annealing and particle swarm optimisation. However, some flaws, like the need for parameter tuning, were identified and have been a topic of study for much research over the last 10 years. Many variants of HS were developed to address some of these flaws, and most of them have made substantial improvements. In this paper we compare the performance of three recent HS variants: exploratory harmony search, self-adaptive harmony search, and dynamic local-best harmony search. We compare the accuracy of these algorithms, using a set of well-known optimisation benchmark functions that include both unimodal and multimodal problems. Observations from this comparison led us to design a novel hybrid that combines the best attributes of these modern variants into a single optimiser called generalised adaptive harmony search.

  2. One visual search, many memory searches: An eye-tracking investigation of hybrid search.

    Science.gov (United States)

    Drew, Trafton; Boettcher, Sage E P; Wolfe, Jeremy M

    2017-09-01

    Suppose you go to the supermarket with a shopping list of 10 items held in memory. Your shopping expedition can be seen as a combination of visual search and memory search. This is known as "hybrid search." There is a growing interest in understanding how hybrid search tasks are accomplished. We used eye tracking to examine how manipulating the number of possible targets (the memory set size [MSS]) changes how observers (Os) search. We found that dwell time on each distractor increased with MSS, suggesting a memory search was being executed each time a new distractor was fixated. Meanwhile, although the rate of refixation increased with MSS, it was not nearly enough to suggest a strategy that involves repeatedly searching visual space for subgroups of the target set. These data provide a clear demonstration that hybrid search tasks are carried out via a "one visual search, many memory searches" heuristic in which Os examine items in the visual array once with a very low rate of refixations. For each item selected, Os activate a memory search that produces logarithmic response time increases with increased MSS. Furthermore, the percentage of distractors fixated was strongly modulated by the MSS: More items in the MSS led to a higher percentage of fixated distractors. Searching for more potential targets appears to significantly alter how Os approach the task, ultimately resulting in more eye movements and longer response times.

  3. Artificial intelligence techniques in Prolog

    CERN Document Server

    Shoham, Yoav

    1993-01-01

    Artificial Intelligence Techniques in Prolog introduces the reader to the use of well-established algorithmic techniques in the field of artificial intelligence (AI), with Prolog as the implementation language. The techniques considered cover general areas such as search, rule-based systems, and truth maintenance, as well as constraint satisfaction and uncertainty management. Specific application domains such as temporal reasoning, machine learning, and natural language are also discussed.Comprised of 10 chapters, this book begins with an overview of Prolog, paying particular attention to Prol

  4. Use of Statistical Heuristics in Everyday Inductive Reasoning.

    Science.gov (United States)

    Nisbett, Richard E.; And Others

    1983-01-01

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

  5. A Priori Knowledge and Heuristic Reasoning in Architectural Design.

    Science.gov (United States)

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

  6. Refining a Heuristic for Constructing Bayesian Networks from Structured Arguments

    NARCIS (Netherlands)

    Wieten, G.M.; Bex, F.J.; van der Gaag, L.C.; Prakken, H.; Renooij, S.

    2018-01-01

    Recently, a heuristic was proposed for constructing Bayesian networks (BNs) from structured arguments. This heuristic helps domain experts who are accustomed to argumentation to transform their reasoning into a BN and subsequently weigh their case evidence in a probabilistic manner. While the

  7. Heuristics for no-wait flow shop scheduling problem

    Directory of Open Access Journals (Sweden)

    Kewal Krishan Nailwal

    2016-09-01

    Full Text Available No-wait flow shop scheduling refers to continuous flow of jobs through different machines. The job once started should have the continuous processing through the machines without wait. This situation occurs when there is a lack of an intermediate storage between the processing of jobs on two consecutive machines. The problem of no-wait with the objective of minimizing makespan in flow shop scheduling is NP-hard; therefore the heuristic algorithms are the key to solve the problem with optimal solution or to approach nearer to optimal solution in simple manner. The paper describes two heuristics, one constructive and an improvement heuristic algorithm obtained by modifying the constructive one for sequencing n-jobs through m-machines in a flow shop under no-wait constraint with the objective of minimizing makespan. The efficiency of the proposed heuristic algorithms is tested on 120 Taillard’s benchmark problems found in the literature against the NEH under no-wait and the MNEH heuristic for no-wait flow shop problem. The improvement heuristic outperforms all heuristics on the Taillard’s instances by improving the results of NEH by 27.85%, MNEH by 22.56% and that of the proposed constructive heuristic algorithm by 24.68%. To explain the computational process of the proposed algorithm, numerical illustrations are also given in the paper. Statistical tests of significance are done in order to draw the conclusions.

  8. Fairness and other leadership heuristics: A four-nation study

    NARCIS (Netherlands)

    Janson, A.; Levy, L.; Sitkin, S.B.; Lind, E.A.

    2008-01-01

    Leaders' fairness may be just one of several heuristics - cognitive shortcuts - that followers use to decide quickly whether they can rely on a given leader to lead them to ends that are good for the collective, rather than just good for the leader. Other leadership heuristics might include leader

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

    Science.gov (United States)

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

  10. On Dual Processing and Heuristic Approaches to Moral Cognition

    Science.gov (United States)

    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…

  11. Efficient Heuristics for Simulating Population Overflow in Parallel Networks

    NARCIS (Netherlands)

    Zaburnenko, T.S.; Nicola, V.F.

    2006-01-01

    In this paper we propose a state-dependent importance sampling heuristic to estimate the probability of population overflow in networks of parallel queues. This heuristic approximates the “optimal��? state-dependent change of measure without the need for costly optimization involved in other

  12. Swift and Smart Decision Making: Heuristics that Work

    Science.gov (United States)

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

    2010-01-01

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

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

    Science.gov (United States)

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

    2014-10-01

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

  14. Plant intelligence

    Science.gov (United States)

    Lipavská, Helena; Žárský, Viktor

    2009-01-01

    The concept of plant intelligence, as proposed by Anthony Trewavas, has raised considerable discussion. However, plant intelligence remains loosely defined; often it is either perceived as practically synonymous to Darwinian fitness, or reduced to a mere decorative metaphor. A more strict view can be taken, emphasizing necessary prerequisites such as memory and learning, which requires clarifying the definition of memory itself. To qualify as memories, traces of past events have to be not only stored, but also actively accessed. We propose a criterion for eliminating false candidates of possible plant intelligence phenomena in this stricter sense: an “intelligent” behavior must involve a component that can be approximated by a plausible algorithmic model involving recourse to stored information about past states of the individual or its environment. Re-evaluation of previously presented examples of plant intelligence shows that only some of them pass our test. “You were hurt?” Kumiko said, looking at the scar. Sally looked down. “Yeah.” “Why didn't you have it removed?” “Sometimes it's good to remember.” “Being hurt?” “Being stupid.”—(W. Gibson: Mona Lisa Overdrive) PMID:19816094

  15. Speech Intelligibility

    Science.gov (United States)

    Brand, Thomas

    Speech intelligibility (SI) is important for different fields of research, engineering and diagnostics in order to quantify very different phenomena like the quality of recordings, communication and playback devices, the reverberation of auditoria, characteristics of hearing impairment, benefit using hearing aids or combinations of these things.

  16. Monte-Carlo Tree Search for Poly-Y

    NARCIS (Netherlands)

    Wevers, L.; te Brinke, Steven

    2014-01-01

    Monte-Carlo tree search (MCTS) is a heuristic search algorithm that has recently been very successful in the games of Go and Hex. In this paper, we describe an MCTS player for the game of Poly-Y, which is a connection game similar to Hex. Our player won the CodeCup 2014 AI programming competition.

  17. Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling

    OpenAIRE

    Burke, Edmund; MacCarthy, Bart L.; Petrovic, Sanja; Qu, Rong

    2002-01-01

    This paper presents a new hyper-heuristic method using Case-Based Reasoning (CBR) for solving course timetabling problems. The term Hyper-heuristics has recently been employed to refer to 'heuristics that choose heuristics' rather than heuristics that operate directly on given problems. One of the overriding motivations of hyper-heuristic methods is the attempt to develop techniques that can operate with greater generality than is currently possible. The basic idea behind this is that we main...

  18. The Foreign Intelligence Surveillance Act: An Overview of the Statutory Framework and U.S. Foreign Intelligence Surveillance Court and U.S. Foreign Intelligence Surveillance Court of Review Decisions

    National Research Council Canada - National Science Library

    Bazan, Elizabeth B

    2007-01-01

    .... Subsequent legislation expanded federal laws dealing with foreign intelligence gathering to address physical searches, pen registers and trap and trace devices, and access to certain business records...

  19. Scalable unit commitment by memory-bounded ant colony optimization with A{sup *} local search

    Energy Technology Data Exchange (ETDEWEB)

    Saber, Ahmed Yousuf; Alshareef, Abdulaziz Mohammed [Department of Electrical and Computer Engineering, King Abdulaziz University, P.O. Box 80204, Jeddah 21589 (Saudi Arabia)

    2008-07-15

    Ant colony optimization (ACO) is successfully applied in optimization problems. Performance of the basic ACO for small problems with moderate dimension and searching space is satisfactory. As the searching space grows exponentially in the large-scale unit commitment problem, the basic ACO is not applicable for the vast size of pheromone matrix of ACO in practical time and physical computer-memory limit. However, memory-bounded methods prune the least-promising nodes to fit the system in computer memory. Therefore, the authors propose memory-bounded ant colony optimization (MACO) in this paper for the scalable (no restriction for system size) unit commitment problem. This MACO intelligently solves the limitation of computer memory, and does not permit the system to grow beyond a bound on memory. In the memory-bounded ACO implementation, A{sup *} heuristic is introduced to increase local searching ability and probabilistic nearest neighbor method is applied to estimate pheromone intensity for the forgotten value. Finally, the benchmark data sets and existing methods are used to show the effectiveness of the proposed method. (author)

  20. Solving SAT problem by heuristic polarity decision-making algorithm

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    This paper presents a heuristic polarity decision-making algorithm for solving Boolean satisfiability (SAT). The algorithm inherits many features of the current state-of-the-art SAT solvers, such as fast BCP, clause recording, restarts, etc. In addition, a preconditioning step that calculates the polarities of variables according to the cover distribution of Karnaugh map is introduced into DPLL procedure, which greatly reduces the number of conflicts in the search process. The proposed approach is implemented as a SAT solver named DiffSat. Experiments show that DiffSat can solve many "real-life" instances in a reasonable time while the best existing SAT solvers, such as Zchaff and MiniSat, cannot. In particular, DiffSat can solve every instance of Bart benchmark suite in less than 0.03 s while Zchaff and MiniSat fail under a 900 s time limit. Furthermore, DiffSat even outperforms the outstanding incomplete algorithm DLM in some instances.

  1. Hybrid Experiential-Heuristic Cognitive Radio Engine Architecture and Implementation

    Directory of Open Access Journals (Sweden)

    Ashwin Amanna

    2012-01-01

    Full Text Available The concept of cognitive radio (CR focuses on devices that can sense their environment, adapt configuration parameters, and learn from past behaviors. Architectures tend towards simplified decision-making algorithms inspired by human cognition. Initial works defined cognitive engines (CEs founded on heuristics, such as genetic algorithms (GAs, and case-based reasoning (CBR experiential learning algorithms. This hybrid architecture enables both long-term learning, faster decisions based on past experience, and capability to still adapt to new environments. This paper details an autonomous implementation of a hybrid CBR-GA CE architecture on a universal serial radio peripheral (USRP software-defined radio focused on link adaptation. Details include overall process flow, case base structure/retrieval method, estimation approach within the GA, and hardware-software lessons learned. Unique solutions to realizing the concept include mechanisms for combining vector distance and past fitness into an aggregate quantification of similarity. Over-the-air performance under several interference conditions is measured using signal-to-noise ratio, packet error rate, spectral efficiency, and throughput as observable metrics. Results indicate that the CE is successfully able to autonomously change transmit power, modulation/coding, and packet size to maintain the link while a non-cognitive approach loses connectivity. Solutions to existing shortcomings are proposed for improving case-base searching and performance estimation methods.

  2. Study of heuristics in ant system for nuclear reload optimisation

    International Nuclear Information System (INIS)

    Lima, Alan M.M. de; Schirru, Roberto; Silva, Fernando C. da; Machado, Marcelo D.; Medeiros, Jose A.C.C.

    2007-01-01

    A Pressurized Water Reactor core must be reloaded every time the fuel burnup reaches a level when it is not possible to sustain nominal power operation. The nuclear core fuel reload optimization consists in finding a burned-up and fresh-fuel-assembly loading pattern that maximizes the number of effective full power days, minimizing the relationship cost/benefit. This problem is NP-hard, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Besides that, the problem is non-linear and its search space is highly discontinual and multimodal. In this work a parallel computational system based on Ant Colony System (ACS) called Artificial-Ant-Colony Networks is used to solve the nuclear reactor core fuel reload optimization problem, with compatibles heuristics. ACS is a system based on artificial agents that uses the reinforcement learning technique and was originally developed to solve the Traveling Salesman Problem, which is conceptually similar to the nuclear fuel reload problem. (author)

  3. Study of heuristics in ant system for nuclear reload optimisation

    Energy Technology Data Exchange (ETDEWEB)

    Lima, Alan M.M. de; Schirru, Roberto; Silva, Fernando C. da; Machado, Marcelo D.; Medeiros, Jose A.C.C. [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE). Programa de Engenharia Nuclear]. E-mail: alan@lmp.ufrj.br; schirru@lmp.ufrj.br; fernando@con.ufrj.br; marcelo@lmp.ufrj.br; canedo@lmp.ufrj.br

    2007-07-01

    A Pressurized Water Reactor core must be reloaded every time the fuel burnup reaches a level when it is not possible to sustain nominal power operation. The nuclear core fuel reload optimization consists in finding a burned-up and fresh-fuel-assembly loading pattern that maximizes the number of effective full power days, minimizing the relationship cost/benefit. This problem is NP-hard, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Besides that, the problem is non-linear and its search space is highly discontinual and multimodal. In this work a parallel computational system based on Ant Colony System (ACS) called Artificial-Ant-Colony Networks is used to solve the nuclear reactor core fuel reload optimization problem, with compatibles heuristics. ACS is a system based on artificial agents that uses the reinforcement learning technique and was originally developed to solve the Traveling Salesman Problem, which is conceptually similar to the nuclear fuel reload problem. (author)

  4. Deductive Error Diagnosis and Inductive Error Generalization for Intelligent Tutoring Systems.

    Science.gov (United States)

    Hoppe, H. Ulrich

    1994-01-01

    Examines the deductive approach to error diagnosis for intelligent tutoring systems. Topics covered include the principles of the deductive approach to diagnosis; domain-specific heuristics to solve the problem of generalizing error patterns; and deductive diagnosis and the hypertext-based learning environment. (Contains 26 references.) (JLB)

  5. Augmented neural networks and problem structure-based heuristics for the bin-packing problem

    Science.gov (United States)

    Kasap, Nihat; Agarwal, Anurag

    2012-08-01

    In this article, we report on a research project where we applied augmented-neural-networks (AugNNs) approach for solving the classical bin-packing problem (BPP). AugNN is a metaheuristic that combines a priority rule heuristic with the iterative search approach of neural networks to generate good solutions fast. This is the first time this approach has been applied to the BPP. We also propose a decomposition approach for solving harder BPP, in which subproblems are solved using a combination of AugNN approach and heuristics that exploit the problem structure. We discuss the characteristics of problems on which such problem structure-based heuristics could be applied. We empirically show the effectiveness of the AugNN and the decomposition approach on many benchmark problems in the literature. For the 1210 benchmark problems tested, 917 problems were solved to optimality and the average gap between the obtained solution and the upper bound for all the problems was reduced to under 0.66% and computation time averaged below 33 s per problem. We also discuss the computational complexity of our approach.

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

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

  8. QuickVina: accelerating AutoDock Vina using gradient-based heuristics for global optimization.

    Science.gov (United States)

    Handoko, Stephanus Daniel; Ouyang, Xuchang; Su, Chinh Tran To; Kwoh, Chee Keong; Ong, Yew Soon

    2012-01-01

    Predicting binding between macromolecule and small molecule is a crucial phase in the field of rational drug design. AutoDock Vina, one of the most widely used docking software released in 2009, uses an empirical scoring function to evaluate the binding affinity between the molecules and employs the iterated local search global optimizer for global optimization, achieving a significantly improved speed and better accuracy of the binding mode prediction compared its predecessor, AutoDock 4. In this paper, we propose further improvement in the local search algorithm of Vina by heuristically preventing some intermediate points from undergoing local search. Our improved version of Vina-dubbed QVina-achieved a maximum acceleration of about 25 times with the average speed-up of 8.34 times compared to the original Vina when tested on a set of 231 protein-ligand complexes while maintaining the optimal scores mostly identical. Using our heuristics, larger number of different ligands can be quickly screened against a given receptor within the same time frame.

  9. Design and Implementation of a Combinatorial Optimization Multi-population Meta-heuristic for Solving Vehicle Routing Problems

    Directory of Open Access Journals (Sweden)

    Eneko Osaba

    2016-12-01

    Full Text Available This paper aims to give a presentation of the PhD defended by Eneko Osaba on November 16th, 2015, at the University of Deusto. The thesis can be placed in the field of artificial intelligence. Specifically, it is related with multi- population meta-heuristics for solving vehicle routing problems. The dissertation was held in the main auditorium of the University, in a publicly open presentation. After the presentation, Eneko was awarded with the highest grade (cum laude. Additionally, Eneko obtained the PhD obtaining award granted by the Basque Government through.

  10. SPARSE: quadratic time simultaneous alignment and folding of RNAs without sequence-based heuristics.

    Science.gov (United States)

    Will, Sebastian; Otto, Christina; Miladi, Milad; Möhl, Mathias; Backofen, Rolf

    2015-08-01

    RNA-Seq experiments have revealed a multitude of novel ncRNAs. The gold standard for their analysis based on simultaneous alignment and folding suffers from extreme time complexity of [Formula: see text]. Subsequently, numerous faster 'Sankoff-style' approaches have been suggested. Commonly, the performance of such methods relies on sequence-based heuristics that restrict the search space to optimal or near-optimal sequence alignments; however, the accuracy of sequence-based methods breaks down for RNAs with sequence identities below 60%. Alignment approaches like LocARNA that do not require sequence-based heuristics, have been limited to high complexity ([Formula: see text] quartic time). Breaking this barrier, we introduce the novel Sankoff-style algorithm 'sparsified prediction and alignment of RNAs based on their structure ensembles (SPARSE)', which runs in quadratic time without sequence-based heuristics. To achieve this low complexity, on par with sequence alignment algorithms, SPARSE features strong sparsification based on structural properties of the RNA ensembles. Following PMcomp, SPARSE gains further speed-up from lightweight energy computation. Although all existing lightweight Sankoff-style methods restrict Sankoff's original model by disallowing loop deletions and insertions, SPARSE transfers the Sankoff algorithm to the lightweight energy model completely for the first time. Compared with LocARNA, SPARSE achieves similar alignment and better folding quality in significantly less time (speedup: 3.7). At similar run-time, it aligns low sequence identity instances substantially more accurate than RAF, which uses sequence-based heuristics. © The Author 2015. Published by Oxford University Press.

  11. SPARSE: quadratic time simultaneous alignment and folding of RNAs without sequence-based heuristics

    Science.gov (United States)

    Will, Sebastian; Otto, Christina; Miladi, Milad; Möhl, Mathias; Backofen, Rolf

    2015-01-01

    Motivation: RNA-Seq experiments have revealed a multitude of novel ncRNAs. The gold standard for their analysis based on simultaneous alignment and folding suffers from extreme time complexity of O(n6). Subsequently, numerous faster ‘Sankoff-style’ approaches have been suggested. Commonly, the performance of such methods relies on sequence-based heuristics that restrict the search space to optimal or near-optimal sequence alignments; however, the accuracy of sequence-based methods breaks down for RNAs with sequence identities below 60%. Alignment approaches like LocARNA that do not require sequence-based heuristics, have been limited to high complexity (≥ quartic time). Results: Breaking this barrier, we introduce the novel Sankoff-style algorithm ‘sparsified prediction and alignment of RNAs based on their structure ensembles (SPARSE)’, which runs in quadratic time without sequence-based heuristics. To achieve this low complexity, on par with sequence alignment algorithms, SPARSE features strong sparsification based on structural properties of the RNA ensembles. Following PMcomp, SPARSE gains further speed-up from lightweight energy computation. Although all existing lightweight Sankoff-style methods restrict Sankoff’s original model by disallowing loop deletions and insertions, SPARSE transfers the Sankoff algorithm to the lightweight energy model completely for the first time. Compared with LocARNA, SPARSE achieves similar alignment and better folding quality in significantly less time (speedup: 3.7). At similar run-time, it aligns low sequence identity instances substantially more accurate than RAF, which uses sequence-based heuristics. Availability and implementation: SPARSE is freely available at http://www.bioinf.uni-freiburg.de/Software/SPARSE. Contact: backofen@informatik.uni-freiburg.de Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25838465

  12. [The heuristics of reaching a diagnosis].

    Science.gov (United States)

    Wainstein, Eduardo

    2009-12-01

    Making a diagnosis in medicine is a complex process in which many cognitive and psychological issues are involved. After the first encounter with the patient, an unconscious process ensues to suspect the presence of a particular disease. Usually, complementary tests are requested to confirm the clinical suspicion. The interpretation of requested tests can be biased by the clinical diagnosis that was considered in the first encounter with the patient. The awareness of these sources of error is essential in the interpretation of the findings that will eventually lead to a final diagnosis. This article discusses some aspects of the heuristics involved in the adjudication of priory probabilities and provides a brief review of current concepts of the reasoning process.

  13. Heuristics and bias in rectal surgery.

    Science.gov (United States)

    MacDermid, Ewan; Young, Christopher J; Moug, Susan J; Anderson, Robert G; Shepherd, Heather L

    2017-08-01

    Deciding to defunction after anterior resection can be difficult, requiring cognitive tools or heuristics. From our previous work, increasing age and risk-taking propensity were identified as heuristic biases for surgeons in Australia and New Zealand (CSSANZ), and inversely proportional to the likelihood of creating defunctioning stomas. We aimed to assess these factors for colorectal surgeons in the British Isles, and identify other potential biases. The Association of Coloproctology of Great Britain and Ireland (ACPGBI) was invited to complete an online survey. Questions included demographics, risk-taking propensity, sensitivity to professional criticism, self-perception of anastomotic leak rate and propensity for creating defunctioning stomas. Chi-squared testing was used to assess differences between ACPGBI and CSSANZ respondents. Multiple regression analysis identified independent surgeon predictors of stoma formation. One hundred fifty (19.2%) eligible members of the ACPGBI replied. Demographics between ACPGBI and CSSANZ groups were well-matched. Significantly more ACPGBI surgeons admitted to anastomotic leak in the last year (p < 0.001). ACPGBI surgeon age over 50 (p = 0.02), higher risk-taking propensity across several domains (p = 0.044), self-belief in a lower-than-average anastomotic leak rate (p = 0.02) and belief that the average risk of leak after anterior resection is 8% or lower (p = 0.007) were all independent predictors of less frequent stoma formation. Sensitivity to criticism from colleagues was not a predictor of stoma formation. Unrecognised surgeon factors including age, everyday risk-taking, self-belief in surgical ability and lower probability bias of anastomotic leak appear to exert an effect on decision-making in rectal surgery.

  14. A greedy heuristic using adjoint functions for the optimization of seed and needle configurations in prostate seed implant

    Energy Technology Data Exchange (ETDEWEB)

    Yoo, Sua [Department of Radiation Oncology, Duke University Medical Center, Box 3295, Durham, NC 27710 (United States); Kowalok, Michael E [Department of Radiation Oncology, Virginia Commonwealth University Health System, 401 College St., PO Box 980058, Richmond, VA 23298-0058 (United States); Thomadsen, Bruce R [Department of Medical Physics, University of Wisconsin-Madison, 1530 MSC, 1300 University Ave., Madison, WI 53706 (United States); Henderson, Douglass L [Department of Engineering Physics, University of Wisconsin-Madison, 153 Engineering Research Bldg., 1500 Engineering Dr., Madison, WI 53706 (United States)

    2007-02-07

    We continue our work on the development of an efficient treatment-planning algorithm for prostate seed implants by incorporation of an automated seed and needle configuration routine. The treatment-planning algorithm is based on region of interest (ROI) adjoint functions and a greedy heuristic. As defined in this work, the adjoint function of an ROI is the sensitivity of the average dose in the ROI to a unit-strength brachytherapy source at any seed position. The greedy heuristic uses a ratio of target and critical structure adjoint functions to rank seed positions according to their ability to irradiate the target ROI while sparing critical structure ROIs. Because seed positions are ranked in advance and because the greedy heuristic does not modify previously selected seed positions, the greedy heuristic constructs a complete seed configuration quickly. Isodose surface constraints determine the search space and the needle constraint limits the number of needles. This study additionally includes a methodology that scans possible combinations of these constraint values automatically. This automated selection scheme saves the user the effort of manually searching constraint values. With this method, clinically acceptable treatment plans are obtained in less than 2 min. For comparison, the branch-and-bound method used to solve a mixed integer-programming model took close to 2.5 h to arrive at a feasible solution. Both methods achieved good treatment plans, but the speedup provided by the greedy heuristic was a factor of approximately 100. This attribute makes this algorithm suitable for intra-operative real-time treatment planning.

  15. A greedy heuristic using adjoint functions for the optimization of seed and needle configurations in prostate seed implant

    International Nuclear Information System (INIS)

    Yoo, Sua; Kowalok, Michael E; Thomadsen, Bruce R; Henderson, Douglass L

    2007-01-01

    We continue our work on the development of an efficient treatment-planning algorithm for prostate seed implants by incorporation of an automated seed and needle configuration routine. The treatment-planning algorithm is based on region of interest (ROI) adjoint functions and a greedy heuristic. As defined in this work, the adjoint function of an ROI is the sensitivity of the average dose in the ROI to a unit-strength brachytherapy source at any seed position. The greedy heuristic uses a ratio of target and critical structure adjoint functions to rank seed positions according to their ability to irradiate the target ROI while sparing critical structure ROIs. Because seed positions are ranked in advance and because the greedy heuristic does not modify previously selected seed positions, the greedy heuristic constructs a complete seed configuration quickly. Isodose surface constraints determine the search space and the needle constraint limits the number of needles. This study additionally includes a methodology that scans possible combinations of these constraint values automatically. This automated selection scheme saves the user the effort of manually searching constraint values. With this method, clinically acceptable treatment plans are obtained in less than 2 min. For comparison, the branch-and-bound method used to solve a mixed integer-programming model took close to 2.5 h to arrive at a feasible solution. Both methods achieved good treatment plans, but the speedup provided by the greedy heuristic was a factor of approximately 100. This attribute makes this algorithm suitable for intra-operative real-time treatment planning

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

    Science.gov (United States)

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

    2008-01-01

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

  17. Artificial Intelligence.

    Science.gov (United States)

    Lawrence, David R; Palacios-González, César; Harris, John

    2016-04-01

    It seems natural to think that the same prudential and ethical reasons for mutual respect and tolerance that one has vis-à-vis other human persons would hold toward newly encountered paradigmatic but nonhuman biological persons. One also tends to think that they would have similar reasons for treating we humans as creatures that count morally in our own right. This line of thought transcends biological boundaries-namely, with regard to artificially (super)intelligent persons-but is this a safe assumption? The issue concerns ultimate moral significance: the significance possessed by human persons, persons from other planets, and hypothetical nonorganic persons in the form of artificial intelligence (AI). This article investigates why our possible relations to AI persons could be more complicated than they first might appear, given that they might possess a radically different nature to us, to the point that civilized or peaceful coexistence in a determinate geographical space could be impossible to achieve.

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

    DEFF Research Database (Denmark)

    Muller, Laurent Flindt; Spoorendonk, Simon

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

  19. High-speed data search

    Science.gov (United States)

    Driscoll, James N.

    1994-01-01

    The high-speed data search system developed for KSC incorporates existing and emerging information retrieval technology to help a user intelligently and rapidly locate information found in large textual databases. This technology includes: natural language input; statistical ranking of retrieved information; an artificial intelligence concept called semantics, where 'surface level' knowledge found in text is used to improve the ranking of retrieved information; and relevance feedback, where user judgements about viewed information are used to automatically modify the search for further information. Semantics and relevance feedback are features of the system which are not available commercially. The system further demonstrates focus on paragraphs of information to decide relevance; and it can be used (without modification) to intelligently search all kinds of document collections, such as collections of legal documents medical documents, news stories, patents, and so forth. The purpose of this paper is to demonstrate the usefulness of statistical ranking, our semantic improvement, and relevance feedback.

  20. Analytic and heuristic processing influences on adolescent reasoning and decision-making.

    Science.gov (United States)

    Klaczynski, P A

    2001-01-01

    The normative/descriptive gap is the discrepancy between actual reasoning and traditional standards for reasoning. The relationship between age and the normative/descriptive gap was examined by presenting adolescents with a battery of reasoning and decision-making tasks. Middle adolescents (N = 76) performed closer to normative ideals than early adolescents (N = 66), although the normative/descriptive gap was large for both groups. Correlational analyses revealed that (1) normative responses correlated positively with each other, (2) nonnormative responses were positively interrelated, and (3) normative and nonnormative responses were largely independent. Factor analyses suggested that performance was based on two processing systems. The "analytic" system operates on "decontextualized" task representations and underlies conscious, computational reasoning. The "heuristic" system operates on "contextualized," content-laden representations and produces "cognitively cheap" responses that sometimes conflict with traditional norms. Analytic processing was more clearly linked to age and to intelligence than heuristic processing. Implications for cognitive development, the competence/performance issue, and rationality are discussed.

  1. An Ad-Hoc Initial Solution Heuristic for Metaheuristic Optimization of Energy Market Participation Portfolios

    Directory of Open Access Journals (Sweden)

    Ricardo Faia

    2017-06-01

    Full Text Available The deregulation of the electricity sector has culminated in the introduction of competitive markets. In addition, the emergence of new forms of electric energy production, namely the production of renewable energy, has brought additional changes in electricity market operation. Renewable energy has significant advantages, but at the cost of an intermittent character. The generation variability adds new challenges for negotiating players, as they have to deal with a new level of uncertainty. In order to assist players in their decisions, decision support tools enabling assisting players in their negotiations are crucial. Artificial intelligence techniques play an important role in this decision support, as they can provide valuable results in rather small execution times, namely regarding the problem of optimizing the electricity markets participation portfolio. This paper proposes a heuristic method that provides an initial solution that allows metaheuristic techniques to improve their results through a good initialization of the optimization process. Results show that by using the proposed heuristic, multiple metaheuristic optimization methods are able to improve their solutions in a faster execution time, thus providing a valuable contribution for players support in energy markets negotiations.

  2. Intelligent Tutor

    Science.gov (United States)

    1990-01-01

    NASA also seeks to advance American education by employing the technology utilization process to develop a computerized, artificial intelligence-based Intelligent Tutoring System (ITS) to help high school and college physics students. The tutoring system is designed for use with the lecture and laboratory portions of a typical physics instructional program. Its importance lies in its ability to observe continually as a student develops problem solutions and to intervene when appropriate with assistance specifically directed at the student's difficulty and tailored to his skill level and learning style. ITS originated as a project of the Johnson Space Center (JSC). It is being developed by JSC's Software Technology Branch in cooperation with Dr. R. Bowen Loftin at the University of Houston-Downtown. Program is jointly sponsored by NASA and ACOT (Apple Classrooms of Tomorrow). Other organizations providing support include Texas Higher Education Coordinating Board, the National Research Council, Pennzoil Products Company and the George R. Brown Foundation. The Physics I class of Clear Creek High School, League City, Texas are providing the classroom environment for test and evaluation of the system. The ITS is a spinoff product developed earlier to integrate artificial intelligence into training/tutoring systems for NASA astronauts flight controllers and engineers.

  3. The recognition heuristic: a review of theory and tests.

    Science.gov (United States)

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

  4. Cognitive load during route selection increases reliance on spatial heuristics.

    Science.gov (United States)

    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.

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

    Directory of Open Access Journals (Sweden)

    Thorsten ePachur

    2011-07-01

    Full Text Available 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.

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

    Science.gov (United States)

    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

  7. Heuristics, biases and traps in managerial decision making

    Directory of Open Access Journals (Sweden)

    Peter Gál

    2013-01-01

    Full Text Available The aim of the paper is to demonstrate the impact of heuristics, biases and psychological traps on the decision making. Heuristics are unconscious routines people use to cope with the complexity inherent in most decision situations. They serve as mental shortcuts that help people to simplify and structure the information encountered in the world. These heuristics could be quite useful in some situations, while in others they can lead to severe and systematic errors, based on significant deviations from the fundamental principles of statistics, probability and sound judgment. This paper focuses on illustrating the existence of the anchoring, availability, and representativeness heuristics, originally described by Tversky & Kahneman in the early 1970’s. The anchoring heuristic is a tendency to focus on the initial information, estimate or perception (even random or irrelevant number as a starting point. People tend to give disproportionate weight to the initial information they receive. The availability heuristic explains why highly imaginable or vivid information have a disproportionate effect on people’s decisions. The representativeness heuristic causes that people rely on highly specific scenarios, ignore base rates, draw conclusions based on small samples and neglect scope. Mentioned phenomena are illustrated and supported by evidence based on the statistical analysis of the results of a questionnaire.

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

    Science.gov (United States)

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

    2009-01-01

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

  9. Intelligent interaction based on holographic personalized portal

    Directory of Open Access Journals (Sweden)

    Yadong Huang

    2017-06-01

    Full Text Available Purpose – The purpose of this paper is to study the architecture of holographic personalized portal, user modeling, commodity modeling and intelligent interaction. Design/methodology/approach – In this paper, the authors propose crowd-science industrial ecological system based on holographic personalized portal and its interaction. The holographic personality portal is based on holographic enterprises, commodities and consumers, and the personalized portal consists of accurate ontology, reliable supply, intelligent demand and smart cyberspace. Findings – The personalized portal can realize the information acquisition, characteristic analysis and holographic presentation. Then, the intelligent interaction, e.g. demand decomposition, personalized search, personalized presentation and demand prediction, will be implemented within the personalized portal. Originality/value – The authors believe that their work on intelligent interaction based on holographic personalized portal, which has been first proposed in this paper, is innovation focusing on the interaction between intelligence and convenience.

  10. A Survey of Intelligent Car Parking System

    OpenAIRE

    Faheem; S.A. Mahmud; G.M. Khan; M. Rahman; H. Zafar

    2013-01-01

    The industrialization of the world, increase in population, slow paced city development and mismanagement of the available parking space has resulted in parking related problems. There is a dire need for a secure, intelligent, efficient and reliable system which can be used for searching the unoccupied parking facility, guidance towards the parking facility, negotiation of the parking fee, along with the proper management of the parking facility. Intelligent Parking Service is a part of Intel...

  11. TOUR CONSTRUCTION HEURISTICS FOR AN ORDER SEQUENCING PROBLEM

    Directory of Open Access Journals (Sweden)

    De Villiers, A. P.

    2012-11-01

    Full Text Available An order picking system that requires pickers to move in a clockwise direction around a picking line with fixed locations is considered. The problem is divided into three tiers. The tier in which orders must be sequenced is addressed. Eight tour construction heuristics are developed and implemented for an order picking system operating in unidirectional picking lines. Two classes of tour construction heuristics the tour construction starting position ( and the tour construction ending position ( are developed to sequence orders in a picking line. All algorithms are tested and compared using real life data sets. The best solution quality was obtained by a heuristic with adaptations.

  12. On the Importance of Elimination Heuristics in Lazy Propagation

    DEFF Research Database (Denmark)

    Madsen, Anders Læsø; Butz, Cory J.

    2012-01-01

    elimination orders on-line. This paper considers the importance of elimination heuristics in LP when using Variable Elimination (VE) as the message and single marginal computation algorithm. It considers well-known cost measures for selecting the next variable to eliminate and a new cost measure....... The empirical evaluation examines dierent heuristics as well as sequences of cost measures, and was conducted on real-world and randomly generated Bayesian networks. The results show that for most cases performance is robust relative to the cost measure used and in some cases the elimination heuristic can have...

  13. Motor heuristics and embodied choices: how to choose and act.

    Science.gov (United States)

    Raab, Markus

    2017-08-01

    Human performance requires choosing what to do and how to do it. The goal of this theoretical contribution is to advance understanding of how the motor and cognitive components of choices are intertwined. From a holistic perspective I extend simple heuristics that have been tested in cognitive tasks to motor tasks, coining the term motor heuristics. Similarly I extend the concept of embodied cognition, that has been tested in simple sensorimotor processes changing decisions, to complex sport behavior coining the term embodied choices. Thus both motor heuristics and embodied choices explain complex behavior such as studied in sport and exercise psychology. Copyright © 2017 Elsevier Ltd. All rights reserved.

  14. Heuristic Portfolio Trading Rules with Capital Gain Taxes

    DEFF Research Database (Denmark)

    Fischer, Marcel; Gallmeyer, Michael

    2016-01-01

    We study the out-of-sample performance of portfolio trading strategies used when an investor faces capital gain taxation and proportional transaction costs. Overlaying simple tax trading heuristics on trading strategies improves out-of-sample performance. For medium to large transaction costs......, no trading strategy can outperform a 1/N trading strategy augmented with a tax heuristic, not even the most tax and transaction cost-efficient buy-and-hold strategy. Overall, the best strategy is 1/N augmented with a heuristic that allows for a fixed deviation in absolute portfolio weights. Our results thus...... show that the best trading strategies balance diversification considerations and tax considerations....

  15. The beauty of simple models: Themes in recognition heuristic research

    Directory of Open Access Journals (Sweden)

    Daniel G. Goldstein

    2011-07-01

    Full Text Available The advantage of models that do not use flexible parameters is that one can precisely show to what degree they predict behavior, and in what situations. In three issues of this journal, the recognition heuristic has been examined carefully from many points of view. We comment here on four themes, the use of optimization models to understand the rationality of heuristics, the generalization of the recognition input beyond a binary judgment, new conditions for less-is-more effects, and the importance of specifying boundary conditions for cognitive heuristics.

  16. Intelligent Design and Intelligent Failure

    Science.gov (United States)

    Jerman, Gregory

    2015-01-01

    Good Evening, my name is Greg Jerman and for nearly a quarter century I have been performing failure analysis on NASA's aerospace hardware. During that time I had the distinct privilege of keeping the Space Shuttle flying for two thirds of its history. I have analyzed a wide variety of failed hardware from simple electrical cables to cryogenic fuel tanks to high temperature turbine blades. During this time I have found that for all the time we spend intelligently designing things, we need to be equally intelligent about understanding why things fail. The NASA Flight Director for Apollo 13, Gene Kranz, is best known for the expression "Failure is not an option." However, NASA history is filled with failures both large and small, so it might be more accurate to say failure is inevitable. It is how we react and learn from our failures that makes the difference.

  17. Internet-based intelligent information processing systems

    CERN Document Server

    Tonfoni, G; Ichalkaranje, N S

    2003-01-01

    The Internet/WWW has made it possible to easily access quantities of information never available before. However, both the amount of information and the variation in quality pose obstacles to the efficient use of the medium. Artificial intelligence techniques can be useful tools in this context. Intelligent systems can be applied to searching the Internet and data-mining, interpreting Internet-derived material, the human-Web interface, remote condition monitoring and many other areas. This volume presents the latest research on the interaction between intelligent systems (neural networks, adap

  18. Intelligent Hypothermia Care System using Ant ‎Colony Optimization for Rules Prediction

    Directory of Open Access Journals (Sweden)

    Hayder Naser Khraibet

    2017-12-01

    Full Text Available Intelligent Hypothermia Care System (IHCS is an intelligence system uses set of methodologies, algorithms, architectures and processes to determine where patients in a postoperative recovery area must be sent. Hypothermia is a significant concern after surgery. This paper utilizes the classification task in data mining to propose an intelligent technique to predict where to send a patient after surgery: intensive care unit, general floor or home. To achieve this goal, this paper evaluates the performance of decision tree algorithm, exemplifying the deterministic approach, against the AntMiner algorithm, exemplifying the heuristic approach, to choose the best approach in detecting the patient’s status. Results show the outperformance of the heuristic approach. The implication of this proposal will be twofold: in hypothermia treatment and in the application of ant colony optimization

  19. Economic tour package model using heuristic

    Science.gov (United States)

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

    2014-07-01

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

  20. The Foreign Intelligence Surveillance Act: An Overview of the Statutory Framework and Recent Judicial Decisions

    National Research Council Canada - National Science Library

    Bazan, Elizabeth B

    2005-01-01

    .... Subsequent legislation expanded federal laws dealing with foreign intelligence gathering to address physical searches, pen registers and trap and trace devices, and access to certain business records...

  1. The Foreign Intelligence Surveillance Act: An Overview of the Statutory Framework and Recent Judicial Decisions

    National Research Council Canada - National Science Library

    Bazan, Elizabeth B

    2004-01-01

    .... Subsequent legislation expanded federal laws dealing with foreign intelligence gathering to address physical searches, pen registers and trap and trace devices, and access to certain business records...

  2. Color waves : a simple heuristic for choosing false colors

    NARCIS (Netherlands)

    Overveld, van C.W.A.M.

    1997-01-01

    A simple heuristic is presented for choosing false colors for visualizing scalar functions on two-dimensional domains. The color scheme allows inspection of the function on several length scales simultanously.

  3. Expanding the Possibilities of AIS Data with Heuristics

    Directory of Open Access Journals (Sweden)

    Bjørnar Brende Smestad

    2017-06-01

    Full Text Available Automatic Identification System (AIS is primarily used as a tracking system for ships, but with the launch of satellites to collect these data, new and previously untested possibilities are emerging. This paper presents the development of heuristics for establishing the specific ship type using information retrieved from AIS data alone. These heuristics expand the possibilities of AIS data, as the specific ship type is vital for several transportation research cases, such as emission analyses of ship traffic and studies on slow steaming. The presented method for developing heuristics can be used for a wider range of vessels. These heuristics may form the basis of large-scale studies on ship traffic using AIS data when it is not feasible or desirable to use commercial ship data registers.

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

    Science.gov (United States)

    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.

  5. Impact of heuristics in clustering large biological networks.

    Science.gov (United States)

    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.

  6. The priority heuristic: making choices without trade-offs.

    Science.gov (United States)

    Brandstätter, Eduard; Gigerenzer, Gerd; Hertwig, Ralph

    2006-04-01

    Bernoulli's framework of expected utility serves as a model for various psychological processes, including motivation, moral sense, attitudes, and decision making. To account for evidence at variance with expected utility, the authors generalize the framework of fast and frugal heuristics from inferences to preferences. The priority heuristic predicts (a) the Allais paradox, (b) risk aversion for gains if probabilities are high, (c) risk seeking for gains if probabilities are low (e.g., lottery tickets), (d) risk aversion for losses if probabilities are low (e.g., buying insurance), (e) risk seeking for losses if probabilities are high, (f) the certainty effect, (g) the possibility effect, and (h) intransitivities. The authors test how accurately the heuristic predicts people's choices, compared with previously proposed heuristics and 3 modifications of expected utility theory: security-potential/aspiration theory, transfer-of-attention-exchange model, and cumulative prospect theory. ((c) 2006 APA, all rights reserved).

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

    Science.gov (United States)

    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.

  8. The Priority Heuristic: Making Choices Without Trade-Offs

    Science.gov (United States)

    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

  9. Exploring the heuristic value of nonpersonal data for sexual- and ...

    African Journals Online (AJOL)

    Exploring the heuristic value of nonpersonal data for sexual- and ... African Safety Promotion: A Journal of Injury and Violence Prevention ... African provinces and towns were analysed to identify trends, and visually represent the number of ...

  10. Usage of Major Heuristics in Property Investment Valuation in Nigeria

    African Journals Online (AJOL)

    Toshiba

    Key words: Investment Valuation, Major Heuristics, Nigeria,. Property. ... given, estimated, or implied and then proceeds to use this information as the basis of ..... study areas take into account the effect of costly floor and wall finishes in their ...

  11. Inteligência biológica versus inteligência artificial: uma abordagem crítica Biologic intelligence versus artificial intelligence: a critical approach

    Directory of Open Access Journals (Sweden)

    Wilson Luiz Sanvito

    1995-09-01

    , such as words. In the present paper it is stressed that brain/mind complex constitutes a monolithic system that functions with emergent properties at several levels of hierarchical organization. These hierarchical levels are non-reducible to one another. They are at least three (neuronal, functional, and semantic, and they function within an interactional plan. The brain/ mind complex, which transform informations in meanings, deals with problems by means of both logical and non-logical mechanisms; while logic allows the mind to arrange the elements for reasoning, the non-logical mechanisms (fuzzy logic, heuristics, insights allows the mind to develop strategies to find solutions. The model for construction of the "intelligent machine" is the operating way of the brain/mind complex, which does not always use logical processes. The role of information science in Artificial Intelligence is to search for knowledge itself (virtual knowledge, rather than to simply attempt a logico-mathematical formalization of knowledge.

  12. Structure optimization by heuristic algorithm in a coarse-grained off-lattice model

    International Nuclear Information System (INIS)

    Jing-Fa, Liu

    2009-01-01

    A heuristic algorithm is presented for a three-dimensional off-lattice AB model consisting of hydrophobic (A) and hydrophilic (B) residues in Fibonacci sequences. By incorporating extra energy contributions into the original potential function, we convert the constrained optimization problem of AB model into an unconstrained optimization problem which can be solved by the gradient method. After the gradient minimization leads to the basins of the local energy minima, the heuristic off-trap strategy and subsequent neighborhood search mechanism are then proposed to get out of local minima and search for the lower-energy configurations. Furthermore, in order to improve the efficiency of the proposed algorithm, we apply the improved version called the new PERM with importance sampling (nPERMis) of the chain-growth algorithm, pruned-enriched-Rosenbluth method (PERM), to face-centered-cubic (FCC)-lattice to produce the initial configurations. The numerical results show that the proposed methods are very promising for finding the ground states of proteins. In several cases, we found the ground state energies are lower than the best values reported in the present literature

  13. A heuristic approach for the evaluation of Physical Protection System effectiveness

    International Nuclear Information System (INIS)

    Zou, Bowen; Yang, Ming; Guo, Jia; Benjamin, Emi-Reybold; Wu, Wenfei

    2017-01-01

    Highlights: • A heuristic approach is applied for the evaluation of PPS effectiveness (HAPPS). • Import 2-D engineering drawings into the analysis application, identify the information contained in the model. Use the HAPPS method as search algorithm to seek the vulnerable adversary intrusion and escape path under certain conditions. • Redesign the PPS by the evaluation results. - Abstract: Physical Protection System (PPS) is essential for each nuclear power plant to safeguard its nuclear materials and nuclear facilities from theft, robbery, illegal transport and sabotage. This paper presents a novel method (HAPPS) combined with Estimate of Adversary Sequence Interruption (EASI) method and heuristic approach (Ant Colony Optimization, ACO) for analyzing and evaluating the PPS effectiveness of NPPs. Import 2-D engineering drawings into the analysis application, identify the information contained in the model, and use the HAPPS method as search algorithm to seek the vulnerable adversary intrusion and escape path under certain conditions. The results of PPS effectiveness analysis will provide a detailed technical feedback for redesigning PPS.

  14. Non-uniform cosine modulated filter banks using meta-heuristic algorithms in CSD space

    Directory of Open Access Journals (Sweden)

    Shaeen Kalathil

    2015-11-01

    Full Text Available This paper presents an efficient design of non-uniform cosine modulated filter banks (CMFB using canonic signed digit (CSD coefficients. CMFB has got an easy and efficient design approach. Non-uniform decomposition can be easily obtained by merging the appropriate filters of a uniform filter bank. Only the prototype filter needs to be designed and optimized. In this paper, the prototype filter is designed using window method, weighted Chebyshev approximation and weighted constrained least square approximation. The coefficients are quantized into CSD, using a look-up-table. The finite precision CSD rounding, deteriorates the filter bank performances. The performances of the filter bank are improved using suitably modified meta-heuristic algorithms. The different meta-heuristic algorithms which are modified and used in this paper are Artificial Bee Colony algorithm, Gravitational Search algorithm, Harmony Search algorithm and Genetic algorithm and they result in filter banks with less implementation complexity, power consumption and area requirements when compared with those of the conventional continuous coefficient non-uniform CMFB.

  15. Internal Medicine residents use heuristics to estimate disease probability

    OpenAIRE

    Phang, Sen Han; Ravani, Pietro; Schaefer, Jeffrey; Wright, Bruce; McLaughlin, Kevin

    2015-01-01

    Background: 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. Method: We randomized 55 In...

  16. No Need to Get Emotional? Emotions and Heuristics

    OpenAIRE

    Szigeti, Andras

    2013-01-01

    Many believe that values are crucially dependent on emotions. This paper focuses on epistemic aspects of the putative link between emotions and value by asking two related questions. First, how exactly are emotions supposed to latch onto or track values? And second, how well suited are emotions to detecting or learning about values? To answer the first question, the paper develops the heuristics-model of emotions. This approach models emotions as sui generis heuristics of value. The empirical...

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

    Directory of Open Access Journals (Sweden)

    Junlong Luo

    Full Text Available 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.

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

    Science.gov (United States)

    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.

  19. Motor heuristics and embodied choices: how to choose and act

    OpenAIRE

    Raab, M

    2017-01-01

    © 2017 Elsevier LtdHuman performance requires choosing what to do and how to do it. The goal of this theoretical contribution is to advance understanding of how the motor and cognitive components of choices are intertwined. From a holistic perspective I extend simple heuristics that have been tested in cognitive tasks to motor tasks, coining the term motor heuristics. Similarly I extend the concept of embodied cognition, that has been tested in simple sensorimotor processes changing decisions...

  20. Heuristics Miner for E-Commerce Visitor Access Pattern Representation

    OpenAIRE

    Kartina Diah Kesuma Wardhani; Wawan Yunanto

    2017-01-01

    E-commerce click stream data can form a certain pattern that describe visitor behavior while surfing the e-commerce website. This pattern can be used to initiate a design to determine alternative access sequence on the website. This research use heuristic miner algorithm to determine the pattern. σ-Algorithm and Genetic Mining are methods used for pattern recognition with frequent sequence item set approach. Heuristic Miner is an evolved form of those methods. σ-Algorithm assume that an activ...