16 research outputs found
Information flow and Laplacian dynamics on local optima networks
We propose a new way of looking at local optima networks (LONs). LONs
represent fitness landscapes; the nodes are local optima, and the edges are
search transitions between them. Many metrics computed on LONs have been
proposed and shown to be linked to metaheuristic search difficulty. These have
typically considered LONs as describing static structures. In contrast to this,
Laplacian dynamics (LD) is an approach to consider the information flow across
a network as a dynamical process. We adapt and apply LD to the context of LONs.
As a testbed, we consider instances from the quadratic assignment problem (QAP)
library. Metrics related to LD are proposed and these are compared with
existing LON metrics. The results show that certain LD metrics are strong
predictors of metaheuristic performance for iterated local search and tabu
search
Recommended from our members
Haplotype-aware graph indexes.
MOTIVATION: The variation graph toolkit (VG) represents genetic variation as a graph. Although each path in the graph is a potential haplotype, most paths are non-biological, unlikely recombinations of true haplotypes. RESULTS: We augment the VG model with haplotype information to identify which paths are more likely to exist in nature. For this purpose, we develop a scalable implementation of the graph extension of the positional Burrows-Wheeler transform. We demonstrate the scalability of the new implementation by building a whole-genome index of the 5008 haplotypes of the 1000 Genomes Project, and an index of all 108Â 070 Trans-Omics for Precision Medicine Freeze 5 chromosome 17 haplotypes. We also develop an algorithm for simplifying variation graphs for k-mer indexing without losing any k-mers in the haplotypes. AVAILABILITY AND IMPLEMENTATION: Our software is available at https://github.com/vgteam/vg, https://github.com/jltsiren/gbwt and https://github.com/jltsiren/gcsa2. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online
Learning representations for effective and explainable software bug detection and fixing
Software has an integral role in modern life; hence software bugs, which undermine software quality and reliability, have substantial societal and economic implications. The advent of machine learning and deep learning in software engineering has led to major advances in bug detection and fixing approaches, yet they fall short of desired precision and recall. This shortfall arises from the absence of a \u27bridge,\u27 known as learning code representations, that can transform information from source code into a suitable representation for effective processing via machine and deep learning.
This dissertation builds such a bridge. Specifically, it presents solutions for effectively learning code representations using four distinct methods?context-based, testing results-based, tree-based, and graph-based?thus improving bug detection and fixing approaches, as well as providing developers insight into the foundational reasoning. The experimental results demonstrate that using learning code representations can significantly enhance explainable bug detection and fixing, showcasing the practicability and meaningfulness of the approaches formulated in this dissertation toward improving software quality and reliability
Exploring and Exploiting Models of the Fitness Landscape: a Case Against Evolutionary Optimization
In recent years, the theories of natural selection and biological evolution have proved
popular metaphors for understanding and solving optimization problems in engineering
design. This thesis identifies some fundamental problems associated with this use of
such metaphors. Key objections are the failure of evolutionary optimization techniques
to represent explicitly the goal of the optimization process, and poor use of knowledge
developed during the process. It is also suggested that convergent behaviour of an
optimization algorithm is an undesirable quality if the algorithm is to be applied to
multimodal problems.
An alternative approach to optimization is suggested, based on the explicit use of
knowledge and/or assumptions about the nature of the optimization problem to construct
Bayesian probabilistic models of the surface being optimized and the goal of
the optimization. Distinct exploratory and exploitative strategies are identified for
carrying out optimization based on such models—exploration based on attempting to
reduce maximally an entropy-based measure of the total uncertainty concerning the
satisfaction of the optimization goal over the space, exploitation based on evalutation
of the point judged most likely to achieve the goal—together with a composite strategy
which combines exploration and exploitation in a principled manner. The behaviour
of these strategies is empirically investigated on a number of test problems.
Results suggest that the approach taken may well provide effective optimization in
a way which addresses the criticisms made of the evolutionary metaphor, subject to
issues of the computational cost of the approach being satisfactorily addressed
The Traveling Salesman Problem
This paper presents a self-contained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem instances. Extensive computational results are reported on most of the algorithms described. Optimal solutions are reported for instances with sizes up to several thousand nodes as well as heuristic solutions with provably very high quality for larger instances
Recommended from our members
DRprofiling: deep reinforcement user profiling for recommendations in heterogenous information networks
Recommender systems are popular for personalization in online communities. Users, items, and other affiliated information such as tags, item genres, and user friends of an online community form a heterogenous information network. User profiling is the foundation of personalized recommender systems. It provides the basis to discover knowledge about an individual user's interests to items. Typically, users are profiled with their direct explicit or implicit ratings, which ignored the inter-connections among users, items, and other entity nodes of the information network. This paper proposes a deep reinforcement user profiling approach for recommender systems. The user profiling process is framed as a sequential decision making problem which can be solved with a Reinforcement Learning (RL) agent. The RL agent interacts with the external heterogenous information network environment and learns a decision making policy network to decide whether there is an interest or preference path between a user and an unobserved item. To effectively train the RL agent, this paper proposes a multi-iteration training process to combine both expert and data-specific knowledge to profile users, generate meta-paths, and make recommendations. The effectiveness of the proposed approaches is demonstrated in experiments conducted on three datasets
Ant Colony Optimization for Jointly Solving Relay Node Placement and Trajectory Calculation in Hierarchical Wireless Sensor Networks
Given the locations of the Sensor Nodes in a Wireless Sensor Networks (WSN), finding the minimum number of Relays required and their locations such that each sensor is covered by at least one relay is called the Relay Node Placement (RNP) problem. Given the locations of the relays, finding an optimized trajectory for the Mobile Data Collector (MDC) is another important design problem of the WSN domain. Previous researchers have shown that jointly solving different design problems in the WSN domain often leads to better overall results. In recent years, Ant Colony Optimization (ACO) have emerged as an effective tool for solving complex optimization problems. An ACO based approach for solving the joint problem of Relay Node Placement & Trajectory calculation(RNPT) is presented in this thesis. We also present a deterministic, and a Continuous Ant Colony Optimization ([Special characters omitted.] ACOR ) approach for refining the trajectory produced by the ACO approach