OpenRaiser/Intern-Atlas huggingface dataset:
Scheduling Intelligent System for Time Shortening
Venue: arXiv cs.SE 2018
Year: 2018

The paper presents a scheduling intelligent system intended for the project management and for the operation management as well, having integrated a planner time buffer method combined with the PERT (Programme Evaluation and Review Technique) method which can drastically short the planned time. The system also adjusts if necessary the duration for the un-expecting situations during the evolution of the planner recalculating the probability to reach the deadline. The system is developed with a friendly graphical interface, which guide the user during the progress of the project providing warnings and suggestions for adjusting in real time the planner. Once the scheduling intelligent system is launched in progress, its functions are combined at the different levels, depending of the user needs. The base functions of the system are: planning, diagnosis, supervising and forecast. A real implementation is showed as a study case, is related to a software development planner.
An efficient and effective Decentralized Anonymous Voting System
Venue: arXiv cs.CR 2018
Year: 2018

A trusted electronic election system requires that all the involved information must go public, that is, it focuses not only on transparency but also privacy issues. In other words, each ballot should be counted anonymously, correctly, and efficiently. In this work, a lightweight E-voting system is proposed for voters to minimize their trust in the authority or government. We ensure the transparency of election by putting all message on the Ethereum blockchain, in the meantime, the privacy of individual voter is protected via an efficient and effective ring signature mechanism. Besides, the attractive self-tallying feature is also built in our system, which guarantees that everyone who can access the blockchain network is able to tally the result on his own, no third party is required after voting phase. More importantly, we ensure the correctness of voting results and keep the Ethereum gas cost of individual participant as low as possible, at the same time. Clearly, the pre-described characteristics make our system more suitable for large-scale election.
The Graph Exploration Problem with Advice
Venue: arXiv cs.CC 2018
Year: 2018

Moving an autonomous agent through an unknown environment is one of the crucial problems for robotics and network analysis. Therefore, it received a lot of attention in the last decades and was analyzed in many different settings. The graph exploration problem is a theoretical and abstract model, where an algorithm has to decide how the agent, also called explorer, moves through a network such that every point of interest is visited at least once. For its decisions, the knowledge of the algorithm is limited by the perception of the explorer. There are different models regarding the perception of the explorer. We look at the fixed graph scenario proposed by Kalyanasundaram and Pruhs (Proc. of ICALP, 1993), where the explorer starts at a vertex of the network and sees all reachable vertices, their unique names and their distance from the current position. Therefore, the algorithm recognizes already seen vertices and can adapt its strategy during exploring, because it does not forget anything. Because the algorithm only learns the structure of the graph during computation, it cannot deterministically compute an optimal tour that visits every vertex at least once without prior knowledge. Therefore, we are interested in the amount of crucial a-priori information needed to solve the problem optimally, which we measure in terms of the well-studied model of advice complexity. [..] We look at different variations of the graph exploration problem and distinguish between directed or undirected edges, cyclic or non-cyclic solutions, unit costs or individual costs for the edges and different amounts of a-priori structural knowledge of the explorer. [..] In this work, we present algorithms with an advice complexity of $\mathcal{O}(m+n)$, thus improving the classical bound for sparse graphs.
A General Account of Argumentation with Preferences
Venue: arXiv cs.AI 2018
Year: 2018

This paper builds on the recent ASPIC+ formalism, to develop a general framework for argumentation with preferences. We motivate a revised definition of conflict free sets of arguments, adapt ASPIC+ to accommodate a broader range of instantiating logics, and show that under some assumptions, the resulting framework satisfies key properties and rationality postulates. We then show that the generalised framework accommodates Tarskian logic instantiations extended with preferences, and then study instantiations of the framework by classical logic approaches to argumentation. We conclude by arguing that ASPIC+'s modelling of defeasible inference rules further testifies to the generality of the framework, and then examine and counter recent critiques of Dung's framework and its extensions to accommodate preferences.
A Parallel/Distributed Algorithmic Framework for Mining All Quantitative Association Rules
Venue: arXiv cs.AI 2018
Year: 2018

We present QARMA, an efficient novel parallel algorithm for mining all Quantitative Association Rules in large multidimensional datasets where items are required to have at least a single common attribute to be specified in the rules single consequent item. Given a minimum support level and a set of threshold criteria of interestingness measures such as confidence, conviction etc. our algorithm guarantees the generation of all non-dominated Quantitative Association Rules that meet the minimum support and interestingness requirements. Such rules can be of great importance to marketing departments seeking to optimize targeted campaigns, or general market segmentation. They can also be of value in medical applications, financial as well as predictive maintenance domains. We provide computational results showing the scalability of our algorithm, and its capability to produce all rules to be found in large scale synthetic and real world datasets such as Movie Lens, within a few seconds or minutes of computational time on commodity hardware.
Encoding Longer-term Contextual Multi-modal Information in a Predictive Coding Model
Venue: arXiv cs.AI 2018
Year: 2018

Studies suggest that within the hierarchical architecture, the topological higher level possibly represents a conscious category of the current sensory events with slower changing activities. They attempt to predict the activities on the lower level by relaying the predicted information. On the other hand, the incoming sensory information corrects such prediction of the events on the higher level by the novel or surprising signal. We propose a predictive hierarchical artificial neural network model that examines this hypothesis on neurorobotic platforms, based on the AFA-PredNet model. In this neural network model, there are different temporal scales of predictions exist on different levels of the hierarchical predictive coding, which are defined in the temporal parameters in the neurons. Also, both the fast and the slow-changing neural activities are modulated by the active motor activities. A neurorobotic experiment based on the architecture was also conducted based on the data collected from the VRep simulator.
Improving Long-Horizon Forecasts with Expectation-Biased LSTM Networks
Venue: arXiv cs.LG 2018
Year: 2018

State-of-the-art forecasting methods using Recurrent Neural Net- works (RNN) based on Long-Short Term Memory (LSTM) cells have shown exceptional performance targeting short-horizon forecasts, e.g given a set of predictor features, forecast a target value for the next few time steps in the future. However, in many applica- tions, the performance of these methods decays as the forecasting horizon extends beyond these few time steps. This paper aims to explore the challenges of long-horizon forecasting using LSTM networks. Here, we illustrate the long-horizon forecasting problem in datasets from neuroscience and energy supply management. We then propose expectation-biasing, an approach motivated by the literature of Dynamic Belief Networks, as a solution to improve long-horizon forecasting using LSTMs. We propose two LSTM ar- chitectures along with two methods for expectation biasing that significantly outperforms standard practice.
Modeling and Characterization of Cohesion in Fine Metal Powders with a Focus on Additive Manufacturing Process Simulations
Venue: arXiv cs.CE 2018
Year: 2018

The cohesive interactions between fine metal powder particles crucially influence their flow behavior, which is in turn important to many powder-based manufacturing processes including emerging methods for powder-based metal additive manufacturing (AM). The present work proposes a novel modeling and characterization approach for micron-scale metal powders, with a special focus on characteristics of importance to powder-bed AM. The model is based on the discrete element method (DEM), and the considered particle-to-particle and particle-to-wall interactions involve frictional contact, rolling resistance and cohesive forces. Special emphasis lies on the modeling of cohesion. The proposed adhesion force law is defined by the pull-off force resulting from the surface energy of powder particles in combination with a van-der-Waals force curve regularization. The model is applied to predict the angle of repose (AOR) of exemplary spherical Ti-6Al-4V powders, and the surface energy value underlying the adhesion force law is calibrated by fitting the corresponding angle of repose values from numerical and experimental funnel tests. To the best of the authors' knowledge, this is the first work providing an experimental estimate for the effective surface energy of the considered class of metal powders. By this approach, an effective surface energy of $0.1mJ/m^2$ is found for the investigated Ti-6Al-4V powder. This value is considerably lower than typical experimental values for flat metal contact surfaces in the range of $30-50 mJ/m^2$, indicating the crucial influence of factors such as surface roughness and chemical surface contamination on fine metal powders. More importantly, the present study demonstrates that a neglect of the related cohesive forces leads to a drastical underestimation of the AOR and, consequently, to an insufficient representation of the bulk powder behavior.
Provable Emergent Pattern Formation by a Swarm of Anonymous, Homogeneous, Non-Communicating, Reactive Robots with Limited Relative Sensing and no Global Knowledge or Positioning
Venue: arXiv cs.RO 2018
Year: 2018

In this work, we explore emergent behaviors by swarms of anonymous, homogeneous, non-communicating, reactive robots that do not know their global position and have limited relative sensing. We introduce a novel method that enables such severely limited robots to autonomously arrange in a desired pattern and maintain it. The method includes an automatic proof procedure to check whether a given pattern will be achieved by the swarm from any initial configuration. An attractive feature of this proof procedure is that it is local in nature, avoiding as much as possible the computational explosion that can be expected with increasing robots, states, and action possibilities. Our approach is based on extracting the local states that constitute a global goal (in this case, a pattern). We then formally show that these local states can only coexist when the global desired pattern is achieved and that, until this occurs, there is always a sequence of actions that will lead from the current pattern to the desired pattern. Furthermore, we show that the agents will never perform actions that could a) lead to intra-swarm collisions or b) cause the swarm to separate. After an analysis of the performance of pattern formation in the discrete domain, we also test the system in continuous time and space simulations and reproduce the results using asynchronous agents operating in unbounded space. The agents successfully form the desired patterns while avoiding collisions and separation.
Delayed Blockchain Protocols
Venue: arXiv cs.GT 2018
Year: 2018

Given the parallels between game theory and consensus, it makes sense to intelligently design blockchain or DAG protocols with an incentive-compatible-first mentality. To that end, we propose a new blockchain or DAG protocol enhancement based on delayed rewards. We devise a new method for imposing slashing conditions on miner behavior, using their delayed rewards as stake in a Proof of Work system. Using fraud proofs, we can slash malicious miner behavior and reward long-lived, honest behavior.
A Study on Overfitting in Deep Reinforcement Learning
Venue: arXiv cs.LG 2018
Year: 2018

Recent years have witnessed significant progresses in deep Reinforcement Learning (RL). Empowered with large scale neural networks, carefully designed architectures, novel training algorithms and massively parallel computing devices, researchers are able to attack many challenging RL problems. However, in machine learning, more training power comes with a potential risk of more overfitting. As deep RL techniques are being applied to critical problems such as healthcare and finance, it is important to understand the generalization behaviors of the trained agents. In this paper, we conduct a systematic study of standard RL agents and find that they could overfit in various ways. Moreover, overfitting could happen "robustly": commonly used techniques in RL that add stochasticity do not necessarily prevent or detect overfitting. In particular, the same agents and learning algorithms could have drastically different test performance, even when all of them achieve optimal rewards during training. The observations call for more principled and careful evaluation protocols in RL. We conclude with a general discussion on overfitting in RL and a study of the generalization behaviors from the perspective of inductive bias.
A Comparative Study on Exact Triangle Counting Algorithms on the GPU
Venue: arXiv cs.DC 2018
Year: 2018

We implement exact triangle counting in graphs on the GPU using three different methodologies: subgraph matching to a triangle pattern; programmable graph analytics, with a set-intersection approach; and a matrix formulation based on sparse matrix-matrix multiplies. All three deliver best-of-class performance over CPU implementations and over comparable GPU implementations, with the graph-analytic approach achieving the best performance due to its ability to exploit efficient filtering steps to remove unnecessary work and its high-performance set-intersection core.
Hearts and Politics: Metrics for Tracking Biorhythm Changes during Brexit and Trump
Venue: arXiv cs.CY 2018
Year: 2018

Our internal experience of time reflects what is going in the world around us. Our body's natural rhythms get disrupted for a variety of external factors, including exposure to collective events. We collect readings of steps, sleep, and heart rates from 11K users of health tracking devices in London and San Francisco. We introduce measures to quantify changes in not only volume of these three bio-signals (as previous research has done) but also synchronicity and periodicity, and we empirically assess how strong those variations are, compared to random expectation, during four major events: Christmas, New Year's Eve, Brexit, and the US presidential election of 2016 (Donald Trump's election). While Christmas and New Year's eve are associated with short-term effects, Brexit and Trump's election are associated with longer-term disruptions. Our results promise to inform the design of new ways of monitoring population health at scale.
On the design of a decision engine for connected vehicles with an application to congestion management
Venue: arXiv cs.SY 2018
Year: 2018

Vehicles are becoming connected entities. As a result, a likely scenario is that such entities might be literally bombarded with information from a multitude of devices. In this context, a key challenging requirement for both connected and autonomous vehicles is that they will need to become cognitive bodies, able to parse information and use only the pieces of information that are relevant to the vehicle in the context of a given journey. In order to address this fundamental requirement, a decision engine is presented in this paper. The engine makes it possible for the vehicle to understand which pieces of information are really relevant, and subsequently to process only those pieces of information. In order to illustrate the key features of our system, we show that it is possible to build upon the engine to develop a distributed traffic management system, and then we validate such a system via both conventional (numerical and SUMO-based) simulations and a Hardware-in-the-Loop (HIL) platform. Both the conventional simulations and the HIL validation showed that the engine can be effectively used to design a distributed traffic management system.
GNAS: A Greedy Neural Architecture Search Method for Multi-Attribute Learning
Venue: arXiv cs.NE 2018
Year: 2018

A key problem in deep multi-attribute learning is to effectively discover the inter-attribute correlation structures. Typically, the conventional deep multi-attribute learning approaches follow the pipeline of manually designing the network architectures based on task-specific expertise prior knowledge and careful network tunings, leading to the inflexibility for various complicated scenarios in practice. Motivated by addressing this problem, we propose an efficient greedy neural architecture search approach (GNAS) to automatically discover the optimal tree-like deep architecture for multi-attribute learning. In a greedy manner, GNAS divides the optimization of global architecture into the optimizations of individual connections step by step. By iteratively updating the local architectures, the global tree-like architecture gets converged where the bottom layers are shared across relevant attributes and the branches in top layers more encode attribute-specific features. Experiments on three benchmark multi-attribute datasets show the effectiveness and compactness of neural architectures derived by GNAS, and also demonstrate the efficiency of GNAS in searching neural architectures.
Infrared and Visible Image Fusion using a Deep Learning Framework
Venue: arXiv cs.CV 2018
Year: 2018

In recent years, deep learning has become a very active research tool which is used in many image processing fields. In this paper, we propose an effective image fusion method using a deep learning framework to generate a single image which contains all the features from infrared and visible images. First, the source images are decomposed into base parts and detail content. Then the base parts are fused by weighted-averaging. For the detail content, we use a deep learning network to extract multi-layer features. Using these features, we use l_1-norm and weighted-average strategy to generate several candidates of the fused detail content. Once we get these candidates, the max selection strategy is used to get final fused detail content. Finally, the fused image will be reconstructed by combining the fused base part and detail content. The experimental results demonstrate that our proposed method achieves state-of-the-art performance in both objective assessment and visual quality. The Code of our fusion method is available at https://github.com/hli1221/imagefusion_deeplearning
Large Margin Structured Convolution Operator for Thermal Infrared Object Tracking
Venue: arXiv cs.CV 2018
Year: 2018

Compared with visible object tracking, thermal infrared (TIR) object tracking can track an arbitrary target in total darkness since it cannot be influenced by illumination variations. However, there are many unwanted attributes that constrain the potentials of TIR tracking, such as the absence of visual color patterns and low resolutions. Recently, structured output support vector machine (SOSVM) and discriminative correlation filter (DCF) have been successfully applied to visible object tracking, respectively. Motivated by these, in this paper, we propose a large margin structured convolution operator (LMSCO) to achieve efficient TIR object tracking. To improve the tracking performance, we employ the spatial regularization and implicit interpolation to obtain continuous deep feature maps, including deep appearance features and deep motion features, of the TIR targets. Finally, a collaborative optimization strategy is exploited to significantly update the operators. Our approach not only inherits the advantage of the strong discriminative capability of SOSVM but also achieves accurate and robust tracking with higher-dimensional features and more dense samples. To the best of our knowledge, we are the first to incorporate the advantages of DCF and SOSVM for TIR object tracking. Comprehensive evaluations on two thermal infrared tracking benchmarks, i.e. VOT-TIR2015 and VOT-TIR2016, clearly demonstrate that our LMSCO tracker achieves impressive results and outperforms most state-of-the-art trackers in terms of accuracy and robustness with sufficient frame rate.
To Find Where You Talk: Temporal Sentence Localization in Video with Attention Based Location Regression
Venue: arXiv cs.CV 2018
Year: 2018

Given an untrimmed video and a sentence description, temporal sentence localization aims to automatically determine the start and end points of the described sentence within the video. The problem is challenging as it needs the understanding of both video and sentence. Existing research predominantly employs a costly "scan and localize" framework, neglecting the global video context and the specific details within sentences which play as critical issues for this problem. In this paper, we propose a novel Attention Based Location Regression (ABLR) approach to solve the temporal sentence localization from a global perspective. Specifically, to preserve the context information, ABLR first encodes both video and sentence via Bidirectional LSTM networks. Then, a multi-modal co-attention mechanism is introduced to generate not only video attention which reflects the global video structure, but also sentence attention which highlights the crucial details for temporal localization. Finally, a novel attention based location regression network is designed to predict the temporal coordinates of sentence query from the previous attention. ABLR is jointly trained in an end-to-end manner. Comprehensive experiments on ActivityNet Captions and TACoS datasets demonstrate both the effectiveness and the efficiency of the proposed ABLR approach.
Comparison of several data-driven nonlinear system identification methods on a simplified glucoregulatory system example
Venue: arXiv cs.SY 2018
Year: 2018

In this paper, several advanced data-driven nonlinear identification techniques are compared on a specific problem: a simplified glucoregulatory system modeling example. This problem represents a challenge in the development of an artificial pancreas for T1DM treatment, since for this application good nonlinear models are needed to design accurate closed-loop controllers to regulate the glucose level in the blood. Block-oriented as well as state-space models are used to describe both the dynamics and the nonlinear behavior of the insulin-glucose system, and the advantages and drawbacks of each method are pointed out. The obtained nonlinear models are accurate in simulating the patient's behavior, and some of them are also sufficiently simple to be considered in the implementation of a model-based controller to develop the artificial pancreas.