OpenRaiser/Intern-Atlas huggingface dataset:
Predicting Privileged Information for Height Estimation
Venue: arXiv cs.CV 2017
Year: 2017

In this paper, we propose a novel regression-based method for employing privileged information to estimate the height using human metrology. The actual values of the anthropometric measurements are difficult to estimate accurately using state-of-the-art computer vision algorithms. Hence, we use ratios of anthropometric measurements as features. Since many anthropometric measurements are not available at test time in real-life scenarios, we employ a learning using privileged information (LUPI) framework in a regression setup. Instead of using the LUPI paradigm for regression in its original form (i.e., ε-SVR+), we train regression models that predict the privileged information at test time. The predictions are then used, along with observable features, to perform height estimation. Once the height is estimated, a mapping to classes is performed. We demonstrate that the proposed approach can estimate the height better and faster than the ε-SVR+ algorithm and report results for different genders and quartiles of humans.
Mobile Data Trading: Behavioral Economics Analysis and Algorithm Design
Venue: arXiv cs.GT 2017
Year: 2017

Motivated by the recently launched mobile data trading markets (e.g., China Mobile Hong Kong's 2nd exChange Market), in this paper we study the mobile data trading problem under the future data demand uncertainty. We introduce a brokerage-based market, where sellers and buyers propose their selling and buying quantities, respectively, to the trading platform that matches the market supply and demand. To understand the users' realistic trading behaviors, a prospect theory (PT) model from behavioral economics is proposed, which includes the widely adopted expected utility theory (EUT) as a special case. Although the PT modeling leads to a challenging non-convex optimization problem, the optimal solution can be characterized by exploiting the unimodal structure of the objective function. Building upon our analysis, we design an algorithm to help estimate the user's risk preference and provide trading recommendations dynamically, considering the latest market and usage information. It is shown in our simulation that the risk preferences have a significant impact on the user's decision and outcome: a risk-averse dominant user can guarantee a higher minimum profit in the trading, while a risk-seeking dominant user can achieve a higher maximum profit. By comparing with the EUT benchmark, it is shown that a PT user with a low reference point is more willing to buy mobile data. Moreover, when the probability of high future data demand is low, a PT user is more willing to buy mobile data due to the probability distortion comparing with an EUT user.
Energy Trading between microgrids Individual Cost Minimization and Social Welfare Maximization
Venue: arXiv cs.SY 2017
Year: 2017

High penetration of renewable energy source makes microgrid (MGs) be environment friendly. However, the stochastic input from renewable energy resource brings difficulty in balancing the energy supply and demand. Purchasing extra energy from macrogrid to deal with energy shortage will increase MG energy cost. To mitigate intermittent nature of renewable energy, energy trading and energy storage which can exploit diversity of renewable energy generation across space and time are efficient and cost-effective methods. But current energy storage control action will impact the future control action which brings challenge to energy management. In addition, due to MG participating energy trading as prosumer, it calls for an efficient trading mechanism. Therefore, this paper focuses on the problem of MG energy management and trading. Energy trading problem is formulated as a stochastic optimization one with both individual profit and social welfare maximization. Firstly a Lyapunov optimization based algorithm is developed to solve the stochastic problem. Secondly the double-auction based mechanism is provided to attract MG truthful bidding for buying and selling energy. Through theoretical analysis, we demonstrate that individual MG can achieve a time average energy cost close to offline optimum with tradeoff between storage capacity and energy trading cost. Meanwhile the social welfare is also asymptotically maximized under double auction. Simulation results based on real world data show the effectiveness of our algorithm.
Survey on Remote Electronic Voting
Venue: arXiv cs.CY 2017
Year: 2017

Electronic and remote voting has become a large field of research and brought forth a multiplicity of schemes, systems, cryptographic primitives as well as formal definitions and requirements for electronic elections. In this survey we try to give a brief and precise overview and summary of the current situation.
Attribute-controlled face photo synthesis from simple line drawing
Venue: arXiv cs.CV 2017
Year: 2017

Face photo synthesis from simple line drawing is a one-to-many task as simple line drawing merely contains the contour of human face. Previous exemplar-based methods are over-dependent on the datasets and are hard to generalize to complicated natural scenes. Recently, several works utilize deep neural networks to increase the generalization, but they are still limited in the controllability of the users. In this paper, we propose a deep generative model to synthesize face photo from simple line drawing controlled by face attributes such as hair color and complexion. In order to maximize the controllability of face attributes, an attribute-disentangled variational auto-encoder (AD-VAE) is firstly introduced to learn latent representations disentangled with respect to specified attributes. Then we conduct photo synthesis from simple line drawing based on AD-VAE. Experiments show that our model can well disentangle the variations of attributes from other variations of face photos and synthesize detailed photorealistic face images with desired attributes. Regarding background and illumination as the style and human face as the content, we can also synthesize face photos with the target style of a style photo.
Coordinated Online Learning With Applications to Learning User Preferences
Venue: arXiv cs.LG 2017
Year: 2017

We study an online multi-task learning setting, in which instances of related tasks arrive sequentially, and are handled by task-specific online learners. We consider an algorithmic framework to model the relationship of these tasks via a set of convex constraints. To exploit this relationship, we design a novel algorithm -- COOL -- for coordinating the individual online learners: Our key idea is to coordinate their parameters via weighted projections onto a convex set. By adjusting the rate and accuracy of the projection, the COOL algorithm allows for a trade-off between the benefit of coordination and the required computation/communication. We derive regret bounds for our approach and analyze how they are influenced by these trade-off factors. We apply our results on the application of learning users' preferences on the Airbnb marketplace with the goal of incentivizing users to explore under-reviewed apartments.
Dynamic Scaling of Virtualized, Distributed Service Chains: A Case Study of IMS
Venue: arXiv cs.NI 2017
Year: 2017

The emerging paradigm of network function virtualization advocates deploying virtualized network functions (VNF) on standard virtualization platforms for significant cost reduction and management flexibility. There have been system designs for managing dynamic deployment and scaling of VNF service chains within one cloud data center. Many real-world network services involve geo-distributed service chains, with prominent examples of mobile core networks and IMSs (IP Multimedia Subsystems). Virtualizing these service chains requires efficient coordination of VNF deployment across different geo-distributed data centers over time, calling for new management system design. This paper designs a dynamic scaling system for geo-distributed VNF service chains, using the case of an IMS. IMSs are widely used subsystems for delivering multimedia services among mobile users in a 3G/4G network, whose virtualization has been broadly advocated in the industry for reducing cost, improving network usage efficiency and enabling dynamic network topology reconfiguration for performance optimization. Our scaling system design caters to key control-plane and data-plane service chains in an IMS, combining proactive and reactive approaches for timely, cost-effective scaling of the service chains. We evaluate our system design using real-world experiments on both emulated platforms and geo-distributed clouds.
Pushing STEM-education through a social-media-based contest format - experiences and lessons-learned from the H2020-project SciChallenge
Venue: arXiv cs.CY 2017
Year: 2017

Science education is a crucial issue with long-term impacts for Europe as the low enrolment rates in the STEM-fields, including (natural) science, technology, engineering and mathematics, will lead to a workforce problem in research and development. In order to address this challenge, the EU-funded research project SciChallenge (project.scichallenge.eu) aims to find a new way for getting young people more interested in STEM. For this purpose, the project developed and implemented a social-media-based STEM-contest for young people, which aims at increasing the attractiveness of science education and careers among young people. In the first two parts, the paper reflects on the problem, introduces the project and highlights the main steps of the preparation of the contest. The third section of the paper presents the idea, design and implementation of the digital contest platform (www.scichallenge.eu), which serves as the core of the challenge. The fourth part of the paper will provide a status update on the contest pilot. It will provide a summary of the experiences that the consortium made with this novel approach as well as the main obstacles that the consortium was facing. The paper will conclude with a preliminary reflection on the question if such an approach can help to increase the interest of young people in STEM-education and careers.
Switching EEG Headsets Made Easy: Reducing Offline Calibration Effort Using Active Weighted Adaptation Regularization
Venue: arXiv cs.LG 2017
Year: 2017

Electroencephalography (EEG) headsets are the most commonly used sensing devices for Brain-Computer Interface. In real-world applications, there are advantages to extrapolating data from one user session to another. However, these advantages are limited if the data arise from different hardware systems, which often vary between application spaces. Currently, this creates a need to recalibrate classifiers, which negatively affects people's interest in using such systems. In this paper, we employ active weighted adaptation regularization (AwAR), which integrates weighted adaptation regularization (wAR) and active learning, to expedite the calibration process. wAR makes use of labeled data from the previous headset and handles class-imbalance, and active learning selects the most informative samples from the new headset to label. Experiments on single-trial event-related potential classification show that AwAR can significantly increase the classification accuracy, given the same number of labeled samples from the new headset. In other words, AwAR can effectively reduce the number of labeled samples required from the new headset, given a desired classification accuracy, suggesting value in collating data for use in wide scale transfer-learning applications.
Spatial Filtering for EEG-Based Regression Problems in Brain-Computer Interface (BCI)
Venue: arXiv cs.LG 2017
Year: 2017

Electroencephalogram (EEG) signals are frequently used in brain-computer interfaces (BCIs), but they are easily contaminated by artifacts and noises, so preprocessing must be done before they are fed into a machine learning algorithm for classification or regression. Spatial filters have been widely used to increase the signal-to-noise ratio of EEG for BCI classification problems, but their applications in BCI regression problems have been very limited. This paper proposes two common spatial pattern (CSP) filters for EEG-based regression problems in BCI, which are extended from the CSP filter for classification, by making use of fuzzy sets. Experimental results on EEG-based response speed estimation from a large-scale study, which collected 143 sessions of sustained-attention psychomotor vigilance task data from 17 subjects during a 5-month period, demonstrate that the two proposed spatial filters can significantly increase the EEG signal quality. When used in LASSO and k-nearest neighbors regression for user response speed estimation, the spatial filters can reduce the root mean square estimation error by 10.02-19.77%, and at the same time increase the correlation to the true response speed by 19.39-86.47%.
Recent Advances in Local Energy Trading in the Smart Grid Based on Game--Theoretic Approaches
Venue: arXiv cs.GT 2017
Year: 2017

The global move towards efficient energy consumption and production has led to remarkable advancements in the design of the smart grid infrastructure. Local energy trading is one way forward. It typically refers to the transfer of energy from an entity of the smart grid surplus energy to one with a deficit. In this paper, we present a detailed review of the recent advances in the application of game--theoretic methods to local energy trading scenarios. An extensive description of a complete game theory-based energy trading framework is presented. It includes a taxonomy of the methods and an introduction to the smart grid architecture with a focus on renewable energy generation and energy storage. Finally, we present a critical evaluation of the current shortcomings and identify areas for future research.
The Price of Selection in Differential Privacy
Venue: arXiv cs.DS 2017
Year: 2017

In the differentially private top-$k$ selection problem, we are given a dataset $X \in \{\pm 1\}^{n \times d}$, in which each row belongs to an individual and each column corresponds to some binary attribute, and our goal is to find a set of $k \ll d$ columns whose means are approximately as large as possible. Differential privacy requires that our choice of these $k$ columns does not depend too much on any on individual's dataset. This problem can be solved using the well known exponential mechanism and composition properties of differential privacy. In the high-accuracy regime, where we require the error of the selection procedure to be to be smaller than the so-called sampling error $α\approx \sqrt{\ln(d)/n}$, this procedure succeeds given a dataset of size $n \gtrsim k \ln(d)$. We prove a matching lower bound, showing that a dataset of size $n \gtrsim k \ln(d)$ is necessary for private top-$k$ selection in this high-accuracy regime. Our lower bound is the first to show that selecting the $k$ largest columns requires more data than simply estimating the value of those $k$ columns, which can be done using a dataset of size just $n \gtrsim k$.
Scalability Analysis of the RADAR Decision Support Tool
Venue: arXiv cs.SE 2017
Year: 2017

This report presents a theoretical complexity analysis and empirical scalability analysis of the Requirements and Architecture Decision Analyser (RADAR).
A large comparison of feature-based approaches for buried target classification in forward-looking ground-penetrating radar
Venue: arXiv cs.CV 2017
Year: 2017

Forward-looking ground-penetrating radar (FLGPR) has recently been investigated as a remote sensing modality for buried target detection (e.g., landmines). In this context, raw FLGPR data is beamformed into images and then computerized algorithms are applied to automatically detect subsurface buried targets. Most existing algorithms are supervised, meaning they are trained to discriminate between labeled target and non-target imagery, usually based on features extracted from the imagery. A large number of features have been proposed for this purpose, however thus far it is unclear which are the most effective. The first goal of this work is to provide a comprehensive comparison of detection performance using existing features on a large collection of FLGPR data. Fusion of the decisions resulting from processing each feature is also considered. The second goal of this work is to investigate two modern feature learning approaches from the object recognition literature: the bag-of-visual-words and the Fisher vector for FLGPR processing. The results indicate that the new feature learning approaches outperform existing methods. Results also show that fusion between existing features and new features yields little additional performance improvements.
Local System Voting Feature for Machine Translation System Combination
Venue: arXiv cs.CL 2017
Year: 2017

In this paper, we enhance the traditional confusion network system combination approach with an additional model trained by a neural network. This work is motivated by the fact that the commonly used binary system voting models only assign each input system a global weight which is responsible for the global impact of each input system on all translations. This prevents individual systems with low system weights from having influence on the system combination output, although in some situations this could be helpful. Further, words which have only been seen by one or few systems rarely have a chance of being present in the combined output. We train a local system voting model by a neural network which is based on the words themselves and the combinatorial occurrences of the different system outputs. This gives system combination the option to prefer other systems at different word positions even for the same sentence.
Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities
Venue: arXiv cs.LG 2017
Year: 2017

The follow the leader (FTL) algorithm, perhaps the simplest of all online learning algorithms, is known to perform well when the loss functions it is used on are convex and positively curved. In this paper we ask whether there are other "lucky" settings when FTL achieves sublinear, "small" regret. In particular, we study the fundamental problem of linear prediction over a non-empty convex, compact domain. Amongst other results, we prove that the curvature of the boundary of the domain can act as if the losses were curved: In this case, we prove that as long as the mean of the loss vectors have positive lengths bounded away from zero, FTL enjoys a logarithmic growth rate of regret, while, e.g., for polytope domains and stochastic data it enjoys finite expected regret. Building on a previously known meta-algorithm, we also get an algorithm that simultaneously enjoys the worst-case guarantees and the bound available for FTL.
Gamifying Education and Research on ICS Security: Design, Implementation and Results of S3
Venue: arXiv cs.CR 2017
Year: 2017

In this work, we consider challenges relating to security for Industrial Control Systems (ICS) in the context of ICS security education and research targeted both to academia and industry. We propose to address those challenges through gamified attack training and countermeasure evaluation. We tested our proposed ICS security gamification idea in the context of the (to the best of our knowledge) first Capture-The-Flag (CTF) event targeted to ICS security called SWaT Security Showdown (S3). Six teams acted as attackers in a security competition leveraging an ICS testbed, with several academic defense systems attempting to detect the ongoing attacks. The event was conducted in two phases. The online phase (a jeopardy-style CTF) served as a training session. The live phase was structured as an attack-defense CTF. We acted as judges and we assigned points to the attacker teams according to a scoring system that we developed internally based on multiple factors, including realistic attacker models. We conclude the paper with an evaluation and discussion of the S3, including statistics derived from the data collected in each phase of S3.
On the cost of simulating a parallel Boolean automata network by a block-sequential one
Venue: arXiv cs.DM 2017
Year: 2017

In this article we study the minimum number $κ$ of additional automata that a Boolean automata network (BAN) associated with a given block-sequential update schedule needs in order to simulate a given BAN with a parallel update schedule. We introduce a graph that we call $\mathsf{NECC}$ graph built from the BAN and the update schedule. We show the relation between $κ$ and the chromatic number of the $\mathsf{NECC}$ graph. Thanks to this $\mathsf{NECC}$ graph, we bound $κ$ in the worst case between $n/2$ and $2n/3+2$ ($n$ being the size of the BAN simulated) and we conjecture that this number equals $n/2$. We support this conjecture with two results: the clique number of a $\mathsf{NECC}$ graph is always less than or equal to $n/2$ and, for the subclass of bijective BANs, $κ$ is always less than or equal to $n/2+1$.
Cramér-Rao Lower Bounds for Positioning with Large Intelligent Surfaces
Venue: arXiv cs.IT 2017
Year: 2017

We consider the potential for positioning with a system where antenna arrays are deployed as a large intelligent surface (LIS). We derive Fisher-informations and Cramér-Rao lower bounds (CRLB) in closed-form for terminals along the central perpendicular line (CPL) of the LIS for all three Cartesian dimensions. For terminals at positions other than the CPL, closed-form expressions for the Fisher-informations and CRLBs seem out of reach, and we alternatively provide approximations (in closed-form) which are shown to be very accurate. We also show that under mild conditions, the CRLBs in general decrease quadratically in the surface-area for both the $x$ and $y$ dimensions. For the $z$-dimension (distance from the LIS), the CRLB decreases linearly in the surface-area when terminals are along the CPL. However, when terminals move away from the CPL, the CRLB is dramatically increased and then also decreases quadratically in the surface-area. We also extensively discuss the impact of different deployments (centralized and distributed) of the LIS.
Stochastic Configuration Networks: Fundamentals and Algorithms
Venue: arXiv cs.NE 2017
Year: 2017

This paper contributes to a development of randomized methods for neural networks. The proposed learner model is generated incrementally by stochastic configuration (SC) algorithms, termed as Stochastic Configuration Networks (SCNs). In contrast to the existing randomised learning algorithms for single layer feed-forward neural networks (SLFNNs), we randomly assign the input weights and biases of the hidden nodes in the light of a supervisory mechanism, and the output weights are analytically evaluated in either constructive or selective manner. As fundamentals of SCN-based data modelling techniques, we establish some theoretical results on the universal approximation property. Three versions of SC algorithms are presented for regression problems (applicable for classification problems as well) in this work. Simulation results concerning both function approximation and real world data regression indicate some remarkable merits of our proposed SCNs in terms of less human intervention on the network size setting, the scope adaptation of random parameters, fast learning and sound generalization.