OpenRaiser/Intern-Atlas huggingface dataset:
Multigroup Multicast Precoding in Massive MIMO
Venue: arXiv cs.IT 2017
Year: 2017

Optimal physical layer multicasting (PLM) is an NP-hard problem that for simplicity has been studied under idealistic assumptions, e.g., availability of perfect channel state information (CSI), both at the base station (BS) and at the user terminals (UTs). With the advent of massive multiple-input-multiple-output (MIMO), PLM has become more challenging, as the computational complexity of the precoder design is proportional to the number of BS antennas. In this paper, we address these issues by introducing computationally efficient precoders that account for practical CSI acquisition. We derive achievable spectral efficiency expressions for the proposed precoders. Then we introduce a novel problem formulation for the max-min fairness power control that accounts the CSI acquisition overhead, uplink training and downlink transmission powers. We solve this problem and find the optimal uplink and downlink power control policies in closed form. Using numerical simulations, we verify the effectiveness of our proposed schemes compared to the-state-of-the-art PLM schemes for massive MIMO systems.
Subjective Simulation as a Notion of Morphism for Composing Concurrent Resources
Venue: arXiv cs.PL 2017
Year: 2017

Recent approaches to verifying programs in separation logics for concurrency have used state transition systems (STSs) to specify the atomic operations of programs. A key challenge in the setting has been to compose such STSs into larger ones, while enabling programs specified under one STS to be linked to a larger one, without reverification. This paper develops a notion of morphism between two STSs which permits such lifting. The morphisms are a constructive form of simulation between the STSs, and lead to a general and concise proof system. We illustrate the concept and its generality on several disparate examples, including staged construction of a readers/writers lock and its proof, and of proofs about quiescence when concurrent programs are executed without external interference.
Sentence Correction Based on Large-scale Language Modelling
Venue: arXiv cs.CL 2017
Year: 2017

With the further development of informatization, more and more data is stored in the form of text. There are some loss of text during their generation and transmission. The paper aims to establish a language model based on the large-scale corpus to complete the restoration of missing text. In this paper, we introduce a novel measurement to find the missing words, and a way of establishing a comprehensive candidate lexicon to insert the correct choice of words. The paper also introduces some effective optimization methods, which largely improve the efficiency of the text restoration and shorten the time of dealing with 1000 sentences into 3.6 seconds. \keywords{ language model, sentence correction, word imputation, parallel optimization
Secure Grouping Protocol Using a Deck of Cards
Venue: arXiv cs.CR 2017
Year: 2017

We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members of his/her group, while he/she may not know anything about how the remaining parties are divided (except for certain public predetermined constraints, such as the number of parties in each group). In this paper, we construct an information-theoretically secure protocol using a deck of physical cards to solve the problem, which is jointly executable by the parties themselves without a trusted third party. Despite the non-triviality and the potential usefulness of the secure grouping, our proposed protocol is fairly simple to describe and execute. Our protocol is based on algebraic properties of conjugate permutations. A key ingredient of our protocol is our new techniques to apply multiplication and inverse operations to hidden permutations (i.e., those encoded by using face-down cards), which would be of independent interest and would have various potential applications.
Trends in scientific research in Online Information Review. Part 1. Production, impact and research collaboration
Venue: arXiv cs.DL 2017
Year: 2017

The study, based on the Web of Science, analyses 758 articles published from 2000 to 2014. Our analysis includes the publications' output, authorship, institutional and country patterns of production, citations and collaboration. A Social Network Analysis was conducted to identify primary groups of researchers and institutions and the collaboration between countries. The study reveals that 1097 authors and 453 Institutions have contributed to the journal. The collaboration index has increased progressively, and the average degree of collaboration during the study period was 1.98. The majority of the papers were contributed by professionals affiliated with a university. Highly cited papers address online and digital environments, e-learning systems, mobile services, web 2.0 and citation analyses. This work is a bibliometric analysis of a leading journal in library and information science, Online Information Review.
VLSI Designs for Joint Channel Estimation and Data Detection in Large SIMO Wireless Systems
Venue: arXiv cs.IT 2017
Year: 2017

Channel estimation errors have a critical impact on the reliability of wireless communication systems. While virtually all existing wireless receivers separate channel estimation from data detection, it is well known that joint channel estimation and data detection (JED) significantly outperforms conventional methods at the cost of high computational complexity. In this paper, we propose a novel JED algorithm and corresponding VLSI designs for large single-input multiple-output (SIMO) wireless systems that use constant-modulus constellations. The proposed algorithm is referred to as PRojection Onto conveX hull (PrOX) and relies on biconvex relaxation (BCR), which enables us to efficiently compute an approximate solution of the maximum-likelihood JED problem. Since BCR solves a biconvex problem via alternating optimization, we provide a theoretical convergence analysis for PrOX. We design a scalable, high-throughput VLSI architecture that uses a linear array of processing elements to minimize hardware complexity. We develop corresponding field-programmable gate array (FPGA) and application-specific integrated circuit (ASIC) designs, and we demonstrate that PrOX significantly outperforms the only other existing JED design in terms of throughput, hardware-efficiency, and energy-efficiency.
Modeling Image Virality with Pairwise Spatial Transformer Networks
Venue: arXiv cs.CV 2017
Year: 2017

The study of virality and information diffusion online is a topic gaining traction rapidly in the computational social sciences. Computer vision and social network analysis research have also focused on understanding the impact of content and information diffusion in making content viral, with prior approaches not performing significantly well as other traditional classification tasks. In this paper, we present a novel pairwise reformulation of the virality prediction problem as an attribute prediction task and develop a novel algorithm to model image virality on online media using a pairwise neural network. Our model provides significant insights into the features that are responsible for promoting virality and surpasses the existing state-of-the-art by a 12% average improvement in prediction. We also investigate the effect of external category supervision on relative attribute prediction and observe an increase in prediction accuracy for the same across several attribute learning datasets.
Computational Content Analysis of Negative Tweets for Obesity, Diet, Diabetes, and Exercise
Venue: arXiv cs.SI 2017
Year: 2017

Social media based digital epidemiology has the potential to support faster response and deeper understanding of public health related threats. This study proposes a new framework to analyze unstructured health related textual data via Twitter users' post (tweets) to characterize the negative health sentiments and non-health related concerns in relations to the corpus of negative sentiments, regarding Diet Diabetes Exercise, and Obesity (DDEO). Through the collection of 6 million Tweets for one month, this study identified the prominent topics of users as it relates to the negative sentiments. Our proposed framework uses two text mining methods, sentiment analysis and topic modeling, to discover negative topics. The negative sentiments of Twitter users support the literature narratives and the many morbidity issues that are associated with DDEO and the linkage between obesity and diabetes. The framework offers a potential method to understand the publics' opinions and sentiments regarding DDEO. More importantly, this research provides new opportunities for computational social scientists, medical experts, and public health professionals to collectively address DDEO-related issues.
Diversity gain of one-shot communication over molecular timing channels
Venue: arXiv cs.IT 2017
Year: 2017

We study diversity in one-shot communication over molecular timing channels. In the considered channel model the transmitter simultaneously releases a large number of information particles, where the information is encoded in the time of release. The receiver decodes the information based on the random time of arrival of the information particles. We characterize the asymptotic exponential decrease rate of the probability of error as a function of the number of released particles. We denote this quantity as the system diversity gain, as it depends both on the number of particles transmitted as well as the receiver detection method. Three types of detectors are considered: the maximumlikelihood (ML) detector, a linear detector, and a detector that is based on the first arrival (FA) among all the transmitted particles. We show that for random propagation characterized by right-sided unimodal densities with zero mode, the FA detector is equivalent to the ML detector, and significantly outperforms the linear detector. Moreover, even for densities with positive mode, the diversity gain achieved by the FA detector is very close to that achieved by the ML detector and much higher than the gain achieved by the linear detector.
Full-Duplex Millimeter-Wave Communication
Venue: arXiv cs.IT 2017
Year: 2017

The potential of doubling the spectrum efficiency of full-duplex (FD) transmission motivates us to investigate FD millimeter-wave (FD-mmWave) communication. To realize FD transmission in the mmWave band, we first introduce possible antenna configurations for FD-mmWave transmission. It is shown that, different from the cases in micro-wave band FD communications, the configuration with separate Tx/Rx antenna arrays appears more flexible in self-interference (SI) suppression while it may increase some cost and area versus that with the same array. We then model the mmWave SI channel with separate Tx/Rx arrays, where a near-field propagation model is adopted for the line-of-sight (LOS) path, and it is found that the established LOS-SI channel with separate Tx/Rx arrays also shows spatial sparsity. Based on the SI channel, we further explore approaches to mitigate SI by signal processing, and we focus on a new cancellation approach in FD-mmWave communication, i.e., beamforming cancellation. Centered on the constant-amplitude (CA) constraint of the beamforming vectors, we propose several candidate solutions. Lastly, we consider an FD-mmWave multi-user scenario, and show that even if there are no FD users in an FD-mmWave cellular system, the FD benefit can still be exploited in the FD base station. Candidate solutions are also discussed to mitigate both SI and multi-user interference (MUI) simultaneously.
An Incremental Slicing Method for Functional Programs
Venue: arXiv cs.PL 2017
Year: 2017

Several applications of slicing require a program to be sliced with respect to more than one slicing criterion. Program specialization, parallelization and cohesion measurement are examples of such applications. These applications can benefit from an incremental static slicing method in which a significant extent of the computations for slicing with respect to one criterion could be reused for another. In this paper, we consider the problem of incremental slicing of functional programs. We first present a non-incremental version of the slicing algorithm which does a polyvariant analysis 1 of functions. Since polyvariant analyses tend to be costly, we compute a compact context-independent summary of each function and then use this summary at the call sites of the function. The construction of the function summary is non-trivial and helps in the development of the incremental version. The incremental method, on the other hand, consists of a one-time pre-computation step that uses the non-incremental version to slice the program with respect to a fixed default slicing criterion and processes the results further to a canonical form. Presented with an actual slicing criterion, the incremental step involves a low-cost computation that uses the results of the pre-computation to obtain the slice. We have implemented a prototype of the slicer for a pure subset of Scheme, with pairs and lists as the only algebraic data types. Our experiments show that the incremental step of the slicer runs orders of magnitude faster than the non-incremental version. We have also proved the correctness of our incremental algorithm with respect to the non-incremental version.
When Traffic Flow Prediction Meets Wireless Big Data Analytics
Venue: arXiv cs.AI 2017
Year: 2017

Traffic flow prediction is an important research issue for solving the traffic congestion problem in an Intelligent Transportation System (ITS). Traffic congestion is one of the most serious problems in a city, which can be predicted in advance by analyzing traffic flow patterns. Such prediction is possible by analyzing the real-time transportation data from correlative roads and vehicles. This article first gives a brief introduction to the transportation data, and surveys the state-of-the-art prediction methods. Then, we verify whether or not the prediction performance is able to be improved by fitting actual data to optimize the parameters of the prediction model which is used to predict the traffic flow. Such verification is conducted by comparing the optimized time series prediction model with the normal time series prediction model. This means that in the era of big data, accurate use of the data becomes the focus of studying the traffic flow prediction to solve the congestion problem. Finally, experimental results of a case study are provided to verify the existence of such performance improvement, while the research challenges of this data-analytics-based prediction are presented and discussed.
Statistical Parametric Speech Synthesis Incorporating Generative Adversarial Networks
Venue: arXiv cs.SD 2017
Year: 2017

A method for statistical parametric speech synthesis incorporating generative adversarial networks (GANs) is proposed. Although powerful deep neural networks (DNNs) techniques can be applied to artificially synthesize speech waveform, the synthetic speech quality is low compared with that of natural speech. One of the issues causing the quality degradation is an over-smoothing effect often observed in the generated speech parameters. A GAN introduced in this paper consists of two neural networks: a discriminator to distinguish natural and generated samples, and a generator to deceive the discriminator. In the proposed framework incorporating the GANs, the discriminator is trained to distinguish natural and generated speech parameters, while the acoustic models are trained to minimize the weighted sum of the conventional minimum generation loss and an adversarial loss for deceiving the discriminator. Since the objective of the GANs is to minimize the divergence (i.e., distribution difference) between the natural and generated speech parameters, the proposed method effectively alleviates the over-smoothing effect on the generated speech parameters. We evaluated the effectiveness for text-to-speech and voice conversion, and found that the proposed method can generate more natural spectral parameters and $F_0$ than conventional minimum generation error training algorithm regardless its hyper-parameter settings. Furthermore, we investigated the effect of the divergence of various GANs, and found that a Wasserstein GAN minimizing the Earth-Mover's distance works the best in terms of improving synthetic speech quality.
Novel Uses of Category Theory in Modeling OOP
Venue: arXiv cs.PL 2017
Year: 2017

An outline and summary of four new potential applications of category theory to OOP research are presented. These include (1) the use of operads to model Java subtyping, (2) the use of Yoneda's lemma and representable functors in the modeling of generic types in generic nominally-typed OOP, (3) using a combination of category presentations and cartesian closed categories to model structurally-typed OOP, and (4) the use of adjoint functors to model Java erasure.
BPM in the cloud: A systematic literature review
Venue: arXiv cs.SE 2017
Year: 2017

Business Process Management (BPM) in the cloud is focused on how to provide Business Process as a Service (BPaaS) and also implementing the Elastic Business Process Management (eBPM). These approaches are finding models, techniques and methodologies to increase the BPM adoption in the cloud. The objective on this research is to carry out a literature review about the state of the art of Business Process Management in the cloud, identify categories and analyze what the approach on eBPM researches and BPaaS researches is. The method used is the systematic literature review and the researches evolution over the time will be categorized and analyzed using a timeline and cumulative charts. The results show that the Business Process enactment is the main approach focused on eBPM researches, whereas the researches on BPaaS are focused on a greater number of categories. The conclusion of this research is that the authors could not identify any systems supporting the eBPM and BPaaS approaches at the same time and they introduce the definition of a new approach called Elastic Business Process Management as a Service (eBPMaaS)
Self-supervised learning: When is fusion of the primary and secondary sensor cue useful?
Venue: arXiv cs.RO 2017
Year: 2017

Self-supervised learning (SSL) is a reliable learning mechanism in which a robot enhances its perceptual capabilities. Typically, in SSL a trusted, primary sensor cue provides supervised training data to a secondary sensor cue. In this article, a theoretical analysis is performed on the fusion of the primary and secondary cue in a minimal model of SSL. A proof is provided that determines the specific conditions under which it is favorable to perform fusion. In short, it is favorable when (i) the prior on the target value is strong or (ii) the secondary cue is sufficiently accurate. The theoretical findings are validated with computational experiments. Subsequently, a real-world case study is performed to investigate if fusion in SSL is also beneficial when assumptions of the minimal model are not met. In particular, a flying robot learns to map pressure measurements to sonar height measurements and then fuses the two, resulting in better height estimation. Fusion is also beneficial in the opposite case, when pressure is the primary cue. The analysis and results are encouraging to study SSL fusion also for other robots and sensors.
HDLTex: Hierarchical Deep Learning for Text Classification
Venue: arXiv cs.LG 2017
Year: 2017

The continually increasing number of documents produced each year necessitates ever improving information processing methods for searching, retrieving, and organizing text. Central to these information processing methods is document classification, which has become an important application for supervised learning. Recently the performance of these traditional classifiers has degraded as the number of documents has increased. This is because along with this growth in the number of documents has come an increase in the number of categories. This paper approaches this problem differently from current document classification methods that view the problem as multi-class classification. Instead we perform hierarchical classification using an approach we call Hierarchical Deep Learning for Text classification (HDLTex). HDLTex employs stacks of deep learning architectures to provide specialized understanding at each level of the document hierarchy.
Non-Cash Auction for Spectrum Trading in Cognitive Radio Networks: A Contract Theoretical Model with Joint Adverse Selection and Moral Hazard
Venue: arXiv cs.NI 2017
Year: 2017

In cognitive radio networks (CRNs), spectrum trading is an efficient way for secondary users (SUs) to achieve dynamic spectrum access and to bring economic benefits for the primary users (PUs). Existing methods requires full payment from SU, which blocked many potential "buyers", and thus limited the PU's expected income. To better improve PUs' revenue from spectrum trading in a CRN, we introduce a financing contract, which is similar to a sealed non-cash auction that allows SU to do a financing. Unlike previous mechanism designs in CRN, the financing contract allows the SU to only pay part of the total amount when the contract is signed, known as the down payment. Then, after the spectrum is released and utilized, the SU pays the rest of payment, known as the installment payment, from the revenue generated by utilizing the spectrum. The way the financing contract carries out and the sealed non-cash auction works similarly. Thus, contract theory is employed here as the mathematical framework to solve the non-cash auction problem and form mutually beneficial relationships between PUs and SUs. As the PU may not have the full acknowledgement of the SU's financial status, nor the SU's capability in making revenue, the problems of adverse selection and moral hazard arise in the two scenarios, respectively. Therefore, a joint adverse selection and moral hazard model is considered here. In particular, we present three situations when either or both adverse selection and moral hazard are present during the trading. Furthermore, both discrete and continuous models are provided in this paper. Through extensive simulations, we show that the adverse selection and moral hazard cases serve as the upper and lower bounds of the general case where both problems are present.
Deep Sparse Subspace Clustering
Venue: arXiv cs.CV 2017
Year: 2017

In this paper, we present a deep extension of Sparse Subspace Clustering, termed Deep Sparse Subspace Clustering (DSSC). Regularized by the unit sphere distribution assumption for the learned deep features, DSSC can infer a new data affinity matrix by simultaneously satisfying the sparsity principle of SSC and the nonlinearity given by neural networks. One of the appealing advantages brought by DSSC is: when original real-world data do not meet the class-specific linear subspace distribution assumption, DSSC can employ neural networks to make the assumption valid with its hierarchical nonlinear transformations. To the best of our knowledge, this is among the first deep learning based subspace clustering methods. Extensive experiments are conducted on four real-world datasets to show the proposed DSSC is significantly superior to 12 existing methods for subspace clustering.