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

Algorithms, Volume 14, Issue 6

2021 June - 30 articles

Cover Story: An approximate 2-decomposable rigid-backbone sequence energy landscape (top) is superimposed over the true sequence energy landscape (bottom). While the two landscapes share a lot, the GMEC in the top landscape corresponds to a shallow basin in the more complex real energy landscape. By enumerating diverse low-energy solutions in the approximate landscape (blacks dots surrounded by circles denoting distance constraints), a third solution emerges in a shallow basin which almost matches the GMEC of the true landscape. 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 (30)

  • Feature Paper
  • Article
  • Open Access
13 Citations
4,325 Views
11 Pages

Using Machine Learning for Quantum Annealing Accuracy Prediction

  • Aaron Barbosa,
  • Elijah Pelofske,
  • Georg Hahn and
  • Hristo N. Djidjev

21 June 2021

Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically...

  • Article
  • Open Access
4 Citations
3,558 Views
11 Pages

21 June 2021

In view of the characteristics of the guidance, navigation and control (GNC) system of the lunar orbit rendezvous and docking (RVD), we design an auxiliary safety prediction system based on the human–machine collaboration framework. The system contai...

  • Article
  • Open Access
13 Citations
6,559 Views
15 Pages

Combining Optimization Methods Using an Adaptive Meta Optimizer

  • Nicola Landro,
  • Ignazio Gallo and
  • Riccardo La Grassa

19 June 2021

Optimization methods are of great importance for the efficient training of neural networks. There are many articles in the literature that propose particular variants of existing optimizers. In our article, we propose the use of the combination of tw...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
5 Citations
3,223 Views
23 Pages

Unbiased Fuzzy Estimators in Fuzzy Hypothesis Testing

  • Nikos Mylonas and
  • Basil Papadopoulos

17 June 2021

In this paper, we develop fuzzy, possibilistic hypothesis tests for testing crisp hypotheses for a distribution parameter from crisp data. In these tests, fuzzy statistics are used, which are produced by the possibility distribution of the estimated...

  • Article
  • Open Access
10 Citations
3,866 Views
12 Pages

15 June 2021

Many mixed datasets with both numerical and categorical attributes have been collected in various fields, including medicine, biology, etc. Designing appropriate similarity measurements plays an important role in clustering these datasets. Many tradi...

  • Article
  • Open Access
17 Citations
4,899 Views
24 Pages

13 June 2021

Since January 2020, the outbreak of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) has affected the whole world, producing a respiratory disease that can become severe and even cause death in certain groups of people. The main method fo...

  • Article
  • Open Access
5 Citations
3,641 Views
9 Pages

9 June 2021

We proposed the method that translates the two-dimensional CSP for minimizing the number of cuts to the Ising model. After that, we conducted computer experiments of the proposed model using the benchmark problem. From the above, the following result...

  • Article
  • Open Access
41 Citations
5,964 Views
20 Pages

8 June 2021

The shallow features extracted by the traditional artificial intelligence algorithm-based damage identification methods pose low sensitivity and ignore the timing characteristics of vibration signals. Thus, this study uses the high-dimensional featur...

(This article belongs to the Section Algorithms for Multidisciplinary Applications)
  • Article
  • Open Access
12 Citations
3,449 Views
22 Pages

8 June 2021

OPTCON is an algorithm for the optimal control of nonlinear stochastic systems which is particularly applicable to economic models. It delivers approximate numerical solutions to optimum control (dynamic optimization) problems with a quadratic object...

(This article belongs to the Special Issue Stochastic Algorithms and Their Applications)
  • Article
  • Open Access
12 Citations
4,546 Views
19 Pages

5 June 2021

With the development of the sharing economy, carsharing is a major achievement in the current mode of transportation in sharing economies. Carsharing can effectively alleviate traffic congestion and reduce the travel cost of residents. However, due t...

  • Article
  • Open Access
15 Citations
6,240 Views
24 Pages

3 June 2021

This paper presents the parameter optimisation of the flight control system of a singlerotor medium-scale rotorcraft. The six degrees-of-freedom (DOF) nonlinear mathematical model of the rotorcraft is developed. This model is then used to develop pro...

(This article belongs to the Special Issue Algorithms for PID Controller 2021)
  • Article
  • Open Access
17 Citations
4,125 Views
23 Pages

2 June 2021

Probabilistic solar power forecasting has been critical in Southern Africa because of major shortages of power due to climatic changes and other factors over the past decade. This paper discusses Gaussian process regression (GPR) coupled with core ve...

  • Article
  • Open Access
4 Citations
4,303 Views
18 Pages

Approximation Algorithms for Sorting λ-Permutations by λ-Operations

  • Guilherme Henrique Santos Miranda,
  • Alexsandro Oliveira Alexandrino,
  • Carla Negri Lintzmayer and
  • Zanoni Dias

1 June 2021

Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the...

(This article belongs to the Section Randomized, Online, and Approximation Algorithms)
  • Article
  • Open Access
7 Citations
5,122 Views
17 Pages

1 June 2021

Applications have different preferences for caches, sometimes even within the different running phases. Caches with fixed parameters may compromise the performance of a system. To solve this problem, we propose a real-time adaptive reconfigurable cac...

(This article belongs to the Section Algorithms for Multidisciplinary Applications)
  • Article
  • Open Access
4,156 Views
39 Pages

31 May 2021

Transactional memory has been receiving much attention from both academia and industry. In transactional memory, program code is split into transactions, blocks of code that appear to execute atomically. Transactions are executed speculatively and th...

(This article belongs to the Section Parallel and Distributed Algorithms)
  • Article
  • Open Access
12 Citations
4,796 Views
14 Pages

31 May 2021

Dominating sets are among the most well-studied concepts in graph theory, with many real-world applications especially in the area of wireless sensor networks. One way to increase network lifetime in wireless sensor networks consists of assigning sen...

(This article belongs to the Special Issue 2021 Selected Papers from Algorithms Editorial Board Members)
  • Article
  • Open Access
1 Citations
3,619 Views
23 Pages

Storing Set Families More Compactly with Top ZDDs

  • Kotaro Matsuda,
  • Shuhei Denzumi and
  • Kunihiko Sadakane

31 May 2021

Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for representing set families in a compressed form. With ZDDs, many valuable operations on set families can be done in time polynomial in ZDD size. In some cases, however, the size o...

(This article belongs to the Special Issue Algorithms and Data-Structures for Compressed Computation)
  • Article
  • Open Access
14 Citations
4,838 Views
14 Pages

A PID Parameter Tuning Method Based on the Improved QUATRE Algorithm

  • Zhuo-Qiang Zhao,
  • Shi-Jian Liu and
  • Jeng-Shyang Pan

31 May 2021

The PID (proportional–integral–derivative) controller is the most widely used control method in modern engineering control because it has the characteristics of a simple algorithm structure and easy implementation. The traditional PID controller, in...

(This article belongs to the Special Issue Algorithms for PID Controller 2021)
  • Article
  • Open Access
3,374 Views
15 Pages

31 May 2021

The stochastic approximation algorithm (SAA), starting from the pioneer work by Robbins and Monro in 1950s, has been successfully applied in systems and control, statistics, machine learning, and so forth. In this paper, we will review the developmen...

  • Article
  • Open Access
4 Citations
3,998 Views
22 Pages

Sorting by Multi-Cut Rearrangements

  • Laurent Bulteau,
  • Guillaume Fertin,
  • Géraldine Jean and
  • Christian Komusiewicz

29 May 2021

A multi-cut rearrangement of a string S is a string S′ obtained from S by an operation called k-cut rearrangement, that consists of (1) cutting S at a given number k of places in S, making S the concatenated string X1·X2·X3·…·Xk·Xk+1, where X1 and Xk...

(This article belongs to the Section Analysis of Algorithms and Complexity Theory)
  • Article
  • Open Access
14 Citations
5,486 Views
27 Pages

Guaranteed Diversity and Optimality in Cost Function Network Based Computational Protein Design Methods

  • Manon Ruffini,
  • Jelena Vucinic,
  • Simon de Givry,
  • George Katsirelos and ,
  • Sophie Barbe and
  • Thomas Schiex
  • + 1 author+ 0 author

28 May 2021

Proteins are the main active molecules of life. Although natural proteins play many roles, as enzymes or antibodies for example, there is a need to go beyond the repertoire of natural proteins to produce engineered proteins that precisely meet applic...

(This article belongs to the Special Issue Algorithms in Computational Biology)
  • Article
  • Open Access
7 Citations
5,736 Views
17 Pages

Efficient and Scalable Initialization of Partitioned Coupled Simulations with preCICE

  • Amin Totounferoush,
  • Frédéric Simonis,
  • Benjamin Uekermann and
  • Miriam Schulte

27 May 2021

preCICE is an open-source library, that provides comprehensive functionality to couple independent parallelized solver codes to establish a partitioned multi-physics multi-code simulation environment. For data communication between the respective exe...

  • Article
  • Open Access
13 Citations
5,600 Views
15 Pages

The Locating-Chromatic Number of Origami Graphs

  • Agus Irawan,
  • Asmiati Asmiati,
  • La Zakaria and
  • Kurnia Muludi

27 May 2021

The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k such that G has a locating k-coloring, denoted by χL(G). This article p...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
5 Citations
3,701 Views
18 Pages

26 May 2021

As the main method of information transmission, it is particularly important to ensure the security of speech communication. Considering the more complex multipath channel transmission situation in the wireless communication of speech signals and sep...

  • Article
  • Open Access
5 Citations
3,782 Views
19 Pages

25 May 2021

We prove a Ω(n) lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two popular speed-up techniques for shortest path routing. Our construction is based on a graph family not too far from subgraphs that occur in real...

(This article belongs to the Special Issue Selected Algorithmic Papers From CSR 2020)
  • Article
  • Open Access
29 Citations
5,737 Views
13 Pages

24 May 2021

The selection of the hyper-parameters plays a critical role in the task of prediction based on the recurrent neural networks (RNN). Traditionally, the hyper-parameters of the machine learning models are selected by simulations as well as human experi...

  • Article
  • Open Access
7 Citations
4,161 Views
20 Pages

22 May 2021

This paper studies the community structure of the bank correlation network in the financial system and analyzes the systemic risk of the community sub-networks. Based on the balance sheet data of U.S. commercial banks from 2008, we establish a bank c...

(This article belongs to the Special Issue Network Science: Algorithms and Applications)
  • Article
  • Open Access
2 Citations
4,955 Views
26 Pages

21 May 2021

We present linear-time algorithms computing the reversed Lempel–Ziv factorization [Kolpakov and Kucherov, TCS’09] within the space bounds of two different suffix tree representations. We can adapt these algorithms to compute the longest previous non-...

(This article belongs to the Special Issue Combinatorial Methods for String Processing)
  • Article
  • Open Access
15 Citations
6,833 Views
12 Pages

Circle-U-Net: An Efficient Architecture for Semantic Segmentation

  • Feng Sun,
  • Ajith Kumar V,
  • Guanci Yang,
  • Ansi Zhang and
  • Yiyun Zhang

21 May 2021

State-of-the-art semantic segmentation methods rely too much on complicated deep networks and thus cannot train efficiently. This paper introduces a novel Circle-U-Net architecture that exceeds the original U-Net on several standards. The proposed mo...

(This article belongs to the Topic Medical Image Analysis)
  • Article
  • Open Access
7 Citations
4,310 Views
13 Pages

Validation of Automated Chromosome Recovery in the Reconstruction of Ancestral Gene Order

  • Qiaoji Xu,
  • Lingling Jin,
  • James H. Leebens-Mack and
  • David Sankoff

21 May 2021

The RACCROCHE pipeline reconstructs ancestral gene orders and chromosomal contents of the ancestral genomes at all internal vertices of a phylogenetic tree. The strategy is to accumulate a very large number of generalized adjacencies, phylogeneticall...

(This article belongs to the Special Issue Algorithms in Computational Biology)
XFacebookLinkedIn
Algorithms - ISSN 1999-4893