OpenRaiser/Intern-Atlas huggingface dataset:
Synthesizing Distributed Energy Resources in Microgrids with Temporal Logic Specifications
Venue: arXiv cs.SY 2018
Year: 2018

Grid supportive (GS) modes integrated within distributed energy resources (DERs) can improve the frequency response. However, synthesis of GS modes for guaranteed performance is challenging. Moreover, a tool is needed to handle sophisticated specifications from grid codes and protection relays. This paper proposes a model predictive control (MPC)-based mode synthesis methodology, which can accommodate the temporal logic specifications (TLSs). The TLSs allow richer descriptions of control specifications addressing both magnitude and time at the same time. The proposed controller will compute a series of Boolean control signals to synthesize the GS mode of DERs by solving the MPC problem under the normal condition, where the frequency response predicted by a reduced-order model satisfies the defined specifications. Once a sizable disturbance is detected, the pre-calculated signals are applied to the DERs. The proposed synthesis methodology is verified on the full nonlinear model in Simulink. A robust factor is imposed on the specifications to compensate the response mismatch between the reduce-order model and nonlinear model so that the nonlinear response satisfies the required TLS.
N-fold Superposition: Improving Neural Networks by Reducing the Noise in Feature Maps
Venue: arXiv cs.LG 2018
Year: 2018

Considering the use of Fully Connected (FC) layer limits the performance of Convolutional Neural Networks (CNNs), this paper develops a method to improve the coupling between the convolution layer and the FC layer by reducing the noise in Feature Maps (FMs). Our approach is divided into three steps. Firstly, we separate all the FMs into n blocks equally. Then, the weighted summation of FMs at the same position in all blocks constitutes a new block of FMs. Finally, we replicate this new block into n copies and concatenate them as the input to the FC layer. This sharing of FMs could reduce the noise in them apparently and avert the impact by a particular FM on the specific part weight of hidden layers, hence preventing the network from overfitting to some extent. Using the Fermat Lemma, we prove that this method could make the global minima value range of the loss function wider, by which makes it easier for neural networks to converge and accelerates the convergence process. This method does not significantly increase the amounts of network parameters (only a few more coefficients added), and the experiments demonstrate that this method could increase the convergence speed and improve the classification performance of neural networks.
PeRView: A Framework for Personalized Review Selection Using Micro-Reviews
Venue: arXiv cs.IR 2018
Year: 2018

In the contemporary era, social media has its influence on people in making decisions. The proliferation of online reviews with diversified and verbose content often causes problems inaccurate decision making. Since online reviews have an impact on people of all walks of life while taking decisions, choosing appropriate reviews based on the podsolization consisting is very important since it relies on using such micro-reviews consistency to evaluate the review set section. Micro-reviews are very concise and directly talk about product or service instead of having unnecessary verbose content. Thus, micro-reviews can help in choosing reviews based on their personalized consistency that is related to directly or indirectly to the main profile of the reviews. Personalized reviews selection that is highly relevant with high personalized coverage in terms of matching with micro-reviews is the main problem that is considered in this paper. Furthermore, personalization with user preferences while making review selection is also considered based on the personalized users' profile. Towards this end, we proposed a framework known as PeRView for personalized review selection using micro-reviews based on the proposed evaluation metric approach which considering two main factors (personalized matching score and subset size). Personalized Review Selection Algorithm (PRSA) is proposed which makes use of multiple similarity measures merged to have highly efficient personalized reviews matching function for selection. The experimental results based on using reviews dataset which is collected from YELP.COM while micro-reviews dataset is obtained from Foursqure.COM. show that the personalized reviews selection is a very empirical case of study.
An Overview of Lead and Accompaniment Separation in Music
Venue: arXiv cs.SD 2018
Year: 2018

Popular music is often composed of an accompaniment and a lead component, the latter typically consisting of vocals. Filtering such mixtures to extract one or both components has many applications, such as automatic karaoke and remixing. This particular case of source separation yields very specific challenges and opportunities, including the particular complexity of musical structures, but also relevant prior knowledge coming from acoustics, musicology or sound engineering. Due to both its importance in applications and its challenging difficulty, lead and accompaniment separation has been a popular topic in signal processing for decades. In this article, we provide a comprehensive review of this research topic, organizing the different approaches according to whether they are model-based or data-centered. For model-based methods, we organize them according to whether they concentrate on the lead signal, the accompaniment, or both. For data-centered approaches, we discuss the particular difficulty of obtaining data for learning lead separation systems, and then review recent approaches, notably those based on deep learning. Finally, we discuss the delicate problem of evaluating the quality of music separation through adequate metrics and present the results of the largest evaluation, to-date, of lead and accompaniment separation systems. In conjunction with the above, a comprehensive list of references is provided, along with relevant pointers to available implementations and repositories.
Multi-focus Image Fusion using dictionary learning and Low-Rank Representation
Venue: arXiv cs.CV 2018
Year: 2018

Among the representation learning, the low-rank representation (LRR) is one of the hot research topics in many fields, especially in image processing and pattern recognition. Although LRR can capture the global structure, the ability of local structure preservation is limited because LRR lacks dictionary learning. In this paper, we propose a novel multi-focus image fusion method based on dictionary learning and LRR to get a better performance in both global and local structure. Firstly, the source images are divided into several patches by sliding window technique. Then, the patches are classified according to the Histogram of Oriented Gradient (HOG) features. And the sub-dictionaries of each class are learned by K-singular value decomposition (K-SVD) algorithm. Secondly, a global dictionary is constructed by combining these sub-dictionaries. Then, we use the global dictionary in LRR to obtain the LRR coefficients vector for each patch. Finally, the l_1-norm and choose-max fuse strategy for each coefficients vector is adopted to reconstruct fused image from the fused LRR coefficients and the global dictionary. Experimental results demonstrate that the proposed method can obtain state-of-the-art performance in both qualitative and quantitative evaluations compared with serval classical methods and novel methods.The Code of our fusion method is available at https://github.com/hli1221/imagefusion_dllrr
BrainSlug: Transparent Acceleration of Deep Learning Through Depth-First Parallelism
Venue: arXiv cs.DC 2018
Year: 2018

Neural network frameworks such as PyTorch and TensorFlow are the workhorses of numerous machine learning applications ranging from object recognition to machine translation. While these frameworks are versatile and straightforward to use, the training of and inference in deep neural networks is resource (energy, compute, and memory) intensive. In contrast to recent works focusing on algorithmic enhancements, we introduce BrainSlug, a framework that transparently accelerates neural network workloads by changing the default layer-by-layer processing to a depth-first approach, reducing the amount of data required by the computations and thus improving the performance of the available hardware caches. BrainSlug achieves performance improvements of up to 41.1% on CPUs and 35.7% on GPUs. These optimizations come at zero cost to the user as they do not require hardware changes and only need tiny adjustments to the software.
LightRel SemEval-2018 Task 7: Lightweight and Fast Relation Classification
Venue: arXiv cs.CL 2018
Year: 2018

We present LightRel, a lightweight and fast relation classifier. Our goal is to develop a high baseline for different relation extraction tasks. By defining only very few data-internal, word-level features and external knowledge sources in the form of word clusters and word embeddings, we train a fast and simple linear classifier.
CardKit: A Card-Based Programming Framework for Drones
Venue: arXiv cs.HC 2018
Year: 2018

Drones are being used in many industries for a variety of applications, including inspecting bridges, surveying farm land, and delivering cargo. Automating these kinds of scenarios requires more than following a sequence of GPS waypoints; they require integrating on-device hardware with real-time analysis to provide feedback and control to the drone. Currently, implementing these kinds of advanced scenarios is a complex task, requiring skilled software engineers programming with drone APIs. We envision an alternate model to enable drone operators to orchestrate advanced behaviors using a card-based approach. We describe the design of our card-based programming model, position it relative to other visual programming metaphors, share results from our paper prototype user study, and discuss our learnings from its implementation. Results suggest that a wide range of scenarios can be implemented with moderate mental effort and learning, balanced by intuitiveness and engagement.
Robust Beamforming with Pilot Reuse Scheduling in a Heterogeneous Cloud Radio Access Network
Venue: arXiv cs.IT 2018
Year: 2018

This paper considers a downlink ultra-dense heterogeneous cloud radio access network (H-CRAN) which guarantees seamless coverage and can provide high date rates. In order to reduce channel state information (CSI) feedback overhead, incomplete inter-cluster CSI is considered, i.e., each remote radio head (RRH) or macro base station (MBS) only measures the CSI from user equipments (UEs) in its serving cluster. To reduce pilot consumption, pilot reuse among UEs is assumed, resulting in imperfect intra-cluster CSI. A two-stage optimization problem is then formulated. In the first stage, a pilot scheduling algorithm is proposed to minimize the sum mean square error (MSE) of all channel estimates. Specifically, the minimum number of required pilots along with a feasible pilot allocation solution are first determined by applying the Dsatur algorithm, and adjustments based on the defined level of pilot contamination are then carried out for further improvement. Based on the pilot allocation result obtained in the first stage, the second stage aims to maximize the sum spectral efficiency (SE) of the network by optimizing the beam-vectors. Due to incomplete inter-cluster CSI and imperfect intra-cluster CSI, an explicit expression of each UE's achievable rate is unavailable. Hence, a lower bound on the achievable rate is derived based on Jensen's inequality, and an alternative robust transmission design (RTD) algorithm along with its distributed realization are then proposed to maximize the derived tight lower bound. Simulation results show that compared with existing algorithms, the system performance can be greatly improved by the proposed algorithms in terms of both sum MSE and sum SE.
Beyond Narrative Description: Generating Poetry from Images by Multi-Adversarial Training
Venue: arXiv cs.CV 2018
Year: 2018

Automatic generation of natural language from images has attracted extensive attention. In this paper, we take one step further to investigate generation of poetic language (with multiple lines) to an image for automatic poetry creation. This task involves multiple challenges, including discovering poetic clues from the image (e.g., hope from green), and generating poems to satisfy both relevance to the image and poeticness in language level. To solve the above challenges, we formulate the task of poem generation into two correlated sub-tasks by multi-adversarial training via policy gradient, through which the cross-modal relevance and poetic language style can be ensured. To extract poetic clues from images, we propose to learn a deep coupled visual-poetic embedding, in which the poetic representation from objects, sentiments and scenes in an image can be jointly learned. Two discriminative networks are further introduced to guide the poem generation, including a multi-modal discriminator and a poem-style discriminator. To facilitate the research, we have released two poem datasets by human annotators with two distinct properties: 1) the first human annotated image-to-poem pair dataset (with 8,292 pairs in total), and 2) to-date the largest public English poem corpus dataset (with 92,265 different poems in total). Extensive experiments are conducted with 8K images, among which 1.5K image are randomly picked for evaluation. Both objective and subjective evaluations show the superior performances against the state-of-the-art methods for poem generation from images. Turing test carried out with over 500 human subjects, among which 30 evaluators are poetry experts, demonstrates the effectiveness of our approach.
Eigenvector Computation and Community Detection in Asynchronous Gossip Models
Venue: arXiv cs.DC 2018
Year: 2018

We give a simple distributed algorithm for computing adjacency matrix eigenvectors for the communication graph in an asynchronous gossip model. We show how to use this algorithm to give state-of-the-art asynchronous community detection algorithms when the communication graph is drawn from the well-studied stochastic block model. Our methods also apply to a natural alternative model of randomized communication, where nodes within a community communicate more frequently than nodes in different communities. Our analysis simplifies and generalizes prior work by forging a connection between asynchronous eigenvector computation and Oja's algorithm for streaming principal component analysis. We hope that our work serves as a starting point for building further connections between the analysis of stochastic iterative methods, like Oja's algorithm, and work on asynchronous and gossip-type algorithms for distributed computation.
Keys in the Clouds: Auditable Multi-device Access to Cryptographic Credentials
Venue: arXiv cs.CR 2018
Year: 2018

Personal cryptographic keys are the foundation of many secure services, but storing these keys securely is a challenge, especially if they are used from multiple devices. Storing keys in a centralized location, like an Internet-accessible server, raises serious security concerns (e.g. server compromise). Hardware-based Trusted Execution Environments (TEEs) are a well-known solution for protecting sensitive data in untrusted environments, and are now becoming available on commodity server platforms. Although the idea of protecting keys using a server-side TEE is straight-forward, in this paper we validate this approach and show that it enables new desirable functionality. We describe the design, implementation, and evaluation of a TEE-based Cloud Key Store (CKS), an online service for securely generating, storing, and using personal cryptographic keys. Using remote attestation, users receive strong assurance about the behaviour of the CKS, and can authenticate themselves using passwords while avoiding typical risks of password-based authentication like password theft or phishing. In addition, this design allows users to i) define policy-based access controls for keys; ii) delegate keys to other CKS users for a specified time and/or a limited number of uses; and iii) audit all key usages via a secure audit log. We have implemented a proof of concept CKS using Intel SGX and integrated this into GnuPG on Linux and OpenKeychain on Android. Our CKS implementation performs approximately 6,000 signature operations per second on a single desktop PC. The latency is in the same order of magnitude as using locally-stored keys, and 20x faster than smart cards.
Light-weight Head Pose Invariant Gaze Tracking
Venue: arXiv cs.CV 2018
Year: 2018

Unconstrained remote gaze tracking using off-the-shelf cameras is a challenging problem. Recently, promising algorithms for appearance-based gaze estimation using convolutional neural networks (CNN) have been proposed. Improving their robustness to various confounding factors including variable head pose, subject identity, illumination and image quality remain open problems. In this work, we study the effect of variable head pose on machine learning regressors trained to estimate gaze direction. We propose a novel branched CNN architecture that improves the robustness of gaze classifiers to variable head pose, without increasing computational cost. We also present various procedures to effectively train our gaze network including transfer learning from the more closely related task of object viewpoint estimation and from a large high-fidelity synthetic gaze dataset, which enable our ten times faster gaze network to achieve competitive accuracy to its current state-of-the-art direct competitor.
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture
Venue: arXiv cs.CC 2018
Year: 2018

Dinur, Khot, Kindler, Minzer and Safra (2016) recently showed that the (imperfect completeness variant of) Khot's 2 to 2 games conjecture follows from a combinatorial hypothesis about the soundness of a certain "Grassmanian agreement tester". In this work, we show that the hypothesis of Dinur et. al. follows from a conjecture we call the "Inverse Shortcode Hypothesis" characterizing the non-expanding sets of the degree-two shortcode graph. We also show the latter conjecture is equivalent to a characterization of the non-expanding sets in the Grassman graph, as hypothesized by a follow-up paper of Dinur et. al. (2017). Following our work, Khot, Minzer and Safra (2018) proved the "Inverse Shortcode Hypothesis". Combining their proof with our result and the reduction of Dinur et. al. (2016), completes the proof of the 2 to 2 conjecture with imperfect completeness. Moreover, we believe that the shortcode graph provides a useful view of both the hypothesis and the reduction, and might be useful in extending it further.
Gradient Aware - Shrinking Domain based Control Design for Reactive Planning Frameworks used in Autonomous Vehicles
Venue: arXiv cs.RO 2018
Year: 2018

In this paper, we present a novel control law for longitudinal speed control of autonomous vehicles. The key contributions of the proposed work include the design of a control law that reactively integrates the longitudinal surface gradient of road into its operation. In contrast to the existing works, we found that integrating the path gradient into the control framework improves the speed tracking efficacy. Since the control law is implemented over a shrinking domain scheme, it minimizes the integrated error by recomputing the control inputs at every discretized step and consequently provides less reaction time. This makes our control law suitable for motion planning frameworks that are operating at high frequencies. Furthermore, our work is implemented using a generalized vehicle model and can be easily extended to other classes of vehicles. The performance of gradient aware-shrinking domain based controller is implemented and tested on a stock electric vehicle on which a number of sensors are mounted. Results from the tests show the robustness of our control law for speed tracking on a terrain with varying gradient while also considering stringent time constraints imposed by the planning framework.
How to Realize a Graph on Random Points
Venue: arXiv cs.DM 2018
Year: 2018

We are given an integer $d$, a graph $G=(V,E)$, and a uniformly random embedding $f : V \rightarrow \{0,1\}^d$ of the vertices. We are interested in the probability that $G$ can be "realized" by a scaled Euclidean norm on $\mathbb{R}^d$, in the sense that there exists a non-negative scaling $w \in \mathbb{R}^d$ and a real threshold $θ> 0$ so that \[ (u,v) \in E \qquad \text{if and only if} \qquad \Vert f(u) - f(v) \Vert_w^2 < θ\,, \] where $\| x \|_w^2 = \sum_i w_i x_i^2$. These constraints are similar to those found in the Euclidean minimum spanning tree (EMST) realization problem. A crucial difference is that the realization map is (partially) determined by the random variable $f$. In this paper, we consider embeddings $f : V \rightarrow \{ x, y\}^d$ for arbitrary $x, y \in \mathbb{R}$. We prove that arbitrary trees can be realized with high probability when $d = Ω(n \log n)$. We prove an analogous result for graphs parametrized by the arboricity: specifically, we show that an arbitrary graph $G$ with arboricity $a$ can be realized with high probability when $d = Ω(n a^2 \log n)$. Additionally, if $r$ is the minimum effective resistance of the edges, $G$ can be realized with high probability when $d=Ω\left((n/r^2)\log n\right)$. Next, we show that it is necessary to have $d \geq \binom{n}{2}/6$ to realize random graphs, or $d \geq n/2$ to realize random spanning trees of the complete graph. This is true even if we permit an arbitrary embedding $f : V \rightarrow \{ x, y\}^d$ for any $x, y \in \mathbb{R}$ or negative weights. Along the way, we prove a probabilistic analog of Radon's theorem for convex sets in $\{0,1\}^d$. Our tree-realization result can complement existing results on statistical inference for gene expression data which involves realizing a tree, such as [GJP15].
All-Optical Machine Learning Using Diffractive Deep Neural Networks
Venue: arXiv cs.NE 2018
Year: 2018

We introduce an all-optical Diffractive Deep Neural Network (D2NN) architecture that can learn to implement various functions after deep learning-based design of passive diffractive layers that work collectively. We experimentally demonstrated the success of this framework by creating 3D-printed D2NNs that learned to implement handwritten digit classification and the function of an imaging lens at terahertz spectrum. With the existing plethora of 3D-printing and other lithographic fabrication methods as well as spatial-light-modulators, this all-optical deep learning framework can perform, at the speed of light, various complex functions that computer-based neural networks can implement, and will find applications in all-optical image analysis, feature detection and object classification, also enabling new camera designs and optical components that can learn to perform unique tasks using D2NNs.
"It was Colonel Mustard in the Study with the Candlestick": Using Artifacts to Create An Alternate Reality Game-The Unworkshop
Venue: arXiv cs.HC 2018
Year: 2018

Workshops are used for academic social networking, but connections can be superficial and result in few enduring collaborations. This unworkshop offers a novel interactive format to create deep connections, peer- learning, and produces a technology-enhanced experience. Participants will generate interactive technological artifacts before the unworkshop, which will be used together and orchestrated at the unworkshop to engage all participants in an alternate reality game set in local places at the conference.