OpenRaiser/Intern-Atlas huggingface dataset:
An Improved Scheme in the Two Query Adaptive Bitprobe Model
Venue: arXiv cs.DS 2018
Year: 2018

In this paper, we look into the adaptive bitprobe model that stores subsets of size at most four from a universe of size m, and answers membership queries using two bitprobes. We propose a scheme that stores arbitrary subsets of size four using O(m^{5/6}) amount of space. This improves upon the non-explicit scheme proposed by Garg and Radhakrishnan [Garg2015] which uses O(m^{16/17}) amount of space, and the explicit scheme proposed by Garg [Thesis2015] which uses O(m^{14/15}) amount of space.
A Universal Receiver for Uplink NOMA Systems
Venue: arXiv cs.IT 2018
Year: 2018

Given its capability in efficient radio resource sharing, non-orthogonal multiple access (NOMA) has been identified as a promising technology in 5G to improve the system capacity, user connectivity, and scheduling latency. A dozen of uplink NOMA schemes have been proposed recently and this paper considers the design of a universal receiver suitable for all potential designs of NOMA schemes. Firstly, a general turbo-like iterative receiver structure is introduced, under which, a universal expectation propagation algorithm (EPA) detector with hybrid parallel interference cancellation (PIC) is proposed (EPA in short). Link-level simulations show that the proposed EPA receiver can achieve superior block error rate (BLER) performance with implementation friendly complexity and fast convergence, and is always better than the traditional codeword level MMSE-PIC receiver for various kinds of NOMA schemes.
Turbo-like Iterative Multi-user Receiver Design for 5G Non-orthogonal Multiple Access
Venue: arXiv cs.IT 2018
Year: 2018

Non-orthogonal multiple access (NoMA) as an efficient way of radio resource sharing has been identified as a promising technology in 5G to help improving system capacity, user connectivity, and service latency in 5G communications. This paper provides a brief overview of the progress of NoMA transceiver study in 3GPP, with special focus on the design of turbo-like iterative multi-user (MU) receivers. There are various types of MU receivers depending on the combinations of MU detectors and interference cancellation (IC) schemes. Link-level simulations show that expectation propagation algorithm (EPA) with hybrid parallel interference cancellation (PIC) is a promising MU receiver, which can achieve fast convergence and similar performance as message passing algorithm (MPA) with much lower complexity.
An Efficient and Truthful Pricing Mechanism for Team Formation in Crowdsourcing Markets
Venue: arXiv cs.GT 2018
Year: 2018

In a crowdsourcing market, a requester is looking to form a team of workers to perform a complex task that requires a variety of skills. Candidate workers advertise their certified skills and bid prices for their participation. We design four incentive mechanisms for selecting workers to form a valid team (that can complete the task) and determining each individual worker's payment. We examine profitability, individual rationality, computational efficiency, and truthfulness for each of the four mechanisms. Our analysis shows that TruTeam, one of the four mechanisms, is superior to the others, particularly due to its computational efficiency and truthfulness. Our extensive simulations confirm the analysis and demonstrate that TruTeam is an efficient and truthful pricing mechanism for team formation in crowdsourcing markets.
EasiCSDeep: A deep learning model for Cervical Spondylosis Identification using surface electromyography signal
Venue: arXiv cs.LG 2018
Year: 2018

Cervical spondylosis (CS) is a common chronic disease that affects up to two-thirds of the population and poses a serious burden on individuals and society. The early identification has significant value in improving cure rate and reducing costs. However, the pathology is complex, and the mild symptoms increase the difficulty of the diagnosis, especially in the early stage. Besides, the time-consuming and costliness of hospital medical service reduces the attention to the CS identification. Thus, a convenient, low-cost intelligent CS identification method is imperious demanded. In this paper, we present an intelligent method based on the deep learning to identify CS, using the surface electromyography (sEMG) signal. Faced with the complex, high dimensionality and weak usability of the sEMG signal, we proposed and developed a multi-channel EasiCSDeep algorithm based on the convolutional neural network, which consists of the feature extraction, spatial relationship representation and classification algorithm. To the best of our knowledge, this EasiCSDeep is the first effort to employ the deep learning and the sEMG data to identify CS. Compared with previous state-of-the-art algorithm, our algorithm achieves a significant improvement.
Systematic Parsing of X.509: Eradicating Security Issues with a Parse Tree
Venue: arXiv cs.CR 2018
Year: 2018

X.509 certificate parsing and validation is a critical task which has shown consistent lack of effectiveness, with practical attacks being reported with a steady rate during the last 10 years. In this work we analyze the X.509 standard and provide a grammar description of it amenable to the automated generation of a parser with strong termination guarantees, providing unambiguous input parsing. We report the results of analyzing a 11M X.509 certificate dump of the HTTPS servers running on the entire IPv4 space, showing that 21.5% of the certificates in use are syntactically invalid. We compare the results of our parsing against 7 widely used TLS libraries showing that 631k to 1,156k syntactically incorrect certificates are deemed valid by them (5.7%--10.5%), including instances with security critical mis-parsings. We prove the criticality of such mis-parsing exploiting one of the syntactic flaws found in existing certificates to perform an impersonation attack.
Implementing Argumentation-enabled Empathic Agents
Venue: arXiv cs.MA 2018
Year: 2018

In a previous publication, we introduced the core concepts of empathic agents as agents that use a combination of utility-based and rule-based approaches to resolve conflicts when interacting with other agents in their environment. In this work, we implement proof-of-concept prototypes of empathic agents with the multi-agent systems development framework Jason and apply argumentation theory to extend the previously introduced concepts to account for inconsistencies between the beliefs of different agents. We then analyze the feasibility of different admissible set-based argumentation semantics to resolve these inconsistencies. As a result of the analysis we identify the maximal ideal extension as the most feasible argumentation semantics for the problem in focus.
Temporal Analysis of Entity Relatedness and its Evolution using Wikipedia and DBpedia
Venue: arXiv cs.CL 2018
Year: 2018

Many researchers have made use of the Wikipedia network for relatedness and similarity tasks. However, most approaches use only the most recent information and not historical changes in the network. We provide an analysis of entity relatedness using temporal graph-based approaches over different versions of the Wikipedia article link network and DBpedia, which is an open-source knowledge base extracted from Wikipedia. We consider creating the Wikipedia article link network as both a union and intersection of edges over multiple time points and present a novel variation of the Jaccard index to weight edges based on their transience. We evaluate our results against the KORE dataset, which was created in 2010, and show that using the 2010 Wikipedia article link network produces the strongest result, suggesting that semantic similarity is time sensitive. We then show that integrating multiple time frames in our methods can give a better overall similarity demonstrating that temporal evolution can have an important effect on entity relatedness.
Transfer Learning using Representation Learning in Massive Open Online Courses
Venue: arXiv cs.LG 2018
Year: 2018

In a Massive Open Online Course (MOOC), predictive models of student behavior can support multiple aspects of learning, including instructor feedback and timely intervention. Ongoing courses, when the student outcomes are yet unknown, must rely on models trained from the historical data of previously offered courses. It is possible to transfer models, but they often have poor prediction performance. One reason is features that inadequately represent predictive attributes common to both courses. We present an automated transductive transfer learning approach that addresses this issue. It relies on problem-agnostic, temporal organization of the MOOC clickstream data, where, for each student, for multiple courses, a set of specific MOOC event types is expressed for each time unit. It consists of two alternative transfer methods based on representation learning with auto-encoders: a passive approach using transductive principal component analysis and an active approach that uses a correlation alignment loss term. With these methods, we investigate the transferability of dropout prediction across similar and dissimilar MOOCs and compare with known methods. Results show improved model transferability and suggest that the methods are capable of automatically learning a feature representation that expresses common predictive characteristics of MOOCs.
Recent Advances in Autoencoder-Based Representation Learning
Venue: arXiv cs.LG 2018
Year: 2018

Learning useful representations with little or no supervision is a key challenge in artificial intelligence. We provide an in-depth review of recent advances in representation learning with a focus on autoencoder-based models. To organize these results we make use of meta-priors believed useful for downstream tasks, such as disentanglement and hierarchical organization of features. In particular, we uncover three main mechanisms to enforce such properties, namely (i) regularizing the (approximate or aggregate) posterior distribution, (ii) factorizing the encoding and decoding distribution, or (iii) introducing a structured prior distribution. While there are some promising results, implicit or explicit supervision remains a key enabler and all current methods use strong inductive biases and modeling assumptions. Finally, we provide an analysis of autoencoder-based representation learning through the lens of rate-distortion theory and identify a clear tradeoff between the amount of prior knowledge available about the downstream tasks, and how useful the representation is for this task.
Building Computational Models to Predict One-Year Mortality in ICU Patients with Acute Myocardial Infarction and Post Myocardial Infarction Syndrome
Venue: arXiv cs.LG 2018
Year: 2018

Heart disease remains the leading cause of death in the United States. Compared with risk assessment guidelines that require manual calculation of scores, machine learning-based prediction for disease outcomes such as mortality can be utilized to save time and improve prediction accuracy. This study built and evaluated various machine learning models to predict one-year mortality in patients diagnosed with acute myocardial infarction or post myocardial infarction syndrome in the MIMIC-III database. The results of the best performing shallow prediction models were compared to a deep feedforward neural network (Deep FNN) with back propagation. We included a cohort of 5436 admissions. Six datasets were developed and compared. The models applying Logistic Model Trees (LMT) and Simple Logistic algorithms to the combined dataset resulted in the highest prediction accuracy at 85.12% and the highest AUC at .901. In addition, other factors were observed to have an impact on outcomes as well.
Features Extraction Based on an Origami Representation of 3D Landmarks
Venue: arXiv cs.CV 2018
Year: 2018

Feature extraction analysis has been widely investigated during the last decades in computer vision community due to the large range of possible applications. Significant work has been done in order to improve the performance of the emotion detection methods. Classification algorithms have been refined, novel preprocessing techniques have been applied and novel representations from images and videos have been introduced. In this paper, we propose a preprocessing method and a novel facial landmarks' representation aiming to improve the facial emotion detection accuracy. We apply our novel methodology on the extended Cohn-Kanade (CK+) dataset and other datasets for affect classification based on Action Units (AU). The performance evaluation demonstrates an improvement on facial emotion classification (accuracy and F1 score) that indicates the superiority of the proposed methodology.
Towards Automating Precision Studies of Clone Detectors
Venue: arXiv cs.SE 2018
Year: 2018

Current research in clone detection suffers from poor ecosystems for evaluating precision of clone detection tools. Corpora of labeled clones are scarce and incomplete, making evaluation labor intensive and idiosyncratic, and limiting inter tool comparison. Precision-assessment tools are simply lacking. We present a semi-automated approach to facilitate precision studies of clone detection tools. The approach merges automatic mechanisms of clone classification with manual validation of clone pairs. We demonstrate that the proposed automatic approach has a very high precision and it significantly reduces the number of clone pairs that need human validation during precision experiments. Moreover, we aggregate the individual effort of multiple teams into a single evolving dataset of labeled clone pairs, creating an important asset for software clone research.
Recurrent Neural Networks with Pre-trained Language Model Embedding for Slot Filling Task
Venue: arXiv cs.CL 2018
Year: 2018

In recent years, Recurrent Neural Networks (RNNs) based models have been applied to the Slot Filling problem of Spoken Language Understanding and achieved the state-of-the-art performances. In this paper, we investigate the effect of incorporating pre-trained language models into RNN based Slot Filling models. Our evaluation on the Airline Travel Information System (ATIS) data corpus shows that we can significantly reduce the size of labeled training data and achieve the same level of Slot Filling performance by incorporating extra word embedding and language model embedding layers pre-trained on unlabeled corpora.
Conditional Graph Neural Processes: A Functional Autoencoder Approach
Venue: arXiv cs.LG 2018
Year: 2018

We introduce a novel encoder-decoder architecture to embed functional processes into latent vector spaces. This embedding can then be decoded to sample the encoded functions over any arbitrary domain. This autoencoder generalizes the recently introduced Conditional Neural Process (CNP) model of random processes. Our architecture employs the latest advances in graph neural networks to process irregularly sampled functions. Thus, we refer to our model as Conditional Graph Neural Process (CGNP). Graph neural networks can effectively exploit `local' structures of the metric spaces over which the functions/processes are defined. The contributions of this paper are twofold: (i) a novel graph-based encoder-decoder architecture for functional and process embeddings, and (ii) a demonstration of the importance of using the structure of metric spaces for this type of representations.
A Unified Sampling and Scheduling Approach for Status Update in Multiaccess Wireless Networks
Venue: arXiv cs.IT 2018
Year: 2018

Information source sampling and update scheduling have been treated separately in the context of real-time status update for age of information optimization. In this paper, a unified sampling and scheduling ($\mathcal{S}^2$) approach is proposed, focusing on decentralized updates in multiaccess wireless networks. To gain some insights, we first analyze an example consisting of two-state Markov sources, showing that when both optimized, the unified approach outperforms the separate approach significantly in terms of status tracking error by capturing the key status variation. We then generalize to source nodes with random-walk state transitions whose scaling limit is Wiener processes, the closed-form Whittle's index with arbitrary status tracking error functions is obtained and indexability established. Furthermore, a mean-field approach is applied to solve for the decentralized status update design explicitly. In addition to simulation results which validate the optimality of the proposed $\mathcal{S}^2$ scheme and its advantage over the separate approach, a use case of dynamic channel state information (CSI) update is investigated, with CSI generated by a ray-tracing electromagnetic software.
Information Processing Capability of Soft Continuum Arms
Venue: arXiv cs.RO 2018
Year: 2018

Soft Continuum arms, such as trunk and tentacle robots, can be considered as the "dual" of traditional rigid-bodied robots in terms of manipulability, degrees of freedom, and compliance. Introduced two decades ago, continuum arms have not yet realized their full potential, and largely remain as laboratory curiosities. The reasons for this lag rest upon their inherent physical features such as high compliance which contribute to their complex control problems that no research has yet managed to surmount. Recently, reservoir computing has been suggested as a way to employ the body dynamics as a computational resource toward implementing compliant body control. In this paper, as a first step, we investigate the information processing capability of soft continuum arms. We apply input signals of varying amplitude and bandwidth to a soft continuum arm and generate the dynamic response for a large number of trials. These data is aggregated and used to train the readout weights to implement a reservoir computing scheme. Results demonstrate that the information processing capability varies across input signal bandwidth and amplitude. These preliminary results demonstrate that soft continuum arms have optimal bandwidth and amplitude where one can implement reservoir computing.
Towards a General-Purpose Linguistic Annotation Backend
Venue: arXiv cs.CL 2018
Year: 2018

Language documentation is inherently a time-intensive process; transcription, glossing, and corpus management consume a significant portion of documentary linguists' work. Advances in natural language processing can help to accelerate this work, using the linguists' past decisions as training material, but questions remain about how to prioritize human involvement. In this extended abstract, we describe the beginnings of a new project that will attempt to ease this language documentation process through the use of natural language processing (NLP) technology. It is based on (1) methods to adapt NLP tools to new languages, based on recent advances in massively multilingual neural networks, and (2) backend APIs and interfaces that allow linguists to upload their data. We then describe our current progress on two fronts: automatic phoneme transcription, and glossing. Finally, we briefly describe our future directions.
Large Intelligent Surface-Assisted Wireless Communication Exploiting Statistical CSI
Venue: arXiv cs.IT 2018
Year: 2018

Large intelligent surface (LIS)-assisted wireless communications have drawn attention worldwide. With the use of low-cost LIS on building walls, signals can be reflected by the LIS and sent out along desired directions by controlling its phases, thereby providing supplementary links for wireless communication systems. In this study, we evaluate the performance of an LIS-assisted large-scale antenna system by formulating a tight approximation of the ergodic capacity and investigate the effect of the phase shifts on the ergodic capacity in different propagation scenarios. In particular, we propose an optimal phase shift design based on the ergodic capacity approximation and statistical channel state information. Furthermore, we derive the requirement on the quantization bits of the LIS to promise an acceptable capacity degradation. Numerical results show that using the proposed phase shift design can achieve the maximum ergodic capacity, and a 2-bit quantizer is sufficient to ensure capacity degradation of no more than 1 bit/s/Hz.
Towards Experimental P-systems using multivesicular liposomes
Venue: arXiv cs.ET 2018
Year: 2018

P-systems are abstract computational models inspired by the phospholipid bilayer membranes generated by biological cells. Illustrated here is a mechanism by which recursive liposome structures (multivesicular liposomes) may be experimentally produced through electroformation of dipalmitoylphosphatidylcholine (DOPC) films for use in `real' P-systems. We first present the electroformation protocol and microscopic characterisation of incident liposomes towards estimating the size of computing elements, level of internal compartment recursion, fault tolerance and stability. Following, we demonstrate multiple routes towards embedding symbols, namely modification of swelling solutions, passive diffusion and microinjection. Finally, we discuss how computing devices based on P-systems can be produced and their current limitations.
Channel Modeling for Diffusive Molecular Communication - A Tutorial Review
Venue: arXiv cs.ET 2018
Year: 2018

Molecular communication (MC) is a new communication engineering paradigm where molecules are employed as information carriers. MC systems are expected to enable new revolutionary applications such as sensing of target substances in biotechnology, smart drug delivery in medicine, and monitoring of oil pipelines or chemical reactors in industrial settings. As for any other kind of communication, simple yet sufficiently accurate channel models are needed for the design, analysis, and efficient operation of MC systems. In this paper, we provide a tutorial review on mathematical channel modeling for diffusive MC systems. The considered end-to-end MC channel models incorporate the effects of the release mechanism, the MC environment, and the reception mechanism on the observed information molecules. Thereby, the various existing models for the different components of an MC system are presented under a common framework and the underlying biological, chemical, and physical phenomena are discussed. Deterministic models characterizing the expected number of molecules observed at the receiver and statistical models characterizing the actual number of observed molecules are developed. In addition, we provide channel models for time-varying MC systems with moving transmitters and receivers, which are relevant for advanced applications such as smart drug delivery with mobile nanomachines. For complex scenarios, where simple MC channel models cannot be obtained from first principles, we investigate simulation-driven and experimentally-driven channel models. Finally, we provide a detailed discussion of potential challenges, open research problems, and future directions in channel modeling for diffusive MC systems.