OpenRaiser/Intern-Atlas huggingface dataset:
Processor in Non-Volatile Memory (PiNVSM): Towards to Data-centric Computing in Decentralized Environment
Venue: arXiv cs.OS 2019
Year: 2019

The AI problem has no solution in the environment of existing hardware stack and OS architecture. CPU-centric model of computation has a huge number of drawbacks that originate from memory hierarchy and obsolete architecture of the computing core. The concept of mixing memory and logic has been around since 1960s. However, the concept of Processor-In-Memory (PIM) is unable to resolve the critical issues of the CPU-centric computing model because of inevitable replication of von Neumann architecture's drawbacks. The next generation of NVM/SCM memory is able to give the second birth to the data-centric computing paradigm. This paper presents a concept of Processor in Non-Volatile Memory (PiNVSM) architecture. The basis of PiNVSM architecture is the concept of DPU that contains the NVM memory and dedicated PU. All necessary PU's registers can be implemented in the space of NVM memory. NVM memory of DPU is the single space for storing and transformation of data. In the basis of PiNVSM architecture lies the DPU array is able to overcome the limitations as Turing machine model as von Neumann architecture. The DPU array hasn't a centralized computing core. Every data portion has dedicated computing core that excludes the necessity to transfer data to the place of data processing. Every DPU contains data portion that is associated with the set of keywords. Any complex data structure can be split on elementary items that can be stored into independent DPU with dedicated computing core(s). One DPU is able to apply the elementary transformation on one item. But the DPU array is able to make the transformation of complex structure by means of concurrent execution of elementary transformations in different DPUs. The PiNVSM architecture suggests a principally new architecture of the computing core that creates a new opportunity for data self-organization, data and code synthesis.
Neural-Network Optimized 1-bit Precoding for Massive MU-MIMO
Venue: arXiv cs.IT 2019
Year: 2019

Base station (BS) architectures for massive multi-user (MU) multiple-input multiple-output (MIMO) wireless systems are equipped with hundreds of antennas to serve tens of users on the same time-frequency channel. The immense number of BS antennas incurs high system costs, power, and interconnect bandwidth. To circumvent these obstacles, sophisticated MU precoding algorithms that enable the use of 1-bit DACs have been proposed. Many of these precoders feature parameters that are, traditionally, tuned manually to optimize their performance. We propose to use deep-learning tools to automatically tune such 1-bit precoders. Specifically, we optimize the biConvex 1-bit PrecOding (C2PO) algorithm using neural networks. Compared to the original C2PO algorithm, our neural-network optimized (NNO-)C2PO achieves the same error-rate performance at $\bf 2\boldsymbol\times$ lower complexity. Moreover, by training NNO-C2PO for different channel models, we show that 1-bit precoding can be made robust to vastly changing propagation conditions.
Optimizing Information Freshness in Broadcast Network with Unreliable Links and Random Arrivals: An Approximate Index Policy
Venue: arXiv cs.IT 2019
Year: 2019

With the rapid growth of real-time Internet of Things (IoT) applications, the need for fresh information has surged. Age of Information (AoI) is a tailor-made metric to characterize the information freshness perceived by the devices. In this paper, we investigate the problem of scheduling updates to minimize AoI in broadcast network. In this case, a central controller, e.g. a base station, collects status updates from different sources and schedules them to corresponding clients. Different from previous work, we consider both stochastic status updates and unreliable links. The problem is first modeled as an infinite horizon average constrained cost Markov decision problem (CMDP). With Lagrangian relaxation, an approximation of Whittle's index is derived and a scheduling policy is designed based on the approximate index. The results in previous work can be view as degenerate cases of the approximation index policy either with reliable links or periodic arrival constraints. Simulation results demonstrate the near-optimal performance of the proposed policy.
How Effectively Can Indoor Wireless Positioning Relieve Visual Tracking Pains: A Camera-Rao Bound Viewpoint
Venue: arXiv cs.CV 2019
Year: 2019

Visual tracking is fragile in some difficult scenarios, for instance, appearance ambiguity and variation, occlusion can easily degrade most of visual trackers to some extent. In this paper, visual tracking is empowered with wireless positioning to achieve high accuracy while maintaining robustness. Fundamentally different from the previous works, this study does not involve any specific wireless positioning algorithms. Instead, we use the confidence region derived from the wireless positioning Cramer-Rao bound (CRB) as the search region of visual trackers. The proposed framework is low-cost and very simple to implement, yet readily leads to enhanced and robustified visual tracking performance in difficult scenarios as corroborated by our experimental results. Most importantly, it is utmost valuable for the practioners to pre-evaluate how effectively can the wireless resources available at hand alleviate the visual tracking pains.
Two-Hop Walks Indicate PageRank Order
Venue: arXiv cs.LG 2019
Year: 2019

This paper shows that pairwise PageRank orders emerge from two-hop walks. The main tool used here refers to a specially designed sign-mirror function and a parameter curve, whose low-order derivative information implies pairwise PageRank orders with high probability. We study the pairwise correct rate by placing the Google matrix $\textbf{G}$ in a probabilistic framework, where $\textbf{G}$ may be equipped with different random ensembles for model-generated or real-world networks with sparse, small-world, scale-free features, the proof of which is mixed by mathematical and numerical evidence. We believe that the underlying spectral distribution of aforementioned networks is responsible for the high pairwise correct rate. Moreover, the perspective of this paper naturally leads to an $O(1)$ algorithm for any single pairwise PageRank comparison if assuming both $\textbf{A}=\textbf{G}-\textbf{I}_n$, where $\textbf{I}_n$ denotes the identity matrix of order $n$, and $\textbf{A}^2$ are ready on hand (e.g., constructed offline in an incremental manner), based on which it is easy to extract the top $k$ list in $O(kn)$, thus making it possible for PageRank algorithm to deal with super large-scale datasets in real time.
Machine Learning Based Prediction and Classification of Computational Jobs in Cloud Computing Centers
Venue: arXiv cs.LG 2019
Year: 2019

With the rapid growth of the data volume and the fast increasing of the computational model complexity in the scenario of cloud computing, it becomes an important topic that how to handle users' requests by scheduling computational jobs and assigning the resources in data center. In order to have a better perception of the computing jobs and their requests of resources, we analyze its characteristics and focus on the prediction and classification of the computing jobs with some machine learning approaches. Specifically, we apply LSTM neural network to predict the arrival of the jobs and the aggregated requests for computing resources. Then we evaluate it on Google Cluster dataset and it shows that the accuracy has been improved compared to the current existing methods. Additionally, to have a better understanding of the computing jobs, we use an unsupervised hierarchical clustering algorithm, BIRCH, to make classification and get some interpretability of our results in the computing centers.
A New Approach for Topic Detection using Adaptive Neural Networks
Venue: arXiv cs.IR 2019
Year: 2019

Topic detection becomes more important due to the increase of information electronically available and the necessity to process and filter it. In this context our master's thesis work was carried out, where we proposed to present a new approach to the detection of topics called ClusART. Thus, we proposed a three-phase approach, namely : a first phase during which lexical preprocessing was conducted. A second phase during which the construction and generation of vectors representing the documents was carried out. A third phase which is itself composed of two steps. In the first step we used the FuzzyART algorithm for the training phase. In the second step we used a classifier using Paragraph Vector for the test phase. The comparative study of our approach on the 20 Newsgroups dataset showed that our approach is able to detect almost relevant topics.
Quantifying Dynamic Leakage: Complexity Analysis and Model Counting-based Calculation
Venue: arXiv cs.CR 2019
Year: 2019

A program is non-interferent if it leaks no secret information to an observable output. However, non-interference is too strict in many practical cases and quantitative information flow (QIF) has been proposed and studied in depth. Originally, QIF is defined as the average of leakage amount of secret information over all executions of a program. However, a vulnerable program that has executions leaking the whole secret but has the small average leakage could be considered as secure. This counter-intuition raises a need for a new definition of information leakage of a particular run, i.e., dynamic leakage. As discussed in [5], entropy-based definitions do not work well for quantifying information leakage dynamically; Belief-based definition on the other hand is appropriate for deterministic programs, however, it is not appropriate for probabilistic ones. In this paper, we propose new simple notions of dynamic leakage based on entropy which are compatible with existing QIF definitions for deterministic programs, and yet reasonable for probabilistic programs in the sense of [5]. We also investigated the complexity of computing the proposed dynamic leakage for three classes of Boolean programs. We also implemented a tool for QIF calculation using model counting tools for Boolean formulae. Experimental results on popular benchmarks of QIF research show the flexibility of our framework. Finally, we discuss the improvement of performance and scalability of the proposed method as well as an extension to more general cases.
Realtime Rooftop Landing Site Identification and Selection in Urban City Simulation
Venue: arXiv cs.RO 2019
Year: 2019

Safe autonomous landing in urban cities is a necessity for the growing Unmanned Aircraft Systems (UAS) industry. In urgent situations, building rooftops, particularly flat rooftops, can provide local safe landing zones for small UAS. This paper investigates the real-time identification and selection of safe landing zones on rooftops based on LiDAR and camera sensor feedback. A visual high fidelity simulated city is constructed in the Unreal game engine, with particular attention paid to accurately generating rooftops and the common obstructions found thereon, e.g., ac units, water towers, air vents. AirSim, a robotic simulator plugin for Unreal, offers drone simulation and control and is capable of outputting video and LiDAR sensor data streams from the simulated Unreal world. A neural network is trained on randomized simulated cities to provide a pixel classification model. A novel algorithm is presented which finds the optimum obstacle-free landing position on nearby rooftops by fusing LiDAR and vision data.
On self-organised aggregation dynamics in swarms of robots with informed robots
Venue: arXiv cs.MA 2019
Year: 2019

In this paper, we use simulated swarms of robots to further explore the aggregation dynamics generated by these simple individual mechanisms. Our objective is to study the introduction of "informed robots", and to study how many of these are needed to direct the aggregation process toward a pre-defined site among those available in the environment. Informed robots are members of a group that selectively avoid the site/s where no aggregate should emerge, and stop only on the experimenter predefined site/s for aggregation. We study the aggregation process with informed robots in three different scenarios: two that are morphologically symmetric, whereby the different types of aggregation site are equally represented in the environment; and an asymmetric scenario, whereby the target site has an area that is half the area of the sites that should be avoided. We first show what happens when no robot in the swarm is informed: in symmetric environments, the swarm is able to break the symmetry and aggregates on one of the two types of site at random, not necessarily on the target site, while in the asymmetric environment, the swarm tends to aggregate on the sites that are most represented in terms of area. As a further valuable contribution of this study, we provide analytical results by studying a system of Ordinary Differential Equations' (ODEs) that is an extension of a well known model. Using this model, we show how, for certain values of the parameters, the model can predict the dynamics observed with simulated robots in one of the two symmetric scenarios.
A Genetic Programming System with an Epigenetic Mechanism for Traffic Signal Control
Venue: arXiv cs.NE 2019
Year: 2019

Traffic congestion is an increasing problem in most cities around the world. It impacts businesses as well as commuters, small cities and large ones in developing as well as developed economies. One approach to decrease urban traffic congestion is to optimize the traffic signal behaviour in order to be adaptive to changes in the traffic conditions. From the perspective of intelligent transportation systems, this optimization problem is called the traffic signal control problem and is considered a large combinatorial problem with high complexity and uncertainty. A novel approach to the traffic signal control problem is proposed in this thesis. The approach includes a new mechanism for Genetic Programming inspired by Epigenetics. Epigenetic mechanisms play an important role in biological processes such as phenotype differentiation, memory consolidation within generations and environmentally induced epigenetic modification of behaviour. These properties lead us to consider the implementation of epigenetic mechanisms as a way to improve the performance of Evolutionary Algorithms in solution to real-world problems with dynamic environmental changes, such as the traffic control signal problem. The epigenetic mechanism proposed was evaluated in four traffic scenarios with different properties and traffic conditions using two microscopic simulators. The results of these experiments indicate that Genetic Programming was able to generate competitive actuated traffic signal controllers for all the scenarios tested. Furthermore, the use of the epigenetic mechanism improved the performance of Genetic Programming in all the scenarios. The evolved controllers adapt to modifications in the traffic density and require less monitoring and less human interaction than other solutions because they dynamically adjust the signal behaviour depending on the local traffic conditions at each intersection.
Literal or Pedagogic Human? Analyzing Human Model Misspecification in Objective Learning
Venue: arXiv cs.AI 2019
Year: 2019

It is incredibly easy for a system designer to misspecify the objective for an autonomous system ("robot''), thus motivating the desire to have the robot learn the objective from human behavior instead. Recent work has suggested that people have an interest in the robot performing well, and will thus behave pedagogically, choosing actions that are informative to the robot. In turn, robots benefit from interpreting the behavior by accounting for this pedagogy. In this work, we focus on misspecification: we argue that robots might not know whether people are being pedagogic or literal and that it is important to ask which assumption is safer to make. We cast objective learning into the more general form of a common-payoff game between the robot and human, and prove that in any such game literal interpretation is more robust to misspecification. Experiments with human data support our theoretical results and point to the sensitivity of the pedagogic assumption.
Non-Negative Kernel Sparse Coding for the Classification of Motion Data
Venue: arXiv cs.LG 2019
Year: 2019

We are interested in the decomposition of motion data into a sparse linear combination of base functions which enable efficient data processing. We combine two prominent frameworks: dynamic time warping (DTW), which offers particularly successful pairwise motion data comparison, and sparse coding (SC), which enables an automatic decomposition of vectorial data into a sparse linear combination of base vectors. We enhance SC as follows: an efficient kernelization which extends its application domain to general similarity data such as offered by DTW, and its restriction to non-negative linear representations of signals and base vectors in order to guarantee a meaningful dictionary. Empirical evaluations on motion capture benchmarks show the effectiveness of our framework regarding interpretation and discrimination concerns.
A Hybrid GA-PSO Method for Evolving Architecture and Short Connections of Deep Convolutional Neural Networks
Venue: arXiv cs.CV 2019
Year: 2019

Image classification is a difficult machine learning task, where Convolutional Neural Networks (CNNs) have been applied for over 20 years in order to solve the problem. In recent years, instead of the traditional way of only connecting the current layer with its next layer, shortcut connections have been proposed to connect the current layer with its forward layers apart from its next layer, which has been proved to be able to facilitate the training process of deep CNNs. However, there are various ways to build the shortcut connections, it is hard to manually design the best shortcut connections when solving a particular problem, especially given the design of the network architecture is already very challenging. In this paper, a hybrid evolutionary computation (EC) method is proposed to \textit{automatically} evolve both the architecture of deep CNNs and the shortcut connections. Three major contributions of this work are: Firstly, a new encoding strategy is proposed to encode a CNN, where the architecture and the shortcut connections are encoded separately; Secondly, a hybrid two-level EC method, which combines particle swarm optimisation and genetic algorithms, is developed to search for the optimal CNNs; Lastly, an adjustable learning rate is introduced for the fitness evaluations, which provides a better learning rate for the training process given a fixed number of epochs. The proposed algorithm is evaluated on three widely used benchmark datasets of image classification and compared with 12 peer Non-EC based competitors and one EC based competitor. The experimental results demonstrate that the proposed method outperforms all of the peer competitors in terms of classification accuracy.
A Decision Support System for Multi-target Geosteering
Venue: arXiv cs.CE 2019
Year: 2019

Geosteering is a sequential decision process under uncertainty. The goal of geosteering is to maximize the expected value of the well, which should be defined by an objective value-function for each operation. In this paper we present a real-time decision support system (DSS) for geosteering that aims to approximate the uncertainty in the geological interpretation with an ensemble of geomodel realizations. As the drilling operation progresses, the ensemble Kalman filter is used to sequentially update the realizations using the measurements from real-time logging while drilling. At every decision point a discrete dynamic programming algorithm computes all potential well trajectories for the entire drilling operation and the corresponding value of the well for each realization. Then, the DSS considers all immediate alternatives (continue/steer/stop) and chooses the one that gives the best predicted value across the realizations. This approach works for a variety of objectives and constraints and suggests reproducible decisions under uncertainty. Moreover, it has real-time performance. The system is tested on synthetic cases in a layer-cake geological environment where the target layer should be selected dynamically based on the prior (pre-drill) model and the electromagnetic observations received while drilling. The numerical closed-loop simulation experiments demonstrate the ability of the DSS to perform successful geosteering and landing of a well for different geological configurations of drilling targets. Furthermore, the DSS allows to adjust and reweight the objectives, making the DSS useful before fully automated geosteering becomes reality.
Fall of Empires: Breaking Byzantine-tolerant SGD by Inner Product Manipulation
Venue: arXiv cs.LG 2019
Year: 2019

Recently, new defense techniques have been developed to tolerate Byzantine failures for distributed machine learning. The Byzantine model captures workers that behave arbitrarily, including malicious and compromised workers. In this paper, we break two prevailing Byzantine-tolerant techniques. Specifically we show robust aggregation methods for synchronous SGD -- coordinate-wise median and Krum -- can be broken using new attack strategies based on inner product manipulation. We prove our results theoretically, as well as show empirical validation.
Object recognition and tracking using Haar-like Features Cascade Classifiers: Application to a quad-rotor UAV
Venue: arXiv cs.RO 2019
Year: 2019

In this paper, we develop a functional Unmanned Aerial Vehicle (UAV), capable of tracking an object using a Machine Learning-like vision system called Haar feature-based cascade classifier. The image processing is made on-board with a high processor single-board computer. Based on the detected object and its position, the quadrotor must track it in order to be in a centered position and in a safe distance to it. The object in question is a human face; the experiments were conducted in a two-step detection, searching first for the upper-body and then searching for the face inside of the human body detected area. Once the human face is detected the quadrotor must follow it automatically. Experiments were conducted which shows the effectiveness of our mythology; these results are showing in a video.
Permissionless Blockchains and Secure Logging
Venue: arXiv cs.CR 2019
Year: 2019

The blockchain technology enables mutually untrusting participants to reach consensus on the state of a distributed and decentralized ledger (called a blockchain) in a permissionless setting. The consensus protocol of the blockchain imposes a unified view of the system state over the global network, and once a block is stable in the blockchain, its data is visible to all users and cannot be retrospectively modified or removed. Due to these properties, the blockchain technology is regarded as a general consensus infrastructure and based on which a variety of systems have been built. This article presents a study and survey of permissionless blockchain systems in the context of secure logging. We postulate the most essential properties required by a secure logging system and by considering a wide range of applications, we give insights into how the blockchain technology matches these requirements. Based on the survey, we motivate related research perspectives and challenges for blockchain-based secure logging systems, and we highlight potential solutions to some specific problems.
Knowledge compilation languages as proof systems
Venue: arXiv cs.CC 2019
Year: 2019

In this paper, we study proof systems in the sense of Cook-Reckhow for problems that are higher in the polynomial hierarchy than coNP, in particular, #SAT and maxSAT. We start by explaining how the notion of Cook-Reckhow proof systems can be apply to these problems and show how one can twist existing languages in knowledge compilation such as decision DNNF so that they can be seen as proof systems for problems such as #SAT and maxSAT.