OpenRaiser/Intern-Atlas huggingface dataset:
Going Digital: A Survey on Digitalization and Large Scale Data Analytics in Healthcare
Venue: arXiv cs.CY 2016
Year: 2016

We provide an overview of the recent trends towards digitalization and large scale data analytics in healthcare. It is expected that these trends are instrumental in the dramatic changes in the way healthcare will be organized in the future. We discuss the recent political initiatives designed to shift care delivery processes from paper to electronic, with the goals of more effective treatments with better outcomes; cost pressure is a major driver of innovation. We describe newly developed networks of healthcare providers, research organizations and commercial vendors to jointly analyze data for the development of decision support systems. We address the trend towards continuous healthcare where health is monitored by wearable and stationary devices; a related development is that patients increasingly assume responsibility for their own health data. Finally we discuss recent initiatives towards a personalized medicine, based on advances in molecular medicine, data management, and data analytics.
Risk and Ambiguity in Information Seeking: Eye Gaze Patterns Reveal Contextual Behaviour in Dealing with Uncertainty
Venue: arXiv cs.IR 2016
Year: 2016

Information foraging connects optimal foraging theory in ecology with how humans search for information. The theory suggests that, following an information scent, the information seeker must optimize the tradeoff between exploration by repeated steps in the search space vs. exploitation, using the resources encountered. We conjecture that this tradeoff characterizes how a user deals with uncertainty and its two aspects, risk and ambiguity in economic theory. Risk is related to the perceived quality of the actually visited patch of information, and can be reduced by exploiting and understanding the patch to a better extent. Ambiguity, on the other hand, is the opportunity cost of having higher quality patches elsewhere in the search space. The aforementioned tradeoff depends on many attributes, including traits of the user: at the two extreme ends of the spectrum, analytic and wholistic searchers employ entirely different strategies. The former type focuses on exploitation first, interspersed with bouts of exploration, whereas the latter type prefers to explore the search space first and consume later. Based on an eye-tracking study of experts' interactions with novel search interfaces in the biomedical domain, we demonstrate that perceived risk shifts the balance between exploration and exploitation in either type of users, tilting it against vs. in favour of ambiguity minimization. Since the pattern of behaviour in information foraging is quintessentially sequential, risk and ambiguity minimization cannot happen simultaneously, leading to a fundamental limit on how good such a tradeoff can be. This in turn connects information seeking with the emergent field of quantum decision theory.
Wireless Coded Caching: A Topological Perspective
Venue: arXiv cs.IT 2016
Year: 2016

We explore the performance of coded caching in a SISO BC setting where some users have higher link capacities than others. Focusing on a binary and fixed topological model where strong links have a fixed normalized capacity 1, and where weak links have reduced normalized capacity $τ<1$, we identify --- as a function of the cache size and $τ$ --- the optimal throughput performance, within a factor of at most 8. The transmission scheme that achieves this performance, employs a simple form of interference enhancement, and exploits the property that weak links attenuate interference, thus allowing for multicasting rates to remain high even when involving weak users. This approach ameliorates the negative effects of uneven topology in multicasting, now allowing all users to achieve the optimal performance associated to $τ=1$, even if $τ$ is approximately as low as $τ\geq 1-(1-w)^g$ where $g$ is the coded-caching gain, and where $w$ is the fraction of users that are weak. This leads to the interesting conclusion that for coded multicasting, the weak users need not bring down the performance of all users, but on the contrary to a certain extent, the strong users can lift the performance of the weak users without any penalties on their own performance. Furthermore for smaller ranges of $τ$, we also see that achieving the near-optimal performance comes with the advantage that the strong users do not suffer any additional delays compared to the case where $τ= 1$.
Evaluating Informal-Domain Word Representations With UrbanDictionary
Venue: arXiv cs.CL 2016
Year: 2016

Existing corpora for intrinsic evaluation are not targeted towards tasks in informal domains such as Twitter or news comment forums. We want to test whether a representation of informal words fulfills the promise of eliding explicit text normalization as a preprocessing step. One possible evaluation metric for such domains is the proximity of spelling variants. We propose how such a metric might be computed and how a spelling variant dataset can be collected using UrbanDictionary.
ISI-Aware Modeling and Achievable Rate Analysis of the Diffusion Channel
Venue: arXiv cs.ET 2016
Year: 2016

Analyzing the achievable rate of molecular communication via diffusion (MCvD) inherits intricacies due to its nature: MCvD channel has memory, and the heavy tail of the signal causes inter symbol interference (ISI). Therefore, using Shannon's channel capacity formulation for memoryless channel is not appropriate for the MCvD channel. Instead, a more general achievable rate formulation and system model must be considered to make this analysis accurately. In this letter, we propose an effective ISI-aware MCvD modeling technique in 3-D medium and properly analyze the achievable rate.
Dynamic Subarrays for Hybrid Precoding in Wideband mmWave MIMO Systems
Venue: arXiv cs.IT 2016
Year: 2016

Hybrid analog/digital precoding architectures can address the trade-off between achievable spectral efficiency and power consumption in large-scale MIMO systems. This makes it a promising candidate for millimeter wave systems, which require deploying large antenna arrays at both the transmitter and receiver to guarantee sufficient received signal power. Most prior work on hybrid precoding focused on narrowband channels and assumed fully-connected hybrid architectures. MmWave systems, though, are expected to be wideband with frequency selectivity. In this paper, a closed-form solution for fully-connected OFDM-based hybrid analog/digital precoding is developed for frequency selective mmWave systems. This solution is then extended to partially-connected but fixed architectures in which each RF chain is connected to a specific subset of the antennas. The derived solutions give insights into how the hybrid subarray structures should be designed. Based on them, a novel technique that dynamically constructs the hybrid subarrays based on the long-term channel characteristics is developed. Simulation results show that the proposed hybrid precoding solutions achieve spectral efficiencies close to that obtained with fully-digital architectures in wideband mmWave channels. Further, the results indicate that the developed dynamic subarray solution outperforms the fixed hybrid subarray structures in various system and channel conditions.
SelQA: A New Benchmark for Selection-based Question Answering
Venue: arXiv cs.CL 2016
Year: 2016

This paper presents a new selection-based question answering dataset, SelQA. The dataset consists of questions generated through crowdsourcing and sentence length answers that are drawn from the ten most prevalent topics in the English Wikipedia. We introduce a corpus annotation scheme that enhances the generation of large, diverse, and challenging datasets by explicitly aiming to reduce word co-occurrences between the question and answers. Our annotation scheme is composed of a series of crowdsourcing tasks with a view to more effectively utilize crowdsourcing in the creation of question answering datasets in various domains. Several systems are compared on the tasks of answer sentence selection and answer triggering, providing strong baseline results for future work to improve upon.
A Learning Algorithm for Relational Logistic Regression: Preliminary Results
Venue: arXiv cs.AI 2016
Year: 2016

Relational logistic regression (RLR) is a representation of conditional probability in terms of weighted formulae for modelling multi-relational data. In this paper, we develop a learning algorithm for RLR models. Learning an RLR model from data consists of two steps: 1- learning the set of formulae to be used in the model (a.k.a. structure learning) and learning the weight of each formula (a.k.a. parameter learning). For structure learning, we deploy Schmidt and Murphy's hierarchical assumption: first we learn a model with simple formulae, then more complex formulae are added iteratively only if all their sub-formulae have proven effective in previous learned models. For parameter learning, we convert the problem into a non-relational learning problem and use an off-the-shelf logistic regression learning algorithm from Weka, an open-source machine learning tool, to learn the weights. We also indicate how hidden features about the individuals can be incorporated into RLR to boost the learning performance. We compare our learning algorithm to other structure and parameter learning algorithms in the literature, and compare the performance of RLR models to standard logistic regression and RDN-Boost on a modified version of the MovieLens data-set.
Coordination and Antenna Domain Formation in Cloud-RAN systems
Venue: arXiv cs.IT 2016
Year: 2016

We study here the problem of Antenna Domain Formation (ADF) in cloud RAN systems, whereby multiple remote radio-heads (RRHs) are each to be assigned to a set of antenna domains (ADs), such that the total interference between the ADs is minimized. We formulate the corresponding optimization problem, by introducing the concept of \emph{interference coupling coefficients} among pairs of radio-heads. We then propose a low-overhead algorithm that allows the problem to be solved in a distributed fashion, among the aggregation nodes (ANs), and establish basic convergence results. Moreover, we also propose a simple relaxation to the problem, thus enabling us to characterize its maximum performance. We follow a layered coordination structure: after the ADs are formed, radio-heads are clustered to perform coordinated beamforming using the well known Weighted-MMSE algorithm. Finally, our simulations show that using the proposed ADF mechanism would significantly increase the sum-rate of the system (with respect to random assignment of radio-heads).
Obtaining the Pre-Inverse of a Power Amplifier using Iterative Learning Control
Venue: arXiv cs.SY 2016
Year: 2016

Telecommunication networks make extensive use of power amplifiers to broaden the coverage from transmitter to receiver. Achieving high power efficiency is challenging and comes at a price: the wanted linear performance is degraded due to nonlinear effects. To compensate for these nonlinear disturbances, existing techniques compute the pre-inverse of the power amplifier by estimation of a nonlinear model. However, the extraction of this nonlinear model is involved and requires advanced system identification techniques. We used the plant inversion iterative learning control algorithm to investigate whether the nonlinear modeling step can be simplified. This paper introduces the iterative learning control framework for the pre-inverse estimation and predistortion of power amplifiers. The iterative learning control algorithm is used to obtain a high quality predistorted input for the power amplifier under study without requiring a nonlinear model of the power amplifier. In a second step a nonlinear pre-inverse model of the amplifier is obtained. Both the nonlinear and memory effects of a power amplifier can be compensated by this approach. The convergence of the iterative approach, and the predistortion results are illustrated on a simulation of a Motorola LDMOS transistor based power amplifier and a measurement example using the Chalmers RF WebLab measurement setup.
Scalable image coding based on epitomes
Venue: arXiv cs.CV 2016
Year: 2016

In this paper, we propose a novel scheme for scalable image coding based on the concept of epitome. An epitome can be seen as a factorized representation of an image. Focusing on spatial scalability, the enhancement layer of the proposed scheme contains only the epitome of the input image. The pixels of the enhancement layer not contained in the epitome are then restored using two approaches inspired from local learning-based super-resolution methods. In the first method, a locally linear embedding model is learned on base layer patches and then applied to the corresponding epitome patches to reconstruct the enhancement layer. The second approach learns linear mappings between pairs of co-located base layer and epitome patches. Experiments have shown that significant improvement of the rate-distortion performances can be achieved compared to an SHVC reference.
Domain Specific Language for Modular Knitting Pattern Definitions: Purl
Venue: arXiv cs.PL 2016
Year: 2016

Purl is a language to be used for modular definition and verification of knitting patterns. The syntax is similar to the standard knitting pattern notation provided by the Craft Yarn Council. Purl provides constructs not available in the standard notation to allow reuse of segments of patterns. This report describes the basics of knitting and hand-knitting patterns. A knitting pattern language more terse than the standard notation is presented with the implementation of a compiler to this standard.
Epimenides, Gödel, Turing: an Eternal Gölden Tangle
Venue: arXiv cs.LO 2016
Year: 2016

The Halting Problem is a version of the Liar's Paradox.
Comparison of OFDM and Single-Carrier for Large-Scale Antenna Systems
Venue: arXiv cs.IT 2016
Year: 2016

Large-scale antenna (LSA) or massive multiple-input multiple-output (MIMO) has gained a lot of attention due to its potential to significantly improve system throughput. As a natural evolution from traditional MIMO-orthogonal frequency division multiplexing (OFDM), LSA has been combined with OFDM to deal with frequency selectivity of wireless channels in most existing works. As an alternative approach, single-carrier (SC) has also been proposed for LSA systems due to its low implementation complexity. In this article, a comprehensive comparison between LSA-OFDM and LSA-SC is presented, which is of interest to the waveform design for the next generation wireless systems.
"Show me the cup": Reference with Continuous Representations
Venue: arXiv cs.CL 2016
Year: 2016

One of the most basic functions of language is to refer to objects in a shared scene. Modeling reference with continuous representations is challenging because it requires individuation, i.e., tracking and distinguishing an arbitrary number of referents. We introduce a neural network model that, given a definite description and a set of objects represented by natural images, points to the intended object if the expression has a unique referent, or indicates a failure, if it does not. The model, directly trained on reference acts, is competitive with a pipeline manually engineered to perform the same task, both when referents are purely visual, and when they are characterized by a combination of visual and linguistic properties.
Particle Filter-Based Fault Diagnosis of Nonlinear Systems Using a Dual Particle Filter Scheme
Venue: arXiv cs.SY 2016
Year: 2016

In this paper, a dual estimation methodology is developed for both time-varying parameters and states of a nonlinear stochastic system based on the Particle Filtering (PF) scheme. Our developed methodology is based on a concurrent implementation of state and parameter estimation filters as opposed to using a single filter for simultaneously estimating the augmented states and parameters. The convergence and stability of our proposed dual estimation strategy are shown formally to be guaranteed under certain conditions. The ability of our developed dual estimation method is testified to handle simultaneously and efficiently the states and time-varying parameters of a nonlinear system in a context of health monitoring which employs a unified approach to fault detection, isolation and identification is a single algorithm. The performance capabilities of our proposed fault diagnosis methodology is demonstrated and evaluated by its application to a gas turbine engine through accomplishing state and parameter estimation under simultaneous and concurrent component fault scenarios. Extensive simulation results are provided to substantiate and justify the superiority of our proposed fault diagnosis methodology when compared with another well-known alternative diagnostic technique that is available in the literature.
Technical Report: Towards a Universal Code Formatter through Machine Learning
Venue: arXiv cs.PL 2016
Year: 2016

There are many declarative frameworks that allow us to implement code formatters relatively easily for any specific language, but constructing them is cumbersome. The first problem is that "everybody" wants to format their code differently, leading to either many formatter variants or a ridiculous number of configuration options. Second, the size of each implementation scales with a language's grammar size, leading to hundreds of rules. In this paper, we solve the formatter construction problem using a novel approach, one that automatically derives formatters for any given language without intervention from a language expert. We introduce a code formatter called CodeBuff that uses machine learning to abstract formatting rules from a representative corpus, using a carefully designed feature set. Our experiments on Java, SQL, and ANTLR grammars show that CodeBuff is efficient, has excellent accuracy, and is grammar invariant for a given language. It also generalizes to a 4th language tested during manuscript preparation.
Potential benefits of a block-space GPU approach for discrete tetrahedral domains
Venue: arXiv cs.DC 2016
Year: 2016

The study of data-parallel domain re-organization and thread-mapping techniques are relevant topics as they can increase the efficiency of GPU computations when working on spatial discrete domains with non-box-shaped geometry. In this work we study the potential benefits of applying a succint data re-organization of a tetrahedral data-parallel domain of size $\mathcal{O}(n^3)$ combined with an efficient block-space GPU map of the form $g:\mathbb{N} \rightarrow \mathbb{N}^3$. Results from the analysis suggest that in theory the combination of these two optimizations produce significant performance improvement as block-based data re-organization allows a coalesced one-to-one correspondence at local thread-space while $g(λ)$ produces an efficient block-space spatial correspondence between groups of data and groups of threads, reducing the number of unnecessary threads from $O(n^3)$ to $O(n^2ρ^3)$ where $ρ$ is the linear block-size and typically $ρ^3 \ll n$. From the analysis, we obtained that a block based succint data re-organization can provide up to $2\times$ improved performance over a linear data organization while the map can be up to $6\times$ more efficient than a bounding box approach. The results from this work can serve as a useful guide for a more efficient GPU computation on tetrahedral domains found in spin lattice, finite element and special n-body problems, among others.
On the Semantic Relationship between Probabilistic Soft Logic and Markov Logic
Venue: arXiv cs.AI 2016
Year: 2016

Markov Logic Networks (MLN) and Probabilistic Soft Logic (PSL) are widely applied formalisms in Statistical Relational Learning, an emerging area in Artificial Intelligence that is concerned with combining logical and statistical AI. Despite their resemblance, the relationship has not been formally stated. In this paper, we describe the precise semantic relationship between them from a logical perspective. This is facilitated by first extending fuzzy logic to allow weights, which can be also viewed as a generalization of PSL, and then relate that generalization to MLN. We observe that the relationship between PSL and MLN is analogous to the known relationship between fuzzy logic and Boolean logic, and furthermore the weight scheme of PSL is essentially a generalization of the weight scheme of MLN for the many-valued setting.
Non-linear Label Ranking for Large-scale Prediction of Long-Term User Interests
Venue: arXiv cs.AI 2016
Year: 2016

We consider the problem of personalization of online services from the viewpoint of ad targeting, where we seek to find the best ad categories to be shown to each user, resulting in improved user experience and increased advertisers' revenue. We propose to address this problem as a task of ranking the ad categories depending on a user's preference, and introduce a novel label ranking approach capable of efficiently learning non-linear, highly accurate models in large-scale settings. Experiments on a real-world advertising data set with more than 3.2 million users show that the proposed algorithm outperforms the existing solutions in terms of both rank loss and top-K retrieval performance, strongly suggesting the benefit of using the proposed model on large-scale ranking problems.
A Knowledge-Based Resource Discovery for Internet of Things
Venue: arXiv cs.NI 2016
Year: 2016

In the sensing as a service paradigm, Internet of Things (IoT) Middleware platforms allow data consumers to retrieve the data they want without knowing the underlying technical details of IoT resources (i.e. sensors and data processing components). However, configuring an IoT middleware platform and retrieving data is a significant challenge for data consumers as it requires both technical knowledge and domain expertise. In this paper, we propose a knowledge driven approach called Context Aware Sensor Configuration Model (CASCOM) to simplify the process of configuring IoT middleware platforms, so the data consumers, specifically non-technical personnel, can easily retrieve the data they required. In this paper, we demonstrate how IoT resources can be described using semantics in such away that they can later be used to compose service work-flows. Such automated semantic-knowledge based IoT resource composition approach advances the current research. We demonstrate the feasibility and the usability of our approach through a prototype implementation based on an IoT middleware called Global Sensor Networks (GSN), though our model can be generalized to any other middleware platform.
Extended OOBE Comparisons for OFDM, GFDM and WCP-COQAM at Equal Spectral Efficiency
Venue: arXiv cs.IT 2016
Year: 2016

Generalized frequency division multiplexing (GFDM), windowed cyclic prefix circular offset quadrature amplitude modulation (WCP-COQAM) and orthogonal frequency division multiplexing (OFDM) are among the candidate 5G modulation formats. In this study, we present additional results for the OOBE comparisons between OFDM, GFDM and WCP-COQAM under equal or unequal spectral efficiency conditions for various simulation scenarios.