OpenRaiser/Intern-Atlas huggingface dataset:
Studying the Impact of Power Capping on MapReduce-based, Data-intensive Mini-applications on Intel KNL and KNM Architectures
Venue: arXiv cs.DC 2019
Year: 2019

In this poster, we quantitatively measure the impacts of data movement on performance in MapReduce-based applications when executed on HPC systems. We leverage the PAPI 'powercap' component to identify ideal conditions for execution of our applications in terms of (1) dataset characteristics (i.e., unique words); (2) HPC system (i.e., KNL and KNM); and (3) implementation of the MapReduce programming model (i.e., with or without combiner optimizations). Results confirm the high energy and runtime costs of data movement, and the benefits of the combiner optimization on these costs.
Finite Time Encryption Schedule in the Presence of an Eavesdropper with Operation Cost
Venue: arXiv cs.SY 2019
Year: 2019

In this paper, we consider a remote state estimation problem in the presence of an eavesdropper. A smart sensor takes measurement of a discrete linear time-invariant (LTI) process and sends its local state estimate through a wireless network to a remote estimator. An eavesdropper can overhear the sensor transmissions with a certain probability. To enhance the system privacy level, we propose a novel encryption strategy to minimize a linear combination of the expected error covariance at the remote estimator and the negative of the expected error covariance at the eavesdropper, taking into account the cost of the encryption process. We prove the existence of an optimal deterministic and Markovian policy for such an encryption strategy over a finite time horizon. Two situations, namely, with or without knowledge of the eavesdropper estimation error covariance are studied and the optimal schedule is shown to satisfy the threshold-like structure in both cases. Numerical examples are given to illustrate the results.
SymInfer: Inferring Program Invariants using Symbolic States
Venue: arXiv cs.SE 2019
Year: 2019

We introduce a new technique for inferring program invariants that uses symbolic states generated by symbolic execution. Symbolic states, which consist of path conditions and constraints on local variables, are a compact description of sets of concrete program states and they can be used for both invariant inference and invariant verification. Our technique uses a counterexample-based algorithm that creates concrete states from symbolic states, infers candidate invariants from concrete states, and then verifies or refutes candidate invariants using symbolic states. The refutation case produces concrete counterexamples that prevent spurious results and allow the technique to obtain more precise invariants. This process stops when the algorithm reaches a stable set of invariants. We present SymInfer, a tool that implements these ideas to automatically generate invariants at arbitrary locations in a Java program. The tool obtains symbolic states from Symbolic PathFinder and uses existing algorithms to infer complex (potentially nonlinear) numerical invariants. Our preliminary results show that SymInfer is effective in using symbolic states to generate precise and useful invariants for proving program safety and analyzing program runtime complexity. We also show that SymInfer outperforms existing invariant generation systems.
How to pick the domain randomization parameters for sim-to-real transfer of reinforcement learning policies?
Venue: arXiv cs.LG 2019
Year: 2019

Recently, reinforcement learning (RL) algorithms have demonstrated remarkable success in learning complicated behaviors from minimally processed input. However, most of this success is limited to simulation. While there are promising successes in applying RL algorithms directly on real systems, their performance on more complex systems remains bottle-necked by the relative data inefficiency of RL algorithms. Domain randomization is a promising direction of research that has demonstrated impressive results using RL algorithms to control real robots. At a high level, domain randomization works by training a policy on a distribution of environmental conditions in simulation. If the environments are diverse enough, then the policy trained on this distribution will plausibly generalize to the real world. A human-specified design choice in domain randomization is the form and parameters of the distribution of simulated environments. It is unclear how to the best pick the form and parameters of this distribution and prior work uses hand-tuned distributions. This extended abstract demonstrates that the choice of the distribution plays a major role in the performance of the trained policies in the real world and that the parameter of this distribution can be optimized to maximize the performance of the trained policies in the real world
Analysis of distracted pedestrians' waiting time: Head-Mounted Immersive Virtual Reality application
Venue: arXiv cs.HC 2019
Year: 2019

This paper analyzes the distracted pedestrians' waiting time before crossing the road in three conditions: 1) not distracted, 2) distracted with a smartphone and 3) distracted with a smartphone in the presence of virtual flashing LED lights on the crosswalk as a safety measure. For the means of data collection, we adapted an in-house developed virtual immersive reality environment (VIRE). A total of 42 volunteers participated in the experiment. Participants' positions and head movements were recorded and used to calculate walking speeds, acceleration and deceleration rates, surrogate safety measures, time spent playing smartphone game, etc. After a descriptive analysis on the data, the effects of these variables on pedestrians' waiting time are analyzed by employing a cox proportional hazard model. Several factors were identified as having impact on waiting time. The results show that an increase in initial walk speed, percentage of time the head was oriented toward smartphone during crossing, bigger minimum missed gaps and unsafe crossings resulted in shorter waiting times. On the other hand, an increase in the percentage of time the head was oriented toward smartphone during waiting time, crossing time and maze solving time, means longer waiting times for participants.
FastFCN: Rethinking Dilated Convolution in the Backbone for Semantic Segmentation
Venue: arXiv cs.CV 2019
Year: 2019

Modern approaches for semantic segmentation usually employ dilated convolutions in the backbone to extract high-resolution feature maps, which brings heavy computation complexity and memory footprint. To replace the time and memory consuming dilated convolutions, we propose a novel joint upsampling module named Joint Pyramid Upsampling (JPU) by formulating the task of extracting high-resolution feature maps into a joint upsampling problem. With the proposed JPU, our method reduces the computation complexity by more than three times without performance loss. Experiments show that JPU is superior to other upsampling modules, which can be plugged into many existing approaches to reduce computation complexity and improve performance. By replacing dilated convolutions with the proposed JPU module, our method achieves the state-of-the-art performance in Pascal Context dataset (mIoU of 53.13%) and ADE20K dataset (final score of 0.5584) while running 3 times faster.
Knowledge Management in Medium-Sized Software Consulting Companies: An investigation of Intranet-based Knowledge Management Tools for Knowledge Cartography and Knowledge Repositories for Learning Software Organisations
Venue: arXiv cs.SE 2019
Year: 2019

Companies that develop software have a pressure from customers to deliver better solutions, and to deliver solutions faster and cheaper. Many researchers have worked with suggestions on how to improve the development process; software process improvement. As software development is a very knowledge intensive task, both researchers and industry have recently turned their attention to knowledge management as a means to improve software development. This often involves developing technical tools, which many companies have spent resources on. But the tools are often not used in practise by developers and managers in the companies, and it is often unknown if the tools improve how knowledge is managed. In order to build efficient knowledge management tools, we need a better understanding of how the tools that exist are applied and used in software development. We present and analyse eight case studies of knowledge management initiatives from the literature. We found evidence of improved software quality, reduced development costs and evidence of a better working environment for developers as a result of these initiatives. Further, we examine success criteria in knowledge management codification initiatives, based on Intranet tools in medium-sized software companies. In addition, we investigate how knowledge management tools are used for different purposes by different groups of users in two software consulting companies. They use tools both as support for personalization and codification strategies. The consulting companies are two medium-sized Norwegian companies with 40 and 150 employees, which work in development projects that lasts from a few weeks to several years.
Analysis and Extension of the Evidential Reasoning Algorithm for Multiple Attribute Decision Analysis with Uncertainty
Venue: arXiv cs.AI 2019
Year: 2019

In multiple attribute decision analysis (MADA) problems, one often needs to deal with assessment information with uncertainty. The evidential reasoning approach is one of the most effective methods to deal with such MADA problems. As kernel of the evidential reasoning approach, an original evidential reasoning (ER) algorithm was firstly proposed by Yang et al, and later they modified the ER algorithm in order to satisfy the proposed four synthesis axioms with which a rational aggregation process needs to satisfy. However, up to present, the essential difference of the two ER algorithms as well as the rationality of the synthesis axioms are still unclear. In this paper, we analyze the ER algorithms in Dempster-Shafer theory (DST) framework and prove that the original ER algorithm follows the reliability discounting and combination scheme, while the modified one follows the importance discounting and combination scheme. Further we reveal that the four synthesis axioms are not valid criteria to check the rationality of one attribute aggregation algorithm. Based on these new findings, an extended ER algorithm is proposed to take into account both the reliability and importance of different attributes, which provides a more general attribute aggregation scheme for MADA with uncertainty. A motorcycle performance assessment problem is examined to illustrate the proposed algorithm.
Probabilistic Analysis of Facility Location on Random Shortest Path Metrics
Venue: arXiv cs.DS 2019
Year: 2019

The facility location problem is an NP-hard optimization problem. Therefore, approximation algorithms are often used to solve large instances. Such algorithms often perform much better than worst-case analysis suggests. Therefore, probabilistic analysis is a widely used tool to analyze such algorithms. Most research on probabilistic analysis of NP-hard optimization problems involving metric spaces, such as the facility location problem, has been focused on Euclidean instances, and also instances with independent (random) edge lengths, which are non-metric, have been researched. We would like to extend this knowledge to other, more general, metrics. We investigate the facility location problem using random shortest path metrics. We analyze some probabilistic properties for a simple greedy heuristic which gives a solution to the facility location problem: opening the $κ$ cheapest facilities (with $κ$ only depending on the facility opening costs). If the facility opening costs are such that $κ$ is not too large, then we show that this heuristic is asymptotically optimal. On the other hand, for large values of $κ$, the analysis becomes more difficult, and we provide a closed-form expression as upper bound for the expected approximation ratio. In the special case where all facility opening costs are equal this closed-form expression reduces to $O(\sqrt[4]{\ln(n)})$ or $O(1)$ or even $1+o(1)$ if the opening costs are sufficiently small.
Sentiment Analysis on IMDB Movie Comments and Twitter Data by Machine Learning and Vector Space Techniques
Venue: arXiv cs.IR 2019
Year: 2019

This study's goal is to create a model of sentiment analysis on a 2000 rows IMDB movie comments and 3200 Twitter data by using machine learning and vector space techniques; positive or negative preliminary information about the text is to provide. In the study, a vector space was created in the KNIME Analytics platform, and a classification study was performed on this vector space by Decision Trees, Naïve Bayes and Support Vector Machines classification algorithms. The conclusions obtained were compared in terms of each algorithms. The classification results for IMDB movie comments are obtained as 94,00%, 73,20%, and 85,50% by Decision Tree, Naive Bayes and SVM algorithms. The classification results for Twitter data set are presented as 82,76%, 75,44% and 72,50% by Decision Tree, Naive Bayes SVM algorithms as well. It is seen that the best classification results presented in both data sets are which calculated by SVM algorithm.
A gradual approach for maximising user conversion without compromising experience with high visual intensity website elements
Venue: arXiv cs.HC 2019
Year: 2019

The study develops and tests a method that can gradually find a sweet spot between user experience and visual intensity of website elements to maximise user conversion with minimal adverse effect. In the first phase of the study, we develop the method. In the second stage, we test and evaluate the method via an empirical study; also, an experiment was conducted within web interface with the gradual intensity of visual elements.The findings reveal that negative response grows faster than conversion when the visual intensity of the web interface is increased. However, a saturation point, where there is coexistence between maximum conversion and minimum negative response, can be found. The findings imply that efforts to attract user attention should be pursued with increased caution and that a gradual approach presented in this study helps in finding a site-specific sweet-spot for a level of visual intensity by incrementally adjusting the elements of the interface and tracking the changes in user behaviour. Web marketing and advertising professionals often face the dilemma of determining the optimal level of visual intensity of interface element. Excessive use of marketing component and attention-grabbing visual elements can lead to an inferior user experience and consequent user churn due to growing intrusiveness. At the same time, too little visual intensity can fail to steer users. The present study provides a gradual approach which aids in finding a balance between user experience and visual intensity, maximising user conversion and thus providing a practical solution for the problem.
Novel Artificial Human Optimization Field Algorithms - The Beginning
Venue: arXiv cs.NE 2019
Year: 2019

New Artificial Human Optimization (AHO) Field Algorithms can be created from scratch or by adding the concept of Artificial Humans into other existing Optimization Algorithms. Particle Swarm Optimization (PSO) has been very popular for solving complex optimization problems due to its simplicity. In this work, new Artificial Human Optimization Field Algorithms are created by modifying existing PSO algorithms with AHO Field Concepts. These Hybrid PSO Algorithms comes under PSO Field as well as AHO Field. There are Hybrid PSO research articles based on Human Behavior, Human Cognition and Human Thinking etc. But there are no Hybrid PSO articles which based on concepts like Human Disease, Human Kindness and Human Relaxation. This paper proposes new AHO Field algorithms based on these research gaps. Some existing Hybrid PSO algorithms are given a new name in this work so that it will be easy for future AHO researchers to find these novel Artificial Human Optimization Field Algorithms. A total of 6 Artificial Human Optimization Field algorithms titled "Human Safety Particle Swarm Optimization (HuSaPSO)", "Human Kindness Particle Swarm Optimization (HKPSO)", "Human Relaxation Particle Swarm Optimization (HRPSO)", "Multiple Strategy Human Particle Swarm Optimization (MSHPSO)", "Human Thinking Particle Swarm Optimization (HTPSO)" and "Human Disease Particle Swarm Optimization (HDPSO)" are tested by applying these novel algorithms on Ackley, Beale, Bohachevsky, Booth and Three-Hump Camel Benchmark Functions. Results obtained are compared with PSO algorithm.
The Virtual Doctor: An Interactive Artificial Intelligence based on Deep Learning for Non-Invasive Prediction of Diabetes
Venue: arXiv cs.CY 2019
Year: 2019

Artificial intelligence (AI) will pave the way to a new era in medicine. However, currently available AI systems do not interact with a patient, e.g., for anamnesis, and thus are only used by the physicians for predictions in diagnosis or prognosis. However, these systems are widely used, e.g., in diabetes or cancer prediction. In the current study, we developed an AI that is able to interact with a patient (virtual doctor) by using a speech recognition and speech synthesis system and thus can autonomously interact with the patient, which is particularly important for, e.g., rural areas, where the availability of primary medical care is strongly limited by low population densities. As a proof-of-concept, the system is able to predict type 2 diabetes mellitus (T2DM) based on non-invasive sensors and deep neural networks. Moreover, the system provides an easy-to-interpret probability estimation for T2DM for a given patient. Besides the development of the AI, we further analyzed the acceptance of young people for AI in healthcare to estimate the impact of such system in the future.
Improving Cross-Corpus Speech Emotion Recognition with Adversarial Discriminative Domain Generalization (ADDoG)
Venue: arXiv cs.LG 2019
Year: 2019

Automatic speech emotion recognition provides computers with critical context to enable user understanding. While methods trained and tested within the same dataset have been shown successful, they often fail when applied to unseen datasets. To address this, recent work has focused on adversarial methods to find more generalized representations of emotional speech. However, many of these methods have issues converging, and only involve datasets collected in laboratory conditions. In this paper, we introduce Adversarial Discriminative Domain Generalization (ADDoG), which follows an easier to train "meet in the middle" approach. The model iteratively moves representations learned for each dataset closer to one another, improving cross-dataset generalization. We also introduce Multiclass ADDoG, or MADDoG, which is able to extend the proposed method to more than two datasets, simultaneously. Our results show consistent convergence for the introduced methods, with significantly improved results when not using labels from the target dataset. We also show how, in most cases, ADDoG and MADDoG can be used to improve upon baseline state-of-the-art methods when target dataset labels are added and in-the-wild data are considered. Even though our experiments focus on cross-corpus speech emotion, these methods could be used to remove unwanted factors of variation in other settings.
Modeling Acoustic-Prosodic Cues for Word Importance Prediction in Spoken Dialogues
Venue: arXiv cs.CL 2019
Year: 2019

Prosodic cues in conversational speech aid listeners in discerning a message. We investigate whether acoustic cues in spoken dialogue can be used to identify the importance of individual words to the meaning of a conversation turn. Individuals who are Deaf and Hard of Hearing often rely on real-time captions in live meetings. Word error rate, a traditional metric for evaluating automatic speech recognition, fails to capture that some words are more important for a system to transcribe correctly than others. We present and evaluate neural architectures that use acoustic features for 3-class word importance prediction. Our model performs competitively against state-of-the-art text-based word-importance prediction models, and it demonstrates particular benefits when operating on imperfect ASR output.
Generative Adversarial Networks: recent developments
Venue: arXiv cs.LG 2019
Year: 2019

In traditional generative modeling, good data representation is very often a base for a good machine learning model. It can be linked to good representations encoding more explanatory factors that are hidden in the original data. With the invention of Generative Adversarial Networks (GANs), a subclass of generative models that are able to learn representations in an unsupervised and semi-supervised fashion, we are now able to adversarially learn good mappings from a simple prior distribution to a target data distribution. This paper presents an overview of recent developments in GANs with a focus on learning latent space representations.
Multifaceted 4D Feature Segmentation and Extraction in Point and Field-based Datasets
Venue: arXiv cs.CV 2019
Year: 2019

The use of large-scale multifaceted data is common in a wide variety of scientific applications. In many cases, this multifaceted data takes the form of a field-based (Eulerian) and point/trajectory-based (Lagrangian) representation as each has a unique set of advantages in characterizing a system of study. Furthermore, studying the increasing scale and complexity of these multifaceted datasets is limited by perceptual ability and available computational resources, necessitating sophisticated data reduction and feature extraction techniques. In this work, we present a new 4D feature segmentation/extraction scheme that can operate on both the field and point/trajectory data types simultaneously. The resulting features are time-varying data subsets that have both a field and point-based component, and were extracted based on underlying patterns from both data types. This enables researchers to better explore both the spatial and temporal interplay between the two data representations and study underlying phenomena from new perspectives. We parallelize our approach using GPU acceleration and apply it to real world multifaceted datasets to illustrate the types of features that can be extracted and explored.
Neuromorphic In-Memory Computing Framework using Memtransistor Cross-bar based Support Vector Machines
Venue: arXiv cs.NE 2019
Year: 2019

This paper presents a novel framework for designing support vector machines (SVMs), which does not impose restriction on the SVM kernel to be positive-definite and allows the user to define memory constraint in terms of fixed template vectors. This makes the framework scalable and enables its implementation for low-power, high-density and memory constrained embedded application. An efficient hardware implementation of the same is also discussed, which utilizes novel low power memtransistor based cross-bar architecture, and is robust to device mismatch and randomness. We used memtransistor measurement data, and showed that the designed SVMs can achieve classification accuracy comparable to traditional SVMs on both synthetic and real-world benchmark datasets. This framework would be beneficial for design of SVM based wake-up systems for internet of things (IoTs) and edge devices where memtransistors can be used to optimize system's energy-efficiency and perform in-memory matrix-vector multiplication (MVM).