Algorithms

12 pages, 368 KiB

Open AccessEditor’s ChoiceArticle

Optimization of Constrained Stochastic Linear-Quadratic Control on an Infinite Horizon: A Direct-Comparison Based Approach

by Ruobing Xue, Xiangshen Ye and Weiping Wu

Algorithms 2020, 13(2), 49; https://doi.org/10.3390/a13020049 - 24 Feb 2020

Viewed by 4134

Abstract

In this paper we study the optimization of the discrete-time stochastic linear-quadratic (LQ) control problem with conic control constraints on an infinite horizon, considering multiplicative noises. Stochastic control systems can be formulated as Markov Decision Problems (MDPs) with continuous state spaces and therefore [...] Read more.

In this paper we study the optimization of the discrete-time stochastic linear-quadratic (LQ) control problem with conic control constraints on an infinite horizon, considering multiplicative noises. Stochastic control systems can be formulated as Markov Decision Problems (MDPs) with continuous state spaces and therefore we can apply the direct-comparison based optimization approach to solve the problem. We first derive the performance difference formula for the LQ problem by utilizing the state separation property of the system structure. Based on this, we successfully derive the optimality conditions and the stationary optimal feedback control. By introducing the optimization, we establish a general framework for infinite horizon stochastic control problems. The direct-comparison based approach is applicable to both linear and nonlinear systems. Our work provides a new perspective in LQ control problems; based on this approach, learning based algorithms can be developed without identifying all of the system parameters. Full article

► Show Figures

Figure 1

17 pages, 8080 KiB

Open AccessArticle

PD Steering Controller Utilizing the Predicted Position on Track for Autonomous Vehicles Driven on Slippery Roads

by Natalia Alekseeva, Ivan Tanev and Katsunori Shimohara

Algorithms 2020, 13(2), 48; https://doi.org/10.3390/a13020048 - 21 Feb 2020

Cited by 1 | Viewed by 4880

Abstract

Among the most important characteristics of autonomous vehicles are the safety and robustness in various traffic situations and road conditions. In this paper, we focus on the development and analysis of the extended version of the canonical proportional-derivative PD controllers that are known [...] Read more.

Among the most important characteristics of autonomous vehicles are the safety and robustness in various traffic situations and road conditions. In this paper, we focus on the development and analysis of the extended version of the canonical proportional-derivative PD controllers that are known to provide a good quality of steering on non-slippery (dry) roads. However, on slippery roads, due to the poor yaw controllability of the vehicle (suffering from understeering and oversteering), the quality of control of such controllers deteriorates. The proposed predicted PD controller (PPD controller) overcomes the main drawback of PD controllers, namely, the reactiveness of their steering behavior. The latter implies that steering output is a direct result of the currently perceived lateral- and angular deviation of the vehicle from its intended, ideal trajectory, which is the center of the lane. This reactiveness, combined with the tardiness of the yaw control of the vehicle on slippery roads, results in a significant lag in the control loop that could not be compensated completely by the predictive (derivative) component of these controllers. In our approach, keeping the controller efforts at the same level as in PD controllers by avoiding (i) complex computations and (ii) adding additional variables, the PPD controller shows better quality of steering than that of the evolved (via genetic programming) models. Full article

(This article belongs to the Special Issue Algorithms for PID Controller 2019)

► Show Figures

Figure 1

18 pages, 1658 KiB

Open AccessArticle

Accelerating Binary String Comparisons with a Scalable, Streaming-Based System Architecture Based on FPGAs

by Sarah Pilz, Florian Porrmann, Martin Kaiser, Jens Hagemeyer, James M. Hogan and Ulrich Rückert

Algorithms 2020, 13(2), 47; https://doi.org/10.3390/a13020047 - 21 Feb 2020

Cited by 7 | Viewed by 5472

Abstract

This paper is concerned with Field Programmable Gate Arrays (FPGA)-based systems for energy-efficient high-throughput string comparison. Modern applications which involve comparisons across large data sets—such as large sequence sets in molecular biology—are by their nature computationally intensive. In this work, we present a [...] Read more.

This paper is concerned with Field Programmable Gate Arrays (FPGA)-based systems for energy-efficient high-throughput string comparison. Modern applications which involve comparisons across large data sets—such as large sequence sets in molecular biology—are by their nature computationally intensive. In this work, we present a scalable FPGA-based system architecture to accelerate the comparison of binary strings. The current architecture supports arbitrary lengths in the range 16 to 2048-bit, covering a wide range of possible applications. In our example application, we consider DNA sequences embedded in a binary vector space through Locality Sensitive Hashing (LSH) one of several possible encodings that enable us to avoid more costly character-based operations. Here the resulting encoding is a 512-bit binary signature with comparisons based on the Hamming distance. In this approach, most of the load arises from the calculation of the

O (m * n)

Hamming distances between the signatures, where m is the number of queries and n is the number of signatures contained in the database. Signature generation only needs to be performed once, and we do not consider it further, focusing instead on accelerating the signature comparisons. The proposed FPGA-based architecture is optimized for high-throughput using hundreds of computing elements, arranged in a systolic array. These core computing elements can be adapted to support other string comparison algorithms with little effort, while the other infrastructure stays the same. On a Xilinx Virtex UltraScale+ FPGA (XCVU9P-2), a peak throughput of 75.4 billion comparisons per second—of 512-bit signatures—was achieved, using a design with 384 parallel processing elements and a clock frequency of 200 MHz. This makes our FPGA design 86 times faster than a highly optimized CPU implementation. Compared to a GPU design, executed on an NVIDIA GTX1060, it performs nearly five times faster. Full article

(This article belongs to the Special Issue Parallel String Matching Algorithms and Applications)

► Show Figures

Figure 1

13 pages, 5566 KiB

Open AccessArticle

FADIT: Fast Document Image Thresholding

by Yufang Min and Yaonan Zhang

Algorithms 2020, 13(2), 46; https://doi.org/10.3390/a13020046 - 21 Feb 2020

Cited by 1 | Viewed by 4394

Abstract

We propose a fast document image thresholding method (FADIT) and evaluations of the two classic methods for demonstrating the effectiveness of FADIT. We put forward two assumptions: (1) the probability of the occurrence of grayscale text and background is ideally two constants, and [...] Read more.

We propose a fast document image thresholding method (FADIT) and evaluations of the two classic methods for demonstrating the effectiveness of FADIT. We put forward two assumptions: (1) the probability of the occurrence of grayscale text and background is ideally two constants, and (2) a pixel with a low grayscale has a high probability of being classified as text and a pixel with a high grayscale has a high probability of being classified as background. With the two assumptions, a new criterion function is applied to document image thresholding in the Bayesian framework. The effectiveness of the method has been borne of a quantitative metric as well as qualitative comparisons with the state-of-the-art methods. Full article

► Show Figures

Figure 1

15 pages, 5006 KiB

Open AccessArticle

Adaptive Tolerance Dehazing Algorithm Based on Dark Channel Prior

by Fan Yang and ShouLian Tang

Algorithms 2020, 13(2), 45; https://doi.org/10.3390/a13020045 - 20 Feb 2020

Cited by 8 | Viewed by 4581

Abstract

The tolerance mechanism based on dark channel prior (DCP) of a single image dehazing algorithm is less effective when there are large areas of the bright region in the hazy image because it cannot obtain the tolerance adaptively according to the characteristics of [...] Read more.

The tolerance mechanism based on dark channel prior (DCP) of a single image dehazing algorithm is less effective when there are large areas of the bright region in the hazy image because it cannot obtain the tolerance adaptively according to the characteristics of the image. It will lead to insufficient improvement of the transmission of image, so it is difficult to eliminate the color distortion and block effects in the restored image completely. Moreover, when a dense haze area or a third-party direct light source (sunlight, headlights and reflected glare) is misjudged as sky area, the use of tolerance will cause an inferior dehazing effect such as details lost. Regarding the issue above, this paper proposes an adaptive tolerance estimation algorithm. The tolerance is obtained according to the statistic characteristics of each image to make the estimation of transmission more accurately. The experimental results show that the proposed algorithm not only maintains high operational efficiency but also effectively compensates for the defects of the dark channel prior to some scenes. The proposed algorithm can effectively solve the problem of color distortion recovered by the DCP method in the bright regions of the image. Full article

► Show Figures

Figure 1

16 pages, 1700 KiB

Open AccessArticle

Modified Migrating Birds Optimization for Energy-Aware Flexible Job Shop Scheduling Problem

by Hongchan Li, Haodong Zhu and Tianhua Jiang

Algorithms 2020, 13(2), 44; https://doi.org/10.3390/a13020044 - 20 Feb 2020

Cited by 25 | Viewed by 4588

Abstract

In recent decades, workshop scheduling has excessively focused on time-related indicators, while ignoring environmental metrics. With the advent of sustainable manufacturing, the energy-aware scheduling problem has been attracting more and more attention from scholars and researchers. In this study, we investigate an energy-aware [...] Read more.

In recent decades, workshop scheduling has excessively focused on time-related indicators, while ignoring environmental metrics. With the advent of sustainable manufacturing, the energy-aware scheduling problem has been attracting more and more attention from scholars and researchers. In this study, we investigate an energy-aware flexible job shop scheduling problem to reduce the total energy consumption in the workshop. For the considered problem, the energy consumption model is first built to formulate the energy consumption, such as processing energy consumption, idle energy consumption, setup energy consumption and common energy consumption. Then, a mathematical model is established with the criterion to minimize the total energy consumption. Secondly, a modified migrating birds optimization (MMBO) algorithm is proposed to solve the model. In the proposed MMBO, a population initialization scheme is presented to ensure the initial solutions with a certain quality and diversity. Five neighborhood structures are employed to create neighborhood solutions according to the characteristics of the problem. Furthermore, both a local search method and an aging-based re-initialization mechanism are developed to avoid premature convergence. Finally, the experimental results validate that the proposed algorithm is effective for the problem under study. Full article

(This article belongs to the Special Issue Swarm Intelligence Applications and Algorithms)

► Show Figures

Figure 1

17 pages, 4396 KiB

Open AccessArticle

Optimal Model for Carsharing Station Location Based on Multi-Factor Constraints

by Qiuyue Sai, Jun Bi and Jinxian Chai

Algorithms 2020, 13(2), 43; https://doi.org/10.3390/a13020043 - 18 Feb 2020

Cited by 10 | Viewed by 4527

Abstract

The development of the sharing economy has made carsharing the main future development model of car rental. Carsharing network investment is enormous, but the resource allocation is limited. Therefore, the reasonable location of the carsharing station is important to the development of carsharing [...] Read more.

The development of the sharing economy has made carsharing the main future development model of car rental. Carsharing network investment is enormous, but the resource allocation is limited. Therefore, the reasonable location of the carsharing station is important to the development of carsharing companies. On the basis of the current status of carsharing development, this research considers multiple influencing factors of carsharing to meet the maximum user demand. Meanwhile, the constraint of the limited cost of the company is considered to establish a nonlinear integer programming model for station location of carsharing. A genetic algorithm is designed to solve the problem by analyzing the location model of the carsharing network. Finally, the results of a case study of Lanzhou, China show the effectiveness of the establishment and solution of the station location model. Full article

(This article belongs to the Special Issue Algorithms for Smart Cities)

► Show Figures

Figure 1

12 pages, 239 KiB

Open AccessArticle

Lower and Upper Bounds for the Discrete Bi-Directional Preemptive Conversion Problem with a Constant Price Interval

by Michael Schwarz

Algorithms 2020, 13(2), 42; https://doi.org/10.3390/a13020042 - 18 Feb 2020

Cited by 1 | Viewed by 3379

Abstract

In the conversion problem, wealth has to be distributed between two assets with the objective to maximize the wealth at the end of the investment horizon. The bi-directional preemptive conversion problem with a constant price interval is the only problem, of the four [...] Read more.

In the conversion problem, wealth has to be distributed between two assets with the objective to maximize the wealth at the end of the investment horizon. The bi-directional preemptive conversion problem with a constant price interval is the only problem, of the four main variants of the conversion problem, that has not yet been optimally solved by competitive analysis. Assuming a given number of monotonous price trends called runs, lower and upper bounds for the competitive ratio are given. In this work, the assumption of a given number of runs is rejected and lower and upper bounds for the bi-directional preemptive conversion problem with a constant price interval are given. Furthermore, an algorithm based on error balancing is given which at minimum achieves the given upper bound. It can also be shown that this algorithm is optimal for the single-period model. Full article

(This article belongs to the Special Issue Online Algorithms in Trading Systems)

21 pages, 4895 KiB

Open AccessArticle

Designing the Uniform Stochastic Photomatrix Therapeutic Systems

by Oleg K. Karaduta, Aleksei F. Deon and Yulian A. Menyaev

Algorithms 2020, 13(2), 41; https://doi.org/10.3390/a13020041 - 18 Feb 2020

Cited by 4 | Viewed by 13697

Abstract

Photomatrix therapeutic systems (PMTS) are widely used for the tasks of preventive, stimulating and rehabilitation medicine. They consist of low-intensity light-emitting diodes (LEDs) having the quasi-monochromatic irradiation properties. Depending on the LED matrix structures, PMTS are intended to be used for local and [...] Read more.

Photomatrix therapeutic systems (PMTS) are widely used for the tasks of preventive, stimulating and rehabilitation medicine. They consist of low-intensity light-emitting diodes (LEDs) having the quasi-monochromatic irradiation properties. Depending on the LED matrix structures, PMTS are intended to be used for local and large areas of bio-objects. However, in the case of non-uniform irradiation of biological tissues, there is a risk of an inadequate physiological response to this type of exposure. The proposed approach considers a novel technique for designing this type of biomedical technical systems, which use the capabilities of stochastic algorithms for LED switching. As a result, the use of stochastic photomatrix systems based on the technology of uniform twisting generation of random variables significantly expands the possibilities of their medical application. Full article

(This article belongs to the Special Issue Algorithms for Human-Computer Interaction)

► Show Figures

Figure 1

18 pages, 1716 KiB

Open AccessArticle

Neural PD Controller for an Unmanned Aerial Vehicle Trained with Extended Kalman Filter

by Javier Gomez-Avila, Carlos Villaseñor, Jesus Hernandez-Barragan, Nancy Arana-Daniel, Alma Y. Alanis and Carlos Lopez-Franco

Algorithms 2020, 13(2), 40; https://doi.org/10.3390/a13020040 - 18 Feb 2020

Cited by 7 | Viewed by 4478

Abstract

Flying robots have gained great interest because of their numerous applications. For this reason, the control of Unmanned Aerial Vehicles (UAVs) is one of the most important challenges in mobile robotics. These kinds of robots are commonly controlled with Proportional-Integral-Derivative (PID) controllers; however, [...] Read more.

Flying robots have gained great interest because of their numerous applications. For this reason, the control of Unmanned Aerial Vehicles (UAVs) is one of the most important challenges in mobile robotics. These kinds of robots are commonly controlled with Proportional-Integral-Derivative (PID) controllers; however, traditional linear controllers have limitations when controlling highly nonlinear and uncertain systems such as UAVs. In this paper, a control scheme for the pose of a quadrotor is presented. The scheme presented has the behavior of a PD controller and it is based on a Multilayer Perceptron trained with an Extended Kalman Filter. The Neural Network is trained online in order to ensure adaptation to changes in the presence of dynamics and uncertainties. The control scheme is tested in real time experiments in order to show its effectiveness. Full article

(This article belongs to the Special Issue Algorithms for PID Controller 2019)

► Show Figures

Figure 1

18 pages, 1911 KiB

Open AccessArticle

Transfer Learning: Video Prediction and Spatiotemporal Urban Traffic Forecasting

by Dmitry Pavlyuk

Algorithms 2020, 13(2), 39; https://doi.org/10.3390/a13020039 - 13 Feb 2020

Cited by 3 | Viewed by 4857

Abstract

Transfer learning is a modern concept that focuses on the application of ideas, models, and algorithms, developed in one applied area, for solving a similar problem in another area. In this paper, we identify links between methodologies in two fields: video prediction and [...] Read more.

Transfer learning is a modern concept that focuses on the application of ideas, models, and algorithms, developed in one applied area, for solving a similar problem in another area. In this paper, we identify links between methodologies in two fields: video prediction and spatiotemporal traffic forecasting. The similarities of the video stream and citywide traffic data structures are discovered and analogues between historical development and modern states of the methodologies are presented and discussed. The idea of transferring video prediction models to the urban traffic forecasting domain is validated using a large real-world traffic data set. The list of transferred techniques includes spatial filtering by predefined kernels in combination with time series models and spectral graph convolutional artificial neural networks. The obtained models’ forecasting performance is compared to the baseline traffic forecasting models: non-spatial time series models and spatially regularized vector autoregression models. We conclude that the application of video prediction models and algorithms for urban traffic forecasting is effective both in terms of observed forecasting accuracy and development, and training efforts. Finally, we discuss problems and obstacles of transferring methodologies and present potential directions for further research. Full article

(This article belongs to the Special Issue Models and Technologies for Intelligent Transportation Systems)

► Show Figures

Figure 1

26 pages, 4835 KiB

Open AccessArticle

Multi-Loop Model Reference Proportional Integral Derivative Controls: Design and Performance Evaluations

by Baris Baykant Alagoz, Aleksei Tepljakov, Eduard Petlenkov and Celaleddin Yeroglu

Algorithms 2020, 13(2), 38; https://doi.org/10.3390/a13020038 - 13 Feb 2020

Cited by 10 | Viewed by 5887

Abstract

Due to unpredictable and fluctuating conditions in real-world control system applications, disturbance rejection is a substantial factor in robust control performance. The inherent disturbance rejection capacity of classical closed loop control systems is limited, and an increase in disturbance rejection performance of single-loop [...] Read more.

Due to unpredictable and fluctuating conditions in real-world control system applications, disturbance rejection is a substantial factor in robust control performance. The inherent disturbance rejection capacity of classical closed loop control systems is limited, and an increase in disturbance rejection performance of single-loop control systems affects the set-point control performance. Multi-loop control structures, which involve model reference control loops, can enhance the inherent disturbance rejection capacity of classical control loops without degrading set-point control performance; while the classical closed Proportional Integral Derivative (PID) control loop deals with stability and set-point control, the additional model reference control loop performs disturbance rejection control. This adaptive disturbance rejection, which does not influence set-point control performance, is achieved by selecting reference models as transfer functions of real control systems. This study investigates six types of multi-loop model reference (ML-MR) control structures for PID control loops and presents straightforward design schemes to enhance the disturbance rejection control performance of existing PID control loops. For this purpose, linear and non-linear ML-MR control structures are introduced, and their control performance improvements and certain inherent drawbacks of these structures are discussed. Design examples demonstrate the benefits of the ML-MR control structures for disturbance rejection performance improvement of PID control loops without severely deteriorating their set-point performance. Full article

(This article belongs to the Special Issue Algorithms for PID Controller 2019)

► Show Figures

Figure 1

18 pages, 794 KiB

Open AccessArticle

New Numerical Treatment for a Family of Two-Dimensional Fractional Fredholm Integro-Differential Equations

by Amer Darweesh, Marwan Alquran and Khawla Aghzawi

Algorithms 2020, 13(2), 37; https://doi.org/10.3390/a13020037 - 9 Feb 2020

Cited by 5 | Viewed by 3906

Abstract

In this paper, we present a robust algorithm to solve numerically a family of two-dimensional fractional integro differential equations. The Haar wavelet method is upgraded to include in its construction the Laplace transform step. This modification has proven to reduce the accumulative errors [...] Read more.

In this paper, we present a robust algorithm to solve numerically a family of two-dimensional fractional integro differential equations. The Haar wavelet method is upgraded to include in its construction the Laplace transform step. This modification has proven to reduce the accumulative errors that will be obtained in case of using the regular Haar wavelet technique. Different examples are discussed to serve two goals, the methodology and the accuracy of our new approach. Full article

► Show Figures

Figure 1

12 pages, 1115 KiB

Open AccessArticle

Approximation Algorithm for Shortest Path in Large Social Networks

by Dennis Nii Ayeh Mensah, Hui Gao and Liang Wei Yang

Algorithms 2020, 13(2), 36; https://doi.org/10.3390/a13020036 - 6 Feb 2020

Cited by 9 | Viewed by 5637

Abstract

Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-Warshall’s algorithms are limited to small networks due to computational complexity and cost. We propose an efficient and a more accurate approximation algorithm that is applicable to large scale networks. Our algorithm [...] Read more.

Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-Warshall’s algorithms are limited to small networks due to computational complexity and cost. We propose an efficient and a more accurate approximation algorithm that is applicable to large scale networks. Our algorithm iteratively constructs levels of hierarchical networks by a node condensing procedure to construct hierarchical graphs until threshold. The shortest paths between nodes in the original network are approximated by considering their corresponding shortest paths in the highest hierarchy. Experiments on real life data show that our algorithm records high efficiency and accuracy compared with other algorithms. Full article

► Show Figures

Figure 1

15 pages, 1431 KiB

Open AccessArticle

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

by Abdel-Rahman Hedar, Shada N. Abdulaziz, Adel A. Sewisy and Gamal A. El-Sayed

Algorithms 2020, 13(2), 35; https://doi.org/10.3390/a13020035 - 4 Feb 2020

Cited by 6 | Viewed by 4286

Abstract

An efficient routing using a virtual backbone (VB) network is one of the most significant improvements in the wireless sensor network (WSN). One promising method for selecting this subset of network nodes is by finding the minimum connected dominating set (MCDS), where the [...] Read more.

An efficient routing using a virtual backbone (VB) network is one of the most significant improvements in the wireless sensor network (WSN). One promising method for selecting this subset of network nodes is by finding the minimum connected dominating set (MCDS), where the searching space for finding a route is restricted to nodes in this MCDS. Thus, finding MCDS in a WSN provides a flexible low-cost solution for the problem of event monitoring, particularly in places with limited or dangerous access to humans as is the case for most WSN deployments. In this paper, we proposed an adaptive scatter search (ASS-MCDS) algorithm that finds the near-optimal solution to this problem. The proposed method invokes a composite fitness function that aims to maximize the solution coverness and connectivity and minimize its cardinality. Moreover, the ASS-MCDS methods modified the scatter search framework through new local search and solution update procedures that maintain the search objectives. We tested the performance of our proposed algorithm using different benchmark-test-graph sets available in the literature. Experiments results show that our proposed algorithm gave good results in terms of solution quality. Full article

► Show Figures

Figure 1

22 pages, 470 KiB

Open AccessArticle

Using Biased-Randomized Algorithms for the Multi-Period Product Display Problem with Dynamic Attractiveness

by Mage Marmol, Leandro do C. Martins, Sara Hatami, Angel A. Juan and Vicenc Fernandez

Algorithms 2020, 13(2), 34; https://doi.org/10.3390/a13020034 - 1 Feb 2020

Cited by 3 | Viewed by 4941

Abstract

From brick-and-mortar stores to omnichannel retail, the efficient selection of products to be displayed on store tables, advertising brochures, or online front pages has become a critical issue. One possible goal is to maximize the overall ‘attractiveness’ level of the displayed items, i.e., [...] Read more.

From brick-and-mortar stores to omnichannel retail, the efficient selection of products to be displayed on store tables, advertising brochures, or online front pages has become a critical issue. One possible goal is to maximize the overall ‘attractiveness’ level of the displayed items, i.e., to enhance the shopping experience of our potential customers as a way to increase sales and revenue. With the goal of maximizing the total attractiveness value for the visiting customers over a multi-period time horizon, this paper studies how to configure an assortment of products to be included in limited display spaces, either physical or online. In order to define a realistic scenario, several constraints are considered for each period and display table: (i) the inclusion of both expensive and non-expensive products on the display tables; (ii) the diversification of product collections; and (iii) the achievement of a minimum profit margin. Moreover, the attractiveness level of each product is assumed to be dynamic, i.e., it is reduced if the product has been displayed in a previous period (loss of novelty) and vice versa. This generates dependencies across periods. Likewise, correlations across items are also considered to account for complementary or substitute products. In the case of brick-and-mortar stores, for instance, solving this rich multi-period product display problem enables them to provide an exciting experience to their customers. As a consequence, an increase in sales revenue should be expected. In order to deal with the underlying optimization problem, which contains a quadratic objective function in its simplest version and a non-smooth one in its complete version, two biased-randomized metaheuristic algorithms are proposed. A set of new instances has been generated to test our approach and compare its performance with that of non-linear solvers. Full article

► Show Figures

Figure 1

23 pages, 3284 KiB

Open AccessArticle

GA-Adaptive Template Matching for Offline Shape Motion Tracking Based on Edge Detection: IAS Estimation from the SURVISHNO 2019 Challenge Video for Machine Diagnostics Purposes

by Alessandro Paolo Daga and Luigi Garibaldi

Algorithms 2020, 13(2), 33; https://doi.org/10.3390/a13020033 - 29 Jan 2020

Cited by 18 | Viewed by 4648

Abstract

The estimation of the Instantaneous Angular Speed (IAS) has in recent years attracted a growing interest in the diagnostics of rotating machines. Measurement of the IAS can be used as a source of information of the machine condition per se, or for performing [...] Read more.

The estimation of the Instantaneous Angular Speed (IAS) has in recent years attracted a growing interest in the diagnostics of rotating machines. Measurement of the IAS can be used as a source of information of the machine condition per se, or for performing angular resampling through Computed Order Tracking, a practice which is essential to highlight the machine spectral signature in case of non-stationary operational conditions. In these regards, the SURVISHNO 2019 international conference held at INSA Lyon on 8–10 July 2019 proposed a challenge about the estimation of the instantaneous non-stationary speed of a fan from a video taken by a smartphone, a pocket, low-cost device which can nowadays be found in everyone’s pocket. This work originated by the author to produce an offline motion-tracking of the fan (actually, of the head of its locking-screw) and obtaining then a reliable estimate of the IAS. The here proposed algorithm is an update of the established Template Matching (TM) technique (i.e., in the Signal Processing community, a two-dimensional matched filter), which is here integrated into a Genetic Algorithm (GA) search. Using a template reconstructed from a simplified parametric mathematical model of the features of interest (i.e., the known geometry of the edges of the screw head), the GA can be used to adapt the template to match the search image, leading to a hybridization of template-based and feature-based approaches which allows to overcome the well-known issues of the traditional TM related to scaling and rotations of the search image with respect to the template. Furthermore, it is able to resolve the position of the center of the screw head at a resolution that goes beyond the limit of the pixel grid. By repeating the analysis frame after frame and focusing on the angular position of the screw head over time, the proposed algorithm can be used as an effective offline video-tachometer able to estimate the IAS from the video, avoiding the need for expensive high-resolution encoders or tachometers. Full article

(This article belongs to the Special Issue Algorithms for Fault Detection and Diagnosis)

► Show Figures

Figure 1

17 pages, 343 KiB

Open AccessArticle

Latency-Bounded Target Set Selection in Signed Networks

by Miriam Di Ianni and Giovanna Varricchio

Algorithms 2020, 13(2), 32; https://doi.org/10.3390/a13020032 - 29 Jan 2020

Cited by 5 | Viewed by 3865

Abstract

It is well-documented that social networks play a considerable role in information spreading. The dynamic processes governing the diffusion of information have been studied in many fields, including epidemiology, sociology, economics, and computer science. A widely studied problem in the area of viral [...] Read more.

It is well-documented that social networks play a considerable role in information spreading. The dynamic processes governing the diffusion of information have been studied in many fields, including epidemiology, sociology, economics, and computer science. A widely studied problem in the area of viral marketing is the target set selection: in order to market a new product, hoping it will be adopted by a large fraction of individuals in the network, which set of individuals should we “target” (for instance, by offering them free samples of the product)? In this paper, we introduce a diffusion model in which some of the neighbors of a node have a negative influence on that node, namely, they induce the node to reject the feature that is supposed to be spread. We study the target set selection problem within this model, first proving a strong inapproximability result holding also when the diffusion process is required to reach all the nodes in a couple of rounds. Then, we consider a set of restrictions under which the problem is approximable to some extent. Full article

(This article belongs to the Special Issue Approximation Algorithms for NP-Hard Problems)

► Show Figures

Figure 1

14 pages, 467 KiB

Open AccessFeature PaperArticle

Constrained Connectivity in Bounded X-Width Multi-Interface Networks

by Alessandro Aloisio and Alfredo Navarra

Algorithms 2020, 13(2), 31; https://doi.org/10.3390/a13020031 - 26 Jan 2020

Cited by 14 | Viewed by 3936

Abstract

As technology advances and the spreading of wireless devices grows, the establishment of interconnection networks is becoming crucial. Main activities that involve most of the people concern retrieving and sharing information from everywhere. In heterogeneous networks, devices can communicate by means of multiple [...] Read more.

As technology advances and the spreading of wireless devices grows, the establishment of interconnection networks is becoming crucial. Main activities that involve most of the people concern retrieving and sharing information from everywhere. In heterogeneous networks, devices can communicate by means of multiple interfaces. The choice of the most suitable interfaces to activate (switch-on) at each device results in the establishment of different connections. A connection is established when at its endpoints the devices activate at least one common interface. Each interface is assumed to consume a specific percentage of energy for its activation. This is referred to as the cost of an interface. Due to energy consumption issues, and the fact that most of the devices are battery powered, special effort must be devoted to suitable solutions that prolong the network lifetime. In this paper, we consider the so-called p-Coverage problem where each device can activate at most p of its available interfaces in order to establish all the desired connections of a given network of devices. As the problem has been shown to be

NP

-hard even for

p = 2

and unitary costs of the interfaces, algorithmic design activities have focused in particular topologies where the problem is optimally solvable. Following this trend, we first show that the problem is polynomially solvable for graphs (modeling the underlying network) of bounded treewidth by means of the Courcelle’s theorem. Then, we provide two optimal polynomial time algorithms to solve the problem in two subclasses of graphs with bounded treewidth that are graphs of bounded pathwidth and graphs of bounded carvingwidth. The two solutions are obtained by means of dynamic programming techniques. Full article

(This article belongs to the Special Issue Approximation Algorithms for NP-Hard Problems)

► Show Figures

Figure 1

16 pages, 7286 KiB

Open AccessArticle

Learning Manifolds from Dynamic Process Data

by Frank Schoeneman, Varun Chandola, Nils Napp, Olga Wodo and Jaroslaw Zola

Algorithms 2020, 13(2), 30; https://doi.org/10.3390/a13020030 - 21 Jan 2020

Cited by 3 | Viewed by 4270

Abstract

Scientific data, generated by computational models or from experiments, are typically results of nonlinear interactions among several latent processes. Such datasets are typically high-dimensional and exhibit strong temporal correlations. Better understanding of the underlying processes requires mapping such data to a low-dimensional manifold [...] Read more.

Scientific data, generated by computational models or from experiments, are typically results of nonlinear interactions among several latent processes. Such datasets are typically high-dimensional and exhibit strong temporal correlations. Better understanding of the underlying processes requires mapping such data to a low-dimensional manifold where the dynamics of the latent processes are evident. While nonlinear spectral dimensionality reduction methods, e.g., Isomap, and their scalable variants, are conceptually fit candidates for obtaining such a mapping, the presence of the strong temporal correlation in the data can significantly impact these methods. In this paper, we first show why such methods fail when dealing with dynamic process data. A novel method, Entropy-Isomap, is proposed to handle this shortcoming. We demonstrate the effectiveness of the proposed method in the context of understanding the fabrication process of organic materials. The resulting low-dimensional representation correctly characterizes the process control variables and allows for informative visualization of the material morphology evolution. Full article

(This article belongs to the Special Issue Algorithms for Manifold Learning and Its Applications)

► Show Figures

Figure 1

Journal Menu

Journal Browser

Algorithms, Volume 13, Issue 2 (February 2020) – 20 articles

Further Information

Guidelines

MDPI Initiatives

Follow MDPI