OpenRaiser/Intern-Atlas huggingface dataset:
Decentralized Privacy-preserving Timed Execution in Blockchain-based Smart Contract Platforms
Venue: arXiv cs.CR 2019
Year: 2019

In the age of Big Data, enabling task scheduling while protecting users' privacy is critical for various decentralized applications in blockchain-based smart contract platforms. Such a privacy-preserving task scheduler requires the task input data to be secretly maintained until a prescribed task execution time and be automatically recorded into the blockchain to enabling the execution of the task at the execution time, even if the user goes offline. While straight-forward centralized approaches provide a basic solution to the problem, unfortunately they are limited to a single point of trust and involve a single point of control. This paper presents decentralized techniques for supporting privacy-preserving task scheduling using smart contracts in Ethereum blockchain networks. We design a privacy-preserving task scheduling protocol that is managed by a manager smart contract. The protocol requires a user to schedule a task by deploying a proxy smart contract maintaining the non-sensitive information of the task while creating decentralized secret trust and selecting trustees from the network to maintain the sensitive information of the task. With security techniques including secret sharing and layered encryption as well as security deposit paid by trustees as economic deterrence, the protocol can protect the sensitive information against possible attacks including some trustees destroying the sensitive information (drop attack) or secretly releasing the sensitive information before the execution time (release-ahead attack). We demonstrate the attack-resilience of the proposed protocol through rigorous analysis.Our implementation and experimental evaluation on the Ethereum official test network demonstrate the low monetary cost and the low time overhead associated with the proposed approach.
Environmentally-friendly GR(1) Synthesis
Venue: arXiv cs.LO 2019
Year: 2019

Many problems in reactive synthesis are stated using two formulas ---an environment assumption and a system guarantee--- and ask for an implementation that satisfies the guarantee in environments that satisfy their assumption. Reactive synthesis tools often produce strategies that formally satisfy such specifications by actively preventing an environment assumption from holding. While formally correct, such strategies do not capture the intention of the designer. We introduce an additional requirement in reactive synthesis, non-conflictingness, which asks that a system strategy should always allow the environment to fulfill its liveness requirements. We give an algorithm for solving GR(1) synthesis that produces non-conflicting strategies. Our algorithm is given by a 4-nested fixed point in the $μ$-calculus, in contrast to the usual 3-nested fixed point for GR(1). Our algorithm ensures that, in every environment that satisfies its assumptions on its own, traces of the resulting implementation satisfy both the assumptions and the guarantees. In addition, the asymptotic complexity of our algorithm is the same as that of the usual GR(1) solution. We have implemented our algorithm and show how its performance compares to the usual GR(1) synthesis algorithm.
Using Key Player Analysis as a Method for Examining the Role of Community Animators in Technology Adoption
Venue: arXiv cs.SI 2019
Year: 2019

This paper examines the role of community animators in technology adoption. Community animators are individuals that actively build social networks and broker ties between nodes in those networks. The present study observes technology adoption patterns through data collected from a mobile application at a local arts festival. A social network was constructed through photo-sharing and interaction within the app. Given this data, we propose the use of key player analysis to identify community animators. In addition, we use a graph invariant (i.e., fragmentation in the network) to describe the role and impact of key players on the full network of interactions. Our results contribute to literature on technology adoption in usability studies by proposing a method to quantify and identify the theoretical concept of community animators. We further analyze the types of community animators to be found in early adoption of technology: the early adopters themselves, and the initiating developers.
KINN: Incorporating Expert Knowledge in Neural Networks
Venue: arXiv cs.LG 2019
Year: 2019

The promise of ANNs to automatically discover and extract useful features/patterns from data without dwelling on domain expertise although seems highly promising but comes at the cost of high reliance on large amount of accurately labeled data, which is often hard to acquire and formulate especially in time-series domains like anomaly detection, natural disaster management, predictive maintenance and healthcare. As these networks completely rely on data and ignore a very important modality i.e. expert, they are unable to harvest any benefit from the expert knowledge, which in many cases is very useful. In this paper, we try to bridge the gap between these data driven and expert knowledge based systems by introducing a novel framework for incorporating expert knowledge into the network (KINN). Integrating expert knowledge into the network has three key advantages: (a) Reduction in the amount of data needed to train the model, (b) provision of a lower bound on the performance of the resulting classifier by obtaining the best of both worlds, and (c) improved convergence of model parameters (model converges in smaller number of epochs). Although experts are extremely good in solving different tasks, there are some trends and patterns, which are usually hidden only in the data. Therefore, KINN employs a novel residual knowledge incorporation scheme, which can automatically determine the quality of the predictions made by the expert and rectify it accordingly by learning the trends/patterns from data. Specifically, the method tries to use information contained in one modality to complement information missed by the other. We evaluated KINN on a real world traffic flow prediction problem. KINN significantly superseded performance of both the expert and as well as the base network (LSTM in this case) when evaluated in isolation, highlighting its superiority for the task.
Probabilistic Relational Agent-based Models
Venue: arXiv cs.AI 2019
Year: 2019

PRAM puts agent-based models on a sound probabilistic footing as a basis for integrating agent-based and probabilistic models. It extends the themes of probabilistic relational models and lifted inference to incorporate dynamical models and simulation. It can also be much more efficient than agent-based simulation.
Deep Spiking Neural Network with Spike Count based Learning Rule
Venue: arXiv cs.NE 2019
Year: 2019

Deep spiking neural networks (SNNs) support asynchronous event-driven computation, massive parallelism and demonstrate great potential to improve the energy efficiency of its synchronous analog counterpart. However, insufficient attention has been paid to neural encoding when designing SNN learning rules. Remarkably, the temporal credit assignment has been performed on rate-coded spiking inputs, leading to poor learning efficiency. In this paper, we introduce a novel spike-based learning rule for rate-coded deep SNNs, whereby the spike count of each neuron is used as a surrogate for gradient backpropagation. We evaluate the proposed learning rule by training deep spiking multi-layer perceptron (MLP) and spiking convolutional neural network (CNN) on the UCI machine learning and MNIST handwritten digit datasets. We show that the proposed learning rule achieves state-of-the-art accuracies on all benchmark datasets. The proposed learning rule allows introducing latency, spike rate and hardware constraints into the SNN learning, which is superior to the indirect approach in which conventional artificial neural networks are first trained and then converted to SNNs. Hence, it allows direct deployment to the neuromorphic hardware and supports efficient inference. Notably, a test accuracy of 98.40% was achieved on the MNIST dataset in our experiments with only 10 simulation time steps, when the same latency constraint is imposed during training.
Coalgebra Learning via Duality
Venue: arXiv cs.LO 2019
Year: 2019

Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as tests, based on a dual adjunction between states and logical theories. This allows us to learn, e.g., labelled transition systems, using Hennessy-Milner logic. Our main contribution is an abstract learning algorithm, together with a proof of correctness and termination.
A Comparison of Random Task Graph Generation Methods for Scheduling Problems
Venue: arXiv cs.DC 2019
Year: 2019

How to generate instances with relevant properties and without bias remains an open problem of critical importance for a fair comparison of heuristics. In the context of scheduling with precedence constraints, the instance consists of a task graph that determines a partial order on task executions. To avoid selecting instances among a set populated mainly with trivial ones, we rely on properties that quantify the characteristics specific to difficult instances. Among numerous identified such properties, the mass measures how much a task graph can be decomposed into smaller ones. This property, together with an in-depth analysis of existing random task graph generation methods, establishes the sub-exponential generic time complexity of the studied problem. Empirical observations on the impact of existing generation methods on scheduling heuristics concludes our study.
Uncertainty Management in Software Projects: A Case Study in a Public Company
Venue: arXiv cs.SE 2019
Year: 2019

Software development meets the various challenges of rapidly growing markets. To address such challenges projects to design and adopt specific development approaches. However, various project management approaches do not consider the uncertainties that exist in projects. In this paper, we present findings from a case study in which we explore how to apply the Management Uncertainty Software Project (MUPS) approach. We do so by the empirical investigation at a public organization in Brazil. The objective of this study is to contribute to the body of knowledge regarding the potential benefits of MUSP approach. The conclusions of the empirical study will help both researchers and practitioners to understand better which benefits are already being realized in practice, and how they can best be realized.
Phase field modeling of quasi-static and dynamic crack propagation: COMSOL implementation and case studies
Venue: arXiv cs.CE 2019
Year: 2019

The phase-field model (PFM) represents the crack geometry in a diffusive way without introducing sharp discontinuities. This feature enables PFM to effectively model crack propagation compared with numerical methods based on discrete crack model, especially for complex crack patterns. Due to the involvement of \phased field", phase-field method can be essentially treated a multifield problem even for pure mechanical problem. Therefore, it is supposed that the implementation of PFM based on a software developer that especially supports the solution of multifield problems should be more effective, simpler and more efficient than PFM implemented on a general finite element software. In this work, the authors aim to devise a simple and efficient implementation of phase-field model for the modelling of quasi-static and dynamic fracture in the general purpose commercial software developer, COMSOL Multiphysics. Notably only the tensile stress induced crack is accounted for crack evolution by using the decomposition of elastic strain energy. The width of the diffusive crack is controlled by a length-scale parameter. Equations that govern body motion and phase-field evolution are written into different modules in COMSOL, which are then coupled to a whole system to be solved. A staggered scheme is adopted to solve the coupled system and each module is solved sequentially during one time step. A number of 2D and 3D examples are tested to investigate the performance of the present implementation. Our simulations show good agreement with previous works, indicating the feasibility and validity of the COMSOL implementation of PFM.
Replications in quantitative and qualitative methods: a new era for commensurable digital social sciences
Venue: arXiv cs.SI 2019
Year: 2019

Social sciences were built from comparison methods assembling field works and data, either quantitative or qualitative. Big Data offers new opportunities to extend this requirement to build commensurable data sets. The paper tells the story of the two previous quantification eras (census and polls) in order to demonstrate the need for a new agency to be considered as the target of this new generation of social sciences: that of objects as Actor Network Theory proposed and of replications that propagate all over the digital networks. The case study of Latour's topofil of Boa Vista is revisited to explore how a qualitative method dedicated to comparison and an Actor Network Theory approach extended in a replication theory may offer new insights from any field study and may use the digital ressources to do so.
DOCSDN: Dynamic and Optimal Configuration of Software-Defined Networks
Venue: arXiv cs.CR 2019
Year: 2019

Networks are designed with functionality, security, performance, and cost in mind. Tools exist to check or optimize individual properties of a network. These properties may conflict, so it is not always possible to run these tools in series to find a configuration that meets all requirements. This leads to network administrators manually searching for a configuration. This need not be the case. In this paper, we introduce a layered framework for optimizing network configuration for functional and security requirements. Our framework is able to output configurations that meet reachability, bandwidth, and risk requirements. Each layer of our framework optimizes over a single property. A lower layer can constrain the search problem of a higher layer allowing the framework to converge on a joint solution. Our approach has the most promise for software-defined networks which can easily reconfigure their logical configuration. Our approach is validated with experiments over the fat tree topology, which is commonly used in data center networks. Search terminates in between 1-5 minutes in experiments. Thus, our solution can propose new configurations for short term events such as defending against a focused network attack.
Characterizing the Nonlinearity of Power System Generator Models
Venue: arXiv cs.SY 2019
Year: 2019

Power system dynamics are naturally nonlinear. The nonlinearity stems from power flows, generator dynamics, and electromagnetic transients. Characterizing the nonlinearity of the dynamical power system model is useful for designing superior estimation and control methods, providing better situational awareness and system stability. In this paper, we consider the synchronous generator model with a phasor measurement unit (PMU) that is installed at the terminal bus of the generator. The corresponding nonlinear process-measurement model is shown to be locally Lipschitz, i.e., the dynamics are limited in how fast they can evolve in an arbitrary compact region of the state-space. We then investigate different methods to compute Lipschitz constants for this model, which is vital for performing dynamic state estimation (DSE) or state-feedback control using Lyapunov theory. In particular, we compare a derived analytical bound with numerical methods based on low discrepancy sampling algorithms. Applications of the computed bounds to dynamic state estimation are showcased. The paper is concluded with numerical tests.
A QUIC Implementation for ns-3
Venue: arXiv cs.NI 2019
Year: 2019

Quick UDP Internet Connections (QUIC) is a recently proposed transport protocol, currently being standardized by the Internet Engineering Task Force (IETF). It aims at overcoming some of the shortcomings of TCP, while maintaining the logic related to flow and congestion control, retransmissions and acknowledgments. It supports multiplexing of multiple application layer streams in the same connection, a more refined selective acknowledgment scheme, and low-latency connection establishment. It also integrates cryptographic functionalities in the protocol design. Moreover, QUIC is deployed at the application layer, and encapsulates its packets in UDP datagrams. Given the widespread interest in the new QUIC features, we believe that it is important to provide to the networking community an implementation in a controllable and isolated environment, i.e., a network simulator such as ns-3, in which it is possible to test QUIC's performance and understand design choices and possible limitations. Therefore, in this paper we present a native implementation of QUIC for ns-3, describing the features we implemented, the main assumptions and differences with respect to the QUIC Internet Drafts, and a set of examples.
Compiled Obfuscation for Data Structures in Encrypted Computing
Venue: arXiv cs.CR 2019
Year: 2019

Encrypted computing is an emerging technology based on a processor that `works encrypted', taking encrypted inputs to encrypted outputs while data remains in encrypted form throughout. It aims to secure user data against possible insider attacks by the operator and operating system (who do not know the user's encryption key and cannot access it in the processor). Formally `obfuscating' compilation for encrypted computing is such that on each recompilation of the source code, machine code of the same structure is emitted for which runtime traces also all have the same structure but each word beneath the encryption differs from nominal with maximal possible entropy across recompilations. That generates classic cryptographic semantic security for data, relative to the security of the encryption, but it guarantees only single words and an adversary has more than that on which to base decryption attempts. This paper extends the existing integer-based technology to doubles, floats, arrays, structs and unions as data structures, covering ANSI C. A single principle drives compiler design and improves the existing security theory to quantitative results: every arithmetic instruction that writes must vary to the maximal extent possible.
A partition of unity approach to fluid mechanics and fluid-structure interaction
Venue: arXiv cs.CE 2019
Year: 2019

For problems involving large deformations of thin structures, simulating fluid-structure interaction (FSI) remains challenging largely due to the need to balance computational feasibility, efficiency, and solution accuracy. Overlapping domain techniques have been introduced as a way to combine the fluid-solid mesh conformity, seen in moving-mesh methods, without the need for mesh smoothing or re-meshing, which is a core characteristic of fixed mesh approaches. In this work, we introduce a novel overlapping domain method based on a partition of unity approach. Unified function spaces are defined as a weighted sum of fields given on two overlapping meshes. The method is shown to achieve optimal convergence rates and to be stable for steady-state Stokes, Navier-Stokes, and ALE Navier-Stokes problems. Finally, we present results for FSI in the case of a 2D mock aortic valve simulation. These initial results point to the potential applicability of the method to a wide range of FSI applications, enabling boundary layer refinement and large deformations without the need for re-meshing or user-defined stabilization.
A Novel Error Performance Analysis Methodology for OFDM-IM
Venue: arXiv cs.IT 2019
Year: 2019

Orthogonal frequency-division multiplexing with index modulation (OFDM-IM) has become a high-profile candidate for the modulation scheme in next generation networks, and many works have been published to analyze it in recent years. Error performance is one of the most important and interesting aspects of OFDM-IM, which has been analyzed in most works. However, most of them employ two key approximations to derive the closed-form expressions of block error rate (BLER) and/or average bit error rate (BER). The first one is to utilize the union bound assisted by the pairwise error probability (PEP) analysis, and the second one is to employ an exponential approximation of Q-function. In this letter, we apply Craig's formula to analyze the error performance for OFDM-IM in place of the exponential approximation. Because Craig's formula is the exact expression of Q-function, the accuracy of analytical results regarding error performance for OFDM-IM can be improved. We examine the proposed error performance analysis methodology based on Craig's formula by investigating both average BLER and BER.
Learning Linear-Quadratic Regulators Efficiently with only $\sqrt{T}$ Regret
Venue: arXiv cs.LG 2019
Year: 2019

We present the first computationally-efficient algorithm with $\widetilde O(\sqrt{T})$ regret for learning in Linear Quadratic Control systems with unknown dynamics. By that, we resolve an open question of Abbasi-Yadkori and Szepesvári (2011) and Dean, Mania, Matni, Recht, and Tu (2018).
"Touching to See" and "Seeing to Feel": Robotic Cross-modal SensoryData Generation for Visual-Tactile Perception
Venue: arXiv cs.RO 2019
Year: 2019

The integration of visual-tactile stimulus is common while humans performing daily tasks. In contrast, using unimodal visual or tactile perception limits the perceivable dimensionality of a subject. However, it remains a challenge to integrate the visual and tactile perception to facilitate robotic tasks. In this paper, we propose a novel framework for the cross-modal sensory data generation for visual and tactile perception. Taking texture perception as an example, we apply conditional generative adversarial networks to generate pseudo visual images or tactile outputs from data of the other modality. Extensive experiments on the ViTac dataset of cloth textures show that the proposed method can produce realistic outputs from other sensory inputs. We adopt the structural similarity index to evaluate similarity of the generated output and real data and results show that realistic data have been generated. Classification evaluation has also been performed to show that the inclusion of generated data can improve the perception performance. The proposed framework has potential to expand datasets for classification tasks, generate sensory outputs that are not easy to access, and also advance integrated visual-tactile perception.
A semi-supervised deep residual network for mode detection in Wi-Fi signals
Venue: arXiv cs.LG 2019
Year: 2019

Due to their ubiquitous and pervasive nature, Wi-Fi networks have the potential to collect large-scale, low-cost, and disaggregate data on multimodal transportation. In this study, we develop a semi-supervised deep residual network (ResNet) framework to utilize Wi-Fi communications obtained from smartphones for the purpose of transportation mode detection. This framework is evaluated on data collected by Wi-Fi sensors located in a congested urban area in downtown Toronto. To tackle the intrinsic difficulties and costs associated with labelled data collection, we utilize ample amount of easily collected low-cost unlabelled data by implementing the semi-supervised part of the framework. By incorporating a ResNet architecture as the core of the framework, we take advantage of the high-level features not considered in the traditional machine learning frameworks. The proposed framework shows a promising performance on the collected data, with a prediction accuracy of 81.8% for walking, 82.5% for biking and 86.0% for the driving mode.