for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> COMPUTER SCIENCE (Total: 2102 journals)
    - ANIMATION AND SIMULATION (31 journals)
    - ARTIFICIAL INTELLIGENCE (103 journals)
    - AUTOMATION AND ROBOTICS (105 journals)
    - CLOUD COMPUTING AND NETWORKS (64 journals)
    - COMPUTER ARCHITECTURE (10 journals)
    - COMPUTER ENGINEERING (11 journals)
    - COMPUTER GAMES (21 journals)
    - COMPUTER PROGRAMMING (26 journals)
    - COMPUTER SCIENCE (1221 journals)
    - COMPUTER SECURITY (47 journals)
    - DATA BASE MANAGEMENT (14 journals)
    - DATA MINING (36 journals)
    - E-BUSINESS (22 journals)
    - E-LEARNING (30 journals)
    - ELECTRONIC DATA PROCESSING (22 journals)
    - IMAGE AND VIDEO PROCESSING (40 journals)
    - INFORMATION SYSTEMS (108 journals)
    - INTERNET (95 journals)
    - SOCIAL WEB (53 journals)
    - SOFTWARE (34 journals)
    - THEORY OF COMPUTING (9 journals)

COMPUTER SCIENCE (1221 journals)                  1 2 3 4 5 6 7 | Last

Showing 1 - 200 of 872 Journals sorted alphabetically
3D Printing and Additive Manufacturing     Full-text available via subscription   (Followers: 21)
Abakós     Open Access   (Followers: 4)
ACM Computing Surveys     Hybrid Journal   (Followers: 29)
ACM Journal on Computing and Cultural Heritage     Hybrid Journal   (Followers: 8)
ACM Journal on Emerging Technologies in Computing Systems     Hybrid Journal   (Followers: 16)
ACM Transactions on Accessible Computing (TACCESS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 15)
ACM Transactions on Applied Perception (TAP)     Hybrid Journal   (Followers: 5)
ACM Transactions on Architecture and Code Optimization (TACO)     Hybrid Journal   (Followers: 9)
ACM Transactions on Autonomous and Adaptive Systems (TAAS)     Hybrid Journal   (Followers: 9)
ACM Transactions on Computation Theory (TOCT)     Hybrid Journal   (Followers: 12)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 3)
ACM Transactions on Computer Systems (TOCS)     Hybrid Journal   (Followers: 18)
ACM Transactions on Computer-Human Interaction     Hybrid Journal   (Followers: 15)
ACM Transactions on Computing Education (TOCE)     Hybrid Journal   (Followers: 6)
ACM Transactions on Design Automation of Electronic Systems (TODAES)     Hybrid Journal   (Followers: 6)
ACM Transactions on Economics and Computation     Hybrid Journal   (Followers: 1)
ACM Transactions on Embedded Computing Systems (TECS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Information Systems (TOIS)     Hybrid Journal   (Followers: 20)
ACM Transactions on Intelligent Systems and Technology (TIST)     Hybrid Journal   (Followers: 8)
ACM Transactions on Interactive Intelligent Systems (TiiS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)     Hybrid Journal   (Followers: 9)
ACM Transactions on Reconfigurable Technology and Systems (TRETS)     Hybrid Journal   (Followers: 6)
ACM Transactions on Sensor Networks (TOSN)     Hybrid Journal   (Followers: 8)
ACM Transactions on Speech and Language Processing (TSLP)     Hybrid Journal   (Followers: 9)
ACM Transactions on Storage     Hybrid Journal  
ACS Applied Materials & Interfaces     Hybrid Journal   (Followers: 32)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 2)
Acta Informatica Malaysia     Open Access  
Acta Universitatis Cibiniensis. Technical Series     Open Access  
Ad Hoc Networks     Hybrid Journal   (Followers: 11)
Adaptive Behavior     Hybrid Journal   (Followers: 10)
Advanced Engineering Materials     Hybrid Journal   (Followers: 28)
Advanced Science Letters     Full-text available via subscription   (Followers: 11)
Advances in Adaptive Data Analysis     Hybrid Journal   (Followers: 7)
Advances in Artificial Intelligence     Open Access   (Followers: 15)
Advances in Calculus of Variations     Hybrid Journal   (Followers: 4)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 19)
Advances in Computer Engineering     Open Access   (Followers: 4)
Advances in Computer Science : an International Journal     Open Access   (Followers: 14)
Advances in Computing     Open Access   (Followers: 2)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 56)
Advances in Engineering Software     Hybrid Journal   (Followers: 28)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 14)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 22)
Advances in Human-Computer Interaction     Open Access   (Followers: 20)
Advances in Materials Science     Open Access   (Followers: 14)
Advances in Operations Research     Open Access   (Followers: 12)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 7)
Advances in Porous Media     Full-text available via subscription   (Followers: 5)
Advances in Remote Sensing     Open Access   (Followers: 49)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Advances in Technology Innovation     Open Access   (Followers: 6)
AEU - International Journal of Electronics and Communications     Hybrid Journal   (Followers: 8)
African Journal of Information and Communication     Open Access   (Followers: 9)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 4)
AI EDAM     Hybrid Journal   (Followers: 1)
Air, Soil & Water Research     Open Access   (Followers: 12)
AIS Transactions on Human-Computer Interaction     Open Access   (Followers: 6)
Algebras and Representation Theory     Hybrid Journal   (Followers: 1)
Algorithms     Open Access   (Followers: 11)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 5)
American Journal of Computational Mathematics     Open Access   (Followers: 4)
American Journal of Information Systems     Open Access   (Followers: 6)
American Journal of Sensor Technology     Open Access   (Followers: 4)
Anais da Academia Brasileira de Ciências     Open Access   (Followers: 2)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 7)
Analysis in Theory and Applications     Hybrid Journal   (Followers: 1)
Animation Practice, Process & Production     Hybrid Journal   (Followers: 5)
Annals of Combinatorics     Hybrid Journal   (Followers: 4)
Annals of Data Science     Hybrid Journal   (Followers: 12)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 13)
Annals of Pure and Applied Logic     Open Access   (Followers: 3)
Annals of Software Engineering     Hybrid Journal   (Followers: 13)
Annals of West University of Timisoara - Mathematics and Computer Science     Open Access  
Annual Reviews in Control     Hybrid Journal   (Followers: 8)
Anuario Americanista Europeo     Open Access  
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2)
Applied and Computational Harmonic Analysis     Full-text available via subscription   (Followers: 1)
Applied Artificial Intelligence: An International Journal     Hybrid Journal   (Followers: 12)
Applied Categorical Structures     Hybrid Journal   (Followers: 3)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 13)
Applied Computer Systems     Open Access   (Followers: 2)
Applied Informatics     Open Access  
Applied Mathematics and Computation     Hybrid Journal   (Followers: 34)
Applied Medical Informatics     Open Access   (Followers: 10)
Applied Numerical Mathematics     Hybrid Journal   (Followers: 5)
Applied Soft Computing     Hybrid Journal   (Followers: 16)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 5)
Applied System Innovation     Open Access  
Architectural Theory Review     Hybrid Journal   (Followers: 3)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 5)
Archive of Numerical Software     Open Access  
Archives and Museum Informatics     Hybrid Journal   (Followers: 144)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 5)
arq: Architectural Research Quarterly     Hybrid Journal   (Followers: 8)
Artifact     Hybrid Journal   (Followers: 2)
Artificial Life     Hybrid Journal   (Followers: 7)
Asia Pacific Journal on Computational Engineering     Open Access  
Asia-Pacific Journal of Information Technology and Multimedia     Open Access   (Followers: 1)
Asian Journal of Computer Science and Information Technology     Open Access  
Asian Journal of Control     Hybrid Journal  
Assembly Automation     Hybrid Journal   (Followers: 2)
at - Automatisierungstechnik     Hybrid Journal   (Followers: 1)
Australian Educational Computing     Open Access   (Followers: 1)
Automatic Control and Computer Sciences     Hybrid Journal   (Followers: 5)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Automatica     Hybrid Journal   (Followers: 13)
Automation in Construction     Hybrid Journal   (Followers: 7)
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 8)
Basin Research     Hybrid Journal   (Followers: 5)
Behaviour & Information Technology     Hybrid Journal   (Followers: 53)
Big Data and Cognitive Computing     Open Access   (Followers: 2)
Biodiversity Information Science and Standards     Open Access  
Bioinformatics     Hybrid Journal   (Followers: 309)
Biomedical Engineering     Hybrid Journal   (Followers: 16)
Biomedical Engineering and Computational Biology     Open Access   (Followers: 13)
Biomedical Engineering, IEEE Reviews in     Full-text available via subscription   (Followers: 20)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 35)
Briefings in Bioinformatics     Hybrid Journal   (Followers: 50)
British Journal of Educational Technology     Hybrid Journal   (Followers: 149)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 12)
c't Magazin fuer Computertechnik     Full-text available via subscription   (Followers: 1)
CALCOLO     Hybrid Journal  
Calphad     Hybrid Journal   (Followers: 2)
Canadian Journal of Electrical and Computer Engineering     Full-text available via subscription   (Followers: 15)
Capturing Intelligence     Full-text available via subscription  
Catalysis in Industry     Hybrid Journal   (Followers: 1)
CEAS Space Journal     Hybrid Journal   (Followers: 2)
Cell Communication and Signaling     Open Access   (Followers: 2)
Central European Journal of Computer Science     Hybrid Journal   (Followers: 5)
CERN IdeaSquare Journal of Experimental Innovation     Open Access   (Followers: 3)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
Chemometrics and Intelligent Laboratory Systems     Hybrid Journal   (Followers: 15)
ChemSusChem     Hybrid Journal   (Followers: 7)
China Communications     Full-text available via subscription   (Followers: 8)
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
CIN Computers Informatics Nursing     Hybrid Journal   (Followers: 11)
Circuits and Systems     Open Access   (Followers: 15)
Clean Air Journal     Full-text available via subscription   (Followers: 1)
CLEI Electronic Journal     Open Access  
Clin-Alert     Hybrid Journal   (Followers: 1)
Clinical eHealth     Open Access  
Cluster Computing     Hybrid Journal   (Followers: 2)
Cognitive Computation     Hybrid Journal   (Followers: 4)
COMBINATORICA     Hybrid Journal  
Combinatorics, Probability and Computing     Hybrid Journal   (Followers: 4)
Combustion Theory and Modelling     Hybrid Journal   (Followers: 14)
Communication Methods and Measures     Hybrid Journal   (Followers: 12)
Communication Theory     Hybrid Journal   (Followers: 23)
Communications Engineer     Hybrid Journal   (Followers: 1)
Communications in Algebra     Hybrid Journal   (Followers: 3)
Communications in Computational Physics     Full-text available via subscription   (Followers: 2)
Communications in Information Science and Management Engineering     Open Access   (Followers: 4)
Communications in Partial Differential Equations     Hybrid Journal   (Followers: 3)
Communications of the ACM     Full-text available via subscription   (Followers: 51)
Communications of the Association for Information Systems     Open Access   (Followers: 16)
COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering     Hybrid Journal   (Followers: 3)
Complex & Intelligent Systems     Open Access   (Followers: 1)
Complex Adaptive Systems Modeling     Open Access  
Complex Analysis and Operator Theory     Hybrid Journal   (Followers: 2)
Complexity     Hybrid Journal   (Followers: 6)
Complexus     Full-text available via subscription  
Composite Materials Series     Full-text available via subscription   (Followers: 8)
Computación y Sistemas     Open Access  
Computation     Open Access   (Followers: 1)
Computational and Applied Mathematics     Hybrid Journal   (Followers: 3)
Computational and Mathematical Biophysics     Open Access   (Followers: 1)
Computational and Mathematical Methods in Medicine     Open Access   (Followers: 2)
Computational and Mathematical Organization Theory     Hybrid Journal   (Followers: 2)
Computational and Structural Biotechnology Journal     Open Access   (Followers: 2)
Computational and Theoretical Chemistry     Hybrid Journal   (Followers: 9)
Computational Astrophysics and Cosmology     Open Access   (Followers: 1)
Computational Biology and Chemistry     Hybrid Journal   (Followers: 12)
Computational Chemistry     Open Access   (Followers: 2)
Computational Cognitive Science     Open Access   (Followers: 2)
Computational Complexity     Hybrid Journal   (Followers: 4)
Computational Condensed Matter     Open Access  
Computational Ecology and Software     Open Access   (Followers: 9)
Computational Economics     Hybrid Journal   (Followers: 9)
Computational Geosciences     Hybrid Journal   (Followers: 17)
Computational Linguistics     Open Access   (Followers: 23)
Computational Management Science     Hybrid Journal  
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 5)
Computational Methods and Function Theory     Hybrid Journal  
Computational Molecular Bioscience     Open Access   (Followers: 2)
Computational Optimization and Applications     Hybrid Journal   (Followers: 8)
Computational Particle Mechanics     Hybrid Journal   (Followers: 1)
Computational Research     Open Access   (Followers: 1)
Computational Science and Discovery     Full-text available via subscription   (Followers: 2)
Computational Science and Techniques     Open Access  
Computational Statistics     Hybrid Journal   (Followers: 14)
Computational Statistics & Data Analysis     Hybrid Journal   (Followers: 30)
Computer     Full-text available via subscription   (Followers: 99)
Computer Aided Surgery     Open Access   (Followers: 6)
Computer Applications in Engineering Education     Hybrid Journal   (Followers: 8)
Computer Communications     Hybrid Journal   (Followers: 16)
Computer Journal     Hybrid Journal   (Followers: 9)

        1 2 3 4 5 6 7 | Last

Journal Cover
Algorithms
Journal Prestige (SJR): 0.217
Citation Impact (citeScore): 1
Number of Followers: 11  

  This is an Open Access Journal Open Access journal
ISSN (Print) 1999-4893
Published by MDPI Homepage  [205 journals]
  • Algorithms, Vol. 11, Pages 129: The Fast Detection and Identification
           Algorithm of Optical Fiber Intrusion Signals

    • Authors: Zhiyong Sheng, Dandan Qu, Yuan Zhang, Dan Yang
      First page: 129
      Abstract: With the continuous development of optical fiber sensing technology, the Optical Fiber Pre-Warning System (OFPS) has been widely used in various fields. The OFPS identifies the type of intrusion based on the detected vibration signal to monitor the surrounding environment. Aiming at the real-time requirements of OFPS, this paper presents a fast algorithm to accelerate the detection and recognition processing of optical fiber intrusion signals. The algorithm is implemented in an embedded system that is composed of a digital signal processor (DSP). The processing flow is divided into two parts. First, the dislocation processing method is adopted for the sum processing of original signals, which effectively improves the real-time performance. The filtered signals are divided into two parts and are parallel processed by two DSP boards to save time. Then, the data is input into the identification module for feature extraction and classification. Experiments show that the algorithm can effectively detect and identify the optical fiber intrusion signals. At the same time, it accelerates the processing speed and meets the real-time requirements of OFPS for detection and identification.
      Citation: Algorithms
      PubDate: 2018-08-23
      DOI: 10.3390/a11090129
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 130: Numerical Modeling of Wave Disturbances in
           the Process of Ship Movement Control

    • Authors: Piotr Borkowski
      First page: 130
      Abstract: The article presents a numerical model of sea wave generation as an implementation of the stochastic process with a spectrum of wave angular velocity. Based on the wave spectrum, a forming filter is determined, and its input is fed with white noise. The resulting signal added to the angular speed of a ship represents disturbances acting on the ship’s hull as a result of wave impact. The model was used for simulation tests of the influence of disturbances on the course stabilization system of the ship.
      Citation: Algorithms
      PubDate: 2018-08-31
      DOI: 10.3390/a11090130
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 131: An efficient algorithm to determine
           probabilistic bisimulation

    • Authors: J.F. Groote, H.J. Rivera Verduzco, E.P. de Vink
      First page: 131
      Abstract: We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition systems, featuring non-deterministic choice as well as discrete probabilistic choice. The algorithm is linear in the number of transitions and logarithmic in the number of states, distinguishing both action states and probabilistic states, and the transitions between them. The algorithm improves upon the proposed complexity bounds of the best algorithm addressing the same purpose so far by Baier, Engelen and Majster-Cederbaum (Journal of Computer and System Sciences 60:187–231, 2000). In addition, experimentally, on various benchmarks, our algorithm performs rather well; even on relatively small transition systems, a performance gain of a factor 10,000 can be achieved.
      Citation: Algorithms
      PubDate: 2018-09-03
      DOI: 10.3390/a11090131
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 132: Study of Precipitation Forecast Based on
           Deep Belief Networks

    • Authors: Jinglin Du, Yayun Liu, Zhijun Liu
      First page: 132
      Abstract: Due to the impact of weather forecasting on global human life, and to better reflect the current trend of weather changes, it is necessary to conduct research about the prediction of precipitation and provide timely and complete precipitation information for climate prediction and early warning decisions to avoid serious meteorological disasters. For the precipitation prediction problem in the era of climate big data, we propose a new method based on deep learning. In this paper, we will apply deep belief networks in weather precipitation forecasting. Deep belief networks transform the feature representation of data in the original space into a new feature space, with semantic features to improve the predictive performance. The experimental results show, compared with other forecasting methods, the feasibility of deep belief networks in the field of weather forecasting.
      Citation: Algorithms
      PubDate: 2018-09-04
      DOI: 10.3390/a11090132
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 133: A Modified Sufficient Descent
           Polak–Ribiére–Polyak Type Conjugate Gradient Method for Unconstrained
           Optimization Problems

    • Authors: Xiuyun Zheng, Jiarong Shi
      First page: 133
      Abstract: In this paper, a modification to the Polak–Ribiére–Polyak (PRP) nonlinear conjugate gradient method is presented. The proposed method always generates a sufficient descent direction independent of the accuracy of the line search and the convexity of the objective function. Under appropriate conditions, the modified method is proved to possess global convergence under the Wolfe or Armijo-type line search. Moreover, the proposed methodology is adopted in the Hestenes–Stiefel (HS) and Liu–Storey (LS) methods. Extensive preliminary numerical experiments are used to illustrate the efficiency of the proposed method.
      Citation: Algorithms
      PubDate: 2018-09-06
      DOI: 10.3390/a11090133
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 134: Multi-Level Elasticity for Wide-Area Data
           Streaming Systems: A Reinforcement Learning Approach

    • Authors: Gabriele Russo Russo, Matteo Nardelli, Valeria Cardellini, Francesco Lo Presti
      First page: 134
      Abstract: The capability of efficiently processing the data streams emitted by nowadays ubiquitous sensing devices enables the development of new intelligent services. Data Stream Processing (DSP) applications allow for processing huge volumes of data in near real-time. To keep up with the high volume and velocity of data, these applications can elastically scale their execution on multiple computing resources to process the incoming data flow in parallel. Being that data sources and consumers are usually located at the network edges, nowadays the presence of geo-distributed computing resources represents an attractive environment for DSP. However, controlling the applications and the processing infrastructure in such wide-area environments represents a significant challenge. In this paper, we present a hierarchical solution for the autonomous control of elastic DSP applications and infrastructures. It consists of a two-layered hierarchical solution, where centralized components coordinate subordinated distributed managers, which, in turn, locally control the elastic adaptation of the application components and deployment regions. Exploiting this framework, we design several self-adaptation policies, including reinforcement learning based solutions. We show the benefits of the presented self-adaptation policies with respect to static provisioning solutions, and discuss the strengths of reinforcement learning based approaches, which learn from experience how to optimize the application performance and resource allocation.
      Citation: Algorithms
      PubDate: 2018-09-07
      DOI: 10.3390/a11090134
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 135: Multiple Attribute Decision-Making Method
           Using Linguistic Cubic Hesitant Variables

    • Authors: Jun Ye, Wenhua Cui
      First page: 135
      Abstract: Linguistic decision making (DM) is an important research topic in DM theory and methods since using linguistic terms for the assessment of the objective world is very fitting for human thinking and expressing habits. However, there is both uncertainty and hesitancy in linguistic arguments in human thinking and judgments of an evaluated object. Nonetheless, the hybrid information regarding both uncertain linguistic arguments and hesitant linguistic arguments cannot be expressed through the various existing linguistic concepts. To reasonably express it, this study presents a linguistic cubic hesitant variable (LCHV) based on the concepts of a linguistic cubic variable and a hesitant fuzzy set, its operational relations, and its linguistic score function for ranking LCHVs. Then, the objective extension method based on the least common multiple number/cardinality for LCHVs and the weighted aggregation operators of LCHVs are proposed to reasonably aggregate LCHV information because existing aggregation operators cannot aggregate LCHVs in which the number of their hesitant components may imply difference. Next, a multi-attribute decision-making (MADM) approach is proposed based on the weighted arithmetic averaging (WAA) and weighted geometric averaging (WGA) operators of LCHVs. Lastly, an illustrative example is provided to indicate the applicability of the proposed approaches.
      Citation: Algorithms
      PubDate: 2018-09-07
      DOI: 10.3390/a11090135
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 136: Mixed Order Fractional Observers for
           Minimal Realizations of Linear Time-Invariant Systems

    • Authors: Manuel A. Duarte-Mermoud, Javier A. Gallegos, Norelys Aguila-Camacho, Rafael Castro-Linares
      First page: 136
      Abstract: Adaptive and non-adaptive minimal realization (MR) fractional order observers (FOO) for linear time-invariant systems (LTIS) of a possibly different derivation order (mixed order observers, MOO) are studied in this paper. Conditions on the convergence and robustness are provided using a general framework which allows observing systems defined with any type of fractional order derivative (FOD). A qualitative discussion is presented to show that the derivation orders of the observer structure and for the parameter adjustment are relevant degrees of freedom for performance optimization. A control problem is developed to illustrate the application of the proposed observers.
      Citation: Algorithms
      PubDate: 2018-09-09
      DOI: 10.3390/a11090136
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 137: Learning Heterogeneous Knowledge Base
           Embeddings for Explainable Recommendation

    • Authors: Qingyao Ai, Vahid Azizi, Xu Chen, Yongfeng Zhang
      First page: 137
      Abstract: Providing model-generated explanations in recommender systems is important to user experience. State-of-the-art recommendation algorithms—especially the collaborative filtering (CF)- based approaches with shallow or deep models—usually work with various unstructured information sources for recommendation, such as textual reviews, visual images, and various implicit or explicit feedbacks. Though structured knowledge bases were considered in content-based approaches, they have been largely ignored recently due to the availability of vast amounts of data and the learning power of many complex models. However, structured knowledge bases exhibit unique advantages in personalized recommendation systems. When the explicit knowledge about users and items is considered for recommendation, the system could provide highly customized recommendations based on users’ historical behaviors and the knowledge is helpful for providing informed explanations regarding the recommended items. A great challenge for using knowledge bases for recommendation is how to integrate large-scale structured and unstructured data, while taking advantage of collaborative filtering for highly accurate performance. Recent achievements in knowledge-base embedding (KBE) sheds light on this problem, which makes it possible to learn user and item representations while preserving the structure of their relationship with external knowledge for explanation. In this work, we propose to explain knowledge-base embeddings for explainable recommendation. Specifically, we propose a knowledge-base representation learning framework to embed heterogeneous entities for recommendation, and based on the embedded knowledge base, a soft matching algorithm is proposed to generate personalized explanations for the recommended items. Experimental results on real-world e-commerce datasets verified the superior recommendation performance and the explainability power of our approach compared with state-of-the-art baselines.
      Citation: Algorithms
      PubDate: 2018-09-13
      DOI: 10.3390/a11090137
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 138: Are Markets Truly Efficient'
           

    • Authors: Sanjiv Das, Karthik Mokashi, Robbie Culkin
      First page: 138
      Abstract: We examine the use of deep learning (neural networks) to predict the movement of the S&P 500 Index using past returns of all the stocks in the index. Our analysis finds that the future direction of the S&P 500 index can be weakly predicted by the prior movements of the underlying stocks in the index, but not strongly enough to reject market efficiency. Decomposition of the prediction error indicates that most of the lack of predictability comes from randomness and only a little from nonstationarity. We believe this is the first test of S&P 500 market efficiency that uses a very large information set, and it extends the domain of weak-form market efficiency tests.
      Citation: Algorithms
      PubDate: 2018-09-13
      DOI: 10.3390/a11090138
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 139: An Auto-Adjustable Semi-Supervised
           Self-Training Algorithm

    • Authors: Ioannis E. Livieris, Andreas Kanavos, Vassilis Tampakas, Panagiotis Pintelas
      First page: 139
      Abstract: Semi-supervised learning algorithms have become a topic of significant research as an alternative to traditional classification methods which exhibit remarkable performance over labeled data but lack the ability to be applied on large amounts of unlabeled data. In this work, we propose a new semi-supervised learning algorithm that dynamically selects the most promising learner for a classification problem from a pool of classifiers based on a self-training philosophy. Our experimental results illustrate that the proposed algorithm outperforms its component semi-supervised learning algorithms in terms of accuracy, leading to more efficient, stable and robust predictive models.
      Citation: Algorithms
      PubDate: 2018-09-14
      DOI: 10.3390/a11090139
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 140: Complexity of Hamiltonian Cycle
           Reconfiguration

    • Authors: Asahi Takaoka
      First page: 140
      Abstract: The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained from C i − 1 by a switch for each i with 1 ≤ i ≤ t , where a switch is the replacement of a pair of edges u v and w z on a Hamiltonian cycle with the edges u w and v z of G, given that u w and v z did not appear on the cycle. We show that the Hamiltonian cycle reconfiguration problem is PSPACE-complete, settling an open question posed by Ito et al. (2011) and van den Heuvel (2013). More precisely, we show that the Hamiltonian cycle reconfiguration problem is PSPACE-complete for chordal bipartite graphs, strongly chordal split graphs, and bipartite graphs with maximum degree 6. Bipartite permutation graphs form a proper subclass of chordal bipartite graphs, and unit interval graphs form a proper subclass of strongly chordal graphs. On the positive side, we show that, for any two Hamiltonian cycles of a bipartite permutation graph and a unit interval graph, there is a sequence of switches transforming one cycle to the other, and such a sequence can be obtained in linear time.
      Citation: Algorithms
      PubDate: 2018-09-17
      DOI: 10.3390/a11090140
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 141: Generalized Paxos Made Byzantine (and Less
           Complex)

    • Authors: Miguel Pires, Srivatsan Ravi, Rodrigo Rodrigues
      First page: 141
      Abstract: One of the most recent members of the Paxos family of protocols is Generalized Paxos. This variant of Paxos has the characteristic that it departs from the original specification of consensus, allowing for a weaker safety condition where different processes can have a different views on a sequence being agreed upon. However, much like the original Paxos counterpart, Generalized Paxos does not have a simple implementation. Furthermore, with the recent practical adoption of Byzantine fault tolerant protocols in the context of blockchain protocols, it is timely and important to understand how Generalized Paxos can be implemented in the Byzantine model. In this paper, we make two main contributions. First, we attempt to provide a simpler description of Generalized Paxos, based on a simpler specification and the pseudocode for a solution that can be readily implemented. Second, we extend the protocol to the Byzantine fault model, and provide the respective correctness proof.
      Citation: Algorithms
      PubDate: 2018-09-17
      DOI: 10.3390/a11090141
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 142: Estimating the Volume of the Solution
           Space of SMT(LIA) Constraints by a Flat Histogram Method

    • Authors: Wei Gao, Hengyi Lv, Qiang Zhang, Dunbo Cai
      First page: 142
      Abstract: The satisfiability modulo theories (SMT) problem is to decide the satisfiability of a logical formula with respect to a given background theory. This work studies the counting version of SMT with respect to linear integer arithmetic (LIA), termed SMT(LIA). Specifically, the purpose of this paper is to count the number of solutions (volume) of a SMT(LIA) formula, which has many important applications and is computationally hard. To solve the counting problem, an approximate method that employs a recent Markov Chain Monte Carlo (MCMC) sampling strategy called “flat histogram” is proposed. Furthermore, two refinement strategies are proposed for the sampling process and result in two algorithms, MCMC-Flat1/2 and MCMC-Flat1/t, respectively. In MCMC-Flat1/t, a pseudo sampling strategy is introduced to evaluate the flatness of histograms. Experimental results show that our MCMC-Flat1/t method can achieve good accuracy on both structured and random instances, and our MCMC-Flat1/2 is scalable for instances of convex bodies with up to 7 variables.
      Citation: Algorithms
      PubDate: 2018-09-18
      DOI: 10.3390/a11090142
      Issue No: Vol. 11, No. 9 (2018)
       
  • Algorithms, Vol. 11, Pages 109: Long Length Document Classification by
           Local Convolutional Feature Aggregation

    • Authors: Liu Liu, Kaile Liu, Zhenghai Cong, Jiali Zhao, Yefei Ji, Jun He
      First page: 109
      Abstract: The exponential increase in online reviews and recommendations makes document classification and sentiment analysis a hot topic in academic and industrial research. Traditional deep learning based document classification methods require the use of full textual information to extract features. In this paper, in order to tackle long document, we proposed three methods that use local convolutional feature aggregation to implement document classification. The first proposed method randomly draws blocks of continuous words in the full document. Each block is then fed into the convolution neural network to extract features and then are concatenated together to output the classification probability through a classifier. The second model improves the first by capturing the contextual order information of the sampled blocks with a recurrent neural network. The third model is inspired by the recurrent attention model (RAM), in which a reinforcement learning module is introduced to act as a controller for selecting the next block position based on the recurrent state. Experiments on our collected four-class arXiv paper dataset show that the three proposed models all perform well, and the RAM model achieves the best test accuracy with the least information.
      Citation: Algorithms
      PubDate: 2018-07-24
      DOI: 10.3390/a11080109
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 110: Image De-Quantization Using Plate Bending
           Model

    • Authors: David Völgyes, Anne Catrine Trægde Martinsen, Arne Stray-Pedersen, Dag Waaler, Marius Pedersen
      First page: 110
      Abstract: Discretized image signals might have a lower dynamic range than the display. Because of this, false contours might appear when the image has the same pixel value for a larger region and the distance between pixel levels reaches the noticeable difference threshold. There have been several methods aimed at approximating the high bit depth of the original signal. Our method models a region with a bended plate model, which leads to the biharmonic equation. This method addresses several new aspects: the reconstruction of non-continuous regions when foreground objects split the area into separate regions; the incorporation of confidence about pixel levels, making the model tunable; and the method gives a physics-inspired way to handle local maximal/minimal regions. The solution of the biharmonic equation yields a smooth high-order signal approximation and handles the local maxima/minima problems.
      Citation: Algorithms
      PubDate: 2018-07-24
      DOI: 10.3390/a11080110
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 111: A Weighted Histogram-Based Tone Mapping
           Algorithm for CT Images

    • Authors: David Völgyes, Anne Catrine Trægde Martinsen, Arne Stray-Pedersen, Dag Waaler, Marius Pedersen
      First page: 111
      Abstract: Computed Tomography (CT) images have a high dynamic range, which makes visualization challenging. Histogram equalization methods either use spatially invariant weights or limited kernel size due to the complexity of pairwise contribution calculation. We present a weighted histogram equalization-based tone mapping algorithm which utilizes Fast Fourier Transform for distance-dependent contribution calculation and distance-based weights. The weights follow power-law without distance-based cut-off. The resulting images have good local contrast without noticeable artefacts. The results are compared to eight popular tone mapping operators.
      Citation: Algorithms
      PubDate: 2018-07-25
      DOI: 10.3390/a11080111
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 112: A Novel Parallel Auto-Encoder Framework
           for Multi-Scale Data in Civil Structural Health Monitoring

    • Authors: Ruhua Wang, Ling Li, Jun Li
      First page: 112
      Abstract: In this paper, damage detection/identification for a seven-storey steel structure is investigated via using the vibration signals and deep learning techniques. Vibration characteristics, such as natural frequencies and mode shapes are captured and utilized as input for a deep learning network while the output vector represents the structural damage associated with locations. The deep auto-encoder with sparsity constraint is used for effective feature extraction for different types of signals and another deep auto-encoder is used to learn the relationship of different signals for final regression. The existing SAF model in a recent research study for the same problem processed all signals in one serial auto-encoder model. That kind of models have the following difficulties: (1) the natural frequencies and mode shapes are in different magnitude scales and it is not logical to normalize them in the same scale in building the models with training samples; (2) some frequencies and mode shapes may not be related to each other and it is not fair to use them for dimension reduction together. To tackle the above-mentioned problems for the multi-scale dataset in SHM, a novel parallel auto-encoder framework (Para-AF) is proposed in this paper. It processes the frequency signals and mode shapes separately for feature selection via dimension reduction and then combine these features together in relationship learning for regression. Furthermore, we introduce sparsity constraint in model reduction stage for performance improvement. Two experiments are conducted on performance evaluation and our results show the significant advantages of the proposed model in comparison with the existing approaches.
      Citation: Algorithms
      PubDate: 2018-07-27
      DOI: 10.3390/a11080112
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 113: Improved Parameter Identification Method
           for Envelope Current Signals Based on Windowed Interpolation FFT and DE
           Algorithm

    • Authors: Xiangfeng Su, Huaiqing Zhang, Lin Chen, Ling Qin, Lili Yu
      First page: 113
      Abstract: Envelope current signals are increasingly emerging in power systems, and their parameter identification is particularly necessary for accurate measurement of electrical energy. In order to analyze the envelope current signal, the harmonic parameters, as well as the envelope parameters, need to be calculated. The interpolation fast Fourier transform (FFT) is a widely used approach which can estimate the signal frequency with high precision, but it cannot calculate the envelope parameters of the signal. Therefore, this paper proposes an improved method based on windowed interpolation FFT (WIFFT) and differential evolution (DE). The amplitude and phase parameters obtained through WIFFT and the envelope parameters estimated by the envelope analysis are optimized using the DE algorithm, which makes full use of the performance advantage of DE. The simulation results show that the proposed method can improve the accuracy of the harmonic parameters and the envelope parameter significantly. In addition, it has good anti-noise ability and high precision.
      Citation: Algorithms
      PubDate: 2018-07-27
      DOI: 10.3390/a11080113
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 114: Revisiting Chameleon Sequences in the
           Protein Data Bank

    • Authors: Mihaly Mezei
      First page: 114
      Abstract: The steady growth of the Protein Data Bank (PDB) suggests the periodic repetition of searches for sequences that form different secondary structures in different protein structures; these are called chameleon sequences. This paper presents a fast (nlog(n)) algorithm for such searches and presents the results on all protein structures in the PDB. The longest such sequence found consists of 20 residues.
      Citation: Algorithms
      PubDate: 2018-07-28
      DOI: 10.3390/a11080114
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 115: Color-Based Image Retrieval Using
           Proximity Space Theory

    • Authors: Jing Wang, Lidong Wang, Xiaodong Liu, Yan Ren, Ye Yuan
      First page: 115
      Abstract: The goal of object retrieval is to rank a set of images by their similarity compared with a query image. Nowadays, content-based image retrieval is a hot research topic, and color features play an important role in this procedure. However, it is important to establish a measure of image similarity in advance. The innovation point of this paper lies in the following. Firstly, the idea of the proximity space theory is utilized to retrieve the relevant images between the query image and images of database, and we use the color histogram of an image to obtain the Top-ranked colors, which can be regard as the object set. Secondly, the similarity is calculated based on an improved dominance granule structure similarity method. Thus, we propose a color-based image retrieval method by using proximity space theory. To detect the feasibility of this method, we conducted an experiment on COIL-20 image database and Corel-1000 database. Experimental results demonstrate the effectiveness of the proposed framework and its applications.
      Citation: Algorithms
      PubDate: 2018-07-28
      DOI: 10.3390/a11080115
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 116: A Robust and Energy-Efficient Weighted
           Clustering Algorithm on Mobile Ad Hoc Sensor Networks †

    • Authors: Huamei Qi, Fengqi Liu, Tailong Xiao, Jiang Su
      First page: 116
      Abstract: In an Ad hoc sensor network, nodes have characteristics of limited battery energy, self-organization and low mobility. Due to the mobility and heterogeneity of the energy consumption in the hierarchical network, the cluster head and topology are changed dynamically. Therefore, topology control and energy consumption are growing to be critical in enhancing the stability and prolonging the lifetime of the network. In order to improve the survivability of Ad hoc network effectively, this paper proposes a new algorithm named the robust, energy-efficient weighted clustering algorithm (RE2WCA). For the homogeneous of the energy consumption; the proposed clustering algorithm takes the residual energy and group mobility into consideration by restricting minimum iteration times. In addition, a distributed fault detection algorithm and cluster head backup mechanism are presented to achieve the periodic and real-time topology maintenance to enhance the robustness of the network. The network is analyzed and the simulations are performed to compare the performance of this new clustering algorithm with the similar algorithms in terms of cluster characteristics, lifetime, throughput and energy consumption of the network. The result shows that the proposed algorithm provides better performance than others.
      Citation: Algorithms
      PubDate: 2018-08-01
      DOI: 10.3390/a11080116
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 117: Research of the Vibration Source Tracking
           in Phase-Sensitive Optical Time-Domain Reflectometry Signals Based by
           Image Processing Method

    • Authors: Yanzhu Hu, Song Wang, Xinbo Ai
      First page: 117
      Abstract: This paper aims to improve the source tracking efficiency of distributed vibration signals generated by phase-sensitive optical time-domain reflectometry (Φ-OTDR). Considering the two dimensions (time and length) of Φ-OTDR signals, the authors saved and processed these signals as images after particle filtering. The filtering method could save 0.1% of hard drive space without sacrificing the original features of the signals. Then, an integrated feature extraction method was proposed to further process the generated image. The method combines three individual extraction methods, namely, texture feature extraction, shape feature extraction and intrinsic feature extraction. Subsequently, the signal of each frame image was recognized to track the vibration source. To verify the effect of the proposed method, several experiments were carried out to compare it with popular and traditional approaches. The results show that: Hard drive space is greatly conserved by saving the distributed vibration signals as images; the proposed particle filter is a desirable way to screen the vibration signals for monitoring; the integrated feature extraction outperforms the individual extraction methods for texture features, shape features and intrinsic features; the proposed method has a better effect than other popular integrated feature extraction methods; and, the signal source tracking method has little impact on the positioning accuracy of the vibration source. The research findings provide important insights into the source tracking of Φ-OTDR signals.
      Citation: Algorithms
      PubDate: 2018-08-02
      DOI: 10.3390/a11080117
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 118: Sliding Suffix Tree

    • Authors: Andrej Brodnik, Matevž Jekovec
      First page: 118
      Abstract: We consider a sliding window W over a stream of characters from some alphabet of constant size. We want to look up a pattern in the current sliding window content and obtain all positions of the matches. We present an indexed version of the sliding window, based on a suffix tree. The data structure of size Θ( W ) has optimal time queries Θ(m+occ) and amortized constant time updates, where m is the length of the query string and occ is its number of occurrences.
      Citation: Algorithms
      PubDate: 2018-08-03
      DOI: 10.3390/a11080118
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 119: An Opportunistic Network Routing Algorithm
           Based on Cosine Similarity of Data Packets between Nodes

    • Authors: Yucheng Lin, Zhigang Chen, Jia Wu, Leilei Wang
      First page: 119
      Abstract: The mobility of nodes leads to dynamic changes in topology structure, which makes the traditional routing algorithms of a wireless network difficult to apply to the opportunistic network. In view of the problems existing in the process of information forwarding, this paper proposed a routing algorithm based on the cosine similarity of data packets between nodes (cosSim). The cosine distance, an algorithm for calculating the similarity between text data, is used to calculate the cosine similarity of data packets between nodes. The data packet set of nodes are expressed in the form of vectors, thereby facilitating the calculation of the similarity between the nodes. Through the definition of the upper and lower thresholds, the similarity between the nodes is filtered according to certain rules, and finally obtains a plurality of relatively reliable transmission paths. Simulation experiments show that compared with the traditional opportunistic network routing algorithm, such as the Spray and Wait (S&W) algorithm and Epidemic algorithm, the cosSim algorithm has a better transmission effect, which can not only improve the delivery ratio, but also reduce the network transmission delay and decline the routing overhead.
      Citation: Algorithms
      PubDate: 2018-08-06
      DOI: 10.3390/a11080119
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 120: Probabilistic Interval-Valued Hesitant
           Fuzzy Information Aggregation Operators and Their Application to
           Multi-Attribute Decision Making

    • Authors: Wenying Wu, Ying Li, Zhiwei Ni, Feifei Jin, Xuhui Zhu
      First page: 120
      Abstract: Based on the probabilistic interval-valued hesitant fuzzy information aggregation operators, this paper investigates a novel multi-attribute group decision making (MAGDM) model to address the serious loss of information in a hesitant fuzzy information environment. Firstly, the definition of probabilistic interval-valued hesitant fuzzy set will be introduced, and then, using Archimedean norm, some new probabilistic interval-valued hesitant fuzzy operations are defined. Secondly, based on these operations, the generalized probabilistic interval-valued hesitant fuzzy ordered weighted averaging (GPIVHFOWA) operator, and the generalized probabilistic interval-valued hesitant fuzzy ordered weighted geometric (GPIVHFOWG) operator are proposed, and their desirable properties are discussed. We further study their common forms and analyze the relationship among these proposed operators. Finally, a new probabilistic interval-valued hesitant fuzzy MAGDM model is constructed, and the feasibility and effectiveness of the proposed model are verified by using an example of supplier selection.
      Citation: Algorithms
      PubDate: 2018-08-06
      DOI: 10.3390/a11080120
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 121: Stacked-GRU Based Power System Transient
           Stability Assessment Method

    • Authors: Feilai Pan, Jun Li, Bendong Tan, Ciling Zeng, Xinfan Jiang, Li Liu, Jun Yang
      First page: 121
      Abstract: With the interconnection between large power grids, the issue of security and stability has become increasingly prominent. At present, data-driven power system adaptive transient stability assessment methods have achieved excellent performances by balancing speed and accuracy, but the complicated construction and parameters are difficult to obtain. This paper proposes a stacked-GRU (Gated Recurrent Unit)-based transient stability intelligent assessment method, which builds a stacked-GRU model based on time-dependent parameter sharing and spatial stacking. By using the time series data after power system failure, the offline training is performed to obtain the optimal parameters of stacked-GRU. When the application is online, it is assessed by framework of confidence. Basing on New England power system, the performance of proposed adaptive transient stability assessment method is investigated. Simulation results show that the proposed model realizes reliable and accurate assessment of transient stability and it has the advantages of short assessment time with less complex model structure to leave time for emergency control.
      Citation: Algorithms
      PubDate: 2018-08-09
      DOI: 10.3390/a11080121
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 122: Efficient Model-Based Object Pose
           Estimation Based on Multi-Template Tracking and PnP Algorithms

    • Authors: Chi-Yi Tsai, Kuang-Jui Hsu, Humaira Nisar
      First page: 122
      Abstract: Three-Dimensional (3D) object pose estimation plays a crucial role in computer vision because it is an essential function in many practical applications. In this paper, we propose a real-time model-based object pose estimation algorithm, which integrates template matching and Perspective-n-Point (PnP) pose estimation methods to deal with this issue efficiently. The proposed method firstly extracts and matches keypoints of the scene image and the object reference image. Based on the matched keypoints, a two-dimensional (2D) planar transformation between the reference image and the detected object can be formulated by a homography matrix, which can initialize a template tracking algorithm efficiently. Based on the template tracking result, the correspondence between image features and control points of the Computer-Aided Design (CAD) model of the object can be determined efficiently, thus leading to a fast 3D pose tracking result. Finally, the 3D pose of the object with respect to the camera is estimated by a PnP solver based on the tracked 2D-3D correspondences, which improves the accuracy of the pose estimation. Experimental results show that the proposed method not only achieves real-time performance in tracking multiple objects, but also provides accurate pose estimation results. These advantages make the proposed method suitable for many practical applications, such as augmented reality.
      Citation: Algorithms
      PubDate: 2018-08-12
      DOI: 10.3390/a11080122
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 123: Time Series Forecasting Using a Two-Level
           Multi-Objective Genetic Algorithm: A Case Study of Maintenance Cost Data
           for Tunnel Fans

    • Authors: Yamur K. Al-Douri, Hussan Hamodi, Jan Lundberg
      First page: 123
      Abstract: The aim of this study has been to develop a novel two-level multi-objective genetic algorithm (GA) to optimize time series forecasting data for fans used in road tunnels by the Swedish Transport Administration (Trafikverket). Level 1 is for the process of forecasting time series cost data, while level 2 evaluates the forecasting. Level 1 implements either a multi-objective GA based on the ARIMA model or a multi-objective GA based on the dynamic regression model. Level 2 utilises a multi-objective GA based on different forecasting error rates to identify a proper forecasting. Our method is compared with using the ARIMA model only. The results show the drawbacks of time series forecasting using only the ARIMA model. In addition, the results of the two-level model show the drawbacks of forecasting using a multi-objective GA based on the dynamic regression model. A multi-objective GA based on the ARIMA model produces better forecasting results. In level 2, five forecasting accuracy functions help in selecting the best forecasting. Selecting a proper methodology for forecasting is based on the averages of the forecasted data, the historical data, the actual data and the polynomial trends. The forecasted data can be used for life cycle cost (LCC) analysis.
      Citation: Algorithms
      PubDate: 2018-08-13
      DOI: 10.3390/a11080123
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 124: A Simhash-Based Integrative Features
           Extraction Algorithm for Malware Detection

    • Authors: Yihong Li, Fangzheng Liu, Zhenyu Du, Dubing Zhang
      First page: 124
      Abstract: In the malware detection process, obfuscated malicious codes cannot be efficiently and accurately detected solely in the dynamic or static feature space. Aiming at this problem, an integrative feature extraction algorithm based on simhash was proposed, which combines the static information e.g., API (Application Programming Interface) calls and dynamic information (such as file, registry and network behaviors) of malicious samples to form integrative features. The experiment extracts the integrative features of some static information and dynamic information, and then compares the classification, time and obfuscated-detection performance of the static, dynamic and integrated features, respectively, by using several common machine learning algorithms. The results show that the integrative features have better time performance than the static features, and better classification performance than the dynamic features, and almost the same obfuscated-detection performance as the dynamic features. This algorithm can provide some support for feature extraction of malware detection.
      Citation: Algorithms
      PubDate: 2018-08-14
      DOI: 10.3390/a11080124
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 125: An Effective Data Transmission Algorithm
           Based on Social Relationships in Opportunistic Mobile Social Networks

    • Authors: Yeqing Yan, Zhigang Chen, Jia Wu, Leilei Wang
      First page: 125
      Abstract: With the popularization of mobile communication equipment, human activities have an increasing impact on the structure of networks, and so the social characteristics of opportunistic networks become increasingly obvious. Opportunistic networks are increasingly used in social situations. However, existing routing algorithms are not suitable for opportunistic social networks, because traditional opportunistic network routing does not consider participation in human activities, which usually causes a high ratio of transmission delay and routing overhead. Therefore, this research proposes an effective data transmission algorithm based on social relationships (ESR), which considers the community characteristics of opportunistic mobile social networks. This work uses the idea of the faction to divide the nodes in the network into communities, reduces the number of inefficient nodes in the community, and performs another contraction of the structure. Simulation results show that the ESR algorithm, through community transmission, is not only faster and safer, but also has lower transmission delay and routing overhead compared with the spray and wait algorithm, SCR algorithm and the EMIST algorithm.
      Citation: Algorithms
      PubDate: 2018-08-14
      DOI: 10.3390/a11080125
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 126: Robust Visual Tracking via Patch
           Descriptor and Structural Local Sparse Representation

    • Authors: Zhiguo Song, Jifeng Sun, Jialin Yu, Shengqing Liu
      First page: 126
      Abstract: Appearance models play an important role in visual tracking. Effective modeling of the appearance of tracked objects is still a challenging problem because of object appearance changes caused by factors, such as partial occlusion, illumination variation and deformation, etc. In this paper, we propose a tracking method based on the patch descriptor and the structural local sparse representation. In our method, the object is firstly divided into multiple non-overlapped patches, and the patch sparse coefficients are obtained by structural local sparse representation. Secondly, each patch is further decomposed into several sub-patches. The patch descriptors are defined as the proportion of sub-patches, of which the reconstruction error is less than the given threshold. Finally, the appearance of an object is modeled by the patch descriptors and the patch sparse coefficients. Furthermore, in order to adapt to appearance changes of an object and alleviate the model drift, an outlier-aware template update scheme is introduced. Experimental results on a large benchmark dataset demonstrate the effectiveness of the proposed method.
      Citation: Algorithms
      PubDate: 2018-08-15
      DOI: 10.3390/a11080126
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 127: Application of Angle Related Cost Function
           Optimization for Dynamic Path Planning Algorithm

    • Authors: Mingbin Zeng, Xu Yang, Mengxing Wang, Bangjiang Xu
      First page: 127
      Abstract: In recent years, Intelligent Transportation Systems (ITS) have developed a lot. More and more sensors and communication technologies (e.g., cloud computing) are being integrated into cars, which opens up a new design space for vehicular-based applications. In this paper, we present the Spatial Optimized Dynamic Path Planning algorithm. Our contributions are, firstly, to enhance the effective of loading mechanism for road maps by dividing the connected sub-net, and building a spatial index; and secondly, to enhance the effect of the dynamic path planning by optimizing the search direction. We use the real road network and real-time traffic flow data of Karamay city to simulate the effect of our algorithm. Experiments show that our Spatial Optimized Dynamic Path Planning algorithm can significantly reduce the time complexity, and is better suited for use as a real-time navigation system. The algorithm can achieve superior real-time performance and obtain the optimal solution in dynamic path planning.
      Citation: Algorithms
      PubDate: 2018-08-15
      DOI: 10.3390/a11080127
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 128: DenseZDD: A Compact and Fast Index for
           Families of Sets

    • Authors: Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
      First page: 128
      Abstract: In this article, we propose a succinct data structure of zero-suppressed binary decision diagrams (ZDDs). A ZDD represents sets of combinations efficiently and we can perform various set operations on the ZDD without explicitly extracting combinations. Thanks to these features, ZDDs have been applied to web information retrieval, information integration, and data mining. However, to support rich manipulation of sets of combinations and update ZDDs in the future, ZDDs need too much space, which means that there is still room to be compressed. The paper introduces a new succinct data structure, called DenseZDD, for further compressing a ZDD when we do not need to conduct set operations on the ZDD but want to examine whether a given set is included in the family represented by the ZDD, and count the number of elements in the family. We also propose a hybrid method, which combines DenseZDDs with ordinary ZDDs. By numerical experiments, we show that the sizes of our data structures are three times smaller than those of ordinary ZDDs, and membership operations and random sampling on DenseZDDs are about ten times and three times faster than those on ordinary ZDDs for some datasets, respectively.
      Citation: Algorithms
      PubDate: 2018-08-17
      DOI: 10.3390/a11080128
      Issue No: Vol. 11, No. 8 (2018)
       
  • Algorithms, Vol. 11, Pages 89: Degradation Trend Prediction for Rotating
           Machinery Using Long-Range Dependence and Particle Filter Approach

    • Authors: Qing Li, Steven Y. Liang
      First page: 89
      Abstract: Timely maintenance and accurate fault prediction of rotating machinery are essential for ensuring system availability, minimizing downtime, and contributing to sustainable production. This paper proposes a novel approach based on long-range dependence (LRD) and particle filter (PF) for degradation trend prediction of rotating machinery, taking the rolling bearing as an example. In this work, the degradation prediction is evaluated based on two health indicators time series; i.e., equivalent vibration severity (EVI) time series and kurtosis time series. Specifically, the degradation trend prediction issues here addressed have the following two distinctive features: (i) EVI time series with weak LRD property and (ii) kurtosis time series with sharp transition points (STPs) in the forecasted region. The core idea is that the parameters distribution of the LRD model can be updated recursively by the particle filter algorithm; i.e., the parameters degradation of the LRD model are restrained, and thus the prognostic results could be generated real-time, wherein the initial LRD model is designed randomly. The prediction results demonstrate that the significant improvements in prediction accuracy are obtained with the proposed method compared to some state-of-the-art approaches such as the autoregressive–moving-average (ARMA) model and the fractional order characteristic (FOC) model, etc.
      Citation: Algorithms
      PubDate: 2018-06-26
      DOI: 10.3390/a11070089
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 90: A Novel Method for Control Performance
           Assessment with Fractional Order Signal Processing and Its Application to
           Semiconductor Manufacturing

    • Authors: Kai Liu, YangQuan Chen, Paweł D. Domański, Xi Zhang
      First page: 90
      Abstract: The significant task for control performance assessment (CPA) is to review and evaluate the performance of the control system. The control system in the semiconductor industry exhibits a complex dynamic behavior, which is hard to analyze. This paper investigates the interesting crossover properties of Hurst exponent estimations and proposes a novel method for feature extraction of the nonlinear multi-input multi-output (MIMO) systems. At first, coupled data from real industry are analyzed by multifractal detrended fluctuation analysis (MFDFA) and the resultant multifractal spectrum is obtained. Secondly, the crossover points with spline fit in the scale-law curve are located and then employed to segment the entire scale-law curve into several different scaling regions, in which a single Hurst exponent can be estimated. Thirdly, to further ascertain the origin of the multifractality of control signals, the generalized Hurst exponents of the original series are compared with shuffled data. At last, non-Gaussian statistical properties, multifractal properties and Hurst exponents of the process control variables are derived and compared with different sets of tuning parameters. The results have shown that CPA of the MIMO system can be better employed with the help of fractional order signal processing (FOSP).
      Citation: Algorithms
      PubDate: 2018-06-26
      DOI: 10.3390/a11070090
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 91: emgr—The Empirical Gramian Framework

    • Authors: Christian Himpe
      First page: 91
      Abstract: System Gramian matrices are a well-known encoding for properties of input-output systems such as controllability, observability or minimality. These so-called system Gramians were developed in linear system theory for applications such as model order reduction of control systems. Empirical Gramians are an extension to the system Gramians for parametric and nonlinear systems as well as a data-driven method of computation. The empirical Gramian framework - emgr - implements the empirical Gramians in a uniform and configurable manner, with applications such as Gramian-based (nonlinear) model reduction, decentralized control, sensitivity analysis, parameter identification and combined state and parameter reduction.
      Citation: Algorithms
      PubDate: 2018-06-26
      DOI: 10.3390/a11070091
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 92: Predictive Current Control of Boost
           Three-Level and T-Type Inverters Cascaded in Wind Power Generation Systems
           

    • Authors: Guoliang Yang, Haitao Yi, Chunhua Chai, Bingxu Huang, Yuna Zhang, Zhe Chen
      First page: 92
      Abstract: A topology structure based on boost three-level converters (BTL converters) and T-type three-level inverters for a direct-drive wind turbine in a wind power generation system is proposed. In this structure, the generator-side control can be realized by the boost-TL converter. Compared with the conventional boost converter, the boost-TL converter has a low inductor current ripple, which reduces the torque ripple of the generator, increases the converter’s capacity, and minimizes switching losses. The boost-TL converter can boost the DC output from the rectifier at low speeds. The principles of the boost-TL converter and the T-type three-level inverter are separately introduced. Based on the cascaded structure of the proposed BTL converter and three-level inverter, a model predictive current control (MPCC) method is adopted, and the optimization of the MPCC is presented. The prediction model is derived, and the simulation and experimental research are carried out. The results show that the algorithm based on the proposed cascaded structure is feasible and superior.
      Citation: Algorithms
      PubDate: 2018-06-27
      DOI: 10.3390/a11070092
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 93: Layered Graphs: Applications and Algorithms

    • Authors: Bhadrachalam Chitturi, Srijith Balachander, Sandeep Satheesh, Krithic Puthiyoppil
      First page: 93
      Abstract: The computation of distances between strings has applications in molecular biology, music theory and pattern recognition. One such measure, called short reversal distance, has applications in evolutionary distance computation. It has been shown that this problem can be reduced to the computation of a maximum independent set on the corresponding graph that is constructed from the given input strings. The constructed graphs primarily fall into a class that we call layered graphs. In a layered graph, each layer refers to a subgraph containing, at most, some k vertices. The inter-layer edges are restricted to the vertices in adjacent layers. We study the MIS, MVC, MDS, MCV and MCD problems on layered graphs where MIS computes the maximum independent set; MVC computes the minimum vertex cover; MDS computes the minimum dominating set; MCV computes the minimum connected vertex cover; and MCD computes the minimum connected dominating set. The MIS, MVC and MDS are computed in polynomial time if k=Θ(log V ). MCV and MCD are computed polynomial time if k=O((log V )α), where α<1. If k=Θ((log V )1+ϵ), for ϵ>0, then MIS, MVC and MDS are computed in quasi-polynomial time. If k=Θ(log V ), then MCV and MCD are computed in quasi-polynomial time.
      Citation: Algorithms
      PubDate: 2018-06-28
      DOI: 10.3390/a11070093
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 94: Tensor Completion Based on Triple Tubal
           Nuclear Norm

    • Authors: Dongxu Wei, Andong Wang, Xiaoqin Feng, Boyu Wang, Bo Wang
      First page: 94
      Abstract: Many tasks in computer vision suffer from missing values in tensor data, i.e., multi-way data array. The recently proposed tensor tubal nuclear norm (TNN) has shown superiority in imputing missing values in 3D visual data, like color images and videos. However, by interpreting in a circulant way, TNN only exploits tube (often carrying temporal/channel information) redundancy in a circulant way while preserving the row and column (often carrying spatial information) relationship. In this paper, a new tensor norm named the triple tubal nuclear norm (TriTNN) is proposed to simultaneously exploit tube, row and column redundancy in a circulant way by using a weighted sum of three TNNs. Thus, more spatial-temporal information can be mined. Further, a TriTNN-based tensor completion model with an ADMM solver is developed. Experiments on color images, videos and LiDAR datasets show the superiority of the proposed TriTNN against state-of-the-art nuclear norm-based tensor norms.
      Citation: Algorithms
      PubDate: 2018-06-28
      DOI: 10.3390/a11070094
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 95: Experimental Validation of a Novel
           Auto-Tuning Method for a Fractional Order PI Controller on an UR10 Robot

    • Authors: Cristina I. Muresan, Cosmin Copot, Isabela Birs, Robin De Keyser, Steve Vanlanduit, Clara M. Ionescu
      First page: 95
      Abstract: Classical fractional order controller tuning techniques usually consider the frequency domain specifications (phase margin, gain crossover frequency, iso-damping) and are based on knowledge of a process model, as well as solving a system of nonlinear equations to determine the controller parameters. In this paper, a novel auto-tuning method is used to tune a fractional order PI controller. The advantages of the proposed auto-tuning method are two-fold: There is no need for a process model, neither to solve the system of nonlinear equations. The tuning is based on defining a forbidden region in the Nyquist plane using the phase margin requirement and determining the parameters of the fractional order controller such that the loop frequency response remains out of the forbidden region. Additionally, the final controller parameters are those that minimize the difference between the slope of the loop frequency response and the slope of the forbidden region border, to ensure the iso-damping property. To validate the proposed method, a case study has been used consisting of a pick and place movement of an UR10 robot. The experimental results, considering two different robot configurations, demonstrate that the designed fractional order PI controller is indeed robust.
      Citation: Algorithms
      PubDate: 2018-06-30
      DOI: 10.3390/a11070095
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 96: Solving Multi-Document Summarization as an
           Orienteering Problem

    • Authors: Asma Al-Saleh, Mohamed El Bachir Menai
      First page: 96
      Abstract: With advances in information technology, people face the problem of dealing with tremendous amounts of information and need ways to save time and effort by summarizing the most important and relevant information. Thus, automatic text summarization has become necessary to reduce the information overload. This article proposes a novel extractive graph-based approach to solve the multi-document summarization (MDS) problem. To optimize the coverage of information in the output summary, the problem is formulated as an orienteering problem and heuristically solved by an ant colony system algorithm. The performance of the implemented system (MDS-OP) was evaluated on DUC 2004 (Task 2) and MultiLing 2015 (MMS task) benchmark corpora using several ROUGE metrics, as well as other methods. Its comparison with the performances of 26 systems shows that MDS-OP achieved the best F-measure scores on both tasks in terms of ROUGE-1 and ROUGE-L (DUC 2004), ROUGE-SU4, and three other evaluation methods (MultiLing 2015). Overall, MDS-OP ranked among the best 3 systems.
      Citation: Algorithms
      PubDate: 2018-06-30
      DOI: 10.3390/a11070096
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 97: A Regional Topic Model Using Hybrid
           Stochastic Variational Gibbs Sampling for Real-Time Video Mining

    • Authors: Lin Tang, Lin Liu, Jianhou Gan
      First page: 97
      Abstract: The events location and real-time computational performance of crowd scenes continuously challenge the field of video mining. In this paper, we address these two problems based on a regional topic model. In the process of video topic modeling, region topic model can simultaneously cluster motion words of video into motion topics, and the locations of motion into motion regions, where each motion topic associates with its region. Meanwhile, a hybrid stochastic variational Gibbs sampling algorithm is developed for inference of our region topic model, which has the ability of inferring in real time with massive video stream dataset. We evaluate our method on simulate and real datasets. The comparison with the Gibbs sampling algorithm shows the superiorities of proposed model and its online inference algorithm in terms of anomaly detection.
      Citation: Algorithms
      PubDate: 2018-07-01
      DOI: 10.3390/a11070097
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 98: Width, Depth, and Space: Tradeoffs between
           Branching and Dynamic Programming

    • Authors: Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil
      First page: 98
      Abstract: Treedepth is a well-established width measure which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted than graphs of bounded tree- or pathwidth, we are interested in the algorithmic utility of this additional structure. On the negative side, we show with a novel approach that the space consumption of any (single-pass) dynamic programming algorithm on treedepth decompositions of depth d cannot be bounded by (2−ϵ)d·logO(1)n for Vertex Cover, (3−ϵ)d·logO(1)n for 3-Coloring and (3−ϵ)d·logO(1)n for Dominating Set for any ϵ>0. This formalizes the common intuition that dynamic programming algorithms on graph decompositions necessarily consume a lot of space and complements known results of the time-complexity of problems restricted to low-treewidth classes. We then show that treedepth lends itself to the design of branching algorithms. Specifically, we design two novel algorithms for Dominating Set on graphs of treedepth d: A pure branching algorithm that runs in time dO(d2)·n and uses space O(d3logd+dlogn) and a hybrid of branching and dynamic programming that achieves a running time of O(3dlogd·n) while using O(2ddlogd+dlogn) space.
      Citation: Algorithms
      PubDate: 2018-07-01
      DOI: 10.3390/a11070098
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 99: A Low Complexity Reactive Tabu Search Based
           Constellation Constraints in Signal Detection

    • Authors: Jiao Feng, Xiaofei Zhang, Peng Li, Dongshun Hu
      First page: 99
      Abstract: For Massive multiple-input multiple output (MIMO) systems, many algorithms have been proposed for detecting spatially multiplexed signals, such as reactive tabu search (RTS), minimum mean square error (MMSE), etc. As a heuristic neighborhood search algorithm, RTS is particularly suitable for signal detection in systems with large number of antennas. In this paper, we propose a strategy to reduce the neighborhood searching space of the traditional RTS algorithms. For this, we introduce a constellation constraints (CC) structure to determine whether including a candidate vector into the RTS searching neighborhood. By setting a pre-defined threshold on the symbol constellation, the Euclidean distance between the estimated signal and its nearest constellation points are calculated, and the threshold and distance are compared to separate the reliable estimated signal from unreliable ones. With this structure, the proposed CC-RTS algorithm may ignore a significant number of unnecessary candidates in the RTS neighborhood searching space and greatly reduce the computational complexity of the traditional RTS algorithm. Simulation results show that the BER performance of the proposed CC-RTS algorithm is very close to that of the traditional RTS algorithm, and with about 50% complexity reduction with the same signal-to-noise (SNR) ratio.
      Citation: Algorithms
      PubDate: 2018-07-03
      DOI: 10.3390/a11070099
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 100: A Self-Adaptive Evolutionary Algorithm for
           the Berth Scheduling Problem: Towards Efficient Parameter Control

    • Authors: Maxim A. Dulebenets, Masoud Kavoosi, Olumide Abioye, Junayed Pasha
      First page: 100
      Abstract: Since ancient times, maritime transportation has played a very important role for the global trade and economy of many countries. The volumes of all major types of cargo, which are transported by vessels, has substantially increased in recent years. Considering a rapid growth of waterborne trade, marine container terminal operators should focus on upgrading the existing terminal infrastructure and improving operations planning. This study aims to assist marine container terminal operators with improving the seaside operations and primarily focuses on the berth scheduling problem. The problem is formulated as a mixed integer linear programming model, minimizing the total weighted vessel turnaround time and the total weighted vessel late departures. A self-adaptive Evolutionary Algorithm is proposed to solve the problem, where the crossover and mutation probabilities are encoded in the chromosomes. Numerical experiments are conducted to evaluate performance of the developed solution algorithm against the alternative Evolutionary Algorithms, which rely on the deterministic parameter control, adaptive parameter control, and parameter tuning strategies, respectively. Results indicate that all the considered solution algorithms demonstrate a relatively low variability in terms of the objective function values at termination from one replication to another and can maintain the adequate population diversity. However, application of the self-adaptive parameter control strategy substantially improves the objective function values at termination without a significant impact on the computational time.
      Citation: Algorithms
      PubDate: 2018-07-03
      DOI: 10.3390/a11070100
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 101: Robust Fuzzy Adaptive Sliding Mode
           Stabilization for Fractional-Order Chaos

    • Authors: Bachir Bourouba, Samir Ladaci
      First page: 101
      Abstract: In this paper, a new adaptive fuzzy sliding mode control (AFSMC) design strategy is proposed for the control of a special class of three-dimensional fractional order chaotic systems with uncertainties and external disturbance. The design methodology is developed in two stages: first, an adaptive sliding mode control law is proposed for the class of fractional order chaotic systems without uncertainties, and then a fuzzy logic system is used to estimate the control compensation effort to be added in the case of uncertainties on the system’s model. Based on the Lyapunov theory, the stability analysis of both control laws is provided with elimination of the chattering action in the control signal. The developed control scheme is simple to implement and the overall control scheme guarantees the global asymptotic stability in the Lyapunov sense if all the involved signals are uniformly bounded. In the present work, simulation studies on fractional-order Chen chaotic systems are carried out to show the efficiency of the proposed fractional adaptive controllers.
      Citation: Algorithms
      PubDate: 2018-07-07
      DOI: 10.3390/a11070101
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 102: Advanced Artificial Neural Networks

    • Authors: Tin-Chih Toly Chen, Cheng-Li Liu, Hong-Dar Lin
      First page: 102
      Abstract: Artificial neural networks (ANNs) have been extensively applied to a wide range of disciplines, such as system identification and control, decision making, pattern recognition, medical diagnosis, finance, data mining, visualization, and others. With advances in computing and networking technologies, more complicated forms of ANNs are expected to emerge, requiring the design of advanced learning algorithms. This Special Issue is intended to provide technical details of the construction and training of advanced ANNs.
      Citation: Algorithms
      PubDate: 2018-07-10
      DOI: 10.3390/a11070102
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 103: Solutions to the Sub-Optimality and
           Stability Issues of Recursive Pole and Zero Distribution Algorithms for
           the Approximation of Fractional Order Models

    • Authors: Jocelyn Sabatier
      First page: 103
      Abstract: This paper analyses algorithms currently found in the literature for the approximation of fractional order models and based on recursive pole and zero distributions. The analysis focuses on the sub-optimality of the approximations obtained and stability issues that may appear after approximation depending on the pole location of the initial fractional order model. Solutions are proposed to reduce this sub-optimality and to avoid stability issues.
      Citation: Algorithms
      PubDate: 2018-07-12
      DOI: 10.3390/a11070103
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 104: The Gradient and the Hessian of the
           Distance between Point and Triangle in 3D

    • Authors: Igor Gribanov, Rocky Taylor, Robert Sarracino
      First page: 104
      Abstract: Computation of the distance between point and triangle in 3D is a common task in numerical analysis. The input values of the algorithm are coordinates of three points of the triangle and one point from which the distance is determined. An existing algorithm is extended to compute the gradient and the Hessian of that distance with respect to coordinates of involved points. Derivation of exact expressions for gradient and Hessian is presented, and numerical accuracy is evaluated for various cases. The algorithm has O(1) time and space complexity. The included open-source code may be used in applications where derivatives of point-triangle distance are required.
      Citation: Algorithms
      PubDate: 2018-07-12
      DOI: 10.3390/a11070104
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 105: Distributed Combinatorial Maps for
           Parallel Mesh Processing

    • Authors: Guillaume Damiand, Aldo Gonzalez-Lorenzo, Florence Zara, Florent Dupont
      First page: 105
      Abstract: We propose a new strategy for the parallelization of mesh processing algorithms. Our main contribution is the definition of distributed combinatorial maps (called n-dmaps), which allow us to represent the topology of big meshes by splitting them into independent parts. Our mathematical definition ensures the global consistency of the meshes at their interfaces. Thus, an n-dmap can be used to represent a mesh, to traverse it, or to modify it by using different mesh processing algorithms. Moreover, an nD mesh with a huge number of elements can be considered, which is not possible with a sequential approach and a regular data structure. We illustrate the interest of our solution by presenting a parallel adaptive subdivision method of a 3D hexahedral mesh, implemented in a distributed version. We report space and time performance results that show the interest of our approach for parallel processing of huge meshes.
      Citation: Algorithms
      PubDate: 2018-07-13
      DOI: 10.3390/a11070105
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 106: Fractional-Order Closed-Loop Model
           Reference Adaptive Control for Anesthesia

    • Authors: Gerardo Navarro-Guerrero, Yu Tang
      First page: 106
      Abstract: The design of a fractional-order closed-loop model reference adaptive control (FOCMRAC) for anesthesia based on a fractional-order model (FOM) is proposed in the paper. This proposed model gets around many difficulties, namely, unknown parameters, lack of state measurement, inter and intra-patient variability, and variable time-delay, encountered in controller designs based on the PK/PD model commonly used for control of anesthesia, and allows to design a simple adaptive controller based on the Lyapunov analysis. Simulations illustrate the effectiveness and robustness of the proposed control.
      Citation: Algorithms
      PubDate: 2018-07-14
      DOI: 10.3390/a11070106
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 107: An Ensemble Extreme Learning Machine for
           Data Stream Classification

    • Authors: Rui Yang, Shuliang Xu, Lin Feng
      First page: 107
      Abstract: Extreme learning machine (ELM) is a single hidden layer feedforward neural network (SLFN). Because ELM has a fast speed for classification, it is widely applied in data stream classification tasks. In this paper, a new ensemble extreme learning machine is presented. Different from traditional ELM methods, a concept drift detection method is embedded; it uses online sequence learning strategy to handle gradual concept drift and uses updating classifier to deal with abrupt concept drift, so both gradual concept drift and abrupt concept drift can be detected in this paper. The experimental results showed the new ELM algorithm not only can improve the accuracy of classification result, but also can adapt to new concept in a short time.
      Citation: Algorithms
      PubDate: 2018-07-17
      DOI: 10.3390/a11070107
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 108: Evolving the Controller of Automated
           Steering of a Car in Slippery Road Conditions

    • Authors: Natalia Alekseeva, Ivan Tanev, Katsunori Shimohara
      First page: 108
      Abstract: The most important characteristics of autonomous vehicles are their safety and their ability to adapt to various traffic situations and road conditions. In our research, we focused on the development of controllers for automated steering of a realistically simulated car in slippery road conditions. We comparatively investigated three implementations of such controllers: a proportional-derivative (PD) controller built in accordance with the canonical servo-control model of steering, a PID controller as an extension of the servo-control, and a controller designed heuristically via the most versatile evolutionary computing paradigm: genetic programming (GP). The experimental results suggest that the controller evolved via GP offers the best quality of control of the car in all of the tested slippery (rainy, snowy, and icy) road conditions.
      Citation: Algorithms
      PubDate: 2018-07-21
      DOI: 10.3390/a11070108
      Issue No: Vol. 11, No. 7 (2018)
       
  • Algorithms, Vol. 11, Pages 87: Special Issue on Algorithms for Scheduling
           Problems

    • Authors: Frank Werner, Larysa Burtseva, Yuri N. Sotskov
      First page: 87
      Abstract: This special issue of Algorithms is devoted to the development of scheduling algorithms based on innovative approaches for solving hard scheduling problems either exactly or approximately. Submissions were welcome both for traditional scheduling problems as well as for new practical applications. The main topics include sequencing and scheduling with additional constraints (setup times or costs, precedence constraints, resource constraints, and batch production environment) and production planning and scheduling problems arising in real-world applications.
      Citation: Algorithms
      PubDate: 2018-06-20
      DOI: 10.3390/a11060087
      Issue No: Vol. 11, No. 6 (2018)
       
  • Algorithms, Vol. 11, Pages 88: Efficient Deep Learning-Based Automated
           Pathology Identification in Retinal Optical Coherence Tomography Images

    • Authors: Qingge Ji, Wenjie He, Jie Huang, Yankui Sun
      First page: 88
      Abstract: We present an automatic method based on transfer learning for the identification of dry age-related macular degeneration (AMD) and diabetic macular edema (DME) from retinal optical coherence tomography (OCT) images. The algorithm aims to improve the classification performance of retinal OCT images and shorten the training time. Firstly, we remove the last several layers from the pre-trained Inception V3 model and regard the remaining part as a fixed feature extractor. Then, the features are used as input of a convolutional neural network (CNN) designed to learn the feature space shifts. The experimental results on two different retinal OCT images datasets demonstrate the effectiveness of the proposed method.
      Citation: Algorithms
      PubDate: 2018-06-20
      DOI: 10.3390/a11060088
      Issue No: Vol. 11, No. 6 (2018)
       
  • Algorithms, Vol. 11, Pages 165: Efficient Algorithms for Computing the
           Inner Edit Distance of a Regular Language via Transducers

    • Authors: Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang
      First page: 165
      Abstract: The concept of edit distance and its variants has applications in many areas such as computational linguistics, bioinformatics, and synchronization error detection in data communications. Here, we revisit the problem of computing the inner edit distance of a regular language given via a Nondeterministic Finite Automaton (NFA). This problem relates to the inherent maximal error-detecting capability of the language in question. We present two efficient algorithms for solving this problem, both of which execute in time O ( r 2 n 2 d ) , where r is the cardinality of the alphabet involved, n is the number of transitions in the given NFA, and d is the computed edit distance. We have implemented one of the two algorithms and present here a set of performance tests. The correctness of the algorithms is based on the connection between word distances and error detection and the fact that nondeterministic transducers can be used to represent the errors (resp., edit operations) involved in error-detection (resp., in word distances).
      Citation: Algorithms
      PubDate: 2018-10-23
      DOI: 10.3390/a11110165
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 166: High-Gain Observer-Based Sliding-Mode
           Dynamic Surface Control for Particleboard Glue Mixing and Dosing System

    • Authors: Peiyu Wang, Chunrui Zhang, Liangkuan Zhu, Chengcheng Wang
      First page: 166
      Abstract: In the process of particleboard glue mixing and dosing control under the working condition of intermediate frequency, a sliding-mode dynamic surface control strategy based on high-gain observer is proposed in this paper to deal with the problem of glue flow stability caused by strong nonlinearity. The high-gain observer (HGO) is aimed at estimating the derivative of the immeasurable system input signal for feedback, and the robustness of the system is improved by the dynamic surface control (DSC) method. Furthermore, the sliding-mode control (SMC) method is used to deal with disturbances caused by the uncertainties as well as external disturbances. It is proven that the system is exponential asymptotic stable by constructing a suitable Lyapunov function. Simulation results show that the proposed control methods can make the system track the expected flow value quickly and accurately. Finally, numerical simulation results are exhibited to authenticate and validate the effectiveness of the proposed control scheme.
      Citation: Algorithms
      PubDate: 2018-10-23
      DOI: 10.3390/a11110166
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 167: Online Adaptive Parameter Estimation for
           Quadrotors

    • Authors: Jun Zhao, Xian Wang, Guanbin Gao, Jing Na, Hongping Liu, Fujin Luan
      First page: 167
      Abstract: The stability and robustness of quadrotors are always influenced by unknown or immeasurable system parameters. This paper proposes a novel adaptive parameter estimation technology to obtain high-accuracy parameter estimation for quadrotors. A typical mathematical model of quadrotors is first obtained, which can be used for parameter estimation. Then, an expression of the parameter estimation error is derived by introducing a set of auxiliary filtered variables. Moreover, an augmented matrix is constructed based on the obtained auxiliary filtered variables, which is then used to design new adaptive laws to achieve exponential convergence under the standard persistent excitation (PE) condition. Finally, a simulation and an experimental verification for a typical quadrotor system are shown to illustrate the effectiveness of the proposed method.
      Citation: Algorithms
      PubDate: 2018-10-25
      DOI: 10.3390/a11110167
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 168: Fractional Order Sliding Mode Control of a
           Class of Second Order Perturbed Nonlinear Systems: Application to the
           Trajectory Tracking of a Quadrotor

    • Authors: Arturo Govea-Vargas, Rafael Castro-Linares, Manuel A. Duarte-Mermoud, Norelys Aguila-Camacho, Gustavo E. Ceballos-Benavides
      First page: 168
      Abstract: A Fractional Order Sliding Mode Control (FOSMC) is proposed in this paper for an integer second order nonlinear system with an unknown additive perturbation term. A sufficient condition is given to assure the attractiveness to a given sliding surface where trajectory tracking is assured, despite the presence of the perturbation term. The control scheme is applied to the model of a quadrotor vehicle in order to have trajectory tracking in the space. Simulation results are presented to evaluate the performance of the control scheme.
      Citation: Algorithms
      PubDate: 2018-10-26
      DOI: 10.3390/a11110168
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 169: Parameter Estimation of a Class of Neural
           Systems with Limit Cycles

    • Authors: Xuyang Lou, Xu Cai, Baotong Cui
      First page: 169
      Abstract: This work addresses parameter estimation of a class of neural systems with limit cycles. An identification model is formulated based on the discretized neural model. To estimate the parameter vector in the identification model, the recursive least-squares and stochastic gradient algorithms including their multi-innovation versions by introducing an innovation vector are proposed. The simulation results of the FitzHugh–Nagumo model indicate that the proposed algorithms perform according to the expected effectiveness.
      Citation: Algorithms
      PubDate: 2018-10-26
      DOI: 10.3390/a11110169
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 170: A Machine Learning View on Momentum and
           Reversal Trading

    • Authors: Zhixi Li, Vincent Tam
      First page: 170
      Abstract: Momentum and reversal effects are important phenomena in stock markets. In academia, relevant studies have been conducted for years. Researchers have attempted to analyze these phenomena using statistical methods and to give some plausible explanations. However, those explanations are sometimes unconvincing. Furthermore, it is very difficult to transfer the findings of these studies to real-world investment trading strategies due to the lack of predictive ability. This paper represents the first attempt to adopt machine learning techniques for investigating the momentum and reversal effects occurring in any stock market. In the study, various machine learning techniques, including the Decision Tree (DT), Support Vector Machine (SVM), Multilayer Perceptron Neural Network (MLP), and Long Short-Term Memory Neural Network (LSTM) were explored and compared carefully. Several models built on these machine learning approaches were used to predict the momentum or reversal effect on the stock market of mainland China, thus allowing investors to build corresponding trading strategies. The experimental results demonstrated that these machine learning approaches, especially the SVM, are beneficial for capturing the relevant momentum and reversal effects, and possibly building profitable trading strategies. Moreover, we propose the corresponding trading strategies in terms of market states to acquire the best investment returns.
      Citation: Algorithms
      PubDate: 2018-10-26
      DOI: 10.3390/a11110170
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 171: Intelligent Dynamic Backlash Agent: A
           Trading Strategy Based on the Directional Change Framework

    • Authors: Amer Bakhach, Venkata L. Raju Chinthalapati, Edward P. K. Tsang, Abdul Rahman El Sayed
      First page: 171
      Abstract: The Directional Changes (DC) framework is an approach to summarize price movement in financial time series. Some studies have tried to develop trading strategies based on the DC framework. Dynamic Backlash Agent (DBA) is a trading strategy that has been developed based on the DC framework. Despite the promising results of DBA, DBA employed neither an order size management nor risk management components. In this paper, we present an improved version of DBA named Intelligent DBA (IDBA). IDBA overcomes the weaknesses of DBA as it embraces an original order size management and risk management modules. We examine the performance of IDBA in the forex market. The results suggest that IDBA can provide significantly greater returns than DBA. The results also show that the IDBA outperforms another DC-based trading strategy and that it can generate annualized returns of about 30% after deducting the bid and ask spread (but not the transaction costs).
      Citation: Algorithms
      PubDate: 2018-10-28
      DOI: 10.3390/a11110171
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 172: Bidirectional Grid Long Short-Term Memory
           (BiGridLSTM): A Method to Address Context-Sensitivity and Vanishing
           Gradient

    • Authors: Hongxiao Fei, Fengyun Tan
      First page: 172
      Abstract: The Recurrent Neural Network (RNN) utilizes dynamically changing time information through time cycles, so it is very suitable for tasks with time sequence characteristics. However, with the increase of the number of layers, the vanishing gradient occurs in the RNN. The Grid Long Short-Term Memory (GridLSTM) recurrent neural network can alleviate this problem in two dimensions by taking advantage of the two dimensions calculated in time and depth. In addition, the time sequence task is related to the information of the current moment before and after. In this paper, we propose a method that takes into account context-sensitivity and gradient problems, namely the Bidirectional Grid Long Short-Term Memory (BiGridLSTM) recurrent neural network. This model not only takes advantage of the grid architecture, but it also captures information around the current moment. A large number of experiments on the dataset LibriSpeech show that BiGridLSTM is superior to other deep LSTM models and unidirectional LSTM models, and, when compared with GridLSTM, it gets about 26 percent gain improvement.
      Citation: Algorithms
      PubDate: 2018-10-30
      DOI: 10.3390/a11110172
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 173: Inapproximability of Rank, Clique,
           Boolean, and Maximum Induced Matching-Widths under Small Set Expansion
           Hypothesis

    • Authors: Koichi Yamazaki
      First page: 173
      Abstract: Wu et al. (2014) showed that under the small set expansion hypothesis (SSEH) there is no polynomial time approximation algorithm with any constant approximation factor for several graph width parameters, including tree-width, path-width, and cut-width (Wu et al. 2014). In this paper, we extend this line of research by exploring other graph width parameters: We obtain similar approximation hardness results under the SSEH for rank-width and maximum induced matching-width, while at the same time we show the approximation hardness of carving-width, clique-width, NLC-width, and boolean-width. We also give a simpler proof of the approximation hardness of tree-width, path-width, and cut-widththan that of Wu et al.
      Citation: Algorithms
      PubDate: 2018-10-31
      DOI: 10.3390/a11110173
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 174: Local Coupled Extreme Learning Machine
           Based on Particle Swarm Optimization

    • Authors: Hongli Guo, Bin Li, Wei Li, Fengjuan Qiao, Xuewen Rong, Yibin Li
      First page: 174
      Abstract: We developed a new method of intelligent optimum strategy for a local coupled extreme learning machine (LC-ELM). In this method, both the weights and biases between the input layer and the hidden layer, as well as the addresses and radiuses in the local coupled parameters, are determined and optimized based on the particle swarm optimization (PSO) algorithm. Compared with extreme learning machine (ELM), LC-ELM and extreme learning machine based on particle optimization (PSO-ELM) that have the same network size or compact network configuration, simulation results in terms of regression and classification benchmark problems show that the proposed algorithm, which is called LC-PSO-ELM, has improved generalization performance and robustness.
      Citation: Algorithms
      PubDate: 2018-11-01
      DOI: 10.3390/a11110174
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 175: The Bias Compensation Based Parameter and
           State Estimation for Observability Canonical State-Space Models with
           Colored Noise

    • Authors: Xuehai Wang, Feng Ding, Qingsheng Liu, Chuntao Jiang
      First page: 175
      Abstract: This paper develops a bias compensation-based parameter and state estimation algorithm for the observability canonical state-space system corrupted by colored noise. The state-space system is transformed into a linear regressive model by eliminating the state variables. Based on the determination of the noise variance and noise model, a bias correction term is added into the least squares estimate, and the system parameters and states are computed interactively. The proposed algorithm can generate the unbiased parameter estimate. Two illustrative examples are given to show the effectiveness of the proposed algorithm.
      Citation: Algorithms
      PubDate: 2018-11-01
      DOI: 10.3390/a11110175
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 176: Towards the Verbal Decision Analysis
           Paradigm for Implementable Prioritization of Software Requirements

    • Authors: Paulo Alberto Melo Barbosa, Plácido Rogério Pinheiro, Francisca Raquel de Vasconcelos Silveira
      First page: 176
      Abstract: The activity of prioritizing software requirements should be done as efficiently as possible. Selecting the most stable requirements for the most important customers of a development company can be a positive factor considering that available resources do not always encompass the implementation of all requirements. There are many quantitative methods for prioritization of software releases in the field of search-based software engineering (SBSE). However, we show that it is possible to use qualitative verbal decision analysis (VDA) methods to solve this type of problem. Moreover, we will use the ZAPROS III-i method to prioritize requirements considering the opinion of the decision-maker, who will participate in this process. Results obtained using VDA structured methods were found to be quite satisfactory when compared to methods using SBSE. A comparison of results between quantitative and qualitative methods will be made and discussed later. The results were reviewed and corroborated with the use of performance metrics.
      Citation: Algorithms
      PubDate: 2018-11-03
      DOI: 10.3390/a11110176
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 177: Understanding and Enhancement of Internal
           Clustering Validation Indexes for Categorical Data

    • Authors: Xuedong Gao, Minghan Yang
      First page: 177
      Abstract: Clustering is one of the main tasks of machine learning. Internal clustering validation indexes (CVIs) are used to measure the quality of several clustered partitions to determine the local optimal clustering results in an unsupervised manner, and can act as the objective function of clustering algorithms. In this paper, we first studied several well-known internal CVIs for categorical data clustering, and proved the ineffectiveness of evaluating the partitions of different numbers of clusters without any inter-cluster separation measures or assumptions; the accurateness of separation, along with its coordination with the intra-cluster compactness measures, can notably affect performance. Then, aiming to enhance the internal clustering validation measurement, we proposed a new internal CVI—clustering utility based on the averaged information gain of isolating each cluster (CUBAGE)—which measures both the compactness and the separation of the partition. The experimental results supported our findings with regard to the existing internal CVIs, and showed that the proposed CUBAGE outperforms other internal CVIs with or without a pre-known number of clusters.
      Citation: Algorithms
      PubDate: 2018-11-04
      DOI: 10.3390/a11110177
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 178: Deep Directional Network for Object
           Tracking

    • Authors: Zhaohua Hu, Xiaoyi Shi
      First page: 178
      Abstract: Existing object trackers are mostly based on correlation filtering and neural network frameworks. Correlation filtering is fast but has poor accuracy. Although a neural network can achieve high precision, a large amount of computation increases the tracking time. To address this problem, we utilize a convolutional neural network (CNN) to learn object direction. We propose a target direction classification network based on CNNs that has a directional shortcut to the tracking target, unlike the particle filter that randomly finds the target. Our network uses an end-to-end approach to determine scale variation that has good robustness to scale variation sequences. In the pretraining stage, the Visual Object Tracking Challenges (VOT) dataset is used to train the network for learning positive and negative sample classification and direction classification. In the online tracking stage, the sliding window operation is performed by using the obtained directional information to determine the exact position of the object. The network only calculates a single sample, which guarantees a low computational burden. The positive and negative sample redetection strategies can successfully ensure that the samples are not lost. The one-pass evaluation (OPE) evaluation results of the object tracking benchmark (OTB) demonstrate that the algorithm is very robust and is also faster than several deep trackers.
      Citation: Algorithms
      PubDate: 2018-11-05
      DOI: 10.3390/a11110178
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 179: A Reciprocal-Selection-Based
           ‘Win–Win’ Overlay Spectrum-Sharing Scheme for
           Device-to-Device-Enabled Cellular Network

    • Authors: Peng Li, Chenchen Shu, Jiao Feng
      First page: 179
      Abstract: This paper proposes a reciprocal-selection-based ‘Win–Win’ overlay spectrum-sharing scheme for device-to-Device-enabled cellular networks to address the resource sharing between Device-to-Device devices and the cellular users by using an overlay approach. Based on the proposed scheme, the cell edge users intend to lease part of its spectrum resource to Device-to-Device transmission pairs. However, the Device-to-Device users have to provide the cooperative transmission assistance for the cell edge users in order to improve the Quality of Service of the uplink transmission from the cell edge users to the base station. Compared to the underlay spectrum-sharing scheme, overlay spectrum-sharing scheme may reduce spectrum efficiency. Hence, Non-Orthogonal Multiple Access technology is invoked at the Device-to-Device transmitter in order to improve the spectrum efficiency. The Stackelberg game is exploited to model the behaviours of the cell edge users and Device-to-Device devices. Moreover, based on matching theory, the cell edge users and Device-to-Device pairs form one-to-one matching and the stability of matching is analysed. The simulation results show that the proposed reciprocal-selection-based ‘Win–Win’ overlay spectrum-sharing scheme is capable of providing considerable rate improvements for both EUs and D2D pairs and reducing transmit power dissipated by the D2D transmitter to forward data for the EU compared with the existing methods.
      Citation: Algorithms
      PubDate: 2018-11-06
      DOI: 10.3390/a11110179
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 180: Iterative Identification for Multivariable
           Systems with Time-Delays Based on Basis Pursuit De-Noising and Auxiliary
           Model

    • Authors: Junyao You, Yanjun Liu
      First page: 180
      Abstract: This paper focuses on the joint estimation of parameters and time-delays of the multiple-input single-output output-error systems. Since the time-delays are unknown, an effective identification model with a high dimensional and sparse parameter vector is established based on overparameterization. Then, the identification problem is converted to a sparse optimization problem. Based on the basis pursuit de-noising criterion and the auxiliary model identification idea, an auxiliary model based basis pursuit de-noising iterative algorithm is presented. The parameters are estimated by solving a quadratic program, and the unavailable terms in the information vector are updated by the auxiliary model outputs iteratively. The time-delays are estimated according to the sparse structure of the parameter vector. The proposed method can obtain effective estimates of the parameters and time-delays from few sampled data. The simulation results illustrate the effectiveness of the proposed algorithm.
      Citation: Algorithms
      PubDate: 2018-11-06
      DOI: 10.3390/a11110180
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 181: Measuring the Impact of Financial News and
           

    • Authors: Foteini Kollintza-Kyriakoulia, Manolis Maragoudakis, Anastasia Krithara
      First page: 181
      Abstract: In this work, we study the task of predicting the closing price of the following day of a stock, based on technical analysis, news articles and public opinions. The intuition of this study lies in the fact that technical analysis contains information about the event, but not the cause of the change, while data like news articles and public opinions may be interpreted as a cause. The paper uses time series analysis techniques such as Symbolic Aggregate Approximation (SAX) and Dynamic Time Warping (DTW) to study the existence of a relation between price data and textual information, either from news or social media. Pattern matching techniques from time series data are also incorporated, in order to experimentally validate potential correlations of price and textual information within given time periods. The ultimate goal is to create a forecasting model that exploits the previously discovered patterns in order to augment the forecasting accuracy. Results obtained from the experimental phase are promising. The performance of the classifier shows clear signs of improvement and robustness within the time periods where patterns between stock price and the textual information have been identified, compared to the periods where patterns did not exist.
      Citation: Algorithms
      PubDate: 2018-11-06
      DOI: 10.3390/a11110181
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 182: An Algorithm for Interval-Valued
           Intuitionistic Fuzzy Preference Relations in Group Decision Making Based
           on Acceptability Measurement and Priority Weight Determination

    • Authors: Hua Zhuang, Yanzhao Tang, Meijuan Li
      First page: 182
      Abstract: Group decision making with intuitionistic fuzzy preference information contains two key issues: acceptability measurement and priority weight determination. In this paper, we investigate the above two issues with respect to multiplicative interval-valued intuitionistic fuzzy preference relation (IVIFPR). Firstly, a consistency index is defined to measure the multiplicative consistency degree of IVIFPR and an optimization model is established to improve the consistency degree of IVIFPR to an acceptable one. Next, in terms of priority weight determination, an error-analysis-based extension method is proposed to obtain priority weight vector from the acceptable IVIFPR. For GDM problems, decision makers’ weights are derived by the proposed multiplicative consistency index. Subsequently, the collective IVIFPR is obtained by using an interval-valued intuitionistic fuzzy (IVIF) weighted averaging operator. Finally, a step-by step algorithm for GDM with IVIFPRs is given, and an example of enterprise innovation partner selection is analyzed, and comparative analyses with existing approaches are performed to demonstrate that the proposed algorithm is both effective and practical in dealing with GDM problems.
      Citation: Algorithms
      PubDate: 2018-11-06
      DOI: 10.3390/a11110182
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 183: Virtual Belt Algorithm for the Management
           of Isolated Autonomous Intersection

    • Authors: Chentong Bian, Guodong Yin, Liwei Xu, Ning Zhang
      First page: 183
      Abstract: To enhance traffic efficiency, in this paper, a novel virtual belt algorithm is proposed for the management of an isolated autonomous intersection. The proposed virtual belt algorithm consists of an offline algorithm and an online algorithm. Using the offline algorithm, the considered intersection can be modeled as several virtual belts. The online algorithm is designed for the real-time application of the virtual belt algorithm. Compared with the related algorithms, the main advantage of the proposed algorithm is that, there are several candidate trajectories for each approaching vehicle. Thus, there are more opportunities for an approaching vehicle to obtain a permission to pass an intersection, which is effective to improve traffic efficiency. The proposed algorithm is validated using numerical simulations conducted by Matlab and VISSIM. The simulation results show that the proposed algorithm is effective for autonomous intersection management.
      Citation: Algorithms
      PubDate: 2018-11-08
      DOI: 10.3390/a11110183
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 184: Weak Fault Detection of Tapered Rolling
           Bearing Based on Penalty Regularization Approach

    • Authors: Qing Li, Steven Y. Liang
      First page: 184
      Abstract: Aimed at the issue of estimating the fault component from a noisy observation, a novel detection approach based on augmented Huber non-convex penalty regularization (AHNPR) is proposed. The core objectives of the proposed method are that (1) it estimates non-zero singular values (i.e., fault component) accurately and (2) it maintains the convexity of the proposed objective cost function (OCF) by restricting the parameters of the non-convex regularization. Specifically, the AHNPR model is expressed as the L1-norm minus a generalized Huber function, which avoids the underestimation weakness of the L1-norm regularization. Furthermore, the convexity of the proposed OCF is proved via the non-diagonal characteristic of the matrix BTB, meanwhile, the non-zero singular values of the OCF is solved by the forward–backward splitting (FBS) algorithm. Last, the proposed method is validated by the simulated signal and vibration signals of tapered bearing. The results demonstrate that the proposed approach can identify weak fault information from the raw vibration signal under severe background noise, that the non-convex penalty regularization can induce sparsity of the singular values more effectively than the typical convex penalty (e.g., L1-norm fused lasso optimization (LFLO) method), and that the issue of underestimating sparse coefficients can be improved.
      Citation: Algorithms
      PubDate: 2018-11-08
      DOI: 10.3390/a11110184
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 185: An Algorithmic Look at Financial
           Volatility

    • Authors: Lin Ma, Jean-Paul Delahaye
      First page: 185
      Abstract: In this paper, we attempt to give an algorithmic explanation to volatility clustering, one of the most exploited stylized facts in finance. Our analysis with daily data from five exchanges shows that financial volatilities follow Levin’s universal distribution Kirchherr et al. (1997) once transformed into equally proportional binary strings. Frequency ranking of binary trading weeks coincides with that of their Kolmogorov complexity estimated byDelahaye et al. (2012). According to Levin’s universal distribution, large (resp. small) volatilities are more likely to be followed by large (resp. small) ones since simple trading weeks such as “00000” or “11111” are much more frequently observed than complex ones such as “10100” or “01011”. Thus, volatility clusters may not be attributed to behavioral or micro-structural assumptions but to the complexity discrepancy between finite strings. This property of financial data could be at the origin of volatility autocorrelation, though autocorrelated volatilities simulated from Generalized Auto-Regressive Conditional Heteroskedacity (hereafter GARCH) cannot be transformed into universally distributed binary weeks.
      Citation: Algorithms
      PubDate: 2018-11-13
      DOI: 10.3390/a11110185
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 186: Pricing Strategies of Logistics
           Distribution Services for Perishable Commodities

    • Authors: Tao Li, Yan Chen, Taoying Li
      First page: 186
      Abstract: The problem of pricing distribution services is challenging due to the loss in value of product during its distribution process. Four logistics service pricing strategies are constructed in this study, including fixed pricing model, fixed pricing model with time constraints, dynamic pricing model, and dynamic pricing model with time constraints in combination with factors, such as the distribution time, customer satisfaction, optimal pricing, etc. By analyzing the relationship between optimal pricing and key parameters (such as the value of the decay index, the satisfaction of consumers, dispatch time, and the storage cost of the commodity), it is found that the larger the value of the attenuation coefficient, the easier the perishable goods become spoilage, which leads to lower distribution prices and impacts consumer satisfaction. Moreover, the analysis of the average profit of the logistics service providers in these four pricing models shows that the average profit in the dynamic pricing model with time constraints is better. Finally, a numerical experiment is given to support the findings.
      Citation: Algorithms
      PubDate: 2018-11-17
      DOI: 10.3390/a11110186
      Issue No: Vol. 11, No. 11 (2018)
       
  • Algorithms, Vol. 11, Pages 143: An Algorithm for Mapping the Asymmetric
           Multiple Traveling Salesman Problem onto Colored Petri Nets

    • Authors: Furqan Hussain Essani, Sajjad Haider
      First page: 143
      Abstract: The Multiple Traveling Salesman Problem is an extension of the famous Traveling Salesman Problem. Finding an optimal solution to the Multiple Traveling Salesman Problem (mTSP) is a difficult task as it belongs to the class of NP-hard problems. The problem becomes more complicated when the cost matrix is not symmetric. In such cases, finding even a feasible solution to the problem becomes a challenging task. In this paper, an algorithm is presented that uses Colored Petri Nets (CPN)—a mathematical modeling language—to represent the Multiple Traveling Salesman Problem. The proposed algorithm maps any given mTSP onto a CPN. The transformed model in CPN guarantees a feasible solution to the mTSP with asymmetric cost matrix. The model is simulated in CPNTools to measure two optimization objectives: the maximum time a salesman takes in a feasible solution and the collective time taken by all salesmen. The transformed model is also formally verified through reachability analysis to ensure that it is correct and is terminating.
      Citation: Algorithms
      PubDate: 2018-09-25
      DOI: 10.3390/a11100143
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 144: Multi-Branch Deep Residual Network for
           Single Image Super-Resolution

    • Authors: Peng Liu, Ying Hong, Yan Liu
      First page: 144
      Abstract: Recently, algorithms based on the deep neural networks and residual networks have been applied for super-resolution and exhibited excellent performance. In this paper, a multi-branch deep residual network for single image super-resolution (MRSR) is proposed. In the network, we adopt a multi-branch network framework and further optimize the structure of residual network. By using residual blocks and filters reasonably, the model size is greatly expanded while the stable training is also guaranteed. Besides, a perceptual evaluation function, which contains three parts of loss, is proposed. The experiment results show that the evaluation function provides great support for the quality of reconstruction and the competitive performance. The proposed method mainly uses three steps of feature extraction, mapping, and reconstruction to complete the super-resolution reconstruction and shows superior performance than other state-of-the-art super-resolution methods on benchmark datasets.
      Citation: Algorithms
      PubDate: 2018-09-27
      DOI: 10.3390/a11100144
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 145: Reducing the Operational Cost of Cloud
           Data Centers through Renewable Energy

    • Authors: Demetrio Laganà, Carlo Mastroianni, Michela Meo, Daniela Renga
      First page: 145
      Abstract: The success of cloud computing services has led to big computing infrastructures that are complex to manage and very costly to operate. In particular, power supply dominates the operational costs of big infrastructures, and several solutions have to be put in place to alleviate these operational costs and make the whole infrastructure more sustainable. In this paper, we investigate the case of a complex infrastructure composed of data centers (DCs) located in different geographical areas in which renewable energy generators are installed, co-located with the data centers, to reduce the amount of energy that must be purchased by the power grid. Since renewable energy generators are intermittent, the load management strategies of the infrastructure have to be adapted to the intermittent nature of the sources. In particular, we consider EcoMultiCloud , a load management strategy already proposed in the literature for multi-objective load management strategies, and we adapt it to the presence of renewable energy sources. Hence, cost reduction is achieved in the load allocation process, when virtual machines (VMs) are assigned to a data center of the considered infrastructure, by considering both energy cost variations and the presence of renewable energy production. Performance is analyzed for a specific infrastructure composed of four data centers. Results show that, despite being intermittent and highly variable, renewable energy can be effectively exploited in geographical data centers when a smart load allocation strategy is implemented. In addition, the results confirm that EcoMultiCloud is very flexible and is suited to the considered scenario.
      Citation: Algorithms
      PubDate: 2018-09-27
      DOI: 10.3390/a11100145
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 146: Fast Tuning of the PID Controller in An
           

    • Authors: Abdoalnasir Almabrok, Mihalis Psarakis, Anastasios Dounis
      First page: 146
      Abstract: This article presents a novel technique for the fast tuning of the parameters of the proportional–integral–derivative (PID) controller of a second-order heat, ventilation, and air conditioning (HVAC) system. The HVAC systems vary greatly in size, control functions and the amount of consumed energy. The optimal design and power efficiency of an HVAC system depend on how fast the integrated controller, e.g., PID controller, is adapted in the changes of the environmental conditions. In this paper, to achieve high tuning speed, we rely on a fast convergence evolution algorithm, called Big Bang–Big Crunch (BB–BC). The BB–BC algorithm is implemented, along with the PID controller, in an FPGA device, in order to further accelerate of the optimization process. The FPGA-in-the-loop (FIL) technique is used to connect the FPGA board (i.e., the PID and BB–BC subsystems) with the plant (i.e., MATLAB/Simulink models of HVAC) in order to emulate and evaluate the entire system. The experimental results demonstrate the efficiency of the proposed technique in terms of optimization accuracy and convergence speed compared with other optimization approaches for the tuning of the PID parameters: sw implementation of the BB–BC, genetic algorithm (GA), and particle swarm optimization (PSO).
      Citation: Algorithms
      PubDate: 2018-09-28
      DOI: 10.3390/a11100146
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 147: WSN Nodes Placement Optimization Based on
           a Weighted Centroid Artificial Fish Swarm Algorithm

    • Authors: Hong Yin, Ying Zhang, Xu He
      First page: 147
      Abstract: Aiming at optimal placement of wireless sensor network (WSN) nodes of wind turbine blade for health inspection, a weighted centroid artificial fish swarm algorithm (WC-AFSA) is proposed. A weighted centroid algorithm is applied to construct an initial fish population so to enhance the fish diversity and improve the search precision. Adaptive step based on dynamic parameter is used to jump out local optimal solution and improve the convergence speed. Optimal sensor placement is realized by minimizing the maximum off-diagonal elements of the modal assurance criterion as the objective function. Five typical test functions are applied to verify the effectiveness of the algorithm, and optimal placement of WSNs nodes on wind turbine blade is carried out. The results show that WC-AFSA has better optimization effect than AFSA, which can solve the problem of optimal arrangement of blade WSNs nodes.
      Citation: Algorithms
      PubDate: 2018-09-30
      DOI: 10.3390/a11100147
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 148: Fuzzy Q-Learning Agent for Online Tuning
           of PID Controller for DC Motor Speed Control

    • Authors: Panagiotis Kofinas, Anastasios I. Dounis
      First page: 148
      Abstract: This paper proposes a hybrid Zeigler-Nichols (Z-N) reinforcement learning approach for online tuning of the parameters of the Proportional Integral Derivative (PID) for controlling the speed of a DC motor. The PID gains are set by the Z-N method, and are then adapted online through the fuzzy Q-Learning agent. The fuzzy Q-Learning agent is used instead of the conventional Q-Learning, in order to deal with the continuous state-action space. The fuzzy Q-Learning agent defines its state according to the value of the error. The output signal of the agent consists of three output variables, in which each one defines the percentage change of each gain. Each gain can be increased or decreased from 0% to 50% of its initial value. Through this method, the gains of the controller are adjusted online via the interaction of the environment. The knowledge of the expert is not a necessity during the setup process. The simulation results highlight the performance of the proposed control strategy. After the exploration phase, the settling time is reduced in the steady states. In the transient states, the response has less amplitude oscillations and reaches the equilibrium point faster than the conventional PID controller.
      Citation: Algorithms
      PubDate: 2018-09-30
      DOI: 10.3390/a11100148
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 149: Cover Time in Edge-Uniform
           Stochastically-Evolving Graphs

    • Authors: Ioannis Lamprou, Russell Martin, Paul Spirakis
      First page: 149
      Abstract: We define a general model of stochastically-evolving graphs, namely the edge-uniform stochastically-evolving graphs. In this model, each possible edge of an underlying general static graph evolves independently being either alive or dead at each discrete time step of evolution following a (Markovian) stochastic rule. The stochastic rule is identical for each possible edge and may depend on the past k ≥ 0 observations of the edge’s state. We examine two kinds of random walks for a single agent taking place in such a dynamic graph: (i) The Random Walk with a Delay (RWD), where at each step, the agent chooses (uniformly at random) an incident possible edge, i.e., an incident edge in the underlying static graph, and then, it waits till the edge becomes alive to traverse it. (ii) The more natural Random Walk on what is Available (RWA), where the agent only looks at alive incident edges at each time step and traverses one of them uniformly at random. Our study is on bounding the cover time, i.e., the expected time until each node is visited at least once by the agent. For RWD, we provide a first upper bound for the cases k = 0 , 1 by correlating RWD with a simple random walk on a static graph. Moreover, we present a modified electrical network theory capturing the k = 0 case. For RWA, we derive some first bounds for the case k = 0 , by reducing RWA to an RWD-equivalent walk with a modified delay. Further, we also provide a framework that is shown to compute the exact value of the cover time for a general family of stochastically-evolving graphs in exponential time. Finally, we conduct experiments on the cover time of RWA in edge-uniform graphs and compare the experimental findings with our theoretical bounds.
      Citation: Algorithms
      PubDate: 2018-10-02
      DOI: 10.3390/a11100149
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 150: SLoPCloud: An Efficient Solution for
           Locality Problem in Peer-to-Peer Cloud Systems

    • Authors: Mohammed  Gharib, Marzieh Malekimajd, Ali Movaghar
      First page: 150
      Abstract: Peer-to-Peer (P2P) cloud systems are becoming more popular due to the high computational capability, scalability, reliability, and efficient data sharing. However, sending and receiving a massive amount of data causes huge network traffic leading to significant communication delays. In P2P systems, a considerable amount of the mentioned traffic and delay is owing to the mismatch between the physical layer and the overlay layer, which is referred to as locality problem. To achieve higher performance and consequently resilience to failures, each peer has to make connections to geographically closer peers. To the best of our knowledge, locality problem is not considered in any well known P2P cloud system. However, considering this problem could enhance the overall network performance by shortening the response time and decreasing the overall network traffic. In this paper, we propose a novel, efficient, and general solution for locality problem in P2P cloud systems considering the round-trip-time (RTT). Furthermore, we suggest a flexible topology as the overlay graph to address the locality problem more effectively. Comprehensive simulation experiments are conducted to demonstrate the applicability of the proposed algorithm in most of the well-known P2P overlay networks while not introducing any serious overhead.
      Citation: Algorithms
      PubDate: 2018-10-02
      DOI: 10.3390/a11100150
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 151: K-Means Cloning: Adaptive Spherical
           K-Means Clustering

    • Authors: Abdel-Rahman Hedar, Abdel-Monem M. Ibrahim, Alaa E. Abdel-Hakim, Adel A.  Sewisy
      First page: 151
      Abstract: We propose a novel method for adaptive K-means clustering. The proposed method overcomes the problems of the traditional K-means algorithm. Specifically, the proposed method does not require prior knowledge of the number of clusters. Additionally, the initial identification of the cluster elements has no negative impact on the final generated clusters. Inspired by cell cloning in microorganism cultures, each added data sample causes the existing cluster `colonies’ to evaluate, with the other clusters, various merging or splitting actions in order for reaching the optimum cluster set. The proposed algorithm is adequate for clustering data in isolated or overlapped compact spherical clusters. Experimental results support the effectiveness of this clustering algorithm.
      Citation: Algorithms
      PubDate: 2018-10-06
      DOI: 10.3390/a11100151
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 152: Accelerated Iterative Learning Control of
           Speed Ripple Suppression for a Seeker Servo Motor

    • Authors: Dongqi Ma, Hui Lin
      First page: 152
      Abstract: To suppress the speed ripple of a permanent magnet synchronous motor in a seeker servo system, we propose an accelerated iterative learning control with an adjustable learning interval. First, according to the error of current iterative learning for the system, we determine the next iterative learning interval and conduct real-time correction on the learning gain. For the learning interval, as the number of iterations increases, the actual interval that needs correction constantly shortens, accelerating the convergence speed. Second, we analyze the specific structure of the controller while applying reasonable assumptions pertaining to its condition. Using the λ-norm, we analyze and apply our mathematical knowledge to obtain a strict mathematical proof on the P-type iterative learning control and obtain the condition of convergence for the controller. Finally, we apply the proposed method for periodic ripple inhibition of the torque rotation speed of the permanent magnet synchronous motor and establish the system model; we use the periodic load torque to simulate the ripple torque of the synchronous motor. The simulation and experimental results indicate the effectiveness of the method.
      Citation: Algorithms
      PubDate: 2018-10-10
      DOI: 10.3390/a11100152
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 153: Chronotype, Risk and Time Preferences, and
           Financial Behaviour

    • Authors: Di Wang, Frank McGroarty, Eng-Tuck Cheah
      First page: 153
      Abstract: This paper examines the effect of chronotype on the delinquent credit card payments and stock market participation through preference channels. Using an online survey of 455 individuals who have been working for 3 to 8 years in companies in mainland China, the results reveal that morningness is negatively associated with delinquent credit card payments. Morningness also indirectly predicts delinquent credit card payments through time preference, but this relationship only exists when individuals’ monthly income is at a low and average level. On the other hand, financial risk preference accounts for the effect of morningness on stock market participation. Consequently, an additional finding is that morningness is positively associated with financial risk preference, which contradicts previous findings in the literature. Finally, based on the empirical evidence, we discuss the plausible mechanisms that may drive these relationships and the implications for theory and practice. The current study contributes to the literature by examining the links between circadian typology and particular financial behaviour of experienced workers.
      Citation: Algorithms
      PubDate: 2018-10-10
      DOI: 10.3390/a11100153
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 154: Two Hesitant Multiplicative
           Decision-Making Algorithms and Their Application to Fog-Haze Factor
           Assessment Problem

    • Authors: Lidan Pei, Feifei Jin
      First page: 154
      Abstract: Hesitant multiplicative preference relation (HMPR) is a useful tool to cope with the problems in which the experts utilize Saaty’s 1–9 scale to express their preference information over paired comparisons of alternatives. It is known that the lack of acceptable consistency easily leads to inconsistent conclusions, therefore consistency improvement processes and deriving the reliable priority weight vector for alternatives are two significant and challenging issues for hesitant multiplicative information decision-making problems. In this paper, some new concepts are first introduced, including HMPR, consistent HMPR and the consistency index of HMPR. Then, based on the logarithmic least squares model and linear optimization model, two novel automatic iterative algorithms are proposed to enhance the consistency of HMPR and generate the priority weights of HMPR, which are proved to be convergent. In the end, the proposed algorithms are applied to the factors affecting selection of fog-haze weather. The comparative analysis shows that the decision-making process in our algorithms would be more straight-forward and efficient.
      Citation: Algorithms
      PubDate: 2018-10-10
      DOI: 10.3390/a11100154
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 155: Real-Time Tumor Motion Tracking in 3D
           Using Planning 4D CT Images during Image-Guided Radiation Therapy

    • Authors: Jang-Hwan Choi, Sooyeul Lee
      First page: 155
      Abstract: In this paper we propose a novel method for tracking the respiratory phase and 3D tumor position in real time during treatment. The method uses planning four-dimensional (4D) computed tomography (CT) obtained through the respiratory phase, and a kV projection taken during treatment. First, digitally rendered radiographs (DRRs) are generated from the 4DCT, and the structural similarity (SSIM) between the DRRs and the kV projection is computed to determine the current respiratory phase and magnitude. The 3D position of the tumor corresponding to the phase and magnitude is estimated using non-rigid registration by utilizing the tumor path segmented in the 4DCT. This method is evaluated using data from six patients with lung cancer and dynamic diaphragm phantom data. The method performs well irrespective of the gantry angle used, i.e., a respiration phase tracking accuracy of 97.2 ± 2.5%, and tumor tracking error in 3D of 0.9 ± 0.4 mm. The phantom study reveals that the DRRs match the actual projections well. The time taken to track the tumor is 400 ± 53 ms. This study demonstrated the feasibility of a technique used to track the respiratory phase and 3D tumor position in real time using kV fluoroscopy acquired from arbitrary angles around the freely breathing patient.
      Citation: Algorithms
      PubDate: 2018-10-11
      DOI: 10.3390/a11100155
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 156: Online Uniformly Inserting Points on the
           Sphere

    • Authors: Rong Zhou, Chun Chen, Liqun Sun, Francis C. M. Lau, Sheung-Hung Poon, Yong Zhang
      First page: 156
      Abstract: Uniformly inserting points on the sphere has been found useful in many scientific and engineering fields. Different from the offline version where the number of points is known in advance, we consider the online version of this problem. The requests for point insertion arrive one by one and the target is to insert points as uniformly as possible. To measure the uniformity we use gap ratio which is defined as the ratio of the maximal gap to the minimal gap of two arbitrary inserted points. We propose a two-phase online insertion strategy with gap ratio of at most 3.69 . Moreover, the lower bound of the gap ratio is proved to be at least 1.78 .
      Citation: Algorithms
      PubDate: 2018-10-16
      DOI: 10.3390/a11100156
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 157: LSTM Accelerator for Convolutional Object
           Identification

    • Authors: Alkiviadis Savvopoulos, Andreas Kanavos, Phivos Mylonas, Spyros Sioutas
      First page: 157
      Abstract: Deep Learning has dramatically advanced the state of the art in vision, speech and many other areas. Recently, numerous deep learning algorithms have been proposed to solve traditional artificial intelligence problems. In this paper, in order to detect the version that can provide the best trade-off in terms of time and accuracy, convolutional networks of various depths have been implemented. Batch normalization is also considered since it acts as a regularizer and achieves the same accuracy with fewer training steps. For maximizing the yield of the complexity by diminishing, as well as minimizing the loss of accuracy, LSTM neural net layers are utilized in the process. The image sequences are proven to be classified by the LSTM in a more accelerated manner, while managing better precision. Concretely, the more complex the CNN, the higher the percentages of exactitude; in addition, but for the high-rank increase in accuracy, the time was significantly decreased, which eventually rendered the trade-off optimal. The average improvement of performance for all models regarding both datasets used amounted to 42 % .
      Citation: Algorithms
      PubDate: 2018-10-17
      DOI: 10.3390/a11100157
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 158: Incremental Learning for Classification of
           Unstructured Data Using Extreme Learning Machine

    • Authors: Sathya Madhusudhanan, Suresh Jaganathan, Jayashree L S
      First page: 158
      Abstract: Unstructured data are irregular information with no predefined data model. Streaming data which constantly arrives over time is unstructured, and classifying these data is a tedious task as they lack class labels and get accumulated over time. As the data keeps growing, it becomes difficult to train and create a model from scratch each time. Incremental learning, a self-adaptive algorithm uses the previously learned model information, then learns and accommodates new information from the newly arrived data providing a new model, which avoids the retraining. The incrementally learned knowledge helps to classify the unstructured data. In this paper, we propose a framework CUIL (Classification of Unstructured data using Incremental Learning) which clusters the metadata, assigns a label for each cluster and then creates a model using Extreme Learning Machine (ELM), a feed-forward neural network, incrementally for each batch of data arrived. The proposed framework trains the batches separately, reducing the memory resources, training time significantly and is tested with metadata created for the standard image datasets like MNIST, STL-10, CIFAR-10, Caltech101, and Caltech256. Based on the tabulated results, our proposed work proves to show greater accuracy and efficiency.
      Citation: Algorithms
      PubDate: 2018-10-17
      DOI: 10.3390/a11100158
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 159: A Faster Algorithm for Reducing the
           Computational Complexity of Convolutional Neural Networks

    • Authors: Yulin Zhao, Donghui Wang, Leiou Wang, Peng Liu
      First page: 159
      Abstract: Convolutional neural networks have achieved remarkable improvements in image and video recognition but incur a heavy computational burden. To reduce the computational complexity of a convolutional neural network, this paper proposes an algorithm based on the Winograd minimal filtering algorithm and Strassen algorithm. Theoretical assessments of the proposed algorithm show that it can dramatically reduce computational complexity. Furthermore, the Visual Geometry Group (VGG) network is employed to evaluate the algorithm in practice. The results show that the proposed algorithm can provide the optimal performance by combining the savings of these two algorithms. It saves 75% of the runtime compared with the conventional algorithm.
      Citation: Algorithms
      PubDate: 2018-10-18
      DOI: 10.3390/a11100159
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 160: Modeling and Evaluation of Power-Aware
           Software Rejuvenation in Cloud Systems

    • Authors: Sharifeh Fakhrolmobasheri, Ehsan Ataie, Ali Movaghar
      First page: 160
      Abstract: Long and continuous running of software can cause software aging-induced errors and failures. Cloud data centers suffer from these kinds of failures when Virtual Machine Monitors (VMMs), which control the execution of Virtual Machines (VMs), age. Software rejuvenation is a proactive fault management technique that can prevent the occurrence of future failures by terminating VMMs, cleaning up their internal states, and restarting them. However, the appropriate time and type of VMM rejuvenation can affect performance, availability, and power consumption of a system. In this paper, an analytical model is proposed based on Stochastic Activity Networks for performance evaluation of Infrastructure-as-a-Service cloud systems. Using the proposed model, a two-threshold power-aware software rejuvenation scheme is presented. Many details of real cloud systems, such as VM multiplexing, migration of VMs between VMMs, VM heterogeneity, failure of VMMs, failure of VM migration, and different probabilities for arrival of different VM request types are investigated using the proposed model. The performance of the proposed rejuvenation scheme is compared with two baselines based on diverse performance, availability, and power consumption measures defined on the system.
      Citation: Algorithms
      PubDate: 2018-10-18
      DOI: 10.3390/a11100160
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 161: Total Coloring Conjecture for Certain
           Classes of Graphs

    • Authors: R. Vignesh, J. Geetha, K. Somasundaram
      First page: 161
      Abstract: A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color. The total chromatic number of a graph G, denoted by χ ′ ′ ( G ) , is the minimum number of colors that suffice in a total coloring. Behzad and Vizing conjectured that for any graph G, Δ ( G ) + 1 ≤ χ ′ ′ ( G ) ≤ Δ ( G ) + 2 , where Δ ( G ) is the maximum degree of G. In this paper, we prove the total coloring conjecture for certain classes of graphs of deleted lexicographic product, line graph and double graph.
      Citation: Algorithms
      PubDate: 2018-10-19
      DOI: 10.3390/a11100161
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 162: Application of Data Science Technology on
           Research of Circulatory System Disease Prediction Based on a Prospective
           Cohort

    • Authors: Haijing Tang, Guo Chen, Yu Kang, Xu Yang
      First page: 162
      Abstract: Chronic diseases represented by circulatory diseases have gradually become the main types of diseases affecting the health of our population. Establishing a circulatory system disease prediction model to predict the occurrence of diseases and controlling them is of great significance to the health of our population. This article is based on the prospective population cohort data of chronic diseases in China, based on the existing medical cohort studies, the Kaplan–Meier method was used for feature selection, and the traditional medical analysis model represented by the Cox proportional hazards model was used and introduced. Support vector machine research methods in machine learning establish circulatory system disease prediction models. This paper also attempts to introduce the proportion of the explanation variation (PEV) and the shrinkage factor to improve the Cox proportional hazards model; and the use of Particle Swarm Optimization (PSO) algorithm to optimize the parameters of SVM model. Finally, the experimental verification of the above prediction models is carried out. This paper uses the model training time, Accuracy rate(ACC), the area under curve (AUC)of the Receiver Operator Characteristic curve (ROC) and other forecasting indicators. The experimental results show that the PSO-SVM-CSDPC disease prediction model and the S-Cox-CSDPC circulation system disease prediction model have the advantages of fast model solving speed, accurate prediction results and strong generalization ability, which are helpful for the intervention and control of chronic diseases.
      Citation: Algorithms
      PubDate: 2018-10-20
      DOI: 10.3390/a11100162
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 163: Airfoil Optimization Design Based on the
           Pivot Element Weighting Iterative Method

    • Authors: Xinqiang Liu, Weiliang He
      First page: 163
      Abstract: Class function/shape function transformation (CST) is an advanced geometry representation method employed to generate airfoil coordinates. Aiming at the morbidity of the CST coefficient matrix, the pivot element weighting iterative (PEWI) method is proposed to improve the condition number of the ill-conditioned matrix in the CST. The feasibility of the PEWI method is evaluated by using the RAE2822 and S1223 airfoil. The aerodynamic optimization of the S1223 airfoil is conducted based on the Isight software platform. First, the S1223 airfoil is parameterized by the CST with the PEWI method. It is very significant to confirm the range of variables for the airfoil optimization design. So the normalization method of design variables is put forward in the paper. Optimal Latin Hypercube sampling is applied to generate the samples, whose aerodynamic performances are calculated by the numerical simulation. Then the Radial Basis Functions (RBF) neural network model is trained by these aerodynamic performance data. Finally, the multi-island genetic algorithm is performed to achieve the maximum lift-drag ratio of S1223. The results show that the robustness of the CST can be improved. Moreover, the lift-drag ratio of S1223 increases by 2.27% and the drag coefficient decreases by 1.4%.
      Citation: Algorithms
      PubDate: 2018-10-22
      DOI: 10.3390/a11100163
      Issue No: Vol. 11, No. 10 (2018)
       
  • Algorithms, Vol. 11, Pages 164: Learning Representations of Natural
           Language Texts with Generative Adversarial Networks at Document, Sentence,
           and Aspect Level

    • Authors: Aggeliki Vlachostergiou, George Caridakis, Phivos Mylonas, Andreas Stafylopatis
      First page: 164
      Abstract: The ability to learn robust, resizable feature representations from unlabeled data has potential applications in a wide variety of machine learning tasks. One way to create such representations is to train deep generative models that can learn to capture the complex distribution of real-world data. Generative adversarial network (GAN) approaches have shown impressive results in producing generative models of images, but relatively little work has been done on evaluating the performance of these methods for the learning representation of natural language, both in supervised and unsupervised settings at the document, sentence, and aspect level. Extensive research validation experiments were performed by leveraging the 20 Newsgroups corpus, the Movie Review (MR) Dataset, and the Finegrained Sentiment Dataset (FSD). Our experimental analysis suggests that GANs can successfully learn representations of natural language texts at all three aforementioned levels.
      Citation: Algorithms
      PubDate: 2018-10-22
      DOI: 10.3390/a11100164
      Issue No: Vol. 11, No. 10 (2018)
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 54.163.22.209
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-