OpenRaiser/Intern-Atlas huggingface dataset:
On Quantum Codes Obtained From Cyclic Codes Over $\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$
Venue: arXiv cs.IT 2016
Year: 2016

Let $R=\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$ be a non-chain finite commutative ring, where $u^3=u$. In this paper, we mainly study the construction of quantum codes from cyclic codes over $R$. We obtained self-orthogonal codes over $\mathbb{F}_2$ as gray images of linear and cyclic codes over $R$. The parameters of quantum codes which are obtained from cyclic code over $R$ are discussed.
Almost universal codes for fading wiretap channels
Venue: arXiv cs.IT 2016
Year: 2016

We consider a fading wiretap channel model where the transmitter has only statistical channel state information, and the legitimate receiver and eavesdropper have perfect channel state information. We propose a sequence of non-random lattice codes which achieve strong secrecy and semantic security over ergodic fading channels. The construction is almost universal in the sense that it achieves the same constant gap to secrecy capacity over Gaussian and ergodic fading models.
Git4Voc: Git-based Versioning for Collaborative Vocabulary Development
Venue: arXiv cs.AI 2016
Year: 2016

Collaborative vocabulary development in the context of data integration is the process of finding consensus between the experts of the different systems and domains. The complexity of this process is increased with the number of involved people, the variety of the systems to be integrated and the dynamics of their domain. In this paper we advocate that the realization of a powerful version control system is the heart of the problem. Driven by this idea and the success of Git in the context of software development, we investigate the applicability of Git for collaborative vocabulary development. Even though vocabulary development and software development have much more similarities than differences there are still important differences. These need to be considered within the development of a successful versioning and collaboration system for vocabulary development. Therefore, this paper starts by presenting the challenges we were faced with during the creation of vocabularies collaboratively and discusses its distinction to software development. Based on these insights we propose Git4Voc which comprises guidelines how Git can be adopted to vocabulary development. Finally, we demonstrate how Git hooks can be implemented to go beyond the plain functionality of Git by realizing vocabulary-specific features like syntactic validation and semantic diffs.
JikesRVM: Internal Mechanisms Study and Garbage Collection with MMTk
Venue: arXiv cs.PL 2016
Year: 2016

High Level Language Virtual Machines is a core topic of interest for the researchers who are into virtual execution environments. As an open source virtual machine released to 16 universities, as early as 2001, Jikes RVM has been a major drive for many researches. While working on this project, we studied the JIT compilation of Jikes RVM as well as the Garbage Collection (GC) which is handled by the Memory Management Toolkit (MMTk), a part of the Jikes RVM. We also studied the Compressor Mark-Compact Collector algorithm and implemented it for MMTk. We have also implemented a micro-benchmark for the GC algorithms in Java, named "XPDBench", for benchmarking the implementations.
Evaluating the Performance of a Speech Recognition based System
Venue: arXiv cs.CL 2016
Year: 2016

Speech based solutions have taken center stage with growth in the services industry where there is a need to cater to a very large number of people from all strata of the society. While natural language speech interfaces are the talk in the research community, yet in practice, menu based speech solutions thrive. Typically in a menu based speech solution the user is required to respond by speaking from a closed set of words when prompted by the system. A sequence of human speech response to the IVR prompts results in the completion of a transaction. A transaction is deemed successful if the speech solution can correctly recognize all the spoken utterances of the user whenever prompted by the system. The usual mechanism to evaluate the performance of a speech solution is to do an extensive test of the system by putting it to actual people use and then evaluating the performance by analyzing the logs for successful transactions. This kind of evaluation could lead to dissatisfied test users especially if the performance of the system were to result in a poor transaction completion rate. To negate this the Wizard of Oz approach is adopted during evaluation of a speech system. Overall this kind of evaluations is an expensive proposition both in terms of time and cost. In this paper, we propose a method to evaluate the performance of a speech solution without actually putting it to people use. We first describe the methodology and then show experimentally that this can be used to identify the performance bottlenecks of the speech solution even before the system is actually used thus saving evaluation time and expenses.
Automatic Determination of Chord Roots
Venue: arXiv cs.SD 2016
Year: 2016

Even though chord roots constitute a fundamental concept in music theory, existing models do not explain and determine them to full satisfaction. We present a new method which takes sequential context into account to resolve ambiguities and detect nonharmonic tones. We extract features from chord pairs and use a decision tree to determine chord roots. This leads to a quantitative improvement in correctness of the predicted roots in comparison to other models. All this raises the question how much harmonic and nonharmonic tones actually contribute to the perception of chord roots.
How to Use Temporal-Driven Constrained Clustering to Detect Typical Evolutions
Venue: arXiv cs.LG 2016
Year: 2016

In this paper, we propose a new time-aware dissimilarity measure that takes into account the temporal dimension. Observations that are close in the description space, but distant in time are considered as dissimilar. We also propose a method to enforce the segmentation contiguity, by introducing, in the objective function, a penalty term inspired from the Normal Distribution Function. We combine the two propositions into a novel time-driven constrained clustering algorithm, called TDCK-Means, which creates a partition of coherent clusters, both in the multidimensional space and in the temporal space. This algorithm uses soft semi-supervised constraints, to encourage adjacent observations belonging to the same entity to be assigned to the same cluster. We apply our algorithm to a Political Studies dataset in order to detect typical evolution phases. We adapt the Shannon entropy in order to measure the entity contiguity, and we show that our proposition consistently improves temporal cohesion of clusters, without any significant loss in the multidimensional variance.
3D Gaze Estimation from 2D Pupil Positions on Monocular Head-Mounted Eye Trackers
Venue: arXiv cs.HC 2016
Year: 2016

3D gaze information is important for scene-centric attention analysis but accurate estimation and analysis of 3D gaze in real-world environments remains challenging. We present a novel 3D gaze estimation method for monocular head-mounted eye trackers. In contrast to previous work, our method does not aim to infer 3D eyeball poses but directly maps 2D pupil positions to 3D gaze directions in scene camera coordinate space. We first provide a detailed discussion of the 3D gaze estimation task and summarize different methods, including our own. We then evaluate the performance of different 3D gaze estimation approaches using both simulated and real data. Through experimental validation, we demonstrate the effectiveness of our method in reducing parallax error, and we identify research challenges for the design of 3D calibration procedures.
A hybrid multi-time-step framework for pore-scale and continuum-scale modeling of solute transport in porous media
Venue: arXiv cs.CE 2016
Year: 2016

In this paper, we propose a computational framework,which is based on a domain decomposition technique, to employ both finite element method (which is a popular continuum modeling approach) and lattice Boltzmann method (which is a popular pore-scale modeling approach) in the same computational domain. To bridge the gap across the disparate length and time-scales, we first propose a new method to enforce continuum-scale boundary conditions (i.e., Dirichlet and Neumann boundary conditions) onto the numerical solution from the lattice Boltzmann method. This method are based on maximization of entropy and preserve the non-negativity of discrete distributions under the lattice Boltzmann method. The proposed computational framework allows different grid sizes, orders of interpolation, and time-steps in different subdomains. This allows for different desired resolutions in the numerical solution in different subdomains. Through numerical experiments, the effect of grid and time-step refinement, disparity of time-steps in different subdomains, domain partitioning, and the number of iteration steps on the accuracy and rate of convergence of the proposed methodology are studied. Finally, to showcase the performance of this framework in porous media applications, we use it to simulate the dissolution of calcium carbonate in a porous structure.
Framework for Electroencephalography-based Evaluation of User Experience
Venue: arXiv cs.HC 2016
Year: 2016

Measuring brain activity with electroencephalography (EEG) is mature enough to assess mental states. Combined with existing methods, such tool can be used to strengthen the understanding of user experience. We contribute a set of methods to estimate continuously the user's mental workload, attention and recognition of interaction errors during different interaction tasks. We validate these measures on a controlled virtual environment and show how they can be used to compare different interaction techniques or devices, by comparing here a keyboard and a touch-based interface. Thanks to such a framework, EEG becomes a promising method to improve the overall usability of complex computer systems.
Towards Declarative Safety Rules for Perception Specification Architectures
Venue: arXiv cs.RO 2016
Year: 2016

Agriculture has a high number of fatalities compared to other blue collar fields, additionally population decreasing in rural areas is resulting in decreased work force. These issues have resulted in increased focus on improving efficiency of and introducing autonomy in agriculture. Field robots are an increasingly promising branch of robotics targeted at full automation in agriculture. The safety aspect however is rely addressed in connection with safety standards, which limits the real-world applicability. In this paper we present an analysis of a vision pipeline in connection with functional-safety standards, in order to propose solutions for how to ascertain that the system operates as required. Based on the analysis we demonstrate a simple mechanism for verifying that a vision pipeline is functioning correctly, thus improving the safety in the overall system.
Deep Neural Networks predict Hierarchical Spatio-temporal Cortical Dynamics of Human Visual Object Recognition
Venue: arXiv cs.CV 2016
Year: 2016

The complex multi-stage architecture of cortical visual pathways provides the neural basis for efficient visual object recognition in humans. However, the stage-wise computations therein remain poorly understood. Here, we compared temporal (magnetoencephalography) and spatial (functional MRI) visual brain representations with representations in an artificial deep neural network (DNN) tuned to the statistics of real-world visual recognition. We showed that the DNN captured the stages of human visual processing in both time and space from early visual areas towards the dorsal and ventral streams. Further investigation of crucial DNN parameters revealed that while model architecture was important, training on real-world categorization was necessary to enforce spatio-temporal hierarchical relationships with the brain. Together our results provide an algorithmically informed view on the spatio-temporal dynamics of visual object recognition in the human visual brain.
Online Algorithms for Information Aggregation from Distributed and Correlated Sources
Venue: arXiv cs.NI 2016
Year: 2016

There is a fundamental trade-off between the communication cost and latency in information aggregation. Aggregating multiple communication messages over time can alleviate overhead and improve energy efficiency on one hand, but inevitably incurs information delay on the other hand. In the presence of uncertain future inputs, this trade-off should be balanced in an online manner, which is studied by the classical dynamic TCP ACK problem for a single information source. In this paper, we extend dynamic TCP ACK problem to a general setting of collecting aggregate information from distributed and correlated information sources. In this model, distributed sources observe correlated events, whereas only a small number of reports are required from the sources. The sources make online decisions about their reporting operations in a distributed manner without prior knowledge of the local observations at others. Our problem captures a wide range of applications, such as in-situ sensing, anycast acknowledgement and distributed caching. We present simple threshold-based competitive distributed online algorithms under different settings of intercommunication. Our algorithms match the theoretical lower bounds in order of magnitude. We observe that our algorithms can produce satisfactory performance in simulations and practical testbed.
Complexity of ITL model checking: some well-behaved fragments of the interval logic HS
Venue: arXiv cs.LO 2016
Year: 2016

Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases. Most of the proposed solutions make use of classical, point-based temporal logics, while little work has been done in the interval temporal logic setting. Recently, a non-elementary model checking algorithm for Halpern and Shoham's modal logic of time intervals HS over finite Kripke structures (under the homogeneity assumption) and an EXPSPACE model checking procedure for two meaningful fragments of it have been proposed. In this paper, we show that more efficient model checking procedures can be developed for some expressive enough fragments of HS.
Your Activities of Daily Living (YADL): An Image-based Survey Technique for Patients with Arthritis
Venue: arXiv cs.CY 2016
Year: 2016

Healthcare professionals use Activities of Daily Living (ADL) to characterize a patient's functional status and to evaluate the effectiveness of treatment plans. ADLs are traditionally measured using standardized text-based questionnaires and the only form of personalization is in the form of question branching logic. Pervasive smartphone adoption makes it feasible to consider more frequent patient-reporting on ADLs. However, asking generic sets of questions repeatedly introduces user burden and fatigue that threatens to interfere with their utility. We introduce an approach called YADL (Your Activities of Daily Living) which uses images of ADLs and personalization to improve survey efficiency and the patient-experience. It offers several potential benefits: wider coverage of ADLs, improved engagement, and accurate capture of individual health situations. In this paper, we discuss our system design and the wide applicability of the design process for survey tools in healthcare and beyond. Interactions with with a small number of patients with Arthritis throughout the design process have been promising and we share detailed insights.
Additive Approximation Algorithms for Modularity Maximization
Venue: arXiv cs.SI 2016
Year: 2016

The modularity is a quality function in community detection, which was introduced by Newman and Girvan (2004). Community detection in graphs is now often conducted through modularity maximization: given an undirected graph $G=(V,E)$, we are asked to find a partition $\mathcal{C}$ of $V$ that maximizes the modularity. Although numerous algorithms have been developed to date, most of them have no theoretical approximation guarantee. Recently, to overcome this issue, the design of modularity maximization algorithms with provable approximation guarantees has attracted significant attention in the computer science community. In this study, we further investigate the approximability of modularity maximization. More specifically, we propose a polynomial-time $\left(\cos\left(\frac{3-\sqrt{5}}{4}π\right) - \frac{1+\sqrt{5}}{8}\right)$-additive approximation algorithm for the modularity maximization problem. Note here that $\cos\left(\frac{3-\sqrt{5}}{4}π\right) - \frac{1+\sqrt{5}}{8} < 0.42084$ holds. This improves the current best additive approximation error of $0.4672$, which was recently provided by Dinh, Li, and Thai (2015). Interestingly, our analysis also demonstrates that the proposed algorithm obtains a nearly-optimal solution for any instance with a very high modularity value. Moreover, we propose a polynomial-time $0.16598$-additive approximation algorithm for the maximum modularity cut problem. It should be noted that this is the first non-trivial approximability result for the problem. Finally, we demonstrate that our approximation algorithm can be extended to some related problems.
Implicit Distortion and Fertility Models for Attention-based Encoder-Decoder NMT Model
Venue: arXiv cs.CL 2016
Year: 2016

Neural machine translation has shown very promising results lately. Most NMT models follow the encoder-decoder framework. To make encoder-decoder models more flexible, attention mechanism was introduced to machine translation and also other tasks like speech recognition and image captioning. We observe that the quality of translation by attention-based encoder-decoder can be significantly damaged when the alignment is incorrect. We attribute these problems to the lack of distortion and fertility models. Aiming to resolve these problems, we propose new variations of attention-based encoder-decoder and compare them with other models on machine translation. Our proposed method achieved an improvement of 2 BLEU points over the original attention-based encoder-decoder.
Network Functions Virtualization Architecture for Gateways for Virtualized Wireless Sensor and Actuator Networks
Venue: arXiv cs.NI 2016
Year: 2016

Virtualization enables multiple applications to share the same wireless sensor and actuator network (WSAN). However, in heterogeneous environments, virtualized wireless sensor and actuator networks (VWSAN) raise new challenges, such as the need for on-the-fly, dynamic, elastic, and scalable provisioning of gateways. Network Functions Virtualization (NFV) is a paradigm emerging to help tackle these new challenges. It leverages standard virtualization technology to consolidate special-purpose network elements on commodity hardware. This article presents NFV architecture for VWSAN gateways, in which software instances of gateway modules are hosted in NFV infrastructure operated and managed by a VWSAN gateway provider. We consider several VWSAN providers, each with its own brand or combination of brands of sensors and actuators/robots. These sensors and actuators can be accessed by a variety of applications, each may have different interface and QoS (i.e., latency, throughput, etc.) requirements. The NFV infrastructure allows dynamic, elastic, and scalable deployment of gateway modules in this heterogeneous VWSAN environment. Furthermore, the proposed architecture is flexible enough to easily allow new sensors and actuators integration and new application domains accommodation. We present a prototype that is built using the OpenStack platform. Besides, the performance results are discussed
On the Exact Distribution of Mutual Information of Two-user MIMO MAC Based on Quotient Distribution of Wishart Matrices
Venue: arXiv cs.IT 2016
Year: 2016

We propose the exact calculation of the probability density function (PDF) and cumulative distribution function (CDF) of mutual information (MI) for a two-user MIMO MAC network over block Rayleigh fading channels. So far the PDF and CDF have been numerically evaluated since MI depends on the quotient of two Wishart matrices, and no closed-form for this quotient was available. We derive exact results for the PDF and CDF of extreme (the smallest/the largest) eigenvalues. Based on the results of quotient ensemble the exact calculation for PDF and CDF of mutual information is presented via Laplace transform approach and by direct integration of joint PDF of quotient ensemble's eigenvalues. Furthermore, our derivations also provide the parameters to apply the Gaussian approximation method, which is comparatively easier to implement. We show that approximation matches the exact results remarkably well for outage probability, i.e. CDF, above 10%. However, the approximation could also be used for 1% outage probability with a relatively small error. We apply the derived expressions to analyze the effects of adding receiving antennas on the receiver's performance. By supposing no channel knowledge at transmitters and successive decoding at receiver, the capacity of the first user increases and outage probability decreases with extra antennas, as expected.
The Austrian eID Ecosystem in the Public Cloud: How to Obtain Privacy While Preserving Practicality
Venue: arXiv cs.CR 2016
Year: 2016

The Austrian eID system constitutes a main pillar within the Austrian e-Government strategy. The eID system ensures unique identification and secure authentication for citizens protecting access to applications where sensitive and personal data is involved. In particular, the Austrian eID system supports three main use cases: Identification and authentication of Austrian citizens, electronic representation, and foreign citizen authentication at Austrian public sector applications. For supporting all these use cases, several components -- either locally deployed in the applications' domain or centrally deployed -- need to communicate with each other. While local deployments have some advantages in terms of scalability, still a central deployment of all involved components would be advantageous, e.g. due to less maintenance efforts. However, a central deployment can easily lead to load bottlenecks because theoretically the whole Austrian population as well as -- for foreign citizens -- the whole EU population could use the provided services. To mitigate the issue on scalability, in this paper we propose the migration of main components of the ecosystem into a public cloud. However, a move of trusted services into a public cloud brings up new obstacles, particular with respect to privacy. To bypass the issue on privacy, in this paper we propose an approach on how the complete Austrian eID ecosystem can be moved into a public cloud in a privacy-preserving manner by applying selected cryptographic technologies (in particular using proxy re-encryption and redactable signatures). Applying this approach, no sensitive data will be disclosed to a public cloud provider by still supporting all three main eID system use cases. We finally discuss our approach based on selected criteria.