nils-herrmann/clean_scirepeval huggingface dataset:
Learning Globally-Consistent Local Distance Functions for Shape-Based Image Retrieval and Classification

We address the problem of visual category recognition by learning an image-to-image distance function that attempts to satisfy the following property: the distance between images from the same category should be less than the distance between images from different categories. We use patch-based feature vectors common in object recognition work as a basis for our image-to-image distance functions. Our large-margin formulation for learning the distance functions is similar to formulations used in the machine learning literature on distance metric learning, however we differ in that we learn local distance functions¿a different parameterized function for every image of our training set¿whereas typically a single global distance function is learned. This was a novel approach first introduced in Frome, Singer, & Malik, NIPS 2006. In that work we learned the local distance functions independently, and the outputs of these functions could not be compared at test time without the use of additional heuristics or training. Here we introduce a different approach that has the advantage that it learns distance functions that are globally consistent in that they can be directly compared for purposes of retrieval and classification. The output of the learning algorithm are weights assigned to the image features, which is intuitively appealing in the computer vision setting: some features are more salient than others, and which are more salient depends on the category, or image, being considered. We train and test using the Caltech 101 object recognition benchmark.
Satellite Image Analysis for Disaster and Crisis-Management Support

This paper describes how multisource satellite data and efficient image analysis may successfully be used to conduct rapid-mapping tasks in the domain of disaster and crisis-management support. The German Aerospace Center (DLR) has set up a dedicated crosscutting service, which is the so-called "Center for satellite-based Crisis Information" (ZKI), to facilitate the use of its Earth-observation capacities in the service of national and international response to major disaster situations, humanitarian relief efforts, and civil security issues. This paper describes successful rapid satellite mapping campaigns supporting disaster relief and demonstrates how this technology can be used for civilian crisis-management purposes. During the last years, various international coordination bodies were established, improving the disaster-response-related cooperation within the Earth-observation community worldwide. DLR/ZKI operates in this context, closely networking with public authorities (civil security), nongovernmental organizations (humanitarian relief organizations), satellite operators, and other space agencies. This paper reflects on several of these international activities, such as the International Charter Space and Major Disasters, describes mapping procedures, and reports on rapid-mapping experiences gained during various disaster-response applications. The example cases presented cover rapid impact assessment after the Indian Ocean Tsunami, forest fires mapping for Portugal, earthquake-damage assessment for Pakistan, and landslide extent mapping for the Philippines
Opportunities and Challenges in Using Learning Analytics in Learning Design

Educational institutions are designing, creating and evaluating courses to optimize learning outcomes for highly diverse student populations. Yet, most of the delivery is still monitored retrospectively with summative eval‐ uation forms. Therefore, improvements to the course design are only implemented at the very end of a course, thus missing to benefit the current cohort. Teachers find it difficult to interpret and plan interventions just-in-time. In this context, Learning Analytics (LA) data streams gathered from ‘authentic’ student learning activities, may provide new opportunities to receive valuable information on the students’ learning behaviors and could be utilized to adjust the learning design already “on the fly” during runtime. We presume that Learning Analytics applied within Learning Design (LD) and presented in a learning dashboard provide opportunities that can lead to more personalized learning experiences, if imple‐ mented thoughtfully. In this paper, we describe opportunities and challenges for using LA in LD. We identify three key opportunities for using LA in LD: (O1) using on demand indicators for evidence based decisions on learning design; (O2) intervening during the run-time of a course; and, (O3) increasing student learning outcomes and satisfaction. In order to benefit from these opportunities, several challenges have to be overcome. Following a thorough literature review, we mapped the identified opportunities and challenges in a conceptual model that considers the interaction of LA in LD.
The 2009 Mario AI Competition

This paper describes the 2009 Mario AI Competition, which was run in association with the IEEE Games Innovation Conference and the IEEE Symposium on Computational Intelligence and Games. The focus of the competition was on developing controllers that could play a version of Super Mario Bros as well as possible. We describe the motivations for holding this competition, the challenges associated with developing artificial intelligence for platform games, the software and API developed for the competition, the competition rules and organization, the submitted controllers and the results. We conclude the paper by discussing what the outcomes of the competition can teach us both about developing platform game AI and about organizing game AI competitions. The first two authors are the organizers of the competition, while the third author is the winner of the competition.
Dynamic Influence Analysis in Evolving Networks

We propose the first real-time fully-dynamic index data structure designed for influence analysis on evolving networks. With this aim, we carefully redesign the data structure of the state-of-the-art sketching method introduced by Borgs et al., and construct corresponding update algorithms. Using this index, we present algorithms for two kinds of queries, influence estimation and influence maximization, which are strongly motivated by practical applications, such as viral marketing. We provide a thorough theoretical analysis, which guarantees the non-degeneracy of the solution accuracy after an arbitrary number of updates. Furthermore, we introduce a reachability-tree-based technique and a skipping method, which greatly reduce the time consumption required for edge/vertex deletions and vertex additions, respectively, and counter-based random number generators, which improve the space efficiency. Experimental evaluations using real dynamic networks with tens of millions of edges demonstrate the efficiency, scalability, and accuracy of our proposed indexing scheme. Specifically, it can reflect a graph modification within a time of several orders of magnitude smaller than that required to reconstruct an index from scratch, estimate the influence spread of a vertex set accurately within a millisecond, and select highly influential vertices at least ten times faster than state-of-the-art static algorithms.
A Nonisolated Three-Port DC–DC Converter and Three-Domain Control Method for PV-Battery Power Systems

In order to interface one photovoltaic (PV) port, one bidirectional battery port, and one load port of a PV-battery dc power system, a novel nonisolated three-port dc/dc converter named boost bidirectional buck converter (B3C) and its control method based on three-domain control are proposed in this paper. The power flow and operating principles of the proposed B3C are analyzed in detail, and then, the dc voltage relation between three ports is deduced. The proposed converter features high integration and single-stage power conversion from both PV and battery ports to the load port, thus leading to high efficiency. The current of all three ports is continuous; hence, the electromagnetic noise can be reduced. Furthermore, the control and modulation method for B3C has been proposed for realizing maximum power point tracking (MPPT), battery management, and bus voltage regulation simultaneously. The operation can be transited between conductance mode and MPPT mode automatically according to the load power. Finally, experimental verifications are given to illustrate the feasibility and effectiveness of the proposed topology and control method.
Language Identification in the Limit

Language learnabi l i ty has been inves t igated . This refers to the following s i tua t ion: A class of possible languages is specified, t oge the r wi th a method of present ing informat ion to the learner about an unknown language, which is to be chosen from the class. The quest ion is now asked, " I s the informat ion sufficient to determine which of the possible languages is the unknown language?" M a n y definitions of l ea rnab i l i ty are possible, bu t only the following is considered here: Time is quant ized and has a finite s t a r t ing time. At each t ime the learner receives a un i t of in format ion and is to make a guess as to the i den t i t y of the unknown language on the basis of the informat ion received so far. This process continues forever. The class of languages will be considered lea~nabIe with respect to the specified me thod of in format ion p resen ta t ion if there is an a lgor i thm t h a t the learner can use to make his guesses, the a lgor i thm hav ing the following p roper ty : Given any language of the class, there is some finite t ime af te r which the guesses will all be the same and they will be correct . In this pre l iminary invest igat ion, a language is t aken to be a set of s tr ings on some finite a lphabet . The a lphabe t is the same for all languages of tile class. Several var ia t ions of each of the following two basic methods of informat ion presenta t ion are inves t iga ted: A text for a language generates the s t r ings of the language in any order such t h a t every s t r ing of the language occurs a t least once. An informant for a language tells whe the r a s t r ing is in the language, and chooses the s t r ings in some order such t h a t every s t r ing occurs at least once. I t was found t h a t the class of context-sensi t ive languages is learnable from an informant, but that not even the class of regular languages is learnable from a text.
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

Alessandro Cimatti 1, Edmund Clarke2, Enrico Giunchiglia3, Fausto Giunchiglia 4, Marco Pistore1, Marco Roveri 1, Roberto Sebastiani 4, and Armando Tacchella 3 1 ITC-IRST, Via Sommarive 18, 38050 Trento, Italy fcimatti,pistore,roverig@irst.itc.it 2 Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh (PA), USA emc@cs.cmu.edu 3 DIST – Università di Genova, Viale Causa 13, 16145 Genova, Italy fenrico,tacg@mrg.dist.unige.it 4 Università di Trento, Via Sommarive 14, 38050 Trento, Italy ffausto,rsebag@science.unitn.it
Design of a scalable InfiniBand topology service to enable network-topology-aware placement of processes

Over the last decade, InfiniBand has become an increasingly popular interconnect for deploying modern super-computing systems. However, there exists no detection service that can discover the underlying network topology in a scalable manner and expose this information to runtime libraries and users of the high performance computing systems in a convenient way. In this paper, we design a novel and scalable method to detect the InfiniBand network topology by using Neighbor-Joining techniques (NJ). To the best of our knowledge, this is the first instance where the neighbor joining algorithm has been applied to solve the problem of detecting InfiniBand network topology. We also design a network-topology-aware MPI library that takes advantage of the network topology service. The library places processes taking part in the MPI job in a network-topology-aware manner with the dual aim of increasing intra-node communication and reducing the long distance inter-node communication across the InfiniBand fabric.
Fragile online relationship: a first look at unfollow dynamics in twitter

We analyze the dynamics of the behavior known as 'unfollow' in Twitter. We collected daily snapshots of the online relationships of 1.2 million Korean-speaking users for 51 days as well as all of their tweets. We found that Twitter users frequently unfollow. We then discover the major factors, including the reciprocity of the relationships, the duration of a relationship, the followees' informativeness, and the overlap of the relationships, which affect the decision to unfollow. We conduct interview with 22 Korean respondents to supplement the quantitative results.
 They unfollowed those who left many tweets within a short time, created tweets about uninteresting topics, or tweeted about the mundane details of their lives. To the best of our knowledge, this work is the first systematic study of the unfollow behavior in Twitter.
Monte Carlo Localization for Mobile Robots

To navigate reliably in indoor environments, a mobile robot must know where it is. Thus, reliable position estimation is a key problem in mobile robotics. We believe that probabilistic approaches are among the most promising candidates to providing a comprehensive and real-time solution to the robot localization problem. However, current methods still face considerable hurdles. In particular, the problems encountered are closely related to the type of representation used to represent probability densities over the robot’s state space. Recent work on Bayesian filtering with particle-based density representations opens up a new approach for mobile robot localization, based on these principles. In this paper we introduce the Monte Carlo Localization method, where we represent the probability density involved by maintaining a set of samples that are randomly drawn from it. By using a sampling-based representation we obtain a localization method that can represent arbitrary distributions. We show experimentally that the resulting method is able to efficiently localize a mobile robot without knowledge of its starting location. It is faster, more accurate and less memory-intensive than earlier grid-based methods.
Keyword search in databases: the power of RDBMS

Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the interconnected tuple structures in an RDB that cannot be easily identified using SQL on RDBMS. In brief, it finds how the tuples containing the given keywords are connected via sequences of connections (foreign key references) among tuples in an RDB. Such interconnected tuple structures can be found as connected trees up to a certain size, sets of tuples that are reachable from a root tuple within a radius, or even multi-center subgraphs within a radius. In the literature, there are two main approaches. One is to generate a set of relational algebra expressions and evaluate every such expression using SQL on an RDBMS directly or in a middleware on top of an RDBMS indirectly. Due to a large number of relational algebra expressions needed to process, most of the existing works take a middleware approach without fully utilizing RDBMSs. The other is to materialize an RDB as a graph and find the interconnected tuple structures using graph-based algorithms in memory.
 In this paper we focus on using SQL to compute all the interconnected tuple structures for a given keyword query. We use three types of interconnected tuple structures to achieve that and we control the size of the structures. We show that the current commercial RDBMSs are powerful enough to support such keyword queries in RDBs efficiently without any additional new indexing to be built and maintained. The main idea behind our approach is tuple reduction. In our approach, in the first reduction step, we prune tuples that do not participate in any results using SQL, and in the second join step, we process the relational algebra expressions using SQL over the reduced relations. We conducted extensive experimental studies using two commercial RDBMSs and two large real datasets, and we report the efficiency of our approaches in this paper.
Defining clusters from a hierarchical cluster tree: the Dynamic Tree Cut package for R

Hierarchical clustering is a widely used method for detecting clusters in genomic data. Clusters are defined by cutting branches off the dendrogram. A common but inflexible method uses a constant height cutoff value; this method exhibits suboptimal performance on complicated dendrograms. We present the Dynamic Tree Cut R package that implements novel dynamic branch cutting methods for detecting clusters in a dendrogram depending on their shape. Compared to the constant height cutoff method, our techniques offer the following advantages: (1) they are capable of identifying nested clusters; (2) they are flexible-cluster shape parameters can be tuned to suit the application at hand; (3) they are suitable for automation; and (4) they can optionally combine the advantages of hierarchical clustering and partitioning around medoids, giving better detection of outliers. We illustrate the use of these methods by applying them to protein-protein interaction network data and to a simulated gene expression data set.


AVAILABILITY
The Dynamic Tree Cut method is implemented in an R package available at http://www.genetics.ucla.edu/labs/horvath/CoexpressionNetwork/BranchCutting.
Visualization Techniques for Mining Large Databases: A Comparison

Visual data mining techniques ha ve proven to be of high v alue in exploratory data analysis and the y also have a high potential for mining lar ge databases. In this article, we describe and e valuate a ne w visualization-based approach to mining lar ge databases. The basic idea of our visual data mining techniques is to represent as man y d ta items as possible on the screen at the same time by mapping each data v alue o a pixel of the screen and arranging the pixels adequately . The major goal of this article is to e valuate our visual data mining techniques and to compare them to other well-kno wn visualization techniques for multidimensional data: the parallel coordinate and stick figure visualization techniques. F or the evaluation of visual data mining techniques, in the first place the perception of properties of the data counts, and only in the second place the CPU time and the number of secondary storage accesses are important. In addition to testing the visualization techniques using real data, we de velop d a testing environment for database visualizations similar to the benchmark approach used for comparing the performance of database systems. The testing en vironment allows the generation of test data sets with predefined data characteristics which are important for comparing the perceptual abilities of visual data mining techniques.
Thermal Facial Analysis for Deception Detection

Thermal imaging technology can be used to detect stress levels in humans based on the radiated heat from their face. In this paper, we use thermal imaging to monitor the periorbital region's thermal variations and test whether it can offer a discriminative signature for detecting deception. We start by presenting an overview on automated deception detection and propose a novel methodology, which we validate experimentally on 492 thermal responses (249 lies and 243 truths) extracted from 25 participants. The novelty of this paper lies in scoring a larger number of questions per subject, emphasizing a within-person approach for learning from data, proposing a framework for validating the decision making process, and correct evaluation of the generalization performance. A $k$ -nearest neighbor classifier was used to classify the thermal responses using different strategies for data representation. We report an 87% ability to predict the lie/truth responses based on a within-person methodology and fivefold cross validation. Our results also show that the between-person approach for modeling deception does not generalize very well across the training data.
Comparison of the Levels of Presence and Anxiety in an Acrophobic Environment Viewed via HMD or CAVE

People who suffer from acrophobia fear any situation that involves heights. Several virtual reality systems have been presented to treat this problem. This paper presents a comparison study of the levels of presence and anxiety in an acrophobic environment that is viewed using a computer automatic virtual environment (CAVE) and a head-mounted display (HMD). In this environment, the floor fell away and the walls rose up. To determine whether either of the two visualization systems induced a greater sense of presence/anxiety in non-phobic users, an experiment comparing the two visualization systems was carried out. Twenty-five participants took part in this study. After using each visualization system (HMD or CAVE), the participants were asked to fill out an adapted Slater et al. questionnaire (Slater, Usoh, & Steed, 1994), and a Student t test was applied to the data obtained. The CAVE induces a high level of presence in users. The mean score was 5.01 (where 7 is the maximum value), which was higher than the score obtained using the HMD which was 3.59. The Student t test indicates that there are significant statistical differences. The level of anxiety was also examined at different times during the experiment. The results indicate that both visualization systems provoke anxiety, but that the CAVE provokes more anxiety than the HMD. The animation in which the floor falls away is the one that provoked the most anxiety. The results from the correlation between the anxiety and the level of presence at the three times indicated a significant correlation between the two measures.
Developing an Aerial Manipulator Prototype: Physical Interaction with the Environment

This article focuses on the design, modeling, and control of an aerial manipulator prototype, i.e., an innovative configuration consisting of a miniature quadrotor helicopter endowed with a robotic manipulator. The overall system is designed to accomplish operations that require physical interaction with the surrounding environment while remaining airborne. To investigate the dynamical model of the aerial manipulator, a simple planar benchmark is used to analyze the interactions between the quadrotor, the robotic manipulator, and the environment. A control strategy for the planar system is designed to guarantee robustness in the presence or absence of contacts. Experiments on a real setup validate the control in the two different scenarios in which the aerial manipulator is either freely flying or physically interacting with the environment.