OpenRaiser/Intern-Atlas huggingface dataset:
A Novel Approach for Protection of Accounts' Names against Hackers Combining Cluster Analysis and Chaotic Theory
Venue: arXiv cs.CR 2019
Year: 2019

The last years of the 20 th century and the beginning of the 21 th mark the facilitation trend of our real life due to the big development and progress of the computers and other intelligent devices. Algorithms based on artificial intelligence are basically a part of the software. The transmitted information by Internet or LAN arises continuously and it is expected that the protection of the data has been ensured. The aim of the present paper is to reveal false names of users' accounts as a result of hackers' attacks. The probability a given account to be either false or actual is calculated using a novel approach combining machine learning analysis (especially clusters' analysis) with chaos theory. The suspected account will be used as a pattern and by classification techniques clusters will be formed with a respective probability this name to be false. This investigation puts two main purposes: First, to determine if there exists a trend of appearance of the similar usernames, which arises during the creation of new accounts. Second, to detect the false usernames and to discriminate those from the real ones, independently of that if two types of accounts are generated with the same speed. These security systems are applied in different areas, where the security of the data in users' accounts is strictly required. For example, they can be used in on-line voting for balloting, in studying the social opinion by inquiries, in protection of the information in different user accounts of given system etc.
Detecting drug-drug interactions using artificial neural networks and classic graph similarity measures
Venue: arXiv cs.LG 2019
Year: 2019

Drug-drug interactions are preventable causes of medical injuries and often result in doctor and emergency room visits. Computational techniques can be used to predict potential drug-drug interactions. We approach the drug-drug interaction prediction problem as a link prediction problem and present two novel methods for drug-drug interaction prediction based on artificial neural networks and factor propagation over graph nodes: adjacency matrix factorization (AMF) and adjacency matrix factorization with propagation (AMFP). We conduct a retrospective analysis by training our models on a previous release of the DrugBank database with 1,141 drugs and 45,296 drug-drug interactions and evaluate the results on a later version of DrugBank with 1,440 drugs and 248,146 drug-drug interactions. Additionally, we perform a holdout analysis using DrugBank. We report an area under the receiver operating characteristic curve score of 0.807 and 0.990 for the retrospective and holdout analyses respectively. Finally, we create an ensemble-based classifier using AMF, AMFP, and existing link prediction methods and obtain an area under the receiver operating characteristic curve of 0.814 and 0.991 for the retrospective and the holdout analyses. We demonstrate that AMF and AMFP provide state of the art results compared to existing methods and that the ensemble-based classifier improves the performance by combining various predictors. These results suggest that AMF, AMFP, and the proposed ensemble-based classifier can provide important information during drug development and regarding drug prescription given only partial or noisy data. These methods can also be used to solve other link prediction problems. Drug embeddings (compressed representations) created when training our models using the interaction network have been made public.
Challenges in Search on Streaming Services: Netflix Case Study
Venue: arXiv cs.IR 2019
Year: 2019

We discuss salient challenges of building a search experience for a streaming media service such as Netflix. We provide an overview of the role of recommendations within the search context to aid content discovery and support searches for unavailable (out-of-catalog) entities. We also stress the importance of keystroke-level instant search experience, and the technical challenges associated with implementing it across different devices and languages for a global audience.
Bit-Interleaved Coded Multiple Beamforming in Millimeter-Wave Massive MIMO Systems
Venue: arXiv cs.IT 2019
Year: 2019

In this paper we carry out the asymptotic diversity analysis for millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) systems by using bit interleaved coded multiple beamforming (BICMB). First, a single-user mmWave system which employs $M_t$ antenna subarrays at the transmitter and $M_r$ antenna subarrays at the receiver is studied. Each antenna subarray in the transmitter and the receiver has $N_r$ and $N_t$ antennas, respectively. We establish a theorem for the diversity gain when the number of antennas in each remote antenna unit (RAU) goes to infinity. Based on the theorem, the distributed system with BICMB achieves full spatial multiplexing of $L_t=\sum_{i,j}L_{ij}$ and full spatial diversity of $\frac{\left(\sum_{i,j}β_{ij}\right)^2}{\sum_{i,j}β_{ij}^2L_{ij}^{-1}}$ where $L_{ij}$ is the number of propagation paths and $β_{ij}$ is the large scale fading coefficient between the $i$th RAU in the transmitter and the $j$th RAU in the receiver. This result shows that one can increase the diversity gain in the system by increasing the number of RAUs. Simulation results show that, when the perfect channel state information assumption is satisfied, the use of BICMB increases the diversity gain in the system.
Control Barrier Functions for Systems with High Relative Degree
Venue: arXiv cs.SY 2019
Year: 2019

This paper extends control barrier functions (CBFs) to high order control barrier functions (HOCBFs) that can be used for high relative degree constraints. The proposed HOCBFs are more general than recently proposed (exponential) HOCBFs. We introduce high order barrier functions (HOBF), and show that their satisfaction of Lyapunov-like conditions implies the forward invariance of the intersection of a series of sets. We then introduce HOCBF, and show that any control input that satisfies the HOCBF constraints renders the intersection of a series of sets forward invariant. We formulate optimal control problems with constraints given by HOCBF and control Lyapunov functions (CLF) and analyze the influence of the choice of the class $\mathcal{K}$ functions used in the definition of the HOCBF on the size of the feasible control region. We also provide a promising method to address the conflict between HOCBF constraints and control limitations by penalizing the class $\mathcal{K}$ functions. We illustrate the proposed method on an adaptive cruise control problem.
Suite of Meshless Algorithms for Accurate Computation of Soft Tissue Deformation for Surgical Simulation
Venue: arXiv cs.CE 2019
Year: 2019

The ability to predict patient-specific soft tissue deformations is key for computer-integrated surgery systems and the core enabling technology for a new era of personalized medicine. Element-Free Galerkin (EFG) methods are better suited for solving soft tissue deformation problems than the finite element method (FEM) due to their capability of handling large deformation while also eliminating the necessity of creating a complex predefined mesh. Nevertheless, meshless methods based on EFG formulation, exhibit three major limitations: i) meshless shape functions using higher order basis cannot always be computed for arbitrarily distributed nodes (irregular node placement is crucial for facilitating automated discretization of complex geometries); ii) imposition of the Essential Boundary Conditions (EBC) is not straightforward; and, iii) numerical (Gauss) integration in space is not exact as meshless shape functions are not polynomial. This paper presents a suite of Meshless Total Lagrangian Explicit Dynamics (MTLED) algorithms incorporating a Modified Moving Least Squares (MMLS) method for interpolating scattered data both for visualization and for numerical computations of soft tissue deformation, a novel way of imposing EBC for explicit time integration, and an adaptive numerical integration procedure within the Meshless Total Lagrangian Explicit Dynamics algorithm. The appropriateness and effectiveness of the proposed methods is demonstrated using comparisons with the established non-linear procedures from commercial finite element software ABAQUS and experiments with very large deformations. To demonstrate the translational benefits of MTLED we also present a realistic brain-shift computation.
Semi-Supervised Self-Taught Deep Learning for Finger Bones Segmentation
Venue: arXiv cs.CV 2019
Year: 2019

Segmentation stands at the forefront of many high-level vision tasks. In this study, we focus on segmenting finger bones within a newly introduced semi-supervised self-taught deep learning framework which consists of a student network and a stand-alone teacher module. The whole system is boosted in a life-long learning manner wherein each step the teacher module provides a refinement for the student network to learn with newly unlabeled data. Experimental results demonstrate the superiority of the proposed method over conventional supervised deep learning methods.
Few-Shot and Zero-Shot Learning for Historical Text Normalization
Venue: arXiv cs.CL 2019
Year: 2019

Historical text normalization often relies on small training datasets. Recent work has shown that multi-task learning can lead to significant improvements by exploiting synergies with related datasets, but there has been no systematic study of different multi-task learning architectures. This paper evaluates 63~multi-task learning configurations for sequence-to-sequence-based historical text normalization across ten datasets from eight languages, using autoencoding, grapheme-to-phoneme mapping, and lemmatization as auxiliary tasks. We observe consistent, significant improvements across languages when training data for the target task is limited, but minimal or no improvements when training data is abundant. We also show that zero-shot learning outperforms the simple, but relatively strong, identity baseline.
Haptic User Interfaces and Practice-based Learning for Minimally Invasive Surgical Training
Venue: arXiv cs.HC 2019
Year: 2019

Recent advances in haptic hardware and software technology have generated interest in novel, multimodal interfaces based on the sense of touch. Such interfaces have the potential to revolutionize the way we think about human computer interaction and open new possibilities for simulation and training in a variety of fields. In this paper we review several frameworks, APIs and toolkits for haptic user interface development. We explore these software components focusing on minimally invasive surgical simulation systems. In the area of medical diagnosis, there is a strong need to determine mechanical properties of biological tissue for both histological and pathological considerations. Therefore we focus on the development of affordable visuo-haptic simulators to improve practice-based education in this area. We envision such systems, designed for the next generations of learners that enhance their knowledge in connection with real-life situations while they train in mandatory safety conditions.
Observer-Based Drag-Tracking Guidance for Entry Vehicles Considering Input Saturation Constraint
Venue: arXiv cs.SY 2019
Year: 2019

This paper studies the drag-tracking guidance design problem of uncertain entry vehicles. With employing a Nussbaum type function to deal with input saturation constraint, an output feedback guidance law (bank angle magnitude) with a high-gain observer is constructed that makes the drag-tracking error converge near zero in the presence of uncertainties. It is also worthy to claim that, in contrast to the existing results whose envelope of uncertainty merely depends on the drag error, the considered uncertainty is allowed to be not bigger than a function of drag error and integral term of drag error, which inevitably occurs in practice. The Monte Carlo simulation is done to illustrate the advantage of the developed method.
Real-Time Boiler Control Optimization with Machine Learning
Venue: arXiv cs.SY 2019
Year: 2019

In coal-fired power plants, it is critical to improve the operational efficiency of boilers for sustainability. In this work, we formulate real-time boiler control as an optimization problem that looks for the best distribution of temperature in different zones and oxygen content from the flue to improve the boiler's stability and energy efficiency. We employ an efficient algorithm by integrating appropriate machine learning and optimization techniques. We obtain a large dataset collected from a real boiler for more than two months from our industry partner, and conduct extensive experiments to demonstrate the effectiveness and efficiency of the proposed algorithm.
New Dependencies of Hierarchies in Polynomial Optimization
Venue: arXiv cs.DS 2019
Year: 2019

We compare four key hierarchies for solving Constrained Polynomial Optimization Problems (CPOP): Sum of Squares (SOS), Sum of Diagonally Dominant Polynomials (SDSOS), Sum of Nonnegative Circuits (SONC), and the Sherali Adams (SA) hierarchies. We prove a collection of dependencies among these hierarchies both for general CPOPs and for optimization problems on the Boolean hypercube. Key results include for the general case that the SONC and SOS hierarchy are polynomially incomparable, while SDSOS is contained in SONC. A direct consequence is the non-existence of a Putinar-like Positivstellensatz for SDSOS. On the Boolean hypercube, we show as a main result that Schmüdgen-like versions of the hierarchies SDSOS*, SONC*, and SA* are polynomially equivalent. Moreover, we show that SA* is contained in any Schmüdgen-like hierarchy that provides a O(n) degree bound.
Generating Compact Geometric Track-Maps for Train Positioning Applications
Venue: arXiv cs.LG 2019
Year: 2019

In this paper, we present a method to generate compact geometric track-maps for train-borne localization applications. Therefore, we first give a brief overview on the purpose of track maps in train-positioning applications. It becomes apparent that there are hardly any adequate methods to generate suitable geometric track-maps. This is why we present a novel map generation procedure. It uses an optimization formulation to find the continuous sequence of track geometries that fits the available measurement data best. The optimization is initialized with the results from a localization filter developed in our previous work. The localization filter also provides the required information for shape identification and measurement association. The presented approach will be evaluated on simulated data as well as on real measurements.
Age of Information in a Multiple Access Channel with Heterogeneous Traffic and an Energy Harvesting Node
Venue: arXiv cs.IT 2019
Year: 2019

Age of Information (AoI) is a newly appeared concept and metric to characterize the freshness of data. In this work, we study the delay and AoI in a multiple access channel (MAC) with two source nodes transmitting different types of data to a common destination. The first node is grid-connected and its data packets arrive in a bursty manner, and at each time slot it transmits one packet with some probability. Another energy harvesting (EH) sensor node generates a new status update with a certain probability whenever it is charged. We derive the delay of the grid-connected node and the AoI of the EH sensor as functions of different parameters in the system. The results show that the mutual interference has a non-trivial impact on the delay and age performance of the two nodes.
Simple Physical Adversarial Examples against End-to-End Autonomous Driving Models
Venue: arXiv cs.RO 2019
Year: 2019

Recent advances in machine learning, especially techniques such as deep neural networks, are promoting a range of high-stakes applications, including autonomous driving, which often relies on deep learning for perception. While deep learning for perception has been shown to be vulnerable to a host of subtle adversarial manipulations of images, end-to-end demonstrations of successful attacks, which manipulate the physical environment and result in physical consequences, are scarce. Moreover, attacks typically involve carefully constructed adversarial examples at the level of pixels. We demonstrate the first end-to-end attacks on autonomous driving in simulation, using simple physically realizable attacks: the painting of black lines on the road. These attacks target deep neural network models for end-to-end autonomous driving control. A systematic investigation shows that such attacks are surprisingly easy to engineer, and we describe scenarios (e.g., right turns) in which they are highly effective, and others that are less vulnerable (e.g., driving straight). Further, we use network deconvolution to demonstrate that the attacks succeed by inducing activation patterns similar to entirely different scenarios used in training.
Exploiting Reuse in Pipeline-Aware Hyperparameter Tuning
Venue: arXiv cs.LG 2019
Year: 2019

Hyperparameter tuning of multi-stage pipelines introduces a significant computational burden. Motivated by the observation that work can be reused across pipelines if the intermediate computations are the same, we propose a pipeline-aware approach to hyperparameter tuning. Our approach optimizes both the design and execution of pipelines to maximize reuse. We design pipelines amenable for reuse by (i) introducing a novel hybrid hyperparameter tuning method called gridded random search, and (ii) reducing the average training time in pipelines by adapting early-stopping hyperparameter tuning approaches. We then realize the potential for reuse during execution by introducing a novel caching problem for ML workloads which we pose as a mixed integer linear program (ILP), and subsequently evaluating various caching heuristics relative to the optimal solution of the ILP. We conduct experiments on simulated and real-world machine learning pipelines to show that a pipeline-aware approach to hyperparameter tuning can offer over an order-of-magnitude speedup over independently evaluating pipeline configurations.
Topological Analysis of Syntactic Structures
Venue: arXiv cs.CL 2019
Year: 2019

We use the persistent homology method of topological data analysis and dimensional analysis techniques to study data of syntactic structures of world languages. We analyze relations between syntactic parameters in terms of dimensionality, of hierarchical clustering structures, and of non-trivial loops. We show there are relations that hold across language families and additional relations that are family-specific. We then analyze the trees describing the merging structure of persistent connected components for languages in different language families and we show that they partly correlate to historical phylogenetic trees but with significant differences. We also show the existence of interesting non-trivial persistent first homology groups in various language families. We give examples where explicit generators for the persistent first homology can be identified, some of which appear to correspond to homoplasy phenomena, while others may have an explanation in terms of historical linguistics, corresponding to known cases of syntactic borrowing across different language subfamilies.
Krasovskii's Passivity
Venue: arXiv cs.SY 2019
Year: 2019

In this paper we introduce a new notion of passivity which we call Krasovskii's passivity and provide a sufficient condition for a system to be Krasovskii's passive. Based on this condition, we investigate classes of port-Hamiltonian and gradient systems which are Krasovskii's passive. Moreover, we provide a new interconnection based control technique based on Krasovskii's passivity. Our proposed control technique can be used even in the case when it is not clear how to construct the standard passivity based controller, which is demonstrated by examples of a Boost converter and a parallel RLC circuit.
Confident Kernel Sparse Coding and Dictionary Learning
Venue: arXiv cs.LG 2019
Year: 2019

In recent years, kernel-based sparse coding (K-SRC) has received particular attention due to its efficient representation of nonlinear data structures in the feature space. Nevertheless, the existing K-SRC methods suffer from the lack of consistency between their training and test optimization frameworks. In this work, we propose a novel confident K-SRC and dictionary learning algorithm (CKSC) which focuses on the discriminative reconstruction of the data based on its representation in the kernel space. CKSC focuses on reconstructing each data sample via weighted contributions which are confident in its corresponding class of data. We employ novel discriminative terms to apply this scheme to both training and test frameworks in our algorithm. This specific design increases the consistency of these optimization frameworks and improves the discriminative performance in the recall phase. In addition, CKSC directly employs the supervised information in its dictionary learning framework to enhance the discriminative structure of the dictionary. For empirical evaluations, we implement our CKSC algorithm on multivariate time-series benchmarks such as DynTex++ and UTKinect. Our claims regarding the superior performance of the proposed algorithm are justified throughout comparing its classification results to the state-of-the-art K-SRC algorithms.
Learning Feature Aggregation in Temporal Domain for Re-Identification
Venue: arXiv cs.CV 2019
Year: 2019

Person re-identification is a standard and established problem in the computer vision community. In recent years, vehicle re-identification is also getting more attention. In this paper, we focus on both these tasks and propose a method for aggregation of features in temporal domain as it is common to have multiple observations of the same object. The aggregation is based on weighting different elements of the feature vectors by different weights and it is trained in an end-to-end manner by a Siamese network. The experimental results show that our method outperforms other existing methods for feature aggregation in temporal domain on both vehicle and person re-identification tasks. Furthermore, to push research in vehicle re-identification further, we introduce a novel dataset CarsReId74k. The dataset is not limited to frontal/rear viewpoints. It contains 17,681 unique vehicles, 73,976 observed tracks, and 277,236 positive pairs. The dataset was captured by 66 cameras from various angles.
SymPas: Symbolic Program Slicing
Venue: arXiv cs.PL 2019
Year: 2019

Program slicing is a technique for simplifying programs by focusing on selected aspects of their behaviour. Current mainstream static slicing methods operate on the PDG (program dependence graph) or SDG (system dependence graph), but these friendly graph representations may be expensive and error-prone for some users. We attempt in this paper to study a light-weight approach of static program slicing, called Symbolic Program Slicing (SymPas), which works as a dataflow analysis on LLVM (Low-Level Virtual Machine). In our SymPas approach, slices are stored symbolically rather than procedure being re-analysed (cf. procedure summaries). Instead of re-analysing a procedure multiple times to find its slices for each callling context, SymPas calculates a single symbolic (or parameterized) slice which can be instantiated at call sites avoiding re-analysis; it is implemented in LLVM to perform slicing on its intermediate representation (IR). For comparison, we systematically adapt IFDS (Interprocedural Finite Distributive Subset) analysis and the SDG-based slicing method (SDG-IFDS) to statically IR slice programs. Evaluated on open-source and benchmark programs, our backward SymPas shows a factor-of-6 reduction in time cost and a factor-of-4 reduction in space cost, compared to backward SDG-IFDS, thus being more efficient. In addition, the result shows that after studying slices from 66 programs, ranging up to 336,800 IR instructions in size, SymPas is highly size-scalable.