OpenRaiser/Intern-Atlas huggingface dataset:
Evaluative Assessment of an X-band Microstrip Patch Antenna for Wireless Systems
Venue: arXiv cs.ET 2017
Year: 2017

Microstrip patch antennas (MPAs) are rapidly gaining more attention due to the proliferation of communication devices and systems with frequencies becoming more suitable for the size and performance of this type of antenna. Due to recent advancements in semiconductor technology, high dielectric constant materials are used to achieve additional size reduction which has made MPAs very useful and popular in the design of mobile devices and wireless systems. However, MPAs suffer from problems associated with narrow bandwidth and low gain. Techniques employed for improving the performance of MPA hinge on tweaking features such as the patch size, substrate height, ground plane size and feeding method. In view of this, this research designs and analyzes the performance of an X-band MPA for wireless systems using CST Microwave Studio. Including the ground plane, the proposed design has a low profile structure of 17 mm x 17 mm x 1.6 mm which is suitable for wireless systems. The proposed design also resonates at a frequency of 10 GHz with an omnidirectional radiation pattern exhibiting a gain of 7.2 dBi. Return Loss, VSWR, Gain and Radiation Pattern are the performance indicators employed in this research. The proposed MPA design demonstrates marked performance improvement when benchmarked with a similar MPA designed for 5G applications.
Difficulty-level Modeling of Ontology-based Factual Questions
Venue: arXiv cs.AI 2017
Year: 2017

Semantics based knowledge representations such as ontologies are found to be very useful in automatically generating meaningful factual questions. Determining the difficulty level of these system generated questions is helpful to effectively utilize them in various educational and professional applications. The existing approaches for finding the difficulty level of factual questions are very simple and are limited to a few basic principles. We propose a new methodology for this problem by considering an educational theory called Item Response Theory (IRT). In the IRT, knowledge proficiency of end users (learners) are considered for assigning difficulty levels, because of the assumptions that a given question is perceived differently by learners of various proficiencies. We have done a detailed study on the features (factors) of a question statement which could possibly determine its difficulty level for three learner categories (experts, intermediates and beginners). We formulate ontology based metrics for the same. We then train three logistic regression models to predict the difficulty level corresponding to the three learner categories.
Generating Custom Code for Efficient Query Execution on Heterogeneous Processors
Venue: arXiv cs.DB 2017
Year: 2017

Processor manufacturers build increasingly specialized processors to mitigate the effects of the power wall to deliver improved performance. Currently, database engines are manually optimized for each processor: A costly and error prone process. In this paper, we propose concepts to enable the database engine to perform per-processor optimization automatically. Our core idea is to create variants of generated code and to learn a fast variant for each processor. We create variants by modifying parallelization strategies, specializing data structures, and applying different code transformations. Our experimental results show that the performance of variants may diverge up to two orders of magnitude. Therefore, we need to generate custom code for each processor to achieve peak performance. We show that our approach finds a fast custom variant for multi-core CPUs, GPUs, and MICs.
Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data
Venue: arXiv cs.DC 2017
Year: 2017

The need for scalable concurrent ordered set data structures with linearizable range query support is increasing due to the rise of multicore computers, data processing platforms and in-memory databases. This paper presents a new concurrent ordered set with linearizable range query support. The new data structure is based on the contention adapting search tree and an immutable data structure. Experimental results show that the new data structure is as much as three times faster compared to related data structures. The data structure scales well due to its ability to adapt the sizes of its immutable parts to the contention level and the sizes of the range queries.
Blind Stereo Image Quality Assessment Inspired by Brain Sensory-Motor Fusion
Venue: arXiv cs.CV 2017
Year: 2017

The use of 3D and stereo imaging is rapidly increasing. Compression, transmission, and processing could degrade the quality of stereo images. Quality assessment of such images is different than their 2D counterparts. Metrics that represent 3D perception by human visual system (HVS) are expected to assess stereoscopic quality more accurately. In this paper, inspired by brain sensory/motor fusion process, two stereo images are fused together. Then from every fused image two synthesized images are extracted. Effects of different distortions on statistical distributions of the synthesized images are shown. Based on the observed statistical changes, features are extracted from these synthesized images. These features can reveal type and severity of distortions. Then, a stacked neural network model is proposed, which learns the extracted features and accurately evaluates the quality of stereo images. This model is tested on 3D images of popular databases. Experimental results show the superiority of this method over state of the art stereo image quality assessment approaches
Understanding the Logical and Semantic Structure of Large Documents
Venue: arXiv cs.CL 2017
Year: 2017

Current language understanding approaches focus on small documents, such as newswire articles, blog posts, product reviews and discussion forum entries. Understanding and extracting information from large documents like legal briefs, proposals, technical manuals and research articles is still a challenging task. We describe a framework that can analyze a large document and help people to know where a particular information is in that document. We aim to automatically identify and classify semantic sections of documents and assign consistent and human-understandable labels to similar sections across documents. A key contribution of our research is modeling the logical and semantic structure of an electronic document. We apply machine learning techniques, including deep learning, in our prototype system. We also make available a dataset of information about a collection of scholarly articles from the arXiv eprints collection that includes a wide range of metadata for each article, including a table of contents, section labels, section summarizations and more. We hope that this dataset will be a useful resource for the machine learning and NLP communities in information retrieval, content-based question answering and language modeling.
Directional Cell Search Delay Analysis for Cellular Networks with Static Users
Venue: arXiv cs.IT 2017
Year: 2017

Cell search is the process for a user to detect its neighboring base stations (BSs) and make a cell selection decision. Due to the importance of beamforming gain in millimeter wave (mmWave) and massive MIMO cellular networks, the directional cell search delay performance is investigated. A cellular network with fixed BS and user locations is considered, so that strong temporal correlations exist for the SINR experienced at each BS and user. For Poisson cellular networks with Rayleigh fading channels, a closed-form expression for the spatially averaged mean cell search delay of all users is derived. This mean cell search delay for a noise-limited network (e.g., mmWave network) is proved to be infinite whenever the non-line-of-sight (NLOS) path loss exponent is larger than 2. For interference-limited networks, a phase transition for the mean cell search delay is shown to exist in terms of the number of BS antennas/beams $M$: the mean cell search delay is infinite when $M$ is smaller than a threshold and finite otherwise. Beam-sweeping is also demonstrated to be effective in decreasing the cell search delay, especially for the cell edge users.
Non-Uniform Wavelet Sampling for RF Analog-to-Information Conversion
Venue: arXiv cs.IT 2017
Year: 2017

Feature extraction, such as spectral occupancy, interferer energy and type, or direction-of-arrival, from wideband radio-frequency~(RF) signals finds use in a growing number of applications as it enhances RF transceivers with cognitive abilities and enables parameter tuning of traditional RF chains. In power and cost limited applications, e.g., for sensor nodes in the Internet of Things, wideband RF feature extraction with conventional, Nyquist-rate analog-to-digital converters is infeasible. However, the structure of many RF features (such as signal sparsity) enables the use of compressive sensing (CS) techniques that acquire such signals at sub-Nyquist rates. While such CS-based analog-to-information (A2I) converters have the potential to enable low-cost and energy-efficient wideband RF sensing, they suffer from a variety of real-world limitations, such as noise folding, low sensitivity, aliasing, and limited flexibility. This paper proposes a novel CS-based A2I architecture called non-uniform wavelet sampling (NUWS). Our solution extracts a carefully-selected subset of wavelet coefficients directly in the RF domain, which mitigates the main issues of existing A2I converter architectures. For multi-band RF signals, we propose a specialized variant called non-uniform wavelet bandpass sampling (NUWBS), which further improves sensitivity and reduces hardware complexity by leveraging the multi-band signal structure. We use simulations to demonstrate that NUWBS approaches the theoretical performance limits of $\ell_1$-norm-based sparse signal recovery. We investigate hardware-design aspects and show ASIC measurement results for the wavelet generation stage, which highlight the efficacy of NUWBS for a broad range of RF feature extraction tasks in cost- and power-limited applications.
Reversing Imperative Parallel Programs
Venue: arXiv cs.PL 2017
Year: 2017

We propose an approach and a subsequent extension for reversing imperative programs. Firstly, we produce both an augmented version and a corresponding inverted version of the original program. Augmentation saves reversal information into an auxiliary data store, maintaining segregation between this and the program state, while never altering the data store in any other way than that of the original program. Inversion uses this information to revert the final program state to the state as it was before execution. We prove that augmentation and inversion work as intended, and illustrate our approach with several examples. We also suggest a modification to our first approach to support non-communicating parallelism. Execution interleaving introduces a number of challenges, each of which our extended approach considers. We define annotation and redefine inversion to use a sequence of statement identifiers, making the interleaving order deterministic in reverse.
Hypothesis Testing based Intrinsic Evaluation of Word Embeddings
Venue: arXiv cs.CL 2017
Year: 2017

We introduce the cross-match test - an exact, distribution free, high-dimensional hypothesis test as an intrinsic evaluation metric for word embeddings. We show that cross-match is an effective means of measuring distributional similarity between different vector representations and of evaluating the statistical significance of different vector embedding models. Additionally, we find that cross-match can be used to provide a quantitative measure of linguistic similarity for selecting bridge languages for machine translation. We demonstrate that the results of the hypothesis test align with our expectations and note that the framework of two sample hypothesis testing is not limited to word embeddings and can be extended to all vector representations.
Theoretical Analysis of Stochastic Search Algorithms
Venue: arXiv cs.NE 2017
Year: 2017

Theoretical analyses of stochastic search algorithms, albeit few, have always existed since these algorithms became popular. Starting in the nineties a systematic approach to analyse the performance of stochastic search heuristics has been put in place. This quickly increasing basis of results allows, nowadays, the analysis of sophisticated algorithms such as population-based evolutionary algorithms, ant colony optimisation and artificial immune systems. Results are available concerning problems from various domains including classical combinatorial and continuous optimisation, single and multi-objective optimisation, and noisy and dynamic optimisation. This chapter introduces the mathematical techniques that are most commonly used in the runtime analysis of stochastic search heuristics. Careful attention is given to the very popular artificial fitness levels and drift analyses techniques for which several variants are presented. To aid the reader's comprehension of the presented mathematical methods, these are applied to the analysis of simple evolutionary algorithms for artificial example functions. The chapter is concluded by providing references to more complex applications and further extensions of the techniques for the obtainment of advanced results.
A Mimetic Strategy to Engage Voluntary Physical Activity In Interactive Entertainment
Venue: arXiv cs.HC 2017
Year: 2017

We describe the design and implementation of a vision based interactive entertainment system that makes use of both involuntary and voluntary control paradigms. Unintentional input to the system from a potential viewer is used to drive attention-getting output and encourage the transition to voluntary interactive behaviour. The iMime system consists of a character animation engine based on the interaction metaphor of a mime performer that simulates non-verbal communication strategies, without spoken dialogue, to capture and hold the attention of a viewer. The system was developed in the context of a project studying care of dementia sufferers. Care for a dementia sufferer can place unreasonable demands on the time and attentional resources of their caregivers or family members. Our study contributes to the eventual development of a system aimed at providing relief to dementia caregivers, while at the same time serving as a source of pleasant interactive entertainment for viewers. The work reported here is also aimed at a more general study of the design of interactive entertainment systems involving a mixture of voluntary and involuntary control.
DR-RNN: A deep residual recurrent neural network for model reduction
Venue: arXiv cs.CE 2017
Year: 2017

We introduce a deep residual recurrent neural network (DR-RNN) as an efficient model reduction technique for nonlinear dynamical systems. The developed DR-RNN is inspired by the iterative steps of line search methods in finding the residual minimiser of numerically discretized differential equations. We formulate this iterative scheme as stacked recurrent neural network (RNN) embedded with the dynamical structure of the emulated differential equations. Numerical examples demonstrate that DR-RNN can effectively emulate the full order models of nonlinear physical systems with a significantly lower number of parameters in comparison to standard RNN architectures. Further, we combined DR-RNN with Proper Orthogonal Decomposition (POD) for model reduction of time dependent partial differential equations. The presented numerical results show the stability of proposed DR-RNN as an explicit reduced order technique. We also show significant gains in accuracy by increasing the depth of proposed DR-RNN similar to other applications of deep learning.
Learning Word Embeddings from the Portuguese Twitter Stream: A Study of some Practical Aspects
Venue: arXiv cs.CL 2017
Year: 2017

This paper describes a preliminary study for producing and distributing a large-scale database of embeddings from the Portuguese Twitter stream. We start by experimenting with a relatively small sample and focusing on three challenges: volume of training data, vocabulary size and intrinsic evaluation metrics. Using a single GPU, we were able to scale up vocabulary size from 2048 words embedded and 500K training examples to 32768 words over 10M training examples while keeping a stable validation loss and approximately linear trend on training time per epoch. We also observed that using less than 50\% of the available training examples for each vocabulary size might result in overfitting. Results on intrinsic evaluation show promising performance for a vocabulary size of 32768 words. Nevertheless, intrinsic evaluation metrics suffer from over-sensitivity to their corresponding cosine similarity thresholds, indicating that a wider range of metrics need to be developed to track progress.
Consensus of second order multi-agents with actuator saturation and asynchronous time-delays
Venue: arXiv cs.MA 2017
Year: 2017

This article presents the consensus of a saturated second order multi-agent system with non-switching dynamics that can be represented by a directed graph. The system is affected by data processing (input delay) and communication time-delays that are assumed to be asynchronous. The agents have saturation nonlinearities, each of them is approximated into separate linear and nonlinear elements. Nonlinear elements are represented by describing functions. Describing functions and stability of linear elements are used to estimate the existence of limit cycles in the system with multiple control laws. Stability analysis of the linear element is performed using Lyapunov-Krasovskii functions and frequency domain analysis. A comparison of pros and cons of both the analyses with respect to time-delay ranges, applicability and computation complexity is presented. Simulation and corresponding hardware implementation results are demonstrated to support theoretical results.
Feasibility of Corneal Imaging for Handheld Augmented Reality
Venue: arXiv cs.HC 2017
Year: 2017

Smartphones are a popular device class for mobile Augmented Reality but suffer from a limited input space. Around-device interaction techniques aim at extending this input space using various sensing modalities. In this paper we present our work towards extending the input area of mobile devices using front-facing device-centered cameras that capture reflections in the cornea. As current generation mobile devices lack high resolution front-facing cameras, we study the feasibility of around-device interaction using corneal reflective imaging based on a high resolution camera. We present a workflow, a technical prototype and a feasibility evaluation.
Towards Around-Device Interaction using Corneal Imaging
Venue: arXiv cs.HC 2017
Year: 2017

Around-device interaction techniques aim at extending the input space using various sensing modalities on mobile and wearable devices. In this paper, we present our work towards extending the input area of mobile devices using front-facing device-centered cameras that capture reflections in the human eye. As current generation mobile devices lack high resolution front-facing cameras we study the feasibility of around-device interaction using corneal reflective imaging based on a high resolution camera. We present a workflow, a technical prototype and an evaluation, including a migration path from high resolution to low resolution imagers. Our study indicates, that under optimal conditions a spatial sensing resolution of 5 cm in the vicinity of a mobile phone is possible.
Performance Analysis of Integrated Sub-6 GHz-Millimeter Wave Wireless Local Area Networks
Venue: arXiv cs.IT 2017
Year: 2017

Millimeter wave (mmW) communications at the 60 GHz unlicensed band is seen as a promising approach for boosting the capacity of wireless local area networks (WLANs). If properly integrated into legacy IEEE 802.11 standards, mmW communications can offer substantial gains by offloading traffic from congested sub-6 GHz unlicensed bands to the 60 GHz mmW frequency band. In this paper, a novel medium access control (MAC) is proposed to dynamically manage the WLAN traffic over the unlicensed mmW and sub-6 GHz bands. The proposed protocol leverages the capability of advanced multi-band wireless stations (STAs) to perform fast session transfers (FST) to the mmW band, while considering the intermittent channel at the 60 GHz band and the level of congestion observed over the sub-6 GHz bands. The performance of the proposed scheme is analytically studied via a new Markov chain model and the probability of transmissions over the mmW and sub-6 GHz bands, as well as the aggregated saturation throughput are derived. In addition, analytical results are validated by simulation results. Simulation results show that the proposed integrated mmW-sub 6 GHz MAC protocol yields significant performance gains, in terms of maximizing the saturation throughput and minimizing the delay experienced by the STAs. The results also shed light on the tradeoffs between the achievable gains and the overhead introduced by the FST procedure.
Exact Inference for Relational Graphical Models with Interpreted Functions: Lifted Probabilistic Inference Modulo Theories
Venue: arXiv cs.AI 2017
Year: 2017

Probabilistic Inference Modulo Theories (PIMT) is a recent framework that expands exact inference on graphical models to use richer languages that include arithmetic, equalities, and inequalities on both integers and real numbers. In this paper, we expand PIMT to a lifted version that also processes random functions and relations. This enhancement is achieved by adapting Inversion, a method from Lifted First-Order Probabilistic Inference literature, to also be modulo theories. This results in the first algorithm for exact probabilistic inference that efficiently and simultaneously exploits random relations and functions, arithmetic, equalities and inequalities.
Using $k$-way Co-occurrences for Learning Word Embeddings
Venue: arXiv cs.CL 2017
Year: 2017

Co-occurrences between two words provide useful insights into the semantics of those words. Consequently, numerous prior work on word embedding learning have used co-occurrences between two words as the training signal for learning word embeddings. However, in natural language texts it is common for multiple words to be related and co-occurring in the same context. We extend the notion of co-occurrences to cover $k(\geq\!\!2)$-way co-occurrences among a set of $k$-words. Specifically, we prove a theoretical relationship between the joint probability of $k(\geq\!\!2)$ words, and the sum of $\ell_2$ norms of their embeddings. Next, we propose a learning objective motivated by our theoretical result that utilises $k$-way co-occurrences for learning word embeddings. Our experimental results show that the derived theoretical relationship does indeed hold empirically, and despite data sparsity, for some smaller $k$ values, $k$-way embeddings perform comparably or better than $2$-way embeddings in a range of tasks.