Skip to Content

Algorithms, Volume 12, Issue 10

2019 October - 22 articles

Cover Story: Temporal networks are graphs in which edges have temporal labels, specifying their starting and traversal times. Ignoring this information might cause wrong conclusions concerning the reachability properties of the graph. On the other hand, computing these properties exactly may turn out to be computationally unfeasible due to the huge number of temporal edges. In this paper we show how the probabilistic counting approach can be used to approximately compute the sizes of the temporal reachability cones, and how we can approximate the temporal neighborhood function (i.e., the number of pairs of nodes reachable from one another in a given time interval) of large temporal networks in a few seconds. Finally, we apply our algorithm in order to analyze and compare the behavior of 25 public transportation networks. 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 (22)

  • Article
  • Open Access
5 Citations
4,547 Views
24 Pages

22 October 2019

Image deblurring under the background of impulse noise is a typically ill-posed inverse problem which attracted great attention in the fields of image processing and computer vision. The fast total variation deconvolution (FTVd) algorithm proved to b...

  • Article
  • Open Access
15 Citations
4,889 Views
23 Pages

21 October 2019

This paper proposes a model predictive control method based on dynamic multi-objective optimization algorithms (MPC_CPDMO-NSGA-II) for reducing freeway congestion and relieving environment impact simultaneously. A new dynamic multi-objective optimiza...

  • Article
  • Open Access
2 Citations
4,120 Views
11 Pages

On Finding Two Posets that Cover Given Linear Orders

  • Ivy Ordanel,
  • Proceso Fernandez and
  • Henry Adorna

19 October 2019

The Poset Cover Problem is an optimization problem where the goal is to determine a minimum set of posets that covers a given set of linear orders. This problem is relevant in the field of data mining, specifically in determining directed networks or...

  • Article
  • Open Access
7 Citations
4,095 Views
14 Pages

A New Coding Paradigm for the Primitive Relay Channel

  • Marco Mondelli,
  • S. Hamed Hassani and
  • Rüdiger Urbanke

18 October 2019

We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known codin...

  • Article
  • Open Access
1 Citations
3,796 Views
15 Pages

Adaptive Clustering via Symmetric Nonnegative Matrix Factorization of the Similarity Matrix

  • Paola Favati,
  • Grazia Lotti,
  • Ornella Menchi and
  • Francesco Romani

17 October 2019

The problem of clustering, that is, the partitioning of data into groups of similar objects, is a key step for many data-mining problems. The algorithm we propose for clustering is based on the symmetric nonnegative matrix factorization (SymNMF) of a...

  • Article
  • Open Access
4 Citations
3,660 Views
15 Pages

17 October 2019

In supervised Activities of Daily Living (ADL) recognition systems, annotating collected sensor readings is an essential, yet exhaustive, task. Readings are collected from activity-monitoring sensors in a 24/7 manner. The size of the produced dataset...

  • Article
  • Open Access
5 Citations
4,448 Views
16 Pages

15 October 2019

This paper proposes an adaptive backstepping control algorithm for electric braking systems with electromechanical actuators (EMAs). First, the ideal mathematical model of the EMA is established, and the nonlinear factors are analyzed, such as the de...

  • Article
  • Open Access
1 Citations
3,485 Views
7 Pages

14 October 2019

Recent work showed that there is a significant difference between the statistics of amino acid triplets and quadruplets in sequences of folded proteins and randomly generated sequences. These statistics were used to assign a score to each sequence an...

  • Article
  • Open Access
20 Citations
5,895 Views
16 Pages

Multimodal Dynamic Journey-Planning

  • Kalliopi Giannakopoulou,
  • Andreas Paraskevopoulos and
  • Christos Zaroliagis

13 October 2019

In this paper, a new model, known as the multimodal dynamic timetable model (DTM), is presented for computing optimal multimodal journeys in schedule-based public transport systems. The new model constitutes an extension of the dynamic timetable mode...

  • Article
  • Open Access
13 Citations
4,578 Views
22 Pages

Approximating the Temporal Neighbourhood Function of Large Temporal Graphs

  • Pierluigi Crescenzi,
  • Clémence Magnien and
  • Andrea Marino

10 October 2019

Temporal networks are graphs in which edges have temporal labels, specifying their starting times and their traversal times. Several notions of distances between two nodes in a temporal network can be analyzed, by referring, for example, to the earli...

  • Article
  • Open Access
3 Citations
5,132 Views
14 Pages

4 October 2019

Euclidean distance between instances is widely used to capture the manifold structure of data and for graph-based dimensionality reduction. However, in some circumstances, the basic Euclidean distance cannot accurately capture the similarity between...

  • Article
  • Open Access
4 Citations
4,768 Views
14 Pages

A Convex Optimization Algorithm for Electricity Pricing of Charging Stations

  • Jing Zhang,
  • Xiangpeng Zhan,
  • Taoyong Li,
  • Linru Jiang,
  • Jun Yang,
  • Yuanxing Zhang,
  • Xiaohong Diao and
  • Sining Han

1 October 2019

The problem of electricity pricing for charging stations is a multi-objective mixed integer nonlinear programming. Existing algorithms have low efficiency in solving this problem. In this paper, a convex optimization algorithm is proposed to get the...

  • Article
  • Open Access
6 Citations
4,407 Views
12 Pages

Recommending Links to Control Elections via Social Influence

  • Federico Corò,
  • Gianlorenzo D’Angelo and
  • Yllka Velaj

1 October 2019

Political parties recently learned that they must use social media campaigns along with advertising on traditional media to defeat their opponents. Before the campaign starts, it is important for a political party to establish and ensure its media pr...

  • Article
  • Open Access
42 Citations
6,636 Views
34 Pages

A Finite Regime Analysis of Information Set Decoding Algorithms

  • Marco Baldi,
  • Alessandro Barenghi,
  • Franco Chiaraluce,
  • Gerardo Pelosi and
  • Paolo Santini

1 October 2019

Decoding of random linear block codes has been long exploited as a computationally hard problem on which it is possible to build secure asymmetric cryptosystems. In particular, both correcting an error-affected codeword, and deriving the error vector...

  • Article
  • Open Access
18 Citations
5,791 Views
17 Pages

Self-Improving Generative Artificial Neural Network for Pseudorehearsal Incremental Class Learning

  • Diego Mellado,
  • Carolina Saavedra,
  • Steren Chabert,
  • Romina Torres and
  • Rodrigo Salas

1 October 2019

Deep learning models are part of the family of artificial neural networks and, as such, they suffer catastrophic interference when learning sequentially. In addition, the greater number of these models have a rigid architecture which prevents the inc...

  • Article
  • Open Access
40 Citations
7,709 Views
12 Pages

26 September 2019

The conveyor belt is an indispensable piece of conveying equipment for a mine whose deviation caused by roller sticky material and uneven load distribution is the most common failure during operation. In this paper, a real-time conveyor belt detectio...

  • Editorial
  • Open Access
4 Citations
4,113 Views
3 Pages

24 September 2019

Health technology research brings together complementary interdisciplinary research skills in the development of innovative health technology applications. Recent research indicates that artificial intelligence can help achieve outstanding performanc...

  • Article
  • Open Access
5 Citations
4,820 Views
38 Pages

24 September 2019

Modeling brain dynamics to better understand and control complex behaviors underlying various cognitive brain functions have been of interest to engineers, mathematicians and physicists over the last several decades. With the motivation of developing...

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

24 September 2019

In the multi-variety and small-quantity manufacturing environment, changeover operation occurs frequently, and cooperative changeover method is often used as a way to shorten the changeover time and balance the workload. However, more workers and tas...

  • Article
  • Open Access
79 Citations
7,214 Views
19 Pages

21 September 2019

Fog computing is becoming popular as a solution to support applications based on geographically distributed sensors that produce huge volumes of data to be processed and filtered with response time constraints. In this scenario, typical of a smart ci...

  • Article
  • Open Access
2 Citations
6,376 Views
20 Pages

20 September 2019

We present an algorithm selection framework based on machine learning for the exact computation of treewidth, an intensively studied graph parameter that is NP-hard to compute. Specifically, we analyse the comparative performance of three state-of-th...

XFacebookLinkedIn
Algorithms - ISSN 1999-4893