OpenRaiser/Intern-Atlas huggingface dataset:
Decoding Sentiment from Distributed Representations of Sentences
Venue: arXiv cs.CL 2017
Year: 2017

Distributed representations of sentences have been developed recently to represent their meaning as real-valued vectors. However, it is not clear how much information such representations retain about the polarity of sentences. To study this question, we decode sentiment from unsupervised sentence representations learned with different architectures (sensitive to the order of words, the order of sentences, or none) in 9 typologically diverse languages. Sentiment results from the (recursive) composition of lexical items and grammatical strategies such as negation and concession. The results are manifold: we show that there is no `one-size-fits-all' representation architecture outperforming the others across the board. Rather, the top-ranking architectures depend on the language and data at hand. Moreover, we find that in several cases the additive composition model based on skip-gram word vectors may surpass supervised state-of-art architectures such as bidirectional LSTMs. Finally, we provide a possible explanation of the observed variation based on the type of negative constructions in each language.
SimpleSSD: Modeling Solid State Drives for Holistic System Simulation
Venue: arXiv cs.AR 2017
Year: 2017

Existing solid state drive (SSD) simulators unfortunately lack hardware and/or software architecture models. Consequently, they are far from capturing the critical features of contemporary SSD devices. More importantly, while the performance of modern systems that adopt SSDs can vary based on their numerous internal design parameters and storage-level configurations, a full system simulation with traditional SSD models often requires unreasonably long runtimes and excessive computational resources. In this work, we propose SimpleSSD, a highfidelity simulator that models all detailed characteristics of hardware and software, while simplifying the nondescript features of storage internals. In contrast to existing SSD simulators, SimpleSSD can easily be integrated into publicly-available full system simulators. In addition, it can accommodate a complete storage stack and evaluate the performance of SSDs along with diverse memory technologies and microarchitectures. Thus, it facilitates simulations that explore the full design space at different levels of system abstraction.
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories
Venue: arXiv cs.LO 2017
Year: 2017

Cyclic data structures, such as cyclic lists, in functional programming are tricky to handle because of their cyclicity. This paper presents an investigation of categorical, algebraic, and computational foundations of cyclic datatypes. Our framework of cyclic datatypes is based on second-order algebraic theories of Fiore et al., which give a uniform setting for syntax, types, and computation rules for describing and reasoning about cyclic datatypes. We extract the "fold" computation rules from the categorical semantics based on iteration categories of Bloom and Esik. Thereby, the rules are correct by construction. We prove strong normalisation using the General Schema criterion for second-order computation rules. Rather than the fixed point law, we particularly choose Bekic law for computation, which is a key to obtaining strong normalisation. We also prove the property of "Church-Rosser modulo bisimulation" for the computation rules. Combining these results, we have a remarkable decidability result of the equational theory of cyclic data and fold.
On the trade-off between labels and weights in quantitative bisimulation
Venue: arXiv cs.LO 2017
Year: 2017

Reductions for transition systems have been recently introduced as a uniform and principled method for comparing the expressiveness of system models with respect to a range of properties, especially bisimulations. In this paper we study the expressiveness (w.r.t. bisimulations) of models for quantitative computations such as weighted labelled transition systems (WLTSs), uniform labelled transition systems (ULTraSs), and state-to-function transition systems (FuTSs). We prove that there is a trade-off between labels and weights: at one extreme lays the class of (unlabelled) weighted transition systems where information is presented using weights only; at the other lays the class of labelled transition systems (LTSs) where information is shifted on labels. These categories of systems cannot be further reduced in any significant way and subsume all the aforementioned models.
Protecting Against Untrusted Relays: An Information Self-encrypted Approach
Venue: arXiv cs.IT 2017
Year: 2017

The reliability and transmission distance are generally limited for the wireless communications due to the severe channel fading. As an effective way to resist the channel fading, cooperative relaying is usually adopted in wireless networks where neighbouring nodes act as relays to help the transmission between the source and the destination. Most research works simply regard these cooperative nodes trustworthy, which may be not practical in some cases especially when transmitting confidential information. In this paper, we consider the issue of untrusted relays in cooperative communications and propose an information self-encrypted approach to protect against these relays. Specifically, the original packets of the information are used to encrypt each other as the secret keys such that the information cannot be recovered before all of the encrypted packets have been received. The information is intercepted only when the relays obtain all of these encrypted packets. It is proved that the intercept probability is reduced to zero exponentially with the number of the original packets. However, the security performance is still not satisfactory for a large number of relays. Therefore, the combination of destination-based jamming is further adopted to confuse the relays, which makes the security performance acceptable even for a large number of relays. Finally, the simulation results are provided to confirm the theoretical analysis and the superiority of the proposed scheme.
Energy-efficient 3D UAV-BS Placement Versus Mobile Users' Density and Circuit Power
Venue: arXiv cs.IT 2017
Year: 2017

Properly 3D placement of unmanned aerial vehicle mounted base stations (UAV-BSs) can effectively prolong the life-time of the mobile ad hoc network, since UAVs are usually powered by batteries. This paper involves the on-board circuit consumption power and considers the optimal placement that minimizes the UAV-recall-frequency (UAV-RF), which is defined to characterize the life-time of this kind of network. Theoretical results show that the optimal vertical and horizontal dimensions of UAV can be decoupled. That is, the optimal hovering altitude is proportional to the coverage radius of UAVs, and the slope is only determined by environment. Dense scattering environment may greatly enlarge the needed hovering altitude. Also, the optimal coverage radius is achieved when the transmit power equals to on-board circuit power, and hence limiting on-board circuit power can effectively enlarge life-time of system. In addition, our proposed 3D placement method only require the statistics of mobile users' density and environment parameters, and hence it's a typical on-line method and can be easily implemented. Also, it can be utilized in scenarios with varying users' density.
A fully dense and globally consistent 3D map reconstruction approach for GI tract to enhance therapeutic relevance of the endoscopic capsule robot
Venue: arXiv cs.CV 2017
Year: 2017

In the gastrointestinal (GI) tract endoscopy field, ingestible wireless capsule endoscopy is emerging as a novel, minimally invasive diagnostic technology for inspection of the GI tract and diagnosis of a wide range of diseases and pathologies. Since the development of this technology, medical device companies and many research groups have made substantial progress in converting passive capsule endoscopes to robotic active capsule endoscopes with most of the functionality of current active flexible endoscopes. However, robotic capsule endoscopy still has some challenges. In particular, the use of such devices to generate a precise three-dimensional (3D) mapping of the entire inner organ remains an unsolved problem. Such global 3D maps of inner organs would help doctors to detect the location and size of diseased areas more accurately and intuitively, thus permitting more reliable diagnoses. To our knowledge, this paper presents the first complete pipeline for a complete 3D visual map reconstruction of the stomach. The proposed pipeline is modular and includes a preprocessing module, an image registration module, and a final shape-from-shading-based 3D reconstruction module; the 3D map is primarily generated by a combination of image stitching and shape-from-shading techniques, and is updated in a frame-by-frame iterative fashion via capsule motion inside the stomach. A comprehensive quantitative analysis of the proposed 3D reconstruction method is performed using an esophagus gastro duodenoscopy simulator, three different endoscopic cameras, and a 3D optical scanner.
Robust randomized matchings
Venue: arXiv cs.DM 2017
Year: 2017

The following game is played on a weighted graph: Alice selects a matching $M$ and Bob selects a number $k$. Alice's payoff is the ratio of the weight of the $k$ heaviest edges of $M$ to the maximum weight of a matching of size at most $k$. If $M$ guarantees a payoff of at least $α$ then it is called $α$-robust. In 2002, Hassin and Rubinstein gave an algorithm that returns a $1/\sqrt{2}$-robust matching, which is best possible. We show that Alice can improve her payoff to $1/\ln(4)$ by playing a randomized strategy. This result extends to a very general class of independence systems that includes matroid intersection, b-matchings, and strong 2-exchange systems. It also implies an improved approximation factor for a stochastic optimization variant known as the maximum priority matching problem and translates to an asymptotic robustness guarantee for deterministic matchings, in which Bob can only select numbers larger than a given constant. Moreover, we give a new LP-based proof of Hassin and Rubinstein's bound.
Spin Summations: A High-Performance Perspective
Venue: arXiv cs.MS 2017
Year: 2017

Besides tensor contractions, one of the most pronounced computational bottlenecks in the non-orthogonally spin-adapted forms of the quantum chemistry methods CCSDT and CCSDTQ, and their approximate forms---including CCSD(T) and CCSDT(Q)---are spin summations. At a first sight, spin summations are operations similar to tensor transpositions; a closer look instead reveals additional challenges to high-performance calculations, including temporal locality as well as scattered memory accesses. This publication explores a sequence of algorithmic solutions for spin summations, each exploiting individual properties of either the underlying hardware (e.g. caches, vectorization), or the problem itself (e.g. factorizability). The final algorithm combines the advantages of all the solutions, while avoiding their drawbacks; this algorithm, achieves high-performance through parallelization, vectorization, and by exploiting the temporal locality inherent to spin summations. Combined, these optimizations result in speedups between 2.4x and 5.5x over the NCC quantum chemistry software package. In addition to such a performance boost, our algorithm can perform the spin summations in-place, thus reducing the memory footprint by 2x over an out-of-place variant.
Introducing Geometric Algebra to Geometric Computing Software Developers: A Computational Thinking Approach
Venue: arXiv cs.MS 2017
Year: 2017

Designing software systems for Geometric Computing applications can be a challenging task. Software engineers typically use software abstractions to hide and manage the high complexity of such systems. Without the presence of a unifying algebraic system to describe geometric models, the use of software abstractions alone can result in many design and maintenance problems. Geometric Algebra (GA) can be a universal abstract algebraic language for software engineering geometric computing applications. Few sources, however, provide enough information about GA-based software implementations targeting the software engineering community. In particular, successfully introducing GA to software engineers requires quite different approaches from introducing GA to mathematicians or physicists. This article provides a high-level introduction to the abstract concepts and algebraic representations behind the elegant GA mathematical structure. The article focuses on the conceptual and representational abstraction levels behind GA mathematics with sufficient references for more details. In addition, the article strongly recommends applying the methods of Computational Thinking in both introducing GA to software engineers, and in using GA as a mathematical language for developing Geometric Computing software systems.
Interference Alignment with Power Splitting Relays in Multi-User Multi-Relay Networks
Venue: arXiv cs.IT 2017
Year: 2017

In this paper, we study a multi-user multi-relay interference-channel network, where energy-constrained relays harvest energy from sources' radio frequency (RF) signals and use the harvested energy to forward the information to destinations. We adopt the interference alignment (IA) technique to address the issue of interference, and propose a novel transmission scheme with the IA at sources and the power splitting (PS) at relays. A distributed and iterative algorithm to obtain the optimal PS ratios is further proposed, aiming at maximizing the sum rate of the network. The analysis is then validated by simulation results. Our results show that the proposed scheme with the optimal design significantly improves the performance of the network.
Joint Uplink and Downlink Coverage Analysis of Cellular-based RF-powered IoT Network
Venue: arXiv cs.IT 2017
Year: 2017

Ambient radio frequency (RF) energy harvesting has emerged as a promising solution for powering small devices and sensors in massive Internet of Things (IoT) ecosystem due to its ubiquity and cost efficiency. In this paper, we study joint uplink and downlink coverage of cellular-based ambient RF energy harvesting IoT where the cellular network is assumed to be the only source of RF energy. We consider a time division-based approach for power and information transmission where each time-slot is partitioned into three sub-slots: (i) charging sub-slot during which the cellular base stations (BSs) act as RF chargers for the IoT devices, which then use the energy harvested in this sub-slot for information transmission and/or reception during the remaining two sub-slots, (ii) downlink sub-slot during which the IoT device receives information from the associated BS, and (iii) uplink sub-slot during which the IoT device transmits information to the associated BS. For this setup, we characterize the joint coverage probability, which is the joint probability of the events that the typical device harvests sufficient energy in the given time slot and is under both uplink and downlink signal-to-interference-plus-noise ratio (SINR) coverage with respect to its associated BS. This metric significantly generalizes the prior art on energy harvesting communications, which usually focused on downlink or uplink coverage separately. The key technical challenge is in handling the correlation between the amount of energy harvested in the charging sub-slot and the information signal quality (SINR) in the downlink and uplink sub-slots. Dominant BS-based approach is developed to derive tight approximation for this joint coverage probability. Several system design insights including comparison with regularly powered IoT network and throughput-optimal slot partitioning are also provided.
Exploring the structure of a real-time, arbitrary neural artistic stylization network
Venue: arXiv cs.CV 2017
Year: 2017

In this paper, we present a method which combines the flexibility of the neural algorithm of artistic style with the speed of fast style transfer networks to allow real-time stylization using any content/style image pair. We build upon recent work leveraging conditional instance normalization for multi-style transfer networks by learning to predict the conditional instance normalization parameters directly from a style image. The model is successfully trained on a corpus of roughly 80,000 paintings and is able to generalize to paintings previously unobserved. We demonstrate that the learned embedding space is smooth and contains a rich structure and organizes semantic information associated with paintings in an entirely unsupervised manner.
The Conference Paper Assignment Problem: Using Order Weighted Averages to Assign Indivisible Goods
Venue: arXiv cs.AI 2017
Year: 2017

Motivated by the common academic problem of allocating papers to referees for conference reviewing we propose a novel mechanism for solving the assignment problem when we have a two sided matching problem with preferences from one side (the agents/reviewers) over the other side (the objects/papers) and both sides have capacity constraints. The assignment problem is a fundamental problem in both computer science and economics with application in many areas including task and resource allocation. We draw inspiration from multi-criteria decision making and voting and use order weighted averages (OWAs) to propose a novel and flexible class of algorithms for the assignment problem. We show an algorithm for finding a $Σ$-OWA assignment in polynomial time, in contrast to the NP-hardness of finding an egalitarian assignment. Inspired by this setting we observe an interesting connection between our model and the classic proportional multi-winner election problem in social choice.
Affine-Gradient Based Local Binary Pattern Descriptor for Texture Classiffication
Venue: arXiv cs.CV 2017
Year: 2017

We present a novel Affine-Gradient based Local Binary Pattern (AGLBP) descriptor for texture classification. It is very hard to describe complicated texture using single type information, such as Local Binary Pattern (LBP), which just utilizes the sign information of the difference between the pixel and its local neighbors. Our descriptor has three characteristics: 1) In order to make full use of the information contained in the texture, the Affine-Gradient, which is different from Euclidean-Gradient and invariant to affine transformation is incorporated into AGLBP. 2) An improved method is proposed for rotation invariance, which depends on the reference direction calculating respect to local neighbors. 3) Feature selection method, considering both the statistical frequency and the intraclass variance of the training dataset, is also applied to reduce the dimensionality of descriptors. Experiments on three standard texture datasets, Outex12, Outex10 and KTH-TIPS2, are conducted to evaluate the performance of AGLBP. The results show that our proposed descriptor gets better performance comparing to some state-of-the-art rotation texture descriptors in texture classification.
Energy-Efficient Resource Allocation for Elastic Optical Networks using Convex Optimization
Venue: arXiv cs.IT 2017
Year: 2017

We propose a two-stage algorithm for energy-efficient resource allocation constrained to QoS and physical requirements in OFDM-based EONs. The first stage deals with routing, grooming and traffic ordering and aims at minimizing amplifier power consumption and number of active transponders. We provide a heuristic procedure which yields an acceptable solution for the complex ILP formulation of the routing and grooming. In the second stage, we optimize transponder configuration including spectrum and transmit power parameters to minimize transponder power consumption. We show how QoS and transponder power consumption are represented by convex expressions and use the results to formulate a convex problem for configuring transponders in which transmit optical power is an optimization variable. Simulation results demonstrate that the power consumption is reduced by 9% when the proposed routing and grooming algorithm is applied to European Cost239 network with aggregate traffic 60 Tbps. It is shown that our convex formulation for transponder parameter assignment is considerably faster than its MINLP counterpart and its ability to optimize transmit optical power improves transponder power consumption by 8% for aggregate traffic 60 Tbps. Furthermore, we investigate the effect of adaptive modulation assignment and transponder capacity on inherent tradeoff between network CAPEX and OPEX.
MPC meets SNA: A Privacy Preserving Analysis of Distributed Sensitive Social Networks
Venue: arXiv cs.SI 2017
Year: 2017

In this paper, we formalize the notion of distributed sensitive social networks (DSSNs), which encompasses networks like enmity networks, financial transaction networks, supply chain networks and sexual relationship networks. Compared to the well studied traditional social networks, DSSNs are often more challenging to study, given the privacy concerns of the individuals on whom the network is knit. In the current work, we envision the use of secure multiparty tools and techniques for performing privacy preserving social network analysis over DSSNs. As a step towards realizing this, we design efficient data-oblivious algorithms for computing the K-shell decomposition and the PageRank centrality measure for a given DSSN. The designed data-oblivious algorithms can be translated into equivalent secure computation protocols. We also list a string of challenges that are needed to be addressed, for employing secure computation protocols as a practical solution for studying DSSNs.
Look Mum, no VM Exits! (Almost)
Venue: arXiv cs.OS 2017
Year: 2017

Multi-core CPUs are a standard component in many modern embedded systems. Their virtualisation extensions enable the isolation of services, and gain popularity to implement mixed-criticality or otherwise split systems. We present Jailhouse, a Linux-based, OS-agnostic partitioning hypervisor that uses novel architectural approaches to combine Linux, a powerful general-purpose system, with strictly isolated special-purpose components. Our design goals favour simplicity over features, establish a minimal code base, and minimise hypervisor activity. Direct assignment of hardware to guests, together with a deferred initialisation scheme, offloads any complex hardware handling and bootstrapping issues from the hypervisor to the general purpose OS. The hypervisor establishes isolated domains that directly access physical resources without the need for emulation or paravirtualisation. This retains, with negligible system overhead, Linux's feature-richness in uncritical parts, while frugal safety and real-time critical workloads execute in isolated, safe domains.