nils-herrmann/clean_scirepeval huggingface dataset:
A Survey of Colormaps in Visualization

Colormaps are a vital method for users to gain insights into data in a visualization. With a good choice of colormaps, users are able to acquire information in the data more effectively and efficiently. In this survey, we attempt to provide readers with a comprehensive review of colormap generation techniques and provide readers a taxonomy which is helpful for finding appropriate techniques to use for their data and applications. Specifically, we first briefly introduce the basics of color spaces including color appearance models. In the core of our paper, we survey colormap generation techniques, including the latest advances in the field by grouping these techniques into four classes: procedural methods, user-study based methods, rule-based methods, and data-driven methods; we also include a section on methods that are beyond pure data comprehension purposes. We then classify colormapping techniques into a taxonomy for readers to quickly identify the appropriate techniques they might use. Furthermore, a representative set of visualization techniques that explicitly discuss the use of colormaps is reviewed and classified based on the nature of the data in these applications. Our paper is also intended to be a reference of colormap choices for readers when they are faced with similar data and/or tasks.
Adaptive Beamforming With Resource Allocation for Distance-Aware Multi-User Indoor Terahertz Communications

Terahertz (THz) communication is envisioned as a key technology for next-generation ultra-high-speed wireless systems. In this paper, we study an indoor multi-user THz communication system with multiple antenna subarrays. To capture the distance-frequency-dependent characteristics of THz channels, we design a hybrid beamforming scheme with distance-aware multi-carrier transmission, including analog beamforming for user grouping and interference cancellation in radio-frequency (RF) domain and digital beamforming with dynamically selected subarrays at baseband. Specifically, an adaptive power allocation and low-complexity antenna subarray selection policy is developed to serve different users at different distances and reduce the cost of active RF circuits simultaneously, where two greedy subarray selection algorithms are proposed. The effectiveness of the proposed adaptive hybrid beamforming and antenna subarray selection algorithms is verified through simulation results, which achieves significant gains over other nonadaptive and non-distance-aware schemes.
Sparse Submodular Probabilistic PCA

We propose a novel approach for sparse probabilistic principal component analysis, that combines a low rank representation for the latent factors and loadings with a novel sparse variational inference approach for estimating distributions of latent variables subject to sparse support constraints. Inference and parameter estimation for the resulting model is achieved via expectation maximization with a novel variational inference method for the E-step that induces sparsity. We show that this inference problem can be reduced to discrete optimal support selection. The discrete optimization is submodular, hence, greedy selection is guaranteed to achieve 1-1/e fraction of the optimal. Empirical studies indicate effectiveness of the proposed approach for the recovery of a parsimonious decomposition as compared to established baseline methods. We also evaluate our method against state-of-the-art methods on high dimensional fMRI data, and show that the method performs as well as or better than other methods.
Defending Critical Infrastructure

We apply new bilevel and trilevel optimization models to make critical infrastructure more resilient against terrorist attacks. Each model features an intelligent attacker (terrorists) and a defender (us), information transparency, and sequential actions by attacker and defender. We illustrate with examples of the US Strategic Petroleum Reserve, the US Border Patrol at Yuma, Arizona, and an electrical transmission system. We conclude by reporting insights gained from the modeling experience and many “red-team” exercises. Each exercise gathers open-source data on a real-world infrastructure system, develops an appropriate bilevel or trilevel model, and uses these to identify vulnerabilities in the system or to plan an optimal defense.
Experimental study on evaluation of multidimensional information visualization techniques

Information visualization systems often present usability problems mainly because many of these tools are not submitted to complete evaluation studies. This paper presents an experimental study based on tests with users to evaluate two multidimensional information visualization techniques, Parallel Coordinates and Radviz. The tasks used in the experiments were defined based on a taxonomy of users' tasks for interaction with multidimensional visualizations. The study intended to identify usability problems following the ergonomic criteria from Bastien and Scapin on implementations of both techniques, especially built for these experiments with the InfoVis toolkit.
2084 - Safe New World: Designing Ubiquitous Interactions

This paper investigates a concept for highly ubiquitous game interactions in pervasive games. Pervasive gaming is increasingly popular, but steadily improving mobile and ubiquitous technologies (e.g. smartwatches) have yet to be utilised to their full potential in this area. For this purpose, we implemented 2084 Safe New World; a pervasive game that allows particularly ubiquitous gameplay through micro interactions of varying duration. In a lab study, different interaction techniques based on gestures and touch input were compared on two mobile devices regarding usability and game input observability. A second study evaluated the player experience under more realistic circumstances; in particular, it examined how well the game can be integrated into everyday life, and tested boundaries of social acceptance of ubiquitous interactions in a pervasive spy game.
Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation

We review the main results obtained in the theory of schemata in genetic programming (GP), emphasizing their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP, which is closer to the original concept of schema in genetic algorithms (GAs). Along with a new form of crossover, one-point crossover, and point mutation, this concept of schema has been used to derive an improved schema theorem for GP that describes the propagation of schemata from one generation to the next. We discuss this result and show that our schema theorem is the natural counterpart for GP of the schema theorem for GAs, to which it asymptotically converges.
Multilingual native language identification

We present the first study of Native Language Identification (NLI) applied to text written in languages other than English, using data from six languages. NLI is the task of predicting an author’s first language (L1) using only their writings in a second language (L2), with applications in Second Language Acquisition and forensic linguistics. Most research to date has focused on English but there is a need to apply NLI to other languages, not only to gauge its applicability but also to aid in teaching research for other emerging languages. With this goal, we identify six typologically very different sources of non-English L2 data and conduct six experiments using a set of commonly used features. Our first two experiments evaluate our features and corpora, showing that the features perform well and at similar rates across languages. The third experiment compares non-native and native control data, showing that they can be discerned with 95% accuracy. Our fourth experiment provides a cross-linguistic assessment of how the degree of syntactic data encoded in part-of-speech tags affects their efficiency as classification features, finding that most differences between L1 groups lie in the ordering of the most basic word categories. We also tackle two questions that have not previously been addressed for NLI. Other work in NLI has shown that ensembles of classifiers over feature types work well and in our final exper2 S. Malmasi and M. Dras iment we use such an oracle classifier to derive an upper limit for classification accuracy with our feature set. We also present an analysis examining feature diversity, aiming to estimate the degree of overlap and complementarity between our chosen features employing an association measure for binary data. Finally, we conclude with a general discussion and outline directions for future work.
Dictionary Based Secure Provenance Compression for Wireless Sensor Networks

Due to energy and bandwidth limitations of wireless sensor networks (WSNs), it is crucial that data provenance for these networks be as compact as possible. Even if lossy compression techniques are used for encoding provenance information, the size of the provenance increases with the number of nodes traversed by the network packets. To address such issues, we propose a dictionary based provenance scheme. In our approach, each sensor node in the network stores a packet path dictionary. With the support of this dictionary, a path index instead of the path itself is enclosed with each packet. Since the packet path index is a code word of a dictionary, its size is independent of the number of nodes present in the packet's path. Furthermore, as our scheme binds the packet and its provenance through an AM-FM sketch and uses a secure packet sequence number generation technique, it can defend against most of the known provenance attacks. Through simulation and experimental results, we show that our scheme outperforms other compact provenance schemes with respect to provenance size, robustness, and energy consumption.
Psychological well-being revisited: advances in the science and practice of eudaimonia.

This article reviews research and interventions that have grown up around a model of psychological well-being generated more than two decades ago to address neglected aspects of positive functioning such as purposeful engagement in life, realization of personal talents and capacities, and enlightened self-knowledge. The conceptual origins of this formulation are revisited and scientific products emerging from 6 thematic areas are examined: (1) how well-being changes across adult development and later life; (2) what are the personality correlates of well-being; (3) how well-being is linked with experiences in family life; (4) how well-being relates to work and other community activities; (5) what are the connections between well-being and health, including biological risk factors, and (6) via clinical and intervention studies, how psychological well-being can be promoted for ever-greater segments of society. Together, these topics illustrate flourishing interest across diverse scientific disciplines in understanding adults as striving, meaning-making, proactive organisms who are actively negotiating the challenges of life. A take-home message is that increasing evidence supports the health protective features of psychological well-being in reducing risk for disease and promoting length of life. A recurrent and increasingly important theme is resilience - the capacity to maintain or regain well-being in the face of adversity. Implications for future research and practice are considered.
Collaborative Filtering on the Blockchain: A Secure Recommender System for e-Commerce

In collaborative filtering approaches, recommendations are inferred from user data. A large volume and a high data quality is essential for an accurate and precise recommender system. As consequence, companies are collecting large amounts of personal user data. Such data is often highly sensitive and ignoring users’ privacy concerns is no option. Companies address these concerns with several risk reduction strategies, but none of them is able to guarantee cryptographic secureness. To close that gap, the present paper proposes a novel recommender system using the advantages of blockchain-supported secure multiparty computation. A potential customer is able to allow a company to apply a recommendation algorithm without disclosing her personal data. Expected benefits are a reduction of fraud and misuse and a higher willingness to share personal data. An outlined experiment will compare users’ privacy-related behavior in the proposed recommender system with existent solutions.
Deep Embedding Network for Clustering

Clustering is a fundamental technique widely used for exploring the inherent data structure in pattern recognition and machine learning. Most of the existing methods focus on modeling the similarity/dissimilarity relationship among instances, such as k-means and spectral clustering, and ignore to extract more effective representation for clustering. In this paper, we propose a deep embedding network for representation learning, which is more beneficial for clustering by considering two constraints on learned representations. We first utilize a deep auto encoder to learn the reduced representations from the raw data. To make the learned representations suitable for clustering, we first impose a locality-persevering constraint on the learned representations, which aims to embed original data into its underlying manifold space. Then, different from spectral clustering which extracts representations from the block diagonal similarity matrix, we apply a group sparsity constraint for the learned representations, and aim to learn block diagonal representations in which the nonzero groups correspond to its cluster. After obtaining the learned representations, we use k-means to cluster them. To evaluate the proposed deep embedding network, we compare its performance with k-means and spectral clustering on three commonly-used datasets. The experiments demonstrate that the proposed method achieves promising performance.
Big data in manufacturing: a systematic mapping study

The manufacturing industry is currently in the midst of a data-driven revolution, which promises to transform traditional manufacturing facilities in to highly optimised smart manufacturing facilities. These smart facilities are focused on creating manufacturing intelligence from real-time data to support accurate and timely decision-making that can have a positive impact across the entire organisation. To realise these efficiencies emerging technologies such as Internet of Things (IoT) and Cyber Physical Systems (CPS) will be embedded in physical processes to measure and monitor real-time data from across the factory, which will ultimately give rise to unprecedented levels of data production. Therefore, manufacturing facilities must be able to manage the demands of exponential increase in data production, as well as possessing the analytical techniques needed to extract meaning from these large datasets. More specifically, organisations must be able to work with big data technologies to meet the demands of smart manufacturing. However, as big data is a relatively new phenomenon and potential applications to manufacturing activities are wide-reaching and diverse, there has been an obvious lack of secondary research undertaken in the area. Without secondary research, it is difficult for researchers to identify gaps in the field, as well as aligning their work with other researchers to develop strong research themes. In this study, we use the formal research methodology of systematic mapping to provide a breadth-first review of big data technologies in manufacturing.
Global minimum-jerk trajectory planning of robot manipulators

A new approach based on interval analysis is developed to find the global minimum-jerk (MJ) trajectory of a robot manipulator within a joint space scheme using cubic splines. MJ trajectories are desirable for their similarity to human joint movements and for their amenability to path tracking and to limit robot vibrations. This makes them attractive choices for robotic applications, in spite of the fact that the manipulator dynamics is not taken into account. Cubic splines are used in a framework that assures overall continuity of velocities and accelerations in the robot movement. The resulting MJ trajectory planning is shown to be a global constrained minimax optimization problem. This is solved by a newly devised algorithm based on interval analysis and proof of convergence with certainty to an arbitrarily good global solution is provided. The proposed planning method is applied to an example regarding a six-joint manipulator and comparisons with an alternative MJ planner are exposed.
ECDSA Key Extraction from Mobile Devices via Nonintrusive Physical Side Channels

We show that elliptic-curve cryptography implementations on mobile devices are vulnerable to electromagnetic and power side-channel attacks. We demonstrate full extraction of ECDSA secret signing keys from OpenSSL and CoreBitcoin running on iOS devices, and partial key leakage from OpenSSL running on Android and from iOS's CommonCrypto. These non-intrusive attacks use a simple magnetic probe placed in proximity to the device, or a power probe on the phone's USB cable. They use a bandwidth of merely a few hundred kHz, and can be performed cheaply using an audio card and an improvised magnetic probe.
Fuzzy Computing Applications for Anti-Money Laundering and Distributed Storage System Load Monitoring

Fuzzy computing (FC) has made a great impact in capturing human domain knowledge and modeling non-linear mapping of input-output space. In this paper, we describe the design and implementation of FC systems for detection of money laundering behaviors in financial transactions and monitoring of distributed storage system load. Our objective is to demonstrate the power of FC for real-world applications which are characterized by imprecise, uncertain data, and incomplete domain knowledge. For both applications, we designed fuzzy rules based on experts’ domain knowledge, depending on money laundering scenarios in transactions or the “health” of a distributed storage system. In addition, we developped a generic fuzzy inference engine and contributed to the open source community.
Ontologies for Enterprise Knowledge Management

information, including knowledge management and e-business applications. Next-generation knowledge management systems will likely rely on conceptual models in the form of ontologies to precisely define the meaning of various symbols. For example, FRODO (a Framework for Distributed Organizational Memories) uses ontologies for knowledge description in organizational memories,1 CoMMA (Corporate Memory Management through Agents) investigates agent technologies for maintaining ontology-based knowledge management systems,2 and Steffen Staab and his colleagues have discussed the methodologies and processes for building ontology-based systems.3 Here we present an integrated enterprise-knowledge management architecture for implementing an ontology-based knowledge management system (OKMS). We focus on two critical issues related to working with ontologies in real-world enterprise applications. First, we realize that imposing a single ontology on the enterprise is difficult if not impossible. Because organizations must devise multiple ontologies and thus require integration mechanisms, we consider means for combining distributed and heterogeneous ontologies using mappings. Additionally, a system’s ontology often must reflect changes in system requirements and focus, so we developed guidelines and an approach for managing the difficult and complex ontology-evolution process.
Maximum Power Point Tracking for PV system under partial shading condition via particle swarm optimization

Performance of Photovoltaic (PV) system is greatly dependent on the solar irradiation and operating temperature. Due to partial shading condition, the characteristics of a PV system considerably change and often exhibit several local maxima with one global maxima. Conventional Maximum Power Point Tracking (MPPT) techniques can easily be trapped at local maxima under partial shading. This significantly reduced the energy yield of the PV systems. In order to solve this problem, this paper proposes a Maximum Power Point tracking algorithm based on particle swarm optimization (PSO) that is capable of tracking global MPP under partial shaded conditions. The performance of proposed algorithm is evaluated by means of simulation in MATLAB Simulink. The proposed algorithm is applied to a grid connected PV system, in which a Boost (step up) DC-DC converter satisfactorily tracks the global peak.
User-driven semantic mapping of tabular data

Governments and public administrations started recently to publish large amounts of structured data on the Web, mostly in the form of tabular data such as CSV files or Excel sheets. Various tools and projects have been launched aiming at facilitating the lifting of tabular data to reach semantically structured and linked data. However, none of these tools supported a truly incremental, pay-as-you-go data publication and mapping strategy, which enables effort sharing between data owners, community experts and consumers. In this article, we present an approach for enabling the user-driven semantic mapping of large amounts tabular data. We devise a simple mapping language for tabular data, which is easy to understand even for casual users, but expressive enough to cover the vast majority of potential tabular mappings use cases. We outline a formal approach for mapping tabular data to RDF. Default mappings are automatically created and can be revised by the community using a semantic wiki. The mappings are executed using a sophisticated streaming RDB2RDF conversion. We report about the deployment of our approach at the Pan-European data portal PublicData.eu, where we transformed and enriched almost 10,000 datasets accounting for 7.3 billion triples.
Harnessing Encrypted Data in Cloud for Secure and Efficient Mobile Image Sharing

Nowadays, large volumes of multimedia data are outsourced to the cloud to better serve mobile applications. Along with this trend, highly correlated datasets can occur commonly, where the rich information buried in correlated data is useful for many cloud data generation/dissemination services. In light of this, we propose to enable a secure and efficient cloud-assisted image sharing architecture for mobile devices, by leveraging outsourced encrypted image datasets with privacy assurance. Different from traditional image sharing, we aim to provide a mobile-friendly design that saves the transmission cost for mobile clients, by directly utilizing outsourced correlated images to reproduce the image of interest inside the cloud for immediate dissemination. First, we propose a secure and efficient index design that allows the mobile client to securely find from encrypted image datasets the candidate selection pertaining to the image of interest for sharing. We then design two specialized encryption mechanisms that support secure image reproduction from encrypted candidate selection. We formally analyze the security strength of the design. Our experiments explicitly show that both the bandwidth and energy consumptions at the mobile client can be saved, while achieving all service requirements and security guarantees.
Reinforcement Learning of Question-Answering Dialogue Policies for Virtual Museum Guides

We use Reinforcement Learning (RL) to learn question-answering dialogue policies for a real-world application. We analyze a corpus of interactions of museum visitors with two virtual characters that serve as guides at the Museum of Science in Boston, in order to build a realistic model of user behavior when interacting with these characters. A simulated user is built based on this model and used for learning the dialogue policy of the virtual characters using RL. Our learned policy outperforms two baselines (including the original dialogue policy that was used for collecting the corpus) in a simulation setting.