OpenRaiser/Intern-Atlas huggingface dataset:
Semi-supervised Fisher vector network
Venue: arXiv cs.CV 2018
Year: 2018

In this work we explore how the architecture proposed in [8], which expresses the processing steps of the classical Fisher vector pipeline approaches, i.e. dimensionality reduction by principal component analysis (PCA) projection, Gaussian mixture model (GMM) and Fisher vector descriptor extraction as network layers, can be modified into a hybrid network that combines the benefits of both unsupervised and supervised training methods, resulting in a model that learns a semi-supervised Fisher vector descriptor of the input data. We evaluate the proposed model at image classification and action recognition problems and show how the model's classification performance improves as the amount of unlabeled data increases during training.
Variable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source Coding
Venue: arXiv cs.IT 2018
Year: 2018

In the problem of variable-length $δ$-channel resolvability, the channel output is approximated by encoding a variable-length uniform random number under the constraint that the variational distance between the target and approximated distributions should be within a given constant $δ$ asymptotically. In this paper, we assume that the given channel input is a mixed source whose components may be general sources. To analyze the minimum achievable length rate of the uniform random number, called the $δ$-resolvability, we introduce a variant problem of the variable-length $δ$-channel resolvability. A general formula for the $δ$-resolvability in this variant problem is established for a general channel. When the channel is an identity mapping, it is shown that the $δ$-resolvability in the original and variant problems coincide. This relation leads to a direct derivation of a single-letter formula for the $δ$-resolvability when the given source is a mixed memoryless source. We extend the result to the second-order case. As a byproduct, we obtain the first-order and second-order formulas for fixed-to-variable length source coding allowing error probability up to $δ$.
Knowledge Organization Systems (KOS) in the Semantic Web: A Multi-Dimensional Review
Venue: arXiv cs.DL 2018
Year: 2018

Since the Simple Knowledge Organization System (SKOS) specification and its SKOS eXtension for Labels (SKOS-XL) became formal W3C recommendations in 2009 a significant number of conventional knowledge organization systems (KOS) (including thesauri, classification schemes, name authorities, and lists of codes and terms, produced before the arrival of the ontology-wave) have made their journeys to join the Semantic Web mainstream. This paper uses "LOD KOS" as an umbrella term to refer to all of the value vocabularies and lightweight ontologies within the Semantic Web framework. The paper provides an overview of what the LOD KOS movement has brought to various communities and users. These are not limited to the colonies of the value vocabulary constructors and providers, nor the catalogers and indexers who have a long history of applying the vocabularies to their products. The LOD dataset producers and LOD service providers, the information architects and interface designers, and researchers in sciences and humanities, are also direct beneficiaries of LOD KOS. The paper examines a set of the collected cases (experimental or in real applications) and aims to find the usages of LOD KOS in order to share the practices and ideas among communities and users. Through the viewpoints of a number of different user groups, the functions of LOD KOS are examined from multiple dimensions. This paper focuses on the LOD dataset producers, vocabulary producers, and researchers (as end-users of KOS).
Semantic integration of UML class diagram with semantic validation on segments of mappings
Venue: arXiv cs.SE 2018
Year: 2018

Recently, attention has focused on the software development, specially by differ-ent teams that are geographically distant to support collaborative work. Manage-ment, description and modeling in such collaborative approach are through sever-al tools and techniques based on UML models. It is now supported by a large number of tools. Most of these systems have the ability to compare different UML models, assist developers, designers and also provide operations for the merging and integration, to produce a coherent model. The contribution in this ar-ticle is both to integrate a set of UML class diagrams using mappings that are re-sult of alignment and assist designers and developers in the integration. In addi-tion, we will present a detail integration of UML models with the validation of mappings between them. Such validation helps to achieve correct, consistent and coherent integrated model.
Non-Parametric Transformation Networks
Venue: arXiv cs.CV 2018
Year: 2018

ConvNets, through their architecture, only enforce invariance to translation. In this paper, we introduce a new class of deep convolutional architectures called Non-Parametric Transformation Networks (NPTNs) which can learn \textit{general} invariances and symmetries directly from data. NPTNs are a natural generalization of ConvNets and can be optimized directly using gradient descent. Unlike almost all previous works in deep architectures, they make no assumption regarding the structure of the invariances present in the data and in that aspect are flexible and powerful. We also model ConvNets and NPTNs under a unified framework called Transformation Networks (TN), which yields a better understanding of the connection between the two. We demonstrate the efficacy of NPTNs on data such as MNIST with extreme transformations and CIFAR10 where they outperform baselines, and further outperform several recent algorithms on ETH-80. They do so while having the same number of parameters. We also show that they are more effective than ConvNets in modelling symmetries and invariances from data, without the explicit knowledge of the added arbitrary nuisance transformations. Finally, we replace ConvNets with NPTNs within Capsule Networks and show that this enables Capsule Nets to perform even better.
Shrink or Substitute: Handling Process Failures in HPC Systems using In-situ Recovery
Venue: arXiv cs.DC 2018
Year: 2018

Efficient utilization of today's high-performance computing (HPC) systems with complex hardware and software components requires that the HPC applications are designed to tolerate process failures at runtime. With low mean time to failure (MTTF) of current and future HPC systems, long running simulations on these systems require capabilities for gracefully handling process failures by the applications themselves. In this paper, we explore the use of fault tolerance extensions to Message Passing Interface (MPI) called user-level failure mitigation (ULFM) for handling process failures without the need to discard the progress made by the application. We explore two alternative recovery strategies, which use ULFM along with application-driven in-memory checkpointing. In the first case, the application is recovered with only the surviving processes, and in the second case, spares are used to replace the failed processes, such that the original configuration of the application is restored. Our experimental results demonstrate that graceful degradation is a viable alternative for recovery in environments where spares may not be available.
Compressed Neighbour Discovery using Sparse Kerdock Matrices
Venue: arXiv cs.IT 2018
Year: 2018

We study the network-wide neighbour discovery problem in wireless networks in which each node in a network must discovery the network interface addresses (NIAs) of its neighbours. We work within the rapid on-off division duplex framework proposed by Guo and Zhang (2010) in which all nodes are assigned different on-off signatures which allow them listen to the transmissions of neighbouring nodes during their off slots, leading to a compressed sensing problem at each node with a collapsed codebook determined by a given node's transmission signature. We propose sparse Kerdock matrices as codebooks for the neighbour discovery problem. These matrices share the same row space as certain Delsarte-Goethals frames based upon Reed Muller codes, whilst at the same time being extremely sparse. We present numerical experiments using two different compressed sensing recovery algorithms, One Step Thresholding (OST) and Normalised Iterative Hard Thresholding (NIHT). For both algorithms, a higher proportion of neighbours are successfully identified using sparse Kerdock matrices compared to codebooks based on Reed Muller codes with random erasures as proposed by Zhang and Guo (2011). We argue that the improvement is due to the better interference cancellation properties of sparse Kerdock matrices when collapsed according to a given node's transmission signature. We show by explicit calculation that the coherence of the collapsed codebooks resulting from sparse Kerdock matrices remains near-optimal.
Frame Moments and Welch Bound with Erasures
Venue: arXiv cs.IT 2018
Year: 2018

The Welch Bound is a lower bound on the root mean square cross correlation between $n$ unit-norm vectors $f_1,...,f_n$ in the $m$ dimensional space ($\mathbb{R} ^m$ or $\mathbb{C} ^m$), for $n\geq m$. Letting $F = [f_1|...|f_n]$ denote the $m$-by-$n$ frame matrix, the Welch bound can be viewed as a lower bound on the second moment of $F$, namely on the trace of the squared Gram matrix $(F'F)^2$. We consider an erasure setting, in which a reduced frame, composed of a random subset of Bernoulli selected vectors, is of interest. We extend the Welch bound to this setting and present the {\em erasure Welch bound} on the expected value of the Gram matrix of the reduced frame. Interestingly, this bound generalizes to the $d$-th order moment of $F$. We provide simple, explicit formulae for the generalized bound for $d=2,3,4$, which is the sum of the $d$-th moment of Wachter's classical MANOVA distribution and a vanishing term (as $n$ goes to infinity with $\frac{m}{n}$ held constant). The bound holds with equality if (and for $d = 4$ only if) $F$ is an Equiangular Tight Frame (ETF). Our results offer a novel perspective on the superiority of ETFs over other frames in a variety of applications, including spread spectrum communications, compressed sensing and analog coding.
DCDistance: A Supervised Text Document Feature extraction based on class labels
Venue: arXiv cs.IR 2018
Year: 2018

Text Mining is a field that aims at extracting information from textual data. One of the challenges of such field of study comes from the pre-processing stage in which a vector (and structured) representation should be extracted from unstructured data. The common extraction creates large and sparse vectors representing the importance of each term to a document. As such, this usually leads to the curse-of-dimensionality that plagues most machine learning algorithms. To cope with this issue, in this paper we propose a new supervised feature extraction and reduction algorithm, named DCDistance, that creates features based on the distance between a document to a representative of each class label. As such, the proposed technique can reduce the features set in more than 99% of the original set. Additionally, this algorithm was also capable of improving the classification accuracy over a set of benchmark datasets when compared to traditional and state-of-the-art features selection algorithms.
Shai: Enforcing Data-Specific Policies with Near-Zero Runtime Overhead
Venue: arXiv cs.CR 2018
Year: 2018

Data retrieval systems such as online search engines and online social networks must comply with the privacy policies of personal and selectively shared data items, regulatory policies regarding data retention and censorship, and the provider's own policies regarding data use. Enforcing these policies is difficult and error-prone. Systematic techniques to enforce policies are either limited to type-based policies that apply uniformly to all data of the same type, or incur significant runtime overhead. This paper presents Shai, the first system that systematically enforces data-specific policies with near-zero overhead in the common case. Shai's key idea is to push as many policy checks as possible to an offline, ahead-of-time analysis phase, often relying on predicted values of runtime parameters such as the state of access control lists or connected users' attributes. Runtime interception is used sparingly, only to verify these predictions and to make any remaining policy checks. Our prototype implementation relies on efficient, modern OS primitives for sandboxing and isolation. We present the design of Shai and quantify its overheads on an experimental data indexing and search pipeline based on the popular search engine Apache Lucene.
On Identifying a Massive Number of Distributions
Venue: arXiv cs.IT 2018
Year: 2018

Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of observed sequences, are let to grow with the observation blocklength $n$. Asymptotically matching upper and lower bounds on the probability of error are derived.
Hyperspectral recovery from RGB images using Gaussian Processes
Venue: arXiv cs.CV 2018
Year: 2018

We propose to recover spectral details from RGB images of known spectral quantization by modeling natural spectra under Gaussian Processes and combining them with the RGB images. Our technique exploits Process Kernels to model the relative smoothness of reflectance spectra, and encourages non-negativity in the resulting signals for better estimation of the reflectance values. The Gaussian Processes are inferred in sets using clusters of spatio-spectrally correlated hyperspectral training patches. Each set is transformed to match the spectral quantization of the test RGB image. We extract overlapping patches from the RGB image and match them to the hyperspectral training patches by spectrally transforming the latter. The RGB patches are encoded over the transformed Gaussian Processes related to those hyperspectral patches and the resulting image is constructed by combining the codes with the original Processes. Our approach infers the desired Gaussian Processes under a fully Bayesian model inspired by Beta-Bernoulli Process, for which we also present the inference procedure. A thorough evaluation using three hyperspectral datasets demonstrates the effective extraction of spectral details from RGB images by the proposed technique.
Information Geometric Approach to Bayesian Lower Error Bounds
Venue: arXiv cs.IT 2018
Year: 2018

Information geometry describes a framework where probability densities can be viewed as differential geometry structures. This approach has shown that the geometry in the space of probability distributions that are parameterized by their covariance matrix is linked to the fundamentals concepts of estimation theory. In particular, prior work proposes a Riemannian metric - the distance between the parameterized probability distributions - that is equivalent to the Fisher Information Matrix, and helpful in obtaining the deterministic Cramér-Rao lower bound (CRLB). Recent work in this framework has led to establishing links with several practical applications. However, classical CRLB is useful only for unbiased estimators and inaccurately predicts the mean square error in low signal-to-noise (SNR) scenarios. In this paper, we propose a general Riemannian metric that, at once, is used to obtain both Bayesian CRLB and deterministic CRLB along with their vector parameter extensions. We also extend our results to the Barankin bound, thereby enhancing their applicability to low SNR situations.
Hierarchical Coding for Distributed Computing
Venue: arXiv cs.DC 2018
Year: 2018

Coding for distributed computing supports low-latency computation by relieving the burden of straggling workers. While most existing works assume a simple master-worker model, we consider a hierarchical computational structure consisting of groups of workers, motivated by the need to reflect the architectures of real-world distributed computing systems. In this work, we propose a hierarchical coding scheme for this model, as well as analyze its decoding cost and expected computation time. Specifically, we first provide upper and lower bounds on the expected computing time of the proposed scheme. We also show that our scheme enables efficient parallel decoding, thus reducing decoding costs by orders of magnitude over non-hierarchical schemes. When considering both decoding cost and computing time, the proposed hierarchical coding is shown to outperform existing schemes in many practical scenarios.
Approximating the Incremental Knapsack Problem
Venue: arXiv cs.DS 2018
Year: 2018

We consider the 0-1 Incremental Knapsack Problem (IKP) where the capacity grows over time periods and if an item is placed in the knapsack in a certain period, it cannot be removed afterwards. The contribution of a packed item in each time period depends on its profit as well as on a time factor which reflects the importance of the period in the objective function. The problem calls for maximizing the weighted sum of the profits over the whole time horizon. In this work, we provide approximation results for IKP and its restricted variants. In some results, we rely on Linear Programming (LP) to derive approximation bounds and show how the proposed LP-based analysis can be seen as a valid alternative to more formal proof systems. We first manage to prove the tightness of some approximation ratios of a general purpose algorithm currently available in the literature and originally applied to a time-invariant version of the problem. We also devise a Polynomial Time Approximation Scheme (PTAS) when the input value indicating the number of periods is considered as a constant. Then, we add the mild and natural assumption that each item can be packed in the first time period. For this variant, we discuss different approximation algorithms suited for any number of time periods and for the special case with two periods.
Uncertainty Quantification For A Permanent Magnet Synchronous Machine With Dynamic Rotor Eccentricity
Venue: arXiv cs.CE 2018
Year: 2018

The influence of dynamic eccentricity on the harmonic spectrum of the torque of a permanent magnet synchronous machine is studied. The spectrum is calculated by an energy balance method. Uncertainty quantification is applied by using generalized Polynomial Chaos and Monte Carlo. It is found that the displacement of the rotor impacts the spectrum of the torque the most.
Mixing Time for Square Tilings
Venue: arXiv cs.DM 2018
Year: 2018

We consider tilings of $\mathbb{Z}^2$ by two types of squares. We are interested in the rate of convergence to the stationarity of a natural Markov chain defined for square tilings. The rate of convergence can be represented by the mixing time which measures the amount of time it takes the chain to be close to its stationary distribution. We prove polynomial mixing time for $n \times \log n $ regions in the case of tilings by $1 \times 1$ and $s \times s$ squares. We also consider a weighted Markov chain with weights $λ$ being put on big squares. We show rapid mixing of $O(n^4 \log n)$ with conditions on $λ$. We provide simulations that suggest different conjectures, one of which is the existence of frozen regions in random tilings by squares.
Debugging Static Analysis
Venue: arXiv cs.SE 2018
Year: 2018

To detect and fix bugs and security vulnerabilities, software companies use static analysis as part of the development process. However, static analysis code itself is also prone to bugs. To ensure a consistent level of precision, as analyzed programs grow more complex, a static analysis has to handle more code constructs, frameworks, and libraries that the programs use. While more complex analyses are written and used in production systems every day, the cost of debugging and fixing them also increases tremendously. To better understand the difficulties of debugging static analyses, we surveyed 115 static analysis writers. From their responses, we extracted the core requirements to build a debugger for static analysis, which revolve around two main issues: (1) abstracting from two code bases at the same time (the analysis code and the analyzed code) and (2) tracking the analysis internal state throughout both code bases. Most current debugging tools that our survey participants use lack the capabilities to address both issues. Focusing on those requirements, we introduce VisuFlow, a debugging environment for static data-flow analysis that is integrated in the Eclipse development environment. VisuFlow features graph visualizations that enable users to view the state of a data-flow analysis and its intermediate results at any time. Special breakpoints in VisuFlow help users step through the analysis code and the analyzed simultaneously. To evaluate the usefulness of VisuFlow, we have conducted a user study on 20 static analysis writers. Using VisuFlow helped our sample of analysis writers identify 25% and fix 50% more errors in the analysis code compared to using the standard Eclipse debugging environment.
What Level of Quality can Neural Machine Translation Attain on Literary Text?
Venue: arXiv cs.CL 2018
Year: 2018

Given the rise of a new approach to MT, Neural MT (NMT), and its promising performance on different text types, we assess the translation quality it can attain on what is perceived to be the greatest challenge for MT: literary text. Specifically, we target novels, arguably the most popular type of literary text. We build a literary-adapted NMT system for the English-to-Catalan translation direction and evaluate it against a system pertaining to the previous dominant paradigm in MT: statistical phrase-based MT (PBSMT). To this end, for the first time we train MT systems, both NMT and PBSMT, on large amounts of literary text (over 100 million words) and evaluate them on a set of twelve widely known novels spanning from the the 1920s to the present day. According to the BLEU automatic evaluation metric, NMT is significantly better than PBSMT (p < 0.01) on all the novels considered. Overall, NMT results in a 11% relative improvement (3 points absolute) over PBSMT. A complementary human evaluation on three of the books shows that between 17% and 34% of the translations, depending on the book, produced by NMT (versus 8% and 20% with PBSMT) are perceived by native speakers of the target language to be of equivalent quality to translations produced by a professional human translator.
The Future is Unlicensed: Coexistence in the Unlicensed Spectrum for 5G
Venue: arXiv cs.NI 2018
Year: 2018

5G has to fulfill the requirements of ultra-dense, scalable, and customizable networks such as IoT while increasing spectrum and energy efficiency. Given the diversity of envisaged applications and scenarios, one crucial property for 5G New Radio (NR) is flexibility: flexible UL/DL allocation, bandwidths, or scalable transmission time interval, and most importantly operation at different frequency bands. In particular, 5G should exploit the spectral opportunities in the unlicensed spectrum for expanding network capacity when and where needed. However, unlicensed bands pose the challenge of "coexisting networks", which mostly lack the means of communication for negotiation and coordination. This deficiency is further exacerbated by the heterogeneity, massive connectivity, and ubiquity of IoT systems and applications. Therefore, 5G needs to provide mechanisms to coexist and even converge in the unlicensed bands. In that regard, WiFi, as the most prominent wireless technology in the unlicensed bands, is both a key enabler for boosting 5G capacity and competitor of 5G cellular networks for the shared unlicensed spectrum. In this work, we describe spectrum sharing in 5G and present key coexistence solutions, mostly in the context of WiFi. We also highlight the role of machine learning which is envisaged to be critical for reaching coexistence and convergence goals by providing the necessary intelligence and adaptation mechanisms.