OpenRaiser/Intern-Atlas huggingface dataset:
Retirement Transition in the Digital Ecology: Reflecting on Identity Reconstruction and Technology Appropriation
Venue: arXiv cs.CY 2017
Year: 2017

This paper describes a qualitative study of retirees' social and personal practices via digital music technologies in the context of community music. We conducted a diary study, and interviewed retired community musicians who are experiencing transition to retirement. Amongst challenges due to ageing and retirement, retirees participating in community music often experience discontinuity of identity caused by the lack of social and personal support after retirement, and also report lack of interest in using new technologies. Life transition theory was used to understand retirees' perception and strategies of identity navigation, informing the design of community-oriented online music services. We deepened our understanding of retirement transitions with technologies by showing how retirees participating in community music make sense of new rules and norms after retirement. A key finding is that retirees reconstruct identities by connecting with music communities, through which they can develop an understanding of unfamiliar patterns of the retired life, and gain support musically and socially. Technologies act as 'boundary objects' for communication between digital and physical artefacts, personal and social relationships. We highlight the importance of managing artefactual and interpersonal boundaries when designing online services for individual and communities in transitions.
A Memristor-Based Optimization Framework for AI Applications
Venue: arXiv cs.ET 2017
Year: 2017

Memristors have recently received significant attention as ubiquitous device-level components for building a novel generation of computing systems. These devices have many promising features, such as non-volatility, low power consumption, high density, and excellent scalability. The ability to control and modify biasing voltages at the two terminals of memristors make them promising candidates to perform matrix-vector multiplications and solve systems of linear equations. In this article, we discuss how networks of memristors arranged in crossbar arrays can be used for efficiently solving optimization and machine learning problems. We introduce a new memristor-based optimization framework that combines the computational merit of memristor crossbars with the advantages of an operator splitting method, alternating direction method of multipliers (ADMM). Here, ADMM helps in splitting a complex optimization problem into subproblems that involve the solution of systems of linear equations. The capability of this framework is shown by applying it to linear programming, quadratic programming, and sparse optimization. In addition to ADMM, implementation of a customized power iteration (PI) method for eigenvalue/eigenvector computation using memristor crossbars is discussed. The memristor-based PI method can further be applied to principal component analysis (PCA). The use of memristor crossbars yields a significant speed-up in computation, and thus, we believe, has the potential to advance optimization and machine learning research in artificial intelligence (AI).
Avoiding Communication in Proximal Methods for Convex Optimization Problems
Venue: arXiv cs.DC 2017
Year: 2017

The fast iterative soft thresholding algorithm (FISTA) is used to solve convex regularized optimization problems in machine learning. Distributed implementations of the algorithm have become popular since they enable the analysis of large datasets. However, existing formulations of FISTA communicate data at every iteration which reduces its performance on modern distributed architectures. The communication costs of FISTA, including bandwidth and latency costs, is closely tied to the mathematical formulation of the algorithm. This work reformulates FISTA to communicate data at every k iterations and reduce data communication when operating on large data sets. We formulate the algorithm for two different optimization methods on the Lasso problem and show that the latency cost is reduced by a factor of k while bandwidth and floating-point operation costs remain the same. The convergence rates and stability properties of the reformulated algorithms are similar to the standard formulations. The performance of communication-avoiding FISTA and Proximal Newton methods is evaluated on 1 to 1024 nodes for multiple benchmarks and demonstrate average speedups of 3-10x with scaling properties that outperform the classical algorithms.
Multi-Objective Approaches to Markov Decision Processes with Uncertain Transition Parameters
Venue: arXiv cs.AI 2017
Year: 2017

Markov decision processes (MDPs) are a popular model for performance analysis and optimization of stochastic systems. The parameters of stochastic behavior of MDPs are estimates from empirical observations of a system; their values are not known precisely. Different types of MDPs with uncertain, imprecise or bounded transition rates or probabilities and rewards exist in the literature. Commonly, analysis of models with uncertainties amounts to searching for the most robust policy which means that the goal is to generate a policy with the greatest lower bound on performance (or, symmetrically, the lowest upper bound on costs). However, hedging against an unlikely worst case may lead to losses in other situations. In general, one is interested in policies that behave well in all situations which results in a multi-objective view on decision making. In this paper, we consider policies for the expected discounted reward measure of MDPs with uncertain parameters. In particular, the approach is defined for bounded-parameter MDPs (BMDPs) [8]. In this setting the worst, best and average case performances of a policy are analyzed simultaneously, which yields a multi-scenario multi-objective optimization problem. The paper presents and evaluates approaches to compute the pure Pareto optimal policies in the value vector space.
User-centric Composable Services: A New Generation of Personal Data Analytics
Venue: arXiv cs.LG 2017
Year: 2017

Machine Learning (ML) techniques, such as Neural Network, are widely used in today's applications. However, there is still a big gap between the current ML systems and users' requirements. ML systems focus on improving the performance of models in training, while individual users cares more about response time and expressiveness of the tool. Many existing research and product begin to move computation towards edge devices. Based on the numerical computing system Owl, we propose to build the Zoo system to support construction, compose, and deployment of ML models on edge and local devices.
What is the Optimal Network Deployment for a Fixed Density of Antennas?
Venue: arXiv cs.NI 2017
Year: 2017

In this paper, we answer a fundamental question: when the total number of antennas per square kilometer is fixed, what is the optimal network deployment? A denser network with a less number of antennas per base station (BS) or the opposite case. To evaluate network performance, we consider a practical network scenario with a fixed antennas density and multiuser multiple-input-multiple-output (MU-MIMO) operations for single-antenna users. The number of antennas in each BS is calculated by dividing the antenna density by the BS density. With the consideration of several practical network models, i.e., pilot contamination, a limited user equipment (UE) density and probabilistic line-of-sight (LoS)/non-line-of-sight (NLoS) path loss model, we evaluate the area spectral efficiency (ASE) performance. From our simulation results, we conclude that there exists an optimal BS density for a certain UE density to maximize the ASE performance when the antenna density is fixed. The intuition is that (i) by densifying the network with more BSs, we can achieve a receive power gain due to the smaller distance between the typical UE and its serving BS; (ii) by installing more antennas in each BS, we can achieve a beamforming gain for UEs using MU-MIMO, although such beamforming gain is degraded by pilot contamination; (iii) thus, a trade-off exists between the receive power gain and the beamforming gain, if we fix the antenna density in the network.
Massive MIMO Performance Comparison of Beamforming and Multiplexing in the Terahertz Band
Venue: arXiv cs.IT 2017
Year: 2017

In this paper, we compare the performance of two main MIMO techniques, beamforming and multiplexing, in the Terahertz (THz) band. The main problem with the THz band is its huge propagation loss, which is caused by the tremendous signal attenuation due to molecule absorption of the electro-magnetic wave. To overcome the path loss issue, massive MIMO has been suggested to be employed in the network and is expected to provide Tbps for a distance within a few meters. In this context, beamforming is studied recently as the main technique to take advantage of MIMO in THz and overcome the very high path loss with the assumption that the THz communication channel is Line-of-Sight (LoS) and there are not significant multipath rays. On the other hand, recent studies also showed that the well-known absorbed energy by molecules can be re-radiated immediately in the same frequency. Such re-radiated signal is correlated with the main signal and can provide rich scattering paths for the communication channel. This means that a significant MIMO multiplexing gain can be achieved even in a LoS scenario for the THz band. Our simulation results reveal a surprising observation that the MIMO multiplexing could be a better choice than the MIMO beamforming under certain conditions in THz communications.
Generalized Geometric Programming for Rate Allocation in Consensus
Venue: arXiv cs.IT 2017
Year: 2017

Distributed averaging, or distributed average consensus, is a common method for computing the sample mean of the data dispersed among the nodes of a network in a decentralized manner. By iteratively exchanging messages with neighbors, the nodes of the network can converge to an agreement on the sample mean of their initial states. In real-world scenarios, these messages are subject to bandwidth and power constraints, which motivates the design of a lossy compression strategy. Few prior works consider the rate allocation problem from the perspective of constrained optimization, which provides a principled method for the design of lossy compression schemes, allows for the relaxation of certain assumptions, and offers performance guarantees. We show for Gaussian-distributed initial states with entropy-coded scalar quantization and vector quantization that the coding rates for distributed averaging can be optimized through generalized geometric programming. In the absence of side information from past states, this approach finds a rate allocation over nodes and iterations that minimizes the aggregate coding rate required to achieve a target mean square error within a finite run time. Our rate allocation is compared to some of the prior art through numerical simulations. The results motivate the incorporation of side-information through differential or predictive coding to improve rate-distortion performance.
Nondeterministic Communication Complexity with Help and Graph Functions
Venue: arXiv cs.CC 2017
Year: 2017

We define nondeterministic communication complexity in the model of communication complexity with help of Babai, Hayes and Kimmel. We use it to prove logarithmic lower bounds on the NOF communication complexity of explicit graph functions, which are complementary to the bounds proved by Beame, David, Pitassi and Woelfel.
Biometrics-as-a-Service: A Framework to Promote Innovative Biometric Recognition in the Cloud
Venue: arXiv cs.DC 2017
Year: 2017

Biometric recognition, or simply biometrics, is the use of biological attributes such as face, fingerprints or iris in order to recognize an individual in an automated manner. A key application of biometrics is authentication; i.e., using said biological attributes to provide access by verifying the claimed identity of an individual. This paper presents a framework for Biometrics-as-a-Service (BaaS) that performs biometric matching operations in the cloud, while relying on simple and ubiquitous consumer devices such as smartphones. Further, the framework promotes innovation by providing interfaces for a plurality of software developers to upload their matching algorithms to the cloud. When a biometric authentication request is submitted, the system uses a criteria to automatically select an appropriate matching algorithm. Every time a particular algorithm is selected, the corresponding developer is rendered a micropayment. This creates an innovative and competitive ecosystem that benefits both software developers and the consumers. As a case study, we have implemented the following: (a) an ocular recognition system using a mobile web interface providing user access to a biometric authentication service, and (b) a Linux-based virtual machine environment used by software developers for algorithm development and submission.
The Heterogeneous Ensembles of Standard Classification Algorithms (HESCA): the Whole is Greater than the Sum of its Parts
Venue: arXiv cs.LG 2017
Year: 2017

Building classification models is an intrinsically practical exercise that requires many design decisions prior to deployment. We aim to provide some guidance in this decision making process. Specifically, given a classification problem with real valued attributes, we consider which classifier or family of classifiers should one use. Strong contenders are tree based homogeneous ensembles, support vector machines or deep neural networks. All three families of model could claim to be state-of-the-art, and yet it is not clear when one is preferable to the others. Our extensive experiments with over 200 data sets from two distinct archives demonstrate that, rather than choose a single family and expend computing resources on optimising that model, it is significantly better to build simpler versions of classifiers from each family and ensemble. We show that the Heterogeneous Ensembles of Standard Classification Algorithms (HESCA), which ensembles based on error estimates formed on the train data, is significantly better (in terms of error, balanced error, negative log likelihood and area under the ROC curve) than its individual components, picking the component that is best on train data, and a support vector machine tuned over 1089 different parameter configurations. We demonstrate HESCA+, which contains a deep neural network, a support vector machine and two decision tree forests, is significantly better than its components, picking the best component, and HESCA. We analyse the results further and find that HESCA and HESCA+ are of particular value when the train set size is relatively small and the problem has multiple classes. HESCA is a fast approach that is, on average, as good as state-of-the-art classifiers, whereas HESCA+ is significantly better than average and represents a strong benchmark for future research.
Automated Region Masking Of Latent Overlapped Fingerprints
Venue: arXiv cs.CY 2017
Year: 2017

Fingerprints have grown to be the most robust and efficient means of biometric identification. Latent fingerprints are commonly found at crime scenes. They are also of the overlapped kind making it harder for identification and thus the separation of overlapped fingerprints has been a conundrum to surpass. The usage of dedicated software has resulted in a manual approach to region masking of the two given overlapped fingerprints. The region masks are then further used to separate the fingerprints. This requires the user's physical concentration to acquire the separate region masks, which are found to be time-consuming. This paper proposes a novel algorithm that is fully automated in its approach to region masking the overlapped fingerprint image. The algorithm recognizes a unique approach of using blurring, erosion, and dilation in order to attain the desired automated region masks. The experiments conducted visually demonstrate the effectiveness of the algorithm.
Evidence of an exponential speed-up in the solution of hard optimization problems
Venue: arXiv cs.AI 2017
Year: 2017

Optimization problems pervade essentially every scientific discipline and industry. Many such problems require finding a solution that maximizes the number of constraints satisfied. Often, these problems are particularly difficult to solve because they belong to the NP-hard class, namely algorithms that always find a solution in polynomial time are not known. Over the past decades, research has focused on developing heuristic approaches that attempt to find an approximation to the solution. However, despite numerous research efforts, in many cases even approximations to the optimal solution are hard to find, as the computational time for further refining a candidate solution grows exponentially with input size. Here, we show a non-combinatorial approach to hard optimization problems that achieves an exponential speed-up and finds better approximations than the current state-of-the-art. First, we map the optimization problem into a boolean circuit made of specially designed, self-organizing logic gates, which can be built with (non-quantum) electronic components; the equilibrium points of the circuit represent the approximation to the problem at hand. Then, we solve its associated non-linear ordinary differential equations numerically, towards the equilibrium points. We demonstrate this exponential gain by comparing a sequential MatLab implementation of our solver with the winners of the 2016 Max-SAT competition on a variety of hard optimization instances. We show empirical evidence that our solver scales linearly with the size of the problem, both in time and memory, and argue that this property derives from the collective behavior of the simulated physical circuit. Our approach can be applied to other types of optimization problems and the results presented here have far-reaching consequences in many fields.
Feature learning in feature-sample networks using multi-objective optimization
Venue: arXiv cs.AI 2017
Year: 2017

Data and knowledge representation are fundamental concepts in machine learning. The quality of the representation impacts the performance of the learning model directly. Feature learning transforms or enhances raw data to structures that are effectively exploited by those models. In recent years, several works have been using complex networks for data representation and analysis. However, no feature learning method has been proposed for such category of techniques. Here, we present an unsupervised feature learning mechanism that works on datasets with binary features. First, the dataset is mapped into a feature--sample network. Then, a multi-objective optimization process selects a set of new vertices to produce an enhanced version of the network. The new features depend on a nonlinear function of a combination of preexisting features. Effectively, the process projects the input data into a higher-dimensional space. To solve the optimization problem, we design two metaheuristics based on the lexicographic genetic algorithm and the improved strength Pareto evolutionary algorithm (SPEA2). We show that the enhanced network contains more information and can be exploited to improve the performance of machine learning methods. The advantages and disadvantages of each optimization strategy are discussed.
Exploring the Use of Text Classification in the Legal Domain
Venue: arXiv cs.CL 2017
Year: 2017

In this paper, we investigate the application of text classification methods to support law professionals. We present several experiments applying machine learning techniques to predict with high accuracy the ruling of the French Supreme Court and the law area to which a case belongs to. We also investigate the influence of the time period in which a ruling was made on the form of the case description and the extent to which we need to mask information in a full case ruling to automatically obtain training and test data that resembles case descriptions. We developed a mean probability ensemble system combining the output of multiple SVM classifiers. We report results of 98% average F1 score in predicting a case ruling, 96% F1 score for predicting the law area of a case, and 87.07% F1 score on estimating the date of a ruling.
Optimal Scheduling of Friendly Jammers for Securing Wireless Communication
Venue: arXiv cs.CR 2017
Year: 2017

Wireless communication systems, such as wireless sensor networks and RFIDs, are increasingly adopted to transfer potential highly sensitive information. Since the wireless medium has a sharing nature, adversaries have a chance to eavesdrop confidential information from the communication systems. Adding artificial noises caused by friendly jammers emerges as a feasible defensive technique against adversaries. This paper studies the schedule strategies of friendly jammers, which are randomly and redundantly deployed in a circumscribed geographical area and can be unrechargeable or rechargeable, to maximize the lifetime of the jammer networks and prevent the cracking of jamming effect made by the eavesdroppers, under the constraints of geographical area, energy consumption, transmission power, and threshold level. An approximation algorithm as baseline is first proposed using the integer linear programming model. To further reduce the computational complexity, a heuristic algorithm based on the greedy strategy that less consumption leads to longer lifetime is also proposed. Finally, extensive simulation results show that the proposed algorithms are effective and efficient.
Construction of optimal locally repairable codes via automorphism groups of rational function fields
Venue: arXiv cs.IT 2017
Year: 2017

Locally repairable codes, or locally recoverable codes (LRC for short) are designed for application in distributed and cloud storage systems. Similar to classical block codes, there is an important bound called the Singleton-type bound for locally repairable codes. In this paper, an optimal locally repairable code refers to a block code achieving this Singleton-type bound. Like classical MDS codes, optimal locally repairable codes carry some very nice combinatorial structures. Since introduction of the Singleton-type bound for locally repairable codes, people have put tremendous effort on constructions of optimal locally repairable codes. Due to hardness of this problem, there are few constructions of optimal locally repairable codes in literature. Most of these constructions are realized via either combinatorial or algebraic structures. In this paper, we employ automorphism groups of rational function fields to construct optimal locally repairable codes by considering the group action on the projective lines over finite fields. It turns out that we are able to construct optimal locally repairable codes with reflexibility of locality as well as smaller alphabet size comparable to the code length. In particular, we produce new families of $q$-ary locally repairable codes, including codes of length $q+1$ via cyclic groups and codes via dihedral groups.