Continuous-Time Prediction of Industrial Paste Thickener System With Differential ODE-Net

It is crucial to predict the outputs of a thickening system,including the underflow concentration(UC)and mud pressure,for optimal control of the process.The proliferation of industrial sensors and the availability of thickening-system data make this possible.However,the unique properties of thickening systems,such as the non-linearities,long-time delays,partially observed data,and continuous time evolution pose challenges on building data-driven predictive models.To address the above challenges,we establish an integrated,deep-learning,continuous time network structure that consists of a sequential encoder,a state decoder,and a derivative module to learn the deterministic state space model from thickening systems.Using a case study,we examine our methods with a tailing thickener manufactured by the FLSmidth installed with massive sensors and obtain extensive experimental results.The results demonstrate that the proposed continuous-time model with the sequential encoder achieves better prediction performances than the existing discrete-time models and reduces the negative effects from long time delays by extracting features from historical system trajectories.The proposed method also demonstrates outstanding performances for both short and long term prediction tasks with the two proposed derivative types.

Multi Agent Systems for Fault States Diagnostics and Equipment and Process Management of Yogurt Ripening Tank

It is impossible to plan in advance unpredictable phenomena at monitoring, diagnosis and control of industrial batch and continuous equipment and processes such as chemical composition of the raw materials, the process leads to unexpected reactions and changes its parameters, etc. The agent is active, a program entity, has its own ideas how to perform the tasks of the own agenda. Agents perceive, behave ＂reasonably＂, communicate with other agents. Agents can represent equipment and operations in batch processes as recommended by the ISA $88. Jadex system is based on Java language and on FIPA org. recommendations. The description of ripening tank T406 and recipe for yogurt production in the holding of MADETA Corp. in the Czech Rep. It is described modeling and displaying of＂normal＂ and error, fault unit state of the ripening tank. Agents are within the Jadex system and describing the behavior of ripening tank T406 with state diagrams-automata and assist in diagnosing of fault states. States are described in XML language-SCXML （State Charts XML）. Jadex Control Center-JCC represents a major access point to use for operating in real time.

Edge Computing

Edge computing refers to the computing paradigm in which the processing power, communication capabilities and intelligence are pushed down to the edge of the networking system like gateways and devices, where the data originates. In doing so, edge computing enables an infrastructure for processing the data directly from devices with low latency, battery consumption and bandwidth cost. With opportunities for research and advanced applications such as augmented reality and wearable cognitive assistance come new challenges. This special issue reports the current re? search on various topics related to edge computing, addressing the challenges in the enabling technologies and practical implementations.

Graph Regularized L_p Smooth Non-negative Matrix Factorization for Data Representation

This paper proposes a Graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information of a data set and produces smooth and stable solutions. The main contributions are as follows: first, graph regularization is added into NMF to discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. Second,the Lpsmoothing constraint is incorporated into NMF to combine the merits of isotropic(L_2-norm) and anisotropic(L_1-norm)diffusion smoothing, and produces a smooth and more accurate solution to the optimization problem. Finally, the update rules and proof of convergence of GSNMF are given. Experiments on several data sets show that the proposed method outperforms related state-of-the-art methods.

Total Variation Constrained Non-Negative Matrix Factorization for Medical Image Registration

This paper presents a novel medical image registration algorithm named total variation constrained graphregularization for non-negative matrix factorization(TV-GNMF).The method utilizes non-negative matrix factorization by total variation constraint and graph regularization.The main contributions of our work are the following.First,total variation is incorporated into NMF to control the diffusion speed.The purpose is to denoise in smooth regions and preserve features or details of the data in edge regions by using a diffusion coefficient based on gradient information.Second,we add graph regularization into NMF to reveal intrinsic geometry and structure information of features to enhance the discrimination power.Third,the multiplicative update rules and proof of convergence of the TV-GNMF algorithm are given.Experiments conducted on datasets show that the proposed TV-GNMF method outperforms other state-of-the-art algorithms.

Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization

Large-scale multi-objective optimization problems(LSMOPs)pose challenges to existing optimizers since a set of well-converged and diverse solutions should be found in huge search spaces.While evolutionary algorithms are good at solving small-scale multi-objective optimization problems,they are criticized for low efficiency in converging to the optimums of LSMOPs.By contrast,mathematical programming methods offer fast convergence speed on large-scale single-objective optimization problems,but they have difficulties in finding diverse solutions for LSMOPs.Currently,how to integrate evolutionary algorithms with mathematical programming methods to solve LSMOPs remains unexplored.In this paper,a hybrid algorithm is tailored for LSMOPs by coupling differential evolution and a conjugate gradient method.On the one hand,conjugate gradients and differential evolution are used to update different decision variables of a set of solutions,where the former drives the solutions to quickly converge towards the Pareto front and the latter promotes the diversity of the solutions to cover the whole Pareto front.On the other hand,objective decomposition strategy of evolutionary multi-objective optimization is used to differentiate the conjugate gradients of solutions,and the line search strategy of mathematical programming is used to ensure the higher quality of each offspring than its parent.In comparison with state-of-the-art evolutionary algorithms,mathematical programming methods,and hybrid algorithms,the proposed algorithm exhibits better convergence and diversity performance on a variety of benchmark and real-world LSMOPs.

Network Motif Detection: Algorithms, Parallel and Cloud Computing,and Related Tools

Network motif is defined as a frequent and unique subgraph pattern in a network, and the search involves counting all the possible instances or listing all patterns, testing isomorphism known as NP-hard and large amounts of repeated processes for statistical evaluation. Although many efficient algorithms have been introduced, exhaustive search methods are still infeasible and feasible approximation methods are yet implausible.Additionally, the fast and continual growth of biological networks makes the problem more challenging. As a consequence, parallel algorithms have been developed and distributed computing has been tested in the cloud computing environment as well. In this paper, we survey current algorithms for network motif detection and existing software tools. Then, we show that some methods have been utilized for parallel network motif search algorithms with static or dynamic load balancing techniques. With the advent of cloud computing services, network motif search has been implemented with MapReduce in Hadoop Distributed File System（HDFS）, and with Storm, but without statistical testing. In this paper, we survey network motif search algorithms in general, including existing parallel methods as well as cloud computing based search, and show the promising potentials for the cloud computing based motif search methods.

Energy inefficiency diagnosis for Android applications: a literature review

Android applications are becoming increasingly powerful in recent years. While their functionality is still of paramount importance to users, the energy efficiency of these applications is also gaining more and more attention. Researchers have discovered various types of energy defects in Android applications, which could quickly drain the battery power of mobile devices. Such defects not only cause inconvenience to users, but also frustrate Android developers as diagnosing the energy inefficiency of a software product is a non-trivial task. In this work, we perform a literature review to understand the state of the art of energy inefficiency diagnosis for Android applications. We identified 55 research papers published in recent years and classified existing studies from four different perspectives, including power estimation method, hardware component, types of energy defects, and program analysis approach. We also did a cross-perspective analysis to summarize and compare our studied techniques. We hope that our review can help structure and unify the literature and shed light on future research, as well as drawing developers' attention to build energy-efficient Android applications.