nils-herrmann/clean_scirepeval huggingface dataset:
Mirror reading can reverse the flow of time.

How does culture shape our concepts? Across many cultures, people conceptualize time as if it flows along a horizontal timeline, but the direction of this implicit timeline is culture specific: Later times are on the right in some cultures but on the left in others. Here we investigated whether experience reading can determine the direction and orientation of the mental timeline, independent of other cultural and linguistic factors. Dutch speakers performed space-time congruity tasks with the instructions and stimuli written in either standard, mirror-reversed, or rotated orthography. When participants judged temporal phrases written in standard orthography, their reaction times were consistent with a rightward-directed mental timeline, but after brief exposure to mirror-reversed orthography, their mental timelines were reversed. When standard orthography was rotated 90° clockwise (downward) or counterclockwise (upward), participants' mental timelines were rotated, accordingly. Reading can play a causal role in shaping people's implicit time representations. Exposure to a new orthography can change the direction and orientation of the mental timeline within minutes, even when the new space-time mapping directly contradicts the reader's usual mapping. To account for this representational flexibility, we propose the hierarchical mental metaphors theory, according to which culturally conditioned mappings between space and time are specific instances of a more general mapping, which is conditioned by the relationship between space and time in the physical world. Conceptualizations of time are culture specific at one level of analysis but may be universal at another.
Distributed Subgradient Methods for Multi-Agent Optimization

We study a distributed computation model for optimizing a sum of convex objective functions corresponding to multiple agents. For solving this (not necessarily smooth) optimization problem, we consider a subgradient method that is distributed among the agents. The method involves every agent minimizing his/her own objective function while exchanging information locally with other agents in the network over a time-varying topology. We provide convergence results and convergence rate estimates for the subgradient method. Our convergence rate results explicitly characterize the tradeoff between a desired accuracy of the generated approximate optimal solutions and the number of iterations needed to achieve the accuracy.
Path planning for UAV based on improved heuristic A∗ algorithm

A 3D vehicle path planning method based on heuristic A∗ algorithm is proposed and simulated which makes the UAV's path planning for low altitude penetration more real-time, effective and engineering-oriented. The digital terrain information is processed with the integrated terrain elevation smoothing algorithm at first, and then, the safe flight surface which integrates the maneuverability of vehicle is built, At last, the mathematical models of the threats are established. An improved A∗ algorithm is used to plan 3D vehicle path on the safe surface, and the planned path is optimized and smoothed. Simulation results indicate that the method has a good performance in creating optimal path in 3D environment and what's more, the path planning algorithm is simple, efficient and easily realized in engineering field, thus adapting to the different missions of the UAV.
The Central Nervous System and the Gut Microbiome

Neurodevelopment is a complex process governed by both intrinsic and extrinsic signals. While historically studied by researching the brain, inputs from the periphery impact many neurological conditions. Indeed, emerging data suggest communication between the gut and the brain in anxiety, depression, cognition, and autism spectrum disorder (ASD). The development of a healthy, functional brain depends on key pre- and post-natal events that integrate environmental cues, such as molecular signals from the gut. These cues largely originate from the microbiome, the consortium of symbiotic bacteria that reside within all animals. Research over the past few years reveals that the gut microbiome plays a role in basic neurogenerative processes such as the formation of the blood-brain barrier, myelination, neurogenesis, and microglia maturation and also modulates many aspects of animal behavior. Herein, we discuss the biological intersection of neurodevelopment and the microbiome and explore the hypothesis that gut bacteria are integral contributors to development and function of the nervous system and to the balance between mental health and disease.
Internet of vehicles: From intelligent grid to autonomous cars and vehicular clouds

Traditionally, the vehicle has been the extension of the man's ambulatory system, docile to the driver's commands. Recent advances in communications, controls and embedded systems have changed this model, paving the way to the Intelligent Vehicle Grid. The car is now a formidable sensor platform, absorbing information from the environment (and from other cars) and feeding it to drivers and infrastructure to assist in safe navigation, pollution control and traffic management. The next step in this evolution is just around the corner: the Internet of Autonomous Vehicles. Pioneered by the Google car, the Internet of Vehicles will be a distributed transport fabric capable to make its own decisions about driving customers to their destinations. Like other important instantiations of the Internet of Things (e.g., the smart building), the Internet of Vehicles will have communications, storage, intelligence, and learning capabilities to anticipate the customers' intentions. The concept that will help transition to the Internet of Vehicles is the Vehicular Cloud, the equivalent of Internet cloud for vehicles, providing all the services required by the autonomous vehicles. In this article, we discuss the evolution from Intelligent Vehicle Grid to Autonomous, Internet-connected Vehicles, and Vehicular Cloud.
The huge Package for High-dimensional Undirected Graph Estimation in R

We describe an R package named huge which provides easy-to-use functions for estimating high dimensional undirected graphs from data. This package implements recent results in the literature, including Friedman et al. (2007), Liu et al. (2009, 2012) and Liu et al. (2010). Compared with the existing graph estimation package glasso, the huge package provides extra features: (1) instead of using Fortan, it is written in C, which makes the code more portable and easier to modify; (2) besides fitting Gaussian graphical models, it also provides functions for fitting high dimensional semiparametric Gaussian copula models; (3) more functions like data-dependent model selection, data generation and graph visualization; (4) a minor convergence problem of the graphical lasso algorithm is corrected; (5) the package allows the user to apply both lossless and lossy screening rules to scale up large-scale problems, making a tradeoff between computational and statistical efficiency.
LINE: Large-scale Information Network Embedding

This paper studies the problem of embedding very large information networks into low-dimensional vector spaces, which is useful in many tasks such as visualization, node classification, and link prediction. Most existing graph embedding methods do not scale for real world information networks which usually contain millions of nodes. In this paper, we propose a novel network embedding method called the ``LINE,'' which is suitable for arbitrary types of information networks: undirected, directed, and/or weighted. The method optimizes a carefully designed objective function that preserves both the local and global network structures. An edge-sampling algorithm is proposed that addresses the limitation of the classical stochastic gradient descent and improves both the effectiveness and the efficiency of the inference. Empirical experiments prove the effectiveness of the LINE on a variety of real-world information networks, including language networks, social networks, and citation networks. The algorithm is very efficient, which is able to learn the embedding of a network with millions of vertices and billions of edges in a few hours on a typical single machine. The source code of the LINE is available online\footnote{\url{https://github.com/tangjianpku/LINE}}.
Cloud-enabled privacy-preserving collaborative learning for mobile sensing

In this paper, we consider the design of a system in which Internet-connected mobile users contribute sensor data as training samples, and collaborate on building a model for classification tasks such as activity or context recognition. Constructing the model can naturally be performed by a service running in the cloud, but users may be more inclined to contribute training samples if the privacy of these data could be ensured. Thus, in this paper, we focus on privacy-preserving collaborative learning for the mobile setting, which addresses several competing challenges not previously considered in the literature: supporting complex classification methods like support vector machines, respecting mobile computing and communication constraints, and enabling user-determined privacy levels. Our approach, Pickle, ensures classification accuracy even in the presence of significantly perturbed training samples, is robust to methods that attempt to infer the original data or poison the model, and imposes minimal costs. We validate these claims using a user study, many real-world datasets and two different implementations of Pickle.
Single-Image Refocusing and Defocusing

In this paper, we present a postprocessing method to tackle the single-image refocusing-and-defocusing problem. The proposed method can accomplish the tasks of focus-map estimation and image refocusing and defocusing. Given an image with a mixture of focused and defocused objects, we first detect the edges and then estimate the focus map based on the edge blurriness, which is depicted explicitly by a parametric model. The image refocusing problem is addressed in a blind deconvolution framework, where the image prior is modeled by using both global and local constraints. In particular, we correct the defocused blurry edges to sharp ones with the aid of the parametric edge model and then render this cue as a local prior to ensure the sharpness of the refocused image. Experimental results demonstrate that the proposed method performs well in producing visually plausible images with different focus effects from a single input.
Experimental comparison of representation methods and distance measures for time series data

The previous decade has brought a remarkable increase of the interest in applications that deal with querying and mining of time series data. Many of the research efforts in this context have focused on introducing new representation methods for dimensionality reduction or novel similarity measures for the underlying data. In the vast majority of cases, each individual work introducing a particular method has made specific claims and, aside from the occasional theoretical justifications, provided quantitative experimental observations. However, for the most part, the comparative aspects of these experiments were too narrowly focused on demonstrating the benefits of the proposed methods over some of the previously introduced ones. In order to provide a comprehensive validation, we conducted an extensive experimental study re-implementing eight different time series representations and nine similarity measures and their variants, and testing their effectiveness on 38 time series data sets from a wide variety of application domains. In this article, we give an overview of these different techniques and present our comparative experimental findings regarding their effectiveness. In addition to providing a unified validation of some of the existing achievements, our experiments also indicate that, in some cases, certain claims in the literature may be unduly optimistic.
DSDR: Dynamic Semantic Discard Reader for Open-Domain Question Answering

Open-domain question answering (QA) is an important problem in natural language processing. A QA system usually consists of an information retrieve (IR) model for finding the relevant passages that may have answers and a read comprehension (RC) model for generating answers from the selected passages. The state-of-the-art RC model uses all the passages for feature extraction when matching semantic information of text pairs. In this paper, however, we argue that the texts of passages often have different importance for specific questions and some even provide negative information that might affect the correctness of final prediction. To address this problem, we design dynamic semantic discard reader (DSDR), a deep model that tries to drop negative information irrelevant to the questions. The result of our experiment shows that DSDR outperforms existing methods in the exact-match and F1 scores on open-domain QA datasets.
Unstructured human activity detection from RGBD images

Being able to detect and recognize human activities is essential for several applications, including personal assistive robotics. In this paper, we perform detection and recognition of unstructured human activity in unstructured environments. We use a RGBD sensor (Microsoft Kinect) as the input sensor, and compute a set of features based on human pose and motion, as well as based on image and point-cloud information. Our algorithm is based on a hierarchical maximum entropy Markov model (MEMM), which considers a person's activity as composed of a set of sub-activities. We infer the two-layered graph structure using a dynamic programming approach. We test our algorithm on detecting and recognizing twelve different activities performed by four people in different environments, such as a kitchen, a living room, an office, etc., and achieve good performance even when the person was not seen before in the training set1.
Data Driven Ontology Evaluation

The evaluation of ontologies is vital for the growth of the Semantic Web. We consider a number of problems in evaluating a knowledge artifact like an ontology. We propose in this paper that one approach to ontology evaluation should be corpus or data driven. A corpus is the most accessible form of knowledge and its use allows a measure to be derived of the ‘fit’ between an ontology and a domain of knowledge. We consider a number of methods for measuring this ‘fit’ and propose a measure to evaluate structural fit, and a probabilistic approach to identifying the best ontology.
ADE: A Framework for Robust Complex Robotic Architectures

Robots that can interact naturally with humans require the integration and coordination of many different components with heavy computational demands. We argue that an architecture framework with facilities for dynamic, reliable, fault-recovering, remotely accessible, distributed computing is needed for the development and operation of applications that support and enhance human activities and capabilities. We describe a robotic architecture development system, called ADE, that is built on top of a multi-agent system in order to provide all of the above features. Specifically, we discuss support for autonomic computing in ADE, briefly comparing it to related features of other commonly used robotic systems. We also report our experiences with ADE in the development of an architecture for an intelligent robot assistant and provide experimental results demonstrating the system's utility
Microstrip Dual/Quad-Band Filters With Coupled Lines and Quasi-Lumped Impedance Inverters Based on Parallel-Path Transmission

Microstrip quad-band bandpass filters with controllable passband center frequencies are presented and intensively investigated in this study. The newly proposed quad-band filter principally comprises two dual-band filters. Specifically, the two distinct types of dual-band filters with different dual-band generating mechanisms are studied and then combined to provide the quad-band responses. By incorporating parallel coupled lines as input sections and interstage impedance inverters built with quasi-lumped inductors, the type-I filter is constructed with thorough network analysis. As for the type-II filter, with novel quad-pole-splitting techniques analyzed by mixed-mode S-parameters, dual passbands of close band proximity could be realized. Eventually, based on the parallel-path transmission theory along with the two dual-band filters, a novel quad-band filter is thus implemented. The measurement and simulation results show good agreement.
A scalable end-to-end Gaussian process adapter for irregularly sampled time series classification

We present a general framework for classification of sparse and irregularly-sampled time series. The properties of such time series can result in substantial uncertainty about the values of the underlying temporal processes, while making the data difficult to deal with using standard classification methods that assume fixeddimensional feature spaces. To address these challenges, we propose an uncertaintyaware classification framework based on a special computational layer we refer to as the Gaussian process adapter that can connect irregularly sampled time series data to any black-box classifier learnable using gradient descent. We show how to scale up the required computations based on combining the structured kernel interpolation framework and the Lanczos approximation method, and how to discriminatively train the Gaussian process adapter in combination with a number of classifiers end-to-end using backpropagation.
Speech2Vec: A Sequence-to-Sequence Framework for Learning Word Embeddings from Speech

In this paper, we propose a novel deep neural network architecture, Speech2Vec, for learning fixed-length vector representations of audio segments excised from a speech corpus, where the vectors contain semantic information pertaining to the underlying spoken words, and are close to other vectors in the embedding space if their corresponding underlying spoken words are semantically similar. The proposed model can be viewed as a speech version of Word2Vec . Its design is based on a RNN Encoder-Decoder framework, and borrows the methodology of skipgrams or continuous bag-of-words for training. Learning word embeddings directly from speech enables Speech2Vec to make use of the semantic information carried by speech that does not exist in plain text. The learned word embeddings are evaluated and analyzed on 13 widely used word similarity benchmarks, and outperform word embeddings learned by Word2Vec from the transcriptions.
Joint Deep Modeling of Users and Items Using Reviews for Recommendation

A large amount of information exists in reviews written by users. This source of information has been ignored by most of the current recommender systems while it can potentially alleviate the sparsity problem and improve the quality of recommendations. In this paper, we present a deep model to learn item properties and user behaviors jointly from review text. The proposed model, named Deep Cooperative Neural Networks (DeepCoNN), consists of two parallel neural networks coupled in the last layers. One of the networks focuses on learning user behaviors exploiting reviews written by the user, and the other one learns item properties from the reviews written for the item. A shared layer is introduced on the top to couple these two networks together. The shared layer enables latent factors learned for users and items to interact with each other in a manner similar to factorization machine techniques. Experimental results demonstrate that DeepCoNN significantly outperforms all baseline recommender systems on a variety of datasets.
HMOG: A New Biometric Modality for Continuous Authentication of Smartphone Users

In this paper, we introduce Hand Movement, Orientation, and Grasp (HMOG), a behavioral biometric to continuously authenticate smartphone users. HMOG unobtrusively captures subtle micro-movement and orientation dynamics resulting from how a user grasps, holds, and taps on the smartphone. We evaluated the authentication and biometric key generation (BKG) performance of HMOG features on typing data collected from 100 subjects. Data was collected under two conditions: sitting and walking. We achieved authentication EERs as low as 6.92% (walking) and 10.20% (sitting) when we combined HMOG, tap, and keystroke features. We performed additional experiments to investigate why HMOG features perform well during walking. Our results suggest that this is due to the ability of HMOG features to capture distinctive body movements caused by walking, in addition to the hand-movement dynamics from taps. With BKG, we achieved EERs of 13.7% using HMOG combined with taps. In comparison, BKG using tap, key hold, and swipe features led to EERs between 31.3% and 36.7%. We also analyzed the energy consumption of HMOG feature extraction and computation. Our analysis shows that HMOG features extracted at 16Hz sensor sampling rate incurred a minor overhead of 7.9% without sacrificing authentication accuracy.
Social media knows what road it is: quantifying road characteristics with geo-tagged posts

Determining traveling routes that provide opportunities to satisfy the various requirements of users in urban areas is still an open problem. This is because it is virtually impossible to manually quantify the characteristics of each street or road and there are few web-based or semantic resources of subjective requirements that describe streets and roads directly. Thus, it is difficult to satisfy all the needs and desires of users that may arise, such as for finding boulevards that are “fashionable” or “beautiful.” The goal of this study is to automatically quantify the characteristics of streets and roads in relation to requirements that can be described using keywords such as “fashionable.” To achieve this goal, we propose a two-stage method that analyzes social media and road networks. First, in estimating the topic distribution (i.e., the characteristics) of each point of interest (POI), our method uses the latent Dirichlet allocation model to analyze geo-tagged texts while considering which users posted useful information for estimating road characteristics. Next, it uses a Markov random field model to estimate the characteristics of each street or road on the basis of those of the POIs and the road networks associated with the POIs. Experiments on real datasets demonstrate that our method achieves statistically significant improvements over baseline methods in terms of ranking quality in information retrieval for 300 roads in three urban areas in Tokyo when given 25 keywords.