OpenRaiser/Intern-Atlas huggingface dataset:
Splitting Proofs for Interpolation
Venue: arXiv cs.LO 2017
Year: 2017

We study interpolant extraction from local first-order refutations. We present a new theoretical perspective on interpolation based on clearly separating the condition on logical strength of the formula from the requirement on the com- mon signature. This allows us to highlight the space of all interpolants that can be extracted from a refutation as a space of simple choices on how to split the refuta- tion into two parts. We use this new insight to develop an algorithm for extracting interpolants which are linear in the size of the input refutation and can be further optimized using metrics such as number of non-logical symbols or quantifiers. We implemented the new algorithm in first-order theorem prover VAMPIRE and evaluated it on a large number of examples coming from the first-order proving community. Our experiments give practical evidence that our work improves the state-of-the-art in first-order interpolation.
Fault Detection of Broken Rotor Bar in LS-PMSM Using Random Forests
Venue: arXiv cs.LG 2017
Year: 2017

This paper proposes a new approach to diagnose broken rotor bar failure in a line start-permanent magnet synchronous motor (LS-PMSM) using random forests. The transient current signal during the motor startup was acquired from a healthy motor and a faulty motor with a broken rotor bar fault. We extracted 13 statistical time domain features from the startup transient current signal, and used these features to train and test a random forest to determine whether the motor was operating under normal or faulty conditions. For feature selection, we used the feature importances from the random forest to reduce the number of features to two features. The results showed that the random forest classifies the motor condition as healthy or faulty with an accuracy of 98.8% using all features and with an accuracy of 98.4% by using only the mean-index and impulsion features. The performance of the random forest was compared with a decision tree, Naïve Bayes classifier, logistic regression, linear ridge, and a support vector machine, with the random forest consistently having a higher accuracy than the other algorithms. The proposed approach can be used in industry for online monitoring and fault diagnostic of LS-PMSM motors and the results can be helpful for the establishment of preventive maintenance plans in factories.
Image Captioning and Classification of Dangerous Situations
Venue: arXiv cs.CV 2017
Year: 2017

Current robot platforms are being employed to collaborate with humans in a wide range of domestic and industrial tasks. These environments require autonomous systems that are able to classify and communicate anomalous situations such as fires, injured persons, car accidents; or generally, any potentially dangerous situation for humans. In this paper we introduce an anomaly detection dataset for the purpose of robot applications as well as the design and implementation of a deep learning architecture that classifies and describes dangerous situations using only a single image as input. We report a classification accuracy of 97 % and METEOR score of 16.2. We will make the dataset publicly available after this paper is accepted.
Convolutional Neural Network Steganalysis's Application to Steganography
Venue: arXiv cs.MM 2017
Year: 2017

This paper presents a novel approach to increase the performance bounds of image steganography under the criteria of minimizing distortion. The proposed approach utilizes a steganalysis convolutional neural network (CNN) framework to understand an image's model and embed in less detectable regions to preserve the model. In other word, the trained steganalysis CNN is used to calculate derivatives of the statistical model of an image with respect to embedding changes. The experimental results show that the proposed algorithm outperforms previous state-of-the-art methods in a wide range of low relative payloads when compared with HUGO, S-UNIWARD, and HILL by the state-of-the-art steganalysis.
Towards an Economic Analysis of Routing in Payment Channel Networks
Venue: arXiv cs.CE 2017
Year: 2017

Payment channel networks are supposed to overcome technical scalability limitations of blockchain infrastructure by employing a special overlay network with fast payment confirmation and only sporadic settlement of netted transactions on the blockchain. However, they introduce economic routing constraints that limit decentralized scalability and are currently not well understood. In this paper, we model the economic incentives for participants in payment channel networks. We provide the first formal model of payment channel economics and analyze how the cheapest path can be found. Additionally, our simulation assesses the long-term evolution of a payment channel network. We find that even for small routing fees, sometimes it is cheaper to settle the transaction directly on the blockchain.
A Robust Adaptive Flux Observer for a Class of Electromechanical Systems
Venue: arXiv cs.SY 2017
Year: 2017

The problem of designing a flux observer for magnetic field electromechanical systems from noise corrupted measurements of currents and voltages is addressed in this paper. Imposing a constraint on the systems magnetic energy function, which allows us to construct an algebraic relation between fluxes and measured voltages and currents that is independent of the mechanical coordinates, we identify a class of systems for which a globally convergent adaptive observer can be designed. A new adaptive observer design technique that effectively exploits the aforementioned algebraic relation is proposed and successfully applied to the practically important examples of permanent magnet synchronous motors and magnetic levitation systems.
Bayesian Scale Estimation for Monocular SLAM Based on Generic Object Detection for Correcting Scale Drift
Venue: arXiv cs.RO 2017
Year: 2017

This work proposes a new, online algorithm for estimating the local scale correction to apply to the output of a monocular SLAM system and obtain an as faithful as possible metric reconstruction of the 3D map and of the camera trajectory. Within a Bayesian framework, it integrates observations from a deep-learning based generic object detector and a prior on the evolution of the scale drift. For each observation class, a predefined prior on the heights of the class objects is used. This allows to define the observations likelihood. Due to the scale drift inherent to monocular SLAM systems, we integrate a rough model on the dynamics of scale drift. Quantitative evaluations of the system are presented on the KITTI dataset, and compared with different approaches. The results show a superior performance of our proposal in terms of relative translational error when compared to other monocular systems.
RubyStar: A Non-Task-Oriented Mixture Model Dialog System
Venue: arXiv cs.CL 2017
Year: 2017

RubyStar is a dialog system designed to create "human-like" conversation by combining different response generation strategies. RubyStar conducts a non-task-oriented conversation on general topics by using an ensemble of rule-based, retrieval-based and generative methods. Topic detection, engagement monitoring, and context tracking are used for managing interaction. Predictable elements of conversation, such as the bot's backstory and simple question answering are handled by separate modules. We describe a rating scheme we developed for evaluating response generation. We find that character-level RNN is an effective generation model for general responses, with proper parameter settings; however other kinds of conversation topics might benefit from using other models.
Deep Fault Analysis and Subset Selection in Solar Power Grids
Venue: arXiv cs.LG 2017
Year: 2017

Non-availability of reliable and sustainable electric power is a major problem in the developing world. Renewable energy sources like solar are not very lucrative in the current stage due to various uncertainties like weather, storage, land use among others. There also exists various other issues like mis-commitment of power, absence of intelligent fault analysis, congestion, etc. In this paper, we propose a novel deep learning-based system for predicting faults and selecting power generators optimally so as to reduce costs and ensure higher reliability in solar power systems. The results are highly encouraging and they suggest that the approaches proposed in this paper have the potential to be applied successfully in the developing world.
Collaborative Anomaly Detection Framework for handling Big Data of Cloud Computing
Venue: arXiv cs.CR 2017
Year: 2017

With the ubiquitous computing of providing services and applications at anywhere and anytime, cloud computing is the best option as it offers flexible and pay-per-use based services to its customers. Nevertheless, security and privacy are the main challenges to its success due to its dynamic and distributed architecture, resulting in generating big data that should be carefully analysed for detecting network vulnerabilities. In this paper, we propose a Collaborative Anomaly Detection Framework CADF for detecting cyber attacks from cloud computing environments. We provide the technical functions and deployment of the framework to illustrate its methodology of implementation and installation. The framework is evaluated on the UNSW-NB15 dataset to check its credibility while deploying it in cloud computing environments. The experimental results showed that this framework can easily handle large-scale systems as its implementation requires only estimating statistical measures from network observations. Moreover, the evaluation performance of the framework outperforms three state-of-the-art techniques in terms of false positive rate and detection rate.
On the $q$-Bentness of Boolean Functions
Venue: arXiv cs.CR 2017
Year: 2017

For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of basis. Klapper conjectured that no Boolean function exists with its $q$-transform coefficients equal to $\pm 2^{n/2}$ (such function is called $q$-bent). In our early work, we only gave partial results to confirm this conjecture for small $n$. Here we prove thoroughly that the conjecture is true by investigating the nonexistence of the partial difference sets in Abelian groups with special parameters. We also introduce a new family of functions called almost $q$-bent functions, which are close to $q$-bentness.
Cross-National Measurement of Polarization in Political Discourse: Analyzing floor debate in the U.S. and the Japanese legislatures
Venue: arXiv cs.CY 2017
Year: 2017

Political polarization in public space can seriously hamper the function and the integrity of contemporary democratic societies. In this paper, we propose a novel measure of such polarization, which, by way of simple topic modelling, quantifies differences in collective articulation of public agendas among relevant political actors. Unlike most other polarization measures, our measure allows cross-national comparison. Analyzing a large amount of speech records of legislative debate in the United States Congress and the Japanese Diet over a long period of time, we have reached two intriguing findings. First, on average, Japanese political actors are far more polarized in their issue articulation than their counterparts in the U.S., which is somewhat surprising given the recent notion of U.S. politics as highly polarized. Second, the polarization in each country shows its own temporal dynamics in response to a different set of factors. In Japan, structural factors such as the roles of the ruling party and the opposition often dominate such dynamics, whereas the U.S. legislature suffers from persistent ideological differences over particular issues between major political parties. The analysis confirms a strong influence of institutional differences on legislative debate in parliamentary democracies.
Intelligent Fault Analysis in Electrical Power Grids
Venue: arXiv cs.SY 2017
Year: 2017

Power grids are one of the most important components of infrastructure in today's world. Every nation is dependent on the security and stability of its own power grid to provide electricity to the households and industries. A malfunction of even a small part of a power grid can cause loss of productivity, revenue and in some cases even life. Thus, it is imperative to design a system which can detect the health of the power grid and take protective measures accordingly even before a serious anomaly takes place. To achieve this objective, we have set out to create an artificially intelligent system which can analyze the grid information at any given time and determine the health of the grid through the usage of sophisticated formal models and novel machine learning techniques like recurrent neural networks. Our system simulates grid conditions including stimuli like faults, generator output fluctuations, load fluctuations using Siemens PSS/E software and this data is trained using various classifiers like SVM, LSTM and subsequently tested. The results are excellent with our methods giving very high accuracy for the data. This model can easily be scaled to handle larger and more complex grid architectures.
A Simple Derivation of the Heap's Law from the Generalized Zipf's Law
Venue: arXiv cs.IR 2017
Year: 2017

I reproduce a rather simple formal derivation of the Heaps' law from the generalized Zipf's law, which I previously published in Russian.
Influence Maximization over Markovian Graphs: A Stochastic Optimization Approach
Venue: arXiv cs.SI 2017
Year: 2017

This paper considers the problem of randomized influence maximization over a Markovian graph process: given a fixed set of nodes whose connectivity graph is evolving as a Markov chain, estimate the probability distribution (over this fixed set of nodes) that samples a node which will initiate the largest information cascade (in expectation). Further, it is assumed that the sampling process affects the evolution of the graph i.e. the sampling distribution and the transition probability matrix are functionally dependent. In this setup, recursive stochastic optimization algorithms are presented to estimate the optimal sampling distribution for two cases: 1) transition probabilities of the graph are unknown but, the graph can be observed perfectly 2) transition probabilities of the graph are known but, the graph is observed in noise. These algorithms consist of a neighborhood size estimation algorithm combined with a variance reduction method, a Bayesian filter and a stochastic gradient algorithm. Convergence of the algorithms are established theoretically and, numerical results are provided to illustrate how the algorithms work.
Analysis of Dropout in Online Learning
Venue: arXiv cs.LG 2017
Year: 2017

Deep learning is the state-of-the-art in fields such as visual object recognition and speech recognition. This learning uses a large number of layers and a huge number of units and connections. Therefore, overfitting is a serious problem with it, and the dropout which is a kind of regularization tool is used. However, in online learning, the effect of dropout is not well known. This paper presents our investigation on the effect of dropout in online learning. We analyzed the effect of dropout on convergence speed near the singular point. Our results indicated that dropout is effective in online learning. Dropout tends to avoid the singular point for convergence speed near that point.
Frangi-Net: A Neural Network Approach to Vessel Segmentation
Venue: arXiv cs.CV 2017
Year: 2017

In this paper, we reformulate the conventional 2-D Frangi vesselness measure into a pre-weighted neural network ("Frangi-Net"), and illustrate that the Frangi-Net is equivalent to the original Frangi filter. Furthermore, we show that, as a neural network, Frangi-Net is trainable. We evaluate the proposed method on a set of 45 high resolution fundus images. After fine-tuning, we observe both qualitative and quantitative improvements in the segmentation quality compared to the original Frangi measure, with an increase up to $17\%$ in F1 score.
NFV Orchestrator Placement for Geo-Distributed Systems
Venue: arXiv cs.NI 2017
Year: 2017

The European Telecommunications Standards Institute (ETSI) developed Network Functions Virtualization (NFV) Management and Orchestration (MANO) framework. Within that framework, NFV orchestrator (NFVO) and Virtualized Network Function (VNF) Manager (VNFM) functional blocks are responsible for managing the lifecycle of network services and their associated VNFs. However, they face significant scalability and performance challenges in large-scale and geo-distributed NFV systems. Their number and location have major implications for the number of VNFs that can be accommodated and also for the overall system performance. NFVO and VNFM placement is therefore a key challenge due to its potential impact on the system scalability and performance. In this paper, we address the placement of NFVO and VNFM in large-scale and geo-distributed NFV infrastructure. We provide an integer linear programming formulation of the problem and propose a two-step placement algorithm to solve it. We also conduct a set of experiments to evaluate the proposed algorithm.
Match Made in Heaven: Practical Compressed Sensing and Network Coding for Intelligent Distributed Communication Networks
Venue: arXiv cs.NI 2017
Year: 2017

Based on the impressive features that network coding and compressed sensing paradigms have separately brought, the idea of bringing them together in practice will result in major improvements and influence in the upcoming 5G networks. In this context, this paper aims to evaluate the effectiveness of these key techniques in a cluster-based wireless sensor network, in the presence of temporal and spatial correlations. Our goal is to achieve better compression gains by scaling down the total payload carried by applying temporal compression as well as reducing the total number of transmissions in the network using real field network coding. In order to further reduce the number of transmissions, the cluster-heads perform a low complexity spatial pre-coding consisting of sending the packets with a certain probability. Furthermore, we compare our approach with benchmark schemes. As expected, our numerical results run on NS3 simulator show that on overall our scheme dramatically drops the number of transmitted packets in the considered cluster topology with a very high reconstruction SNR.
A random matrix analysis and improvement of semi-supervised learning for large dimensional data
Venue: arXiv cs.LG 2017
Year: 2017

This article provides an original understanding of the behavior of a class of graph-oriented semi-supervised learning algorithms in the limit of large and numerous data. It is demonstrated that the intuition at the root of these methods collapses in this limit and that, as a result, most of them become inconsistent. Corrective measures and a new data-driven parametrization scheme are proposed along with a theoretical analysis of the asymptotic performances of the resulting approach. A surprisingly close behavior between theoretical performances on Gaussian mixture models and on real datasets is also illustrated throughout the article, thereby suggesting the importance of the proposed analysis for dealing with practical data. As a result, significant performance gains are observed on practical data classification using the proposed parametrization.
What Really is Deep Learning Doing?
Venue: arXiv cs.LG 2017
Year: 2017

Deep learning has achieved a great success in many areas, from computer vision to natural language processing, to game playing, and much more. Yet, what deep learning is really doing is still an open question. There are a lot of works in this direction. For example, [5] tried to explain deep learning by group renormalization, and [6] tried to explain deep learning from the view of functional approximation. In order to address this very crucial question, here we see deep learning from perspective of mechanical learning and learning machine (see [1], [2]). From this particular angle, we can see deep learning much better and answer with confidence: What deep learning is really doing? why it works well, how it works, and how much data is necessary for learning. We also will discuss advantages and disadvantages of deep learning at the end of this work.
Efficient-UCBV: An Almost Optimal Algorithm using Variance Estimates
Venue: arXiv cs.LG 2017
Year: 2017

We propose a novel variant of the UCB algorithm (referred to as Efficient-UCB-Variance (EUCBV)) for minimizing cumulative regret in the stochastic multi-armed bandit (MAB) setting. EUCBV incorporates the arm elimination strategy proposed in UCB-Improved \citep{auer2010ucb}, while taking into account the variance estimates to compute the arms' confidence bounds, similar to UCBV \citep{audibert2009exploration}. Through a theoretical analysis we establish that EUCBV incurs a \emph{gap-dependent} regret bound of {\scriptsize $O\left( \dfrac{Kσ^2_{\max} \log (TΔ^2 /K)}Δ\right)$} after $T$ trials, where $Δ$ is the minimal gap between optimal and sub-optimal arms; the above bound is an improvement over that of existing state-of-the-art UCB algorithms (such as UCB1, UCB-Improved, UCBV, MOSS). Further, EUCBV incurs a \emph{gap-independent} regret bound of {\scriptsize $O\left(\sqrt{KT}\right)$} which is an improvement over that of UCB1, UCBV and UCB-Improved, while being comparable with that of MOSS and OCUCB. Through an extensive numerical study we show that EUCBV significantly outperforms the popular UCB variants (like MOSS, OCUCB, etc.) as well as Thompson sampling and Bayes-UCB algorithms.
Covert Communications with A Full-Duplex Receiver over Wireless Fading Channels
Venue: arXiv cs.IT 2017
Year: 2017

In this work, we propose a covert communication scheme where the transmitter attempts to hide its transmission to a full-duplex receiver, from a warden that is to detect this covert transmission using a radiometer. Specifically, we first derive the detection error rate at the warden, based on which the optimal detection threshold for its radiometer is analytically determined and its expected detection error rate over wireless fading channels is achieved in a closed-form expression. Our analysis indicates that the artificial noise deliberately produced by the receiver with a random transmit power, although causes self-interference, offers the capability of achieving a positive effective covert rate for any transmit power (can be infinity) subject to any given covertness requirement on the expected detection error rate. This work is the first study on the use of the full-duplex receiver with controlled artificial noise for achieving covert communications and invites further investigation in this regard.