OpenRaiser/Intern-Atlas huggingface dataset:
Decentralization in Bitcoin and Ethereum Networks
Venue: arXiv cs.CR 2018
Year: 2018

Blockchain-based cryptocurrencies have demonstrated how to securely implement traditionally centralized systems, such as currencies, in a decentralized fashion. However, there have been few measurement studies on the level of decentralization they achieve in practice. We present a measurement study on various decentralization metrics of two of the leading cryptocurrencies with the largest market capitalization and user base, Bitcoin and Ethereum. We investigate the extent of decentralization by measuring the network resources of nodes and the interconnection among them, the protocol requirements affecting the operation of nodes, and the robustness of the two systems against attacks. In particular, we adapted existing internet measurement techniques and used the Falcon Relay Network as a novel measurement tool to obtain our data. We discovered that neither Bitcoin nor Ethereum has strictly better properties than the other. We also provide concrete suggestions for improving both systems.
Efficient C-RAN Random Access for IoT Devices: Learning Links via Recommendation Systems
Venue: arXiv cs.IT 2018
Year: 2018

We focus on C-RAN random access protocols for IoT devices that yield low-latency high-rate active-device detection in dense networks of large-array remote radio heads. In this context, we study the problem of learning the strengths of links between detected devices and network sites. In particular, we develop recommendation-system inspired algorithms, which exploit random-access observations collected across the network to classify links between active devices and network sites across the network. Our simulations and analysis reveal the potential merit of data-driven schemes for such on-the-fly link classification and subsequent resource allocation across a wide-area network.
Did William Shakespeare and Thomas Kyd Write Edward III?
Venue: arXiv cs.CL 2018
Year: 2018

William Shakespeare is believed to be a significant author in the anonymous play, The Reign of King Edward III, published in 1596. However, recently, Thomas Kyd, has been suggested as the primary author. Using a neurolinguistics approach to authorship identification we use a four-feature technique, RPAS, to convert the 19 scenes in Edward III into a multi-dimensional vector. Three complementary analytical techniques are applied to cluster the data and reduce single technique bias before an alternate method, seriation, is used to measure the distances between clusters and test the strength of the connections. We find the multivariate techniques robust and are able to allocate up to 14 scenes to Thomas Kyd, and further question if scenes long believed to be Shakespeare's are not his.
Separation of Instrument Sounds using Non-negative Matrix Factorization with Spectral Envelope Constraints
Venue: arXiv cs.SD 2018
Year: 2018

Spectral envelope is one of the most important features that characterize the timbre of an instrument sound. However, it is difficult to use spectral information in the framework of conventional spectrogram decomposition methods. We overcome this problem by suggesting a simple way to provide a constraint on the spectral envelope calculated by linear prediction. In the first part of this study, we use a pre-trained spectral envelope of known instruments as the constraint. Then we apply the same idea to a blind scenario in which the instruments are unknown. The experimental results reveal that the proposed method outperforms the conventional methods.
Benchmarking cross-project defect prediction approaches with costs metrics
Venue: arXiv cs.SE 2018
Year: 2018

Defect prediction can be a powerful tool to guide the use of quality assurance resources. In recent years, many researchers focused on the problem of Cross-Project Defect Prediction (CPDP), i.e., the creation of prediction models based on training data from other projects. However, only few of the published papers evaluate the cost efficiency of predictions, i.e., if they save costs if they are used to guide quality assurance efforts. Within this paper, we provide a benchmark of 26 CPDP approaches based on cost metrics. Our benchmark shows that trivially assuming everything as defective is on average better than CPDP under cost considerations. Moreover, we show that our ranking of approaches using cost metrics is uncorrelated to a ranking based on metrics that do not directly consider costs. These findings show that we must put more effort into evaluating the actual benefits of CPDP, as the current state of the art of CPDP can actually be beaten by a trivial approach in cost-oriented evaluations.
Youla Coding and Computation of Gaussian Feedback Capacity
Venue: arXiv cs.IT 2018
Year: 2018

In this paper, we propose an approach to numerically compute the feedback capacity of stationary finite dimensional Gaussian channels and construct (arbitrarily close to) capacity-achieving feedback codes. In particular, we first extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable transmission rate over Youla parameters coincides with the problem of finding strictly causal filters to achieve feedback capacity derived in [2]. This extended interpretation provides an approach to construct deterministic feedback coding schemes with double exponential decaying error probability. We next propose asymptotic capacity-achieving upper bounds, which can be numerically evaluated by solving finite dimensional convex optimizations. From the filters that achieve the upper bounds, we apply the Youla-based interpretation to construct feasible filters, i.e., feedback codes, leading to a sequence of lower bounds. We prove the sequence of lower bounds is asymptotically capacity-achieving.
SwarmRob: A Toolkit for Reproducibility and Sharing of Experimental Artifacts in Robotics Research
Venue: arXiv cs.RO 2018
Year: 2018

Due to the complexity of robotics, the reproducibility of results and experiments is one of the fundamental problems in robotics research. While the problem has been identified by the community, the approaches that address the problem appropriately are limited. The toolkit proposed in this paper tries to deal with the problem of reproducibility and sharing of experimental artifacts in robotics research by a holistic approach based on operating-system-level virtualization. The experimental artifacts of an experiment are isolated in "containers" that can be distributed to other researchers. Based on this, this paper presents a novel experimental workflow to describe, execute and distribute experimental software-artifacts to heterogeneous robots dynamically. As a result, the proposed solution supports researchers in executing and reproducing experimental evaluations.
Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures
Venue: arXiv cs.IT 2018
Year: 2018

This paper considers transmitting a sequence of messages (a streaming source) over a packet erasure channel. In each time slot, the source constructs a packet based on the current and the previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. Every source message must be recovered perfectly at the destination subject to a fixed decoding delay. We assume that the channel loss model introduces either one burst erasure or multiple arbitrary erasures in any fixed-sized sliding window. Under this channel loss assumption, we fully characterize the maximum achievable rate by constructing streaming codes that achieve the optimal rate. In addition, our construction of optimal streaming codes implies the full characterization of the maximum achievable rate for convolutional codes with any given column distance, column span and decoding delay. Numerical results demonstrate that the optimal streaming codes outperform existing streaming codes of comparable complexity over some instances of the Gilbert-Elliott channel and the Fritchman channel.
Development of Energy Models for Design Space Exploration of Embedded Many-Core Systems
Venue: arXiv cs.DC 2018
Year: 2018

This paper introduces a methodology to develop energy models for the design space exploration of embedded many-core systems. The design process of such systems can benefit from sophisticated models. Software and hardware can be specifically optimized based on comprehensive knowledge about application scenario and hardware behavior. The contribution of our work is an automated framework to estimate the energy consumption at an arbitrary abstraction level without the need to provide further information about the system. We validated our framework with the configurable many-core system CoreVA-MPSoC. Compared to a simulation of the CoreVA-MPSoC on gate level in a 28nm FD-SOI standard cell technology, our framework shows an average estimation error of about 4%.
Deep saliency: What is learnt by a deep network about saliency?
Venue: arXiv cs.CV 2018
Year: 2018

Deep convolutional neural networks have achieved impressive performance on a broad range of problems, beating prior art on established benchmarks, but it often remains unclear what are the representations learnt by those systems and how they achieve such performance. This article examines the specific problem of saliency detection, where benchmarks are currently dominated by CNN-based approaches, and investigates the properties of the learnt representation by visualizing the artificial neurons' receptive fields. We demonstrate that fine tuning a pre-trained network on the saliency detection task lead to a profound transformation of the network's deeper layers. Moreover we argue that this transformation leads to the emergence of receptive fields conceptually similar to the centre-surround filters hypothesized by early research on visual saliency.
Efficient Probabilistic Model Checking of Smart Building Maintenance using Fault Maintenance Trees
Venue: arXiv cs.LO 2018
Year: 2018

Cyber-physical systems, like Smart Buildings and power plants, have to meet high standards, both in terms of reliability and availability. Such metrics are typically evaluated using Fault trees (FTs) and do not consider maintenance strategies which can significantly improve lifespan and reliability. Fault Maintenance trees (FMTs) -- an extension of FTs that also incorporate maintenance and degradation models, are a novel technique that serve as a good planning platform for balancing total costs and dependability of a system. In this work, we apply the FMT formalism to a Smart Building application. We propose a framework for modelling FMTs using probabilistic model checking and present an algorithm for performing abstraction of the FMT in order to reduce the size of its equivalent Continuous Time Markov Chain. This allows us to apply the probabilistic model checking more efficiently. We demonstrate the applicability of our proposed approach by evaluating various dependability metrics and maintenance strategies of a Heating, Ventilation and Air-Conditioning system's FMT.
Critical Success Factors to Improve the Game Development Process from a Developers Perspective
Venue: arXiv cs.SE 2018
Year: 2018

The growth of the software game development industry is enormous and is gaining importance day by day. This growth imposes severe pressure and a number of issues and challenges on the game development community. Game development is a complex process, and one important game development choice is to consider the developer perspective to produce good quality software games by improving the game development process. The objective of this study is to provide a better understanding of the developers dimension as a factor in software game success. It focuses mainly on an empirical investigation of the effect of key developer factors on the software game development process and eventually on the quality of the resulting game. A quantitative survey was developed and conducted to identify key developer factors for an enhanced game development process. For this study, the developed survey was used to test the research model and hypotheses. The results provide evidence that game development organizations must deal with multiple key factors to remain competitive and to handle high pressure in the software game industry. The main contribution of this paper is to investigate empirically the influence of key developer factors on the game development process.
Not All Ops Are Created Equal!
Venue: arXiv cs.LG 2018
Year: 2018

Efficient and compact neural network models are essential for enabling the deployment on mobile and embedded devices. In this work, we point out that typical design metrics for gauging the efficiency of neural network architectures -- total number of operations and parameters -- are not sufficient. These metrics may not accurately correlate with the actual deployment metrics such as energy and memory footprint. We show that throughput and energy varies by up to 5X across different neural network operation types on an off-the-shelf Arm Cortex-M7 microcontroller. Furthermore, we show that the memory required for activation data also need to be considered, apart from the model parameters, for network architecture exploration studies.
Tight Bounds for $\ell_p$ Oblivious Subspace Embeddings
Venue: arXiv cs.DS 2018
Year: 2018

An $\ell_p$ oblivious subspace embedding is a distribution over $r \times n$ matrices $Π$ such that for any fixed $n \times d$ matrix $A$, $$\Pr_Π[\textrm{for all }x, \ \|Ax\|_p \leq \|ΠAx\|_p \leq κ\|Ax\|_p] \geq 9/10,$$ where $r$ is the dimension of the embedding, $κ$ is the distortion of the embedding, and for an $n$-dimensional vector $y$, $\|y\|_p$ is the $\ell_p$-norm. Another important property is the sparsity of $Π$, that is, the maximum number of non-zero entries per column, as this determines the running time of computing $Π\cdot A$. While for $p = 2$ there are nearly optimal tradeoffs in terms of the dimension, distortion, and sparisty, for the important case of $1 \leq p < 2$, much less was known. In this paper we obtain nearly optimal tradeoffs for $\ell_p$ oblivious subspace embeddings for every $1 \leq p < 2$. We show for every $1 \leq p < 2$, any oblivious subspace embedding with dimension $r$ has distortion $κ= Ω\left(\frac{1}{\left(\frac{1}{d}\right)^{1 / p} \cdot \log^{2 / p}r + \left(\frac{r}{n}\right)^{1 / p - 1 / 2}}\right).$ When $r = \mathrm{poly}(d)$ in applications, this gives a $κ= Ω(d^{1/p}\log^{-2/p} d)$ lower bound, and shows the oblivious subspace embedding of Sohler and Woodruff (STOC, 2011) for $p = 1$ and the oblivious subspace embedding of Meng and Mahoney (STOC, 2013) for $1 < p < 2$ are optimal up to $\mathrm{poly}(\log(d))$ factors. We also give sparse oblivious subspace embeddings for every $1 \leq p < 2$ which are optimal in dimension and distortion, up to $\mathrm{poly}(\log d)$ factors. Oblivious subspace embeddings are crucial for distributed and streaming environments, as well as entrywise $\ell_p$ low rank approximation. Our results give improved algorithms for these applications.
Better Runtime Guarantees Via Stochastic Domination
Venue: arXiv cs.NE 2018
Year: 2018

Apart from few exceptions, the mathematical runtime analysis of evolutionary algorithms is mostly concerned with expected runtimes. In this work, we argue that stochastic domination is a notion that should be used more frequently in this area. Stochastic domination allows to formulate much more informative performance guarantees, it allows to decouple the algorithm analysis into the true algorithmic part of detecting a domination statement and the probability-theoretical part of deriving the desired probabilistic guarantees from this statement, and it helps finding simpler and more natural proofs. As particular results, we prove a fitness level theorem which shows that the runtime is dominated by a sum of independent geometric random variables, we prove the first tail bounds for several classic runtime problems, and we give a short and natural proof for Witt's result that the runtime of any $(μ,p)$ mutation-based algorithm on any function with unique optimum is subdominated by the runtime of a variant of the \oea on the \onemax function. As side-products, we determine the fastest unbiased (1+1) algorithm for the \leadingones benchmark problem, both in the general case and when restricted to static mutation operators, and we prove a Chernoff-type tail bound for sums of independent coupon collector distributions.
Brain EEG Time Series Selection: A Novel Graph-Based Approach for Classification
Venue: arXiv cs.LG 2018
Year: 2018

Brain Electroencephalography (EEG) classification is widely applied to analyze cerebral diseases in recent years. Unfortunately, invalid/noisy EEGs degrade the diagnosis performance and most previously developed methods ignore the necessity of EEG selection for classification. To this end, this paper proposes a novel maximum weight clique-based EEG selection approach, named mwcEEGs, to map EEG selection to searching maximum similarity-weighted cliques from an improved Fréchet distance-weighted undirected EEG graph simultaneously considering edge weights and vertex weights. Our mwcEEGs improves the classification performance by selecting intra-clique pairwise similar and inter-clique discriminative EEGs with similarity threshold $δ$. Experimental results demonstrate the algorithm effectiveness compared with the state-of-the-art time series selection algorithms on real-world EEG datasets.
A Bio-inspired Collision Detecotr for Small Quadcopter
Venue: arXiv cs.NE 2018
Year: 2018

Sense and avoid capability enables insects to fly versatilely and robustly in dynamic complex environment. Their biological principles are so practical and efficient that inspired we human imitating them in our flying machines. In this paper, we studied a novel bio-inspired collision detector and its application on a quadcopter. The detector is inspired from LGMD neurons in the locusts, and modeled into an STM32F407 MCU. Compared to other collision detecting methods applied on quadcopters, we focused on enhancing the collision selectivity in a bio-inspired way that can considerably increase the computing efficiency during an obstacle detecting task even in complex dynamic environment. We designed the quadcopter's responding operation imminent collisions and tested this bio-inspired system in an indoor arena. The observed results from the experiments demonstrated that the LGMD collision detector is feasible to work as a vision module for the quadcopter's collision avoidance task.
On the effect of blockage objects in dense MIMO SWIPT networks
Venue: arXiv cs.IT 2018
Year: 2018

Simultaneous information and power transfer (SWIPT) is characterised by the ambiguous role of multi-user interference. In short, the beneficial effect of multi-user interference on RF energy harvesting is obtained at the price of a reduced link capacity, thus originating nontrivial trade-offs between the achievable information rate and the harvestable energy. Arguably, in indoor environments, this trade-off might be affected by the propagation loss due to blockage objects like walls. Hence, a couple of fundamental questions arise. How much must the network elements be densified to counteract the blockage attenuation? Is blockage always detrimental on the achievable rate-energy trade-off? In this paper, we analyse the performance of an indoor multiple-input multiple-output (MIMO) SWIPT-enabled network in the attempt to shed a light of those questions. The effects of the obstacles are examined with the help of a stochastic approach in which energy transmitters (also referred to as power heads) are located by using a Poisson Point Process and walls are generated through a Manhattan Poisson Line Process. The stochastic behaviour of the signal attenuation and the multi-user interference is studied to obtain the Joint Complementary Cumulative Distribution Function (J-CCDF) of information rate and harvested power. Theoretical results are validated through Monte Carlo simulations. Eventually, the rate-energy trade-off is presented as a function of the frequency of walls to emphasise the cross-dependences between the deployment of the network elements and the topology of the venue.
Towards Realistic Threat Modeling: Attack Commodification, Irrelevant Vulnerabilities, and Unrealistic Assumptions
Venue: arXiv cs.CR 2018
Year: 2018

Current threat models typically consider all possible ways an attacker can penetrate a system and assign probabilities to each path according to some metric (e.g. time-to-compromise). In this paper we discuss how this view hinders the realness of both technical (e.g. attack graphs) and strategic (e.g. game theory) approaches of current threat modeling, and propose to steer away by looking more carefully at attack characteristics and attacker environment. We use a toy threat model for ICS attacks to show how a realistic view of attack instances can emerge from a simple analysis of attack phases and attacker limitations.
Hierarchical Memory Management for Mutable State
Venue: arXiv cs.PL 2018
Year: 2018

It is well known that modern functional programming languages are naturally amenable to parallel programming. Achieving efficient parallelism using functional languages, however, remains difficult. Perhaps the most important reason for this is their lack of support for efficient in-place updates, i.e., mutation, which is important for the implementation of both parallel algorithms and the run-time system services (e.g., schedulers and synchronization primitives) used to execute them. In this paper, we propose techniques for efficient mutation in parallel functional languages. To this end, we couple the memory manager with the thread scheduler to make reading and updating data allocated by nested threads efficient. We describe the key algorithms behind our technique, implement them in the MLton Standard ML compiler, and present an empirical evaluation. Our experiments show that the approach performs well, significantly improving efficiency over existing functional language implementations.
Enhancing Stratified Graph Sampling Algorithms based on Approximate Degree Distribution
Venue: arXiv cs.SI 2018
Year: 2018

Sampling technique has become one of the recent research focuses in the graph-related fields. Most of the existing graph sampling algorithms tend to sample the high degree or low degree nodes in the complex networks because of the characteristic of scale-free. Scale-free means that degrees of different nodes are subject to a power law distribution. So, there is a significant difference in the degrees between the overall sampling nodes. In this paper, we propose an idea of approximate degree distribution and devise a stratified strategy using it in the complex networks. We also develop two graph sampling algorithms combining the node selection method with the stratified strategy. The experimental results show that our sampling algorithms preserve several properties of different graphs and behave more accurately than other algorithms. Further, we prove the proposed algorithms are superior to the off-the-shelf algorithms in terms of the unbiasedness of the degrees and more efficient than state-of-the-art FFS and ES-i algorithms.