Skip to Content
You are currently on the new version of our website. Access the old version .

Algorithms, Volume 12, Issue 9

2019 September - 24 articles

Cover Story: The physical movement of multibody systems on an atomistic level, taking place at the femtosecond time scale, is at the core of quantum molecular dynamics simulations. The Los Alamos National Laboratory explores novel approaches for the simulation of such systems which make use of a special type of graph partitioning to efficiently parallelize computations. For this, the density matrix of a physical system is represented as a graph where atomic orbitals become vertices and nonzero interactions become edges (left figure). After partitioning (right figure), the parts correspond to the divisions of the molecule. The tailored graph partitioning scheme ensures that running the molecular dynamics simulations independently on the parts and reassembling all individual solutions incurs no loss of accuracy. View this paper.
  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.

Articles (24)

  • Article
  • Open Access
45 Citations
11,846 Views
28 Pages

18 September 2019

Algorithmic decision-making has become ubiquitous in our societal and economic lives. With more and more decisions being delegated to algorithms, we have also encountered increasing evidence of ethical issues with respect to biases and lack of fairne...

  • Feature Paper
  • Article
  • Open Access
6 Citations
6,691 Views
26 Pages

17 September 2019

Solvers for partial differential equations (PDEs) are one of the cornerstones of computational science. For large problems, they involve huge amounts of data that need to be stored and transmitted on all levels of the memory hierarchy. Often, bandwid...

(This article belongs to the Special Issue Data Compression Algorithms and their Applications)
  • Article
  • Open Access
1 Citations
5,634 Views
15 Pages

17 September 2019

We present a mapping between rooted tree decompositions and node separator based multilevel graph partitions. Significant research into both tree decompositions and graph partitions exists. We hope that our result allows for an easier knowledge trans...

  • Article
  • Open Access
9 Citations
3,944 Views
9 Pages

16 September 2019

Recently, magnetorheological elastomer (MRE) has been paid increasingly attention for vibration mitigation devices with the benefits of low power cost, fail safe performances, and fast responses. To make full use of the striking advantages of MRE dev...

  • Article
  • Open Access
21 Citations
6,866 Views
20 Pages

Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies

  • Lars Gottesbüren,
  • Michael Hamann,
  • Tim Niklas Uhl and
  • Dorothea Wagner

16 September 2019

Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on computing a nested dissection order by recursively dividing the road net...

  • Article
  • Open Access
8 Citations
4,133 Views
24 Pages

Unsteady State Lightweight Iris Certification Based on Multi-Algorithm Parallel Integration

  • Liu Shuai,
  • Liu Yuanning,
  • Zhu Xiaodong,
  • Zhang Kuo and ,
  • Ding Tong,
  • Li Xinlong and
  • Wang Chaoqun
  • + 2 authors+ 0 author

12 September 2019

Aimed at the one-to-one certification problem of unsteady state iris at different shooting times, a multi-algorithm parallel integration general model structure is proposed in this paper. The iris in the lightweight constrained state affected by defo...

  • Article
  • Open Access
1 Citations
3,964 Views
23 Pages

11 September 2019

The development of robotic applications for agricultural environments has several problems which are not present in the robotic systems used for indoor environments. Some of these problems can be solved with an efficient navigation system. In this pa...

  • Article
  • Open Access
3 Citations
6,349 Views
20 Pages

10 September 2019

The interactive, web-based point-and-click application presented in this article, allows anonymizing data without any knowledge in a programming language. Anonymization in data mining, but creating safe, anonymized data is by no means a trivial task....

  • Article
  • Open Access
14 Citations
6,393 Views
30 Pages

10 September 2019

The information bottleneck method is a generic clustering framework from the field of machine learning which allows compressing an observed quantity while retaining as much of the mutual information it shares with the quantity of primary relevance as...

(This article belongs to the Special Issue Coding Theory and Its Application)
  • Feature Paper
  • Article
  • Open Access
8 Citations
6,063 Views
28 Pages

9 September 2019

We present a list of parameterized problems together with a complexity classification of whether they allow a fixed-parameter tractable reduction to SAT or not. These problems are parameterized versions of problems whose complexity lies at the second...

(This article belongs to the Special Issue New Frontiers in Parameterized Complexity and Algorithms)
  • Article
  • Open Access
16 Citations
4,288 Views
16 Pages

Parameterised Enumeration for Modification Problems

  • Nadia Creignou,
  • Raïda Ktari,
  • Arne Meier,
  • Julian-Steffen Müller and ,
  • Frédéric Olive and
  • Heribert Vollmer
  • + 1 author+ 0 author

9 September 2019

Recently, Creignou et al. (Theory Comput. Syst. 2017), introduced the class DelayFPT into parameterised complexity theory in order to capture the notion of efficiently solvable parameterised enumeration problems. In this paper, we propose a framework...

(This article belongs to the Special Issue New Frontiers in Parameterized Complexity and Algorithms)
  • Article
  • Open Access
6 Citations
4,758 Views
16 Pages

Parallelism Strategies for Big Data Delayed Transfer Entropy Evaluation

  • Jonas R. Dourado,
  • Jordão Natal de Oliveira Júnior and
  • Carlos D. Maciel

9 September 2019

Generated and collected data have been rising with the popularization of technologies such as Internet of Things, social media, and smartphone, leading big data term creation. One class of big data hidden information is causality. Among the tools to...

  • Article
  • Open Access
11 Citations
4,959 Views
19 Pages

Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics

  • Hristo N. Djidjev,
  • Georg Hahn,
  • Susan M. Mniszewski,
  • Christian F. A. Negre and
  • Anders M. N. Niklasson

7 September 2019

The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several advanced algor...

  • Article
  • Open Access
4 Citations
6,542 Views
20 Pages

Semi-Supervised Manifold Alignment Using Parallel Deep Autoencoders

  • Fayeem Aziz,
  • Aaron S. W. Wong and
  • Stephan Chalup

6 September 2019

The aim of manifold learning is to extract low-dimensional manifolds from high-dimensional data. Manifold alignment is a variant of manifold learning that uses two or more datasets that are assumed to represent different high-dimensional representati...

  • Article
  • Open Access
3 Citations
3,449 Views
16 Pages

5 September 2019

This paper deals with the consensus tracking problem of heterogeneous linear multiagent systems under the repeatable operation environment, and adopts a proportional differential (PD)-type iterative learning control (ILC) algorithm based on the fract...

  • Article
  • Open Access
31 Citations
4,944 Views
17 Pages

4 September 2019

A rolling bearing is an important connecting part between rotating machines. It is susceptible to mechanical stress and wear, which affect the running state of bearings. In order to effectively identify the fault types and analyze the fault severity...

(This article belongs to the Special Issue Algorithms for Fault Detection and Diagnosis)
  • Article
  • Open Access
5 Citations
4,564 Views
17 Pages

30 August 2019

A number of intelligent warning techniques have been implemented for detecting underwater infrastructure diagnosis to partially replace human-conducted on-site inspections. However, the extensively varying real-world situation (e.g., the adverse envi...

(This article belongs to the Special Issue Algorithms for Fault Detection and Diagnosis)
  • Article
  • Open Access
14 Citations
5,898 Views
32 Pages

29 August 2019

Ontologies are used to model knowledge in several domains of interest, such as the biomedical domain. Conceptualization is the basic task for ontology building. Concepts are identified, and then they are linked through their semantic relationships. R...

  • Article
  • Open Access
3 Citations
4,571 Views
16 Pages

29 August 2019

Self-nested trees present a systematic form of redundancy in their subtrees and thus achieve optimal compression rates by directed acrylic graph (DAG) compression. A method for quantifying the degree of self-similarity of plants through self-nested t...

(This article belongs to the Special Issue Data Compression Algorithms and their Applications)
  • Article
  • Open Access
3 Citations
4,825 Views
15 Pages

29 August 2019

In the linear response eigenvalue problem arising from quantum chemistry and physics, one needs to compute several positive eigenvalues together with the corresponding eigenvectors. For such a task, in this paper, we present a FEAST algorithm based o...

  • Article
  • Open Access
6 Citations
4,899 Views
16 Pages

26 August 2019

A fast particle-locating method is proposed for the hybrid Euler–Lagrangian models on the arbitrary polyhedral mesh, which is of essential importance to improve the computational efficiency by searching the host cells for the tracked particles...

  • Article
  • Open Access
7 Citations
4,903 Views
13 Pages

Adaptive-Size Dictionary Learning Using Information Theoretic Criteria

  • Bogdan Dumitrescu and
  • Ciprian Doru Giurcăneanu

25 August 2019

Finding the size of the dictionary is an open issue in dictionary learning (DL). We propose an algorithm that adapts the size during the learning process by using Information Theoretic Criteria (ITC) specialized to the DL problem. The algorithm is bu...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
48 Citations
9,007 Views
15 Pages

24 August 2019

A simple and fast k-medoids algorithm that updates medoids by minimizing the total distance within clusters has been developed. Although it is simple and fast, as its name suggests, it nonetheless has neglected local optima and empty clusters that ma...

  • Feature Paper
  • Article
  • Open Access
17 Citations
7,117 Views
17 Pages

Online EEG Seizure Detection and Localization

  • Amirsalar Mansouri,
  • Sanjay P. Singh and
  • Khalid Sayood

23 August 2019

Epilepsy is one of the three most prevalent neurological disorders. A significant proportion of patients suffering from epilepsy can be effectively treated if their seizures are detected in a timely manner. However, detection of most seizures require...

XFacebookLinkedIn
Algorithms - ISSN 1999-4893