nils-herrmann/clean_scirepeval huggingface dataset:
mPHASiS: Mobile patient healthcare and sensor information system

Pervasive care and chronic disease management to reduce institutionalization is a priority for most western countries. The realization of next generation ubiquitous and pervasive healthcare systems will be a challenging task, as these systems are likely to involve a complex structure. Such systems will consist of various devices, ranging from resource-constrained sensors and actuators to complex multimedia devices, supporting time critical applications. This is further compounded by cultural and socio-economical factors that must be addressed for next generation healthcare systems to be widely diffused and used. In this study, the requirements for a vital sign monitoring solution space is derived and mPHASiS is developed based on these requirements. mPHASiS is an end to end solution not only providing sensor networking and vital sign monitoring but also closing the loop by signaling alert messages to the caregiver and allowing pervasive access to vital signs of a patient using smartphones over a heterogeneous network. A role based access control mechanism is developed to limit access to sensitive data. The end to end delay and delay variations for both vital sign data collection and pervasive access are analyzed. mPHASiS is developed as a complementary solution augmenting functionality of a hospital information system and can be loosely couple with the hospital information system using webservices. & 2010 Elsevier Ltd. All rights reserved.
"If It Matters, I Can Explain It": Social Desirability of Knowledge Increases the Illusion of Explanatory Depth

This paper explores whether social desirability affects the illusion of explanatory depth (IEOD) by comparing the magnitude of this illusion in topics with different levels of social desirability within several domains. This question was chosen because prior literature shows that social expectations about how much a person should know about a certain topic affect the magnitude of the IOED. Previous research shows also that social desirability has an effect on a similar illusion related to argumentation, and that the IOED is affected by the way a person thinks knowledge is distributed in his or her social group. In order to do so, 184 participants were assigned randomly to three knowledge domains (history, economics, and devices) and in each domain they rated their understanding of a high-desirability and a low-desirability topic following a standard IOED procedure. Results show that social desirability has an effect on the IOED magnitude and that overestimation of understanding varies among domains. Particularly, participants tend to overestimate their understanding of high desirability topics only. This effect was stronger in the historical domain.
Communication-efficient algorithms for statistical optimization

We study two communication-efficient algorithms for distributed statistical optimization on large-scale data. The first algorithm is an averaging method that distributes the N data samples evenly to m machines, performs separate minimization on each subset, and then averages the estimates. We provide a sharp analysis of this average mixture algorithm, showing that under a reasonable set of conditions, the combined parameter achieves mean-squared error that decays as O(N-1 + (N/m)-2). Whenever m ≤ √N, this guarantee matches the best possible rate achievable by a centralized algorithm with access to all N samples. The second algorithm is a novel method, based on an appropriate form of bootstrap. Requiring only a single round of communication, it has mean-squared error that decays as O(N-1 + (N/m)-3), and so is more robust to the amount of parallelization.
Addressing DODAG inconsistency attacks in RPL networks

RPL is a routing protocol for low-power and lossy constrained node networks. A malicious node can manipulate header options used by RPL to track DODAG inconsistencies, thereby causing denial of service attacks, increased control message overhead, and black-holes at the targeted node. RPL counteracts DODAG inconsistencies by using a fixed threshold, upon reaching which all subsequent packets with erroneous header options are ignored. However, the fixed threshold is arbitrary and does not resolve the black-hole issue either. To address this we present a mitigation strategy that allows nodes to dynamically adapt against a DODAG inconsistency attack. We also present the forced black-hole attack problem and a solution that can be used to mitigate it. Results from our experiments show that our proposed approach mitigates these attacks without any significant overhead.
A Reinforcement Learning Approach to job-shop Scheduling

We apply reinforce merit learning methods to learn domain-specific heuristics for job shop scheduling A repair-based scheduler starts with a critical-path schedule and incrementally repairs constraint violations with the goal of finding a short conflict-free schedule The tem poral difference algorithm is applied to tram a neural network to learn a heuristic evaluation function over s ta tes This evaluation function is used by a one-step lookahead search procedure to find good solutions to new scheduling problems We evaluate this approach on synthetic problems and on problems from a NASA space shuttle pay load processing task The evaluation function is trained on problems involving a small number of jobs and then tested on larger proble ms The TD sclied uler performs better than the best known existing algorithm for this task—Zwehen s iterative repair method based on simulated annealing The results suggest that reinforcement l<arn mg can provide a new method for constructing high-performance scheduling systems
Computational Curiosity (A Book Draft)

This book discusses computational curiosity, from the psychology of curiosity to the computational models of curiosity, and then showcases several interesting applications of computational curiosity. A brief overview of the book is given as follows. Chapter 1 discusses the underpinnings of curiosity in human beings, including the major categories of curiosity, curiosity-related emotions and behaviors, and the benefits of curiosity. Chapter 2 reviews the arousal theories of curiosity in psychology and summarizes a general two-step process model for computational curiosity. Base on the perspective of the two-step process model, Chapter 3 reviews and analyzes some of the traditional computational models of curiosity. Chapter 4 introduces a novel generic computational model of curiosity, which is developed based on the arousal theories of curiosity. After the discussion of computational models of curiosity, we outline the important applications where computational curiosity may bring significant impacts in Chapter 5. Chapter 6 discusses the application of the generic computational model of curiosity in a machine learning framework. Chapter 7 discusses the application of the generic computational model of curiosity in a recommender system. In Chapter 8 and Chapter 9, the generic computational model of curiosity is studied in two types of pedagogical agents. In Chapter 8, a curious peer learner is studied. It is a non-player character that aims to provide a believable virtual learning environment for users. In Chapter 9, a curious learning companion is studied. It aims to enhance users' learning experience through providing meaningful interactions with them. Chapter 10 discusses open questions in the research field of computation curiosity.
Deep motion features for visual tracking

Robust visual tracking is a challenging computer vision problem, with many real-world applications. Most existing approaches employ hand-crafted appearance features, such as HOG or Color Names. Recently, deep RGB features extracted from convolutional neural networks have been successfully applied for tracking. Despite their success, these features only capture appearance information. On the other hand, motion cues provide discriminative and complementary information that can improve tracking performance. Contrary to visual tracking, deep motion features have been successfully applied for action recognition and video classification tasks. Typically, the motion features are learned by training a CNN on optical flow images extracted from large amounts of labeled videos. This paper presents an investigation of the impact of deep motion features in a tracking-by-detection framework. We further show that hand-crafted, deep RGB, and deep motion features contain complementary information. To the best of our knowledge, we are the first to propose fusing appearance information with deep motion features for visual tracking. Comprehensive experiments clearly suggest that our fusion approach with deep motion features outperforms standard methods relying on appearance information alone.
Lifted Relational Neural Networks

We propose a method combining relational-logic representations with neural network learning. A general lifted architecture, possibly reflecting some background domain knowledge, is described through relational rules which may be handcrafted or learned. The relational rule-set serves as a template for unfolding possibly deep neural networks whose structures also reflect the structures of given training or testing relational examples. Different networks corresponding to different examples share their weights, which co-evolve during training by stochastic gradient descent algorithm. The framework allows for hierarchical relational modeling constructs and learning of latent relational concepts through shared hidden layers weights corresponding to the rules. Discovery of notable relational concepts and experiments on 78 relational learning benchmarks demonstrate favorable performance of the method.
The inhibitors of apoptosis (IAPs) as cancer targets

Apoptosis has been accepted as a fundamental component in the pathogenesis of cancer, in addition to other human diseases including neurodegeneration, coronary disease and diabetes. The origin of cancer involves deregulated cellular proliferation and the suppression of apoptotic processes, ultimately leading to tumor establishment and growth. Several lines of evidence point toward the IAP family of proteins playing a role in oncogenesis, via their effective suppression of apoptosis. The central mechanisms of IAP apoptotic suppression appear to be through direct caspase and pro-caspase inhibition (primarily caspase 3 and 7) and modulation of, and by, the transcription factor NF-kappaB. Thus, when the IAPs are over-expressed or over-active, as is the case in many cancers, cells are no longer able to die in a physiologically programmed fashion and become increasingly resistant to standard chemo- and radiation therapies. To date several approaches have been taken to target and eliminate IAP function in an attempt to re-establish sensitivity, reduce toxicity, and improve efficacy of cancer treatment. In this review, we address IAP proteins as therapeutic targets for the treatment of cancer and emphasize the importance of novel therapeutic approaches for cancer therapy. Novel targets of IAP function are being identified and include gene therapy strategies and small molecule inhibitors that are based on endogenous IAP antagonists. As well, molecular mechanistic approaches, such as RNAi to deplete IAP expression, are in development.
Flight mechanics of a tailless articulated wing aircraft.

This paper investigates the flight mechanics of a micro aerial vehicle without a vertical tail in an effort to reverse-engineer the agility of avian flight. The key to stability and control of such a tailless aircraft lies in the ability to control the incidence angles and dihedral angles of both wings independently. The dihedral angles can be varied symmetrically on both wings to control aircraft speed independently of the angle of attack and flight path angle, while asymmetric dihedral can be used to control yaw in the absence of a vertical stabilizer. It is shown that wing dihedral angles alone can effectively regulate sideslip during rapid turns and generate a wide range of equilibrium turn rates while maintaining a constant flight speed and regulating sideslip. Numerical continuation and bifurcation analysis are used to compute trim states and assess their stability. This paper lays the foundation for design and stability analysis of a flapping wing aircraft that can switch rapidly from flapping to gliding flight for agile manoeuvring in a constrained environment.
IT Consumerization and its Effects on IT Business Value, IT Capabilities, and the IT Function

IT consumerization is both a major opportunity and significant challenge for organizations. However, IS research has hardly discussed the implications for IT management so far. In this paper we address this topic by empirically identifying organizational themes for IT consumerization and conceptually exploring the direct and indirect effects on the business value of IT, IT capabilities, and the IT function. More specifically, based on two case studies, we identify eight organizational themes: consumer IT strategy, policy development and responsibilities, consideration of private life of employees, user involvement into IT-related processes, individualization, updated IT infrastructure, end user support, and data and system security. The contributions of this paper are (1) the identification of organizational themes for IT consumerization, (2) the proposed effects on the business value of IT, IT capabilities and the IT function, and (3) combining empirical insights into IT consumerization with managerial theories in the IS discipline.
Real-Time or Near Real-Time Persisting Daily Healthcare Data Into HDFS and ElasticSearch Index Inside a Big Data Platform

Mayo Clinic (MC) healthcare generates a large number of HL7 V2 messages—0.7–1.1 million on weekends and 1.7–2.2 million on business days at present. With multiple RDBMS-based systems, such a large volume of HL7 messages still cannot be real-time or near-real-time stored, analyzed, and retrieved for enterprise-level clinic and nonclinic usage. To determine if Big Data technology coupled with ElasticSearch technology can satisfy MC daily healthcare needs for HL7 message processing, a BigData platform was developed to contain two identical Hadoop clusters (TDH1.3.2 version)—each containing an ElasticSearch cluster and instances of a storm topology—MayoTopology for processing HL7 messages on MC ESB queues into an ElasticSearch index and the HDFS. The implemented BigData platform can process 62 ± 4 million HL7 messages per day while the ElasticSearch index can provide ultrafast free-text searching at a speed level of 0.2-s per query on an index containing a dataset of 25 million HL7-derived-JSON-documents. The results suggest that the implemented BigData platform exceeds MC enterprise-level patient-care needs.
Ethical leadership : A review and future directions

Our literature review focuses on the emerging construct of ethical leadership and compares this construct with related concepts that share a common concern for a moral dimension of leadership (e.g., spiritual, authentic, and transformational leadership). Drawing broadly from the intersection of the ethics and leadership literatures, we offer propositions about the antecedents and outcomes of ethical leadership. We also identify issues and questions to be addressed in the future and discuss their implications for research and practice. Our review indicates that ethical leadership remains largely unexplored, offering researchers opportunities for new discoveries and leaders opportunities to improve their effectiveness.
Analysis and implementation of distributed algorithms for multi-robot systems

Distributed algorithms for multi-robot systems rely on network communications to share information. However, the motion of the robots changes the network topology, which affects the information presented to the algorithm. For an algorithm to produce accurate output, robots need to communicate rapidly enough to keep the network topology correlated to their physical configuration. Infrequent communications will cause most multirobot distributed algorithms to produce less accurate results, and cause some algorithms to stop working altogether. The central theme of this work is that algorithm accuracy, communications bandwidth, and physical robot speed are related. This thesis has three main contributions: First, I develop a prototypical multi-robot application and computational model, propose a set of complexity metrics to evaluate distributed algorithm performance on multi-robot systems, and introduce the idea of the robot speed ratio, a dimensionless measure of robot speed relative to message speed in networks that rely on multi-hop communication. The robot speed ratio captures key relationships between communications bandwidth, mobility, and algorithm accuracy, and can be used at design time to trade off between them. I use this speed ratio to evaluate the performance of existing distributed algorithms for multi-hop communication and navigation. Second, I present a definition of boundaries in multi-robot systems, and develop new distributed algorithms to detect and characterize them. Finally, I define the problem of dynamic task assignment, and present four distributed algorithms that solve this problem, each representing a different trade-off between accuracy, running time, and communication resources. All the algorithms presented in this work are provably correct under ideal conditions and produce verifiable real-world performance. They are self-stabilizing and robust to communications failures, population changes, and other errors. All the algorithms were tested on a swarm of 112 robots.  Leslie P. Kaelbling Title: Professor
Curriculum Learning Based on Reward Sparseness for Deep Reinforcement Learning of Task Completion Dialogue Management

Learning from sparse and delayed reward is a central issue in reinforcement learning. In this paper, to tackle reward sparseness problem of task oriented dialogue management, we propose a curriculum based approach on the number of slots of user goals. This curriculum makes it possible to learn dialogue management for sets of user goals with large number of slots. We also propose a dialogue policy based on progressive neural networks whose modules with parameters are appended with previous parameters fixed as the curriculum proceeds, and this policy improves performances over the one with single set of parameters.
Semantics-aware malware detection

A malware detector is a system that attempts to determine whether a program has malicious intent. In order to evade detection, malware writers (hackers) frequently use obfuscation to morph malware. Malware detectors that use a pattern-matching approach (such as commercial virus scanners) are susceptible to obfuscations used by hackers. The fundamental deficiency in the pattern-matching approach to malware detection is that it is purely syntactic and ignores the semantics of instructions. In this paper, we present a malware-detection algorithm that addresses this deficiency by incorporating instruction semantics to detect malicious program traits. Experimental evaluation demonstrates that our malware-detection algorithm can detect variants of malware with a relatively low run-time overhead. Moreover our semantics-aware malware detection algorithm is resilient to common obfuscations used by hackers.
A measure of similarity between graph vertices

We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We de ne a nB nA similarity matrix S whose real entry sij expresses how similar vertex j (in GA) is to vertex i (in GB) : we say that sij is their similarity score. The similarity matrix can be obtained as the limit of the normalized even iterates of S(k+1) = BS(k)AT +BT S(k)A where A and B are adjacency matrices of the graphs and S(0) is a matrix whose entries are all equal to one. In the special case where GA = GB = G, the matrix S is square and the score sij is the similarity score between the vertices i and j of G. We point out that Kleinberg’s \hub and authority" method to identify web-pages relevant to a given query can be viewed as a special case of our de nition in the case where one of the graphs has two vertices and a unique directed edge between them. In analogy to Kleinberg, we show that our similarity scores are given by the components of a dominant eigenvector of a non-negative matrix. Potential applications of our similarity concept are numerous. We illustrate an application for the automatic extraction of synonyms in a monolingual dictionary.
Distributed Multi-Robot Localization

This paper presents a new approach to the cooperative localization problem, namely distributed multi-robot localization. A group of M robots is viewed as a single system composed of robots that carry, in general, di erent sensors and have di erent positioning capabilities. A single Kalman lter is formulated to estimate the position and orientation of all the members of the group. This centralized schema is capable of fusing information provided by the sensors distributed on the individual robots while accommodating independencies and interdependencies among the collected data. In order to allow for distributed processing, the equations of the centralized Kalman lter are treated so that this lter can be decomposed into M modi ed Kalman lters each running on a separate robot. The distributed localization algorithm is applied to a group of 3 robots and the improvement in localization accuracy is presented.
An initial analysis of semantic wikis

Semantic wikis augment wikis with semantic properties that can be used to aggregate and query data through reasoning. Semantic wikis are used by many communities, for widely varying purposes such as organizing genomic knowledge, coding software, and tracking environmental data. Although wikis have been analyzed extensively, there has been no published analysis of the use of semantic wikis. We carried out an initial analysis of twenty semantic wikis selected for their diverse characteristics and content. Based on the number of property edits per contributor, we identified several patterns to characterize community behaviors that are common to groups of wikis.
Distinct mechanisms regulate slow-muscle development

Vertebrate muscle development begins with the patterning of the paraxial mesoderm by inductive signals from midline tissues [1, 2]. Subsequent myotome growth occurs by the addition of new muscle fibers. We show that in zebrafish new slow-muscle fibers are first added at the end of the segmentation period in growth zones near the dorsal and ventral extremes of the myotome, and this muscle growth continues into larval life. In marine teleosts, this mechanism of growth has been termed stratified hyperplasia . We have tested whether these added fibers require an embryonic architecture of muscle fibers to support their development and whether their fate is regulated by the same mechanisms that regulate embryonic muscle fates. Although Hedgehog signaling is required for the specification of adaxial-derived slow-muscle fibers in the embryo [4, 5], we show that in the absence of Hh signaling, stratified hyperplastic growth of slow muscle occurs at the correct time and place, despite the complete absence of embryonic slow-muscle fibers to serve as a scaffold for addition of these new slow-muscle fibers. We conclude that slow-muscle-stratified hyperplasia begins after the segmentation period during embryonic development and continues during the larval period. Furthermore, the mechanisms specifying the identity of these new slow-muscle fibers are different from those specifying the identity of adaxial-derived embryonic slow-muscle fibers. We propose that the independence of early, embryonic patterning mechanisms from later patterning mechanisms may be necessary for growth.