Heuristic Search Theory and Applications
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
An FMRI-compatible Symbol Search task.
Liebel, Spencer W; Clark, Uraina S; Xu, Xiaomeng; Riskin-Jones, Hannah H; Hawkshead, Brittany E; Schwarz, Nicolette F; Labbe, Donald; Jerskey, Beth A; Sweet, Lawrence H
2015-03-01
Our objective was to determine whether a Symbol Search paradigm developed for functional magnetic resonance imaging (FMRI) is a reliable and valid measure of cognitive processing speed (CPS) in healthy older adults. As all older adults are expected to experience cognitive declines due to aging, and CPS is one of the domains most affected by age, establishing a reliable and valid measure of CPS that can be administered inside an MR scanner may prove invaluable in future clinical and research settings. We evaluated the reliability and construct validity of a newly developed FMRI Symbol Search task by comparing participants' performance in and outside of the scanner and to the widely used and standardized Symbol Search subtest of the Wechsler Adult Intelligence Scale (WAIS). A brief battery of neuropsychological measures was also administered to assess the convergent and discriminant validity of the FMRI Symbol Search task. The FMRI Symbol Search task demonstrated high test-retest reliability when compared to performance on the same task administered out of the scanner (r=.791; pSymbol Search (r=.717; pSymbol Search task were also observed. The FMRI Symbol Search task is a reliable and valid measure of CPS in healthy older adults and exhibits expected sensitivity to the effects of age on CPS performance.
Efficient heuristics for maximum common substructure search.
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.
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.
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...
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...
SEARCH FOR WORKERS AS SYMBOLIC CONSTRUCTION
Directory of Open Access Journals (Sweden)
Sergey Yurevich Alasheev
2013-08-01
Full Text Available The labour market is seen as a field of symbolic exchange where the main actors are employers and job applicants, whereas the objects of exchange are workplaces and professional competence of employees. The analysis is based on the observed behavioural practices and verbal expressions. An attempt has been made to consider the area of interaction between employers and jobseekers as a field of symbolic production and consumption and to describe methods of construction and perception of representations in the labour market. The analysis of several interviews has revealed significant characteristics of the image of an employee, the employer’s expectations and the specificity of perception of a job applicant.Search and recruitment is a communication process which forms an image of the profession. The use of various search channels imposes restrictions on the construction of the image of a required worker by the employer and determines the specificity of perception of the vacancy by job applicants.DOI: http://dx.doi.org/10.12731/2218-7405-2013-7-3
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.
Complex Sequencing Problems and Local Search Heuristics
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.
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...
Heuristics for Relevancy Ranking of Earth Dataset Search Results
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.
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....
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...
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...
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.
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)
A comparative study of the A* heuristic search algorithm used to solve efficiently a puzzle game
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.
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...
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...
Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
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.
Perceived breast cancer risk: heuristic reasoning and search for a dominance structure.
Katapodi, Maria C; Facione, Noreen C; Humphreys, Janice C; Dodd, Marylin J
2005-01-01
Studies suggest that people construct their risk perceptions by using inferential rules called heuristics. The purpose of this study was to identify heuristics that influence perceived breast cancer risk. We examined 11 interviews from women of diverse ethnic/cultural backgrounds who were recruited from community settings. Narratives in which women elaborated about their own breast cancer risk were analyzed with Argument and Heuristic Reasoning Analysis methodology, which is based on applied logic. The availability, simulation, representativeness, affect, and perceived control heuristics, and search for a dominance structure were commonly used for making risk assessments. Risk assessments were based on experiences with an abnormal breast symptom, experiences with affected family members and friends, beliefs about living a healthy lifestyle, and trust in health providers. Assessment of the potential threat of a breast symptom was facilitated by the search for a dominance structure. Experiences with family members and friends were incorporated into risk assessments through the availability, simulation, representativeness, and affect heuristics. Mistrust in health providers led to an inappropriate dependence on the perceived control heuristic. Identified heuristics appear to create predictable biases and suggest that perceived breast cancer risk is based on common cognitive patterns.
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.
AM: An Artificial Intelligence Approach to Discovery in Mathematics as Heuristic Search
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
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...
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...
A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
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
Modelling antibody side chain conformations using heuristic database search.
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.
Searching for Signs, Symbols, and Icons: Effects of Time of Day, Visual Complexity, and Grouping
McDougall, Sine; Tyrer, Victoria; Folkard, Simon
2006-01-01
Searching for icons, symbols, or signs is an integral part of tasks involving computer or radar displays, head-up displays in aircraft, or attending to road traffic signs. Icons therefore need to be designed to optimize search times, taking into account the factors likely to slow down visual search. Three factors likely to adversely affect visual…
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.
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%.
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.
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...
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.
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
Hierarchical heuristic search using a Gaussian mixture model for UAV coverage planning.
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.
Perrin, Maxine; Robillard, Manon; Roy-Charland, Annie
2017-12-01
This study examined eye movements during a visual search task as well as cognitive abilities within three age groups. The aim was to explore scanning patterns across symbol grids and to better understand the impact of symbol location in AAC displays on speed and accuracy of symbol selection. For the study, 60 students were asked to locate a series of symbols on 16 cell grids. The EyeLink 1000 was used to measure eye movements, accuracy, and response time. Accuracy was high across all cells. Participants had faster response times, longer fixations, and more frequent fixations on symbols located in the middle of the grid. Group comparisons revealed significant differences for accuracy and reaction times. The Leiter-R was used to evaluate cognitive abilities. Sustained attention and cognitive flexibility scores predicted the participants' reaction time and accuracy in symbol selection. Findings suggest that symbol location within AAC devices and individuals' cognitive abilities influence the speed and accuracy of retrieving symbols.
A meta-heuristic method for solving scheduling problem: crow search algorithm
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.
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)
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...
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)
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
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.
Perceived breast cancer risk: Heuristic reasoning and search for a dominance structure
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 ...
In Search of Prototypes and Feminist Bank-Tellers: Exploring the Representativeness Heuristic
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 ...
A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model
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.
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.
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...
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.
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.
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.
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.
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...
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
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.
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.
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 ...
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)
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
Ryan, Joseph J; Swopes-Willhite, Nicole; Franklin, Cassi; Kreiner, David S
2015-01-01
This study utilized a sample of 50 college students to assess the possibility that responding to the Wechsler Adult Intelligence Scale-Fourth Edition (WAIS-IV) Symbol Search subtest items with an "x" instead of a "single slash mark" would affect performance. A second sample of 50 college students was used to assess the impact on WAIS-IV Block Design performance of presenting all the items with only red surfaces facing up. The modified Symbol Search and Block Design administrations yielded mean scaled scores and raw scores that did not differ significantly from mean scores obtained with standard administrations. Findings should not be generalized beyond healthy, well-educated young adults.
Johnson, Walter W.; Liao, Min-Ju; Granada, Stacie
2003-01-01
This study investigated visual search performance for target aircraft symbols on a Cockpit Display of Traffic Information (CDTI). Of primary interest was the influence of target brightness (intensity) and highlighting validity (search directions) on the ability to detect a target aircraft among distractor aircraft. Target aircraft were distinguished by an airspace course that conflicted with Ownship (that is, the participant's aircraft). The display could present all (homogeneous) bright aircraft, all (homogeneous) dim aircraft, or mixed bright and dim aircraft, with the target aircraft being either bright or dim. In the mixed intensity condition, participants may or may not have been instructed whether the target was bright or dim. Results indicated that highlighting validity facilitated better detection times. However, instead of bright targets being detected faster, dim targets were found to be detected more slowly in the mixed intensity display than in the homogeneous display. This relative slowness may be due to a delay in confirming the dim aircraft to be a target when it it was among brighter distractor aircraft. This hypothesis will be tested in future research. Funding for this work was provided by the Advanced Air Transportation Technologies Project of NASA's Airspace Operation Systems Program.
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.
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.
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)
Planning chemical syntheses with deep neural networks and symbolic AI
Segler, Marwin H. S.; Preuss, Mike; Waller, Mark P.
2018-03-01
To plan the syntheses of small organic molecules, chemists use retrosynthesis, a problem-solving technique in which target molecules are recursively transformed into increasingly simpler precursors. Computer-aided retrosynthesis would be a valuable tool but at present it is slow and provides results of unsatisfactory quality. Here we use Monte Carlo tree search and symbolic artificial intelligence (AI) to discover retrosynthetic routes. We combined Monte Carlo tree search with an expansion policy network that guides the search, and a filter network to pre-select the most promising retrosynthetic steps. These deep neural networks were trained on essentially all reactions ever published in organic chemistry. Our system solves for almost twice as many molecules, thirty times faster than the traditional computer-aided search method, which is based on extracted rules and hand-designed heuristics. In a double-blind AB test, chemists on average considered our computer-generated routes to be equivalent to reported literature routes.
Contextualizing symbol, symbolizing context
Maudy, Septiani Yugni; Suryadi, Didi; Mulyana, Endang
2017-08-01
When students learn algebra for the first time, inevitably they are experiencing transition from arithmetic to algebraic thinking. Once students could apprehend this essential mathematical knowledge, they are cultivating their ability in solving daily life problems by applying algebra. However, as we dig into this transitional stage, we identified possible students' learning obstacles to be dealt with seriously in order to forestall subsequent hindrance in studying more advance algebra. We come to realize this recurring problem as we undertook the processes of re-personalization and re-contextualization in which we scrutinize the very basic questions: 1) what is variable, linear equation with one variable and their relationship with the arithmetic-algebraic thinking? 2) Why student should learn such concepts? 3) How to teach those concepts to students? By positioning ourselves as a seventh grade student, we address the possibility of children to think arithmetically when confronted with the problems of linear equation with one variable. To help them thinking algebraically, Bruner's modes of representation developed contextually from concrete to abstract were delivered to enhance their interpretation toward the idea of variables. Hence, from the outset we designed the context for student to think symbolically initiated by exploring various symbols that could be contextualized in order to bridge student traversing the arithmetic-algebraic fruitfully.
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.
Directory of Open Access Journals (Sweden)
Nadine BOUDOU
2015-07-01
Full Text Available The objective of this article is to show why the zombie can be presented as a justifiable object of search for the symbolic communication. The zombie exists as symbol because the word the leading to a qualification became of current usage, what allows a widened communication. The diversity of the interpretations that he makes possible testifies of its ambivalence. That he is defined as a symbol or as a metaphor we shall see that, far from being that a lasted fad, the zombie is rich in different senses.
Robert J. Quinlan; Isaya Rumas; Godfrey Naiskye; Marsha Quinlan; Jonathan Yoder
2016-01-01
We examine metabolic, market, and symbolic values of livestock relative to cultural “positioning” by gender, marriage, and household production among Maasai people in Simanjiro, Tanzania to assess local “proximate currencies” relevant for “cultural success.” Data from mixed methods ethnographic research include qualitative interviews since 2012, observation of 85 livestock market sales in 2013 and 2015, and 37 short key informant interviews in 2015. We examine fit between market values, Tropi...
Hartley, Calum; Allen, Melissa L
2015-07-01
Previous word learning studies suggest that children with autism spectrum disorder may have difficulty understanding pictorial symbols. Here we investigate the ability of children with autism spectrum disorder and language-matched typically developing children to contextualize symbolic information communicated by pictures in a search task that did not involve word learning. Out of the participant's view, a small toy was concealed underneath one of four unique occluders that were individuated by familiar nameable objects or unfamiliar unnamable objects. Children were shown a picture of the hiding location and then searched for the toy. Over three sessions, children completed trials with color photographs, black-and-white line drawings, and abstract color pictures. The results reveal zero group differences; neither children with autism spectrum disorder nor typically developing children were influenced by occluder familiarity, and both groups' errorless retrieval rates were above-chance with all three picture types. However, both groups made significantly more errorless retrievals in the most-iconic photograph trials, and performance was universally predicted by receptive language. Therefore, our findings indicate that children with autism spectrum disorder and young typically developing children can contextualize pictures and use them to adaptively guide their behavior in real time and space. However, this ability is significantly influenced by receptive language development and pictorial iconicity. © The Author(s) 2014.
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.
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)
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)
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.
DEFF Research Database (Denmark)
Frølunde, Lisbeth
2008-01-01
an analytic working model called Animated Symbols concerning critical reflection in a dialogic learning process. The model shows dialogue as interactions that involve two types of transformation: inner ‘learning processes' and outer signs and symbols. The classroom-based research study is part of a Ph...
Directory of Open Access Journals (Sweden)
Robert J. Quinlan
2016-10-01
Full Text Available We examine metabolic, market, and symbolic values of livestock relative to cultural “positioning” by gender, marriage, and household production among Maasai people in Simanjiro, Tanzania to assess local “proximate currencies” relevant for “cultural success.” Data from mixed methods ethnographic research include qualitative interviews since 2012, observation of 85 livestock market sales in 2013 and 2015, and 37 short key informant interviews in 2015. We examine fit between market values, Tropical Livestock Units (TLU, weight-based species exchange ratio, and perceived value from interviews for moran (unmarried men, muruo (married men, and tɔmɔnɔ́k (married women. Hedonic regression using livestock species, sex, maturity, and size accounted for 90% of the local market price of livestock. We compared the market-based exchange ratio between cattle and smallstock (sheep and goats to TLU and perceived values situating symbolic value of cattle in terms of Maasai household production schema. One TLU model accurately predicted market exchange ratios, while another predicted hypothetical exchanges, suggesting need for improved livestock wealth estimation for pastoralists. Ritual context, subsistence work, and cultural position influenced perceived values: Moran overvalued cattle by 100% of the local market value. Tɔmɔnɔ́k accurately perceived the market exchange ratio despite never directly engaging in livestock market transactions. Muruo perceived exchange ratios intermediate between moran and tɔmɔnɔ́k. We argue that these perceptions of value reflect distinct labor responsibilities of moran, muruo, and tɔmɔnɔ́k in livestock management, differential value of bridewealth, and control of meat and milk.Attention to value of different livestock species in cultural models of production may prove useful for development efforts.
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.
Directory of Open Access Journals (Sweden)
Desi Amirullah
2015-06-01
Full Text Available The term "Songket" comes from the Malay word "Sungkit", which means "to hook" or "to gouge". Every motifs names and variations was derived from plants and animals as source of inspiration to create many patterns of songket. Each of songket patterns have a philosophy in form of rhyme that refers to the nature of the sources of songket patterns and that philosophy reflects to the beliefs and values of Malay culture. In this research, we propose a system to facilitate an understanding of songket and the philosophy as a way to conserve Songket culture. We propose a system which is able to collect information in image songket motif variations based on feature extraction methods. On each image songket motif variations, we extracted philosophy of rhyme into impressions, and extracting color features of songket images using a histogram 3D-Color Vector quantization (3D-CVQ, shape feature extraction songket image using HU Moment invariants. Then, we created an image search based on impressions, and impressions search based on image. We use techniques of search based on color, shape and aggregation (combination of colors and shapes. The experiment using impression as query : 1 Result based on color, the average value of true 7.3, total score 41.9, 2 Result based on shape, the average value of true 3, total score 16.4, 3 Result based on aggregation, the average value of true 3, total score 17.4. While based using Image Query : 1 Result based on color, the average precision 95%, 2 Result based on shape, average precision 43.3%, 3 Based aggregation, the average precision 73.3%. From our experiments, it can be concluded that the best search system using query impression and query image is based on the color. Keyword : Image Search, Philosophy, impression, Songket, cultural computing, Feature Extraction, Analytical aggregation.
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.
Symbol recognition with kernel density matching.
Zhang, Wan; Wenyin, Liu; Zhang, Kun
2006-12-01
We propose a novel approach to similarity assessment for graphic symbols. Symbols are represented as 2D kernel densities and their similarity is measured by the Kullback-Leibler divergence. Symbol orientation is found by gradient-based angle searching or independent component analysis. Experimental results show the outstanding performance of this approach in various situations.
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.
Directory of Open Access Journals (Sweden)
Khotibul Umam
2017-07-01
Full Text Available Lack of information media about Madurese batik Causes low awareness of younger generation to maintain the production of Madurese batik. Actually, Madurese Batik also has a high philosophy, which the motif and colour reflect the character of the Madurese. Madurese Batik has useful motif as a mean of traditional communication in the form of certain cultural symbols. We collected images of Madurese Batik by identifying the impression of Madurese Batik motif taken from several literature books of Madurese Batik and also the results of observation of experts or craftsmen who understand about Madurese Batik. This research proposed a new approach to create on application which can identify Madurese Batik impression by using 3D-CVQ feature extraction methods to extract color features, and used Hu Moment Invariant for feature feature extraction. Application searching of Madurese Batik image has two ways of searching, those are based on the image input Madurese Batik and based on the input of impression Madurese batik. We use 202 madurese batik motifs and use search techniques based on colors, shapes and aggregations (color and shape combinations. Performance results using based on image queries used: (1 based on color, the average precision 90%, (2 based on shape, the average precision 85%, (3 based on aggregation, the average precision 80%, the conclusion is the color as the best feature in image query. While the performance results using based on the impression query are: (1 based on color, the average value of true 6.7, total score 40.3, (2 based on shape, the average value of true 4.1, total score 24.1, and (3 based on the aggregation, the average value of true 2.5, the total score is 13.8, the conclusion is the color as the best feature in impression query.
Complete local search with memory
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
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.
Abstract Expression Grammar Symbolic Regression
Korns, Michael F.
This chapter examines the use of Abstract Expression Grammars to perform the entire Symbolic Regression process without the use of Genetic Programming per se. The techniques explored produce a symbolic regression engine which has absolutely no bloat, which allows total user control of the search space and output formulas, which is faster, and more accurate than the engines produced in our previous papers using Genetic Programming. The genome is an all vector structure with four chromosomes plus additional epigenetic and constraint vectors, allowing total user control of the search space and the final output formulas. A combination of specialized compiler techniques, genetic algorithms, particle swarm, aged layered populations, plus discrete and continuous differential evolution are used to produce an improved symbolic regression sytem. Nine base test cases, from the literature, are used to test the improvement in speed and accuracy. The improved results indicate that these techniques move us a big step closer toward future industrial strength symbolic regression systems.
Automatic Generation of Heuristics for Scheduling
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.
International Nuclear Information System (INIS)
Yamaguchi, Hiroshi; Hongo, Syozo; Takeshita, Hiroshi
1990-01-01
We have developed Japanese phantoms in two procedures for computation of organ doses exposed to internal and/or external radiation sources. One method is to make mathematical phantoms on the basis of ORNL mathematical phantoms. Parameters to specify organs of Japanese mathematical phantom are determined by interpolations of the ORNL data, which define the organs of Caucasian males and females of various ages, i.e. new born, 1, 5, 10, 15 years and adult, with survey data for Japanese physiques. Another procedure is to build 'symbol phantoms' for the Japanese public. The concept and its method of the symbol phantom enables us to make a phantom for an individual when we have all of his transversal section images obtained by a medical imaging device like MRI, and thus we may achieve more realistic phantoms for Japanese public than the mathematical phantoms. Both studies are in progress in NIRS. (author)
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
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.
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.
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.
A grouping hyper-heuristic framework: application on graph colouring
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;...
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...
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.
Heuristic Inquiry: A Personal Journey of Acculturation and Identity Reconstruction
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 &…
Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems
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...
Using tree diversity to compare phylogenetic heuristics.
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.
The role of heuristics in automated theorem proving J.A Robinson's resolution principle
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.
Cognitive load during route selection increases reliance on spatial heuristics.
Brunyé, Tad T; Martis, Shaina B; Taylor, Holly A
2018-05-01
Planning routes from maps involves perceiving the symbolic environment, identifying alternate routes and applying explicit strategies and implicit heuristics to select an option. Two implicit heuristics have received considerable attention, the southern route preference and initial segment strategy. This study tested a prediction from decision-making theory that increasing cognitive load during route planning will increase reliance on these heuristics. In two experiments, participants planned routes while under conditions of minimal (0-back) or high (2-back) working memory load. In Experiment 1, we examined how memory load impacts the southern route heuristic. In Experiment 2, we examined how memory load impacts the initial segment heuristic. Results replicated earlier results demonstrating a southern route preference (Experiment 1) and initial segment strategy (Experiment 2) and further demonstrated that evidence for heuristic reliance is more likely under conditions of concurrent working memory load. Furthermore, the extent to which participants maintained efficient route selection latencies in the 2-back condition predicted the magnitude of this effect. Together, results demonstrate that working memory load increases the application of heuristics during spatial decision making, particularly when participants attempt to maintain quick decisions while managing concurrent task demands.
Facchini, F
2000-12-01
The aptitude for symbolization, characteristic of man, is revealed not only in artistic representations and funerary practices. It is exhibited by every manifestation of human activity or representation of natural phenomena that assumes or refers to a meaning. We can recognize functional symbolism (tool-making, habitative or food technology), social symbolism, (language and social communication) and spiritual symbolism (funerary practices and artistic expressions). On the basis of these concepts, research into symbolism in prehistoric man allows us to recognize forms of symbolism already in the manifestations of the most ancient humans, starting with Homo habilis (or rudolfensis). Toolmaking, social organization and organization of the territory are oriented toward survival and the life of the family group. They attest to symbolic behaviors and constitute symbolic systems by means of which man expresses himself, lives and transmits his symbolic world. The diverse forms of symbolism are discussed with reference to the different phases of prehistoric humanity.
Pitfalls in Teaching Judgment Heuristics
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…
An analysis of generalised heuristics for vehicle routing and personnel rostering problems
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...
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
Hyper-heuristics with low level parameter adaptation.
Ren, Zhilei; Jiang, He; Xuan, Jifeng; Luo, Zhongxuan
2012-01-01
Recent years have witnessed the great success of hyper-heuristics applying to numerous real-world applications. Hyper-heuristics raise the generality of search methodologies by manipulating a set of low level heuristics (LLHs) to solve problems, and aim to automate the algorithm design process. However, those LLHs are usually parameterized, which may contradict the domain independent motivation of hyper-heuristics. In this paper, we show how to automatically maintain low level parameters (LLPs) using a hyper-heuristic with LLP adaptation (AD-HH), and exemplify the feasibility of AD-HH by adaptively maintaining the LLPs for two hyper-heuristic models. Furthermore, aiming at tackling the search space expansion due to the LLP adaptation, we apply a heuristic space reduction (SAR) mechanism to improve the AD-HH framework. The integration of the LLP adaptation and the SAR mechanism is able to explore the heuristic space more effectively and efficiently. To evaluate the performance of the proposed algorithms, we choose the p-median problem as a case study. The empirical results show that with the adaptation of the LLPs and the SAR mechanism, the proposed algorithms are able to achieve competitive results over the three heterogeneous classes of benchmark instances.
DEFF Research Database (Denmark)
Wagoner, Brady
2013-01-01
them vis-à-vis other research at Clark and in American psychology more generally. The second two articles analyse Werner and Kaplan’s notions of ‘distancing’ and ‘physiognomic metaphor’, showing their roots in naturphilosophie and comparing them with contemporary theories. The last four articles apply......Werner and Kaplan’s Symbol formation was published 50 years ago but its insights have yet to be adequately explored by psychology and other social sciences. This special issue aims to revisit this seminal work in search of concepts to work on key issues facing us today. This introductory article...... begins with a brief outline and contextualization of the book as well as of the articles that this special issue comprises. The first two articles were written by contributors who were part of the Werner era at Clark University. They explore the key concepts of the organismic and development, and situate...
Symbolic dynamics of the Lorenz equations
International Nuclear Information System (INIS)
Fang Hai-ping; Hao Bailin.
1994-07-01
The Lorenz equations are investigated in a wide range of parameters by using the method of symbolic dynamics. First, the systematics of stable periodic orbits in the Lorenz equations is compared with that of the one-dimensional cubic map, which shares the same discrete symmetry with the Lorenz model. The systematics is then ''corrected'' in such a way as to encompass all the known periodic windows of the Lorenz equations with only one exception. Second, in order to justify the above approach and to understand the exceptions, another 1D map with a discontinuity is extracted from an extension of the geometric Lorenz attractor and its symbolic dynamics is constructed. All this has to be done in light of symbolic dynamics of two-dimensional maps. Finally, symbolic dynamics for the actual Poincare return map of the Lorenz equations is constructed in a heuristic way. New periodic windows of the Lorenz equations and their parameters can be predicted from this symbolic dynamics in combination with the 1D cubic map. The extended geometric 2D Lorenz map and the 1D antisymmetric map with a discontinuity describe the topological aspects of the Lorenz equations to high accuracy. (author). 44 refs, 17 figs, 8 tabs
Nuclear reactors; graphical symbols
International Nuclear Information System (INIS)
1987-11-01
This standard contains graphical symbols that reveal the type of nuclear reactor and is used to design graphical and technical presentations. Distinguishing features for nuclear reactors are laid down in graphical symbols. (orig.) [de
Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems.
Moreno-Scott, Jorge Humberto; Ortiz-Bayliss, José Carlos; Terashima-Marín, Hugo; Conant-Pablos, Santiago Enrique
2016-01-01
Constraint satisfaction problems are of special interest for the artificial intelligence and operations research community due to their many applications. Although heuristics involved in solving these problems have largely been studied in the past, little is known about the relation between instances and the respective performance of the heuristics used to solve them. This paper focuses on both the exploration of the instance space to identify relations between instances and good performing heuristics and how to use such relations to improve the search. Firstly, the document describes a methodology to explore the instance space of constraint satisfaction problems and evaluate the corresponding performance of six variable ordering heuristics for such instances in order to find regions on the instance space where some heuristics outperform the others. Analyzing such regions favors the understanding of how these heuristics work and contribute to their improvement. Secondly, we use the information gathered from the first stage to predict the most suitable heuristic to use according to the features of the instance currently being solved. This approach proved to be competitive when compared against the heuristics applied in isolation on both randomly generated and structured instances of constraint satisfaction problems.
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. .
Symbolic reasoning about myocardial scintigrams in PROLOG
International Nuclear Information System (INIS)
Rosenberg, S.; Itti, R.; Benjelloun, L.
1986-01-01
PROLOG (PROgramming in LOGic) is the declarative programming language at the heart of the Japanese fifth-generation computer project. It is proposed that PROLOG is a suitable tool for symbolic image processing, once standard preprocessing has been done. In the present application, the problem of prediction of coronary anatomy from myocardial scintigrams is addressed. Uncertainty is dealt with by a combination of fuzzy-set theoretic and probabilistic reasoning. Heuristic classification rules are based on clinical experience and on a set of 247 myocardial scintigrams with their corresponding coronary angiograms. (orig.)
Symbolic reasoning about myocardial scintigrams in PROLOG
Energy Technology Data Exchange (ETDEWEB)
Rosenberg, S; Itti, R; Benjelloun, L
1986-06-01
PROLOG (PROgramming in LOGic) is the declarative programming language at the heart of the Japanese fifth-generation computer project. It is proposed that PROLOG is a suitable tool for symbolic image processing, once standard preprocessing has been done. In the present application, the problem of prediction of coronary anatomy from myocardial scintigrams is addressed. Uncertainty is dealt with by a combination of fuzzy-set theoretic and probabilistic reasoning. Heuristic classification rules are based on clinical experience and on a set of 247 myocardial scintigrams with their corresponding coronary angiograms.
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)
Heuristic decision making in medicine
Marewski, Julian N.; Gigerenzer, Gerd
2012-01-01
Can less information be more helpful when it comes to making medical decisions? Contrary to the common intuition that more information is always better, the use of heuristics can help both physicians and patients to make sound decisions. Heuristics are simple decision strategies that ignore part of the available information, basing decisions on only a few relevant predictors. We discuss: (i) how doctors and patients use heuristics; and (ii) when heuristics outperform information-greedy methods, such as regressions in medical diagnosis. Furthermore, we outline those features of heuristics that make them useful in health care settings. These features include their surprising accuracy, transparency, and wide accessibility, as well as the low costs and little time required to employ them. We close by explaining one of the statistical reasons why heuristics are accurate, and by pointing to psychiatry as one area for future research on heuristics in health care. PMID:22577307
Heuristic decision making in medicine.
Marewski, Julian N; Gigerenzer, Gerd
2012-03-01
Can less information be more helpful when it comes to making medical decisions? Contrary to the common intuition that more information is always better, the use of heuristics can help both physicians and patients to make sound decisions. Heuristics are simple decision strategies that ignore part of the available information, basing decisions on only a few relevant predictors. We discuss: (i) how doctors and patients use heuristics; and (ii) when heuristics outperform information-greedy methods, such as regressions in medical diagnosis. Furthermore, we outline those features of heuristics that make them useful in health care settings. These features include their surprising accuracy, transparency, and wide accessibility, as well as the low costs and little time required to employ them. We close by explaining one of the statistical reasons why heuristics are accurate, and by pointing to psychiatry as one area for future research on heuristics in health care.
K.C. , Santosh; Wendling , Laurent
2015-01-01
International audience; The chapter focuses on one of the key issues in document image processing i.e., graphical symbol recognition. Graphical symbol recognition is a sub-field of a larger research domain: pattern recognition. The chapter covers several approaches (i.e., statistical, structural and syntactic) and specially designed symbol recognition techniques inspired by real-world industrial problems. It, in general, contains research problems, state-of-the-art methods that convey basic s...
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.
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.
Heuristics in Conflict Resolution
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...
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...
Exact and Heuristic Algorithms for Runway Scheduling
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.
'demoted'?: Symbols as religious phenomena
African Journals Online (AJOL)
2013-03-06
Mar 6, 2013 ... process by which symbols grow and develop, the particular context of a symbol is important. In this article a particular theory as to what symbols are, is presented. ... of communication and reference between these two worlds are symbols. .... from a psychological perspective, understands symbols as a.
Directory of Open Access Journals (Sweden)
O. G. Shostak
2003-06-01
Full Text Available This paper is dedicated to the question of similarities in the approach to the multilevel symbolism in Slav and Native American cultures. Ambivalent symbol of the snake is analyzed in the frame of mythological thinking. At the end the author comes to the conclusion that elements of mythological thinking are still present in everyday life and influence human behavior levels
A System for Automatically Generating Scheduling Heuristics
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.
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...
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....
Noncoherent Symbol Synchronization Techniques
Simon, Marvin
2005-01-01
Traditional methods for establishing symbol synchronization (sync) in digital communication receivers assume that carrier sync has already been established, i.e., the problem is addressed at the baseband level assuming that a 'perfect' estimate of carrier phase is available. We refer to this approach as coherent symbol sync. Since, for NRZ signaling, a suppressed carrier sync loop such as an I-Q Costas loop includes integrate-and-dump (I and D) filters in its in-phase (1) and quadrature (Q) arms, the traditional approach is to first track the carrier in the absence of symbol sync information, then feed back the symbol sync estimate to these filters, and then iterate between the two to a desirable operating level In this paper, we revisit the symbol sync problem by examining methods for obtaining such sync in the absence of carrier phase information, i.e., so-called noncoherent symbol sync loops. We compare the performance of these loops with that of a well-known coherent symbol sync loop and examine the conditions under which one is preferable over the other.
International Nuclear Information System (INIS)
Rechester, A.B.; White, R.B.
1993-01-01
Complex dynamic processes exhibit many complicated patterns of evolution. How can all these patterns be recognized using only output (observational, experimental) data without prior knowledge of the equations of motion? The powerful method for doing this is based on symbolic dynamics: (1) Present output data in symbolic form (trial language). (2) Topological and metric entropies are constructed. (3) Develop algorithms for computer optimization of entropies. (4) By maximizing entropies, find the most appropriate symbolic language for the purpose of pattern recognition. (5) Test this method using a variety of dynamical models from nonlinear science. The authors are in the process of applying this method for analysis of MHD fluctuations in tokamaks
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...
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...
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…
Heuristics Reasoning in Diagnostic Judgment.
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)
Reexamining Our Bias against Heuristics
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…
HEURISTIC APPROACHES FOR PORTFOLIO OPTIMIZATION
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.
Formalising Symbolic Interactionism
de Nooy, W.
2009-01-01
Symbolic interactionism is generally known as a theory typically linked with a qualitative methodology. Recent developments in quantitative social network analysis, however, can analyze processes theorized within this theoretical tradition. Thick description can be complemented with statistical
Symbolic Violence and Victimisation
DEFF Research Database (Denmark)
Pedersen, Bodil Maria
2009-01-01
has been criticised for over-generalisations, as well as for disregarding culture and the embeddedness of psychological problems in situated societal processes. The proposed paper is a contribution to this critique. It will draw on Bourdieu's concept of symbolic violence (1992). The concept connects......Nay (1999). It also undertakes a critical discussion of symbolic violence in the meanings given to victimisation and its aftermaths, as when conceptualised with the help of PTSD (e.g. may the use of concepts of this kind and the practices developed in relation to it constitute symbolic violence...... and contribute to victimisation?) Furthermore the analysis aims at unfolding an understanding of victimisation inclusive of connections between cultural/ societal practices, aspects of symbolic violence and lives of concrete subjects. The discussion takes its point of departure in theoretical deliberations...
Symbolic analysis of spatio-temporal systems: The measurement problem
International Nuclear Information System (INIS)
Brown, R.; Tang, Xianzhu; Tracy, E.R.
1996-01-01
We consider the problem of measuring physical quantities using time-series observations. The approach taken is to validate theoretical models which are derived heuristically or from first principles. The fitting of parameters in such models constitutes the measurement. This is a basic problem in measurement science and a wide array of tools are available. However, an important gap in the present toolkit exists when the system of interest, and hence the models used, exhibit chaotic or turbulent behavior. The development of reliable schemes for analyzing such signals is necessary before one can claim to have a quantitative understanding of the underlying physics. In experimental situations, the number of independently measured time-series is limited, but the number of dynamical degrees of freedom can be large. In addition, the signals of interest will typically be embedded in a noisy background. In the symbol statistics approach, the time-series is coarse-grained and converted into a long, symbol stream. The probability of occurrence of various symbol sequences of fixed length constitutes the symbol statistics. These statistics contain a wealth of information about the underlying dynamics and, as we shall discuss, can be used to validate models. Previously, we have applied this symbolic approach to low dimensional systems with great success. The symbol statistics are robust up to noise/signal ∼20%. At higher noise levels the symbol statistics are biased, but in a relatively simple manner. By including the noise characteristics into the model, we were able to use the symbol statistics to measure parameters even when signal/noise is ∼ O(1). More recently, we have extended the symbolic approach to spatio-temporal systems. We have considered both coupled-map lattices and the complex Ginzburg-Landau equation. This equation arises generically near the onset of instabilities
A Geographical Heuristic Routing Protocol for VANETs
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
DEFF Research Database (Denmark)
Gitz-Johansen, Thomas
2018-01-01
The article explores how Bruce Springsteen and his music function as a symbol. The article first presents the Jungian theory of symbols and of music as symbol. The central argument of the article is that, by functioning symbolically, Springsteen has the potential to influence the psyche of his au...
Symbol generators with program control
International Nuclear Information System (INIS)
Gryaznov, V.M.; Tomik, J.
1974-01-01
Methods of constructing symbol generators are described which ensure a program variation of symbol shape and setup. The symbols are formed on the basis of a point microraster. A symbol description code contains information on a symbol shape, with one digit corresponding to each microraster element. For a microraster discrete by-pass the description code is transformed into succession of illuminating pulses by means of a shift register
Paranoid thinking as a heuristic.
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.
US Accreditation in Mexico: Quality in Higher Education as Symbol, Performance and Translation
Blanco-Ramirez, Gerardo
2015-01-01
Quality practices in higher education involve more than mere compliance with standards and technical mandates; given the complexity of the decisions involved in quality in higher education, this concept, quality, can be analyzed as symbol and performance. This paper utilizes translation as heuristic to analyze the implementation of US…
Multiple symbol differential detection
Divsalar, Dariush (Inventor); Simon, Marvin K. (Inventor)
1991-01-01
A differential detection technique for multiple phase shift keying (MPSK) signals is provided which uses a multiple symbol observation interval on the basis of which a joint decision is made regarding the phase of the received symbols. In accordance with the invention, a first difference phase is created between first and second received symbols. Next, the first difference phase is correlated with the possible values thereof to provide a first plurality of intermediate output signals. A second difference phase is next created between second and third received symbols. The second difference phase is correlated with plural possible values thereof to provide a second plurality of intermediate output signals. Next, a third difference phase is created between the first and third symbols. The third difference phase is correlated with plural possible values thereof to provide a third plurality of intermediate output signals. Each of the first plurality of intermediate outputs are combined with each of the second plurality of intermediate outputs and each of the third plurality of intermediate outputs to provide a plurality of possible output values. Finally, a joint decision is made by choosing from the plurality of possible output values the value which represents the best combined correlation of the first, second and third difference values with the possible values thereof.
Structural Sustainability - Heuristic Approach
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
DEFF Research Database (Denmark)
Pedersen, Bodil Maria
2011-01-01
- to praxis, and drawing on the concept of symbolic violence, this article contributes to their critique. In order to develop the analysis of difficulties victims may experience, they will be reconceptualised using critical psychological concepts such as 1st person perspectives and participation. The analysis...... seeks to undertake a discussion of personal meanings attributed to 'traumatisation'. It raises questions as to whether concepts of this kind and related practices may constitute symbolic violence and contribute to victimisation through looping-processes. Furthermore it aims at unfolding an understanding...... inclusive of connections between societal practices, aspects of symbolic violence, and the conduct of lives. The analysis is based on an empirical study of victimisation through rape and other forms of sexualised coercion....
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
Cross-spectrum symbol synchronization
Mccallister, R. D.; Simon, M. K.
1981-01-01
A popular method of symbol synchronization exploits one aspect of generalized harmonic analysis, normally referred to as the cross-spectrum. Utilizing nonlinear techniques, the input symbol energy is effectively concentrated onto multiples of the symbol clock frequency, facilitating application of conventional phase lock synchronization techniques. A general treatment of the cross-spectrum technique is developed and shown to be applicable across a broad class of symbol modulation formats. An important specific symbol synchronization application is then treated, focusing the general development to provide both insight and quantitative measure of the performance impact associated with variation in these key synchronization parameters: symbol modulation format, symbol transition probability, symbol energy to noise density ratio, and symbol rate to filter bandwidth ratio.
Symbolic computer vector analysis
Stoutemyer, D. R.
1977-01-01
A MACSYMA program is described which performs symbolic vector algebra and vector calculus. The program can combine and simplify symbolic expressions including dot products and cross products, together with the gradient, divergence, curl, and Laplacian operators. The distribution of these operators over sums or products is under user control, as are various other expansions, including expansion into components in any specific orthogonal coordinate system. There is also a capability for deriving the scalar or vector potential of a vector field. Examples include derivation of the partial differential equations describing fluid flow and magnetohydrodynamics, for 12 different classic orthogonal curvilinear coordinate systems.
Directory of Open Access Journals (Sweden)
Bysko Maxim V.
2013-12-01
Full Text Available The article considers the role of jingles in the industrial era, from the occurrence of the regular radio broadcasting, sound films and television up of modern video games, audio and video podcasts, online broadcasts, and mobile communications. Jingles are researched from the point of view of the theory of symbols: the forward motion is detected in the process of development of jingles from the social symbols (radio callsigns to the individual signs-images (ringtones. The role of technical progress in the formation of jingles as important cultural audio elements of modern digital civilization.
Symbolism in European Integration
DEFF Research Database (Denmark)
Manners, Ian
2011-01-01
Ernst Haas observed over fifty years ago that ‘United Europe' is a resilient, adaptable, unifying, and yet unspecified symbol'. It is precisely this adaptability and ambiguity that has ensures the continuing importance of European studies as a means of understanding ‘the remarkable social...... of social transformation involved' (Calhoun 2003: 18). This article will consider the role of symbolism in European integration as part of answering Craig Calhoun's call for a means of transcending specific regimes of analysis in order to advance European studies....
Heuristic reasoning and relative incompleteness
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...
Basic ionizing radiation symbol
International Nuclear Information System (INIS)
1987-01-01
A description is given of the standard symbol for ionizing radiation and of the conditions under which it should not be used. The Arabic equivalent of some English technical terms in this subject is given in one page. 1 ref., 1 fig
Communication in Symbolic Play.
Umek, Ljubica Marjanovic; Musek, Petra Lesnik; Kranjc, Simona
2001-01-01
Analyzed records of Slovene children's speech from a linguistic point of view and established differences in communication patterns with regard to the children's ages and the type of symbolic play. Found a shift in play from make-believe with regard to objects to roleplay related to social context. The older the child, the more language functions…
Symbolic Multidimensional Scaling
P.J.F. Groenen (Patrick); Y. Terada
2015-01-01
markdownabstract__Abstract__ Multidimensional scaling (MDS) is a technique that visualizes dissimilarities between pairs of objects as distances between points in a low dimensional space. In symbolic MDS, a dissimilarity is not just a value but can represent an interval or even a histogram. Here,
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...
Accelerators - instruments and symbols for power
International Nuclear Information System (INIS)
Vogt, E.
1985-01-01
I examine the cult of accelerator physics, describe the laws which govern its development, compare and contrast it with other similar cults in the past, and search for its driving force. It is a story of sheer power. Not only of grand projects whose scale dwarfs everything we have imagined, whose funds deplete federal treasuries and whose real estate transcends national boundaries, but also of the very symbols of human power, directly connected to the destiny of our race
Numerical and symbolic scientific computing
Langer, Ulrich
2011-01-01
The book presents the state of the art and results and also includes articles pointing to future developments. Most of the articles center around the theme of linear partial differential equations. Major aspects are fast solvers in elastoplasticity, symbolic analysis for boundary problems, symbolic treatment of operators, computer algebra, and finite element methods, a symbolic approach to finite difference schemes, cylindrical algebraic decomposition and local Fourier analysis, and white noise analysis for stochastic partial differential equations. Further numerical-symbolic topics range from
Automatic Overset Grid Generation with Heuristic Feedback Control
Robinson, Peter I.
2001-01-01
An advancing front grid generation system for structured Overset grids is presented which automatically modifies Overset structured surface grids and control lines until user-specified grid qualities are achieved. The system is demonstrated on two examples: the first refines a space shuttle fuselage control line until global truncation error is achieved; the second advances, from control lines, the space shuttle orbiter fuselage top and fuselage side surface grids until proper overlap is achieved. Surface grids are generated in minutes for complex geometries. The system is implemented as a heuristic feedback control (HFC) expert system which iteratively modifies the input specifications for Overset control line and surface grids. It is developed as an extension of modern control theory, production rules systems and subsumption architectures. The methodology provides benefits over the full knowledge lifecycle of an expert system for knowledge acquisition, knowledge representation, and knowledge execution. The vector/matrix framework of modern control theory systematically acquires and represents expert system knowledge. Missing matrix elements imply missing expert knowledge. The execution of the expert system knowledge is performed through symbolic execution of the matrix algebra equations of modern control theory. The dot product operation of matrix algebra is generalized for heuristic symbolic terms. Constant time execution is guaranteed.
Sequence-based heuristics for faster annotation of non-coding RNA families.
Weinberg, Zasha; Ruzzo, Walter L
2006-01-01
Non-coding RNAs (ncRNAs) are functional RNA molecules that do not code for proteins. Covariance Models (CMs) are a useful statistical tool to find new members of an ncRNA gene family in a large genome database, using both sequence and, importantly, RNA secondary structure information. Unfortunately, CM searches are extremely slow. Previously, we created rigorous filters, which provably sacrifice none of a CM's accuracy, while making searches significantly faster for virtually all ncRNA families. However, these rigorous filters make searches slower than heuristics could be. In this paper we introduce profile HMM-based heuristic filters. We show that their accuracy is usually superior to heuristics based on BLAST. Moreover, we compared our heuristics with those used in tRNAscan-SE, whose heuristics incorporate a significant amount of work specific to tRNAs, where our heuristics are generic to any ncRNA. Performance was roughly comparable, so we expect that our heuristics provide a high-quality solution that--unlike family-specific solutions--can scale to hundreds of ncRNA families. The source code is available under GNU Public License at the supplementary web site.
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.
Heuristic errors in clinical reasoning.
Rylander, Melanie; Guerrasio, Jeannette
2016-08-01
Errors in clinical reasoning contribute to patient morbidity and mortality. The purpose of this study was to determine the types of heuristic errors made by third-year medical students and first-year residents. This study surveyed approximately 150 clinical educators inquiring about the types of heuristic errors they observed in third-year medical students and first-year residents. Anchoring and premature closure were the two most common errors observed amongst third-year medical students and first-year residents. There was no difference in the types of errors observed in the two groups. Errors in clinical reasoning contribute to patient morbidity and mortality Clinical educators perceived that both third-year medical students and first-year residents committed similar heuristic errors, implying that additional medical knowledge and clinical experience do not affect the types of heuristic errors made. Further work is needed to help identify methods that can be used to reduce heuristic errors early in a clinician's education. © 2015 John Wiley & Sons Ltd.
Lisbon Symbol Database (LSD): Subjective norms for 600 symbols.
Prada, Marília; Rodrigues, David; Silva, Rita R; Garrido, Margarida V
2016-12-01
This article presents subjective rating norms for a new set of 600 symbols, depicting various contents (e.g., transportation, technology, and leisure activities) that can be used by researchers in different fields. Symbols were evaluated for aesthetic appeal, familiarity, visual complexity, concreteness, valence, arousal, and meaningfulness. The normative data were obtained from 388 participants, and no gender differences were found. Descriptive results (means, standard deviations, and confidence intervals) for each symbol in each dimension are presented. Overall, the dimensions were highly correlated. Additionally, participants were asked to briefly describe the meaning of each symbol. The results indicate that the present symbol set is varied, allowing for the selection of exemplars with different levels on the seven examined dimensions. This set of symbols constitutes a tool with potential for research in different areas. The database with all of the symbols is available as supplemental materials.
HMD symbol stabilization concepts
Newman, Richard L.; Greeley, Kevin W.
1995-05-01
Helmet-mounted displays (HMDs) present flight, navigation, and weapon information in the pilot's line of sight. The HMD was developed to allow the pilot to retain aircraft and weapon information while looking off boresight. Symbol stabilization is a key issue for HMDs. In current equipment, the lack of compensation for pilot head motion creates excessive workload during hovering and nap-of-the-earth flight. This high workload translates into excessive training requirements. At the same time, misleading symbology makes interpretation of the height of obstructions impossible. A set of standardized coordinate transformations are necessary for the development of HMD symbology and the control laws. Part of the problem is there is no agreed upon set of definitions or descriptions for how HMD symbols are driven to compensate for pilot head motion. A candidate set of coordinate definitions is proposed to address this issue.
Towards Symbolic Encryption Schemes
DEFF Research Database (Denmark)
Ahmed, Naveed; Jensen, Christian D.; Zenner, Erik
2012-01-01
, namely an authenticated encryption scheme that is secure under chosen ciphertext attack. Therefore, many reasonable encryption schemes, such as AES in the CBC or CFB mode, are not among the implementation options. In this paper, we report new attacks on CBC and CFB based implementations of the well......Symbolic encryption, in the style of Dolev-Yao models, is ubiquitous in formal security models. In its common use, encryption on a whole message is specified as a single monolithic block. From a cryptographic perspective, however, this may require a resource-intensive cryptographic algorithm......-known Needham-Schroeder and Denning-Sacco protocols. To avoid such problems, we advocate the use of refined notions of symbolic encryption that have natural correspondence to standard cryptographic encryption schemes....
Formalising Symbolic Interactionism
de Nooy, W.
2009-01-01
Symbolic interactionism is generally known as a theory typically linked with a qualitative methodology. Recent developments in quantitative social network analysis, however, can analyze processes theorized within this theoretical tradition. Thick description can be complemented with statistical analyses of network structure and dynamics, expanding the scope and detail of results. This paper argues that social network analysis can bridge the divide between qualitative and quantitative analysis...
Political symbols and political transitions
Directory of Open Access Journals (Sweden)
Herrero de Miñón, Miguel
2006-11-01
Full Text Available Politics, Law and Psychology are fields that come together in the symbolic. This text takes evidence from those three areas to develop an analysis of political symbols and political transitions. The development of the analysis goes through three stages. The first succinctly describes the concept of transition and its meaning. The second closely examines the notion of the symbol, in terms of its definition, to explain aspects that allow us to understand it, characterise it and make its functions clear. Finally, from the author's experience as a witness and as an actor, I suggest three ways of understanding symbols in the processes of political transition: as symbols of change, as symbols of acknowledgment, and as symbols of support.
Automated detection of heuristics and biases among pathologists in a computer-based system.
Crowley, Rebecca S; Legowski, Elizabeth; Medvedeva, Olga; Reitmeyer, Kayse; Tseytlin, Eugene; Castine, Melissa; Jukic, Drazen; Mello-Thoms, Claudia
2013-08-01
The purpose of this study is threefold: (1) to develop an automated, computer-based method to detect heuristics and biases as pathologists examine virtual slide cases, (2) to measure the frequency and distribution of heuristics and errors across three levels of training, and (3) to examine relationships of heuristics to biases, and biases to diagnostic errors. The authors conducted the study using a computer-based system to view and diagnose virtual slide cases. The software recorded participant responses throughout the diagnostic process, and automatically classified participant actions based on definitions of eight common heuristics and/or biases. The authors measured frequency of heuristic use and bias across three levels of training. Biases studied were detected at varying frequencies, with availability and search satisficing observed most frequently. There were few significant differences by level of training. For representativeness and anchoring, the heuristic was used appropriately as often or more often than it was used in biased judgment. Approximately half of the diagnostic errors were associated with one or more biases. We conclude that heuristic use and biases were observed among physicians at all levels of training using the virtual slide system, although their frequencies varied. The system can be employed to detect heuristic use and to test methods for decreasing diagnostic errors resulting from cognitive biases.
A novel heuristic algorithm for capacitated vehicle routing problem
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.
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 ﬁrst design the routes...... diﬀerent operators are used to modify the network. Since each iteration of the local search method involves solving a very complex multi-commodity ﬂow problem to route the containers through the network, the ﬂow problem is solved heuristically by use of a fast Lagrange heuristic. Although the Lagrange...... heuristic for ﬂowing containers is 2–5% from the optimal solution, the solution quality is suﬃciently good to guide the variable neighborhood search method in designing the network. Computational results are reported, showing that the developed heuristic is able to ﬁnd improved solutions for large...
Heuristic Biases in Mathematical Reasoning
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…
Heuristic reasoning and relative incompleteness
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
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...
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...
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....
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.
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)
Anthropologists as symbols: Geertz
Directory of Open Access Journals (Sweden)
Aleksandar Bošković
2016-02-01
Full Text Available Clifford Geertz (1926-2006 was certainly one of the most influential anthropologists in the last decades of the 20th century, even though some of his former students (like Rabinow in Slyomovics 2010 claim that he was not very accessible as a person, and that sometimes he did not even care for his students. Somewhat paradoxically, Geertz´s influence on anthropology and related disciplines remained notable even after his death. This paper analyzes interest in aspects of his work over the last decade, as an indicator of transforming a personality into a global cultural symbol.
Concealed identification symbols and nondestructive determination of the identification symbols
Nance, Thomas A.; Gibbs, Kenneth M.
2014-09-16
The concealing of one or more identification symbols into a target object and the subsequent determination or reading of such symbols through non-destructive testing is described. The symbols can be concealed in a manner so that they are not visible to the human eye and/or cannot be readily revealed to the human eye without damage or destruction of the target object. The identification symbols can be determined after concealment by e.g., the compilation of multiple X-ray images. As such, the present invention can also provide e.g., a deterrent to theft and the recovery of lost or stolen objects.
examining the predictive power of the VRIO-Framework and the Recognition Heuristic
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...
Symbolic behavior in regular classrooms. A specification of symbolic and non-symbolic behavior
Directory of Open Access Journals (Sweden)
Stefan eBillinger
2011-06-01
Full Text Available Students’ capabilities to use symbolic information in classroom setting could be expected to influence their possibilities to be active and participating. The development of strategies for teachers to compensate for reduced capability need specific operational definition of symbolic behavior. Fifty-three students, aged 11 to 13 years old, 29 boys and 24 girls, from three classes in the same Swedish compulsory regular school participated in the current study. After a short training sequence 25 students (47% were defined as showing symbolic behavior (symbolic, and 28 students (53% were not (non-symbolic, based on their follow-up test performances. Symbolic and non-symbolic differed significantly on post test performances (p. < .05. Surprisingly, non-symbolic behavior deteriorated their performance, while symbolic enhanced their performance (p. < .05. The results indicate that the operational definition used in the present study may be useful in further studies relating the capability to show symbolic behavior and students’ activity and participation in classroom settings.
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.
Mathematical symbol hypothesis recognition with rejection option
Julca-Aguilar , Frank; Hirata , Nina ,; Viard-Gaudin , Christian; Mouchère , Harold; Medjkoune , Sofiane
2014-01-01
International audience; In the context of handwritten mathematical expressions recognition, a first step consist on grouping strokes (segmentation) to form symbol hypotheses: groups of strokes that might represent a symbol. Then, the symbol recognition step needs to cope with the identification of wrong segmented symbols (false hypotheses). However, previous works on symbol recognition consider only correctly segmented symbols. In this work, we focus on the problem of mathematical symbol reco...
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, ...
Sound Symbolism in Basic Vocabulary
Directory of Open Access Journals (Sweden)
Søren Wichmann
2010-04-01
Full Text Available The relationship between meanings of words and their sound shapes is to a large extent arbitrary, but it is well known that languages exhibit sound symbolism effects violating arbitrariness. Evidence for sound symbolism is typically anecdotal, however. Here we present a systematic approach. Using a selection of basic vocabulary in nearly one half of the world’s languages we find commonalities among sound shapes for words referring to same concepts. These are interpreted as due to sound symbolism. Studying the effects of sound symbolism cross-linguistically is of key importance for the understanding of language evolution.
Familiarity and recollection in heuristic decision making.
Schwikert, Shane R; Curran, Tim
2014-12-01
Heuristics involve the ability to utilize memory to make quick judgments by exploiting fundamental cognitive abilities. In the current study we investigated the memory processes that contribute to the recognition heuristic and the fluency heuristic, which are both presumed to capitalize on the byproducts of memory to make quick decisions. In Experiment 1, we used a city-size comparison task while recording event-related potentials (ERPs) to investigate the potential contributions of familiarity and recollection to the 2 heuristics. ERPs were markedly different for recognition heuristic-based decisions and fluency heuristic-based decisions, suggesting a role for familiarity in the recognition heuristic and recollection in the fluency heuristic. In Experiment 2, we coupled the same city-size comparison task with measures of subjective preexperimental memory for each stimulus in the task. Although previous literature suggests the fluency heuristic relies on recognition speed alone, our results suggest differential contributions of recognition speed and recollected knowledge to these decisions, whereas the recognition heuristic relies on familiarity. Based on these results, we created a new theoretical framework that explains decisions attributed to both heuristics based on the underlying memory associated with the choice options. PsycINFO Database Record (c) 2014 APA, all rights reserved.
How the twain can meet: Prospect theory and models of heuristics in risky choice.
Pachur, Thorsten; Suter, Renata S; Hertwig, Ralph
2017-03-01
Two influential approaches to modeling choice between risky options are algebraic models (which focus on predicting the overt decisions) and models of heuristics (which are also concerned with capturing the underlying cognitive process). Because they rest on fundamentally different assumptions and algorithms, the two approaches are usually treated as antithetical, or even incommensurable. Drawing on cumulative prospect theory (CPT; Tversky & Kahneman, 1992) as the currently most influential instance of a descriptive algebraic model, we demonstrate how the two modeling traditions can be linked. CPT's algebraic functions characterize choices in terms of psychophysical (diminishing sensitivity to probabilities and outcomes) as well as psychological (risk aversion and loss aversion) constructs. Models of heuristics characterize choices as rooted in simple information-processing principles such as lexicographic and limited search. In computer simulations, we estimated CPT's parameters for choices produced by various heuristics. The resulting CPT parameter profiles portray each of the choice-generating heuristics in psychologically meaningful ways-capturing, for instance, differences in how the heuristics process probability information. Furthermore, CPT parameters can reflect a key property of many heuristics, lexicographic search, and track the environment-dependent behavior of heuristics. Finally, we show, both in an empirical and a model recovery study, how CPT parameter profiles can be used to detect the operation of heuristics. We also address the limits of CPT's ability to capture choices produced by heuristics. Our results highlight an untapped potential of CPT as a measurement tool to characterize the information processing underlying risky choice. Copyright © 2017 Elsevier Inc. All rights reserved.
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.
Special relativity a heuristic approach
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
Lassègue, Jean
2008-03-01
In his article 'A New View of Language, Emotion and the Brain,' Dan Shanahan claims that the post-war Cognitive Turn focused mainly on information processing and that little attention was paid to the dramatic role played by emotion in human cognition. One key argument in his defence of a more comprehensive view of human cognition rests upon the idea that the process of symbolization--a unique capacity only developed by humans--combines, right from the start, information processing and feelings. The author argues that any theory ignoring this fact would miss the whole point, just as mainstream cognitive science has done since Noam Chomsky published Syntactic Structures, exactly 50 years ago.
Directory of Open Access Journals (Sweden)
Daniela Sacco
2015-11-01
Full Text Available An excerpt from Sergei M. Eisenstein's memoirs describing a night visit to the museum of Chichén Itzá in Mexico is set forth as a real life example reflecting, both from a visual and theoretical perspective, the architecture of Aby Warburg's Bilderatlas Mnemosyne and his concept of Denkraum. Drawing upon Warburg's own writings and F. T. Vischer's theory of symbol, the paper looks at Eisenstein's experience at the museum as highlighting the dynamic relation between man's religious/magical and scientific/rational psychic poles, and the in-between space of thought inherent to the concept of Denkraum and visually represented by the empty dark intervals separating the images in the Bilderatlas. Adding significance to its argumentation, the paper also hints at an affinity between Eisenstein's film montaging and Warburg's image assembling criteria.
Scientific applications of symbolic computation
International Nuclear Information System (INIS)
Hearn, A.C.
1976-02-01
The use of symbolic computation systems for problem solving in scientific research is reviewed. The nature of the field is described, and particular examples are considered from celestial mechanics, quantum electrodynamics and general relativity. Symbolic integration and some more recent applications of algebra systems are also discussed [fr
Symbolic Time Separation of Events
DEFF Research Database (Denmark)
Amon, Tod; Hulgaard, Henrik
1999-01-01
We extend the TSE~\\cite{Hulgaard95} timing analysis algorithm into the symbolic domain, that is, we allow symbolic variables to be used to specify unknown parameters of the model (essentially, unknown delays) and verification algorithms which are capable of identifying not just failure or success...
Directory of Open Access Journals (Sweden)
Mohamad reza Yousefi
2013-11-01
Full Text Available Abstract Symbol from the perspective of rhetorical word, is phrase or sentence that apparent meaning, also inspires to reader a wide range of semantic.Since exploring the complex social and political ideas in the most mysticalway and indirectreflectionsocial and political thoughts symbolically is easier, so the symbol and symbolism especially in Persian literatureespeciallyin the realm of Persian poetry, has a special appearance.In addition to the factors mentioned in the contemporary literature, according familiar in literature and the emergence of particular schools interest toambiguoussymbolization has spreadfurther, especially the symbol has all the features of art ambiguity in the poem and it isone the major factors causing uncertainty.Thus, the precise definitions and symbols of contemporary poetry could be dominant in the unwinding ambiguous symbol detection of cryptic allusions and metaphors that matches the cursor symbol to help readers. In the literature, especially language poetry, the inability of language toreflecting obscure mystical ideas, avoid to directexpression of political and social concerns of the reader in the course of participate to creation ambiguous literary works is the main motivation towards symbol and symbolization.According widespread use of symbol and its different of species can be viewed from different perspectives.The creation of ambiguity is the main purposes of using symbols (especially in poetry, so many poets have tried to achieve this goal have to formation of similar symbols and the explanation and resolution of this issue can open new window for understanding the poetry in front of an audience. In this paper examines the ambiguity of symbols in terms of its precise boundaries are reviewed. Ambiguity is one of the important processes and also is the key Iranian poetry its means is today poetry. In such poetry ambiguity is a need to explore the new world from a different perspective, or explore this
Social biases determine spatiotemporal sparseness of ciliate mating heuristics.
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
Social biases determine spatiotemporal sparseness of ciliate mating heuristics
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
Application of heuristic and machine-learning approach to engine model calibration
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.
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)
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)
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.
Symbolic PathFinder: Symbolic Execution of Java Bytecode
Pasareanu, Corina S.; Rungta, Neha
2010-01-01
Symbolic Pathfinder (SPF) combines symbolic execution with model checking and constraint solving for automated test case generation and error detection in Java programs with unspecified inputs. In this tool, programs are executed on symbolic inputs representing multiple concrete inputs. Values of variables are represented as constraints generated from the analysis of Java bytecode. The constraints are solved using off-the shelf solvers to generate test inputs guaranteed to achieve complex coverage criteria. SPF has been used successfully at NASA, in academia, and in industry.
Serial Position Effects in the Identification of Letters, Digits, and Symbols
Tydgat, Ilse; Grainger, Jonathan
2009-01-01
In 6 experiments, the authors investigated the form of serial position functions for identification of letters, digits, and symbols presented in strings. The results replicated findings obtained with the target search paradigm, showing an interaction between the effects of serial position and type of stimulus, with symbols generating a distinct…
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.
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.
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
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...
Subrepresentation semirings and an analog of 6j-symbols
International Nuclear Information System (INIS)
Kwon, Namhee; Sage, Daniel S.
2008-01-01
Let V be a complex representation of the compact group G. The subrepresentation semiring associated to V is the set of subrepresentations of the algebra of linear endomorphisms of V with operations induced by the matrix operations. The study of these semirings has been motivated by recent advances in materials science, in which the search for microstructure-independent exact relations for physical properties of composites has been reduced to the study of these semirings for the rotation group SO(3). In this case, the structure constants for subrepresentation semirings can be described explicitly in terms of the 6j-symbols familiar from the quantum theory of angular momentum. In this paper, we investigate subrepresentation semirings for the class of quasisimply reducible groups defined by Mackey ['Multiplicity free representations of finite groups', Pac. J. Math. 8, 503 (1958)]. We introduce a new class of symbols called twisted 6j-symbols for these groups, and we explicitly calculate the structure constants for subrepresentation semirings in terms of these symbols. Moreover, we show that these symbols satisfy analog of the standard properties of classical 6j-symbols
A single cognitive heuristic process meets the complexity of domain-specific moral heuristics.
Dubljević, Veljko; Racine, Eric
2014-10-01
The inherence heuristic (a) offers modest insights into the complex nature of both the is-ought tension in moral reasoning and moral reasoning per se, and (b) does not reflect the complexity of domain-specific moral heuristics. Formal and general in nature, we contextualize the process described as "inherence heuristic" in a web of domain-specific heuristics (e.g., agent specific; action specific; consequences specific).
Social Symbolic Work in Context
DEFF Research Database (Denmark)
Brincker, Benedikte
‘the good organisation’ may offer a supportive organisational framework for social symbolic work, thus promoting regional development in peripheral and poorly developed regions. Exploring what qualifies as a ‘good organisation’, the paper identifies three key elements: management, motivation......This paper reports on a research project that explores social symbolic work. The social symbolic work in question seeks to introduce education in entrepreneurship into the school curriculum in a remote part of Greenland – in order to contribute to regional development. The paper investigates how...
Proportional Symbol Mapping in R
Directory of Open Access Journals (Sweden)
Susumu Tanimura
2006-01-01
Full Text Available Visualization of spatial data on a map aids not only in data exploration but also in communication to impart spatial conception or ideas to others. Although recent carto-graphic functions in R are rapidly becoming richer, proportional symbol mapping, which is one of the common mapping approaches, has not been packaged thus far. Based on the theories of proportional symbol mapping developed in cartography, the authors developed some functions for proportional symbol mapping using R, including mathematical and perceptual scaling. An example of these functions demonstrated the new expressive power and options available in R, particularly for the visualization of conceptual point data.
Heuristics for multiobjective multiple sequence alignment.
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
An Efficient Primitive-Based Method to Recognize Online Sketched Symbols with Autocompletion
Directory of Open Access Journals (Sweden)
Wei Deng
2015-01-01
Full Text Available We present a new structural method of sketched symbol recognition, which aims to recognize a hand-drawn symbol before it is fully completed. It is invariant to scale, stroke number, and order. We also present two novel descriptors to represent the spatial distribution between two primitives. One is invariant to rotation and the other is not. Then a symbol is represented as a set of descriptors. The distance between the input symbol and the template one is calculated based on the assignment problem. Moreover, a fast nearest neighbor (NN search algorithm is proposed for recognition. The method achieves a satisfactory recognition rate in real time.
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
National Research Council Canada - National Science Library
Kennedy, William G; Trafton, J. G
2007-01-01
What are the characteristics of long-term learning? We investigated the characteristics of long-term, symbolic learning using the Soar and ACT-R cognitive architectures running cognitive models of two simple tasks...
Applications of symbolic algebraic computation
International Nuclear Information System (INIS)
Brown, W.S.; Hearn, A.C.
1979-01-01
This paper is a survey of applications of systems for symbomic algebraic computation. In most successful applications, calculations that can be taken to a given order by hand are then extended one or two more orders by computer. Furthermore, with a few notable exceptins, these applications also involve numerical computation in some way. Therefore the authors emphasize the interface between symbolic and numerical computation, including: 1. Computations with both symbolic and numerical phases. 2. Data involving both the unpredictible size and shape that typify symbolic computation and the (usually inexact) numerical values that characterize numerical computation. 3. Applications of one field to the other. It is concluded that the fields of symbolic and numerical computation can advance most fruitfully in harmony rather than in competition. (Auth.)
Symbol Recognition using Spatial Relations
K.C., Santosh; Lamiroy, Bart; Wendling, Laurent
2012-01-01
International audience; In this paper, we present a method for symbol recognition based on the spatio-structural description of a 'vocabulary' of extracted visual elementary parts. It is applied to symbols in electrical wiring diagrams. The method consists of first identifying vocabulary elements into different groups based on their types (e.g., circle, corner ). We then compute spatial relations between the possible pairs of labelled vocabulary types which are further used as a basis for bui...
The Probability Heuristics Model of Syllogistic Reasoning.
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…
Cooperative heuristic multi-agent planning
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
"A Heuristic for Visual Thinking in History"
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…
Effective Heuristics for New Venture Formation
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
Religion, Heuristics, and Intergenerational Risk Management
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.
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.
22 CFR 42.11 - Classification symbols.
2010-04-01
... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Classification symbols. 42.11 Section 42.11... NATIONALITY ACT, AS AMENDED Classification and Foreign State Chargeability § 42.11 Classification symbols. A... visa symbol to show the classification of the alien. Immigrants Symbol Class Section of law Immediate...
Symbol synchronization in convolutionally coded systems
Baumert, L. D.; Mceliece, R. J.; Van Tilborg, H. C. A.
1979-01-01
Alternate symbol inversion is sometimes applied to the output of convolutional encoders to guarantee sufficient richness of symbol transition for the receiver symbol synchronizer. A bound is given for the length of the transition-free symbol stream in such systems, and those convolutional codes are characterized in which arbitrarily long transition free runs occur.
7 CFR 29.1008 - Combination symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Combination symbols. 29.1008 Section 29.1008..., 13, 14 and Foreign Type 92) § 29.1008 Combination symbols. A color or group symbol used with another symbol to form the third factor of a grademark to denote a particular side or characteristic of the...
Gene selection heuristic algorithm for nutrigenomics studies.
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.
Comparison of Heuristics for Inhibitory Rule Optimization
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.
Madjid, F. Hadi; Myers, John M.
2016-10-01
The world runs on networks over which signals communicate sequences of symbols, e.g. numerals. Examining both engineered and natural communications networks reveals an unsuspected order that depends on contact with an unpredictable entity. This order has three roots. The first is a proof within quantum theory that no evidence can ever determine its explanation, so that an agent choosing an explanation must do so unpredictably. The second root is the showing that clocks that step computers do not "tell time" but serve as self-adjusting symbol-handling agents that regulate "logically synchronized" motion in response to unpredictable disturbances. Such a clock-agent has a certain independence as well as the capacity to communicate via unpredictable symbols with other clock-agents and to adjust its own tick rate in response to that communication. The third root is the noticing of unpredictable symbol exchange in natural systems, including the transmission of symbols found in molecular biology. We introduce a symbol-handling agent as a role played in some cases by a person, for example a physicist who chooses an explanation of given experimental outcomes, and in other cases by some other biological entity, and in still other cases by an inanimate device, such as a computer-based detector used in physical measurements. While we forbear to try to explain the propensity of agents at all levels from cells to civilizations to form and operate networks of logically synchronized symbol-handling agents, we point to this propensity as an overlooked cosmic order, an order structured by the unpredictability ensuing from the proof. Appreciating the cosmic order leads to a conception of agency that replaces volition by unpredictability and reconceives the notion of objectivity in a way that makes a place for agency in the world as described by physics. Some specific implications for physics are outlined.
A review of parameters and heuristics for guiding metabolic pathfinding.
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.
Multiobjective hyper heuristic scheme for system design and optimization
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.
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.
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.
The symbolic economy of drugs.
Lentacker, Antoine
2016-02-01
This essay reviews four recent studies representing a new direction in the history of pharmaceuticals and pharmaceutical science. To this end, it introduces the notion of a symbolic economy of drugs, defined as the production, circulation, and reception of signs that convey information about drugs and establish trust in them. Each of the studies under review focuses on one key signifier in this symbolic economy, namely the brand, the patent, the clinical trial, and the drug itself. Drawing on Pierre Bourdieu's theory of the economy of symbolic goods, I conceptualize these signifiers as symbolic assets, that is, as instruments of communication and credit, delivering knowledge, carrying value, and producing authority. The notion of a symbolic economy is offered with a threefold intention. First, I introduce it in order to highlight the implications of historical and anthropological work for a broader theory of the economy of drugs, thus suggesting a language for interdisciplinary conversations in the study of pharmaceuticals. Second, I deploy it in an attempt to emphasize the contributions of the recent scholarship on drugs to a critical understanding of our own contemporary ways of organizing access to drugs and information about drugs. Finally, I suggest ways in which it might be of use to scholars of other commodities and technologies.
Simple heuristics and rules of thumb: where psychologists and behavioural biologists might meet.
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.
Meta-Heuristics for Dynamic Lot Sizing: a review and comparison of solution approaches
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,
Comparison of Heuristics for Inhibitory Rule Optimization
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.
The mathematica guidebook for symbolics
Trott, Michael
2006-01-01
Mathematica is today's most advanced technical computing system. It features a rich programming environment, two-and three-dimensional graphics capabilities and hundreds of sophisticated, powerful programming and mathematical functions using state-of-the-art algorithms. Combined with a user-friendly interface, and a complete mathematical typesetting system, Mathematica offers an intuitive easy-to-handle environment of great power and utility. "The Mathematica GuideBook for Symbolics" (code and text fully tailored for Mathematica 5.1) deals with Mathematica's symbolic mathematical capabilities. Structural and mathematical operations on single and systems of polynomials are fundamental to many symbolic calculations and they are covered in considerable detail. The solution of equations and differential equations, as well as the classical calculus operations (differentiation, integration, summation, series expansion, limits) are exhaustively treated. Generalized functions and their uses are discussed. In addition...
Schneider, Michael; Beeres, Kassandra; Coban, Leyla; Merz, Simon; Susan Schmidt, S; Stricker, Johannes; De Smedt, Bert
2017-05-01
Many studies have investigated the association between numerical magnitude processing skills, as assessed by the numerical magnitude comparison task, and broader mathematical competence, e.g. counting, arithmetic, or algebra. Most correlations were positive but varied considerably in their strengths. It remains unclear whether and to what extent the strength of these associations differs systematically between non-symbolic and symbolic magnitude comparison tasks and whether age, magnitude comparison measures or mathematical competence measures are additional moderators. We investigated these questions by means of a meta-analysis. The literature search yielded 45 articles reporting 284 effect sizes found with 17,201 participants. Effect sizes were combined by means of a two-level random-effects regression model. The effect size was significantly higher for the symbolic (r = .302, 95% CI [.243, .361]) than for the non-symbolic (r = .241, 95% CI [.198, .284]) magnitude comparison task and decreased very slightly with age. The correlation was higher for solution rates and Weber fractions than for alternative measures of comparison proficiency. It was higher for mathematical competencies that rely more heavily on the processing of magnitudes (i.e. mental arithmetic and early mathematical abilities) than for others. The results support the view that magnitude processing is reliably associated with mathematical competence over the lifespan in a wide range of tasks, measures and mathematical subdomains. The association is stronger for symbolic than for non-symbolic numerical magnitude processing. So symbolic magnitude processing might be a more eligible candidate to be targeted by diagnostic screening instruments and interventions for school-aged children and for adults. © 2016 John Wiley & Sons Ltd.
On the Symbolic Verification of Timed Systems
DEFF Research Database (Denmark)
Moeller, Jesper; Lichtenberg, Jacob; Andersen, Henrik Reif
1999-01-01
This paper describes how to analyze a timed system symbolically. That is, given a symbolic representation of a set of (timed) states (as an expression), we describe how to determine an expression that represents the set of states that can be reached either by firing a discrete transition...... or by advancing time. These operations are used to determine the set of reachable states symbolically. We also show how to symbolically determine the set of states that can reach a given set of states (i.e., a backwards step), thus making it possible to verify TCTL-formulae symbolically. The analysis is fully...... symbolic in the sense that both the discrete and the continuous part of the state space are represented symbolically. Furthermore, both the synchronous and asynchronous concurrent composition of timed systems can be performed symbolically. The symbolic representations are given as formulae expressed...
Symbolic Dynamics of Reanalysis Data
Larson, J. W.; Dickens, P. M.
2003-12-01
Symbolic dynamics1 is the study of sequences of symbols belonging to a discrete set of elements, the most commmon example being a sequence of ones and zeroes. Often the set of symbols is derived from a timeseries of a continuous variable through the introduction of a partition function--a process called symbolization. Symbolic dynamics has been used widely in the physical sciences; a geophysical example being the application of C1 and C2 complexity2 to hourly precipitation station data3. The C1 and C2 complexities are computed by examining subsequences--or words--of fixed length L in the limit of large values of L. Recent advances in information theory have led to techniques focused on the growth rate of the Shannon entropy and its asymptotic behavior in the limit of long words--levels of entropy convergence4. The result is a set of measures one can use to quantify the amount of memory stored in the sequence, whether or not an observer is able to synchronize to the sequence, and with what confidence it may be predicted. These techniques may also be used to uncover periodic behavior in the sequence. We are currently applying complexity theory and levels of entropy convergence to gridpoint timeseries from the NCAR/NCEP 50-year reanalysis5. Topics to be discussed include: a brief introduction to symbolic dynamics; a description of the partition function/symbolization strategy; a discussion of C1 and C2 complexity and entropy convergence rates and their utility; and example applications of these techniques to NCAR/NCEP 50-reanalyses gridpoint timeseries, resulting in maps of C1 and C2 complexities and entropy convergence rates. Finally, we will discuss how these results may be used to validate climate models. 1{Hao, Bai-Lin, Elementary Symbolic Dynamics and Chaos in Dissipative Systems, Wold Scientific, Singapore (1989)} 2{d'Alessandro, G. and Politi, A., Phys. Rev. Lett., 64, 1609-1612 (1990).} 3{Elsner, J. and Tsonis, A., J. Atmos. Sci., 50, 400-405 (1993).} 4
An efficient heuristic for the multi-compartment vehicle routing problem
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...
The Effect of Incentive Structure on Heuristic Decision Making: The Proportion Heuristic
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...
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...
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...
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.
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.
Dream Symbol or Dream Process?
Himelstein, Philip
1984-01-01
Discusses the relationship of the symbolic content of dreams to the theory of the dream in psychoanalysis and Gestalt therapy. Points out that the utility of the dream depends upon the techniques of the therapist and not on the validity of the underlying theory of the dream. (LLL)
Symbolic power, robotting, and surveilling
DEFF Research Database (Denmark)
Skovsmose, Ole
2012-01-01
describes as it prioritises is discussed with reference to robotting and surveillance. In general, the symbolic power of mathematics and formal languages is summarised through the observations: that mathematics treats parts and properties as autonomous, that it dismembers what it addresses and destroys...
RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM
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...
A heuristic forecasting model for stock decision
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. ...
Psychology into economics: fast and frugal heuristics
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...
Arational heuristic model of economic decision making
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 ...
Social heuristics shape intuitive cooperation.
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.
Heuristic thinking makes a chemist smart.
Graulich, Nicole; Hopf, Henning; Schreiner, Peter R
2010-05-01
We focus on the virtually neglected use of heuristic principles in understanding and teaching of organic chemistry. As human thinking is not comparable to computer systems employing factual knowledge and algorithms--people rarely make decisions through careful considerations of every possible event and its probability, risks or usefulness--research in science and teaching must include psychological aspects of the human decision making processes. Intuitive analogical and associative reasoning and the ability to categorize unexpected findings typically demonstrated by experienced chemists should be made accessible to young learners through heuristic concepts. The psychology of cognition defines heuristics as strategies that guide human problem-solving and deciding procedures, for example with patterns, analogies, or prototypes. Since research in the field of artificial intelligence and current studies in the psychology of cognition have provided evidence for the usefulness of heuristics in discovery, the status of heuristics has grown into something useful and teachable. In this tutorial review, we present a heuristic analysis of a familiar fundamental process in organic chemistry--the cyclic six-electron case, and we show that this approach leads to a more conceptual insight in understanding, as well as in teaching and learning.
Heuristics as Bayesian inference under extreme priors.
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.
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.
Best-First Heuristic Search for Multicore Machines
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
Static and Dynamic Path Planning Using Incremental Heuristic Search
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...
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 ﬁnding 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 efﬁcient one. The results are obtained by drift...
Symbol signing design for older drivers
1997-07-01
This project evaluated the effectiveness of symbol traffic signs for young, middle-aged and elderly drivers. Daytime legibility distance and comprehension of 85 symbols in the Manual on Uniform Traffic Control Devices (MUTCD) were measured. Legibilit...
READING TEXT POPULAR SONG INDONESIA: STUDY SEMIOTIC-HEURISTIC
Directory of Open Access Journals (Sweden)
Rika Widawati
2015-02-01
Full Text Available Abstract. This paper is the result of the research that based on the phenomenon in Indonesia today. The texts of Indonesian popular songs that part of the literature which create new vocabularies or make the modification of old language. The structure of this work seems to be odd. It means the new vocabulary is different from the standard of Indonesian structure. The aim of this descriptions are the correction of (1 the mistake of the phenomenon in the text of Indonesian popular songs (2 the meaning of indonesian popular songs must be based on reading of semiotics and heuristic. To describe this purpose, we use semiotic theory and structuralism. While the sources of this research are adopted from the texts of Indonesian popular songs which are published in 2000-2010 periode. Both Indonesian popular songs, either good songs or odd songs which has the value of good literature, namely which consist of good structure, poetic, romantic with symbolic style. Heuristically readings of the two text Indonesian songs indicate violations of linguistic rules either syntagmatic, paradigmatic, meaningfulness relations and composition. Keywords: the text of Indonesian popular song, semiotic, heuristic Abstrak. Tulisan ini merupakan hasil penelitian yang didasari oleh fenomena bahwa dewasa ini teks lagu populer Indonesia sebagai bagian dari karya sastra banyak menampilkan kosakata baru ataupun modifikasi kosakata lama, dengan komposisi yang dipandang “menyimpang” dari kaidah tata bahasa baku maupun konvensi sastra. Tulisan ini bertujuan untuk mendeskripsikan (1 fenomena struktur kebahasaan dalam teks lagu populer Indonesia dan (2 makna teks lagu populer Indonesia berdasarkan pembacaan semiotik-heuristik. Untuk mendeskripsikan hal tersebut digunakan teori semiotik dan strukturalisme. Sementara sumber data penelitian ini adalah teks lagu populer Indonesia tahun 2000 – 2010. Baik lagu-lagu yang dipandang menyimpang dari kaidah atau konvensi sastra maupun
Consumers recall and recognition for brand symbols
Subhani, Muhammad Imtiaz; Hasan, Syed Akif; Osman, Ms. Amber
2012-01-01
Brand Symbols are important for any brand in helping consumers to remember one’s brand at the point of purchase. In advertising different ways are used to grab attention in consumers’ mind and majorly it’s through brand recall and recognition. This research captivates the Brand Symbol concept and determines whether symbols play an important role in creating a differential impact with other brands. Secondly, it also answers that whether brand symbol is the cause of creating positive associatio...
The Analysis of Mythological Symbols in Shahnameh
Directory of Open Access Journals (Sweden)
موسی پرنیان
2012-05-01
Full Text Available Recognizing symbols of Shahnameh requires an understanding of the context and condition of creation and emergence of symbol, myth and epic. Symbol has a relationship with consciousness and unconsciousness of man and constitutes the language of mythologies, legends, and epics. Thus the language of mythological and epic works is symbolic. The main theme in Iranian mythologies is the dual nature of creation, and during the passage from myth to epic the conflict between the two forces of good and evil appear in various aspects of existence. Some characters that represent symbolic and coded concepts more than other elements can be considered as symbols of the evolution of gods to kings and against them there are devilish kings as symbols of drought (Apush. The other symbolic elements analyzed in this study are: epic-romance stories, imaginary creatures, symbolic dreams of kings and heroes, symbolic numbers, symbolic patterns of flags, the symbolism of water, fire and charisma The findings of the study illustrate that people, more than other elements, are the constitutive elements of mythological symbols, and the tension between these human elements depicts the mutual conflict between good and evil in Ferdowsiâs Shahnameh. Like other elements, symbolic characters (especially kings are of symbolic value and constitute a part of constructing elements of mythological symbols in Shahname. Moreover their reputation is dependent on the extent of their benefit from âGod charismaâ as the most pivotal element of their personality. Kings like Afrasiab and Zahak, due to lack of it, are the most disreputable kings. On the other hand, Fereidoon and Kaikhosro are on the top of the most reputable kings because of continuous benefit from that. This study has been conducted on the basis of library resources and has applied a descriptive-analytic method.
Sound-Symbolism Boosts Novel Word Learning
Lockwood, Gwilym; Dingemanse, Mark; Hagoort, Peter
2016-01-01
The existence of sound-symbolism (or a non-arbitrary link between form and meaning) is well-attested. However, sound-symbolism has mostly been investigated with nonwords in forced choice tasks, neither of which are representative of natural language. This study uses ideophones, which are naturally occurring sound-symbolic words that depict sensory…
7 CFR 29.3012 - Color symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Color symbols. 29.3012 Section 29.3012 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... Color symbols. As applied to Burley, single color symbols are as follows: L—buff, F—tan, R—red, D—dark...
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Symbol (S). 29.1066 Section 29.1066 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... Type 92) § 29.1066 Symbol (S). As applied to Flue-cured tobacco the symbol (S) when used (a) as the...
7 CFR 29.3510 - Color symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Color symbols. 29.3510 Section 29.3510 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... Type 95) § 29.3510 Color symbols. As applied to Dark Air-cured tobacco, color symbols are L—light brown...
7 CFR 29.2259 - Color symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Color symbols. 29.2259 Section 29.2259 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... symbols. As applied to this type, color symbols are: L—light brown, F—medium brown, D—dark brown, M—mixed...
7 CFR 29.1007 - Color symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Color symbols. 29.1007 Section 29.1007 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... Type 92) § 29.1007 Color symbols. As applied to flue-cured tobacco, color symbols are L—lemon, F—orange...
Symbol-String Sensitivity and Children's Reading
Pammer, Kristen; Lavis, Ruth; Hansen, Peter; Cornelissen, Piers L.
2004-01-01
In this study of primary school children, a novel "symbol-string" task is used to assess sensitivity to the position of briefly presented non-alphabetic but letter-like symbols. The results demonstrate that sensitivity in the symbol-string task explains a unique proportion of the variability in children's contextual reading accuracy. Moreover,…
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.
Reciprocity Laws for the Higher Tame Symbol and the Witt Symbol on an Algebraic Surface
Syder, Kirsty
2013-01-01
Parshin's higher Witt pairing on an arithmetic surface can be combined with the higher tame pairing to form a symbol taking values in the absolute abelian Galois group of the function field. We prove reciprocity laws for this symbol using techniques of Morrow for the Witt symbol and Romo for the higher tame symbol.
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
Alternate symbol inversion for improved symbol synchronization in convolutionally coded systems
Simon, M. K.; Smith, J. G.
1980-01-01
Inverting alternate symbols of the encoder output of a convolutionally coded system provides sufficient density of symbol transitions to guarantee adequate symbol synchronizer performance, a guarantee otherwise lacking. Although alternate symbol inversion may increase or decrease the average transition density, depending on the data source model, it produces a maximum number of contiguous symbols without transition for a particular class of convolutional codes, independent of the data source model. Further, this maximum is sufficiently small to guarantee acceptable symbol synchronizer performance for typical applications. Subsequent inversion of alternate detected symbols permits proper decoding.
Between Agency and Symbolic Violence
DEFF Research Database (Denmark)
Pedersen, Bodil Maria
The Role of Symbolic Violence in Research and Policy: In Denmark it is a common assumption that gender equality, especially concerning sexual practices and other personal relations, has been fully accomplished. Consequently, public as well as professional discourses and practices concerning rape...... - could be exposed to sexualised violence. Another example is that therapy and other forms of help do not draw on critical perspectives on gender conditions. Rather, frequently and in essencialising approaches to concepts of femininity and masculinity, they individualise or over...... of this kind in public policies concerning gendered and gendering violence, it is necessary to develop critiques of aspects of symbolic violence (Beate Krais 1993), that have been conceptualised as ‘genderless gender’ by Suvi Ronkainen (2001). Thus statistic and other forms of research approaches wishing...
Prediction-based dynamic load-sharing heuristics
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.
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.
DEFF Research Database (Denmark)
Luckow, Kasper Søe; Păsăreanu, Corina
2014-01-01
We describe Symbolic PathFinder v7 in terms of its updated design addressing the changes of Java PathFinder v7 and of its new optimization when computing path conditions. Furthermore, we describe the Symbolic Execution Tree Extension; a newly added feature that allows for outputting the symbolic...... execution tree that characterizes the execution paths covered during symbolic execution. The new extension can be tailored to the needs of subsequent analyses/processing facilities, and we demonstrate this by presenting SPF-Visualizer, which is a tool for customizable visualization of the symbolic execution...
VULTURES: EXEGESIS OF A SYMBOL
Directory of Open Access Journals (Sweden)
Maura Andreoni
2016-12-01
Full Text Available Depending on the different cultures and historical periods, vultures have been considered both impure or sacred. But, since they usually do not prey upon living animals, their symbolic dimension, associated to the idea of purification, is present in many myths, religions, burial praxis of ancient populations and remains in some religions today.In the ancient Mediterranean civilizations, they have been carved in some of the most ancient bas-reliefs of the history by stone age people; were sacred to Egyptians, who even took them as symbol of gods; in the classical times they were supposed to be all feminine and breed by parthenogenesis, and therefore appreciated by some early Christian authors, who came to comparing them even to the Virgin Mary; they have been studied and described by ancient scientists, naturalists, philosophers, playwrights; involved in many of the most enduring Greek and Roman myths and legends; many parts of their body were considered as a medicine or even a talisman for happiness; and they were so proverbial for Romans to become even one of the symbols of the founding of Rome itself.But they were also so fragile that perfumes, myrrh and pomegranates were supposed to be lethal for them ….
Quantifying Heuristic Bias: Anchoring, Availability, and Representativeness.
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
Contribution to comprehending symbolism and meaning of architectural form
Directory of Open Access Journals (Sweden)
Alihodžić Rifat
2017-01-01
Full Text Available Architectural form and space, from the very beginning of their creation, weren’t only elements reflecting mere act of building; as the act of human actions, they included proper symbolic presentation of a creator's perception of the world. The initial point is that each physical, therefore each architectural form, speaks volumes on more than just their purpose, so it can have symbolic meanings, being proved in history of architecture for such a long time. While observing architectural form, these two questions impose. The first question refers to identifying usable purpose of particular facility, in other words, its function. The second question imposes to identify what are the things that we are reminded of concerning that particular facility. This second question represents search for the meaning in each form that mankind instinctively longs to identify in order to comprehend the world we live in. No matter if we are in natural or building area, everything we are surrounded by has got specific forms recalling certain associations. The aim of this paper is to indicate that pictures appearing as a consequence of close forms and designs represent associations and they should not be compared to symbols. The goal of this research is to contribute to clearer seeing of symbolism of architectural form, in which situations it exists and whether it exists in contemporary architectural forms. This work is based on elements of Gestalt observation theory.
Micro sociological study of family relationships: heuristic potential theoretical principles
Directory of Open Access Journals (Sweden)
O. P. Zolotnyik
2015-03-01
Full Text Available This article is devoted to demonstrate the heuristic potential of theoretical principles by microsoсiological analysis of one of the indicators of family – family relations. Theoretical analysis of the interaction experience is quite large, but there is the question about it’s possibility to describe the specifics of that relationship that arise in family interaction. The study of family relationships requires an integrated approach to the comprehension of many related components: system of spouses value orientations, family life cycle, socioeconomic living conditions of couple. However, the accentuation exactly on actionbehavioral aspect allows to make assumptions about correlations between: success of family interaction and microclimate in the family; satisfaction level of interpersonal interaction and overall satisfaction with marriage, familiarity of family interaction and density of childbearing, and so on. The presentation of microsoсiological theoretical achievements will be carried out of sociological schools, orientations and their members that are the most popular references in this area. this paper will presents the theory of exchange, supporters of symbolic interactionism, dramatic and etnometodological approach and family systems theory.
Ionizing-radiation warning - Supplementary symbol
International Nuclear Information System (INIS)
2007-01-01
This International Standard specifies the symbol to warn of the presence of a dangerous level of ionizing radiation from a high-level sealed radioactive source that can cause death or serious injury if handled carelessly. This symbol is not intended to replace the basic ionizing radiation symbol [ISO 361, ISO 7010:2003, Table 1 (Reference number W003)], but to supplement it by providing further information on the danger associated with the source and the necessity for untrained or uninformed members of the public to stay away from it. This symbol is recommended for use with International Atomic Energy Agency (IAEA) Category 1, 2, and 3 sealed radioactive sources. These sources are defined by the IAEA as having the ability to cause death or serious injuries. The paper informs about scope, shape, proportions and colour of the symbol, and application of the symbol. An annex provides the technical specifications of the symbol
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...
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.
Judgment under Uncertainty: Heuristics and Biases.
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.
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)
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.
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)
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.
Directory of Open Access Journals (Sweden)
Irene de Jesus Silva
2013-09-01
Full Text Available Na busca da cura do corpo, a oração opera milagres: uma discussão sobre eficácia simbólica, perspectivismo, cura e religião (In the search for the healing of the body, prayer works miracles: a discussion on symbolic efficacy, perspectivism - DOI: 10.5752/P.2175-5841.2013v11n31p965O artigo busca descrever, compreender e interpretar o caso observado de uma jovem portadora de teratoma ovariano maligno, internada em hospital do câncer na cidade de Belém, estado do Pará. A jovem foi desenganada diante do diagnóstico da doença, mas sua mãe agarrou-se na “fé em Deus”, pois “Ele opera milagres”, dizendo que dela retiraram “coisa feia”, cheia de dentes, cabelos e gorduras, que não sabia inteiramente explicar, mas que “Jesus cura”. A mãe, evangélica, mantinha a Bíblia na enfermaria, orando em voz alta diante do leito da menina. Aos poucos, amenizou-se a gravidade do caso, deixando perplexo o saber biomédico, diante do reconhecimento de outras buscas de cura, como através da oração, que levou aquela jovem a sair de alta hospitalar. Esse episódio, observado atentamente pela coautora deste artigo, permite uma discussão que transcende o âmbito da biomedicina, do ponto de vista antropológico, especialmente no campo da chamada “eficácia simbólica”, em que xamanismo e psicanálise podem ser chamados para conferir sentido a esse drama, cujo desfecho mostrou-se favorável para a jovem e sua mãe, até o ponto que foi possível observar. Palavras-chave: Cura. Religião. Eficácia Simbólica. Abstract This article aims to describe, understand and interpret the observed case of a young woman with ovarian malignant teratoma, hospitalized in the cancer hospital in the city of Belém, State of Pará, Brazil. The young woman was thought as incurable on the diagnosis of the disease, but her mother clung in “faith in God”, because “He works miracles”, saying that “ugly things”, full of teeth, hair and grease
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....
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
Age Effects and Heuristics in Decision Making.
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.
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.
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
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.
Symbolic Analysis of Cryptographic Protocols
DEFF Research Database (Denmark)
Dahl, Morten
We present our work on using abstract models for formally analysing cryptographic protocols: First, we present an ecient method for verifying trace-based authenticity properties of protocols using nonces, symmetric encryption, and asymmetric encryption. The method is based on a type system...... of Gordon et al., which we modify to support fully-automated type inference. Tests conducted via an implementation of our algorithm found it to be very ecient. Second, we show how privacy may be captured in a symbolic model using an equivalencebased property and give a formal denition. We formalise...
Symbolic computation in waste management
International Nuclear Information System (INIS)
Grant, M.W.
1989-01-01
This paper reports a prototype environment for decision analysis implemented on the PC using an object-oriented LISP. A unique feature of this environment is the extensive use of symbolic computation and object oriented programming. Models, e.g. contaminant transport and uptake, are built with the environment, itself recognizing new parameters, uncertainties and functions as they first appear and can be modified at any time with the appropriate changes propagated throughout the environment. The environment automatically generates and executes a complete interactive input sequence during the model construction. In addition to a primary decision criterion, secondary criteria or constraints may be used to define any decision
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...
Assessing Use of Cognitive Heuristic Representativeness in Clinical Reasoning
Payne, Velma L.; Crowley, Rebecca S.
2008-01-01
We performed a pilot study to investigate use of the cognitive heuristic Representativeness in clinical reasoning. We tested a set of tasks and assessments to determine whether subjects used the heuristics in reasoning, to obtain initial frequencies of heuristic use and related cognitive errors, and to collect cognitive process data using think-aloud techniques. The study investigates two aspects of the Representativeness heuristic - judging by perceived frequency and representativeness as ca...
Automated generation of constructive ordering heuristics for educational timetabling
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...
Adaptive selection of heuristics for improving exam timetables
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...
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
[Rod of Asclepius. Symbol of medicine].
Young, Pablo; Finn, Bárbara C; Bruetman, Julio E; Cesaro Gelos, Jorge; Trimarchi, Hernán
2013-09-01
Symbolism is one of the most archaic forms of human thoughts. Symbol derives from the Latin word symbolum, and the latter from the Greek symbolon or symballo, which means "I coincide, I make matches". The Medicine symbol represents a whole series of historical and ethical values. Asclepius Rod with one serpent entwined, has traditionally been the symbol of scientific medicine. In a misconception that has lasted 500 years, the Caduceus of Hermes, entwined by two serpents and with two wings, has been considered the symbol of Medicine. However, the Caduceus is the current symbol of Commerce. Asclepius Rod and the Caduceus of Hermes represent two professions, Medicine and Commerce that, in ethical practice, should not be mixed. Physicians should be aware of their real emblem, its historical origin and meaning.
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.
Can the inherence heuristic explain vitalistic reasoning?
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.
Fast heuristics for a dynamic paratransit problem
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
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....
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...
The Heuristic Interpretation of Box Plots
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…
Heuristic Classification. Technical Report Number 12.
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…
Engineering applications of heuristic multilevel optimization methods
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.
A Heuristic for the Teaching of Persuasion.
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…
Fourth Graders' Heuristic Problem-Solving Behavior.
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)
Heuristic Decision Making in Network Linking
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
Investigating Heuristic Evaluation: A Case Study.
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…
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.
Heuristics Made Easy: An Effort-Reduction Framework
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…
A Variable-Selection Heuristic for K-Means Clustering.
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)
Heuristic Diagrams as a Tool to Teach History of Science
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…
Symbolic trephinations and population structure
Directory of Open Access Journals (Sweden)
László Szathmáry
2006-12-01
Full Text Available The sample examined consists of 19 skulls with symbolic trephinations and 86 skulls without trepanations dated from the X century. Skulls were all excavated in the Great Hungarian Plain in the Carpathian Basin, which was occupied by the Hungarian conquerors at the end of the IX century. The variations of 12 cranial dimensions of the trephined skulls were investigated and compared to the skulls without trepanations after performing a discriminant analysis. The classification results evince that the variability of non-trephined skulls shows a more homogeneous and a more characteristic picture of their own group than the trephined samples, which corresponds to the notion, formed by archaeological evidence and written historical sources, of a both ethnically and socially differing population of the Hungarian conquerors. According to historical research, a part of the population was of Finno-Ugric origin, while the military leading layer of society can be brought into connection with Turkic ethnic groups. All the same, individuals dug up with rich grave furniture and supposed to belong to this upper stratum of society are primarily characterized by the custom of symbolic trephination, and, as our results demonstrate, craniologically they seem to be more heterogeneous.
[Symbolism on "natural" in food].
da Veiga Soares Carvalho, Maria Claudia; Luz, Madel Therezinha
2011-01-01
The incorporated senses represent a set of possibilities for future life able to build individual and collective identities. This work deepens the habitus, in Bourdieu's terms, associated with "natural" and fast-food styles, making an interpretative analysis of symbolic exchanges of elements reproduced in feeding practices. We believe that this bricolage arrangement of elements enables bartering and hybridism, marked by a tension that reflects the insecurity of technological innovations. The "natural" style represents an ideal of self-sustainability, non-polluting production, which faces the sanitary and ecologic crisis of the planet, against the large-scale industrialization and fast urbanization, defined as depredation factors of basic living conditions. The exchanges happen in a symbolic game connected with the global economic game, in which social actors make bets, illusio, according to particular intentions in concrete action. There is a chance to reformulate the rules of the game in the "game", although with a precarious balance of forces, in which the weaker side loses, an agent may have the possibility of not reproducing the pressures of globalized feeding, which is far from what might seem supernatural.
Symbolic dynamics of noisy chaos
Energy Technology Data Exchange (ETDEWEB)
Crutchfield, J P; Packard, N H
1983-05-01
One model of randomness observed in physical systems is that low-dimensional deterministic chaotic attractors underly the observations. A phenomenological theory of chaotic dynamics requires an accounting of the information flow fromthe observed system to the observer, the amount of information available in observations, and just how this information affects predictions of the system's future behavior. In an effort to develop such a description, the information theory of highly discretized observations of random behavior is discussed. Metric entropy and topological entropy are well-defined invariant measures of such an attractor's level of chaos, and are computable using symbolic dynamics. Real physical systems that display low dimensional dynamics are, however, inevitably coupled to high-dimensional randomness, e.g. thermal noise. We investigate the effects of such fluctuations coupled to deterministic chaotic systems, in particular, the metric entropy's response to the fluctuations. It is found that the entropy increases with a power law in the noise level, and that the convergence of the entropy and the effect of fluctuations can be cast as a scaling theory. It is also argued that in addition to the metric entropy, there is a second scaling invariant quantity that characterizes a deterministic system with added fluctuations: I/sub 0/, the maximum average information obtainable about the initial condition that produces a particular sequence of measurements (or symbols). 46 references, 14 figures, 1 table.
Honorary authorship and symbolic violence.
Kovacs, Jozsef
2017-03-01
This paper invokes the conceptual framework of Bourdieu to analyse the mechanisms, which help to maintain inappropriate authorship practices and the functions these practices may serve. Bourdieu's social theory with its emphasis on mechanisms of domination can be applied to the academic field, too, where competition is omnipresent, control mechanisms of authorship are loose, and the result of performance assessment can be a matter of symbolic life and death for the researchers. This results in a problem of game-theoretic nature, where researchers' behaviour will be determined more by the logic of competition, than by individual character or motives. From this follows that changing this practice requires institutionalized mechanisms, and change cannot be expected from simply appealing to researchers' individual conscience. The article aims at showing that academic capital (administrative power, seniority) is translated into honorary authorship. With little control, undetected honorary authorship gives the appearance of possessing intellectual capital (scientific merit). In this way a dominant position is made to be seen as natural result of intellectual ability or scientific merit, which makes it more acceptable to those in dominated positions. The final conclusion of this paper is that undemocratic authorship decisions and authorship based performance assessment together are a form of symbolic violence.
The rhetoric of disenchantment through symbolism
Munyangeyo, Théophile
2012-01-01
The symbolism of flowers has always been a significant part of cultures around the world due to their functional meaning in daily life. From their decorative to their aromatic role, flowers and their symbolic meaning trigger emotions, convey wishes and represent thoughts that can not be explicitly expressed. In this regard, an elaborate language based on flower symbolism was developed in many societies, to convey clear messages to the recipient. However, in some cultural contexts, although th...
7 CFR 29.2509 - Color symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Color symbols. 29.2509 Section 29.2509 Agriculture...-Cured Tobacco (u.s. Types 22, 23, and Foreign Type 96) § 29.2509 Color symbols. As applied to these types, color symbols are L—light brown, F—medium brown, D—dark brown, M—mixed or variegated VF—greenish...
Information decomposition method to analyze symbolical sequences
International Nuclear Information System (INIS)
Korotkov, E.V.; Korotkova, M.A.; Kudryashov, N.A.
2003-01-01
The information decomposition (ID) method to analyze symbolical sequences is presented. This method allows us to reveal a latent periodicity of any symbolical sequence. The ID method is shown to have advantages in comparison with application of the Fourier transformation, the wavelet transform and the dynamic programming method to look for latent periodicity. Examples of the latent periods for poetic texts, DNA sequences and amino acids are presented. Possible origin of a latent periodicity for different symbolical sequences is discussed
A hybrid heuristic algorithm for the open-pit-mining operational planning problem.
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...
Applied cartographic communication: map symbolization for atlases.
Morrison, J.L.
1984-01-01
A detailed investigation of the symbolization used on general-purpose atlas reference maps. It indicates how theories of cartographic communication can be put into practice. Two major points emerge. First, that a logical scheme can be constructed from existing cartographic research and applied to an analysis of the choice of symbolization on a map. Second, the same structure appears to allow the cartographer to specify symbolization as a part of map design. An introductory review of cartographic communication is followed by an analysis of selected maps' usage of point, area and line symbols, boundaries, text and colour usage.-after Author
Heuristics structure and pervade formal risk assessment.
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.
Can symbols be ‘promoted’ or ‘demoted’?: Symbols as religious phenomena
Directory of Open Access Journals (Sweden)
Jaco Beyers
2013-03-01
Full Text Available Religious symbols are part of our world, relating to another world. In order to understand the process by which symbols grow and develop, the particular context of a symbol is important. In this article a particular theory as to what symbols are, is presented. Religion presupposes the existence of two worlds: this-worldly (profane and the other-worldly (sacred. The means of communication and reference between these two worlds are symbols. Two examples are investigated so as to indicate how symbols can over time either be demoted or promoted. In the case of the Asherah and asherah as related in the Old Testament a demotion of a symbol is illustrated. The growth of ancient Egyptian religion is an example of a possible promotion of symbols. The conditions under which these processes can occur are investigated.
Heuristic Evaluation of E-Learning Courses: A Comparative Analysis of Two E-Learning Heuristic Sets
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…
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...
Learning process mapping heuristics under stochastic sampling overheads
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.
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.
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.
Data science and symbolic AI: Synergies, challenges and opportunities
Hoehndorf, Robert
2017-06-02
Symbolic approaches to artificial intelligence represent things within a domain of knowledge through physical symbols, combine symbols into symbol expressions, and manipulate symbols and symbol expressions through inference processes. While a large part of Data Science relies on statistics and applies statistical approaches to artificial intelligence, there is an increasing potential for successfully applying symbolic approaches as well. Symbolic representations and symbolic inference are close to human cognitive representations and therefore comprehensible and interpretable; they are widely used to represent data and metadata, and their specific semantic content must be taken into account for analysis of such information; and human communication largely relies on symbols, making symbolic representations a crucial part in the analysis of natural language. Here we discuss the role symbolic representations and inference can play in Data Science, highlight the research challenges from the perspective of the data scientist, and argue that symbolic methods should become a crucial component of the data scientists’ toolbox.
Data science and symbolic AI: Synergies, challenges and opportunities
Hoehndorf, Robert; Queralt-Rosinach, Nú ria
2017-01-01
Symbolic approaches to artificial intelligence represent things within a domain of knowledge through physical symbols, combine symbols into symbol expressions, and manipulate symbols and symbol expressions through inference processes. While a large part of Data Science relies on statistics and applies statistical approaches to artificial intelligence, there is an increasing potential for successfully applying symbolic approaches as well. Symbolic representations and symbolic inference are close to human cognitive representations and therefore comprehensible and interpretable; they are widely used to represent data and metadata, and their specific semantic content must be taken into account for analysis of such information; and human communication largely relies on symbols, making symbolic representations a crucial part in the analysis of natural language. Here we discuss the role symbolic representations and inference can play in Data Science, highlight the research challenges from the perspective of the data scientist, and argue that symbolic methods should become a crucial component of the data scientists’ toolbox.
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.
Logic-Symbolic and Alphabetization
Directory of Open Access Journals (Sweden)
Dair Aily Franco de Camargo
2007-10-01
Full Text Available The present article tries to recoup the ideas and the proposal of H. Furth (1973, pointing it as another option to try to work with the children’s difficulties in the alphabetization process. The author considers the substitution of “schools of the language” for “schools of the thought”, that is, to substitute the option of the teacher in the reading-writing education, in its traditional form, of how to transform graphical signals into sonorous and vice-versa, for that one of the thought consolidation, feeding the intellect in development of the child by exercises of “symbolic logic”. For theoretical basing, we still present some aspects of the psychogenetic theory, as well as other works carried through more recently on the subject, that even so “transvestite” (disguised with new clothing, still find their beddings in the J. Piaget’s basis.
Assessing the use of cognitive heuristic representativeness in clinical reasoning.
Payne, Velma L; Crowley, Rebecca S; Crowley, Rebecca
2008-11-06
We performed a pilot study to investigate use of the cognitive heuristic Representativeness in clinical reasoning. We tested a set of tasks and assessments to determine whether subjects used the heuristics in reasoning, to obtain initial frequencies of heuristic use and related cognitive errors, and to collect cognitive process data using think-aloud techniques. The study investigates two aspects of the Representativeness heuristic - judging by perceived frequency and representativeness as causal beliefs. Results show that subjects apply both aspects of the heuristic during reasoning, and make errors related to misapplication of these heuristics. Subjects in this study rarely used base rates, showed significant variability in their recall of base rates, demonstrated limited ability to use provided base rates, and favored causal data in diagnosis. We conclude that the tasks and assessments we have developed provide a suitable test-bed to study the cognitive processes underlying heuristic errors.
Assessing Use of Cognitive Heuristic Representativeness in Clinical Reasoning
Payne, Velma L.; Crowley, Rebecca S.
2008-01-01
We performed a pilot study to investigate use of the cognitive heuristic Representativeness in clinical reasoning. We tested a set of tasks and assessments to determine whether subjects used the heuristics in reasoning, to obtain initial frequencies of heuristic use and related cognitive errors, and to collect cognitive process data using think-aloud techniques. The study investigates two aspects of the Representativeness heuristic - judging by perceived frequency and representativeness as causal beliefs. Results show that subjects apply both aspects of the heuristic during reasoning, and make errors related to misapplication of these heuristics. Subjects in this study rarely used base rates, showed significant variability in their recall of base rates, demonstrated limited ability to use provided base rates, and favored causal data in diagnosis. We conclude that the tasks and assessments we have developed provide a suitable test-bed to study the cognitive processes underlying heuristic errors. PMID:18999140
Reconsidering "evidence" for fast-and-frugal heuristics.
Hilbig, Benjamin E
2010-12-01
In several recent reviews, authors have argued for the pervasive use of fast-and-frugal heuristics in human judgment. They have provided an overview of heuristics and have reiterated findings corroborating that such heuristics can be very valid strategies leading to high accuracy. They also have reviewed previous work that implies that simple heuristics are actually used by decision makers. Unfortunately, concerning the latter point, these reviews appear to be somewhat incomplete. More important, previous conclusions have been derived from investigations that bear some noteworthy methodological limitations. I demonstrate these by proposing a new heuristic and provide some novel critical findings. Also, I review some of the relevant literature often not-or only partially-considered. Overall, although some fast-and-frugal heuristics indeed seem to predict behavior at times, there is little to no evidence for others. More generally, the empirical evidence available does not warrant the conclusion that heuristics are pervasively used.
The Rhetoric of Disenchantment through Symbolism
Munyangeyo, Théophile
2012-01-01
The symbolism of "flowers" has always been a significant part of cultures around the world due to their functional meaning in daily life. From their decorative to their aromatic role, flowers and their symbolic meaning trigger emotions, convey wishes and represent thoughts that can not be explicitly expressed. In this regard, an…
Television Commercials: Symbols, Myths and Metaphors.
Feasley, Florence G.
Television commercials convey to the audience through symbols, metaphors, and myths the feelings and emotions deeply rooted in our culture. While commercials on one level are concerned with a representation of the product or service, they are on another level a symbol of a larger meaning: love, family, romance, motherhood, or hero worship. A can…
Efficient Bit-to-Symbol Likelihood Mappings
Moision, Bruce E.; Nakashima, Michael A.
2010-01-01
This innovation is an efficient algorithm designed to perform bit-to-symbol and symbol-to-bit likelihood mappings that represent a significant portion of the complexity of an error-correction code decoder for high-order constellations. Recent implementation of the algorithm in hardware has yielded an 8- percent reduction in overall area relative to the prior design.
NMR-CT image and symbol phantoms
International Nuclear Information System (INIS)
Hongo, Syozo; Yamaguchi, Hiroshi; Takeshita, Hiroshi
1990-01-01
We have developed Japanese phantoms in two procedures. One is described as a mathematical expression. Another is 'symbol phantoms' in 3 dimensional picture-elements, each of which symbolize an organ name. The concept and the algorithm of the symbol phantom enables us to make a phantom for a individual in terms of all his transversal section images. We got 85 transversal section images of head and trunk parts, and those of 40 legs parts by using NMR-CT. We have made the individual phantom for computation of organ doses. The transversal section images were not so clear to identify all organs needed to dose estimation that we had to do hand-editing the shapes of organs with viewing a typical section images: we could not yet make symbol phantom in a automatic editing. Symbols were coded to be visual cords as ASCII characters. After we got the symbol phantom of the first stage, we can edit it easily using a word-processor. Symbol phantom could describe more freely the shape of organs than mathematical phantom. Symbol phantom has several advantages to be an individual phantom, but the only difficult point is how to determine its end-point as a reference man when we apply the method to build the reference man. (author)
2010-01-01
... 14 Aeronautics and Space 2 2010-01-01 2010-01-01 false Symbols. 95.3 Section 95.3 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION (CONTINUED) AIR TRAFFIC AND GENERAL OPERATING RULES IFR ALTITUDES General § 95.3 Symbols. For the purposes of this part— (a) COP means...
Deficient symbol processing in Alzheimer disease.
Toepper, Max; Steuwe, Carolin; Beblo, Thomas; Bauer, Eva; Boedeker, Sebastian; Thomas, Christine; Markowitsch, Hans J; Driessen, Martin; Sammer, Gebhard
2014-01-01
Symbols and signs have been suggested to improve the orientation of patients suffering from Alzheimer disease (AD). However, there are hardly any studies that confirm whether AD patients benefit from signs or symbols and which symbol characteristics might improve or impede their symbol comprehension. To address these issues, 30 AD patients and 30 matched healthy controls performed a symbol processing task (SPT) with 4 different item categories. A repeated-measures analysis of variance was run to identify impact of different item categories on performance accuracy in both the experimental groups. Moreover, SPT scores were correlated with neuropsychological test scores in a broad range of other cognitive domains. Finally, diagnostic accuracy of the SPT was calculated by a receiver-operating characteristic curve analysis. Results revealed a global symbol processing dysfunction in AD that was associated with semantic memory and executive deficits. Moreover, AD patients showed a disproportional performance decline at SPT items with visual distraction. Finally, the SPT total score showed high sensitivity and specificity in differentiating between AD patients and healthy controls. The present findings suggest that specific symbol features impede symbol processing in AD and argue for a diagnostic benefit of the SPT in neuropsychological assessment.
History of international symbol for ionizing radiation
International Nuclear Information System (INIS)
Franic, Z.
1996-01-01
The year 1996 marks the 50th anniversary of the radiation warning symbol as we currently know it. It was (except the colours used) doodled out at the University of California, Berkeley, sometime in 1946 by a small group of people. The key guy responsible was Nelson Garden, then the head of the Health Chemistry Group, at the Radiation Laboratory. The radiation warning symbol should not be confused with the civil defence symbol (circle divided into six equal sections, three of these being black and three yellow), designed to identify fallout shelters. The basic radiation symbol was eventually internationally standardized by ISO code: 361-1975 (E). Variations of this symbol are frequently used in logotypes radiation protection organizations or associations. Particularly nice are those of International Radiation Protection Association (IRPA) and Croatian Radiation Protection Association (CRPA) that combines traditional Croatian motives with high technology. However, apart from speculations, there is no definite answer why did the Berkeley people chose this particular symbol. Whatever the reason was, it was very good choice because the ionizing radiation symbol is simple, readily identifiable, i.e., not similar to other warning symbols, and discernible at a large distance. (author)
2010-10-01
... appropriate symbol(s) on areas, such as wildlife management areas and fishing access facilities, acquired..., losses and damages arising out of any allegedly unauthorized use of any patent, process, idea, method or... and also from any claims, suits, losses and damages arising out of alleged defects in the articles or...
Sound-symbolism boosts novel word learning
Lockwood, G.F.; Dingemanse, M.; Hagoort, P.
2016-01-01
The existence of sound-symbolism (or a non-arbitrary link between form and meaning) is well-attested. However, sound-symbolism has mostly been investigated with nonwords in forced choice tasks, neither of which are representative of natural language. This study uses ideophones, which are naturally
Self-symbols as implicit motivators
Holland, R.W.; Wennekers, A.M.; Bijlstra, G.; Jongenelen, M.M.; Knippenberg, A.F.M. van
2009-01-01
The present research explored the nonconscious motivational influence of self-symbols. In line with recent findings on the motivational influence of positive affect, we hypothesized that positive affect associated with self-symbols may boost motivation. In Study I people drank more of a beverage
Self-symbols as implicit motivators
Holland, R.W.; Wennekers, A.M.; Bijlstra, G.; Jongenelen, M.M.; van Knippenberg, A.
2009-01-01
The present research explored the nonconscious motivational influence of self-symbols. In line with recent findings on the motivational influence of positive affect, we hypothesized that positive affect associated with self-symbols may boost motivation. In Study 1 people drank more of a beverage
Statistical Symbolic Execution with Informed Sampling
Filieri, Antonio; Pasareanu, Corina S.; Visser, Willem; Geldenhuys, Jaco
2014-01-01
Symbolic execution techniques have been proposed recently for the probabilistic analysis of programs. These techniques seek to quantify the likelihood of reaching program events of interest, e.g., assert violations. They have many promising applications but have scalability issues due to high computational demand. To address this challenge, we propose a statistical symbolic execution technique that performs Monte Carlo sampling of the symbolic program paths and uses the obtained information for Bayesian estimation and hypothesis testing with respect to the probability of reaching the target events. To speed up the convergence of the statistical analysis, we propose Informed Sampling, an iterative symbolic execution that first explores the paths that have high statistical significance, prunes them from the state space and guides the execution towards less likely paths. The technique combines Bayesian estimation with a partial exact analysis for the pruned paths leading to provably improved convergence of the statistical analysis. We have implemented statistical symbolic execution with in- formed sampling in the Symbolic PathFinder tool. We show experimentally that the informed sampling obtains more precise results and converges faster than a purely statistical analysis and may also be more efficient than an exact symbolic analysis. When the latter does not terminate symbolic execution with informed sampling can give meaningful results under the same time and memory limits.
Democracy and the Symbolic Constitution of Society
Lindahl, H.K.
1998-01-01
Abstract. Building on Cassirer's philosophy of symbolic forms, this paper argues that the continuities and discontinuities characterizing the passage from medieval politics to modern democracy can best be understood by reference to political power's symbolic structure. For the one, political power,
Symbolic initiative and its application to computers
Energy Technology Data Exchange (ETDEWEB)
Hellerman, L
1982-01-01
The author reviews the role of symbolic initiative in mathematics and then defines a sense in which computers compute mathematical functions. This allows a clarification of the semantics of computer and communication data. Turing's view of machine intelligence is examined in terms of its use of symbolic initiative. 12 references.
The Symbolic Meaning of Legal Subjectivity
Pessers, D.; van Klink, B.; van Beers, B.; Poort, L.
2016-01-01
The legitimacy of the law is not to be found, as is often claimed, in procedural justice, but in the core function of the law: the symbolic insertion of every new generation into the community of legal subjects. This symbolic function is most ambitiously expressed in the Universal Declaration of
Self-organisation of symbolic information
Feistel, R.
2017-01-01
Information is encountered in two different appearances, in native form by arbitrary physical structures, or in symbolic form by coded sequences of letters or the like. The self-organised emergence of symbolic information from structural information is referred to as a ritualisation transition. Occurring at some stage in evolutionary history, ritualisation transitions have in common that after the crossover, arbitrary symbols are issued and recognised by information-processing devices, by transmitters and receivers in the sense of Shannon's communication theory. Symbolic information-processing systems exhibit the fundamental code symmetry whose key features, such as largely lossless copying or persistence under hostile conditions, may elucidate the reasons for the repeated successful occurrence of ritualisation phenomena in evolution history. Ritualisation examples are briefly reviewed such as the origin of life, the appearance of human languages, the establishment of emergent social categories such as money, or the development of digital computers. In addition to their role as carriers of symbolic information, symbols are physical structures which also represent structural information. For a thermodynamic description of symbols and their arrangements, it appears reasonable to distinguish between Boltzmann entropy, Clausius entropy and Pauling entropy. Thermodynamic properties of symbols imply that their lifetimes are limited by the 2nd law.
Simple heuristics in over-the-counter drug choices: a new hint for medical education and practice.
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
Simple heuristics in over-the-counter drug choices: a new hint for medical education and practice
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
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
[Understanding King's model on the paradigm of symbolic interactionism].
Araújo, Iliana Maria de Almeida; Oliveira, Marcos Venícios; de Oliveira, Marcos Venícius; Fernandes, Ana Fátima Carvalho
2005-01-01
It was aimed to reflect on King's Theory, according to the approach of Symbolic Interaccionism, and theory analyses model of Meleis. To reach the objective, we proceeded the reading of the three models as mentioned before, looking for the consistencies and discrepancies among the concepts and correlating them. The study allowed to conclude that the theories agree when elucidating the man as a being that reacts and search to understand the meaning of things to his/her circuit, drifting and judging their actions and the one of the other ones. It is important the subject of the meanings could be modified and they generate the elaboration of goals in common.
Symbolic math for computation of radiation shielding
International Nuclear Information System (INIS)
Suman, Vitisha; Datta, D.; Sarkar, P.K.; Kushwaha, H.S.
2010-01-01
Radiation transport calculations for shielding studies in the field of accelerator technology often involve intensive numerical computations. Traditionally, radiation transport equation is solved using finite difference scheme or advanced finite element method with respect to specific initial and boundary conditions suitable for the geometry of the problem. All these computations need CPU intensive computer codes for accurate calculation of scalar and angular fluxes. Computation using symbols of the analytical expression representing the transport equation as objects is an enhanced numerical technique in which the computation is completely algorithm and data oriented. Algorithm on the basis of symbolic math architecture is developed using Symbolic math toolbox of MATLAB software. Present paper describes the symbolic math algorithm and its application as a case study in which shielding calculation of rectangular slab geometry is studied for a line source of specific activity. Study of application of symbolic math in this domain evolves a new paradigm compared to the existing computer code such as DORT. (author)
Exact computation of the 9-j symbols
International Nuclear Information System (INIS)
Lai Shantao; Chiu Jingnan
1992-01-01
A useful algebraic formula for the 9-j symbol has been rewritten for convenient use on a computer. A simple FORTRAN program for the exact computation of 9-j symbols has been written for the VAX with VMS version V5,4-1 according to this formula. The results agree with the approximate values in existing literature. Some specific values of 9-j symbols needed for the intensity and alignments of three-photon nonresonant transitions are tabulated. Approximate 9-j symbol values beyond the limitation of the computer can also be computed by this program. The computer code of the exact computation of 3-j, 6-j and 9-j symbols are available through electronic mail upon request. (orig.)
Symbol in Point View of Ambiguity
Directory of Open Access Journals (Sweden)
Dr. M. R. Yousefi
Full Text Available Symbol from the perspective of rhetorical word, is phrase or sentence that apparent meaning, also inspires to reader a wide range of semantic.Since exploring the complex social and political ideas in the most mysticalway and indirectreflectionsocial and political thoughts symbolically is easier, so the symbol and symbolism especially in Persian literatureespeciallyin the realm of Persian poetry, has a special appearance.In addition to the factors mentioned in the contemporary literature, according familiar in literature and the emergence of particular schools interest toambiguoussymbolization has spreadfurther, especially the symbol has all the features of art ambiguity in the poem and it isone the major factors causing uncertainty.Thus, the precise definitions and symbols of contemporary poetry could be dominant in the unwinding ambiguous symbol detection of cryptic allusions and metaphors that matches the cursor symbol to help readers.In the literature, especially language poetry, the inability of language toreflecting obscure mystical ideas, avoid to directexpression of political and social concerns of the reader in the course of participate to creation ambiguous literary works is the main motivation towards symbol and symbolization.According widespread use of symbol and its different of species can be viewed from different perspectives.The creation of ambiguity is the main purposes of using symbols (especially in poetry, so many poets have tried to achieve this goal have to formation of similar symbols and the explanation and resolution of this issue can open new window for understanding the poetry in front of an audience.In this paper examines the ambiguity of symbols in terms of its precise boundaries are reviewed. Ambiguity is one of the important processes and also is the key Iranian poetry; its means is today poetry. In such poetry ambiguity is a need to explore the new world from a different perspective, or explore this complex world
Heuristics and Cognitive Error in Medical Imaging.
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.
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.
Heuristic Evaluation for Novice Programming Systems
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...
Entrepreneurial Learning, Heuristics and Venture Creation
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...
SYMBOL AND LOGO. THE WAY IN WHICH YOUNG PEOPLE IN KRAKOW PERCEIVE SYMBOLS
Directory of Open Access Journals (Sweden)
Marta Jarzyna
2006-01-01
Full Text Available Symbols are essential elements of each culture. Thanks to them the meaning is created and tradition is kept alive. Advertising and marketing specialist quite often use the meanings of the symbols to create trademarks. In this way specialists refer to the assotiations rooted in the tradition.In my article I am trying to answer following questions: Has logo become symbol? Has logo taken over all the function of the symbol? Can we tell the difference between the meaning of the advertisement and the cultural meaning? I also want to find out, what people understand through the meaning of the symbol. Therfore I have conducted the survey among the high school students and the customers of three banks of Krakow. My researches have shown that most young people find it difficult to define the meaning of the symbol. Moreover high school students cannot show the difference between the symbol and the trade mark.
Parallel symbolic state-space exploration is difficult, but what is the alternative?
Directory of Open Access Journals (Sweden)
Gianfranco Ciardo
2009-12-01
Full Text Available State-space exploration is an essential step in many modeling and analysis problems. Its goal is to find the states reachable from the initial state of a discrete-state model described. The state space can used to answer important questions, e.g., "Is there a dead state?" and "Can N become negative?", or as a starting point for sophisticated investigations expressed in temporal logic. Unfortunately, the state space is often so large that ordinary explicit data structures and sequential algorithms cannot cope, prompting the exploration of (1 parallel approaches using multiple processors, from simple workstation networks to shared-memory supercomputers, to satisfy large memory and runtime requirements and (2 symbolic approaches using decision diagrams to encode the large structured sets and relations manipulated during state-space generation. Both approaches have merits and limitations. Parallel explicit state-space generation is challenging, but almost linear speedup can be achieved; however, the analysis is ultimately limited by the memory and processors available. Symbolic methods are a heuristic that can efficiently encode many, but not all, functions over a structured and exponentially large domain; here the pitfalls are subtler: their performance varies widely depending on the class of decision diagram chosen, the state variable order, and obscure algorithmic parameters. As symbolic approaches are often much more efficient than explicit ones for many practical models, we argue for the need to parallelize symbolic state-space generation algorithms, so that we can realize the advantage of both approaches. This is a challenging endeavor, as the most efficient symbolic algorithm, Saturation, is inherently sequential. We conclude by discussing challenges, efforts, and promising directions toward this goal.
The affect heuristic in occupational safety.
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.
A general heuristic for genome rearrangement problems.
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.
When decision heuristics and science collide.
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.
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.
Assembly processor program converts symbolic programming language to machine language
Pelto, E. V.
1967-01-01
Assembly processor program converts symbolic programming language to machine language. This program translates symbolic codes into computer understandable instructions, assigns locations in storage for successive instructions, and computer locations from symbolic addresses.
"The Gaze Heuristic:" Biography of an Adaptively Rational Decision Process.
Hamlin, Robert P
2017-04-01
This article is a case study that describes the natural and human history of the gaze heuristic. The gaze heuristic is an interception heuristic that utilizes a single input (deviation from a constant angle of approach) repeatedly as a task is performed. Its architecture, advantages, and limitations are described in detail. A history of the gaze heuristic is then presented. In natural history, the gaze heuristic is the only known technique used by predators to intercept prey. In human history the gaze heuristic was discovered accidentally by Royal Air Force (RAF) fighter command just prior to World War II. As it was never discovered by the Luftwaffe, the technique conferred a decisive advantage upon the RAF throughout the war. After the end of the war in America, German technology was combined with the British heuristic to create the Sidewinder AIM9 missile, the most successful autonomous weapon ever built. There are no plans to withdraw it or replace its guiding gaze heuristic. The case study demonstrates that the gaze heuristic is a specific heuristic type that takes a single best input at the best time (take the best 2 ). Its use is an adaptively rational response to specific, rapidly evolving decision environments that has allowed those animals/humans/machines who use it to survive, prosper, and multiply relative to those who do not. Copyright © 2017 Cognitive Science Society, Inc.
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
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.
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.
The rhetoric of disenchantment through symbolism
Directory of Open Access Journals (Sweden)
Théophile Munyangeyo
2012-10-01
Full Text Available The symbolism of flowers has always been a significant part of cultures around the world due to their functional meaning in daily life. From their decorative to their aromatic role, flowers and their symbolic meaning trigger emotions, convey wishes and represent thoughts that can not be explicitly expressed. In this regard, an elaborate language based on flower symbolism was developed in many societies, to convey clear messages to the recipient. However, in some cultural contexts, although the flower symbolism has social connotations, it is mainly associated with economic references. As flowers are an essential precursor to fruits, they are inevitably a source of expectations and hence foster a set of hopes and dreams, which can ultimately lead to excitement or disappointment.Through a discourse analysis based on factional narratives, this article explores the parameters through which the symbolism of bifaceted meaning of flowers fictionalises a space that refers to the social reality. This association between the fictional world and social reference has highlighted that writing can profoundly be a means of representing social events through the rhetoric of symbolism. Through a sociological reading approach, this paper aims to analyse how the symbolism of flowers informs the rhetoric of disenchantment that can foster a content-based pedagogy in language learning where silencing practices engender imagery to exercise the freedom of expression.
Symbol synchronization for the TDRSS decoder
Costello, D. J., Jr.
1983-01-01
Each 8 bits out of the Viterbi decoder correspond to one symbol of the R/S code. Synchronization must be maintained here so that each 8-bit symbol delivered to the R/S decoder corresponds to an 8-bit symbol from the R/S encoder. Lack of synchronization, would cause an error in almost every R/S symbol since even a - 1-bit sync slip shifts every bit in each 8-bit symbol by one position, therby confusing the mapping betweeen 8-bit sequences and symbols. The error correcting capability of the R/S code would be exceeded. Possible ways to correcting this condition include: (1) designing the R/S decoder to recognize the overload and shifting the output sequence of the inner decoder to establish a different sync state; (2) using the characteristics of the inner decoder to establish symbol synchronization for the outer code, with or without a deinterleaver and an interleaver; and (3) modifying the encoder to alternate periodically between two sets of generators.
Appropriateness of using a symbol to identify dementia and/or delirium: a systematic review.
Hines, Sonia; Abbey, Jenny; Wilson, Jacinda; Sacre, Sandy
2009-01-01
Alzheimer's Australia contracted the Dementia Collaborative Research Centre - Consumers, Carers and Social Research to conduct a systematic review to explore the appropriateness of a symbol for dementia.The concept of a symbol for people with dementia was an outcome of the Alzheimer's Australia National Consumer Summit on Dementia held in Canberra in October 2005. People living with dementia and their carers identified that a national symbol would be helpful in order to encourage appropriate treatment of people with dementia.Funding was provided as part of the Australian Government's Dementia Initiative to Alzheimer's Australia to work in collaboration with the Queensland University of Technology and Catholic Health Australia to explore, through research, the viability and potential impact of such a symbol in a range of care settings. The main objective of this systematic review was to evaluate any published and unpublished evidence regarding the appropriateness of developing a symbol for dementia and/or delirium, which could be used in a variety of settings to indicate that a person has dementia and/or delirium. A literature search was performed using the following databases: Ageline, APAIS Health, CINAHL, Dissertations and Theses Abstracts, Embase, MEDLINE, PsycEXTRAS, PsycINFO, PsycArticles, Current Contents, LegalTrac, Health and Society, Sociological Abstracts, Family and Society, CINCH, and Hein Online databases. The reference lists of articles retrieved were hand searched, as well as a range of literature from health, legal, ethical and emergency services. Grey literature was searched for using a number of Internet sites, and personal email communication with authors of relevant studies and known researchers in the field was initiated. Papers were retrieved if they provided information about attitudes or perceptions towards the appropriateness of symbols, identifiers or alerts used to inform others that someone has dementia, delirium and/or another medical
European Languages: Instruments and Symbols
Directory of Open Access Journals (Sweden)
Martina Ožbot
2008-07-01
Further, the role of Latin as the single most important European language over the centuries and as a unifying feature of European culture is discussed. Parallels are drawn between Latin as the historical European lingua franca on the one hand and English as the modern language of international communication on the other: the importance of both languages started growing after substantial territorial expansion of their speakers and it was especially the political and economic power associated to these languages that played a significant role in their diffusion and long-term influence. Taking into consideration the instrumental as well as the symbolic function of languages, the question about the relationship between English and other European languages in today’s Europe is dealt with; it is suggested that the European languages are in principle not endangered as a result of the spread of English, with the exception of those instances in which English has been taking over the functions they have traditionally performed as national or community languages. It is emphasized that the future of Europe lies in the promotion of biand multilingualism, which have, in actual fact, been present on this continent throughout its history, and which in the cases of some European languages (e.g. Catalan, Basque, Irish, etc. have been successfully enhanced over the past decades.
2005-09-30
There is currently no common symbology standard for the electronic display of navigation information. The wide range of display technology and the different functions these displays support makes it difficult to design symbols that are easily recogni...
Social and Symbolic Capital in Firm Clusters
DEFF Research Database (Denmark)
Gretzinger, Susanne; Royer, Susanne
Based on a relational perspective this paper analyses the case of the “Mechatronics Cluster” in Southern Jutland, Denmark. We found that cluster managers are not aware of the importance of social and symbolic capital. Cluster managers could have access to both but they are not aware...... of this resource and they don´t have any knowledge how to manage social and symbolic capital. Just to integrate social-capital-supporting initiatives in the day to day business would help to develop and to foster social and symbolic capital on a low cost level. And in our example just to integrate successful sub...
Democratisation of AAC Symbol Choices Using Technology.
Draffan, E A; Wald, Mike; Zeinoun, Nadine; Banes, David
2017-01-01
The use of an online voting system has been developed to enable democratic choices of newly designed symbols to support speech, language and literacy skills in a localisation situation. The system works for those using and supporting Augmentative and Alternative Communication (AAC) symbols on electronic systems by the provision of simplified scales of acceptance and adapted grids. The methodology and results highlighted the importance of user participation at the outset and concrete examples of symbol adaptations that were found necessary to ensure higher levels of user satisfaction. Design changes included appropriate local dress codes, linguistic nuances, social settings, the built environment and religious sensitivities.
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.
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.
An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics
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.
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.
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)
Cultural heuristics in risk assessment of HIV/AIDS.
Bailey, Ajay; Hutter, Inge
2006-01-01
Behaviour change models in HIV prevention tend to consider that risky sexual behaviours reflect risk assessments and that by changing risk assessments behaviour can be changed. Risk assessment is however culturally constructed. Individuals use heuristics or bounded cognitive devices derived from broader cultural meaning systems to rationalize uncertainty. In this study, we identify some of the cultural heuristics used by migrant men in Goa, India to assess their risk of HIV infection from different sexual partners. Data derives from a series of in-depth interviews and a locally informed survey. Cultural heuristics identified include visual heuristics, heuristics of gender roles, vigilance and trust. The paper argues that, for more culturally informed HIV/AIDS behaviour change interventions, knowledge of cultural heuristics is essential.
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
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
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....
The recognition heuristic : A review of theory and tests
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...
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.
A heuristic evaluation of the Facebook's advertising tool beacon
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...
Interliminal Design: Understanding cognitive heuristics to mitigate design distortion
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...
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.
Helping children express grief through symbolic communication.
Segal, R M
1984-12-01
Communication barriers erected by grieving children delay problem resolution. Use of the expressive arts--music, art, and body movement--in symbolic communication helps them to express overwhelming feelings and cope with trauma and stress.
Matter and symbols of the artificial
Energy Technology Data Exchange (ETDEWEB)
Rocha, L.M.
1998-08-01
The study of complex systems should be based on a systems-theoretic framework which requires both self-organizing and symbolic dimensions. An inclusive framework based on the notion of semiotics is advanced to build models capable of representing, as well as evolving in their environments, with implications for Artificial Life. Such undertaking is pursued by discussing the ways in which symbol and matter are irreducibly intertwined in evolutionary systems. The problem is thus phrased in terms of the semiotic categories of syntax, semantics, and pragmatics. With this semiotic view of matter and symbols the requirements of semiotic closure are expressed in models with both self-organizing and symbolic characteristics. Situated action and recent developments in the evolution of cellular automata rules to solve non-trivial tasks are discussed in this context. Finally, indirect encoding schemes for genetic algorithms are developed which follow the semiotic framework here proposed.
Multi-core symbolic bisimulation minimisation
Dijk, Tom van; Pol, Jaco van de
2017-01-01
We introduce parallel symbolic algorithms for bisimulation minimisation, to combat the combinatorial state space explosion along three different paths. Bisimulation minimisation reduces a transition system to the smallest system with equivalent behaviour. We consider strong and branching
Specification for symbol for ionizing radiation
International Nuclear Information System (INIS)
1974-01-01
This Malaysia Standard specification specifies a symbol recommended for use only to signify the actual or potential presence of ionizing radiation (#betta#, α, #betta# only) and to identify objects, devices, materials or combinations of materials which emit such radiation. (author)
Three Alternative Symbol-Lock Detectors
Shihabi, Mazen M.; Hinedi, Sami M.; Shah, Biren N.
1993-01-01
Three symbol-lock detectors proposed as alternatives in advanced receivers processing non-return-to-zero binary data signals. Two perform operations similar to those of older square-law and absolute-value types. However, integrals computed during nonoverlapping symbol periods and, therefore, only one integrator needed in each such detector. Proposed detectors simpler, but performances worse because noises in overlapping samples correlated, whereas noises in nonoverlapping samples not correlated. Third detector is signal-power-estimator type. Signal integrated during successive half symbol cycles, and therefore only one integrator needed. Half-cycle integrals multiplied to eliminate effect of symbol polarity, and products accumulated during M-cycle observation period to smooth out estimate of signal power. If estimated signal power exceeds threshold, delta, then lock declared.
Parties, rituals and symbolisms in schools
Directory of Open Access Journals (Sweden)
Ana Cecilia Valencia Aguirre
2015-07-01
Full Text Available This paper aims at analyzing school parties from interaction spaces and principals’ narratives in six schools in the state of Jalisco. A party is a ritual where participants share symbols related to imaginary –hence the importance of conducting an analysis for understanding institutions as a symbolic framework. A core argument is that established actors are configured from symbolic practices in the institutional space (schools. The repetition of these practices awash with symbolism leads to daily rituals or micro rituals that are ratified in institutions. Methodologically, interviews and non-participant observation in school interaction spaces were used. Based on the findings, it may be stated that the nuclear family, rooted in the Christian image in which authority is a central point, becomes a fundamental factor in shaping institutional life as well as the imaginary linked to school parties.
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...
Intelligent process mapping through systematic improvement of heuristics
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.
[Symbol: see text]2 Optimized predictive image coding with [Symbol: see text]∞ bound.
Chuah, Sceuchin; Dumitrescu, Sorina; Wu, Xiaolin
2013-12-01
In many scientific, medical, and defense applications of image/video compression, an [Symbol: see text]∞ error bound is required. However, pure[Symbol: see text]∞-optimized image coding, colloquially known as near-lossless image coding, is prone to structured errors such as contours and speckles if the bit rate is not sufficiently high; moreover, most of the previous [Symbol: see text]∞-based image coding methods suffer from poor rate control. In contrast, the [Symbol: see text]2 error metric aims for average fidelity and hence preserves the subtlety of smooth waveforms better than the ∞ error metric and it offers fine granularity in rate control, but pure [Symbol: see text]2-based image coding methods (e.g., JPEG 2000) cannot bound individual errors as the [Symbol: see text]∞-based methods can. This paper presents a new compression approach to retain the benefits and circumvent the pitfalls of the two error metrics. A common approach of near-lossless image coding is to embed into a DPCM prediction loop a uniform scalar quantizer of residual errors. The said uniform scalar quantizer is replaced, in the proposed new approach, by a set of context-based [Symbol: see text]2-optimized quantizers. The optimization criterion is to minimize a weighted sum of the [Symbol: see text]2 distortion and the entropy while maintaining a strict [Symbol: see text]∞ error bound. The resulting method obtains good rate-distortion performance in both [Symbol: see text]2 and [Symbol: see text]∞ metrics and also increases the rate granularity. Compared with JPEG 2000, the new method not only guarantees lower [Symbol: see text]∞ error for all bit rates, but also it achieves higher PSNR for relatively high bit rates.
Directory of Open Access Journals (Sweden)
Furman Tamar
2012-11-01
Full Text Available Abstract Background The question whether Developmental Dyscalculia (DD; a deficit in the ability to process numerical information is the result of deficiencies in the non symbolic numerical representation system (e.g., a group of dots or in the symbolic numerical representation system (e.g., Arabic numerals has been debated in scientific literature. It is accepted that the non symbolic system is divided into two different ranges, the subitizing range (i.e., quantities from 1-4 which is processed automatically and quickly, and the counting range (i.e., quantities larger than 4 which is an attention demanding procedure and is therefore processed serially and slowly. However, so far no study has tested the automaticity of symbolic and non symbolic representation in DD participants separately for the subitizing and the counting ranges. Methods DD and control participants undergo a novel version of the Stroop task, i.e., the Enumeration Stroop. They were presented with a random series of between one and nine written digits, and were asked to name either the relevant written digit (in the symbolic task or the relevant quantity of digits (in the non symbolic task while ignoring the irrelevant aspect. Result DD participants, unlike the control group, didn't show any congruency effect in the subitizing range of the non symbolic task. Conclusion These findings suggest that DD may be impaired in the ability to process symbolic numerical information or in the ability to automatically associate the two systems (i.e., the symbolic vs. the non symbolic. Additionally DD have deficiencies in the non symbolic counting range.
Furman, Tamar; Rubinsten, Orly
2012-11-28
The question whether Developmental Dyscalculia (DD; a deficit in the ability to process numerical information) is the result of deficiencies in the non symbolic numerical representation system (e.g., a group of dots) or in the symbolic numerical representation system (e.g., Arabic numerals) has been debated in scientific literature. It is accepted that the non symbolic system is divided into two different ranges, the subitizing range (i.e., quantities from 1-4) which is processed automatically and quickly, and the counting range (i.e., quantities larger than 4) which is an attention demanding procedure and is therefore processed serially and slowly. However, so far no study has tested the automaticity of symbolic and non symbolic representation in DD participants separately for the subitizing and the counting ranges. DD and control participants undergo a novel version of the Stroop task, i.e., the Enumeration Stroop. They were presented with a random series of between one and nine written digits, and were asked to name either the relevant written digit (in the symbolic task) or the relevant quantity of digits (in the non symbolic task) while ignoring the irrelevant aspect. DD participants, unlike the control group, didn't show any congruency effect in the subitizing range of the non symbolic task. These findings suggest that DD may be impaired in the ability to process symbolic numerical information or in the ability to automatically associate the two systems (i.e., the symbolic vs. the non symbolic). Additionally DD have deficiencies in the non symbolic counting range.
Symbolic logic and mechanical theorem proving
Chang, Chin-Liang
1969-01-01
This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
Multi-core symbolic bisimulation minimisation
Dijk, Tom van; Pol, Jaco van de
2017-01-01
We introduce parallel symbolic algorithms for bisimulation minimisation, to combat the combinatorial state space explosion along three different paths. Bisimulation minimisation reduces a transition system to the smallest system with equivalent behaviour. We consider strong and branching bisimilarity for interactive Markov chains, which combine labelled transition systems and continuous-time Markov chains. Large state spaces can be represented concisely by symbolic techniques, based on binary...
Symbolism and Advertising in Pop Art
Willis, Nicole
2009-01-01
Introduction The premise of the written work on the subject of Symbolism and Advertising in Pop Art is to reveal that the thread of symbolism, in advertisement and other forms of media, whether it be ancient or contemporary, has been an intrinsic part of all artworks to date and that historically, movements in socio-economic structures of societies and their relative consumerism have been a catalyst in the direction of representational art works. I will first approach the conce...
Culture as a Moving Symbolic Border.
Simão, Lívia Mathias
2016-03-01
The aim of this paper is to propose the notion of culture as a symbolic moving border. Departing from both, Boesch's (1991) concept of culture as a symbolic field of action, and Herbst's (1995) co-genetic logic, I will discuss the dynamics of self-other relationships in terms of their potentiality as sources of movement in culture. A brief analysis of an empirical material is given in illustrative character of the ideas here exposed.
Symbolic dynamics and description of complexity
International Nuclear Information System (INIS)
Hao Bailin.
1992-10-01
Symbolic dynamics provides a general framework to describe complexity of dynamical behaviour. After a discussion of the state of the filed special emphasis will be made on the role of transfer matrix (the Stefan matrix) both in deriving the grammar from known symbolic dynamics and in extracting the rules from experimental data. The block structure of the Stefan matrix may serve as another indicator of complexity of the associated dynamics. (author). 33 refs, 6 figs
Advances in heuristic signal processing and applications
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
New Map Symbol System for Disaster Management
Marinova, Silvia T.
2018-05-01
In the last 10 years Bulgaria was frequently affected by natural and man-made disasters that caused considerable losses. According to the Bulgarian Disaster Management Act (2006) disaster management should be planned at local, regional and national level. Disaster protection is based on plans that include maps such as hazard maps, maps for protection, maps for evacuation planning, etc. Decision-making and cooperation between two or more neighboring municipalities or regions in crisis situation are still rendered difficult because the maps included in the plans differ in scale, colors, map symbols and cartographic design. To improve decision-making process in case of emergency and to reduce the number of human loss and property damages disaster management plans at local and regional level should be supported by detailed thematic maps created in accordance with uniform contents, map symbol system and design. The paper proposes a new symbol system for disaster management that includes a four level hierarchical classification of objects and phenomena according to their type and origin. All objects and phenomena of this classification are divided into five categories: disasters; infrastructure; protection services and infrastructure for protection; affected people and affected infrastructure; operational sites and activities. The symbols of these categories are shown with different background colors and shapes so that they are identifiable. All the symbols have simple but associative design. The new symbol system is used in the design of a series of maps for disaster management at local and regional level.
Further heuristics for $k$-means: The merge-and-split heuristic and the $(k,l)$-means
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 ...
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 ...
The Scientific Import of Symbols in Human Knowledge | Agbanusi ...
African Journals Online (AJOL)
Symbolism, being the use of symbols to represent ideas, it is generally believed that symbolism is restricted to the Arts, especially logic and literature. However, recent developments have shown that symbolism can be an interesting companion and, in fact, a necessary complement, of science. This work X-Rays the ...
36 CFR 264.11 - Use of symbol.
2010-07-01
... 36 Parks, Forests, and Public Property 2 2010-07-01 2010-07-01 false Use of symbol. 264.11 Section... MANAGEMENT Mount St. Helens National Volcanic Monument Symbol § 264.11 Use of symbol. Except as provided in § 264.12, use of the Mount St. Helens National Volcanic Monument official symbol, including a facsimile...
7 CFR 97.900 - Form of official identification symbol.
2010-01-01
... 7 Agriculture 3 2010-01-01 2010-01-01 false Form of official identification symbol. 97.900 Section... symbol. The symbol set forth in Figure 1, containing the words “Plant Variety Protection Office” and “U.S. Department of Agriculture,” shall be the official identification symbol of the Plant Variety Protection...
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.
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
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.
Psaltic Modes - Meanings and Symbolics
Directory of Open Access Journals (Sweden)
Domin Adam
2015-10-01
Full Text Available The Universe of Byzantine music is a profound one, that is why every side should be analysed for getting to the essence of psaltical soul of the singing. Every sign has a certain meaning, every mode has a certain composition and every singing genre is interpreted in a certain way. It is important to search and analyse the historical evolution of every of the mentioned categories for being able to form a holistic image about what Byzantine music meant and means.
Directory of Open Access Journals (Sweden)
Bert Reynvoet
2016-10-01
Full Text Available Recently, a lot of studies in the domain of numerical cognition have been published demonstrating a robust association between numerical symbol processing and individual differences in mathematics achievement. Because numerical symbols are so important for mathematics achievement, many researchers want to provide an answer on the ‘symbol grounding problem’, i.e., how does a symbol acquires its numerical meaning? The most popular account, the ANS mapping account, assumes that a symbol acquires its numerical meaning by being mapped on a non-verbal and Approximate Number System (ANS. Here, we critically evaluate four arguments that are supposed to support this account, i.e., (1 there is an evolutionary system for approximate number processing, (2 non-symbolic and symbolic number processing show the same behavioral effects, (3 non-symbolic and symbolic numbers activate the same brain regions which are also involved in more advanced calculation and (4 non-symbolic comparison is related to the performance on symbolic mathematics achievement tasks. Based on this evaluation, we conclude that all of these arguments and consequently also the mapping account are questionable. Next we explored less popular alternative, where small numerical symbols are initially mapped on a precise representation and then, in combination with increasing knowledge of the counting list result in an independent and exact symbolic system based on order relations between symbols. We evaluate this account by reviewing evidence on order judgement tasks following the same four arguments. Although further research is necessary, the available evidence so far suggests that this symbol-symbol association account should be considered as a worthy alternative of how symbols acquire their meaning.
Reynvoet, Bert; Sasanguie, Delphine
2016-01-01
Recently, a lot of studies in the domain of numerical cognition have been published demonstrating a robust association between numerical symbol processing and individual differences in mathematics achievement. Because numerical symbols are so important for mathematics achievement, many researchers want to provide an answer on the 'symbol grounding problem,' i.e., how does a symbol acquires its numerical meaning? The most popular account, the approximate number system ( ANS ) mapping account , assumes that a symbol acquires its numerical meaning by being mapped on a non-verbal and ANS. Here, we critically evaluate four arguments that are supposed to support this account, i.e., (1) there is an evolutionary system for approximate number processing, (2) non-symbolic and symbolic number processing show the same behavioral effects, (3) non-symbolic and symbolic numbers activate the same brain regions which are also involved in more advanced calculation and (4) non-symbolic comparison is related to the performance on symbolic mathematics achievement tasks. Based on this evaluation, we conclude that all of these arguments and consequently also the mapping account are questionable. Next we explored less popular alternative, where small numerical symbols are initially mapped on a precise representation and then, in combination with increasing knowledge of the counting list result in an independent and exact symbolic system based on order relations between symbols. We evaluate this account by reviewing evidence on order judgment tasks following the same four arguments. Although further research is necessary, the available evidence so far suggests that this symbol-symbol association account should be considered as a worthy alternative of how symbols acquire their meaning.
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.
One visual search, many memory searches: An eye-tracking investigation of hybrid search.
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.
Use of Statistical Heuristics in Everyday Inductive Reasoning.
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…
A Priori Knowledge and Heuristic Reasoning in Architectural Design.
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.…
Refining a Heuristic for Constructing Bayesian Networks from Structured Arguments
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
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.
Fairness and other leadership heuristics: A four-nation study
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
HEURISTIC OPTIMIZATION AND ALGORITHM TUNING APPLIED TO SORPTIVE BARRIER DESIGN
While heuristic optimization is applied in environmental applications, ad-hoc algorithm configuration is typical. We use a multi-layer sorptive barrier design problem as a benchmark for an algorithm-tuning procedure, as applied to three heuristics (genetic algorithms, simulated ...
On Dual Processing and Heuristic Approaches to Moral Cognition
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…
Efficient Heuristics for Simulating Population Overflow in Parallel Networks
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
Swift and Smart Decision Making: Heuristics that Work
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…
Does the inherence heuristic take us to psychological essentialism?
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.
Monte-Carlo Tree Search for Poly-Y
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.
Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling
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...
Driver, Melissa K.; Powell, Sarah R.
2015-01-01
Students often experience difficulty with attaching meaning to mathematics symbols. Many students react to symbols, such as the equal sign, as a command to "do something" or "write an answer" without reflecting upon the proper relational meaning of the equal sign. One method for assessing equal-sign understanding is through…
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.
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.
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)
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)
Augmented neural networks and problem structure-based heuristics for the bin-packing problem
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.
Heuristic Diagrams as a Tool to Teach History of Science
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.
Heuristics: foundations for a novel approach to medical decision making.
Bodemer, Nicolai; Hanoch, Yaniv; Katsikopoulos, Konstantinos V
2015-03-01
Medical decision-making is a complex process that often takes place during uncertainty, that is, when knowledge, time, and resources are limited. How can we ensure good decisions? We present research on heuristics-simple rules of thumb-and discuss how medical decision-making can benefit from these tools. We challenge the common view that heuristics are only second-best solutions by showing that they can be more accurate, faster, and easier to apply in comparison to more complex strategies. Using the example of fast-and-frugal decision trees, we illustrate how heuristics can be studied and implemented in the medical context. Finally, we suggest how a heuristic-friendly culture supports the study and application of heuristics as complementary strategies to existing decision rules.
Symbolic and non-symbolic number magnitude processing in children with developmental dyscalculia.
Castro Cañizares, Danilka; Reigosa Crespo, Vivian; González Alemañy, Eduardo
2012-11-01
The aim of this study was to evaluate if children with Developmental Dyscalculia (DD) exhibit a general deficit in magnitude representations or a specific deficit in the connection of symbolic representations with the corresponding analogous magnitudes. DD was diagnosed using a timed arithmetic task. The experimental magnitude comparison tasks were presented in non-symbolic and symbolic formats. DD and typically developing (TD) children showed similar numerical distance and size congruity effects. However, DD children performed significantly slower in the symbolic task. These results are consistent with the access deficit hypothesis, according to which DD children's deficits are caused by difficulties accessing magnitude information from numerical symbols rather than in processing numerosities per se.
On the symbolism of the white coat.
Nash, David A
2014-12-01
The white coat ceremony has become an academic ritual in the health professions: a ceremony that signals a transformation of status from ordinary student to that of one studying to become a health professional. While donning the white coat is a sign of a changed role, the white coat is also a powerful symbol of transformation. White is a symbol of purity, and the white coat symbolizes the purity of purpose being affirmed in becoming a health professional. Dentistry is afforded the status of a learned profession as a result of the power dentists possess over patients seeking care; this power is based in sophisticated knowledge. Patients must trust that the dentist's knowledge and skills will be used in their best interest-always to benefit, never to exploit. The white coat symbolizes an affirmation on the part of aspiring dentists that their purpose will be pure and that they can be trusted to honor the tradition of the learned professions in placing the interest of patients above self. Absent an emphasis on the symbolic nature of the white coat ceremony, it can simply become an opportunity to publicly congratulate individuals for their success in gaining entrance to the study of dentistry. By understanding its significance, however, the white coat ceremony can serve as a powerful, meaningful ritual emphasizing the transformation occurring within an individual who is entering the profession of dentistry.
Appropriateness of using a symbol to identify dementia and/or delirium.
Hines, Sonia; Abbey, Jenny; Wilson, Jacinda; Sacre, Sandy
2010-09-01
The main objective of this systematic review was to evaluate any published and unpublished evidence regarding the appropriateness of developing a symbol for dementia and/or delirium, which could be used in a variety of settings to indicate that a person has dementia and/or delirium. Using the methods of the Joanna Briggs Institute, we conducted a systematic search of a wide range of databases, Internet resources and unpublished literature. Papers meeting the inclusion criteria were critically appraised by two independent reviewers. Data were extracted, using the standardised tool from the Joanna Briggs Institute, from those papers considered to be of sufficient quality. Because of significant methodological heterogeneity, no meta-analysis was possible and results are presented narratively instead. From a total of 37 retrieved papers, 18 were found to be of sufficient relevance and quality to be included in the review. There was general consensus among the literature that a symbol for dementia is appropriate in the acute care setting. It was also clear from the research that an abstract symbol, as opposed to one that explicitly attempts to depict dementia, was most acceptable to staff, people with dementia and their carers. Both staff and health consumers seem to have largely positive perceptions and attitudes towards the use of a symbol for dementia. Families and carers of people with dementia are frequently concerned about their loved one wandering away and becoming lost and unable to identify themselves, and these concerns seem to outweigh any reservations they hold about the use of a symbol or some other identifier. In healthcare settings the use of symbols to indicate special needs seems well established and widely accepted. However, regarding the use of a symbol for dementia in the broader community, there remain concerns about issues such as stigmatisation and the potential for victimisation of this vulnerable population and so further research is indicated
QuickVina: accelerating AutoDock Vina using gradient-based heuristics for global optimization.
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.
SPARSE: quadratic time simultaneous alignment and folding of RNAs without sequence-based heuristics.
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.
SPARSE: quadratic time simultaneous alignment and folding of RNAs without sequence-based heuristics
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
Symbols and schemas in emotional eating
DEFF Research Database (Denmark)
Grunert, Suzanne C.
1995-01-01
. Particularly the aspects of security and pleasure are suggested to be important motivators for emotional eating. How these symbolic meanings relate to eating as a regulatory device for emotions is explained by a schema- theoretical approach distinguishing between automatic adaptation mechanisms and strategic......Emotional eating behaviour has been of interest to psychologists exclusively as a disorder. However, evidence suggests that it is a common aspect of normal food habits, initiated by both positive and negative emotions in order to regulate these. T behaviour thus serves to regain or preserve...... the psycho-mental homeostasis. To explain this phenomenon it is first shown which symbolic meanings are associated with eating and foods. The numerous connotations can be grouped into four basic dimensions: Security and pleasure as self-oriented, and status and prestige as socially oriented emotional symbols...
Anomalous diffusion in a symbolic model
International Nuclear Information System (INIS)
Ribeiro, H V; Lenzi, E K; Mendes, R S; Santoro, P A
2011-01-01
In this work, we investigate some statistical properties of symbolic sequences generated by a numerical procedure in which the symbols are repeated following the power-law probability density. In this analysis, we consider that the sum of n symbols represents the position of a particle in erratic movement. This approach reveals a rich diffusive scenario characterized by non-Gaussian distribution and, depending on the power-law exponent or the procedure used to build the walker, we may have superdiffusion, subdiffusion or usual diffusion. Additionally, we use the continuous-time random walk framework to compare the analytic results with the numerical data, thereby finding good agreement. Because of its simplicity and flexibility, this model can be a candidate for describing real systems governed by power-law probability densities.
Second International workshop Geometry and Symbolic Computation
Walczak, Paweł; Geometry and its Applications
2014-01-01
This volume has been divided into two parts: Geometry and Applications. The geometry portion of the book relates primarily to geometric flows, laminations, integral formulae, geometry of vector fields on Lie groups, and osculation; the articles in the applications portion concern some particular problems of the theory of dynamical systems, including mathematical problems of liquid flows and a study of cycles for non-dynamical systems. This Work is based on the second international workshop entitled "Geometry and Symbolic Computations," held on May 15-18, 2013 at the University of Haifa and is dedicated to modeling (using symbolic calculations) in differential geometry and its applications in fields such as computer science, tomography, and mechanics. It is intended to create a forum for students and researchers in pure and applied geometry to promote discussion of modern state-of-the-art in geometric modeling using symbolic programs such as Maple™ and Mathematica®, as well as presentation of new results. ...
[The heuristics of reaching a diagnosis].
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.
Heuristics and bias in rectal surgery.
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.
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.
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
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.
Pauszek, Joseph R; Gibson, Bradley S
2018-04-30
Here we propose a rational analysis account of voluntary symbolic attention control-the Least Costs Hypothesis (LCH)-that construes voluntary control as a decision between intentional cue use and unguided search. Consistent with the LCH, the present study showed that this decision is sensitive to variations in cue processing efficiency. In Experiment 1, observers demonstrated a robust preference for using "easy-to-process" arrow cues but not "hard-to-process" spatial word cues to satisfy an easy visual search goal; Experiment 2 showed that this preference persisted even when the temporal costs of cue processing were neutralized. Experiment 3 showed that observers reported this cue type preference outside the context of a speeded task, and Experiment 4 showed empirical measures of this bias to be relatively stable over the course of the task. Together with previous evidence suggesting that observers' decision between intentional cue use and unguided search is also influenced by variations in unguided search efficiency, these findings suggest that voluntary symbolic attention control is mediated by ongoing metacognitive evaluations of demand that are sensitive to perceived variations in the time, effort, and opportunity costs associated with each course of action. Thus, voluntary symbolic attention control is far more complex than previously held. (PsycINFO Database Record (c) 2018 APA, all rights reserved).
Symbolic comparisons of objects on color attributes.
Paivio, A; te Linde, J
1980-11-01
Symbolic comparisons of object brightness and color were investigated in two experiments using words and outline drawings as stimuli. Both experiments yielded orderly symbolic distance effects. Contrary to prediction, no reliable picture advantages emerged. For color comparison, individual differences in word fluency and color memory predicted decision time with word stimuli. These results contrast sharply with those of previous comparison studies involving concrete dimensions. The results are discussed in terms of dual-coding theory and the role of verbal mechanisms in memory for object color.
Carrier and symbol synchronization system performance study
Lindsey, W. C.
1976-01-01
Results pertinent to predicting the performance of convolutionally encoded binary phase-shift keyed communication links were presented. The details of the development are provided in four sections. These sections are concerned with developing the bit error probability performance degradations due to PN despreading by a time-shared delay locked loop, the Costas demodulation process, symbol synchronization effects and cycle slipping phenomena in the Costas loop. In addition, Costas cycle slipping probabilities are studied as functions of Doppler count time and signal-to-noise conditions. The effect of cycle slipping in the symbol synchronizer is also studied as a function of channel Doppler and other frequency uncertainties.
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...
The impact of symbolic and non-symbolic quantity on spatial learning.
Directory of Open Access Journals (Sweden)
Koleen McCrink
Full Text Available An implicit mapping of number to space via a "mental number line" occurs automatically in adulthood. Here, we systematically explore the influence of differing representations of quantity (no quantity, non-symbolic magnitudes, and symbolic numbers and directional flow of stimuli (random flow, left-to-right, or right-to-left on learning and attention via a match-to-sample working memory task. When recalling a cognitively demanding string of spatial locations, subjects performed best when information was presented right-to-left. When non-symbolic or symbolic numerical arrays were embedded in these spatial locations, and mental number line congruency prompted, this effect was attenuated and in some cases reversed. In particular, low-performing female participants who viewed increasing non-symbolic number arrays paired with the spatial locations exhibited better recall for left-to-right directional flow information relative to right-to-left, and better processing for the left side of space relative to the right side of space. The presence of symbolic number during spatial learning enhanced recall to a greater degree than non-symbolic number--especially for female participants, and especially when cognitive load is high--and this difference was independent of directional flow of information. We conclude that quantity representations have the potential to scaffold spatial memory, but this potential is subtle, and mediated by the nature of the quantity and the gender and performance level of the learner.
The recognition heuristic: a review of theory and tests.
Pachur, Thorsten; Todd, Peter M; Gigerenzer, Gerd; Schooler, Lael J; Goldstein, Daniel G
2011-01-01
The recognition heuristic is a prime example of how, by exploiting a match between mind and environment, a simple mental strategy can lead to efficient decision making. The proposal of the heuristic initiated a debate about the processes underlying the use of recognition in decision making. We review research addressing four key aspects of the recognition heuristic: (a) that recognition is often an ecologically valid cue; (b) that people often follow recognition when making inferences; (c) that recognition supersedes further cue knowledge; (d) that its use can produce the less-is-more effect - the phenomenon that lesser states of recognition knowledge can lead to more accurate inferences than more complete states. After we contrast the recognition heuristic to other related concepts, including availability and fluency, we carve out, from the existing findings, some boundary conditions of the use of the recognition heuristic as well as key questions for future research. Moreover, we summarize developments concerning the connection of the recognition heuristic with memory models. We suggest that the recognition heuristic is used adaptively and that, compared to other cues, recognition seems to have a special status in decision making. Finally, we discuss how systematic ignorance is exploited in other cognitive mechanisms (e.g., estimation and preference).
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.
The Recognition Heuristic: A Review of Theory and Tests
Pachur, Thorsten; Todd, Peter M.; Gigerenzer, Gerd; Schooler, Lael J.; Goldstein, Daniel G.
2011-01-01
The recognition heuristic is a prime example of how, by exploiting a match between mind and environment, a simple mental strategy can lead to efficient decision making. The proposal of the heuristic initiated a debate about the processes underlying the use of recognition in decision making. We review research addressing four key aspects of the recognition heuristic: (a) that recognition is often an ecologically valid cue; (b) that people often follow recognition when making inferences; (c) that recognition supersedes further cue knowledge; (d) that its use can produce the less-is-more effect – the phenomenon that lesser states of recognition knowledge can lead to more accurate inferences than more complete states. After we contrast the recognition heuristic to other related concepts, including availability and fluency, we carve out, from the existing findings, some boundary conditions of the use of the recognition heuristic as well as key questions for future research. Moreover, we summarize developments concerning the connection of the recognition heuristic with memory models. We suggest that the recognition heuristic is used adaptively and that, compared to other cues, recognition seems to have a special status in decision making. Finally, we discuss how systematic ignorance is exploited in other cognitive mechanisms (e.g., estimation and preference). PMID:21779266
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.
Comparative study of heuristic evaluation and usability testing methods.
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.
Children’s Non-symbolic, Symbolic Addition and Their Mapping Capacity at 4–7 Years Old
Directory of Open Access Journals (Sweden)
Yanjun Li
2017-07-01
Full Text Available The study aimed to examine the developmental trajectories of non-symbolic and symbolic addition capacities in children and the mapping ability between these two. We assessed 106 4- to 7-year-old children and found that 4-year-olds were able to do non-symbolic addition but not symbolic addition. Five-year-olds and older were able to do symbolic addition and their performance in symbolic addition exceeded non-symbolic addition in grade 1 (approximate age 7. These results suggested non-symbolic addition ability emerges earlier and is less affected by formal mathematical education than symbolic addition. Meanwhile, we tested children’s bi-directional mapping ability using a novel task and found that children were able to map between symbolic and non-symbolic representations of number at age 5. Their ability in mapping non-symbolic to symbolic number became more proficient in grade 1 (approximate age 7. This suggests children at age 7 have developed a relatively mature symbolic representation system.
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.
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...
Motor heuristics and embodied choices: how to choose and act.
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.
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....
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.
Bioeconomy, Moral Friction and Symbolic Law
DEFF Research Database (Denmark)
Hoeyer, Klaus
2016-01-01
several competing agendas are at play and to understand the effects, we therefore need to investigate empirically what emerges through this friction between competing governmental ambitions. My discussion is based on studies of tissue exchange in Europe and seeks to integrate theories of symbolic law...
Sigref - A Symbolic Bisimulation Tool Box
Wimmer, Ralf; Herbstritt, Marc; Hermanns, Holger; Strampp, Kelley; Becker, Bernd; Graf, Susanne; Zhang, Wenhui
2006-01-01
We present a uniform signature-based approach to compute the most popular bisimulations. Our approach is implemented symbolically using BDDs, which enables the handling of very large transition systems. Signatures for the bisimulations are built up from a few generic building blocks, which naturally
Two Pieces of Wood: Symbols of Control.
Lee, Sharon Shockley; McKerrow, K. Kelly
For 2 years, at least 2 days a week were spent by a researcher in observing, through the actions of the principal, the dynamics of cultural and ideologic conflict and the process of social control in an elementary school. This personal account analyzes the principal's use of corporal punishment, symbolized by the paddle, and positive…
The Design of Tactile Thematic Symbols
Lawrence, Megan M.; Lobben, Amy K.
2011-01-01
The study reported here investigated the design and legibility of tactile thematic maps, focusing on symbolization and the comprehension of spatial patterns on the maps. The results indicate that discriminable and effective tactile thematic maps can be produced using classed data with a microcapsule paper production method. The participants…
Driving Symbolic Consumption through Imagined Vertical Movements
DEFF Research Database (Denmark)
Ostinelli, Massimiliano; Ringberg, Torsten; Luna, David
Drawing on theories of embodied cognition and compensatory consumption, we provide evidence that merely imagining oneself moving upward or downward affects preference for symbolic products. Altogether, two studies show that magining taking an elevator down, as opposed to up, decreases self...
The asymptotic expansion method via symbolic computation
Navarro, Juan F.
2012-01-01
This paper describes an algorithm for implementing a perturbation method based on an asymptotic expansion of the solution to a second-order differential equation. We also introduce a new symbolic computation system which works with the so-called modified quasipolynomials, as well as an implementation of the algorithm on it.
The Asymptotic Expansion Method via Symbolic Computation
Directory of Open Access Journals (Sweden)
Juan F. Navarro
2012-01-01
Full Text Available This paper describes an algorithm for implementing a perturbation method based on an asymptotic expansion of the solution to a second-order differential equation. We also introduce a new symbolic computation system which works with the so-called modified quasipolynomials, as well as an implementation of the algorithm on it.
Basic symbol for ionizing radiations (second revision)
International Nuclear Information System (INIS)
1992-01-01
Includes a detailed description of basic symbol for ionizing radiations to be used to prevent about the presence, or possibility of presence, of ionizing radiations (X-ray, gamma radiation, particles, electrons, neutrons and protons), as well as to identify radioactive devices and materials
Categorical Design Departure and Symbolic Enhancement
DEFF Research Database (Denmark)
Krabbe, Anders Dahl
by showing how product form design can impact the selection of dominant technological designs within industries by enhancing the symbolic attributes of products. A longitudinal case study was carried out of the establishment of a new dominant technological architecture in the hearing aid industry...
A Simple Sketch Symbolizing Self-Reliance
Centers for Disease Control (CDC) Podcasts
2017-02-16
EID Managing Editor, Byron Breedlove, reads his cover art story, A Simple Sketch Symbolizing Self-Reliance. Created: 2/16/2017 by National Center for Emerging and Zoonotic Infectious Diseases (NCEZID). Date Released: 2/16/2017.
Strengthening National Identity through National Symbols and ...
African Journals Online (AJOL)
South Africans vacillate in their national identity and remain largely attached to their racial and ethnic group identities. The aim of this article is to illustrate the manner in which a sense of understanding, familiarity and pride with regard to national symbols and thus to national identity can be attained. The objective is that the ...
Symbolic generation of finite difference formulas
International Nuclear Information System (INIS)
Keller, H.; Pereyra, V.
1978-01-01
Tables of coefficients for high order accurate, compact approximations to the first ten derivatives on and at the midpoints of uniform nets are presented. The exact rational weights are generated and tested by means of symbolic manipulation implemented through MACSYMA. These weights are required in the application of deferred corrections to new methods for solving higher order two point boundary value problems
Program verification using symbolic game semantics
DEFF Research Database (Denmark)
Dimovski, Aleksandar
2014-01-01
, especially on its second-order recursion-free fragment with infinite data types. We revisit the regular-language representation of game semantics of this language fragment. By using symbolic values instead of concrete ones, we generalize the standard notions of regular-language and automata representations...
Multiple-Symbol Differential Detection Of MPSK
Divsalar, Dariush; Simon, Marvin K.
1991-01-01
Multiple-symbol differential detection proposed for reception of radio-frequency signals modulated by mutliple-phase-shift keying (MPSK). Offers advantage of less complexity in not requiring equipment to acquire and track carrier signal. Performance approaches that of ideal coherent detection. Applicable to coded as well as uncoded MPSK, and to other forms of modulation.
Berezin symbols and Borel summability | Garayev | Quaestiones ...
African Journals Online (AJOL)
We prove in terms of so-called Berezin symbols some theorems for Borel summability method for sequences and series of complex numbers. Namely, we characterize the Borel convergent sequences and series; prove regularity of Borel summability method, and prove a new Tauberian type theorem for Borel summability.
Television and Children: A Symbolic Interactionist Perspective.
Dunn, Thomas P.; Cardwell, Jerry D.
1984-01-01
Contends that the effect of television can best be understood as part of the overall attempts by social scientists to understand the effects of the mass media. Argues that symbolic interactionism is the most viable theory for bringing together the pure and the applied aspects of this issue. (LLL)
Symbolic Interactionism and Social Action Theory
Morrione, Thomas J.
1975-01-01
An explanation and elaboration of existing theory on interaction, this article describes a point of convergence between Parsons' Voluntaristic Theory of Action and Blumer's conceptualization of Symbolic Interactionism and develops specific problems of divergence in these normative and interpretive models of interaction. (JC)
Generating and Solving Symbolic Parity Games
Directory of Open Access Journals (Sweden)
Gijs Kant
2014-07-01
Full Text Available We present a new tool for verification of modal mu-calculus formulae for process specifications, based on symbolic parity games. It enhances an existing method, that first encodes the problem to a Parameterised Boolean Equation System (PBES and then instantiates the PBES to a parity game. We improved the translation from specification to PBES to preserve the structure of the specification in the PBES, we extended LTSmin to instantiate PBESs to symbolic parity games, and implemented the recursive parity game solving algorithm by Zielonka for symbolic parity games. We use Multi-valued Decision Diagrams (MDDs to represent sets and relations, thus enabling the tools to deal with very large systems. The transition relation is partitioned based on the structure of the specification, which allows for efficient manipulation of the MDDs. We performed two case studies on modular specifications, that demonstrate that the new method has better time and memory performance than existing PBES based tools and can be faster (but slightly less memory efficient than the symbolic model checker NuSMV.
Symbolic approximate time-optimal control
Mazo, Manuel; Tabuada, Paulo
There is an increasing demand for controller design techniques capable of addressing the complex requirements of today's embedded applications. This demand has sparked the interest in symbolic control where lower complexity models of control systems are used to cater for complex specifications given