OpenRaiser/Intern-Atlas huggingface dataset:
The evolution of Lightning Network's Topology during its first year and the influence over its core values
Venue: arXiv cs.CR 2019
Year: 2019

It is now a whole year since Lightning Network (LN) has been launched on the Bitcoi's mainnet. LN has been claimed as the solution for several of Bitcoin's weaknesses such as its difficulty to scale in number of transactions per second and its expensiveness for relative small amount exchanged. LN is based upon a network of micro-channels opened and closed by issuing transactions on the Blockchain and capable to interact among themselves thanks to the Multi-hop framework. In this work I analysed the evolution of LN from its topological point of view and tried to understand how it impacts over some of Bitcoin's historical core foundamentals such as the resilience against attacks and failures and the user's anonymity. Another question I have tried to answer is whether the evolution of LN's topology will make its synchronization easier.
XONN: XNOR-based Oblivious Deep Neural Network Inference
Venue: arXiv cs.CR 2019
Year: 2019

Advancements in deep learning enable cloud servers to provide inference-as-a-service for clients. In this scenario, clients send their raw data to the server to run the deep learning model and send back the results. One standing challenge in this setting is to ensure the privacy of the clients' sensitive data. Oblivious inference is the task of running the neural network on the client's input without disclosing the input or the result to the server. This paper introduces XONN, a novel end-to-end framework based on Yao's Garbled Circuits (GC) protocol, that provides a paradigm shift in the conceptual and practical realization of oblivious inference. In XONN, the costly matrix-multiplication operations of the deep learning model are replaced with XNOR operations that are essentially free in GC. We further provide a novel algorithm that customizes the neural network such that the runtime of the GC protocol is minimized without sacrificing the inference accuracy. We design a user-friendly high-level API for XONN, allowing expression of the deep learning model architecture in an unprecedented level of abstraction. Extensive proof-of-concept evaluation on various neural network architectures demonstrates that XONN outperforms prior art such as Gazelle (USENIX Security'18) by up to 7x, MiniONN (ACM CCS'17) by 93x, and SecureML (IEEE S&P'17) by 37x. State-of-the-art frameworks require one round of interaction between the client and the server for each layer of the neural network, whereas, XONN requires a constant round of interactions for any number of layers in the model. XONN is first to perform oblivious inference on Fitnet architectures with up to 21 layers, suggesting a new level of scalability compared with state-of-the-art. Moreover, we evaluate XONN on four datasets to perform privacy-preserving medical diagnosis.
Deep Learning Based Video System for Accurate and Real-Time Parking Measurement
Venue: arXiv cs.CV 2019
Year: 2019

Parking spaces are costly to build, parking payments are difficult to enforce, and drivers waste an excessive amount of time searching for empty lots. Accurate quantification would inform developers and municipalities in space allocation and design, while real-time measurements would provide drivers and parking enforcement with information that saves time and resources. In this paper, we propose an accurate and real-time video system for future Internet of Things (IoT) and smart cities applications. Using recent developments in deep convolutional neural networks (DCNNs) and a novel vehicle tracking filter, we combine information across multiple image frames in a video sequence to remove noise introduced by occlusions and detection failures. We demonstrate that our system achieves higher accuracy than pure image-based instance segmentation, and is comparable in performance to industry benchmark systems that utilize more expensive sensors such as radar. Furthermore, our system shows significant potential in its scalability to a city-wide scale and also in the richness of its output that goes beyond traditional binary occupancy statistics.
Jamming-assisted Eavesdropping over Parallel Fading Channels
Venue: arXiv cs.IT 2019
Year: 2019

This paper advances the proactive eavesdropping research by considering a practical half-duplex mode for the legitimate monitor and dealing with the challenging case that the suspicious link opportunistically communicates over parallel fading channels. To increase eavesdropping success probability, we propose cognitive jamming for the monitor to change the suspicious link's long-term belief on the parallel channels' distributions, and thereby induce it to transmit more likely over a smaller subset of unjammed channels with a lower transmission rate. As the half-duplex monitor cannot eavesdrop the channel that it is simultaneously jamming to, our jamming design should also control the probability of such "own goal" that occurs when the suspicious link chooses one of the jammed (uneavesdroppable) channels to transmit. We formulate the optimal jamming design problem as a mixed integer nonlinear programming and show that it is non-convex. Nevertheless, we prove that the monitor should optimally use the maximum jamming power if it decides to jam, for maximally reducing suspicious link's communication rate and driving the suspicious link out of the jammed channels. Then we manage to simplify the MINLP to integer programming and reveal a fundamental trade-off in deciding the number of jammed channels: jamming more channels helps reduce the suspicious link's communication rate for overhearing more clearly, but increases own goal probability and thus decreases eavesdropping success probability. Finally, we extend our study to the two-way suspicious communication scenario, and show there is another interesting trade-off in deciding the common jammed channels for balancing bidirectional eavesdropping performances. Numerical results show that our optimized jamming-assisted eavesdropping scheme greatly increase eavesdropping success probability as compared with the conventional passive eavesdropping.
Mexican Hat Wavelet Kernel ELM for Multiclass Classification
Venue: arXiv cs.LG 2019
Year: 2019

Kernel extreme learning machine (KELM) is a novel feedforward neural network, which is widely used in classification problems. To some extent, it solves the existing problems of the invalid nodes and the large computational complexity in ELM. However, the traditional KELM classifier usually has a low test accuracy when it faces multiclass classification problems. In order to solve the above problem, a new classifier, Mexican Hat wavelet KELM classifier, is proposed in this paper. The proposed classifier successfully improves the training accuracy and reduces the training time in the multiclass classification problems. Moreover, the validity of the Mexican Hat wavelet as a kernel function of ELM is rigorously proved. Experimental results on different data sets show that the performance of the proposed classifier is significantly superior to the compared classifiers.
Identification of Bugs and Vulnerabilities in TLS Implementation for Windows Operating System Using State Machine Learning
Venue: arXiv cs.NI 2019
Year: 2019

TLS protocol is an essential part of secure Internet communication. In past, many attacks have been identified on the protocol. Most of these attacks are due to flaws in protocol implementation. The flaws are due to improper design and implementation of program logic by programmers. One of the widely used implementation of TLS is SChannel which is used in Windows operating system since its inception. We have used protocol state fuzzing to identify vulnerable and undesired state transitions in the state machine of the protocol for various versions of SChannel. The client as well as server components have been analyzed thoroughly using this technique and various flaws have been discovered in the implementation. Exploitation of these flaws under specific circumstances may lead to serious attacks which could disrupt secure communication. In this paper, we analyze state machine models of TLS protocol implementation of SChannel library and describe weaknesses and design flaws in these models, found using protocol state fuzzing.
An efficient solution for semantic segmentation: ShuffleNet V2 with atrous separable convolutions
Venue: arXiv cs.CV 2019
Year: 2019

Assigning a label to each pixel in an image, namely semantic segmentation, has been an important task in computer vision, and has applications in autonomous driving, robotic navigation, localization, and scene understanding. Fully convolutional neural networks have proved to be a successful solution for the task over the years but most of the work being done focuses primarily on accuracy. In this paper, we present a computationally efficient approach to semantic segmentation, while achieving a high mean intersection over union (mIOU), 70.33% on Cityscapes challenge. The network proposed is capable of running real-time on mobile devices. In addition, we make our code and model weights publicly available.
Vibrotactile Signal Generation from Texture Images or Attributes using Generative Adversarial Network
Venue: arXiv cs.HC 2019
Year: 2019

Providing vibrotactile feedback that corresponds to the state of the virtual texture surfaces allows users to sense haptic properties of them. However, hand-tuning such vibrotactile stimuli for every state of the texture takes much time. Therefore, we propose a new approach to create models that realize the automatic vibrotactile generation from texture images or attributes. In this paper, we make the first attempt to generate the vibrotactile stimuli leveraging the power of deep generative adversarial training. Specifically, we use conditional generative adversarial networks (GANs) to achieve generation of vibration during moving a pen on the surface. The preliminary user study showed that users could not discriminate generated signals and genuine ones and users felt realism for generated signals. Thus our model could provide the appropriate vibration according to the texture images or the attributes of them. Our approach is applicable to any case where the users touch the various surfaces in a predefined way.
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
Venue: arXiv cs.DS 2019
Year: 2019

Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer $L$, an {\em $L$-bounded flow} is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the {\em maximum $L$-bounded flow problem} the task is to find a maximum $L$-bounded flow between a given pair of vertices in the input graph. The problem can be solved in polynomial time using linear programming. However, as far as we know, no polynomial-time combinatorial algorithm for the $L$-bounded flow is known. The only attempt, that we are aware of, to describe a combinatorial algorithm for the maximum $L$-bounded flow problem was done by Koubek and Ří ha in 1981. Unfortunately, their paper contains substantional flaws and the algorithm does not work; in the first part of this paper, we describe these problems. In the second part of this paper we describe a combinatorial algorithm based on the exponential length method that finds a $(1+ε)$-approximation of the maximum $L$-bounded flow in time $O(ε^{-2}m^2 L\log L)$ where $m$ is the number of edges in the graph. Moreover, we show that this approach works even for the NP-hard generalization of the maximum $L$-bounded flow problem in which each edge has a length.
Method of Manufactured Solutions Code Verification of Elastostatic Solid Mechanics Problems in a Commercial Finite Element Solver
Venue: arXiv cs.CE 2019
Year: 2019

Much progress has been made in advancing and standardizing verification, validation, and uncertainty quantification practices for computational modeling in recent decades. However, examples of rigorous code verification for solid mechanics problems in the literature remain scarce, particularly for commercial software and for the non-trivial large-deformation analyses and nonlinear materials typically needed to simulate medical devices. Here, we apply the method of manufactured solutions (MMS) to verify a commercial finite element code for elastostatic solid mechanics analyses using linear-elastic, hyperelastic (neo-Hookean), and quasi-hyperelastic (Hencky) constitutive models. Analytical source terms are generated using either Python/SymPy or Mathematica and are implemented in ABAQUS/Standard without modification to the solver source code. Source terms for the three constitutive models are found to vary nearly six orders of magnitude in the number of mathematical operations they contain. Refinement studies reveal second-order displacement convergence in response to mesh refinement for all constitutive models and first-order displacement convergence in response to increment refinement for the finite-strain problems. We also investigate the sensitivity of MMS convergence order to minor coding errors using an exploratory case. Code used to generate the MMS source terms and the input files for the simulations are provided as supplemental material.
Enhanced Automatic Generation Control (E-AGC) for Electric Power Systems with Large Intermittent Renewable Energy Sources
Venue: arXiv cs.SY 2019
Year: 2019

This paper is motivated by the need to enhance today's Automatic Generation Control (AGC) for ensuring high quality frequency response in the changing electric power systems. Renewable energy sources, if not controlled carefully, create persistent fast and often large oscillations in their electric power outputs. A sufficiently detailed dynamical model of the interconnected system which captures the effects of fast nonlinear disturbances created by the renewable energy resources is derived for the first time. Consequently, the real power flow interarea oscillations and the resulting frequency deviations are modeled. The modeling is multi-layered, and the dynamics of each layer (component level (generator); control area (control balancing authority), and the interconnected system) is expressed in terms of internal states and the interaction variables (IntV) between the layers and within the layers. E-AGC is then derived using this model to show how these interarea oscillations can be canceled. Simulation studies are carried out on a 5-bus system.
LOSSGRAD: automatic learning rate in gradient descent
Venue: arXiv cs.LG 2019
Year: 2019

In this paper, we propose a simple, fast and easy to implement algorithm LOSSGRAD (locally optimal step-size in gradient descent), which automatically modifies the step-size in gradient descent during neural networks training. Given a function $f$, a point $x$, and the gradient $\nabla_x f$ of $f$, we aim to find the step-size $h$ which is (locally) optimal, i.e. satisfies: $$ h=arg\,min_{t \geq 0} f(x-t \nabla_x f). $$ Making use of quadratic approximation, we show that the algorithm satisfies the above assumption. We experimentally show that our method is insensitive to the choice of initial learning rate while achieving results comparable to other methods.
Feature Relevance Bounds for Ordinal Regression
Venue: arXiv cs.LG 2019
Year: 2019

The increasing occurrence of ordinal data, mainly sociodemographic, led to a renewed research interest in ordinal regression, i.e. the prediction of ordered classes. Besides model accuracy, the interpretation of these models itself is of high relevance, and existing approaches therefore enforce e.g. model sparsity. For high dimensional or highly correlated data, however, this might be misleading due to strong variable dependencies. In this contribution, we aim for an identification of feature relevance bounds which - besides identifying all relevant features - explicitly differentiates between strongly and weakly relevant features.
Towards Semantic Big Graph Analytics for Cross-Domain Knowledge Discovery
Venue: arXiv cs.DB 2019
Year: 2019

In recent years, the size of big linked data has grown rapidly and this number is still rising. Big linked data and knowledge bases come from different domains such as life sciences, publications, media, social web, and so on. However, with the rapid increasing of data, it is very challenging for people to acquire a comprehensive collection of cross domain knowledge to meet their needs. Under this circumstance, it is extremely difficult for people without expertise to extract knowledge from various domains. Therefore, nowadays human limited knowledge can't feed the high requirement for discovering large amount of cross domain knowledge. In this research, we present a big graph analytics framework aims at addressing this issue by providing semantic methods to facilitate the management of big graph data from close domains in order to discover cross domain knowledge in a more accurate and efficient way.
A Stability Analysis for the Acceleration-based Robust Position Control of Robot Manipulators via Disturbance Observer
Venue: arXiv cs.SY 2019
Year: 2019

This paper proposes a new nonlinear stability analysis for the acceleration-based robust position control of robot manipulators by using Disturbance Observer (DOb). It is shown that if the nominal inertia matrix is properly tuned in the design of DOb, then the position error asymptotically goes to zero in regulation control and is uniformly ultimately bounded in trajectory tracking control. As the bandwidth of DOb and the nominal inertia matrix are increased, the bound of error shrinks, i.e., the robust stability and performance of the position control system are improved. However, neither the bandwidth of DOb nor the nominal inertia matrix can be freely increased due to practical design constraints, e.g., the robust position controller becomes more noise sensitive when they are increased. The proposed stability analysis provides insights regarding the dynamic behavior of DOb-based robust motion control systems. It is theoretically and experimentally proved that non-diagonal elements of the nominal inertia matrix are useful to improve the stability and adjust the trade-off between the robustness and noise sensitivity. The validity of the proposal is verified by simulation and experimental results.
Orthogonal Matching Pursuit with Tikhonov and Landweber Regularization
Venue: arXiv cs.IT 2019
Year: 2019

The Orthogonal Matching Pursuit (OMP) for compressed sensing iterates over a scheme of support augmentation and signal estimation. We present two novel matching pursuit algorithms with intrinsic regularization of the signal estimation step that do not rely on a priori knowledge of the signal's sparsity. An iterative approach allows for a hardware efficient implementation of our algorithm, and enables real-world applications of compressed sensing. We provide a series of numerical examples that demonstrate a good performance, especially when the number of measurements is relatively small.
Optimizing and Evaluating Transient Gradual Typing
Venue: arXiv cs.PL 2019
Year: 2019

Gradual typing enables programmers to combine static and dynamic typing in the same language. However, ensuring a sound interaction between the static and dynamic parts can incur significant runtime cost. In this paper, we perform a detailed performance analysis of the transient gradual typing approach implemented in Reticulated Python, a gradually typed variant of Python. The transient approach inserts lightweight checks throughout a program rather than installing proxies on higher order values. We show that, when running Reticulated Python and the transient approach on CPython, performance decreases as programs evolve from dynamic to static types, up to a 6x slowdown compared to equivalent Python programs. To reduce this overhead, we design a static analysis and optimization that removes redundant runtime checks. The optimization employs a static type inference algorithm that solves traditional subtyping constraints and also a new kind of check constraint. We evaluate the resulting performance and find that for many programs, the efficiency of partially typed programs is close to their untyped counterparts, removing most of the slowdown of transient checks. Finally, we measure the efficiency of Reticulated Python programs when running on PyPy, a tracing JIT. We find that combining PyPy with our type inference algorithm reduces the overall overhead to zero.
Rationals vs Byzantines in Consensus-based Blockchains
Venue: arXiv cs.DC 2019
Year: 2019

In this paper we analyze from the game theory point of view Byzantine Fault Tolerant blockchains when processes exhibit rational or Byzantine behavior. Our work is the first to model the Byzantine-consensus based blockchains as a committee coordination game. Our first contribution is to offer a game-theoretical methodology to analyse equilibrium interactions between Byzantine and rational committee members in Byzantine Fault Tolerant blockchains. Byzantine processes seek to inflict maximum damage to the system, while rational processes best-respond to maximise their expected net gains. Our second contribution is to derive conditions under which consensus properties are satisfied or not in equilibrium. When the majority threshold is lower than the proportion of Byzantine processes, invalid blocks are accepted in equilibrium. When the majority threshold is large, equilibrium can involve coordination failures , in which no block is ever accepted. However, when the cost of accepting invalid blocks is large, there exists an equilibrium in which blocks are accepted iff they are valid.
Pretrained language model transfer on neural named entity recognition in Indonesian conversational texts
Venue: arXiv cs.CL 2019
Year: 2019

Named entity recognition (NER) is an important task in NLP, which is all the more challenging in conversational domain with their noisy facets. Moreover, conversational texts are often available in limited amount, making supervised tasks infeasible. To learn from small data, strong inductive biases are required. Previous work relied on hand-crafted features to encode these biases until transfer learning emerges. Here, we explore a transfer learning method, namely language model pretraining, on NER task in Indonesian conversational texts. We utilize large unlabeled data (generic domain) to be transferred to conversational texts, enabling supervised training on limited in-domain data. We report two transfer learning variants, namely supervised model fine-tuning and unsupervised pretrained LM fine-tuning. Our experiments show that both variants outperform baseline neural models when trained on small data (100 sentences), yielding an absolute improvement of 32 points of test F1 score. Furthermore, we find that the pretrained LM encodes part-of-speech information which is a strong predictor for NER.