nils-herrmann/clean_scirepeval huggingface dataset:
Distributed algorithms for cooperative control

Expressing a cooperative control system requires combining tools from control theory and distributed computation. After reviewing several possible formalisms appropriate for the job, the authors settle on the computation and control language and illustrate its main features and advantages using a cooperative tracking task. We demonstrate some of the concepts involved in using a multirobot task. We also discuss CCL's ability to be a programming language as well as a modeling tool, which lets us directly simulate or execute CCL models.
American Sign Language Recognition Using Leap Motion Sensor

In this paper, we present an American Sign Language recognition system using a compact and affordable 3D motion sensor. The palm-sized Leap Motion sensor provides a much more portable and economical solution than Cyblerglove or Microsoft kinect used in existing studies. We apply k-nearest neighbor and support vector machine to classify the 26 letters of the English alphabet in American Sign Language using the derived features from the sensory data. The experiment result shows that the highest average classification rate of 72.78% and 79.83% was achieved by k-nearest neighbor and support vector machine respectively. We also provide detailed discussions on the parameter setting in machine learning methods and accuracy of specific alphabet letters in this paper.
Embed to Control: A Locally Linear Latent Dynamics Model for Control from Raw Images

We introduce Embed to Control (E2C), a method for model learning and control of non-linear dynamical systems from raw pixel images. E2C consists of a deep generative model, belonging to the family of variational autoencoders, that learns to generate image trajectories from a latent space in which the dynamics is constrained to be locally linear. Our model is derived directly from an optimal control formulation in latent space, supports long-term prediction of image sequences and exhibits strong performance on a variety of complex control problems.
Screening for mild cognitive impairment: a systematic review.

Patients with mild cognitive impairment account for a significant number of referrals to old age psychiatry services and specialist memory clinics. The cognitive evaluation of such patients is commonly restricted to brief dementia screens, with no consideration to their suitability for assessing MCI. Here, we review the utility of such cognitive screens for MCI and provide an overview of validated instruments.



We identified papers published after Petersen and colleagues 1999 MCI criteria (Petersen et al., 1999) and examining face-to-face cognitive screening for MCI from publication databases using combinations of the search terms 'mild cognitive impairment' and 'cognitive screening'. We also combined the former search with the names of 39 screening tests recently identified in a relevant review (Cullen et al., 2007).



Fifteen cognitive screening instruments were identified, 11 cover a restricted range of cognitive domains. High sensitivity and specificity for MCI relative to healthy controls were reported for two comprehensive and two noncomprehensive screening instruments, adequate test-retest and inter-rater reliability for only one of these. With the exception of three studies, sample sizes were universally small (i.e. n </= 100), and prognostic values were reported for only two of the identified 15 screening measures. Sensitivities of the full domain measures were universally high, but information about their specificity against psychiatric and non-progressive neurological conditions and predictive validity is lacking.



Several cognitive screening instruments afford the clinician the ability to detect MCI, early AD, and in some cases non-AD dementia, but they cannot currently be used to make reliable inferences about the course and eventual outcome of MCI.
Automatic annotation of human actions in video

This paper addresses the problem of automatic temporal annotation of realistic human actions in video using minimal manual supervision. To this end we consider two associated problems: (a) weakly-supervised learning of action models from readily available annotations, and (b) temporal localization of human actions in test videos. To avoid the prohibitive cost of manual annotation for training, we use movie scripts as a means of weak supervision. Scripts, however, provide only implicit, noisy, and imprecise information about the type and location of actions in video. We address this problem with a kernel-based discriminative clustering algorithm that locates actions in the weakly-labeled training data. Using the obtained action samples, we train temporal action detectors and apply them to locate actions in the raw video data. Our experiments demonstrate that the proposed method for weakly-supervised learning of action models leads to significant improvement in action detection. We present detection results for three action classes in four feature length movies with challenging and realistic video data.
COCONUT: Seamless Scale-out of Network Elements

A key use of software-defined networking is to enable scale-out of network data plane elements. Naively scaling networking elements, however, can cause incorrect behavior. For example, we show that an IDS system which operates correctly as a single network element can erroneously and permanently block hosts when it is replicated.
 In this paper, we provide a system, COCONUT, for seamless scale-out of network forwarding elements; that is, an SDN application programmer can program to what functionally appears to be a single forwarding element, but which may be replicated behind the scenes. To do this, we identify the key property for seamless scale out, weak causality, and guarantee it through a practical and scalable implementation of vector clocks in the data plane. We prove that COCONUT enables seamless scale out of networking elements, i.e., the user-perceived behavior of any COCONUT element implemented with a distributed set of concurrent replicas is provably indistinguishable from its singleton implementation. Finally, we build a prototype of COCONUT and experimentally demonstrate its correct behavior. We also show that its abstraction enables a more efficient implementation of seamless scale-out compared to a naive baseline.
The Impact of Node Selfishness on Multicasting in Delay Tolerant Networks

Due to the uncertainty of transmission opportunities between mobile nodes, delay tolerant networks (DTNs) exploit the opportunistic forwarding mechanism. This mechanism requires nodes to forward messages in a cooperative and selfish way. However, in the real word, most of the nodes exhibit selfish behaviors, such as individual and social selfishness. In this paper, we are the first to investigate how the selfish behaviors of nodes affect the performance of DTN multicast. We consider two typical multicast relaying schemes, namely, two-hop relaying and epidemic relaying, and study their performance in terms of average message transmission delay and transmission cost. Specifically, we model the message delivery process under selfish behaviors by a 3-D continuous time Markov chain; under this model, we derive closed-form formulas for the message transmission delay and cost. Then, we evaluate the accuracy of the proposed Markov chain model by comparing the theoretical results with the simulation results obtained by simulating the message dissemination under both two-hop and epidemic relaying with different network sizes and mobility models. Our study shows that different selfish behaviors may have different impacts on different performance metrics. In addition, selfish behaviors influence epidemic relaying more than two-hop relaying. Furthermore, our results show that the performance of multicast with selfish nodes depends on the multicast group size.
Trend Filtering on Graphs

We introduce a family of adaptive estimators on graphs, based on penalizing the `1 norm of discrete graph differences. This generalizes the idea of trend filtering [19, 40], used for univariate nonparametric regression, to graphs. Analogous to the univariate case, graph trend filtering exhibits a level of local adaptivity unmatched by the usual `2-based graph smoothers. It is also defined by a convex minimization problem that is readily solved (e.g., by fast ADMM or Newton algorithms). We demonstrate the merits of graph trend filtering through both examples and theory.
Artificial neural networks in time series forecasting: a comparative analysis

Artificial neural networks (ANN) have received a great deal of attention in many fields of engineering and science. Inspired by the study of brain architecture, ANN represent a class of non-linear models capable of learning from data. ANN have been applied in many areas where statistical methods are traditionally employed. They have been used in pattern recognition, classification, prediction and process control. The purpose of this paper is to discuss ANN and compare them to non-linear time series models. We begin exploring recent developments in time series forecasting with particular emphasis on the use of non-linear models. Thereafter we include a review of recent results on the topic of ANN. The relevance of ANN models for the statistical methods is considered using time series prediction problems. Finally we construct asymptotic prediction intervals for ANN and show how to use prediction intervals to choose the number of nodes in the ANN.
Context-Aware Bandits

In this paper, we present a simple and efficient Context-Aware Bandit (CAB) algorithm. With CAB we attempt to craft a bandit algorithm that can capture collaborative effects and that can be easily deployed in a real-world recommendation system, where the multi-armed bandits have been shown to perform well in particular with respect to the cold-start problem. CAB utilizes a context-aware clustering technique augmenting exploration-exploitation strategies. CAB dynamically clusters the users based on the content universe under consideration. We provide a theoretical analysis in the standard stochastic multi-armed bandits setting. We demonstrate the efficiency of our approach on production and real-world datasets, showing the scalability and, more importantly, the significantly increased prediction performance against several existing state-of-theart methods.
Health informatics: current issues and challenges

Health informatics concerns the use of information and information and communication technologies within healthcare. Health informatics and information science need to take account of the unique aspects of health and medicine. The development of information systems and electronic records within health needs to consider the information needs and behaviour of all users. The sensitivity of personal health data raises ethical concerns for developing electronic records. E-health initiatives must actively involve users in the design, development, implementation and evaluation, and information science can contribute to understanding the needs and behaviour of user groups. Health informatics could make an important contribution to the ageing society and to reducing the digital divide and health divides within society. There is a need for an appropriate evidence base within health informatics to support future developments, and to ensure health informatics reaches its potential to improve the health and well-being of patients and the public.
The back squat: A proposed assessment of functional deficits and technical factors that limit performance.

Fundamental movement competency is essential for participation in physical activity and for mitigating the risk of injury, which are both key elements of health throughout life. The squat movement pattern is arguably one of the most primal and critical fundamental movements necessary to improve sport performance, to reduce injury risk and to support lifelong physical activity. Based on current evidence, this first (1 of 2) report deconstructs the technical performance of the back squat as a foundation training exercise and presents a novel dynamic screening tool that incorporates identification techniques for functional deficits that limit squat performance and injury resilience. The follow-up report will outline targeted corrective methodology for each of the functional deficits presented in the assessment tool.
Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria

We consider a continuous-time form of repeated matrix games in which player strategies evolve in reaction to opponent actions. Players observe each other's actions, but do not have access to other player utilities. Strategy evolution may be of the best response sort, as in fictitious play, or a gradient update. Such mechanisms are known to not necessarily converge. We introduce a form of "dynamic" fictitious and gradient play strategy update mechanisms. These mechanisms use derivative action in processing opponent actions and, in some cases, can lead to behavior converging to Nash equilibria in previously nonconvergent situations. We analyze convergence in the case of exact and approximate derivative measurements of the dynamic update mechanisms. In the ideal case of exact derivative measurements, we show that convergence to Nash equilibrium can always be achieved. In the case of approximate derivative measurements, we derive a characterization of local convergence that shows how the dynamic update mechanisms can converge if the traditional static counterparts do not. We primarily discuss two player games, but also outline extensions to multiplayer games. We illustrate these methods with convergent simulations of the well known Shapley and Jordan counterexamples.
Resolving Motion Correspondence for Densely Moving Points

ÐThis paper studies the motion correspondence problem for which a diversity of qualitative and statistical solutions exist. We concentrate on qualitative modeling, especially in situations where assignment conflicts arise either because multiple features compete for one detected point or because multiple detected points fit a single feature point. We leave out the possibility of point track initiation and termination because that principally conflicts with allowing for temporary point occlusion. We introduce individual, combined, and global motion models and fit existing qualitative solutions in this framework. Additionally, we present a new efficient tracking algorithm that satisfies theseÐpossibly constrainedÐmodels in a greedy matching sense, including an effective way to handle detection errors and occlusion. The performance evaluation shows that the proposed algorithm outperforms existing greedy matching algorithms. Finally, we describe an extension to the tracker that enables automatic initialization of the point tracks. Several experiments show that the extended algorithm is efficient, hardly sensitive its few parameters, and qualitatively better than other algorithms, including the presumed optimal statistical multiple hypothesis tracker. Index TermsÐMotion correspondence, feature point tracking, target tracking, algorithms.
Symmetrical Dense Optical Flow Estimation with Occlusions Detection

Traditional techniques of dense optical flow estimation do not generally yield symmetrical solutions: the results will differ if they are applied between images I 1 and I 2 or between images I 2 and I 1. In this work, we present a method to recover a dense optical flow field map from two images, while explicitely taking into account the symmetry across the images as well as possible occlusions in the flow field. The idea is to consider both displacements vectors from I 1 to I 2 and I 2 to I 1 and to minimise an energy functional that explicitely encodes all those properties. This variational problem is then solved using the gradient flow defined by the Euler–Lagrange equations associated to the energy. To prove the importance of the concepts of symmetry and occlusions for optical flow computation, we have extended a classical approach to handle those. Experiments clearly show the added value of these properties to improve the accuracy of the computed flows. Figures appear in color in the online version of this paper.
Intellectual capital ROI : a causal map of human capital antecedents and consequents

This report describes the results of a ground-breaking research study that measured the antecedents and consequents of effective human capital management. The research sample consisted of 76 senior executives from 25 companies in the financial services industry. The results of the study yielded a holistic causal map that integrated constructs from the fields of intellectual capital, knowledge management, human resources, organizational behaviour, information technology and accounting. The integration of both quantitative and qualitative measures in an overall conceptual model yielded several research implications. The resulting structural equation model allows participating organizations and researchers to gauge the effectiveness of an organization’s human capital capabilities. This will allow practitioners and researchers to more efficiently allocate resources with regard to human capital management. The potential outcomes of the study are limitless, since a program of consistent re-evaluation can lead to the establishment of causal relationships between human capital management and economic and business results.  Today’s knowledge-based world consists of universal dynamic change and massive information bombardment. By the year 2010, the codified information base of the world is expected to `̀ double every 11 hours’’ (Bontis, 1999, p. 435). Information storage capacities continue to expand enormously. In 1950, IBM’s Rama C tape contained 4.4 megabytes and they were able to store as many as 50 of these tapes together. At that time, 220 megabytes represented the frontiers of information storage. Many of today’s standard desktop computers are being sold with 40 gigabytes of hard disk space. It is sobering to remember that full motion video in uncompressed form requires 1 gigabyte per minute and that the 83 minutes of Snow White digitized in full colour amount to 15 terabytes of space. Unfortunately, the conscious mind is only capable of processing somewhere between 16 and 40 bits of information (ones and zeros) per second. How do we reconcile this information bombardment conundrum when it seems that human beings are the bottle-neck? The current issue and full text archive of this journal is available at http://www.emeraldinsight.com/1469-1930.htm The authors would like to acknowledge the following organizations for their financial support: Accenture, Saratoga Institute and the Institute for Intellectual Capital Research. The authors would also like to highlight the contribution of Vanessa Yeh, who administered the data collection phase of this research.
Issues in building general letter to sound rules

In generaltext-to-speechsystems, it is notpossibleto guaranteethat a lexiconwill containall wordsfoundin a text, thereforesomesystemfor predictingpronunciationfrom theword itself is necessary . Herewe presenta generalframework for building letter to sound (LTS) rulesfrom a word list in a language.The techniquecanbe fully automatic,thougha small amountof handseedingcangive betterresults.We have appliedthis techniqueto English(UK and US), Frenchand German. The generatedmodelsachieve, 75%, 58%, 93% and89%, respecti vely, wordscorrectfor held out data from theword lists. To testour modelson moretypical datawe alsoanalyzedgeneral text, to find which wordsdo not appearin our lexicon. Theseunknown wordswereusedasamorerealistictestcorpusfor ourmodels. We also discussthe distribution and type of suchunknown words.
Where to find my next passenger

We present a recommender for taxi drivers and people expecting to take a taxi, using the knowledge of 1) passengers' mobility patterns and 2) taxi drivers' pick-up behaviors learned from the GPS trajectories of taxicabs. First, this recommender provides taxi drivers with some locations and the routes to these locations, towards which they are more likely to pick up passengers quickly (during the routes or at these locations) and maximize the profit. Second, it recommends people with some locations (within a walking distance) where they can easily find vacant taxis. In our method, we learn the above knowledge (represented by probabilities) from GPS trajectories of taxis. Then, we feed the knowledge into a probabilistic model which estimates the profit of the candidate locations for a particular driver based on where and when the driver requests for the recommendation. We validate our recommender using historical trajectories generated by over 12,000 taxis during 110 days.
Is it a tool suitable for learning? A critical review of the literature on Facebook as a technology-enhanced learning environment

Despite its continuing popularity as the social network site par excellence, the educational value of Facebook has not been fully determined, and results from the mainstream educational paradigms are contradictory, with some scholars emphasizing its pedagogical affordances (e.g., widening context of learning, mixing information and learning resources, hybridization of expertise) and others cautioning against its use for educational purposes. Moreover, systematic reviews about documented educational usage of Facebook as a learning environment are lacking. This article attempts to provide a critical overview of current studies focusing on the use of Facebook as a technology-enhanced learning environment, with the aim of exploring the extent to which its pedagogical potential is actually translated into practice. Only empirical studies published in peer-reviewed academic journals with a specific focus on Facebook as a learning environment have been considered for the review. The authors conducted a comprehensive literature search that identified 23 relevant articles that were subsequently analysed according to a simplified list of guidelines. These articles were further analysed and recoded through a set of emerging categories. The results show that pedagogical affordances of Facebook have only been partially implemented and that there are still many obstacles that may prevent a full adoption of Facebook as a learning environment such as implicit institutional, teacher and student pedagogies, and cultural issues. Finally, a broad observation on the implications of the study is developed with some suggestions for future research.
Dielectric Rod Antenna Array With Substrate Integrated Waveguide Planar Feed Network for Wideband Applications

Dielectric rod antenna (DRA) elements have numerous advantages over conventional waveguide and horn antenna elements. They have low insertion loss, broadband input match, high mutual decoupling efficiency, and low-cost manufacturing. Additionally, the radiation pattern of the dielectric rod antenna is almost frequency-independent. However, its feeding is generally a challenge. This paper demonstrates a novel ultrawideband (UWB) eight-element DRA fed by a wideband substrate integrated waveguide (SIW) structure. The eight-way feed net work has less than 1.1 dB insertion loss and only ±0.9 dB and ±4° amplitude and phase imbalance, respectively. The developed low-cost and compact dual-layer DRA design covers over 40% bandwidth at X-band. It has a good input match, almost constant radiation pattern with a gain of 14.5 ± 2 dB over the frequency band, low dispersion, low squint performance, and almost flat group delay, which are essential requirements for many UWB ap plications. The developed array antenna is compact and occupies only 10 × 9 cm2.