OpenRaiser/Intern-Atlas huggingface dataset:
Spectral Graph Forge: Graph Generation Targeting Modularity
Venue: arXiv cs.SI 2018
Year: 2018

Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure. In this paper, we introduce a principled methodology, the Spectral Graph Forge, for generating random graphs that preserves community structure from a real network of interest, in terms of modularity. Our approach leverages the fact that the spectral structure of matrix representations of a graph encodes global information about community structure. The Spectral Graph Forge uses a low-rank approximation of the modularity matrix to generate synthetic graphs that match a target modularity within user-selectable degree of accuracy, while allowing other aspects of structure to vary. We show that the Spectral Graph Forge outperforms state-of-the-art techniques in terms of accuracy in targeting the modularity and randomness of the realizations, while also preserving other local structural properties and node attributes. We discuss extensions of the Spectral Graph Forge to target other properties beyond modularity, and its applications to anonymization.
On the manipulation of articulated objects in human-robot cooperation scenarios
Venue: arXiv cs.RO 2018
Year: 2018

Articulated and flexible objects constitute a challenge for robot manipulation tasks but are present in different real-world settings, including home and industrial environments. Current approaches to the manipulation of articulated and flexible objects employ ad hoc strategies to sequence and perform actions on them depending on a number of physical or geometrical characteristics related to those objects, as well as on an a priori classification of target object configurations. In this paper, we propose an action planning and execution framework, which (i) considers abstract representations of articulated or flexible objects, (ii) integrates action planning to reason upon such configurations and to sequence an appropriate set of actions with the aim of obtaining a target configuration provided as a goal, and (iii) is able to cooperate with humans to collaboratively carry out the plan. On the one hand, we show that a trade-off exists between the way articulated or flexible objects are perceived and how the system represents them. Such a trade-off greatly impacts on the complexity of the planning process. On the other hand, we demonstrate the system's capabilities in allowing humans to interrupt robot action execution, and - in general - to contribute to the whole manipulation process. Results related to planning performance are discussed, and examples of a Baxter dual-arm manipulator performing actions collaboratively with humans are shown.
Unsupervised Low-Dimensional Vector Representations for Words, Phrases and Text that are Transparent, Scalable, and produce Similarity Metrics that are Complementary to Neural Embeddings
Venue: arXiv cs.CL 2018
Year: 2018

Neural embeddings are a popular set of methods for representing words, phrases or text as a low dimensional vector (typically 50-500 dimensions). However, it is difficult to interpret these dimensions in a meaningful manner, and creating neural embeddings requires extensive training and tuning of multiple parameters and hyperparameters. We present here a simple unsupervised method for representing words, phrases or text as a low dimensional vector, in which the meaning and relative importance of dimensions is transparent to inspection. We have created a near-comprehensive vector representation of words, and selected bigrams, trigrams and abbreviations, using the set of titles and abstracts in PubMed as a corpus. This vector is used to create several novel implicit word-word and text-text similarity metrics. The implicit word-word similarity metrics correlate well with human judgement of word pair similarity and relatedness, and outperform or equal all other reported methods on a variety of biomedical benchmarks, including several implementations of neural embeddings trained on PubMed corpora. Our implicit word-word metrics capture different aspects of word-word relatedness than word2vec-based metrics and are only partially correlated (rho = ~0.5-0.8 depending on task and corpus). The vector representations of words, bigrams, trigrams, abbreviations, and PubMed title+abstracts are all publicly available from http://arrowsmith.psych.uic.edu for release under CC-BY-NC license. Several public web query interfaces are also available at the same site, including one which allows the user to specify a given word and view its most closely related terms according to direct co-occurrence as well as different implicit similarity metrics.
Improved Style Transfer by Respecting Inter-layer Correlations
Venue: arXiv cs.CV 2018
Year: 2018

A popular series of style transfer methods apply a style to a content image by controlling mean and covariance of values in early layers of a feature stack. This is insufficient for transferring styles that have strong structure across spatial scales like, e.g., textures where dots lie on long curves. This paper demonstrates that controlling inter-layer correlations yields visible improvements in style transfer methods. We achieve this control by computing cross-layer, rather than within-layer, gram matrices. We find that (a) cross-layer gram matrices are sufficient to control within-layer statistics. Inter-layer correlations improves style transfer and texture synthesis. The paper shows numerous examples on "hard" real style transfer problems (e.g. long scale and hierarchical patterns); (b) a fast approximate style transfer method can control cross-layer gram matrices; (c) we demonstrate that multiplicative, rather than additive style and content loss, results in very good style transfer. Multiplicative loss produces a visible emphasis on boundaries, and means that one hyper-parameter can be eliminated.
Faster Deep Q-learning using Neural Episodic Control
Venue: arXiv cs.LG 2018
Year: 2018

The research on deep reinforcement learning which estimates Q-value by deep learning has been attracted the interest of researchers recently. In deep reinforcement learning, it is important to efficiently learn the experiences that an agent has collected by exploring environment. We propose NEC2DQN that improves learning speed of a poor sample efficiency algorithm such as DQN by using good one such as NEC at the beginning of learning. We show it is able to learn faster than Double DQN or N-step DQN in the experiments of Pong.
Optimized Preference-Aware Multi-path Video Streaming with Scalable Video Coding
Venue: arXiv cs.NI 2018
Year: 2018

Most client hosts are equipped with multiple network interfaces (e.g., WiFi and cellular networks). Simultaneous access of multiple interfaces can significantly improve the users' quality of experience (QoE) in video streaming. An intuitive approach to achieve it is to use Multi-path TCP (MPTCP). However, the deployment of MPTCP, especially with link preference, requires OS kernel update at both the client and server side, and a vast amount of commercial content providers do not support MPTCP. Thus, in this paper, we realize a multi-path video streaming algorithm in the application layer instead, by considering Scalable Video Coding (SVC), where each layer of every chunk can be fetched from only one of the orthogonal paths. We formulate the quality decisions of video chunks subject to the available bandwidth of the different paths, chunk deadlines, and link preferences as an optimization problem. The objective is to to optimize a QoE metric that maintains a tradeoff between maximizing the playback rate of every chunk and ensuring fairness among chunks. The QoE is a weighted some of the following metrics: skip/stall duration, average playback rate, and quality switching rate. However, the weights are chosen such that pushing more chunks to the same quality level is more preferable over any other choice. Even though the formulation is a non-convex discrete optimization, we show that the problem can be solved optimally with a polynomial complexity in some special cases. We further propose an online algorithm where several challenges including bandwidth prediction errors, are addressed. Extensive emulated experiments in a real testbed with real traces of public dataset reveal the robustness of our scheme and demonstrate its significant performance improvement compared to other multi-path algorithms.
State of the Art, Taxonomy, and Open Issues on Cognitive Radio Networks with NOMA
Venue: arXiv cs.NI 2018
Year: 2018

The explosive growth of mobile devices and the rapid increase of wideband wireless services call for advanced communication techniques that can achieve high spectral efficiency and meet the massive connectivity requirement. Cognitive radio (CR) and non-orthogonal multiple access (NOMA) are envisioned to be important solutions for the fifth generation wireless networks. Integrating NOMA techniques into CR networks (CRNs) has the tremendous potential to improve spectral efficiency and increase the system capacity. However, there are many technical challenges due to the severe interference caused by using NOMA. Many efforts have been made to facilitate the application of NOMA into CRNs and to investigate the performance of CRNs with NOMA. This article aims to survey the latest research results along this direction. A taxonomy is devised to categorize the literature based on operation paradigms, enabling techniques, design objectives and optimization characteristics. Moreover, the key challenges are outlined to provide guidelines for the domain researchers and designers to realize CRNs with NOMA. Finally, the open issues are discussed.
Using reinforcement learning to learn how to play text-based games
Venue: arXiv cs.CL 2018
Year: 2018

The ability to learn optimal control policies in systems where action space is defined by sentences in natural language would allow many interesting real-world applications such as automatic optimisation of dialogue systems. Text-based games with multiple endings and rewards are a promising platform for this task, since their feedback allows us to employ reinforcement learning techniques to jointly learn text representations and control policies. We present a general text game playing agent, testing its generalisation and transfer learning performance and showing its ability to play multiple games at once. We also present pyfiction, an open-source library for universal access to different text games that could, together with our agent that implements its interface, serve as a baseline for future research.
A First Step in the Co-Evolution of Blockchain and Ontologies: Towards Engineering an Ontology of Governance at the Blockchain Protocol Level
Venue: arXiv cs.CY 2018
Year: 2018

At the beginning of 2018, there is a growing belief that blockchain technologies constitute a revolutionary innovation in how we transfer value electronically. In that vein, blockchain may be a suitable complement to ontologies to achieve a big part of the vision of the semantic Web by Tim Berners-Lee. We believe that if this complementarity is to be achieved blockchain and ontologies must co-evolve. In this paper, we focus on what and how to engineer models, methods, designs, and implementations for this co-evolution. As a first step in this co-evolution, we propose a conceptual design of a governance ontology represented as meta-data tags to be embedded and instantiated in a smart contract at the blockchain protocol level. We develop this design by examining and analyzing smart contracts from the infamous The DAO experiment on the Ethereum blockchain. We believe there are two contributions of this paper: it serves to inform and implore the blockchain and ontology communities to recognize and collaborate with each other; and it outlines a roadmap for engineering artifacts to bridge the gap between blockchain community focus on protocol-level blockchain interoperability and the ontology community focus on semantic-level interoperability.
Robust Dead Reckoning: Calibration, Covariance Estimation, Fusion and Integrity Monitoring
Venue: arXiv cs.RO 2018
Year: 2018

To measure system states and local environment directly with high precision, expensive sensors are required. However, highly accurate system states and environmental perception can also be achieved using data fusion techniques and digital maps. One crucial task of multi-sensor state estimation is to project different sensor measurements into the same temporal, spatial and physical domain, estimate their covariance matrices as well as the exclusion of erroneous measurements. This paper presents a generic approach for robust estimation of vehicle movement (odometry). We will shortly present our calibration procedure, including the estimation of sensor alignments, offset / scaling errors, covariances / correlations and time delays. An improved algorithm for wheel diameter estimation is presented. Additionally an approach for robust odometry will be shown as odometry estimations are fused under known covariances, while outliers are detected using a chi-squared test. Utilizing our robust odometry, local environmental views can be associated and fused. Furthermore our robust odometry can be used to detect and exclude erroneous position estimates.
TimeWeaver: Opportunistic One Way Delay Measurement via NTP
Venue: arXiv cs.NI 2018
Year: 2018

One-way delay (OWD) between end hosts has important implications for Internet applications, protocols, and measurement-based analyses. We describe a new approach for identifying OWDs via passive measurement of Network Time Protocol (NTP) traffic. NTP traffic offers the opportunity to measure OWDs accurately and continuously from hosts throughout the Internet. Based on detailed examina- tion of NTP implementations and in-situ behavior, we develop an analysis tool that we call TimeWeaver, which enables assessment of precision and accuracy of OWD measurements from NTP. We apply TimeWeaver to a ~1TB corpus of NTP traffic collected from 19 servers located in the US and report on the characteristics of hosts and their associated OWDs, which we classify in a precision/accuracy hierarchy. To demonstrate the utility of these measurements, we apply iterative hard-threshold singular value decomposition to estimate OWDs between arbitrary hosts from the high- est tier in the hierarchy. We show that this approach results in highly accurate estimates of OWDs, with average error rates on the order of less than 2%. Finally, we outline a number of applications---in particular, IP geolocation, network operations and management---for hosts in lower tiers of the precision hierarchy that can benefit from TimeWeaver, offering directions for future work.
Authorization Policies and Co-Operating Strategies of DSCloud Platform
Venue: arXiv cs.DC 2018
Year: 2018

One of the services of DSCloud Platform is to provide the global directory service to solve the problems of dispersed, difficult retrieved and isolated information. In this paper, we describe DSCloud Platform's authorization policies and co-operating strategies for articles and comments, and usage scenery for co-editing posts and tables in the platform.
Detection and segmentation of the Left Ventricle in Cardiac MRI using Deep Learning
Venue: arXiv cs.CV 2018
Year: 2018

Manual segmentation of the Left Ventricle (LV) is a tedious and meticulous task that can vary depending on the patient, the Magnetic Resonance Images (MRI) cuts and the experts. Still today, we consider manual delineation done by experts as being the ground truth for cardiac diagnosticians. Thus, we are reviewing the paper - written by Avendi and al. - who presents a combined approach with Convolutional Neural Networks, Stacked Auto-Encoders and Deformable Models, to try and automate the segmentation while performing more accurately. Furthermore, we have implemented parts of the paper (around three quarts) and experimented both the original method and slightly modified versions when changing the architecture and the parameters.
Neural Networks for Information Retrieval
Venue: arXiv cs.IR 2018
Year: 2018

Machine learning plays a role in many aspects of modern IR systems, and deep learning is applied in all of them. The fast pace of modern-day research has given rise to many approaches to many IR problems. The amount of information available can be overwhelming both for junior students and for experienced researchers looking for new research topics and directions. The aim of this full-day tutorial is to give a clear overview of current tried-and-trusted neural methods in IR and how they benefit IR.
A survey on software testability
Venue: arXiv cs.SE 2018
Year: 2018

Context: Software testability is the degree to which a software system or a unit under test supports its own testing. To predict and improve software testability, a large number of techniques and metrics have been proposed by both practitioners and researchers in the last several decades. Reviewing and getting an overview of the entire state-of-the-art and state-of-the-practice in this area is often challenging for a practitioner or a new researcher. Objective: Our objective is to summarize the body of knowledge in this area and to benefit the readers (both practitioners and researchers) in preparing, measuring and improving software testability. Method: To address the above need, the authors conducted a survey in the form of a systematic literature mapping (classification) to find out what we as a community know about this topic. After compiling an initial pool of 303 papers, and applying a set of inclusion/exclusion criteria, our final pool included 208 papers. Results: The area of software testability has been comprehensively studied by researchers and practitioners. Approaches for measurement of testability and improvement of testability are the most-frequently addressed in the papers. The two most often mentioned factors affecting testability are observability and controllability. Common ways to improve testability are testability transformation, improving observability, adding assertions, and improving controllability. Conclusion: This paper serves for both researchers and practitioners as an "index" to the vast body of knowledge in the area of testability. The results could help practitioners measure and improve software testability in their projects.
Perfect graphs with polynomially computable kernels
Venue: arXiv cs.DM 2018
Year: 2018

In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a perfect graph. However, an open question is the complexity status of the computation of a kernel in such a digraph. Our main contribution is to prove new polynomiality results for subfamilies of perfect graphs, among which are claw-free perfect graphs and chordal graphs. Our results are based on the design of kernel computation methods with respect to two graph operations: clique-cutset decomposition and augmentation of flat edges. We also prove that deciding the existence of a kernel - and computing it if it exists - is polynomial in every orientation of a chordal or a circular-arc graph, even not clique-acyclic.
Perceptual Context in Cognitive Hierarchies
Venue: arXiv cs.AI 2018
Year: 2018

Cognition does not only depend on bottom-up sensor feature abstraction, but also relies on contextual information being passed top-down. Context is higher level information that helps to predict belief states at lower levels. The main contribution of this paper is to provide a formalisation of perceptual context and its integration into a new process model for cognitive hierarchies. Several simple instantiations of a cognitive hierarchy are used to illustrate the role of context. Notably, we demonstrate the use context in a novel approach to visually track the pose of rigid objects with just a 2D camera.
Joint Transmitter and Receiver Design for Pattern Division Multiple Access
Venue: arXiv cs.IT 2018
Year: 2018

In this paper, a joint transmitter and receiver design for pattern division multiple access (PDMA) is proposed. At the transmitter, pattern mapping utilizes power allocation to improve the overall sum rate, and beam allocation to enhance the access connectivity. At the receiver, hybrid detection utilizes a spatial filter to suppress the inter-beam interference caused by beam domain multiplexing, and successive interference cancellation to remove the intra-beam interference caused by power domain multiplexing. Furthermore, we propose a PDMA joint design approach to optimize pattern mapping based on both the power domain and beam domain. The optimization of power allocation is achieved by maximizing the overall sum rate, and the corresponding optimization problem is shown to be convex theoretically. The optimization of beam allocation is achieved by minimizing the maximum of the inner product of any two beam allocation vectors, and an effective dimension reduction method is proposed through the analysis of pattern structure and proper mathematical manipulations. Simulation results show that the proposed PDMA approach outperforms the orthogonal multiple access and power-domain non-orthogonal multiple access approaches even without any optimization of pattern mapping, and that the optimization of beam allocation yields a significant performance improvement than the optimization of power allocation.
Efficient Encoding/Decoding of Irreducible Words for Codes Correcting Tandem Duplications
Venue: arXiv cs.IT 2018
Year: 2018

Tandem duplication is the process of inserting a copy of a segment of DNA adjacent to the original position. Motivated by applications that store data in living organisms, Jain et al. (2017) proposed the study of codes that correct tandem duplications. Known code constructions are based on {\em irreducible words}. We study efficient encoding/decoding methods for irreducible words. First, we describe an $(\ell,m)$-finite state encoder and show that when $m=Θ(1/ε)$ and $\ell=Θ(1/ε)$, the encoder achieves rate that is $ε$ away from the optimal. Next, we provide ranking/unranking algorithms for irreducible words and modify the algorithms to reduce the space requirements for the finite state encoder.
Building Capacity-Achieving PIR Schemes with Optimal Sub-Packetization over Small Fields
Venue: arXiv cs.IT 2018
Year: 2018

Suppose a database containing $M$ records is replicated across $N$ servers, and a user wants to privately retrieve one record by accessing the servers such that identity of the retrieved record is secret against any up to $T$ servers. A scheme designed for this purpose is called a $T$-private information retrieval ($T$-PIR) scheme. Three indexes are concerned for PIR schemes: (1)rate, indicating the amount of retrieved information per unit of downloaded data. The highest achievable rate is characterized by the capacity; (2) sub-packetization, reflexing the implementation complexity for linear schemes; (3) field size. We consider linear schemes over a finite field. In this paper, a general $T$-PIR scheme simultaneously attaining the optimality of almost all of the three indexes is presented. Specifically, we design a linear capacity-achieving $T$-PIR scheme with sub-packetization $\!dn^{M-1}\!$ over a finite field $\mathbb{F}_q$, $q\geq N$. The sub-packetization $\!dn^{M-1}\!$, where $\!d\!=\!{\rm gcd}(N,T)\!$ and $\!n\!=\!N/d$, has been proved to be optimal in our previous work. The field size of all existing capacity-achieving $T$-PIR schemes must be larger than $Nt^{M-2}$ where $t=T/d$, while our scheme reduces the field size by an exponential factor.