OpenRaiser/Intern-Atlas huggingface dataset:
In-memory computing on a photonic platform
Venue: arXiv cs.ET 2018
Year: 2018

Collocated data processing and storage are the norm in biological systems. Indeed, the von Neumann computing architecture, that physically and temporally separates processing and memory, was born more of pragmatism based on available technology. As our ability to create better hardware improves, new computational paradigms are being explored. Integrated photonic circuits are regarded as an attractive solution for on-chip computing using only light, leveraging the increased speed and bandwidth potential of working in the optical domain, and importantly, removing the need for time and energy sapping electro-optical conversions. Here we show that we can combine the emerging area of integrated optics with collocated data storage and processing to enable all-photonic in-memory computations. By employing non-volatile photonic elements based on the phase-change material, Ge2Sb2Te5, we are able to achieve direct scalar multiplication on single devices. Featuring a novel single-shot Write/Erase and a drift-free process, such elements can multiply two scalar numbers by mapping their values to the energy of an input pulse and to the transmittance of the device, codified in the crystallographic state of the element. The output pulse, carrying the information of the light-matter interaction, is the result of the computation. Our all-optical approach is novel, easy to fabricate and operate, and sets the stage for development of entirely photonic computers.
Continuous, Evolutionary and Large-Scale: A New Perspective for Automated Mobile App Testing
Venue: arXiv cs.SE 2018
Year: 2018

Mobile app development involves a unique set of challenges including device fragmentation and rapidly evolving platforms, making testing a difficult task. The design space for a comprehensive mobile testing strategy includes features, inputs, potential contextual app states, and large combinations of devices and underlying platforms. Therefore, automated testing is an essential activity of the development process. However, current state of the art of automated testing tools for mobile apps poses limitations that has driven a preference for manual testing in practice. As of today, there is no comprehensive automated solution for mobile testing that overcomes fundamental issues such as automated oracles, history awareness in test cases, or automated evolution of test cases. In this perspective paper we survey the current state of the art in terms of the frameworks, tools, and services available to developers to aid in mobile testing, highlighting present shortcomings. Next, we provide commentary on current key challenges that restrict the possibility of a comprehensive, effective, and practical automated testing solution. Finally, we offer our vision of a comprehensive mobile app testing framework, complete with research agenda, that is succinctly summarized along three principles: Continuous, Evolutionary and Large-scale (CEL).
Defense Against Advanced Persistent Threats in Dynamic Cloud Storage: A Colonel Blotto Game Approach
Venue: arXiv cs.CR 2018
Year: 2018

Advanced Persistent Threat (APT) attackers apply multiple sophisticated methods to continuously and stealthily steal information from the targeted cloud storage systems and can even induce the storage system to apply a specific defense strategy and attack it accordingly. In this paper, the interactions between an APT attacker and a defender allocating their Central Processing Units (CPUs) over multiple storage devices in a cloud storage system are formulated as a Colonel Blotto game. The Nash equilibria (NEs) of the CPU allocation game are derived for both symmetric and asymmetric CPUs between the APT attacker and the defender to evaluate how the limited CPU resources, the date storage size and the number of storage devices impact the expected data protection level and the utility of the cloud storage system. A CPU allocation scheme based on "hotbooting" policy hill-climbing (PHC) that exploits the experiences in similar scenarios to initialize the quality values to accelerate the learning speed is proposed for the defender to achieve the optimal APT defense performance in the dynamic game without being aware of the APT attack model and the data storage model. A hotbooting deep Q-network (DQN)-based CPU allocation scheme further improves the APT detection performance for the case with a large number of CPUs and storage devices. Simulation results show that our proposed reinforcement learning based CPU allocation can improve both the data protection level and the utility of the cloud storage system compared with the Q-learning based CPU allocation against APTs.
Deep Chain HDRI: Reconstructing a High Dynamic Range Image from a Single Low Dynamic Range Image
Venue: arXiv cs.CV 2018
Year: 2018

In this paper, we propose a novel deep neural network model that reconstructs a high dynamic range (HDR) image from a single low dynamic range (LDR) image. The proposed model is based on a convolutional neural network composed of dilated convolutional layers, and infers LDR images with various exposures and illumination from a single LDR image of the same scene. Then, the final HDR image can be formed by merging these inference results. It is relatively easy for the proposed method to find the mapping between the LDR and an HDR with a different bit depth because of the chaining structure inferring the relationship between the LDR images with brighter (or darker) exposures from a given LDR image. The method not only extends the range, but also has the advantage of restoring the light information of the actual physical world. For the HDR images obtained by the proposed method, the HDR-VDP2 Q score, which is the most popular evaluation metric for HDR images, was 56.36 for a display with a 1920$\times$1200 resolution, which is an improvement of 6 compared with the scores of conventional algorithms. In addition, when comparing the peak signal-to-noise ratio values for tone mapped HDR images generated by the proposed and conventional algorithms, the average value obtained by the proposed algorithm is 30.86 dB, which is 10 dB higher than those obtained by the conventional algorithms.
Reinforcement Learning-based Energy Trading for Microgrids
Venue: arXiv cs.SY 2018
Year: 2018

With the time-varying renewable energy generation and power demand, microgrids (MGs) exchange energy in smart grids to reduce their dependence on power plants. In this paper, we formulate an MG energy trading game, in which each MG trades energy according to the predicted renewable energy generation and local energy demand, the current battery level, and the energy trading history. The Nash quilibrium (NE) of the game is provided, revealing the conditions under which the local energy generation satisfies the energy demand of the MG and providing the performance bound of the energy trading scheme. We propose a reinforcement learning based MG energy trading scheme that applies the deep Q-network (DQN) to improve the utility of the MG for the case with a large number of the connected MGs. Simulations are performed for the MGs with wind generation that are aware of the electricity prices and the historic energy trading, showing that this scheme significantly reduces the average power plant schedules and improves the utility of the MG compared with the benchmark strategy.
BinaryRelax: A Relaxation Approach For Training Deep Neural Networks With Quantized Weights
Venue: arXiv cs.CV 2018
Year: 2018

We propose BinaryRelax, a simple two-phase algorithm, for training deep neural networks with quantized weights. The set constraint that characterizes the quantization of weights is not imposed until the late stage of training, and a sequence of \emph{pseudo} quantized weights is maintained. Specifically, we relax the hard constraint into a continuous regularizer via Moreau envelope, which turns out to be the squared Euclidean distance to the set of quantized weights. The pseudo quantized weights are obtained by linearly interpolating between the float weights and their quantizations. A continuation strategy is adopted to push the weights towards the quantized state by gradually increasing the regularization parameter. In the second phase, exact quantization scheme with a small learning rate is invoked to guarantee fully quantized weights. We test BinaryRelax on the benchmark CIFAR and ImageNet color image datasets to demonstrate the superiority of the relaxed quantization approach and the improved accuracy over the state-of-the-art training methods. Finally, we prove the convergence of BinaryRelax under an approximate orthogonality condition.
Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay Channels
Venue: arXiv cs.IT 2018
Year: 2018

Compute-and-forward relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a compute-and-forward scheme, a relay tries to decode a linear combination composed of transmitted messages from other terminals or relays. Design for error correcting codes and its decoding algorithms suitable for compute-and-forward relaying schemes are still important issue to be studied. In this paper, we will present an asymptotic performance analysis on LDPC codes over two-way relay channels based on density evolution (DE). Because of the asymmetric nature of the channel, we employ the population dynamics DE combined with DE formulas for asymmetric channels to obtain BP thresholds. In addition, we also evaluate the asymptotic performance of spatially coupled LDPC codes for two-way relay channels. The results indicate that the spatial coupling codes yield improvements in the BP threshold compared with corresponding uncoupled codes for two-way relay channels.
A Distributed Scalable Architecture using L1 Adaptive Controllers for Primary Voltage Control of DC Microgrids
Venue: arXiv cs.SY 2018
Year: 2018

This paper proposes a new distributed control architecture for distributed generation units in heterogeneous DC islanded microgrids. Each unit is equipped with state-feedback baseline and augmenting $\mathcal{L}_1$ adaptive voltage controllers at the primary level of the microgrid control hierarchy. Local controller synthesis is scalable as it only requires information about corresponding units, couplings, and at most, the addition of state-predictor measurements of neighbouring controllers. Global asymptotic stability of the microgrid is guaranteed in a plug-and-play fashion by exploiting Lyapunov functions and algebraic Riccati equations. The performance of the proposed architecture is evaluated using a heterogeneous DC islanded microgrid that consists of 6 DC-DC boost converters configured in a radial and meshed topology. The use of $\mathcal{L}_1$ adaptive controllers achieves fast and robust microgrid voltage stability in the presence of plug-and-play operations, topology changes and unknown load changes. Finally, the distributed architecture is tested on a bus-connected islanded-microgrid consisting of linear resistive load and non-linear DC motor.
What is the right addressing scheme for India?
Venue: arXiv cs.CY 2018
Year: 2018

Computer generated addresses are coming to your neighborhood because most places in the world do not have an assigned meaningful street address. In India, 80% of the addresses are written with respect to a landmark which typically lies between 50-1500 meters of the actual address; such addresses make geolocating very challenging. Accuracy in geolocation is critical for emergency services to navigate quickly to reach you and for logistics industries to improve on-time performance and efficient routing of the package coming to your house. In this paper, we explore suggested addressing schemes for India, to determine what use cases and potential technologies will have the best adoption and therefore, greatest impact.
The Bibliotelemetry of Information and Environment: an Evaluation of IoT-Powered Recommender Systems
Venue: arXiv cs.DL 2018
Year: 2018

Internet of Things (IoT) infrastructure within the physical library environment is the basis for an integrative, hybrid approach to digital resource recommenders. The IoT infrastructure provides mobile, dynamic wayfinding support for items in the collection, which includes features for location-based recommendations. A modular evaluation and analysis herein clarified the nature of users' requests for recommendations based on their location and describes subject areas of the library for which users request recommendations. The modular mobile design allowed for deep exploration of users' bibliographic identifiers throughout the global module system, serving to provide context to the browsing data that are the focus of this study. Bibliotelemetry is introduced as an evaluation method for IoT middleware within library collections.
A Collaborative Filtering Recommender System for Test Case Prioritization in Web Applications
Venue: arXiv cs.SE 2018
Year: 2018

The use of relevant metrics of software systems could improve various software engineering tasks, but identifying relationships among metrics is not simple and can be very time consuming. Recommender systems can help with this decision-making process, many applications have utilized these systems to improve the performance of their applications. To investigate the potential benefits of recommender systems in regression testing, we implemented an item-based collaborative filtering recommender system that uses user interaction data and application change history information to develop a test case prioritization technique. To evaluate our approach, we performed an empirical study using three web applications with multiple versions and compared four control techniques. Our results indicate that our recommender system can help improve the effectiveness of test prioritization.
Efficient Text Classification Using Tree-structured Multi-linear Principal Component Analysis
Venue: arXiv cs.CL 2018
Year: 2018

A novel text data dimension reduction technique, called the tree-structured multi-linear principal component anal- ysis (TMPCA), is proposed in this work. Being different from traditional text dimension reduction methods that deal with the word-level representation, the TMPCA technique reduces the dimension of input sequences and sentences to simplify the following text classification tasks. It is shown mathematically and experimentally that the TMPCA tool demands much lower complexity (and, hence, less computing power) than the ordinary principal component analysis (PCA). Furthermore, it is demon- strated by experimental results that the support vector machine (SVM) method applied to the TMPCA-processed data achieves commensurable or better performance than the state-of-the-art recurrent neural network (RNN) approach.
Machine Learning Methods for User Positioning With Uplink RSS in Distributed Massive MIMO
Venue: arXiv cs.NI 2018
Year: 2018

We consider a machine learning approach based on Gaussian process regression (GP) to position users in a distributed massive multiple-input multiple-output (MIMO) system with the uplink received signal strength (RSS) data. We focus on the scenario where noise-free RSS is available for training, but only noisy RSS is available for testing purposes. To estimate the test user locations and their 2σ error-bars, we adopt two state-of-the-art GP methods, namely, the conventional GP (CGP) and the numerical approximation GP (NaGP) methods. We find that the CGP method, which treats the noisy test RSS vectors as noise-free, provides unrealistically small 2σ error-bars on the estimated locations. To alleviate this concern, we derive the true predictive distribution for the test user locations and then employ the NaGP method to numerically approximate it as a Gaussian with the same first and second order moments. We also derive a Bayesian Cramer-Rao lower bound (BCRLB) on the achievable root- mean-squared-error (RMSE) performance of the two GP methods. Simulation studies reveal that: (i) the NaGP method indeed provides realistic 2σ error-bars on the estimated locations, (ii) operation in massive MIMO regime improves the RMSE performance, and (iii) the achieved RMSE performances are very close to the derived BCRLB.
A Deep Reinforcement Learning Chatbot (Short Version)
Venue: arXiv cs.CL 2018
Year: 2018

We present MILABOT: a deep reinforcement learning chatbot developed by the Montreal Institute for Learning Algorithms (MILA) for the Amazon Alexa Prize competition. MILABOT is capable of conversing with humans on popular small talk topics through both speech and text. The system consists of an ensemble of natural language generation and retrieval models, including neural network and template-based models. By applying reinforcement learning to crowdsourced data and real-world user interactions, the system has been trained to select an appropriate response from the models in its ensemble. The system has been evaluated through A/B testing with real-world users, where it performed significantly better than other systems. The results highlight the potential of coupling ensemble systems with deep reinforcement learning as a fruitful path for developing real-world, open-domain conversational agents.
A more reasonable proof of Cobham's theorem
Venue: arXiv cs.FL 2018
Year: 2018

We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.
Learning Light Field Reconstruction from a Single Coded Image
Venue: arXiv cs.CV 2018
Year: 2018

Light field imaging is a rich way of representing the 3D world around us. However, due to limited sensor resolution capturing light field data inherently poses spatio-angular resolution trade-off. In this paper, we propose a deep learning based solution to tackle the resolution trade-off. Specifically, we reconstruct full sensor resolution light field from a single coded image. We propose to do this in three stages 1) reconstruction of center view from the coded image 2) estimating disparity map from the coded image and center view 3) warping center view using the disparity to generate light field. We propose three neural networks for these stages. Our disparity estimation network is trained in an unsupervised manner alleviating the need for ground truth disparity. Our results demonstrate better recovery of parallax from the coded image. Also, we get better results than dictionary learning based approaches both qualitatively and quatitatively.
Knowledge Representation for High-Level Norms and Violation Inference in Logic Programming
Venue: arXiv cs.MA 2018
Year: 2018

Most of the knowledge Representation formalisms developed for representing prescriptive norms can be categorized as either suitable for representing either low level or high level norms.We argue that low level norm representations do not advance the cause of autonomy in agents in the sense that it is not the agent itself that determines the normative position it should be at a particular time, on the account of a more general rule. In other words an agent on some external system for a nitty gritty prescriptions of its obligations and prohibitions. On the other hand, high level norms which have an explicit description of a norm's precondition and have some form of implication, do not as they exist in the literature do not support generalized inferences about violation like low level norm representations do. This paper presents a logical formalism for the representation of high level norms in open societies that enable violation inferences that detail the situation in which the norm violation took place and the identity of the norm violation. Norms are formalized as logic programs whose heads specify what an agent is obliged or permitted to do when a situation arises and within what time constraint of the situation.Each norm is also assigned an identity using some reification scheme. The body of each logic program describes the nature of the situation in which the agent is expected to act or desist from acting. This kind of violation is novel in the literature.
Multi-pseudo Regularized Label for Generated Data in Person Re-Identification
Venue: arXiv cs.CV 2018
Year: 2018

Sufficient training data normally is required to train deeply learned models. However, due to the expensive manual process for labelling large number of images, the amount of available training data is always limited. To produce more data for training a deep network, Generative Adversarial Network (GAN) can be used to generate artificial sample data. However, the generated data usually does not have annotation labels. To solve this problem, in this paper, we propose a virtual label called Multi-pseudo Regularized Label (MpRL) and assign it to the generated data. With MpRL, the generated data will be used as the supplementary of real training data to train a deep neural network in a semi-supervised learning fashion. To build the corresponding relationship between the real data and generated data, MpRL assigns each generated data a proper virtual label which reflects the likelihood of the affiliation of the generated data to pre-defined training classes in the real data domain. Unlike the traditional label which usually is a single integral number, the virtual label proposed in this work is a set of weight-based values each individual of which is a number in (0,1] called multi-pseudo label and reflects the degree of relation between each generated data to every pre-defined class of real data. A comprehensive evaluation is carried out by adopting two state-of-the-art convolutional neural networks (CNNs) in our experiments to verify the effectiveness of MpRL. Experiments demonstrate that by assigning MpRL to generated data, we can further improve the person re-ID performance on five re-ID datasets, i.e., Market-1501, DukeMTMC-reID, CUHK03, VIPeR, and CUHK01. The proposed method obtains +6.29%, +6.30%, +5.58%, +5.84%, and +3.48% improvements in rank-1 accuracy over a strong CNN baseline on the five datasets respectively, and outperforms state-of-the-art methods.
Dense Recurrent Neural Networks for Scene Labeling
Venue: arXiv cs.CV 2018
Year: 2018

Recently recurrent neural networks (RNNs) have demonstrated the ability to improve scene labeling through capturing long-range dependencies among image units. In this paper, we propose dense RNNs for scene labeling by exploring various long-range semantic dependencies among image units. In comparison with existing RNN based approaches, our dense RNNs are able to capture richer contextual dependencies for each image unit via dense connections between each pair of image units, which significantly enhances their discriminative power. Besides, to select relevant and meanwhile restrain irrelevant dependencies for each unit from dense connections, we introduce an attention model into dense RNNs. The attention model enables automatically assigning more importance to helpful dependencies while less weight to unconcerned dependencies. Integrating with convolutional neural networks (CNNs), our method achieves state-of-the-art performances on the PASCAL Context, MIT ADE20K and SiftFlow benchmarks.
Dialectica Categories for the Lambek Calculus
Venue: arXiv cs.LO 2018
Year: 2018

We revisit the old work of de Paiva on the models of the Lambek Calculus in dialectica models making sure that the syntactic details that were sketchy on the first version got completed and verified. We extend the Lambek Calculus with a κmodality, inspired by Yetter's work, which makes the calculus commutative. Then we add the of-course modality !, as Girard did, to re-introduce weakening and contraction for all formulas and get back the full power of intuitionistic and classical logic. We also present the categorical semantics, proved sound and complete. Finally we show the traditional properties of type systems, like subject reduction, the Church-Rosser theorem and normalization for the calculi of extended modalities, which we did not have before.