To see the other types of publications on this topic, follow the link: Heuristic analyzer.
Journal articles on the topic 'Heuristic analyzer'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Heuristic analyzer.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Hrihorenko, I., S. Hrihorenko, and E. Bezborodyi. "Use of the Fuzzy-Logic for Control of Accuracy and Increase of Production Quality." Metrology and instruments, no. 3 (March 7, 2018): 52–57. http://dx.doi.org/10.33955/2307-2180(3)2018.52-57.
Full textAbstract:
The paper deals with the solution of the scientific and practical task of controlling the accuracy of the parameters of the process of making kefir and improving its quality by creating a heuristic analyzer based on the user interface of the fuzzy logic system.
The factors influencing the accuracy of the operation of the digital meter are analyzed, the possibility of using the fuzzy logic apparatus has been proved to determine the parameters of the technological process that ensure the maximum quality of the product. Computer simulation was carried out, which confirmed that the creation of a heuristic analyzer for determining the quality of yogurt is appropriate and necessary in order to prevent the production of low-quality products through the definition of the stage of production on which there is a deviation of the technology and timely eliminate the violation.
2
CORBETT, DAN. "HYBRID HEURISTIC SEMANTIC NETWORKS IN NATURAL LANGUAGE UNDERSTANDING." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 03, no. 04 (December 1995): 389–400. http://dx.doi.org/10.1142/s0218488595000190.
Full textAbstract:
It has never been demonstrated that a pure semantic analysts of an English sentence can be accomplished without any aid from a syntactic analyzer. It has therefore become interesting to demonstrate semantic systems which can be guided by fast and efficient syntactic methods. We show that non-probabilistic, abductive techniques can be used in a hybrid network to correctly interpret the meaning of an English sentence. We discuss the implementation of an abductive system which uses heuristics working together with a semantic network in an attempt to eliminate uncertainty and ambiguity in natural language text.
3
Dharmalingam, Jeya Mala, and M. Eswaran. "An Agent Based Intelligent Dynamic Vulnerability Analysis Framework for Critical SQLIA Attacks." International Journal of Intelligent Information Technologies 14, no. 3 (July 2018): 56–82. http://dx.doi.org/10.4018/ijiit.2018070104.
Full textAbstract:
This article describes how software vulnerability analysis and testing for web applications should detect not only the common attacks but also dynamic vulnerability attacks. These are the attacks such as structured query language injection attacks (SQLIAs) which will extract the most crucial user information from the targeted database. In this proposed approach, an intelligent agent namely intelligent vulnerability analyzer agent (IVA) is proposed in which the external attacks due to dynamic user inputs are identified using a heuristic-guided intelligent graph searching and then a pre and post condition based analysis is performed to identify the dynamic vulnerabilities. Further, the proposed approach is compared with some of the existing works based on the number of false positives and false negatives of attacks detection and confirmed that the proposed work is a novel and effective one in finding out SQLIAs.
4
Diamond, L. W., G. Priolet, C. Sultan, and D. T. Nguyen. "Expert System Design in Hematology Diagnosis." Methods of Information in Medicine 31, no. 02 (1992): 82–89. http://dx.doi.org/10.1055/s-0038-1634864.
Full textAbstract:
Abstract:A two-part study was designed to test the hypothesis that sufficient information is available from a modern hematology analyzer (the Coulter STKS) to reach a reliable intermediate conclusion which can be used as input to the next decision-making level in the design of a high-performance expert system for hematology diagnosis. In phase one, we analyzed the performance of three probabilistic systems (using Bayes’ rule) which interpret STKS data: a control system which took the traditional approach of classifying cases into specific diagnoses, and two test systems which were designed to reach only an intermediate conclusion but not a final diagnosis. One of the test systems classified cases into “textbook categories” of disease and the other utilized defined diagnostic patterns. The systems were tested with 150 cases. The pattern approach ranked the correct choice first in 141 of 150 cases (94%). In phase two, we abandoned Bayes’ rule, reformulated the pattern approach into a heuristic classification system, and tested its reliability on 820 cases. The algorithm of the reformulated system was able to classify all 820 cases into the same predominant pattern as a panel of three experienced laboratory hematologists.
5
Santos, André S., Ana M. Madureira, and Leonilde R. Varela. "A Self-Parametrization Framework for Meta-Heuristics." Mathematics 10, no. 3 (February 1, 2022): 475. http://dx.doi.org/10.3390/math10030475.
Full textAbstract:
Even while the scientific community has shown great interest in the analysis of meta-heuristics, the analysis of their parameterization has received little attention. It is the parameterization that will adapt a meta-heuristic to a problem, but it is still performed, mostly, empirically. There are multiple parameterization techniques; however, they are time-consuming, requiring considerable computational effort and they do not take advantage of the meta-heuristics that they parameterize. In order to approach the parameterization of meta-heuristics, in this paper, a self-parameterization framework is proposed. It will automatize the parameterization as an optimization problem, precluding the user from spending too much time on parameterization. The model will automate the parameterization through two meta-heuristics: A meta-heuristic of the solution space and one of the parameter space. To analyze the performance of the framework, a self-parameterization prototype was implemented. The prototype was compared and analyzed in a SP (scheduling problem) and in the TSP (traveling salesman problem). In the SP, the prototype found better solutions than those of the manually parameterized meta-heuristics, although the differences were not statistically significant. In the TSP, the self-parameterization prototype was more effective than the manually parameterized meta-heuristics, this time with statistically significant differences.
6
Jasper, Fabian, and Tuulia M. Ortner. "The Tendency to Fall for Distracting Information While Making Judgments." European Journal of Psychological Assessment 30, no. 3 (January 1, 2014): 193–207. http://dx.doi.org/10.1027/1015-5759/a000214.
Full textAbstract:
Despite much research on thinking biases such as the representativeness, availability, and anchoring heuristics, a psychometrically sound measurement instrument for assessing the degree of heuristic thinking is still missing. Therefore, it was the goal of this study to develop and validate a new test to assess the degree of heuristic thinking associated with three particular thinking heuristics (i.e., the representativeness, availability, and anchoring heuristics). The resulting Objective Heuristic Thinking Test (OHTT) was evaluated with regard to its internal consistency, factor structure, construct validity, and stability in an internet sample (N = 300) and an independent laboratory sample (N = 55). Exploratory factor analyses resulted in three latent factors that represented the three OHTT subscales (i.e., representativeness, availability, and anchoring factors). Results revealed a low to sufficient internal consistency for each of the three scales. Further analyses indicated convergent correlations of the OHTT scales with related constructs such as field-independency. Furthermore, good stability of the test scores was shown. Conclusions are drawn regarding possible future applications of the OHTT as a promising tool for studying the origins of heuristic thinking processes.
7
Erkol, Şirag, and Gönenç Yücel. "Influence maximization based on partial network structure information: A comparative analysis on seed selection heuristics." International Journal of Modern Physics C 28, no. 10 (October 2017): 1750122. http://dx.doi.org/10.1142/s0129183117501224.
Full textAbstract:
In this study, the problem of seed selection is investigated. This problem is mainly treated as an optimization problem, which is proved to be NP-hard. There are several heuristic approaches in the literature which mostly use algorithmic heuristics. These approaches mainly focus on the trade-off between computational complexity and accuracy. Although the accuracy of algorithmic heuristics are high, they also have high computational complexity. Furthermore, in the literature, it is generally assumed that complete information on the structure and features of a network is available, which is not the case in most of the times. For the study, a simulation model is constructed, which is capable of creating networks, performing seed selection heuristics, and simulating diffusion models. Novel metric-based seed selection heuristics that rely only on partial information are proposed and tested using the simulation model. These heuristics use local information available from nodes in the synthetically created networks. The performances of heuristics are comparatively analyzed on three different network types. The results clearly show that the performance of a heuristic depends on the structure of a network. A heuristic to be used should be selected after investigating the properties of the network at hand. More importantly, the approach of partial information provided promising results. In certain cases, selection heuristics that rely only on partial network information perform very close to similar heuristics that require complete network data.
8
Rott, Benjamin. "Rethinking heuristics – characterizations and vignettes." Lumat: International Journal of Math, Science and Technology Education 3, no. 1 (February 28, 2015): 122–26. http://dx.doi.org/10.31129/lumat.v3i1.1055.
Full textAbstract:
The concept of “heuristics” or “heuristic strategies” is central to (mathematical) problem solving and related research; however, there is no generally accepted definition of this term. Trying to clarify the concept might help avoiding misunderstandings and difficulties in dealing with studies that use different terms meaning the same concepts or that use the same terms meaning different concepts. Therefore, the research presented in this paper aims at a clarification of the term “heuristics” and suggestions for the use of it in future research. Building on previous work from last year’s ProMath conference, the consequences of using different characterizations of “heuristics” on vignettes (= short, completed scenes) of problem solving attempts are investigated. The conceptualization of “heuristics” has a significant influence on the types and numbers of perceived heuristics, which in turn affects empirical studies that identify and analyze heuristic strategies.
9
Kasoga, Pendo Shukrani. "Heuristic biases and investment decisions: multiple mediation mechanisms of risk tolerance and financial literacy—a survey at the Tanzania stock market." Journal of Money and Business 1, no. 2 (November 1, 2021): 102–16. http://dx.doi.org/10.1108/jmb-10-2021-0037.
Full textAbstract:
PurposeThe purpose of this research is to examine the effect of heuristic biases on investment decisions through multiple mediation mechanisms of risk tolerance and financial literacy in the Tanzanian stock market.Design/methodology/approachA sample of 316 individual investors in the Tanzanian stock market was obtained through questionnaires. The data were analyzed using structural equation modeling (SEM).FindingsThe findings show that financial literacy mediates insignificantly the effects of overconfidence, availability, anchoring and representativeness heuristics on investment decisions. Further, financial literacy does not influence the effect of risk tolerance and investment decisions. Risk tolerance is confirmed as a positive mediator of overconfidence, availability, anchoring and representativeness heuristics in investment decisions. Also, the study shows that overconfidence exerts a stronger influence on investment decisions, followed by availability, representativeness, risk tolerance, anchoring and financial literacy.Research limitations/implicationsThe study deals with real investors. Therefore, it uses fewer items to measure the constructs in order to avoid respondent bias. Further research could examine the effects of heuristic biases on investment decisions by adding or modifying the items of particular constructs and studying institutional investors.Practical implicationsThe findings can help individual investors to analyze and evaluate their behavior toward stock selection. Securities institutions can use this research to understand investors' behavior, evaluate future market trends and provide advice to the investors.Originality/valuePrevious studies have examined the impact of heuristics on the investment decisions of individual investors. The unique empirical analysis developed in this paper is that it examines the multiple mediation mechanisms of risk tolerance and financial literacy with respect to heuristic biases and investment decisions in the Tanzanian stock market.
10
Castro, Margarita Paz, Chiara Piacentini, Andre Augusto Cire, and J. Christopher Beck. "Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics." Journal of Artificial Intelligence Research 67 (March 19, 2020): 607–51. http://dx.doi.org/10.1613/jair.1.11659.
Full textAbstract:
We investigate the use of relaxed decision diagrams (DDs) for computing admissible heuristics for the cost-optimal delete-free planning (DFP) problem. Our main contributions are the introduction of two novel DD encodings for a DFP task: a multivalued decision diagram that includes the sequencing aspect of the problem and a binary decision diagram representation of its sequential relaxation. We present construction algorithms for each DD that leverage these different perspectives of the DFP task and provide theoretical and empirical analyses of the associated heuristics. We further show that relaxed DDs can be used beyond heuristic computation to extract delete-free plans, find action landmarks, and identify redundant actions. Our empirical analysis shows that while DD-based heuristics trail the state of the art, even small relaxed DDs are competitive with the linear programming heuristic for the DFP task, thus, revealing novel ways of designing admissible heuristics.
11
Vilar Jacob, Vinícius, and José Elias C. Arroyo. "ILS Heuristics for the Single-Machine Scheduling Problem with Sequence-Dependent Family Setup Times to Minimize Total Tardiness." Journal of Applied Mathematics 2016 (2016): 1–15. http://dx.doi.org/10.1155/2016/9598041.
Full textAbstract:
This paper addresses a single-machine scheduling problem with sequence-dependent family setup times. In this problem the jobs are classified into families according to their similarity characteristics. Setup times are required on each occasion when the machine switches from processing jobs in one family to jobs in another family. The performance measure to be minimized is the total tardiness with respect to the given due dates of the jobs. The problem is classified asNP-hard in the ordinary sense. Since the computational complexity associated with the mathematical formulation of the problem makes it difficult for optimization solvers to deal with large-sized instances in reasonable solution time, efficient heuristic algorithms are needed to obtain near-optimal solutions. In this work we propose three heuristics based on the Iterated Local Search (ILS) metaheuristic. The first heuristic is a basic ILS, the second uses a dynamic perturbation size, and the third uses a Path Relinking (PR) technique as an intensification strategy. We carry out comprehensive computational and statistical experiments in order to analyze the performance of the proposed heuristics. The computational experiments show that the ILS heuristics outperform a genetic algorithm proposed in the literature. The ILS heuristic with dynamic perturbation size and PR intensification has a superior performance compared to other heuristics.
12
PETIT, JORDI. "COMBINING SPECTRAL SEQUENCING AND PARALLEL SIMULATED ANNEALING FOR THE MINLA PROBLEM." Parallel Processing Letters 13, no. 01 (March 2003): 77–91. http://dx.doi.org/10.1142/s0129626403001161.
Full textAbstract:
In this paper we present and analyze new sequential and parallel heuristics to approximate the Minimum Linear Arrangement problem (MinLA). The heuristics consist in obtaining a first global solution using Spectral Sequencing and improving it locally through Simulated Annealing. In order to accelerate the annealing process, we present a special neighborhood distribution that tends to favor moves with high probability to be accepted. We show how to make use of this neighborhood to parallelize the Metropolis stage on distributed memory machines by mapping partitions of the input graph to processors and performing moves concurrently. The paper reports the results obtained with this new heuristic when applied to a set of large graphs, including graphs arising from finite elements methods and graphs arising from VLSI applications. Compared to other heuristics, the measurements obtained show that the new heuristic improves the solution quality, decreases the running time and offers an excellent speedup when ran on a commodity network made of nine personal computers.
13
Lam, William, Kalev Kask, Javier Larrosa, and Rina Dechter. "Residual-Guided Look-Ahead in AND/OR Search for Graphical Models." Journal of Artificial Intelligence Research 60 (October 20, 2017): 287–346. http://dx.doi.org/10.1613/jair.5475.
Full textAbstract:
We introduce the concept of local bucket error for the mini-bucket heuristics and show how it can be used to improve the power of AND/OR search for combinatorial optimization tasks in graphical models (e.g. MAP/MPE or weighted CSPs). The local bucket error illuminates how the heuristic errors are distributed in the search space, guided by the mini-bucket heuristic. We present and analyze methods for compiling the local bucket-errors (exactly and approximately) and show that they can be used to yield an effective tool for balancing look-ahead overhead during search. This can be especially instrumental when memory is restricted, accommodating the generation of only weak compiled heuristics. We illustrate the impact of the proposed schemes in an extensive empirical evaluation for both finding exact solutions and anytime suboptimal solutions.
14
Lissovoi, Andrei, Pietro Oliveto, and John Alasdair Warwicker. "How the Duration of the Learning Period Affects the Performance of Random Gradient Selection Hyper-Heuristics." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 03 (April 3, 2020): 2376–83. http://dx.doi.org/10.1609/aaai.v34i03.5617.
Full textAbstract:
Recent analyses have shown that a random gradient hyper-heuristic (HH) using randomised local search (RLSk) low-level heuristics with different neighbourhood sizes k can optimise the unimodal benchmark function LeadingOnes in the best expected time achievable with the available heuristics, if sufficiently long learning periods τ are employed. In this paper, we examine the impact of the learning period on the performance of the hyper-heuristic for standard unimodal benchmark functions with different characteristics: Ridge, where the HH has to learn that RLS1 is always the best low-level heuristic, and OneMax, where different low-level heuristics are preferable in different areas of the search space. We rigorously prove that super-linear learning periods τ are required for the HH to achieve optimal expected runtime for Ridge. Conversely, a sub-logarithmic learning period is the best static choice for OneMax, while using super-linear values for τ increases the expected runtime above the asymptotic unary unbiased black box complexity of the problem. We prove that a random gradient HH which automatically adapts the learning period throughout the run has optimal asymptotic expected runtime for both OneMax and Ridge. Additionally, we show experimentally that it outperforms any static learning period for realistic problem sizes.
15
Falzon, Geoffrey, and Maozhen Li. "Evaluating Heuristics for Scheduling Dependent Jobs in Grid Computing Environments." International Journal of Grid and High Performance Computing 2, no. 4 (October 2010): 65–80. http://dx.doi.org/10.4018/jghpc.2010100106.
Full textAbstract:
Job scheduling plays a critical role in the utilisation of grid resources by mapping a number of jobs to grid resources. However, the heterogeneity of grid resources adds some challenges to the work of job scheduling, especially when jobs have dependencies which can be represented as Direct Acyclic Graphs (DAGs). It is widely recognised that scheduling m jobs to n resources with an objective to achieve a minimum makespan has shown to be NP-complete, requiring the development of heuristics. Although a number of heuristics are available for job scheduling optimisation, selecting the best heuristic to use in a given grid environment remains a difficult problem due to the fact that the performance of each original heuristic is usually evaluated under different assumptions. This paper evaluates 12 representative heuristics for dependent job scheduling under one set of common assumptions. The results are presented and analysed, which provides an even basis in comparison of the performance of those heuristics. To facilitate performance evaluation, a DAG simulator is implemented which provides a set of tools for DAG job configuration, execution, and monitoring. The components of the DAG simulator are also presented in this paper.
16
Meinert, Judith, and Nicole C. Krämer. "How the expertise heuristic accelerates decision-making and credibility judgments in social media by means of effort reduction." PLOS ONE 17, no. 3 (March 16, 2022): e0264428. http://dx.doi.org/10.1371/journal.pone.0264428.
Full textAbstract:
Real-time communication, unlimited distribution of information, and the lack of editorial supervision in social media communication aggravate recipients’ credibility evaluations and information selection by what aspects of the source such as expertise have emerged as important anchors for evaluations. It has long been assumed that credibility judgments in social media are specifically guided by heuristics. However, the existing studies merely give indications, for example, based on individuals’ self-report but do not test whether important attributes and prerequisites of heuristic decision-making, such as effort reduction, are present. Against this background, the current study (N = 185) analyses by applying a reduced two-alternative choice paradigm whether the relation between the expertise cue and credibility judgments and the choice of information sources is guided by a heuristic, namely the expertise heuristic. Findings indicate that the presence of the expertise cue reduced respondents’ task latencies significantly, although participants’ decision behavior was not independent from additional information. This is discussed in detail with recourse to theoretical conceptualizations of cognitive heuristics.
17
Yundt, P. E., B. W. Baetz, and G. G. Patry. "Heuristic and simulation techniques for the scheduling of hazardous waste processing in an integrated treatment facility." Canadian Journal of Civil Engineering 21, no. 5 (October 1, 1994): 752–61. http://dx.doi.org/10.1139/l94-081.
Full textAbstract:
The basic strategies for optimizing processing schedules of hazardous waste in an integrated hazardous waste treatment facility are analyzed. Five schedule optimization heuristics were evaluated on six simulation models of hypothetical integrated hazardous waste treatment facilities. The six models represented combinations of one of three unit process configurations and one of two facility operating policies. The heuristics were evaluated with respect to their ability to minimize the average completion time (makespan) of a specified set of jobs. The same five heuristics were applied to a model representing the physical and chemical treatment plant of the Alberta Special Waste Management Corporation. Operation under two operating policies for this case study was evaluated, and the results were compared with the hypothetical model results. Some heuristics were found to be capable of reducing makespans by 13–14% relative to the first in, first out heuristic. Key words: hazardous waste treatment, scheduling, heuristics, simulation modelling.
18
Dahiya, Brahm Prakash, Shaveta Rani, and Paramjeet Singh. "A Hybrid Artificial Grasshopper Optimization (HAGOA) Meta-Heuristic Approach: A Hybrid Optimizer For Discover the Global Optimum in Given Search Space." International Journal of Mathematical, Engineering and Management Sciences 4, no. 2 (April 1, 2019): 471–88. http://dx.doi.org/10.33889/ijmems.2019.4.2-039.
Full textAbstract:
Meta-heuristic algorithms are used to get optimal solutions in different engineering branches. Here four types of meta-heuristics algorithms are used such as evolutionary algorithms, swarm-based algorithms, physics based algorithms and human based algorithms respectively. Swarm based meta-heuristic algorithms are given more effective result in optimization problem issues and these are generated global optimal solution. Existing swarm intelligence techniques are suffered with poor exploitation and exploration in given search space. Therefore, in this paper Hybrid Artificial Grasshopper Optimization (HAGOA) meta-heuristic algorithm is proposed to improve the exploitation and exploration in given search space. HAGOA is inherited Salp swarm behaviors. HAGOA performs balancing in exploitation and exploration search space. It is capable to make chain system between exploitation and exploration phases. The efficiency of HAGOA meta-heuristic algorithm will analyze using 19 benchmarks functions from F1 to F19. In this paper, HAGOA algorithm is performed efficiency analyze test with Artificial Grasshopper optimization (AGOA), Hybrid Artificial Bee Colony with Salp (HABCS), Modified Artificial Bee Colony (MABC), and Modify Particle Swarm Optimization (MPSO) swarm based meta-heuristic algorithms using uni-modal and multi-modal functions in MATLAB. Comparison results are shown that HAGOA meta-heuristic algorithm is performed better efficiency than other swarm intelligence algorithms on the basics of high exploitation, high exploration, and high convergence rate. It also performed perfect balancing between exploitation and exploration in given search space.
19
Yuliza, Evi, Fitri Maya, and Siti Suzlin Supadi. "Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows." Science and Technology Indonesia 6, no. 2 (April 21, 2021): 53–57. http://dx.doi.org/10.26554/sti.2021.6.2.53-57.
Full textAbstract:
Garbage is one of the environmental problems. The process of transporting garbage sometimes occurs delays such as congestion and engine failure. Robust optimization model called a robust counterpart open capacitated vehicle routing problem (RCOCVRP) with time windows was formulated to get over this delays. This model has formulated with the limitation of vehicle capacity and time windows with an uncertainty of waste volume and travel time. The RCOCVRP model with time windows is solved by a heuristic approach. The heuristic approach used to solve the RCOCVRP model with time windows uses the nearest neighbor and the cheapest insertion heuristic algorithm. The RCOCVRP with time windows model is implemented on the problem of transporting waste in Sako sub-district. The solutions of these two heuristic approaches are compared and analyzed. The RCOCVRP model with time windows to optimize the route problems of waste transport vehicles that is solved using the cheapest insertion heuristics algorithm is more effective than the nearest neighbor method.
20
S. Shetty, Vikas, Arka Mukherjee, and K. Senthilkumar. "Examining Heuristics for the K-Centers Problem." International Journal of Engineering & Technology 7, no. 3.12 (July 20, 2018): 915. http://dx.doi.org/10.14419/ijet.v7i3.12.16560.
Full textAbstract:
In this paper, we discuss and analyze the heuristics existing to solve the K-Center problem. The K-Center problem is used in various practical scenarios such as facility location, load-balancing, ATM mapping, Cloud Server Selection, or even data clustering and image classification. Specifically, we examine a standard Greedy algorithm with an approximation factor of 2, the clustering algorithm introduced by Gonzales in 1985, and the Dominating Set Algorithm(commonly referred to as the elimination heuristic) devised by Jurij Mihelič and Borut Robič. We also propose a new heuristic to solve the specified problem using Tree-Independent Dual-Trees devised by Ryan R. Curtin.
21
Harrington, Linda, Cheryl Parker, Kathleen Ulanday, and Craig Harrington. "Heuristic Evaluation of a Top-Rated Diabetes Self-Management App." Applied Clinical Informatics 12, no. 05 (October 2021): 1014–20. http://dx.doi.org/10.1055/s-0041-1736628.
Full textAbstract:
Abstract Objective The purpose of this study was to evaluate the usability of a top-rated diabetes app. Such apps are intended to markedly support the achievement of optimal health and financial outcomes by providing patients with substantive and continual support for self-management of their disease between periodic clinician visits. Poor usability can deter use which is especially concerning in patients with diabetes due to prevalence of the disease and impact of self-management on long-term prognosis. Methods A diabetes app was selected due to the prevalence and seriousness of the disease. A heuristic evaluation was then performed to collect and analyze data on the usability of the app based on Nielsen's heuristics. Pareto analysis was used to illustrate the contribution of each type of heuristic violation, augmented by a stacked bar chart illuminating associated severity. Results There were 51 heuristic violations on the opening screen, violating 6 of Nielsen's 10 heuristics. Pareto analysis revealed 29 (57%) of the heuristic violations involved a match between system and real world and 8 (16%) aesthetic and minimalist design. Severity ratings ranged from 1.0 to 4.0 (mean: 3.01) with 80% comprising a major usability problem and 6% a usability catastrophe. Conclusion Studies show that people with diabetes are more likely to receive greater benefit from a diabetes app if they are easy to use. The number and severity of heuristic violations in this study suggest that the commercialization of mobile health apps may play a factor in bypassing experts in clinical informatics during the design phase of development. Usability and associated benefits received from mobile health apps can be enhanced by debugging the user interface of identified heuristic violations during design. Waiting to correct ongoing usability issues while apps are in production can result in patients disengaging from use of digital health tools engendering poorer outcomes.
22
Henrizi, Philipp, Dario Himmelsbach, and Stefan Hunziker. "Anchoring and adjustment effects on audit judgments: experimental evidence from Switzerland." Journal of Applied Accounting Research 22, no. 4 (February 24, 2021): 598–621. http://dx.doi.org/10.1108/jaar-01-2020-0011.
Full textAbstract:
PurposeThe purpose of this study is to illustrate the potentially detrimental effects on audit decision-making of certain judgmental heuristics, which can lead to systematic judgmental biases. This paper provides background on the heuristics and biases approaches to decision-making to increase auditors' awareness of the anchoring and adjustment effects affecting audit judgments adversely.Design/methodology/approachThis study reports the results of an experimental research design analyzing the audit judgment of 85 auditors in Switzerland.FindingsBased on the results of the experiment, the results indicate evidence on the existence of the anchoring and adjustment heuristic in Swiss audit judgments. The authors could identify an influence of the audit company size, the auditors' experience and the auditors' knowledge about behaviorism and anchor heuristic with regard to the anchoring and adjustment effect on audit judgment.Research limitations/implicationsThe experimental tasks were relatively simple abstractions from the more complex analytical review situations faced by practicing auditors. Due to the small sample size, the authors cannot ensure representativeness of the results.Practical implicationsProfessional judgment is a skill that auditor acquires overtime, combined with experience and knowledge, that allows him to achieve reasonable judgments, being independent of other opinions and free from material biases in a given circumstance. Our results show that auditors who are aware of biases and heuristics are less prone to judgment biases.Originality/valueThis paper is the first to analyze the impact of auditors' explicit experience and knowledge about behaviorism and anchor heuristic on the anchoring and adjustment effect on audit judgment. Through a stronger awareness of cognitive biases, a professional skepticism can be enhanced.
23
Lissovoi, Andrei, Pietro S. Oliveto, and John Alasdair Warwicker. "Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes." Evolutionary Computation 28, no. 3 (September 2020): 437–61. http://dx.doi.org/10.1162/evco_a_00258.
Full textAbstract:
Selection hyper-heuristics (HHs) are randomised search methodologies which choose and execute heuristics during the optimisation process from a set of low-level heuristics. A machine learning mechanism is generally used to decide which low-level heuristic should be applied in each decision step. In this article, we analyse whether sophisticated learning mechanisms are always necessary for HHs to perform well. To this end we consider the most simple HHs from the literature and rigorously analyse their performance for the LeadingOnes benchmark function. Our analysis shows that the standard Simple Random, Permutation, Greedy, and Random Gradient HHs show no signs of learning. While the former HHs do not attempt to learn from the past performance of low-level heuristics, the idea behind the Random Gradient HH is to continue to exploit the currently selected heuristic as long as it is successful. Hence, it is embedded with a reinforcement learning mechanism with the shortest possible memory. However, the probability that a promising heuristic is successful in the next step is relatively low when perturbing a reasonable solution to a combinatorial optimisation problem. We generalise the “simple” Random Gradient HH so success can be measured over a fixed period of time [Formula: see text], instead of a single iteration. For LeadingOnes we prove that the Generalised Random Gradient (GRG) HH can learn to adapt the neighbourhood size of Randomised Local Search to optimality during the run. As a result, we prove it has the best possible performance achievable with the low-level heuristics (Randomised Local Search with different neighbourhood sizes), up to lower-order terms. We also prove that the performance of the HH improves as the number of low-level local search heuristics to choose from increases. In particular, with access to [Formula: see text] low-level local search heuristics, it outperforms the best-possible algorithm using any subset of the [Formula: see text] heuristics. Finally, we show that the advantages of GRG over Randomised Local Search and Evolutionary Algorithms using standard bit mutation increase if the anytime performance is considered (i.e., the performance gap is larger if approximate solutions are sought rather than exact ones). Experimental analyses confirm these results for different problem sizes (up to [Formula: see text]) and shed some light on the best choices for the parameter [Formula: see text] in various situations.
24
Praditha, Riza. "ESTIMASI ERROR: ANCHORING-ADJUSTMENT DAN REAKSI INVESTOR." SIMAK 18, no. 02 (November 14, 2020): 172–83. http://dx.doi.org/10.35129/simak.v18i02.117.
Full textAbstract:
This study aims to test the estimation error of future earnings made by investors and analyze the psychological factors heuristic (anchoring-adjustment) experienced. The subjects in this study were accounting and financial management students at STIE Tri Dharma Nusantara who were proxied as investors. The research design used was within-subject laboratory experiments. The analytical method uses the General Linear Model - Repeated Measurement. The results showed that investors experienced bias in estimating future earnings. Bias is indicated by the magnitude of the error of estimated earnings has a tendency that is close to its initial value. Investors overestimate future earnings when they obtain information with a positive initial value, while investors underestimate the performance of future earnings if they obtain earnings information with a negative initial value. This means that investors experience anchoring-adjustment heuristics and underreaction behavior towards the earnings information presented.
Tujuan penelitian ini adalah untuk menguji kesalahan estimasi laba masa depan yang dilakukan investor serta menganalisis faktor psikologi heuristik (anchoring-adjustment) yang dialami. Subjek dalam penelitian ini adalah mahasiswa akuntansi dan manajemen keuangan pada STIE Tri Dharma Nusantara yang diproksikan sebagai investor. Desain penelitian yang digunakan adalah eksperimen laboratorium within-subject. Metode analisis menggunakan General Linear Model – Repeated Measurement. Hasil penelitian menunjukkan bahwa investor mengalami bias dalam mengestimasi laba masa depan. Bias yang ditunjukkan dengan besaran kesalahan estimasi laba memiliki kecenderungan yang mendekati nilai awalnya. Investor megestimasi laba masa depan lebih tinggi (overestimate) ketika memperoleh informasi dengan nilai awal positif, sebaliknya investor underestimate terhadap kinerja laba masa depan jika memperoleh informasi laba dengan nilai awal negatif. Hal ini berarti bahwa investor mengalami heuristik anchoring-adjustment dan berperilaku underraction terhadap informasi laba yang disajikan.
25
VALENTE, JORGE M. S. "BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS." Asia-Pacific Journal of Operational Research 26, no. 03 (June 2009): 319–39. http://dx.doi.org/10.1142/s0217595909002225.
Full textAbstract:
In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We present heuristic algorithms based on the beam search technique. These algorithms include classic beam search procedures, as well as the filtered and recovering variants. Several dispatching rules are considered as evaluation functions, to analyze the effect of different rules on the effectiveness of the beam search algorithms. The computational results show that using better rules improves the performance of the beam search heuristics. The detailed, filtered beam search (FBS) and recovering beam search (RBS) procedures outperform the best existing heuristic. The best results are given by the recovering and detailed variants, which provide objective function values that are quite close to the optimum. For small to medium size instances, either of these procedures can be used. For larger instances, the detailed beam search (DBS) algorithm requires excessive computation times, and the RBS procedure then becomes the heuristic of choice.
26
Gresse von Wangenheim, Christiane, Talita A. Witt, Adriano Ferreti Borgatto, Juliane Vargas Nunes, Thaisa Cardoso Lacerda, Caroline Krone, and Laís de Oliveira Souza. "A Usability Score for Mobile Phone Applications Based on Heuristics." International Journal of Mobile Human Computer Interaction 8, no. 1 (January 2016): 23–58. http://dx.doi.org/10.4018/ijmhci.2016010102.
Full textAbstract:
Mobile phones are becoming the most widespread personal consumer device. Yet, offering mobile access anywhere, anytime for anybody poses new challenges to usability. So far there is little research on how to customize usability heuristics to the specific characteristics of mobile phone applications. Therefore, this article presents a set of tailored usability heuristics based on a systematic literature review. In order to facilitate the usage of these heuristics, the authors design and validate a measurement instrument (checklist) and scale. The checklist has been validated through an empirical study in which the results of 247 heuristic evaluations have been statistically analyzed using Item Response Theory. Based on the results, the measurement items have been calibrated and a standardized measurement scale has been constructed. The results can be used to measure usability of mobile phone applications from early on in the design process, and, thus, facilitate evaluations in a cost-effective way.
27
Keyder, E., J. Hoffmann, and P. Haslum. "Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions." Journal of Artificial Intelligence Research 50 (June 30, 2014): 487–533. http://dx.doi.org/10.1613/jair.4277.
Full textAbstract:
Heuristic functions based on the delete relaxation compute upper and lower bounds on the optimal delete-relaxation heuristic h+, and are of paramount importance in both optimal and satisficing planning. Here we introduce a principled and flexible technique for improving h+, by augmenting delete-relaxed planning tasks with a limited amount of delete information. This is done by introducing special fluents that explicitly represent conjunctions of fluents in the original planning task, rendering h+ the perfect heuristic h* in the limit. Previous work has introduced a method in which the growth of the task is potentially exponential in the number of conjunctions introduced. We formulate an alternative technique relying on conditional effects, limiting the growth of the task to be linear in this number. We show that this method still renders h+ the perfect heuristic h* in the limit. We propose techniques to find an informative set of conjunctions to be introduced in different settings, and analyze and extend existing methods for lower-bounding and upper-bounding h+ in the presence of conditional effects. We evaluate the resulting heuristic functions empirically on a set of IPC benchmarks, and show that they are sometimes much more informative than standard delete-relaxation heuristics.
28
Hancock, Gabriella M., Sam S. Anvari, Nicole B. Mok, Aram Ayvazyan, Xiaolu Bai, Kelsey M. McCoy, Matthew T. Nare, et al. "A Heuristic Evaluation of Usability for Environmental Control Units’ Eye-Tracking Interfaces at Veterans Affairs Spinal Cord Injuries and Disorders Centers." Proceedings of the Human Factors and Ergonomics Society Annual Meeting 64, no. 1 (December 2020): 741–45. http://dx.doi.org/10.1177/1071181320641171.
Full textAbstract:
Heuristic evaluation is a valid method for assessing interface usability. Results derived from these methods are useful in identifying the most impactful design elements influencing usability and user experience of a system. By establishing the features in need of most improvement, designers can more effortful consider their approaches for iterative efforts to improve usability and user experience. This work used established design principles (i.e., Shneiderman’s Golden Rules and Nielsen’s Heuristics) to analyze the inpatient environmental control units deployed at VA Spinal Cord Injuries and Disorders (SCI/D) Centers to assist with task completion, foster independence, and improve the quality of life in veterans with spinal cord injuries and disorders. Analyses revealed many usability issues in the current interface, varying in severity from minor to catastrophic. Specific design recommendations to address these issues are provided.
29
Maggio, Lauren A., Melinda Krakow, and Laura L. Moorhead. "‘There were some clues’: a qualitative study of heuristics used by parents of adolescents to make credibility judgements of online health news articles citing research." BMJ Open 10, no. 8 (August 2020): e039692. http://dx.doi.org/10.1136/bmjopen-2020-039692.
Full textAbstract:
ObjectiveTo identify how parents judge the credibility of online health news stories with links to scientific research.DesignThis qualitative study interviewed parents who read online stories about e-cigarettes and human papillomavirus (HPV) vaccination published by top-tier US news organisations. Researchers asked participants to describe elements of a story that influenced their judgement about content credibility. Researchers analysed transcripts using inductive and deductive techniques. Deductive analysis drew on cognitive heuristics previously identified as being used by the public to judge online health information. Inductive analysis allowed the emergence of new heuristics, especially relating to health.SettingThe US National Cancer Institute’s Audience Research Lab in Maryland, in August–November 2018.ParticipantsSixty-four parents with at least one child between the ages of 9 and 17 residing in Maryland, Virginia, or the District of Columbia participated. Researchers randomly assigned 31 parents to the HPV vaccination story and 33 to the e-cigarette story.ResultsEvidence of existing heuristics, including reputation, endorsement, consistency, self-confirmation, expectancy violation and persuasive intent emerged from the interviews, with participants deeming stories credible when mentioning physicians (reputation heuristic) and/or consistent with information provided by personal physicians (consistency heuristic). Participants also described making credibility judgements based on presence of statistics, links to scientific research and their general feelings about news media. In relation to presence of statistics and links, participants reported these elements increased the credibility of the news story, whereas their feelings about the news media decreased their credibility judgement.ConclusionsParents used a constellation of heuristics to judge the credibility of online health news stories. Previously identified heuristics for online health information are also applicable in the context of health news stories. The findings have implications for initiatives in education, health communication and journalism directed towards increasing the public’s engagement with health news and their credibility judgements.
30
Prechelt, Lutz, and Alexander Pepper. "Bflinks: Reliable Bugfix Links via Bidirectional References and Tuned Heuristics." International Scholarly Research Notices 2014 (October 29, 2014): 1–13. http://dx.doi.org/10.1155/2014/701357.
Full textAbstract:
Background. Data from software version archives and defect databases can be used for defect insertion circumstance analysis and defect prediction. The first step in such analyses is identifying defect-correcting changes in the version archive (bugfix commits) and enriching them with additional metadata by establishing bugfix links to corresponding entries in the defect database. Candidate bugfix commits are typically identified via heuristic string matching on the commit message. Research Questions. Which filters could be used to obtain a set of bugfix links? How to tune their parameters? What accuracy is achieved? Method. We analyze a modular set of seven independent filters, including new ones that make use of reverse links, and evaluate visual heuristics for setting cutoff parameters. For a commercial repository, a product expert manually verifies over 2500 links to validate the results with unprecedented accuracy. Results. The heuristics pick a very good parameter value for five filters and a reasonably good one for the sixth. The combined filtering, called bflinks, provides 93% precision and only 7% results loss. Conclusion. Bflinks can provide high-quality results and adapts to repositories with different properties.
31
Ayav, Tolga, and Belgin Ergenc. "Full-Exact Approach for Frequent Itemset Hiding." International Journal of Data Warehousing and Mining 11, no. 4 (October 2015): 49–63. http://dx.doi.org/10.4018/ijdwm.2015100103.
Full textAbstract:
This paper proposes a novel exact approach that relies on integer programming for association rule hiding. A large panorama of solutions exists for the complex problem of itemset hiding: from practical heuristic approaches to more accurate exact approaches. Exact approaches provide better solutions while suffering from the lack of performance and existing exact approaches still augment their methods with heuristics to make the problem solvable. In this case, the solution may not be optimum. This work presents a full-exact method, without any need for heuristics. Extensive tests are conducted on 10 real datasets to analyze distance and information loss performances of the algorithm in comparison to a former similar algorithm. Since the approach provides the optimum solution to the problem, it should be considered as a reference method.
32
Deligonul, Seyda. "HEURISTICS TO ANALYZE BIVARIATE DATA." Quality Engineering 10, no. 3 (March 1998): 437–43. http://dx.doi.org/10.1080/08982119808919157.
Full text
33
Gregorics, Tibor. "Remarks on the A** algorithm." Acta Universitatis Sapientiae, Informatica 6, no. 2 (December 1, 2014): 190–205. http://dx.doi.org/10.1515/ausi-2015-0003.
Full textAbstract:
Abstract The A** algorithm is a famous heuristic path-finding algorithm. In this paper its different definitions will be analyzed firstly. Then its memory complexity is going to be investigated. On the one hand, the well-known concept of better-information will be extended to compare the different heuristics in the A** algorithm. On the other hand, a new proof will be given to show that there is no deterministic graph-search algorithm having better memory complexity than A**∗. At last the time complexity of A** will be discussed.
34
Libertini, Lorenzo, Ekaterina Chuprikova, and Liqiu Meng. "Effect of Geospatial Uncertainty Borderization on Users’ Heuristic Reasoning." Proceedings of the ICA 4 (December 3, 2021): 1–8. http://dx.doi.org/10.5194/ica-proc-4-66-2021.
Full textAbstract:
Abstract. A set of mental strategies called "heuristics" – logical shortcuts that we use to make decisions under uncertainty – has become the subject of a growing number of studies. However, the process of heuristic reasoning about uncertain geospatial data remains relatively under-researched. With this study, we explored the relation between heuristics-driven decision-making and the visualization of geospatial data in states of uncertainty, with a specific focus on the visualization of borders, here termed "borderization". Therefore, we tested a set of cartographic techniques to visualize the boundaries of two types of natural hazards across a series of maps through a user survey. Respondents were asked to assess the safety and desirability of several housing locations potentially affected by air pollution or avalanches. Maps in the survey varied by "borderization" method, background color and type of information about uncertain data (e.g., extrinsic vs. intrinsic). Survey results, analyzed using a mixed quantitative-qualitative approach, confirmed previous suggestions that heuristics play a significant role in affecting users' map experience, and subsequent decision-making.
35
Silwal, Prem Prasad, and Shreya Bajracharya. "Behavioral Factors Influencing Stock Investment Decision of Individuals." International Research Journal of Management Science 6, no. 1 (December 31, 2021): 53–73. http://dx.doi.org/10.3126/irjms.v6i1.42339.
Full textAbstract:
Purpose: The purpose of this study is to identify the behavioral factors influencing individual investors’ decisions and to analyze the relationship between these factors and investment decision performance. Design/Methodology/Approach: The tested variables were: Anchoring bias, Gambler’s Fallacy, Overconfidence bias, Availability and Representativeness bias from heuristics factor, Mental Accounting, Loss and Regret Aversion from prospect factor, and Market variables and Herding factors. The study employed exploratory and confirmatory factor analysis. In addition, structural equation modeling is applied for the testing of the hypotheses. Findings: Prospect behavioral factor is seen to have negative correlation to investment performance. Herding, Market variables and Heuristic (including overconfidence and anchoring bias) are found to have positive correlation to investment performance. Implications: To cope with intense competition among the competitors in Nepali stock market, this study provides strong evidence herding and heuristic approach that have positive indication to investment performance
36
Zabed Ahmed, S. M., Cliff McKnight, and Charles Oppenhein. "The use of a heuristic process to evaluate an online information retrieval interface." Library and Information Research 30, no. 95 (June 27, 2013): 3–9. http://dx.doi.org/10.29173/lirg278.
Full textAbstract:
This paper presents the results of a heuristic
evaluation with the Web of Science interface. Three
human factors experts carried out their independent
evaluation. The findings were then analysed and
combined to discuss them with expert members to
reach a consensus on usability issues identified. The
heuristic evaluation helped to identify a number of
both positive and negative aspects in the Web of
Science interface. The key strength of the then current
interface was its consistency in terms of conventions
used, screen layouts, minimum use of colours, and use
of graphics and icons.The main weakness lay in its
functionality, i.e., searching, navigation, online help, etc.
The results show the effectiveness of a heuristlc
approach to evaluating user interfaces to online
information retrieval systems.
37
Markowski, Marcin. "Heuristic algorithms for joint optimization of unicast and anycast traffic in elastic optical network–based large–scale computing systems." International Journal of Applied Mathematics and Computer Science 27, no. 3 (September 1, 2017): 605–22. http://dx.doi.org/10.1515/amcs-2017-0043.
Full textAbstract:
AbstractIn recent years elastic optical networks have been perceived as a prospective choice for future optical networks due to better adjustment and utilization of optical resources than is the case with traditional wavelength division multiplexing networks. In the paper we investigate the elastic architecture as the communication network for distributed data centers. We address the problems of optimization of routing and spectrum assignment for large-scale computing systems based on an elastic optical architecture; particularly, we concentrate on anycast user to data center traffic optimization. We assume that computational resources of data centers are limited. For this offline problems we formulate the integer linear programming model and propose a few heuristics, including a meta-heuristic algorithm based on a tabu search method. We report computational results, presenting the quality of approximate solutions and efficiency of the proposed heuristics, and we also analyze and compare some data center allocation scenarios.
38
Nouri, Pouria, and Abdollah AhmadiKafeshani. "Do female and male entrepreneurs differ in their proneness to heuristics and biases?" Journal of Entrepreneurship in Emerging Economies 12, no. 3 (November 18, 2019): 357–75. http://dx.doi.org/10.1108/jeee-05-2019-0062.
Full textAbstract:
Purpose Although heuristics and biases seal the fate of entrepreneurial enterprises by directly influencing entrepreneurs’ decisions, previous studies have ignored the role of gender in this regard by considering female and male entrepreneurs homogeneous in their susceptibility to heuristics and biases. Thus, this paper aims to advance the existing body of knowledge on heuristics and biases in the field of entrepreneurship by exploring two heuristics of affect and representativeness as well as three biases of overconfidence, escalation of commitment and illusion of control in female and male entrepreneurs’ entry and opportunity-related decisions. Design/methodology/approach The data were gathered through semi-structured and in-depth interviews with ten male and nine female Iranian techno-entrepreneurs active in advanced medicine and biotechnology. The gathered data were analyzed by thematic and narrative data analysis. Findings According to the results, while both male and female entrepreneurs show certain heuristics and biases, there are some noteworthy distinctions. More precisely, contrary to their male counterparts, the female entrepreneurs neither rely on the representativeness heuristic nor show any signs of the escalation of commitment in their decisions. Practical implications There are some valuable implications emanated from this study which could be of use for not only future researchers but also entrepreneurs, especially the ones founding and running small businesses themselves. Originality/value While there is a strong body of literature on heuristics and biases in the field of entrepreneurship, previous studies have considered female and male entrepreneurs homogeneous in their proneness to heuristics and biases. Thus, the current study enriches the body of knowledge by being the first comparative study of heuristics and biases in female and male entrepreneurs’ decisions.
39
Wahid, Juliana, Syariza Abdul-Rahman, Aniza Mohamed Din, and Naimah Mohd-Hussin. "Constructing population of initial university timetable: design and analysis." Indonesian Journal of Electrical Engineering and Computer Science 15, no. 2 (August 1, 2019): 1109. http://dx.doi.org/10.11591/ijeecs.v15.i2.pp1109-1118.
Full textAbstract:
The construction of population of initial timetable is an essential stage in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it may impact the quality of the final timetable. This paper presents population of initial timetable construction approach in curriculum based course timetabling problem by using the graph heuristics to determine the sequential order of courses/lectures to be assigned in the timetable. The graph heuristics were implemented as single and combination of two heuristics. The courses in curriculum-based university course timetabling problem that was organized based on the heuristics setting will be repeatedly assigned to valid empty slots while fulfilling all the hard constraints. If a course is unable to be assigned to whichever slots because of no more valid empty slots, it will be inserted into the unscheduled courses/lectures list. The unscheduled courses/lectures list will be assigned later to the timetable using several procedures executed in a sequence. The approaches were tested on the ITC2007 instances and the results were analyzed with some statistical tests to determine the best setting of heuristics in the construction approach. The result shows that the construction approach with combination of largest degree followed by saturation degree heuristic, generate the maximum number of population of initial timetables. The result from this study can be used in the improvement stage of metaheuristic algorithm that uses population-based approach.
40
Drira, Sabrine, Frida Ben Rais Lasram, Tarek Hattab, Yunne-Jai Shin, Amel Ben Rejeb Jenhani, and François Guilhaumon. "Can We Avoid Tacit Trade-Offs between Flexibility and Efficiency in Systematic Conservation Planning? The Mediterranean Sea as a Case Study." Diversity 14, no. 1 (December 24, 2021): 9. http://dx.doi.org/10.3390/d14010009.
Full textAbstract:
Species distribution models (SDMs) provide robust inferences about species-specific site suitability and are increasingly used in systematic conservation planning (SCP). SDMs are subjected to intrinsic uncertainties, and conservation studies have generally overlooked these. The integration of SDM uncertainties in conservation solutions requires the development of a suitable optimization algorithm. Exact optimization algorithms grant efficiency to conservation solutions, but most of their implementations generate a single binary and indivisible solution. Therefore, without variation in their parameterization, they provide low flexibility in the implementation of conservation solutions by stakeholders. Contrarily, heuristic algorithms provide such flexibility, by generating large amounts of sub-optimal solutions. As a consequence, efficiency and flexibility are implicitly linked in conservation applications: mathematically efficient solutions provide less flexibility, and the flexible solutions provided by heuristics are sub-optimal. To avoid this trade-off between flexibility and efficiency in SCP, we propose a reserve-selection framework, based on exact optimization combined with a post-selection of SDM outputs. This reserve-selection framework provides flexibility and addresses the efficiency and representativeness of conservation solutions. To exemplify the approach, we analyzed an experimental design, crossing pre- and post-selection of SDM outputs versus heuristics and exact mathematical optimizations. We used the Mediterranean Sea as a biogeographical template for our analyses, integrating the outputs of eight SDM techniques for 438 fish species.
41
Hayi, Mohamed Yassine, Zahira Chouiref, and Hamouma Moumen. "Towards Intelligent Road Traffic Management Over a Weighted Large Graphs Hybrid Meta-Heuristic-Based Approach." Journal of Cases on Information Technology 24, no. 3 (July 2022): 1–18. http://dx.doi.org/10.4018/jcit.20220701.oa4.
Full textAbstract:
This paper introduces a new approach of hybrid meta-heuristics based optimization technique for decreasing the computation time of the shortest paths algorithm. The problem of finding the shortest paths is a combinatorial optimization problem which has been well studied from various fields. The number of vehicles on the road has increased incredibly. Therefore, traffic management has become a major problem. We study the traffic network in large scale routing problems as a field of application. The meta-heuristic we propose introduces new hybrid genetic algorithm named IOGA. The problem consists of finding the k optimal paths that minimizes a metric such as distance, time, etc. Testing was performed using an exact algorithm and meta-heuristic algorithm on random generated network instances. Experimental analyses demonstrate the efficiency of our proposed approach in terms of runtime and quality of the result. Empirical results obtained show that the proposed algorithm outperforms some of the existing technique in term of the optimal solution in every generation.
42
Garcia-Retamero, Rocio, Ulrich Hoffrage, and Anja Dieckmann. "When One Cue is not Enough: Combining Fast and Frugal Heuristics with Compound Cue Processing." Quarterly Journal of Experimental Psychology 60, no. 9 (September 2007): 1197–215. http://dx.doi.org/10.1080/17470210600937528.
Full textAbstract:
One-reason decision-making heuristics as proposed by Gigerenzer, Todd, and the ABC Research Group (1999) have been shown to perform accurately. However, such strategies cannot deal with compound cues. We propose the Take The Best Configural Cue (TTB-Configural) as a fast and frugal heuristic that processes compound cues. In a series of three experiments, we analysed whether participants used this heuristic when making cue-based inferences on which of two alternatives had a higher criterion value. In two of the experiments, two cues were amalgamated into a valid compound cue by applying the AND or the OR logical rule, respectively. In the third experiment, there was no valid compound cue. Within each experiment, we also manipulated causal mental models through instructions. In the configural causal model, cues were said to act through the same causal mechanism. In the elemental causal model, cues were said to act through different causal mechanisms. In the neutral causal model, the causal mechanism was not specified. When a highly valid compound existed, and participants had a configural causal model, for the majority of them the strategy that could best account for their choices was TTB-Configural. Otherwise, the strategy that best predicted their choices was the Take The Best (TTB) heuristic.
43
Coler, Matt, Patrice Guyot, and Edwin Banegas-Flores. "Verbal art as heuristic for semantic analyses." LIAMES: Línguas Indígenas Americanas 20 (October 2, 2020): e020011. http://dx.doi.org/10.20396/liames.v20i0.8660368.
Full textAbstract:
Aymara is an Amerindian language spoken mainly in Peru and Bolivia. To date, relatively little is documented about Aymara verbal art. Accordingly, we analyze a traditional song recorded in the Peruvian highlands. We provide a musical and linguistic analysis of the non-prosodic poetic song structure. We detail the octosyllabic, homeoteleutonic strategies for line formation, the melodic and rhythmic characteristics, and outline the syntactic, morphological, and semantic strategies used in forming semantic couplets. This reveals semantic categories which would not be apparent in a traditional linguistic analysis. Furthermore, the musical analysis confirms previous works on the misperception of a musical anacrusis. We conclude that rigorous, scientific analyses of verbal art require consideration of the construction of meaning through practice and dialog.
44
Van Allen, Eliezer Mendel, Nikhil Wagle, Gregory Kryukov, Alexis Ramos, Gad Getz, and Levi A. Garraway. "A heuristic platform for clinical interpretation of cancer genome sequencing data." Journal of Clinical Oncology 30, no. 15_suppl (May 20, 2012): 10502. http://dx.doi.org/10.1200/jco.2012.30.15_suppl.10502.
Full textAbstract:
10502 Background: The ability to identify and effectively sort the full spectrum of biologically and therapeutically relevant genetic alterations identified by massively parallel sequencing may improve cancer care. A major challenge involves rapid and rational categorization of data-intensive output, including somatic mutations, insertions/deletions, copy number alterations, and rearrangements into ranked categories for clinician review. Methods: A database of clinically actionable alterations was created, consisting of over 100 annotated genes known to undergo somatic genomic alterations in cancer that may impact clinical decision-making. A heuristic algorithm was developed, which selectively identifies somatic alterations based on the clinically actionable alterations database. Remaining variants are sorted based on additional heuristics, including high priority alterations based on presence in the Cancer Gene Census, biologically significant cancer genes based on presence in COSMIC or MSigDB, and low priority alterations in the same gene family as biologically significant cancer genes. The heuristic algorithm was applied to whole exome sequencing data of clinical samples and whole genome sequencing data from a cohort of prostate cancer samples processed using established Broad Institute pipelines. Results: Application of the heuristic algorithm to the prostate cancer whole genome rearrangement data identified 172 (out of 5978) rearrangements involving actionable genes (averaging 2-3 events per tumor). Furthermore, two clinical samples processed prospectively were analyzed, yielding three potentially actionable alterations for clinical review. Conclusions: The heuristic model for clinical interpretation of next generation sequencing data may facilitate rapid analysis of tumor genomic information for clinician review by identifying and prioritizing alterations that can directly impact care. Our platform can also be applied to research data to prospectively explore clinically relevant findings from existing cohorts. Future analytical approaches using heuristic or probabilistic algorithms should underpin a robust prospective assessment of clinical cancer genome data.
45
Shin, Donghee, and Yujong Hwang. "The effects of security and traceability of blockchain on digital affordance." Online Information Review 44, no. 4 (May 23, 2020): 913–32. http://dx.doi.org/10.1108/oir-01-2019-0013.
Full textAbstract:
PurposeThis study takes an affordance approach to explain how users perceive the affordance of user action within blockchain and examines how it influences the subsequent user experience. Focusing on the effect of trust on cognitive processes, the authors analyze how affordances in blockchains affect the user experience.Design/methodology/approachThe blockchain affordances are examined through a two-stage process. The authors employ a qualitative analysis based on insights gained from the current literature and interviews. The authors then apply a quantitative survey to examine the role of trust in interactions with blockchain services. A structural user model was tested in which their appreciation of affordances of blockchain predicted the trust and satisfaction.FindingsUsers' appreciation for transparency and reliability explained to what extent they trust and are satisfied, thereby suggesting the heuristic roles of trust in blockchains. The study findings indicate a heuristic role for trust regarding underlying links to technological and affective affordances. A user's cognitive heuristics affect their attitudes toward blockchain, in which technological features are processed through users' perceptions and experience.Research limitations/implicationsThe model contributes to the conceptualization of security, privacy and traceability along with trust, which is then linked to transparency and reliability. The findings show how the frame of affordances gains explanatory power by being linked to the concepts of affect and emotion. The heuristics of direct perception of security–traceability–privacy (STP) can be used to understand the trajectory of heuristics and ongoing choices of blockchain.Practical implicationsThe study results offer a lens through which to address the technology's most common problems by pairing user experience principles and heuristics to blockchain technologies. This study offers insights into the understanding of user actions related to blockchains and into practical implications for developing trust-based services. The results guide the application and tailoring of motivational affordances in blockchain.Originality/valueWhile blockchain technology has gained popularity and momentum, there has been little research on how specific features of blockchain technology create value. This study contributes to the research gap by highlighting the role and dimension of trust in relation to STP in blockchains and provides meaningful implications for theory and practice.
46
Babatunde, Isaiah Olajide. "Examining Heuristics for Building - Work-in-Progress Valuations in Niger State Nigeria." Real Estate Management and Valuation 26, no. 2 (June 1, 2018): 92–103. http://dx.doi.org/10.2478/remav-2018-0019.
Full textAbstract:
Abstract Where an investment decision on building work-in-progress (BWIP) is premised on the judgment of value, the technique of assessment must be accurate. The heuristic technique has not been able to achieve this goal. Frequent transactions in BWIP in Niger State necessitate the search for an alternative technique. This paper therefore aims to: – identify and analyze the purposes of BWIP valuations in Niger State, Nigeria, – examine the suitability of using heuristics in determining the cost of building work-in-progress, and – investigate the veracity of the use of the Nigerian Building and Road Research Institute (NBRRI)’s template of elemental percentage rates for the cost of incomplete buildings in the state. Data were obtained from estate surveyors and valuers (ESVs), registered quantity surveyors in the state, the Niger State Housing Corporation and the NBRRI. The analysis showed, among others, that heuristics, although not suitable, was the most prominent technique adopted by the ESVs for costing BWIP. Similarly, the use of NBRRI’s template for costing BWIP for residential bungalows in Minna - the Niger state capital - was validated.
47
Xiang, Tai, Tian Jiu Leng, and Ding Song Ma. "Heuristic Search Algorithm Based on “HowNet” in P2P Network." Applied Mechanics and Materials 644-650 (September 2014): 2685–88. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.2685.
Full textAbstract:
This paper is a study on minimum query peers and apply glossary semantic similarity of “HowNet” to P2P search. It introduces and analyzes the intelligence search algorithm and the glossary semantic similarity of “HowNet”. Based on the intelligence search algorithm, heuristic search algorithm on “HowNet” is proposed and analyzed.
48
Rahardian, Ema. "IMPLIKATUR DALAM UNGKAPAN TEGUR SAPA MASYARAKAT JAWA (THE IMPLICATURE OF JAVANESSE GREETING)." Jalabahasa 12, no. 2 (June 10, 2020): 111–22. http://dx.doi.org/10.36567/jalabahasa.v12i2.250.
Full textAbstract:
Ungkapan tegur sapa menarik untuk dikaji karena mengandung gejala kebahasaan, salah satunya adalah implikatur. Untuk itu, penelitian ini hendak mengkaji gejala kebahaan tersebut. Melalui metode etnograï¬ , data tuturan dikumpulkan. Data yang telah terkumpul kemudian dianalisis menggunakan teknik heuristik. Berdasarkan hasil analisis ditemukan adanya implikatur melalui pelanggaran maksim kuantitas, kualitas, relasi, dan cara. Bentuk tindak tutur dalam implikatur itu, yaitu (1) representatif dengan subjenis (a) menolak memberikan alasan, (b) memberitahukan perasaan, (c) memberitahukan, dan (d) merahasiakan; (2) komisif dengan subjenis (a) membela diri, dan (b) menjebak; serta (3) ekspresif dengan subjenis menenangkan hati. ABSTRACT Greetings is interested to be analyzed because it has several linguistics phenomenon, such as implicature. This reseach aims to analyzed that linguistics phenomenon. It uses ethnography method to collects the data. The data is analyzed by using heuristic technique. The result shows that the implicature happens because of the illiciteness of quantity, quality, relation, and manner maxim. The implicature also has some speech act functions, such as representative, commisive, and expressive function. Â
49
Manzanares-Lopez, Pilar, Juan Pedro Muñoz-Gea, and Josemaria Malgosa-Sanahuja. "VNF Placement for Service Function Chains with Strong Low-Delay Restrictions in Edge Computing Networks." Applied Sciences 10, no. 18 (September 20, 2020): 6573. http://dx.doi.org/10.3390/app10186573.
Full textAbstract:
The edge computing paradigm, allowing the location of network services close to end users, defines new network scenarios. One of them considers the existence of micro data centers, with reduced resources but located closer to service requesters, to complement remote cloud data centers. This hierarchical and geo-distributed architecture allows the definition of different time constraints that can be taken into account when mapping services into data centers. This feature is especially useful in the Virtual Network Function (VNF) placement problem, where the network functions composing a Service Function Chain (SFC) may require more or less strong delay restrictions. We propose the ModPG (Modified Priority-based Greedy) heuristic, a VNF placement solution that weighs the latency, bandwidth, and resource restrictions, but also the instantiation cost of VNFs. ModPG is an improved solution of a previous proposal (called PG). Although both heuristics share the same optimization target, that is the reduction of the total substrate resource cost, the ModPG heuristic identifies and solves a limitation of the PG solution: the mapping of sets of SFCs that include a significant proportion of SFC requests with strong low-delay restrictions. Unlike PG heuristic performance evaluation, where the amount of SFC requests with strong low-delay restrictions is not considered as a factor to be analyzed, in this work, both solutions are compared considering the presence of 1%, 15%, and 25% of this type of SFC request. Results show that the ModPG heuristic optimizes the target cost similarly to the original proposal, and at the same time, it offers a better performance when a significant number of low-delay demanding SFC requests are present.
50
Qu, Da Peng, Hui Tu, and Tie Sheng Fan. "Performance Analysis of Local Optimization Algorithms in Traveling Salesman Problem." Advanced Materials Research 846-847 (November 2013): 1364–67. http://dx.doi.org/10.4028/www.scientific.net/amr.846-847.1364.
Full textAbstract:
There are plenty of intelligence algorithms and heuristic algorithms for TSP (Traveling Salesman Problem). In this paper, local optimization algorithm which is a good representative of heuristic algorithms was analyzed. The performance of 2-opt (optimization), 3-opt and 4-opt were analyzed and compared through experiments. To reduce running time and improve their feasibility, a modification was made on 3-opt and 4-opt. Ant colony optimization as a good representative of intelligence algorithm was combined with k-opt to analyze. The results provide reference to application of k-opt and designing optimization algorithms for TSP in future.