OpenRaiser/Intern-Atlas huggingface dataset:
eSCAPE: a Large-scale Synthetic Corpus for Automatic Post-Editing
Venue: arXiv cs.CL 2018
Year: 2018

Training models for the automatic correction of machine-translated text usually relies on data consisting of (source, MT, human post- edit) triplets providing, for each source sentence, examples of translation errors with the corresponding corrections made by a human post-editor. Ideally, a large amount of data of this kind should allow the model to learn reliable correction patterns and effectively apply them at test stage on unseen (source, MT) pairs. In practice, however, their limited availability calls for solutions that also integrate in the training process other sources of knowledge. Along this direction, state-of-the-art results have been recently achieved by systems that, in addition to a limited amount of available training data, exploit artificial corpora that approximate elements of the "gold" training instances with automatic translations. Following this idea, we present eSCAPE, the largest freely-available Synthetic Corpus for Automatic Post-Editing released so far. eSCAPE consists of millions of entries in which the MT element of the training triplets has been obtained by translating the source side of publicly-available parallel corpora, and using the target side as an artificial human post-edit. Translations are obtained both with phrase-based and neural models. For each MT paradigm, eSCAPE contains 7.2 million triplets for English-German and 3.3 millions for English-Italian, resulting in a total of 14,4 and 6,6 million instances respectively. The usefulness of eSCAPE is proved through experiments in a general-domain scenario, the most challenging one for automatic post-editing. For both language directions, the models trained on our artificial data always improve MT quality with statistically significant gains. The current version of eSCAPE can be freely downloaded from: http://hltshare.fbk.eu/QT21/eSCAPE.html.
Segmentation of histological images and fibrosis identification with a convolutional neural network
Venue: arXiv cs.CV 2018
Year: 2018

Segmentation of histological images is one of the most crucial tasks for many biomedical analyses including quantification of certain tissue type. However, challenges are posed by high variability and complexity of structural features in such images, in addition to imaging artifacts. Further, the conventional approach of manual thresholding is labor-intensive, and highly sensitive to inter- and intra-image intensity variations. An accurate and robust automated segmentation method is of high interest. We propose and evaluate an elegant convolutional neural network (CNN) designed for segmentation of histological images, particularly those with Masson's trichrome stain. The network comprises of 11 successive convolutional - rectified linear unit - batch normalization layers, and outperformed state-of-the-art CNNs on a dataset of cardiac histological images (labeling fibrosis, myocytes, and background) with a Dice similarity coefficient of 0.947. With 100 times fewer (only 300 thousand) trainable parameters, our CNN is less susceptible to overfitting, and is efficient. Additionally, it retains image resolution from input to output, captures fine-grained details, and can be trained end-to-end smoothly. To the best of our knowledge, this is the first deep CNN tailored for the problem of concern, and may be extended to solve similar segmentation tasks to facilitate investigations into pathology and clinical treatment.
End-to-end 5G services via an SDN/NFV-based multi-tenant network and cloud testbed
Venue: arXiv cs.NI 2018
Year: 2018

5G has a main requirement of highly flexible, ultralow latency and ultra-high bandwidth virtualized infrastructure in order to deliver end-to-end services. This requirement can be met by efficiently integrating all network segments (radio access, aggregation and core) with heterogeneous wireless and optical technologies (5G, mmWave, LTE/LTE-A, Wi-Fi, Ethernet, MPLS, WDM, software-defined optical transmission, etc.), and massive computing and storage cloud services (offered in edge/core data centers). This paper introduces the preliminary architecture aiming at integrating three consolidated and standalone experimental infrastructures at CTTC, in order to deploy the required end-to-end top-to-bottom converged infrastructure pointed out above for testing and developing advanced 5G services.
Weighted Null-Space Fitting for Identification of Cascade Networks
Venue: arXiv cs.SY 2018
Year: 2018

For identification of systems embedded in dynamic networks, applying the prediction error method (PEM) to a correct tailor-made parametrization of the complete network provided asymptotically efficient estimates. However, the network complexity often hinders a successful application of PEM, which requires minimizing a non-convex cost function that in general becomes more difficult for more complex networks. For this reason, identification in dynamic networks often focuses in obtaining consistent estimates of particular network modules of interest. A downside of such approaches is that splitting the network in several modules for identification often costs asymptotic efficiency. In this paper, we consider the particular case of a dynamic network with the individual systems connected in a serial cascaded manner, with measurements affected by sensor noise. We propose an algorithm that estimates all the modules in the network simultaneously without requiring the minimization of a non-convex cost function. This algorithm is an extension of Weighted Null-Space Fitting (WNSF), a weighted least-squares method that provides asymptotically efficient estimates for single-input single-output systems. We illustrate the performance of the algorithm with simulation studies, which suggest that a network WNSF may also be asymptotically efficient estimates when applied to cascade networks, and discuss the possibility of extension to more general networks affected by sensor noise.
Are you eligible? Predicting adulthood from face images via class specific mean autoencoder
Venue: arXiv cs.CV 2018
Year: 2018

Predicting if a person is an adult or a minor has several applications such as inspecting underage driving, preventing purchase of alcohol and tobacco by minors, and granting restricted access. The challenging nature of this problem arises due to the complex and unique physiological changes that are observed with age progression. This paper presents a novel deep learning based formulation, termed as Class Specific Mean Autoencoder, to learn the intra-class similarity and extract class-specific features. We propose that the feature of a particular class if brought similar/closer to the mean feature of that class can help in learning class-specific representations. The proposed formulation is applied for the task of adulthood classification which predicts whether the given face image is of an adult or not. Experiments are performed on two large databases and the results show that the proposed algorithm yields higher classification accuracy compared to existing algorithms and a Commercial-Off-The-Shelf system.
Evolvable Systems for Big Data Management in Business
Venue: arXiv cs.SE 2018
Year: 2018

Big Data systems are increasingly having to be longer lasting, enterprise-wide and interoperable with other (legacy or new) systems. Furthermore many organizations operate in an external environment which dictates change at an unforeseeable rate and requires evolution in system requirements. In these cases system development does not have a definitive end point, rather it continues in a mutually constitutive cycle with the organization and its requirements. Also when the period of design is of such duration that the technology may well evolve or when the required technology is not mature at the outset, then the design process becomes considerably more difficult. Not only that but if the system must inter-operate with other systems then the design process becomes considerably more difficult. Ideally in these circumstances the design must also be able to evolve in order to react to changing technologies and requirements and to ensure traceability between the design and the evolving system specification. In other words extended design periods necessitate adaptable design specifications. For interoperability Big Data systems need to be discoverable and to work with information about other systems with which they need to cooperate over time. We have developed software called CRISTAL-ISE that enables dynamic system evolution and interoperability for Big Data systems, it has been commercialised as the Agilium-NG BPM product and is described in this paper.
FastDeRain: A Novel Video Rain Streak Removal Method Using Directional Gradient Priors
Venue: arXiv cs.CV 2018
Year: 2018

Rain streak removal is an important issue in outdoor vision systems and has recently been investigated extensively. In this paper, we propose a novel video rain streak removal approach FastDeRain, which fully considers the discriminative characteristics of rain streaks and the clean video in the gradient domain. Specifically, on the one hand, rain streaks are sparse and smooth along the direction of the raindrops, whereas on the other hand, clean videos exhibit piecewise smoothness along the rain-perpendicular direction and continuity along the temporal direction. Theses smoothness and continuity results in the sparse distribution in the different directional gradient domain, respectively. Thus, we minimize 1) the $\ell_1$ norm to enhance the sparsity of the underlying rain streaks, 2) two $\ell_1$ norm of unidirectional Total Variation (TV) regularizers to guarantee the anisotropic spatial smoothness, and 3) an $\ell_1$ norm of the time-directional difference operator to characterize the temporal continuity. A split augmented Lagrangian shrinkage algorithm (SALSA) based algorithm is designed to solve the proposed minimization model. Experiments conducted on synthetic and real data demonstrate the effectiveness and efficiency of the proposed method. According to comprehensive quantitative performance measures, our approach outperforms other state-of-the-art methods especially on account of the running time. The code of FastDeRain can be downloaded at https://github.com/TaiXiangJiang/FastDeRain.
Robust Formation Control in SE(3) for Tree-Graph Structures with Prescribed Transient and Steady State Performance
Venue: arXiv cs.SY 2018
Year: 2018

This paper presents a novel control protocol for distance and orientation formation control of rigid bodies, whose sensing graph is a static and undirected tree, in the special Euclidean group SE(3). The proposed control laws are decentralized, in the sense that each agent uses only local relative information from its neighbors to calculate its control signal, as well as robust with respect to modeling (parametric and structural) uncertainties and external disturbances. The proposed methodology guarantees the satisfaction of inter-agent distance constraints that resemble collision avoidance and connectivity maintenance properties. Moreover, certain predefined functions characterize the transient and steady state performance of the closed loop system. Finally, simulation results verify the validity and efficiency of the proposed approach.
DeepGauge: Multi-Granularity Testing Criteria for Deep Learning Systems
Venue: arXiv cs.SE 2018
Year: 2018

Deep learning (DL) defines a new data-driven programming paradigm that constructs the internal system logic of a crafted neuron network through a set of training data. We have seen wide adoption of DL in many safety-critical scenarios. However, a plethora of studies have shown that the state-of-the-art DL systems suffer from various vulnerabilities which can lead to severe consequences when applied to real-world applications. Currently, the testing adequacy of a DL system is usually measured by the accuracy of test data. Considering the limitation of accessible high quality test data, good accuracy performance on test data can hardly provide confidence to the testing adequacy and generality of DL systems. Unlike traditional software systems that have clear and controllable logic and functionality, the lack of interpretability in a DL system makes system analysis and defect detection difficult, which could potentially hinder its real-world deployment. In this paper, we propose DeepGauge, a set of multi-granularity testing criteria for DL systems, which aims at rendering a multi-faceted portrayal of the testbed. The in-depth evaluation of our proposed testing criteria is demonstrated on two well-known datasets, five DL systems, and with four state-of-the-art adversarial attack techniques against DL. The potential usefulness of DeepGauge sheds light on the construction of more generic and robust DL systems.
Dimensions: A Competitor to Scopus and the Web of Science?
Venue: arXiv cs.DL 2018
Year: 2018

Dimensions is a partly free scholarly database launched by Digital Science in January 2018. Dimensions includes journal articles and citation counts, making it a potential new source of impact data. This article explores the value of Dimensions from an impact assessment perspective with an examination of Food Science research 2008-2018 and a random sample of 10,000 Scopus articles from 2012. The results include high correlations between citation counts from Scopus and Dimensions (0.96 by narrow field in 2012) as well as similar average counts. Almost all Scopus articles with DOIs were found in Dimensions (97% in 2012). Thus, the scholarly database component of Dimensions seems to be a plausible alternative to Scopus and the Web of Science for general citation analyses and for citation data in support of some types of research evaluations.
Broadcasting on Bounded Degree DAGs
Venue: arXiv cs.IT 2018
Year: 2018

We study the following generalization of the well-known model of broadcasting on trees. Consider an infinite directed acyclic graph (DAG) with a unique source node $X$. Let the collection of nodes at distance $k$ from $X$ be called the $k$th layer. At time zero, the source node is given a bit. At time $k\geq 1$, each node in the $(k-1)$th layer inspects its inputs and sends a bit to its descendants in the $k$th layer. Each bit is flipped with a probability of error $δ\in \left(0,\frac{1}{2}\right)$ in the process of transmission. The goal is to be able to recover the original bit with probability of error better than $\frac{1}{2}$ from the values of all nodes at an arbitrarily deep layer $k$. Besides its natural broadcast interpretation, the DAG broadcast is a natural model of noisy computation. Some special cases of the model represent information flow in biological networks, and other cases represent noisy finite automata models. We show that there exist DAGs with bounded degree and layers of size $ω(\log(k))$ that permit recovery provided $δ$ is sufficiently small and find the critical $δ$ for the DAGs constructed. Our result demonstrates a doubly-exponential advantage for storing a bit in bounded degree DAGs compared to trees. On the negative side, we show that if the DAG is a two-dimensional regular grid, then recovery is impossible for any $δ\in \left(0,\frac{1}{2}\right)$ provided all nodes use either AND or XOR for their processing functions.
Low-Complexity Distributed Radio Access Network Slicing: Algorithms and Experimental Results
Venue: arXiv cs.NI 2018
Year: 2018

Radio access network (RAN) slicing is an effective methodology to dynamically allocate networking resources in 5G networks. One of the main challenges of RAN slicing is that it is provably an NP-Hard problem. For this reason, we design near-optimal low-complexity distributed RAN slicing algorithms. First, we model the slicing problem as a congestion game, and demonstrate that such game admits a unique Nash equilibrium (NE). Then, we evaluate the Price of Anarchy (PoA) of the NE, i.e., the efficiency of the NE as compared to the social optimum, and demonstrate that the PoA is upper-bounded by 3/2. Next, we propose two fully-distributed algorithms that provably converge to the unique NE without revealing privacy-sensitive parameters from the slice tenants. Moreover, we introduce an adaptive pricing mechanism of the wireless resources to improve the network owner's profit. We evaluate the performance of our algorithms through simulations and an experimental testbed deployed on the Amazon EC2 cloud, both based on a real-world dataset of base stations from the OpenCellID project. Results conclude that our algorithms converge to the NE rapidly and achieve near-optimal performance, while our pricing mechanism effectively improves the profit of the network owner.
Fog Massive MIMO: A User-Centric Seamless Hot-Spot Architecture
Venue: arXiv cs.IT 2018
Year: 2018

The decoupling of data and control planes, as proposed for 5G networks, will enable the efficient implementation of multitier networks where user equipment (UE) nodes obtain coverage and connectivity through the top-tier macro-cells, and, at the same time, achieve high-throughput low-latency communication through lower tiers in the hierarchy. This paper considers a new architecture for such lower tiers, dubbed fog massive MIMO, where the UEs are able to establish high-throughput low-latency data links in a seamless and opportunistic manner, as they travel through a dense fog of high-capacity wireless infrastructure nodes, referred to as remote radio heads (RRHs). Traditional handover mechanisms in dense multicell networks inherently give rise to frequent handovers and pilot sequence re-assignments, incurring, as a result, excessive protocol overhead and significant latency. In the proposed fog massive MIMO architecture, UEs seamlessly and implicitly associate themselves to the most convenient RRHs in a completely autonomous manner. Each UE makes use of a unique uplink pilot sequence, and pilot contamination is mitigated by a novel coded "on-the-fly" pilot contamination control mechanism. We analyze the spectral efficiency and the outage probability of the proposed architecture via stochastic geometry, using some recent results on unique coverage in Boolean models, and provide a detailed comparison with respect to an idealized baseline massive MIMO cellular system, that neglects protocol overhead and latency due to explicit user-cell association. Our analysis, supported by extensive system simulation, reveals that there exists a "sweet spot" of the per-pilot user load (number of users per pilot), such that the proposed system achieves spectral efficiency close to that of an ideal cellular system with the minimum distance user-base station association and no pilot/handover overhead.
On Multi-Server Coded Caching in the Low Memory Regime
Venue: arXiv cs.IT 2018
Year: 2018

In this paper we determine the delivery time for a multi-server coded caching problem when the cache size of each user is small. We propose an achievable scheme based on coded cache content placement, and employ zero-forcing techniques at the content delivery phase. Surprisingly, in contrast to previous multi-server results which were proved to be order-optimal within a multiplicative factor of 2, for the low memory regime we prove that our achievable scheme is optimal. Moreover, we compare the performance of our scheme with the uncoded solution, and show our proposal improvement over the uncoded scheme. Our results also apply to Degrees-of-Freedom (DoF) analysis of Multiple-Input Single-Output Broadcast Channels (MISO-BC) with cache-enabled users, where the multiple-antenna transmitter replaces the role of multiple servers. This shows that interference management in the low memory regime needs different caching techniques compared with medium-high memory regimes discussed in previous works.
Speech Emotion Recognition Considering Local Dynamic Features
Venue: arXiv cs.HC 2018
Year: 2018

Recently, increasing attention has been directed to the study of the speech emotion recognition, in which global acoustic features of an utterance are mostly used to eliminate the content differences. However, the expression of speech emotion is a dynamic process, which is reflected through dynamic durations, energies, and some other prosodic information when one speaks. In this paper, a novel local dynamic pitch probability distribution feature, which is obtained by drawing the histogram, is proposed to improve the accuracy of speech emotion recognition. Compared with most of the previous works using global features, the proposed method takes advantage of the local dynamic information conveyed by the emotional speech. Several experiments on Berlin Database of Emotional Speech are conducted to verify the effectiveness of the proposed method. The experimental results demonstrate that the local dynamic information obtained with the proposed method is more effective for speech emotion recognition than the traditional global features.
Sample Complexity of Sparse System Identification Problem
Venue: arXiv cs.SY 2018
Year: 2018

In this paper, we study the system identification problem for sparse linear time-invariant systems. We propose a sparsity promoting block-regularized estimator to identify the dynamics of the system with only a limited number of input-state data samples. We characterize the properties of this estimator under high-dimensional scaling, where the growth rate of the system dimension is comparable to or even faster than that of the number of available sample trajectories. In particular, using contemporary results on high-dimensional statistics, we show that the proposed estimator results in a small element-wise error, provided that the number of sample trajectories is above a threshold. This threshold depends polynomially on the size of each block and the number of nonzero elements at different rows of input and state matrices, but only logarithmically on the system dimension. A by-product of this result is that the number of sample trajectories required for sparse system identification is significantly smaller than the dimension of the system. Furthermore, we show that, unlike the recently celebrated least-squares estimators for system identification problems, the method developed in this work is capable of \textit{exact recovery} of the underlying sparsity structure of the system with the aforementioned number of data samples. Extensive case studies on synthetically generated systems, physical mass-spring networks, and multi-agent systems are offered to demonstrate the effectiveness of the proposed method.
An Accountable Anonymous Data Aggregation Scheme for Internet of Things
Venue: arXiv cs.CR 2018
Year: 2018

The Internet of Things (IoT) has become increasingly popular in people's daily lives. The pervasive IoT devices are encouraged to share data with each other in order to better serve the users. However, users are reluctant to share sensitive data due to privacy concerns. In this paper, we study the anonymous data aggregation for the IoT system, in which the IoT company servers, though not fully trustworthy, are used to assist the aggregation. We propose an efficient and accountable aggregation scheme that can preserve the data anonymity. We analyze the communication and computation overheads of the proposed scheme, and evaluate the total execution time and the per-user communication overhead with extensive simulations. The results show that our scheme is more efficient than the previous peer-shuffle protocol, especially for data aggregation from multiple providers.