OpenRaiser/Intern-Atlas huggingface dataset:
A Hybrid POMDP-BDI Agent Architecture with Online Stochastic Planning and Plan Caching
Venue: arXiv cs.AI 2016
Year: 2016

This article presents an agent architecture for controlling an autonomous agent in stochastic environments. The architecture combines the partially observable Markov decision process (POMDP) model with the belief-desire-intention (BDI) framework. The Hybrid POMDP-BDI agent architecture takes the best features from the two approaches, that is, the online generation of reward-maximizing courses of action from POMDP theory, and sophisticated multiple goal management from BDI theory. We introduce the advances made since the introduction of the basic architecture, including (i) the ability to pursue multiple goals simultaneously and (ii) a plan library for storing pre-written plans and for storing recently generated plans for future reuse. A version of the architecture without the plan library is implemented and is evaluated using simulations. The results of the simulation experiments indicate that the approach is feasible.
Towards Abstraction from Extraction: Multiple Timescale Gated Recurrent Unit for Summarization
Venue: arXiv cs.CL 2016
Year: 2016

In this work, we introduce temporal hierarchies to the sequence to sequence (seq2seq) model to tackle the problem of abstractive summarization of scientific articles. The proposed Multiple Timescale model of the Gated Recurrent Unit (MTGRU) is implemented in the encoder-decoder setting to better deal with the presence of multiple compositionalities in larger texts. The proposed model is compared to the conventional RNN encoder-decoder, and the results demonstrate that our model trains faster and shows significant performance gains. The results also show that the temporal hierarchies help improve the ability of seq2seq models to capture compositionalities better without the presence of highly complex architectural hierarchies.
Gaussian Message Passing Iterative Detection for MIMO-NOMA Systems with Massive Access
Venue: arXiv cs.IT 2016
Year: 2016

This paper considers a low-complexity Gaussian Message Passing Iterative Detection (GMPID) algorithm for Multiple-Input Multiple-Output systems with Non-Orthogonal Multiple Access (MIMO-NOMA), in which a base station with $N_r$ antennas serves $N_u$ sources simultaneously. Both $N_u$ and $N_r$ are very large numbers and we consider the cases that $N_u>N_r$. The GMPID is based on a fully connected loopy graph, which is well understood to be not convergent in some cases. The large-scale property of the MIMO-NOMA is used to simplify the convergence analysis. Firstly, we prove that the variances of the GMPID definitely converge to that of Minimum Mean Square Error (MMSE) detection. Secondly, two sufficient conditions that the means of the GMPID converge to a higher MSE than that of the MMSE detection are proposed. However, the means of the GMPID may still not converge when $ N_u/N_r< (\sqrt{2}-1)^{-2}$. Therefore, a new convergent SA-GMPID is proposed, which converges to the MMSE detection for any $N_u> N_r$ with a faster convergence speed. Finally, numerical results are provided to verify the validity of the proposed theoretical results.
Time for dithering: fast and quantized random embeddings via the restricted isometry property
Venue: arXiv cs.IT 2016
Year: 2016

Recently, many works have focused on the characterization of non-linear dimensionality reduction methods obtained by quantizing linear embeddings, e.g., to reach fast processing time, efficient data compression procedures, novel geometry-preserving embeddings or to estimate the information/bits stored in this reduced data representation. In this work, we prove that many linear maps known to respect the restricted isometry property (RIP) can induce a quantized random embedding with controllable multiplicative and additive distortions with respect to the pairwise distances of the data points beings considered. In other words, linear matrices having fast matrix-vector multiplication algorithms (e.g., based on partial Fourier ensembles or on the adjacency matrix of unbalanced expanders) can be readily used in the definition of fast quantized embeddings with small distortions. This implication is made possible by applying right after the linear map an additive and random "dither" that stabilizes the impact of the uniform scalar quantization operator applied afterwards. For different categories of RIP matrices, i.e., for different linear embeddings of a metric space $(\mathcal K \subset \mathbb R^n, \ell_q)$ in $(\mathbb R^m, \ell_p)$ with $p,q \geq 1$, we derive upper bounds on the additive distortion induced by quantization, showing that it decays either when the embedding dimension $m$ increases or when the distance of a pair of embedded vectors in $\mathcal K$ decreases. Finally, we develop a novel "bi-dithered" quantization scheme, which allows for a reduced distortion that decreases when the embedding dimension grows and independently of the considered pair of vectors.
New error measures and methods for realizing protein graphs from distance data
Venue: arXiv cs.CG 2016
Year: 2016

The interval Distance Geometry Problem (iDGP) consists in finding a realization in $\mathbb{R}^K$ of a simple undirected graph $G=(V,E)$ with nonnegative intervals assigned to the edges in such a way that, for each edge, the Euclidean distance between the realization of the adjacent vertices is within the edge interval bounds. In this paper, we focus on the application to the conformation of proteins in space, which is a basic step in determining protein function: given interval estimations of some of the inter-atomic distances, find their shape. Among different families of methods for accomplishing this task, we look at mathematical programming based methods, which are well suited for dealing with intervals. The basic question we want to answer is: what is the best such method for the problem? The most meaningful error measure for evaluating solution quality is the coordinate root mean square deviation. We first introduce a new error measure which addresses a particular feature of protein backbones, i.e. many partial reflections also yield acceptable backbones. We then present a set of new and existing quadratic and semidefinite programming formulations of this problem, and a set of new and existing methods for solving these formulations. Finally, we perform a computational evaluation of all the feasible solver$+$formulation combinations according to new and existing error measures, finding that the best methodology is a new heuristic method based on multiplicative weights updates.
Modeling of Item-Difficulty for Ontology-based MCQs
Venue: arXiv cs.AI 2016
Year: 2016

Multiple choice questions (MCQs) that can be generated from a domain ontology can significantly reduce human effort & time required for authoring & administering assessments in an e-Learning environment. Even though here are various methods for generating MCQs from ontologies, methods for determining the difficulty-levels of such MCQs are less explored. In this paper, we study various aspects and factors that are involved in determining the difficulty-score of an MCQ, and propose an ontology-based model for the prediction. This model characterizes the difficulty values associated with the stem and choice set of the MCQs, and describes a measure which combines both the scores. Further more, the notion of assigning difficultly-scores based on the skill level of the test taker is utilized for predicating difficulty-score of a stem. We studied the effectiveness of the predicted difficulty-scores with the help of a psychometric model from the Item Response Theory, by involving real-students and domain experts. Our results show that, the predicated difficulty-levels of the MCQs are having high correlation with their actual difficulty-levels.
A Multi-Game Framework for Harmonized LTE-U and WiFi Coexistence over Unlicensed Bands
Venue: arXiv cs.IT 2016
Year: 2016

The introduction of LTE over unlicensed bands (LTE-U) will enable LTE base stations (BSs) to boost their capacity and offload their traffic by exploiting the underused unlicensed bands. However, to reap the benefits of LTE-U, it is necessary to address various new challenges associated with LTE-U and WiFi coexistence. In particular, new resource management techniques must be developed to optimize the usage of the network resources while handling the interdependence between WiFi and LTE users and ensuring that WiFi users are not jeopardized. To this end, in this paper, a new game theoretic tool, dubbed as \emph{multi-game} framework is proposed as a promising approach for modeling resource allocation problems in LTE-U. In such a framework, multiple, co-existing and coupled games across heterogeneous channels can be formulated to capture the specific characteristics of LTE-U. Such games can be of different properties and types but their outcomes are largely interdependent. After introducing the basics of the multi-game framework, two classes of algorithms are outlined to achieve the new solution concepts of multi-games. Simulation results are then conducted to show how such a multi-game can effectively capture the specific properties of LTE-U and make of it a "friendly" neighbor to WiFi.
An Application of the EM-algorithm to Approximate Empirical Distributions of Financial Indices with the Gaussian Mixtures
Venue: arXiv cs.CE 2016
Year: 2016

In this study I briefly illustrate application of the Gaussian mixtures to approximate empirical distributions of financial indices (DAX, Dow Jones, Nikkei, RTSI, S&P 500). The resulting distributions illustrate very high quality of approximation as evaluated by Kolmogorov-Smirnov test. This implies further study of application of the Gaussian mixtures to approximate empirical distributions of financial indices.
EmoFit: Affect Monitoring System for Sedentary Jobs
Venue: arXiv cs.HC 2016
Year: 2016

Emotional and physical well-being at workplace is important for a positive work environment and higher productivity. Jobs such as software programming lead to a sedentary lifestyle and require high interaction with computers. Working at the same job for years can cause a feeling of intellectual stagnation and lack of drive. Many employees experience lack of motivation, mild to extreme depression due to reasons such as aversion towards job responsibilities and incompatibility with coworkers or boss. This research proposed an affect monitoring system EmoFit that would play the role of psychological and physical health trainer. The day to day computer activity and body language was analyzed to detect the physical and emotional well-being of the user. Keystrokes, activity interruptions, eye tracking, facial expressions, body posture and speech were monitored to gauge the users health. The system also provided activities such as at-desk exercise and stress relief game and motivational quotes in an attempt to promote users well-being. The experimental results and positive feedback from test subjects showed that EmoFit would help improve emotional and physical well-being at jobs that involve significant computer usage.
Analysis of Double Covers of Factor Graphs
Venue: arXiv cs.IT 2016
Year: 2016

Many quantities of interest in communications, signal processing, artificial intelligence, and other areas can be expressed as the partition sum of some factor graph. Although the exact calculation of the partition sum is in many cases intractable, it can often be approximated rather well by the Bethe partition sum. In earlier work, we have shown that graph covers are a useful tool for expressing and analyzing the Bethe approximation. In this paper, we present a novel technique for analyzing double covers, a technique which ultimately leads to a deeper understanding of the Bethe approximation.
On a new convergence class in k-bounded sober spaces
Venue: arXiv cs.LO 2016
Year: 2016

Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$ spaces instead of restricting to posets. In this paper, we respond to this calling by proving a topological parallel of a 2005 result due to B. Zhao and D. Zhao, i.e., an order-theoretic characterisation of those posets for which the lim-inf convergence is topological. We do this by adopting a recent approach due to D. Zhao and W. K. Ho by replacing directed subsets with irreducible sets. As a result, we formulate a new convergence class on $T_0$ spaces called Irr-convergence and established that this convergence class $\mathcal{I}$ on a $k$-bounded sober space $X$ is topological if and only if $X$ is Irr-continuous.
Cultural Differences in E-Learning: Exploring New Dimensions
Venue: arXiv cs.CY 2016
Year: 2016

Rapid development of Internet and information technologies has gifted us with a new and diverse mode of learning known as e-learning. In the current era, e-learning has made rapid, influential, universal, interactive, vibrant, and economic development. Now e-learning has become a global mode of education. E-learning means the use of internet, computer and communications technologies to acquire education. Learners with diverse social, cultural, economic, linguistic, and religious backgrounds from all over the world are taking benefits from e-learning. In e-learning, culture of target learners plays a vital role and need to be explored for better results. Diversity of culture and learning styles should keep under considerations while designing e-learning environment. It may help to attain the required results. In this research work, authors proposed and designed a novel architecture for e-learning system incorporating cultural diversity of learners. The focus is to concentrate on cultural factors from e-learning system. Furthermore; a prototype of the proposed system is implemented for the validation of proposed architecture.
MIMO Wiretap Channel under Receiver Side Power Constraints with Applications to Wireless Power Transfer and Cognitive Radio
Venue: arXiv cs.IT 2016
Year: 2016

We consider the multiple-input multiple-output (MIMO) wiretap channel under a minimum receiver-side power constraint in addition to the usual maximum transmitter-side power constraint. This problem is motivated by energy harvesting communications with wireless energy transfer, where an added goal is to deliver a minimum amount of energy to a receiver in addition to delivering secure data to another receiver. In this paper, we characterize the exact secrecy capacity of the MIMO wiretap channel under transmitter and receiver-side power constraints. We first show that solving this problem is equivalent to solving the secrecy capacity of the wiretap channel under a double-sided correlation matrix constraint on the channel input. We show the converse by extending the channel enhancement technique to our case. We present two achievable schemes that achieve the secrecy capacity: the first achievable scheme uses a Gaussian codebook with a fixed mean, and the second achievable scheme uses artificial noise (or cooperative jamming) together with a Gaussian codebook. The role of the mean or the artificial noise is to enable energy transfer without sacrificing from the secure rate. This is the first instance of a channel model where either the use of a mean signal or the use of channel prefixing via artificial noise is strictly necessary for the MIMO wiretap channel. We then extend our work to consider a maximum receiver-side power constraint. This problem is motivated by cognitive radio applications, where an added goal is to decrease the received signal energy (interference temperature) at a receiver. We further extend our results to: requiring receiver-side power constraints at both receivers; considering secrecy constraints at both receivers to study broadcast channels with confidential messages; and removing the secrecy constraints to study the classical broadcast channel.
Breakout: An Open Measurement and Intervention Tool for Distributed Peer Learning Groups
Venue: arXiv cs.HC 2016
Year: 2016

We present Breakout, a group interaction platform for online courses that enables the creation and measurement of face-to-face peer learning groups in online settings. Breakout is designed to help students easily engage in synchronous, video breakout session based peer learning in settings that otherwise force students to rely on asynchronous text-based communication. The platform also offers data collection and intervention tools for studying the communication patterns inherent in online learning environments. The goals of the system are twofold: to enhance student engagement in online learning settings and to create a platform for research into the relationship between distributed group interaction patterns and learning outcomes.
Pooling Faces: Template based Face Recognition with Pooled Face Images
Venue: arXiv cs.CV 2016
Year: 2016

We propose a novel approach to template based face recognition. Our dual goal is to both increase recognition accuracy and reduce the computational and storage costs of template matching. To do this, we leverage on an approach which was proven effective in many other domains, but, to our knowledge, never fully explored for face images: average pooling of face photos. We show how (and why!) the space of a template's images can be partitioned and then pooled based on image quality and head pose and the effect this has on accuracy and template size. We perform extensive tests on the IJB-A and Janus CS2 template based face identification and verification benchmarks. These show that not only does our approach outperform published state of the art despite requiring far fewer cross template comparisons, but also, surprisingly, that image pooling performs on par with deep feature pooling.
Consensus and disagreement: the role of quantized behaviours in opinion dynamics
Venue: arXiv cs.SY 2016
Year: 2016

This paper deals with continuous-time opinion dynamics that feature the interplay of continuous opinions and discrete behaviours. In our model, the opinion of one individual is only influenced by the behaviours of fellow individuals. The key technical difficulty in the study of these dynamics is that the right-hand sides of the equations are discontinuous and thus their solutions must be intended in some generalized sense: in our analysis, we consider both Carathéodory and Krasowskii solutions. We first prove existence and completeness of Carathéodory solutions from every initial condition and we highlight a pathological behaviour of Carathéodory solutions, which can converge to points that are not (Carathéodory) equilibria. Notably, such points can be arbitrarily far from consensus and indeed simulations show that convergence to non-consensus configurations is very common. In order to cope with these pathological attractors, we then study Krasowskii solutions. We give an estimate of the asymptotic distance of all Krasowskii solutions from consensus and we prove its tightness via an example: this estimate is quadratic in the number of agents, implying that quantization can drastically destroy consensus. However, we are able to prove convergence to consensus in some special cases, namely when the communication among the individuals is described by either a complete or a complete bipartite graph.
The zero-error randomized query complexity of the pointer function
Venue: arXiv cs.CC 2016
Year: 2016

The pointer function of G{ö}{ö}s, Pitassi and Watson \cite{DBLP:journals/eccc/GoosP015a} and its variants have recently been used to prove separation results among various measures of complexity such as deterministic, randomized and quantum query complexities, exact and approximate polynomial degrees, etc. In particular, the widest possible (quadratic) separations between deterministic and zero-error randomized query complexity, as well as between bounded-error and zero-error randomized query complexity, have been obtained by considering {\em variants}~\cite{DBLP:journals/corr/AmbainisBBL15} of this pointer function. However, as was pointed out in \cite{DBLP:journals/corr/AmbainisBBL15}, the precise zero-error complexity of the original pointer function was not known. We show a lower bound of $\widetildeΩ(n^{3/4})$ on the zero-error randomized query complexity of the pointer function on $Θ(n \log n)$ bits; since an $\widetilde{O}(n^{3/4})$ upper bound is already known \cite{DBLP:conf/fsttcs/MukhopadhyayS15}, our lower bound is optimal up to a factor of $\polylog\, n$.
A Note on Nested String Replacements
Venue: arXiv cs.FL 2016
Year: 2016

We investigate the number of nested string replacements required to reduce a string of identical characters to one character.
Join-continuity + Hypercontinuity = Prime continuity
Venue: arXiv cs.LO 2016
Year: 2016

A remarkable result due to Kou, Liu & Luo states that the condition of continuity for a dcpo can be split into quasi-continuity and meet-continuity. Their argument contained a gap, however, which is probably why the authors of the monograph Continuous Lattices and Domains used a different (and fairly sophisticated) sequence of lemmas in order to establish the result. In this note we show that by considering the Stone dual, that is, the lattice of Scott-open subsets, a straightforward proof may be given. We do this by showing that a complete lattice is prime-continuous if and only if it is join-continuous and hypercontinuous. A pleasant side effect of this approach is that the characterisation of continuity by Kou, Liu & Luo also holds for posets, not just dcpos.
Downlink Power Control for Massive MIMO Cellular Systems with Optimal User Association
Venue: arXiv cs.IT 2016
Year: 2016

This paper aims to minimize the total transmit power consumption for Massive MIMO (multiple-input multiple-output) downlink cellular systems when each user is served by the optimized subset of the base stations (BSs). We derive a lower bound on the ergodic spectral efficiency (SE) for Rayleigh fading channels and maximum ratio transmission (MRT) when the BSs cooperate using non-coherent joint transmission. We solve the joint user association and downlink transmit power minimization problem optimally under fixed SE constraints. Furthermore, we solve a max-min fairness problem with user specific weights that maximizes the worst SE among the users. The optimal BS-user association rule is derived, which is different from maximum signal-to-noise-ratio (max-SNR) association. Simulation results manifest that the proposed methods can provide good SE for the users using less transmit power than in small-scale systems and that the optimal user association can effectively balance the load between BSs when needed.
Novel Performance Analysis of Network Coded Communications in Single-Relay Networks
Venue: arXiv cs.IT 2016
Year: 2016

In this paper, we analyze the performance of a single-relay network in which the reliability is provided by means of Random Linear Network Coding (RLNC). We consider a scenario when both source and relay nodes can encode packets. Unlike the traditional approach to relay networks, we introduce a passive relay mode, in which the relay node simply retransmits collected packets in case it cannot decode them. In contrast with the previous studies, we derive a novel theoretical framework for the performance characterization of the considered relay network. We extend our analysis to a more general scenario, in which coding coefficients are generated from non-binary fields. The theoretical results are verified using simulation, for both binary and non-binary fields. It is also shown that the passive relay mode significantly improves the performance compared with the active-only case, offering an up to two-fold gain in terms of the decoding probability. The proposed framework can be used as a building block for the analysis of more complex network topologies.