nils-herrmann/clean_scirepeval huggingface dataset:
TraMNet - Transition Matrix Network for Efficient Action Tube Proposals

Current state-of-the-art methods solve spatio-temporal action localisation by extending 2D anchors to 3D-cuboid proposals on stacks of frames, to generate sets of temporally connected bounding boxes called action micro-tubes. However, they fail to consider that the underlying anchor proposal hypotheses should also move (transition) from frame to frame, as the actor or the camera do. Assuming we evaluate n 2D anchors in each frame, then the number of possible transitions from each 2D anchor to he next, for a sequence of f consecutive frames, is in the order of O(n ), expensive even for small values of f . To avoid this problem we introduce a Transition-Matrix-based Network (TraMNet) which relies on computing transition probabilities between anchor proposals while maximising their overlap with ground truth bounding boxes across frames, and enforcing sparsity via a transition threshold. As the resulting transition matrix is sparse and stochastic, this reduces the proposal hypothesis search space from O(n ) to the cardinality of the thresholded matrix. At training time, transitions are specific to cell locations of the feature maps, so that a sparse (efficient) transition matrix is used to train the network. At test time, a denser transition matrix can be obtained either by decreasing the threshold or by adding to it all the relative transitions originating from any cell location, allowing the network to handle transitions in the test data that might not have been present in the training data, and making detection translationinvariant. Finally, we show that our network is able to handle sparse annotations such as those available in the DALY dataset, while allowing for both dense (accurate) or sparse (efficient) evaluation within a single model. We report extensive experiments on the DALY, UCF101-24 and Transformed-UCF101-24 datasets to support our claims.
Building a Bank of Semantically Encoded Narratives

We propose a methodology for a novel type of discourse annotation whose model is tuned to the analysis of a text as narrative. This is intended to be the basis of a “story bank” resource that would facilitate the automatic analysis of narrative structure and content. The methodology calls for annotators to construct propositions that approximate a reference text, by selecting predicates and arguments from among controlled vocabularies drawn from resources such as WordNet and VerbNet. Annotators then integrate the propositions into a conceptual graph that maps out the entire discourse; the edges represent temporal, causal and other relationships at the level of story content. Because annotators must identify the recurring objects and themes that appear in the text, they also perform coreference resolution and word sense disambiguation as they encode propositions. We describe a collection experiment and a method for determining inter-annotator agreement when multiple annotators encode the same short story. Finally, we describe ongoing work toward extending the method to integrate the annotator’s interpretations of character agency (the goals, plans and beliefs that are relevant, yet not explictly stated in the text).
Multi-target tracking by learning local-to-global trajectory models

The multi-target tracking problem is challenging when there exist occlusions, tracking failures of the detector and severe interferences between detections. In this paper, we propose a novel detection based tracking method that links detections into tracklets and further forms long trajectories. Unlike many previous hierarchical frameworks which split the data association into two separate optimization problems (linking detections locally and linking tracklets globally), we introduce a unified algorithm that can automatically relearn the trajectory models from the local and global information for finding the joint optimal assignment. In each temporal window, the trajectory models are initialized by the local information to link those easy-to-connect detections into a set of tracklets. Then the trajectory models are updated by the reliable tracklets and reused to link separated tracklets into long trajectories. We iteratively update the trajectory models by more information from more frames until the result converges. The iterative process gradually improves the accuracy of the trajectory models, which in turn improves the target ID inferences for all detections by the MRF model. Experiment results revealed that our proposed method achieved state-of-the-art multi-target tracking performance.
The anatomical origin and course of the angular artery regarding its clinical implications.

The purposes of this study were to determine the morphological features and conceptualize the anatomical definition of the angular artery (AA) as an aid to practical operations in the clinical field.



Thirty-one hemifaces from 17 Korean cadavers and 26 hemifaces from 13 Thai cadavers were dissected.



The topography of the AA was classified into 4 types according to its course: Type I (persistent pattern), in which the AA traverses the lateral side of the nose (11%); Type II (detouring pattern), in which the AA traverses the cheek and tear trough area (18%); Type III (alternative pattern), in which the AA traverses the medial canthal area through a branch of the ophthalmic artery (22.8%); and Type IV (latent pattern), in which the AA is absent (26.3%).



The findings of this study will contribute toward improved outcomes for cosmetic surgery involving the injection of facial filler by enhancing the understanding of AA anatomy.
Dense reconstruction on-the-fly

We present a novel system that is capable of generating live dense volumetric reconstructions based on input from a micro aerial vehicle. The distributed reconstruction pipeline is based on state-of-the-art approaches to visual SLAM and variational depth map fusion, and is designed to exploit the individual capabilities of the system components. Results are visualized in real-time on a tablet interface, which gives the user the opportunity to interact. We demonstrate the performance of our approach by capturing several indoor and outdoor scenes on-the-fly and by evaluating our results with respect to a ground-truth model.
Accelerating Big Data Analytics Using FPGAs

Emerging big data analytics applications require a significant amount of server computational power. As chips are hitting power limits, computing systems are moving away from general-purpose designs and toward greater specialization. Hardware acceleration through specialization has received renewed interest in recent years, mainly due to the dark silicon challenge. To address the computing requirements of big data, and based on the benchmarking and characterization results, we envision a data-driven heterogeneous architecture for next generation big data server platforms that leverage the power of field-programmable gate array (FPGA) to build custom accelerators in a Hadoop MapReduce framework. Unlike a full and dedicated implementation of Hadoop MapReduce algorithm on FPGA, we propose the hardware/software (HW/SW) co-design of the algorithm, which trades some speedup at a benefit of less hardware. Considering communication overhead with FPGA and other overheads involved in Hadoop MapReduce environment such as compression and decompression, shuffling and sorting, our experimental results show significant potential for accelerating Hadoop MapReduce machine learning kernels using HW/SW co-design methodology.
Effects of caffeine ingestion on exercise testing: a meta-analysis.

This study used the meta-analytic approach to examine the effects of caffeine ingestion on exercise testing. Forty double-blind studies with 76 effect sizes (ES) met the inclusion criteria. The type of exercise test was classified as endurance, graded, or short-term. In comparison with placebo, caffeine improved test outcome by 12.3 % (95 % CI, 9.1 to 15.4), which was equivalent to an overall ES of 0.41 (95 % CI, 0.31 to 0.51). Endurance exercise significantly improved test outcome (P < 0.05) more than either graded or short-term exercise. When exercise protocol was examined, time-to-exhaustion (Tlim) protocols had a significantly greater (P < 0.05) ES than either the graded or the non-Tlim protocol(s). The results from this meta-analysis confirm the ergogenic effects of caffeine, particularly for endurance testing that use Tlim protocols.
Sudoku Squares and Chromatic Polynomials

T he Sudoku puzzle has become a very popular puzzle that many newspapers carry as a daily feature. The puzzle consists of a 9×9 grid in which some of the entries of the grid have a number from 1 to 9. One is then required to complete the grid in such a way that every row, every column, and every one of the nine 3× 3 sub-grids contain the digits from 1 to 9 exactly once. The sub-grids are shown in Figure 1.
Identifying predictive multi-dimensional time series motifs: an application to severe weather prediction

We introduce an efficient approach to mining multi-dimensional temporal streams of real-world data for ordered temporal motifs that can be used for prediction. Since many of the dimensions of the data are known or suspected to be irrelevant, our approach first identifies the salient dimensions of the data, then the key temporal motifs within each dimension, and finally the temporal ordering of the motifs necessary for prediction. For the prediction element, the data are assumed to be labeled. We tested the approach on two real-world data sets. To verify the generality of the approach, we validated the application on several subjects from the CMU Motion Capture database. Our main application uses several hundred numerically simulated supercell thunderstorms where the goal is to identify the most important features and feature interrelationships which herald the development of strong rotation in the lowest altitudes of a storm. We identified sets of precursors, in the form of meteorological quantities reaching extreme values in a particular temporal sequence, unique to storms producing strong low-altitude rotation. The eventual goal is to use this knowledge for future severe weather detection and prediction algorithms.
DENSER Cities: A System for Dense Efficient Reconstructions of Cities

This paper is about the efficient generation of dense, colored models of city-scale environments from range data and in particular, stereo cameras. Better maps make for better understanding; better understanding leads to better robots, but this comes at a cost. The computational and memory requirements of large dense models can be prohibitive. We provide the theory and the system needed to create cityscale dense reconstructions. To do so, we apply a regularizer over a compressed 3D data structure while dealing with the complex boundary conditions this induces during the data-fusion stage. We show that only with these considerations can we swiftly create neat, large, “well behaved” reconstructions. We evaluate our system using the KITTI dataset and provide statistics for the metric errors in all surfaces created compared to those measured with 3D laser. Our regularizer reduces the median error by 40% in 3.4 km of dense reconstructions with a median accuracy of 6 cm. For subjective analysis, we provide a qualitative review of 6.1 km of our dense reconstructions in an attached video. These are the largest dense reconstructions from a single passive camera we are aware of in the literature.
Fast in-memory transaction processing using RDMA and HTM

We present DrTM, a fast in-memory transaction processing system that exploits advanced hardware features (i.e., RDMA and HTM) to improve latency and throughput by over one order of magnitude compared to state-of-the-art distributed transaction systems. The high performance of DrTM are enabled by mostly offloading concurrency control within a local machine into HTM and leveraging the strong consistency between RDMA and HTM to ensure serializability among concurrent transactions across machines. We further build an efficient hash table for DrTM by leveraging HTM and RDMA to simplify the design and notably improve the performance. We describe how DrTM supports common database features like read-only transactions and logging for durability. Evaluation using typical OLTP workloads including TPC-C and SmallBank show that DrTM scales well on a 6-node cluster and achieves over 5.52 and 138 million transactions per second for TPC-C and SmallBank Respectively. This number outperforms a state-of-the-art distributed transaction system (namely Calvin) by at least 17.9X for TPC-C.
Human C-tactile afferents are tuned to the temperature of a skin-stroking caress.

Human C-tactile (CT) afferents respond vigorously to gentle skin stroking and have gained attention for their importance in social touch. Pharmacogenetic activation of the mouse CT equivalent has positively reinforcing, anxiolytic effects, suggesting a role in grooming and affiliative behavior. We recorded from single CT axons in human participants, using the technique of microneurography, and stimulated a unit's receptive field using a novel, computer-controlled moving probe, which stroked the skin of the forearm over five velocities (0.3, 1, 3, 10, and 30 cm s(-1)) at three temperatures (cool, 18 °C; neutral, 32 °C; warm, 42 °C). We show that CTs are unique among mechanoreceptive afferents: they discharged preferentially to slowly moving stimuli at a neutral (typical skin) temperature, rather than at the cooler or warmer stimulus temperatures. In contrast, myelinated hair mechanoreceptive afferents proportionally increased their firing frequency with stroking velocity and showed no temperature modulation. Furthermore, the CT firing frequency correlated with hedonic ratings to the same mechano-thermal stimulus only at the neutral stimulus temperature, where the stimuli were felt as pleasant at higher firing rates. We conclude that CT afferents are tuned to respond to tactile stimuli with the specific characteristics of a gentle caress delivered at typical skin temperature. This provides a peripheral mechanism for signaling pleasant skin-to-skin contact in humans, which promotes interpersonal touch and affiliative behavior.
The Power of Testing Memory: Basic Research and Implications for Educational Practice.

A powerful way of improving one's memory for material is to be tested on that material. Tests enhance later retention more than additional study of the material, even when tests are given without feedback. This surprising phenomenon is called the testing effect, and although it has been studied by cognitive psychologists sporadically over the years, today there is a renewed effort to learn why testing is effective and to apply testing in educational settings. In this article, we selectively review laboratory studies that reveal the power of testing in improving retention and then turn to studies that demonstrate the basic effects in educational settings. We also consider the related concepts of dynamic testing and formative assessment as other means of using tests to improve learning. Finally, we consider some negative consequences of testing that may occur in certain circumstances, though these negative effects are often small and do not cancel out the large positive effects of testing. Frequent testing in the classroom may boost educational achievement at all levels of education.
Discriminative Unsupervised Feature Learning with Convolutional Neural Networks

Current methods for training convolutional neural networks depend on large amounts of labeled samples for supervised training. In this paper we present an approach for training a convolutional neural network using only unlabeled data. We train the network to discriminate between a set of surrogate classes. Each surrogate class is formed by applying a variety of transformations to a randomly sampled ’seed’ image patch. We find that this simple feature learning algorithm is surprisingly successful when applied to visual object recognition. The feature representation learned by our algorithm achieves classification results matching or outperforming the current state-of-the-art for unsupervised learning on several popular datasets (STL-10, CIFAR-10, Caltech-101).
Finite State Automata and Simple Recurrent Networks

We explore a network architecture introduced by Elman (1988) for predicting successive elements of a sequence. The network uses the pattern of activation over a set of hidden units from time-step t1, together with element t, to predict element t 1. When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the grammar. When the network has a minimal number of hidden units, patterns on the hidden units come to correspond to the nodes of the grammar, although this correspondence is not necessary for the network to act as a perfect finite-state recognizer. We explore the conditions under which the network can carry information about distant sequential contingencies across intervening elements. Such information is maintained with relative ease if it is relevant at each intermediate step; it tends to be lost when intervening elements do not depend on it. At first glance this may suggest that such networks are not relevant to natural language, in which dependencies may span indefinite distances. However, embeddings in natural language are not completely independent of earlier information. The final simulation shows that long distance sequential contingencies can be encoded by the network even if only subtle statistical properties of embedded strings depend on the early information.
Decisional procrastination correlates : personality traits , self-esteem or perception of cognitive failure ?

The aim of the present study is to examine a number of decisional procrastination correlates. A sample of 258 subjects attending secondary school were administered the Melbourne Decision Making Questionnaire, Cognitive Failures Questionnaire, Self-Esteem Scale, Big Five Questionnaire and Five Factors Adjective Short Test. The data were subjected to correlation and multiple regression. Decisional procrastination is best explained by the Cognitive Failures Questionnaire. The results enable a further analysis in the field of decisional procrastination. Résumé. Facteurs liées à la procrastination décisionnelle: traits de la personnalité, auto-estime ou perception d’échec cognitif? L’objectif de la présente étude est de vérifier quelques corrélations de la procrastination décisionnelle. On a administré à un échantillon de 258 sujets fréquentant l’école supérieur: le Melbourne Decision Making Questionnaire, Cognitive Failures Questionnaire, Self-Esteem Scale, Big Five Questionnaire et Five Factors Adjective Short Test. Les données statistiques ont été soumises à la corrélation et à la régression multiple. La procrastination décisionnelle est mieux expliquée par le Cognitive Failures Questionnaire. Les résultats rendent possible une analyse plus pousée dans le domaine de la procrastination décisionnelle.  Persönlichkeitsmerkmale, Selbstachtung oder Wahrnehmung von Kognitivem Misserfolg? Das Ziel der vorliegenden Untersuchung ist die Prüfung von Entscheidungsaufschubkorrelationen. Einer Gruppe von 258 Oberschülern, wurden folgende Fragebogen vorgelegt: Melbourne Decision Making Questionnaire, Cognitive Failures Questionnaire, Self-Esteem Scale, Big Five Questionnaire und Five Factors Adjective Short Test. A. Di Fabio (&) Dipartimento di Psicologia, Università degli Studi di Firenze, via S. Niccolò 93, 50125 Firenze, Italy e-mail: adifabio@psico.unifi.it 123 Int J Educ Vocat Guid (2006) 6:109–122 DOI 10.1007/s10775-006-9000-9 Decisional procrastination correlates: personality traits, self-esteem or perception of cognitive failure?
Sizing equation and Finite Element Analysis optimum design of axial-flux permanent-magnet motor for electric vehicle direct drive

This paper presents the design process of a slotted TORUS axial-flux permanent-magnet motor suitable for direct drive of an electric vehicle through sizing equation and Finite Element Analysis. AFPM motor is a high torque density motor which can be easily and compactly mounted into the automobile's wheel fitting the rim perfectly. A double-sided slotted AFPM motor with 6 rotor poles for high torque density and stable rotation is the preliminary design. In order to determine the design requirements, a simple vehicle dynamic model evaluating the vehicle performance considering an automobile's typical-trip cursing scenario is considered. Axial-flux permanent-magnet machine's fundamental theory and sizing equation are applied to obtain the initial design parameters of the motor with the highest possible torque. The FEA of designed motor was conducted via commercial Vector Field Opera-3D 14.0 software for evaluation and accuracy enhancement of the design parameters. FEA simulation results are compared with those results obtained from sizing equation showing a good agreement of flux density values in various parts of the designed motor at no-load condition. The motor meets all the requirements and limitations of the electric vehicle fitting the shape and the size of a classical rim of the vehicle wheel.
Basket-Sensitive Personalized Item Recommendation

Personalized item recommendation is useful in narrowing down the list of options provided to a user. In this paper, we address the problem scenario where the user is currently holding a basket of items, and the task is to recommend an item to be added to the basket. Here, we assume that items currently in a basket share some association based on an underlying latent need, e.g., ingredients to prepare some dish, spare parts of some device. Thus, it is important that a recommended item is relevant not only to the user, but also to the existing items in the basket. Towards this goal, we propose two approaches. First, we explore a factorizationbased model called BFM that incorporates various types of associations involving the user, the target item to be recommended, and the items currently in the basket. Second, based on our observation that various recommendations towards constructing the same basket should have similar likelihoods, we propose another model called CBFM that further incorporates basket-level constraints. Experiments on three real-life datasets from different domains empirically validate these models against baselines based on matrix factorization and association rules.
Impact of dust on solar photovoltaic ( PV ) performance : Research status , challenges and recommendations

The peaking of most oil reserves and impending climate change are critically driving the adoption of solar photovoltaic’s (PV) as a sustainable renewable and eco-friendly alternative. Ongoing material research has yet to find a breakthrough in significantly raising the conversion efficiency of commercial PV modules. The installation of PV systems for optimum yield is primarily dictated by its geographic location (latitude and available solar insolation) and installation design (tilt, orientation and altitude) to maximize solar exposure. However, once these parameters have been addressed appropriately, there are other depending factors that arise in determining the system performance (efficiency and output). Dust is the lesser acknowledged factor that significantly influences the performance of the PV installations. This paper provides an appraisal on the current status of research in studying the impact of dust on PV system performance and identifies challenges to further pertinent research. A framework to understand the various factors that govern the settling/assimilation of dust and likely mitigation measures have been discussed in this paper.