OpenRaiser/Intern-Atlas huggingface dataset:
Reinforcement Learning Applied to an Electric Water Heater: From Theory to Practice
Venue: arXiv cs.LG 2015
Year: 2015

Electric water heaters have the ability to store energy in their water buffer without impacting the comfort of the end user. This feature makes them a prime candidate for residential demand response. However, the stochastic and nonlinear dynamics of electric water heaters, makes it challenging to harness their flexibility. Driven by this challenge, this paper formulates the underlying sequential decision-making problem as a Markov decision process and uses techniques from reinforcement learning. Specifically, we apply an auto-encoder network to find a compact feature representation of the sensor measurements, which helps to mitigate the curse of dimensionality. A wellknown batch reinforcement learning technique, fitted Q-iteration, is used to find a control policy, given this feature representation. In a simulation-based experiment using an electric water heater with 50 temperature sensors, the proposed method was able to achieve good policies much faster than when using the full state information. In a lab experiment, we apply fitted Q-iteration to an electric water heater with eight temperature sensors. Further reducing the state vector did not improve the results of fitted Q-iteration. The results of the lab experiment, spanning 40 days, indicate that compared to a thermostat controller, the presented approach was able to reduce the total cost of energy consumption of the electric water heater by 15%.
Science Use in Regulatory Impact Analysis: The Effects of Political Attention and Controversy
Venue: arXiv cs.DL 2015
Year: 2015

Scholars, policymakers, and research sponsors have long sought to understand the conditions under which scientific research is used in the policymaking process. Recent research has identified a resource that can be used to trace the use of science across time and many policy domains. US federal agencies are mandated by executive order to justify all economically significant regulations by regulatory impact analyses (RIAs), in which they present evidence of the scientific underpinnings and consequences of the proposed rule. To gain new insight into when and how regulators invoke science in their policy justifications, we ask: does the political attention and controversy surrounding a regulation affect the extent to which science is utilized in RIAs? We examine scientific citation activity in all 101 economically significant RIAs from 2008-2012 and evaluate the effects of attention -- from the public, policy elites and the media -- on the degree of science use in RIAs. Our main finding is that regulators draw more heavily on scientific research when justifying rules subject to a high degree of attention from outside actors. These findings suggest that scientific research plays an important role in the justification of regulations, especially those that are highly salient to the public and other policy actors.
Analysis of Millimeter Wave Networked Wearables in Crowded Environments
Venue: arXiv cs.IT 2015
Year: 2015

The millimeter wave (mmWave) band has the potential to provide high throughput among wearable devices. When mmWave wearable networks are used in crowded environments, such as on a bus or train, antenna directivity and orientation hold the key to achieving Gbps rates. Previous work using stochastic geometry often assumes an infinite number of interfering nodes drawn from a Poisson Point Process (PPP). Since indoor wearable networks will be isolated due to walls, a network with a finite number of nodes may be a more suitable model. In this paper, we characterize the significant sources of interference and develop closed-form expressions for the spatially averaged performance of a typical user's wearable communication link. The effect of human body blockage on the mmWave signals and the role of network density are investigated to show that an increase in interferer density reduces the mean number of significant interferers.
Context-Aware D2D Peer Selection for Load Distribution in LTE Networks
Venue: arXiv cs.NI 2015
Year: 2015

In this paper we propose a novel context-aware approach for resource allocation in device to device (D2D) communication networks which exploits context information about the users velocity and size of their demanded data to decide whether their traffic load can be transferred to D2D tier and which D2D users should be paired. The problem is modeled as a matching game with externalities and a novel algorithm is proposed to solve the game which converges to a stable matching between the D2D users. Simulation results demonstrate the effectiveness of our model in offloading the cellular networks traffic to the D2D tier.
Continuous and Simultaneous Gesture and Posture Recognition for Commanding a Robotic Wheelchair; Towards Spotting the Signal Patterns
Venue: arXiv cs.RO 2015
Year: 2015

Spotting signal patterns with varying lengths has been still an open problem in the literature. In this study, we describe a signal pattern recognition approach for continuous and simultaneous classification of a tracked hand's posture and gestures and map them to steering commands for control of a robotic wheelchair. The developed methodology not only affords 100\% recognition accuracy on a streaming signal for continuous recognition, but also brings about a new perspective for building a training dictionary which eliminates human intervention to spot the gesture or postures on a training signal. In the training phase we employ a state of art subspace clustering method to find the most representative state samples. The recognition and training framework reveal boundaries of the patterns on the streaming signal with a successive decision tree structure intrinsically. We make use of the Collaborative ans Block Sparse Representation based classification methods for continuous gesture and posture recognition.
Centroid Based Binary Tree Structured SVM for Multi Classification
Venue: arXiv cs.LG 2015
Year: 2015

Support Vector Machines (SVMs) were primarily designed for 2-class classification. But they have been extended for N-class classification also based on the requirement of multiclasses in the practical applications. Although N-class classification using SVM has considerable research attention, getting minimum number of classifiers at the time of training and testing is still a continuing research. We propose a new algorithm CBTS-SVM (Centroid based Binary Tree Structured SVM) which addresses this issue. In this we build a binary tree of SVM models based on the similarity of the class labels by finding their distance from the corresponding centroids at the root level. The experimental results demonstrates the comparable accuracy for CBTS with OVO with reasonable gamma and cost values. On the other hand when CBTS is compared with OVA, it gives the better accuracy with reduced training time and testing time. Furthermore CBTS is also scalable as it is able to handle the large data sets.
Tempo: Robust and Self-Tuning Resource Management in Multi-tenant Parallel Databases
Venue: arXiv cs.DB 2015
Year: 2015

Multi-tenant database systems have a component called the Resource Manager, or RM that is responsible for allocating resources to tenants. RMs today do not provide direct support for performance objectives such as: "Average job response time of tenant A must be less than two minutes", or "No more than 5% of tenant B's jobs can miss the deadline of 1 hour." Thus, DBAs have to tinker with the RM's low-level configuration settings to meet such objectives. We propose a framework called Tempo that brings simplicity, self-tuning, and robustness to existing RMs. Tempo provides a simple interface for DBAs to specify performance objectives declaratively, and optimizes the RM configuration settings to meet these objectives. Tempo has a solid theoretical foundation which gives key robustness guarantees. We report experiments done on Tempo using production traces of data-processing workloads from companies such as Facebook and Cloudera. These experiments demonstrate significant improvements in meeting desired performance objectives over RM configuration settings specified by human experts.
Creation and Evaluation of Software Teams - A Social Approach
Venue: arXiv cs.CY 2015
Year: 2015

This work discusses an important issue in the area of human resource management by proposing a novel model for creation and evaluation of software teams. The model consists of several assessments, including a technical test, a quality of life test and a psychological-sociological test. Since the technical test requires particular organizational specifications and cannot be examined without reference to a specific company, only the sociological test and the quality of life tests are extensively discussed in this work. Two strategies are discussed for assigning roles in a project. Initially, six software projects were selected, and after extensive analysis of the projects, two projects were chosen and correctives actions were applied. An empirical evaluation was also conducted to assess the model effectiveness. The experimental results demonstrate that the application of the model improved the productivity of project teams.
Introduction of the Residue Number Arithmetic Logic Unit With Brief Computational Complexity Analysis
Venue: arXiv cs.OH 2015
Year: 2015

Digital System Research has pioneered the mathematics and design for a new class of computing machine using residue numbers. Unlike prior art, the new breakthrough provides methods and apparatus for general purpose computation using several new residue based fractional representations. The result is that fractional arithmetic may be performed without carry. Additionally, fractional operations such as addition, subtraction and multiplication of a fraction by an integer occur in a single clock period, regardless of word size. Fractional multiplication is of the order O(p), where p equals the number of residues. More significantly, complex operations, such as sum of products, may be performed in an extended format, where fractional products are performed and summed using single clock instructions, regardless of word width, and where a normalization operation with an execution time of the order O(p) is performed as a final step.
Triplet Spike Time Dependent Plasticity: A floating-gate Implementation
Venue: arXiv cs.NE 2015
Year: 2015

Synapse plays an important role of learning in a neural network; the learning rules which modify the synaptic strength based on the timing difference between the pre- and post-synaptic spike occurrence is termed as Spike Time Dependent Plasticity (STDP). The most commonly used rule posits weight change based on time difference between one pre- and one post spike and is hence termed doublet STDP (DSTDP). However, D-STDP could not reproduce results of many biological experiments; a triplet STDP (T-STDP) that considers triplets of spikes as the fundamental unit has been proposed recently to explain these observations. This paper describes the compact implementation of a synapse using single floating-gate (FG) transistor that can store a weight in a nonvolatile manner and demonstrate the triplet STDP (T-STDP) learning rule by modifying drain voltages according to triplets of spikes. We describe a mathematical procedure to obtain control voltages for the FG device for T-STDP and also show measurement results from a FG synapse fabricated in TSMC 0.35um CMOS process to support the theory. Possible VLSI implementation of drain voltage waveform generator circuits are also presented with simulation results.
A Study on Artificial Intelligence IQ and Standard Intelligent Model
Venue: arXiv cs.AI 2015
Year: 2015

Currently, potential threats of artificial intelligence (AI) to human have triggered a large controversy in society, behind which, the nature of the issue is whether the artificial intelligence (AI) system can be evaluated quantitatively. This article analyzes and evaluates the challenges that the AI development level is facing, and proposes that the evaluation methods for the human intelligence test and the AI system are not uniform; and the key reason for which is that none of the models can uniformly describe the AI system and the beings like human. Aiming at this problem, a standard intelligent system model is established in this study to describe the AI system and the beings like human uniformly. Based on the model, the article makes an abstract mathematical description, and builds the standard intelligent machine mathematical model; expands the Von Neumann architecture and proposes the Liufeng - Shiyong architecture; gives the definition of the artificial intelligence IQ, and establishes the artificial intelligence scale and the evaluation method; conduct the test on 50 search engines and three human subjects at different ages across the world, and finally obtains the ranking of the absolute IQ and deviation IQ ranking for artificial intelligence IQ 2014.
Simulations for Validation of Vision Systems
Venue: arXiv cs.CV 2015
Year: 2015

As the computer vision matures into a systems science and engineering discipline, there is a trend in leveraging latest advances in computer graphics simulations for performance evaluation, learning, and inference. However, there is an open question on the utility of graphics simulations for vision with apparently contradicting views in the literature. In this paper, we place the results from the recent literature in the context of performance characterization methodology outlined in the 90's and note that insights derived from simulations can be qualitative or quantitative depending on the degree of fidelity of models used in simulation and the nature of the question posed by the experimenter. We describe a simulation platform that incorporates latest graphics advances and use it for systematic performance characterization and trade-off analysis for vision system design. We verify the utility of the platform in a case study of validating a generative model inspired vision hypothesis, Rank-Order consistency model, in the contexts of global and local illumination changes, and bad weather, and high-frequency noise. Our approach establishes the link between alternative viewpoints, involving models with physics based semantics and signal and perturbation semantics and confirms insights in literature on robust change detection.
Approaches for Sentiment Analysis on Twitter: A State-of-Art study
Venue: arXiv cs.SI 2015
Year: 2015

Microbloging is an extremely prevalent broadcast medium amidst the Internet fraternity these days. People share their opinions and sentiments about variety of subjects like products, news, institutions, etc., every day on microbloging websites. Sentiment analysis plays a key role in prediction systems, opinion mining systems, etc. Twitter, one of the microbloging platforms allows a limit of 140 characters to its users. This restriction stimulates users to be very concise about their opinion and twitter an ocean of sentiments to analyze. Twitter also provides developer friendly streaming API for data retrieval purpose allowing the analyst to search real time tweets from various users. In this paper, we discuss the state-of-art of the works which are focused on Twitter, the online social network platform, for sentiment analysis. We survey various lexical, machine learning and hybrid approaches for sentiment analysis on Twitter.
MXNet: A Flexible and Efficient Machine Learning Library for Heterogeneous Distributed Systems
Venue: arXiv cs.DC 2015
Year: 2015

MXNet is a multi-language machine learning (ML) library to ease the development of ML algorithms, especially for deep neural networks. Embedded in the host language, it blends declarative symbolic expression with imperative tensor computation. It offers auto differentiation to derive gradients. MXNet is computation and memory efficient and runs on various heterogeneous systems, ranging from mobile devices to distributed GPU clusters. This paper describes both the API design and the system implementation of MXNet, and explains how embedding of both symbolic expression and tensor operation is handled in a unified fashion. Our preliminary experiments reveal promising results on large scale deep neural network applications using multiple GPU machines.
Distributed robust estimation over randomly switching networks using $H_\infty$ consensus
Venue: arXiv cs.SY 2015
Year: 2015

The paper considers a distributed robust estimation problem over a network with Markovian randomly varying topology. The objective is to deal with network variations locally, by switching observer gains at affected nodes only. We propose sufficient conditions which guarantee a suboptimal $H_\infty$ level of relative disagreement of estimates in such observer networks. When the status of the network is known globally, these sufficient conditions enable the network gains to be computed by solving certain LMIs. When the nodes are to rely on a locally available information about the network topology, additional rank constraints are used to condition the gains, given this information. The results are complemented by necessary conditions which relate properties of the interconnection graph Laplacian to the mean-square detectability of the plant through measurement and interconnection channels.
On the possible values of the entropy of undirected graphs
Venue: arXiv cs.IT 2015
Year: 2015

The entropy of a digraph is a fundamental measure which relates network coding, information theory, and fixed points of finite dynamical systems. In this paper, we focus on the entropy of undirected graphs. We prove that for any integer $k$ the number of possible values of the entropy of an undirected graph up to $k$ is finite. We also determine all the possible values for the entropy of an undirected graph up to the value of four.
Sublabel-Accurate Relaxation of Nonconvex Energies
Venue: arXiv cs.CV 2015
Year: 2015

We propose a novel spatially continuous framework for convex relaxations based on functional lifting. Our method can be interpreted as a sublabel-accurate solution to multilabel problems. We show that previously proposed functional lifting methods optimize an energy which is linear between two labels and hence require (often infinitely) many labels for a faithful approximation. In contrast, the proposed formulation is based on a piecewise convex approximation and therefore needs far fewer labels. In comparison to recent MRF-based approaches, our method is formulated in a spatially continuous setting and shows less grid bias. Moreover, in a local sense, our formulation is the tightest possible convex relaxation. It is easy to implement and allows an efficient primal-dual optimization on GPUs. We show the effectiveness of our approach on several computer vision problems.
Exact Algorithms via Monotone Local Search
Venue: arXiv cs.DS 2015
Year: 2015

We give a new general approach for designing exact exponential-time algorithms for subset problems. In a subset problem the input implicitly describes a family of sets over a universe of size n and the task is to determine whether the family contains at least one set. Our approach is based on "monotone local search", where the goal is to extend a partial solution to a solution by adding as few elements as possible. More formally, in the extension problem we are also given as input a subset X of the universe and an integer k. The task is to determine whether one can add at most k elements to X to obtain a set in the (implicitly defined) family. Our main result is that an O*(c^k) time algorithm for the extension problem immediately yields a randomized algorithm for finding a solution of any size with running time O*((2-1/c)^n). In many cases, the extension problem can be reduced to simply finding a solution of size at most k. Furthermore, efficient algorithms for finding small solutions have been extensively studied in the field of parameterized algorithms. Directly applying these algorithms, our theorem yields in one stroke significant improvements over the best known exponential-time algorithms for several well-studied problems, including d-Hitting Set, Feedback Vertex Set, Node Unique Label Cover, and Weighted d-SAT. Our results demonstrate an interesting and very concrete connection between parameterized algorithms and exact exponential-time algorithms. We also show how to derandomize our algorithms at the cost of a subexponential multiplicative factor in the running time. Our derandomization is based on an efficient construction of a new pseudo-random object that might be of independent interest. Finally, we extend our methods to establish new combinatorial upper bounds and develop enumeration algorithms.
Coded MapReduce
Venue: arXiv cs.DC 2015
Year: 2015

MapReduce is a commonly used framework for executing data-intensive jobs on distributed server clusters. We introduce a variant implementation of MapReduce, namely "Coded MapReduce", to substantially reduce the inter-server communication load for the shuffling phase of MapReduce, and thus accelerating its execution. The proposed Coded MapReduce exploits the repetitive mapping of data blocks at different servers to create coding opportunities in the shuffling phase to exchange (key,value) pairs among servers much more efficiently. We demonstrate that Coded MapReduce can cut down the total inter-server communication load by a multiplicative factor that grows linearly with the number of servers in the system and it achieves the minimum communication load within a constant multiplicative factor. We also analyze the tradeoff between the "computation load" and the "communication load" of Coded MapReduce.
Similarity Learning via Adaptive Regression and Its Application to Image Retrieval
Venue: arXiv cs.LG 2015
Year: 2015

We study the problem of similarity learning and its application to image retrieval with large-scale data. The similarity between pairs of images can be measured by the distances between their high dimensional representations, and the problem of learning the appropriate similarity is often addressed by distance metric learning. However, distance metric learning requires the learned metric to be a PSD matrix, which is computational expensive and not necessary for retrieval ranking problem. On the other hand, the bilinear model is shown to be more flexible for large-scale image retrieval task, hence, we adopt it to learn a matrix for estimating pairwise similarities under the regression framework. By adaptively updating the target matrix in regression, we can mimic the hinge loss, which is more appropriate for similarity learning problem. Although the regression problem can have the closed-form solution, the computational cost can be very expensive. The computational challenges come from two aspects: the number of images can be very large and image features have high dimensionality. We address the first challenge by compressing the data by a randomized algorithm with the theoretical guarantee. For the high dimensional issue, we address it by taking low rank assumption and applying alternating method to obtain the partial matrix, which has a global optimal solution. Empirical studies on real world image datasets (i.e., Caltech and ImageNet) demonstrate the effectiveness and efficiency of the proposed method.
Security Risks in Mechanical Engineering Industries
Venue: arXiv cs.CR 2015
Year: 2015

Inherent in any organization are security risks and barriers that must be understood, analyzed, and minimized in order to prepare for and perpetuate future growth and return on investment within the business. Likewise, company leaders must determine the security health of the organization and routinely review the potential threats that are ever changing in this new global economy. Once these risks are outlined, the cost and potential damage must be weighed before action is implemented. This paper will address the modern problems of securing information technology (IT) of a mechanical engineering enterprise, which can be applied to other modern industries.