nils-herrmann/clean_scirepeval huggingface dataset:
Distributed Auction Algorithms for the Assignment Problem with Partial Information

operations centers (MOC), in which multiple DMs with partial information and partial control over assets are involved in the development of operational level plans. The MOC emphasizes standardized processes and methods, centralized assessment and guidance, networked distributed planning capabilities, and decentralized execution for assessing, planning and executing missions across a range of military operations  Task-asset assignment is a fundamental problem paradigm in a wide variety of applications. Typical problem setting involves a single decision maker (DM) who has complete knowledge of the weight (reward, benefit, accuracy) matrix and who can control any of the assets to execute the tasks. Motivated by planning problems arising in distributed organizations, this paper introduces a novel variation of the assignment problem, wherein there are multiple DMs and each DM knows only a part of the weight matrix and/or controls a subset of the assets. We extend the auction algorithm to such realistic settings with various partial information structures using a blackboard coordination structure. We show that by communicating the bid, the best and the second best profits among DMs and with a coordinator, the DMs can reconstruct the centralized assignment solution. The auction setup provides a nice analytical framework for formalizing how team members build internal models of other DMs and achieve team cohesiveness over time. . In this vein, we are developing analytical and computational models for multi-level coordinated mission planning and monitoring processes associated with MOCs, so that they can function effectively in highly dynamic, asymmetric, and unpredictable mission environments. Two key problem areas are: 1) realistic modeling of multi-level coordination structures that link tactical, operational and strategic levels of decision making; and 2) collaborative planning with partial information and partial control of assets. In the collaborating planning problem, each DM “owns” a set of assets and is responsible for planning certain tasks. Each task is characterized by a vector of resource requirements, while each asset is characterized by a vector of resource capabilities . Multiple assets (from the same DM or multiple DMs) may be required to process a task. The degree of match between the task-resource requirement vector and asset-resource capability vector determines the accuracy of task execution. In addition, the elements of
Markov Chains on Orbits of Permutation Groups

We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the symmetries of graphical models. Second, we introduce orbital Markov chains, a novel family of Markov chains leveraging model symmetries to reduce mixing times. We establish an insightful connection between model symmetries and rapid mixing of orbital Markov chains. Thus, we present the first lifted MCMC algorithm for probabilistic graphical models. Both analytical and empirical results demonstrate the effectiveness and efficiency of the approach.
An Introduction to Locally Linear Embedding

Many problemsin informationprocessinginvolvesomeform of dimensionality reduction.Herewe describelocally linearembedding(LLE), anunsupervisedlearningalgorithmthat computeslow dimensional,neighborhood preservingembeddingsof high dimensionaldata.LLE attemptsto discover nonlinearstructurein high dimensionaldataby exploiting thelocal symmetries of linear reconstructions.Notably, LLE mapsits inputs into a single global coordinatesystemof lower dimensionality, and its optimizations— thoughcapableof generatinghighly nonlinearembeddings—donot involve localminima.We illustratethemethodon imagesof lips usedin audiovisual speechsynthesis.
DeepTag: inferring diagnoses from veterinary clinical notes

Large scale veterinary clinical records can become a powerful resource for patient care and research. However, clinicians lack the time and resource to annotate patient records with standard medical diagnostic codes and most veterinary visits are captured in free-text notes. The lack of standard coding makes it challenging to use the clinical data to improve patient care. It is also a major impediment to cross-species translational research, which relies on the ability to accurately identify patient cohorts with specific diagnostic criteria in humans and animals. In order to reduce the coding burden for veterinary clinical practice and aid translational research, we have developed a deep learning algorithm, DeepTag, which automatically infers diagnostic codes from veterinary free-text notes. DeepTag is trained on a newly curated dataset of 112,558 veterinary notes manually annotated by experts. DeepTag extends multitask LSTM with an improved hierarchical objective that captures the semantic structures between diseases. To foster human-machine collaboration, DeepTag also learns to abstain in examples when it is uncertain and defers them to human experts, resulting in improved performance. DeepTag accurately infers disease codes from free-text even in challenging cross-hospital settings where the text comes from different clinical settings than the ones used for training. It enables automated disease annotation across a broad range of clinical diagnoses with minimal preprocessing. The technical framework in this work can be applied in other medical domains that currently lack medical coding resources.
Controlling Physically Based Virtual Musical Instruments Using The Gloves

In this paper we propose an empirical method to develop mapping strategies between a gestural-based interface (the Gloves) and physically based sound synthesis models. An experiment was conducted to investigate which gestures listeners associate with sounds synthesised using physical models, corresponding to three categories of sound: sustained, iterative and impulsive. The results of the experiment show that listeners perform similar gestures when controlling sounds from the different categories. We used such gestures in order to create the mapping strategy between the Gloves and the physically based synthesis engine.
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

A family of graph-theoretical algorithms based on the minimal spanning tree are capable of detecting several kinds of cluster structure in arbitrary point sets; description of the detected clusters is possible in some cases by extensions of the method. Development of these clustering algorithms was based on examples from two-dimensional space because we wanted to copy the human perception of gestalts or point groupings. On the other hand, all the methods considered apply to higher dimensional spaces and even to general metric spaces. Advantages of these methods include determinacy, easy interpretation of the resulting clusters, conformity to gestalt principles of perceptual organization, and invariance of results under monotone transformations of interpoint distance. Brief discussion is made of the application of cluster detection to taxonomy and the selection of good feature spaces for pattern recognition. Detailed analyses of several planar cluster detection problems are illustrated by text and figures. The well-known Fisher iris data, in four-dimensional space, have been analyzed by these methods also. PL/1 programs to implement the minimal spanning tree methods have been fully debugged.
Exceeding chance level by chance: The caveat of theoretical chance levels in brain signal classification and statistical assessment of decoding accuracy

Machine learning techniques are increasingly used in neuroscience to classify brain signals. Decoding performance is reflected by how much the classification results depart from the rate achieved by purely random classification. In a 2-class or 4-class classification problem, the chance levels are thus 50% or 25% respectively. However, such thresholds hold for an infinite number of data samples but not for small data sets. While this limitation is widely recognized in the machine learning field, it is unfortunately sometimes still overlooked or ignored in the emerging field of brain signal classification. Incidentally, this field is often faced with the difficulty of low sample size. In this study we demonstrate how applying signal classification to Gaussian random signals can yield decoding accuracies of up to 70% or higher in two-class decoding with small sample sets. Most importantly, we provide a thorough quantification of the severity and the parameters affecting this limitation using simulations in which we manipulate sample size, class number, cross-validation parameters (k-fold, leave-one-out and repetition number) and classifier type (Linear-Discriminant Analysis, Naïve Bayesian and Support Vector Machine). In addition to raising a red flag of caution, we illustrate the use of analytical and empirical solutions (binomial formula and permutation tests) that tackle the problem by providing statistical significance levels (p-values) for the decoding accuracy, taking sample size into account. Finally, we illustrate the relevance of our simulations and statistical tests on real brain data by assessing noise-level classifications in Magnetoencephalography (MEG) and intracranial EEG (iEEG) baseline recordings.
Spectral and temporal processing in human auditory cortex.

We used positron emission tomography to examine the response of human auditory cortex to spectral and temporal variation. Volunteers listened to sequences derived from a standard stimulus, consisting of two pure tones separated by one octave alternating with a random duty cycle. In one series of five scans, spectral information (tone spacing) remained constant while speed of alternation was doubled at each level. In another five scans, speed was kept constant while the number of tones sampled within the octave was doubled at each level, resulting in increasingly fine frequency differences. Results indicated that (i) the core auditory cortex in both hemispheres responded to temporal variation, while the anterior superior temporal areas bilaterally responded to the spectral variation; and (ii) responses to the temporal features were weighted towards the left, while responses to the spectral features were weighted towards the right. These findings confirm the specialization of the left-hemisphere auditory cortex for rapid temporal processing, and indicate that core areas are especially involved in these processes. The results also indicate a complementary hemispheric specialization in right-hemisphere belt cortical areas for spectral processing. The data provide a unifying framework to explain hemispheric asymmetries in processing speech and tonal patterns. We propose that differences exist in the temporal and spectral resolution of corresponding fields in the two hemispheres, and that they may be related to anatomical hemispheric asymmetries in myelination and spacing of cortical columns.
CS 224N Assignment 4: Question Answering on SQuAD

In this project, we are interested in building an end-to-end neural network architecture for the Question Answering task on the well-known Stanford Question Answering Dataset (SQuAD). Our implementation is motivated from a recent highperformance achieving method that combines coattention encoder with a dynamic pointing decoder known as Dynamic Coattention Network. We explored different ensemble and test decoding techniques that we believe might improve the performance of such systems.
Design for auto-tuning PID controller based on genetic algorithms

This paper presents a method of designing proportional-integral-derivative (PID) controller based on genetic algorithms (GA). Ziegler-Nichols tuning formula has been used for predicting the range of gain coefficients of GA-PID controller. The use of GA for optimizing the gain coefficients of PID controller has considerably improved the performance of PID controller. Simulation studies on a second-order and a third-order control system demonstrate that the proposed controller provides high performance of dynamic and static characteristics.
Delta Operation Language for Model Difference Representation

Software models evolve over time undergoing various changes and resulting in several versions during their lifetime. Models are differentiated during the evolution process and the differences between subsequent model versions are represented in differences documents for further analysis and manipulations as history information. Software models have rich data structures which differ from the code of software systems. That is why, a representation approach for the model differences has to provide effective handling and management of difference information. Furthermore, the model differences represented in the differences documents have to be easy to access and reuse. This paper introduces the Delta Operations Language (DOL), a meta-model independent and operation-based approach to model difference representations. The approach represents the model differences in terms of DOL and provides several DOL Services to access and reuse the DOL-based differences for further analysis and manipulations. To explain ideas behind the approach, it is applied to UML activity diagrams as a running example.
THE EFFECTS OF MYOFASCIAL RELEASE VS STATIC STRETCHING ON HAMSTRINGS RANGE OF MOTION

The purpose of this study was to investigate the effects of three days of foam rolling on the hamstrings range of motion in comparison with static stretching. Lower extremity injuries are prevalent in strength training and sports today. Poor flexibility has been found to increase the risk of overuse injuries and significantly affect the individual's level of function and performance. Self myofascial release (SMR), foam rolling, is a recent modality clinically used to increase flexibility. On the other hand, there are few research studies on the technique. Twenty college students participated in this study. Ten participants were in the static stretching group, while ten participants were in the SMR group. Participants received the treatment three times in one week with at least 48 hours between treatments. The treatments were static stretching and SMR for three minutes of stretching the hamstrings muscles. The wall sit-and-reach test was used to measure hamstrings range of motion. Measurements were made at the beginning of the study and after each treatment. iv The acute stretching programs increased hamstrings range of motion in the self myofascial release group (28.9%) and static group (33.2%) respectively. The Group by Time ANOVA for flexibility revealed that there was no main effect of Group (F(1,18) = 3.629, p = 0.0729), but that there was a main effect of Time (F(3,54) = 32.130, p =.0001). At the same time there was no Group by Time interaction (F(3,54) = 1.152, p =.3366). These data suggest that self myofascial release compared to static stretching did not have a greater effect on hamstrings range of motion, but both groups increased range of motion from pretest to posttest.
Variational Inference for Data-Efficient Model Learning in POMDPs

Partially observable Markov decision processes (POMDPs) are a powerful abstraction for tasks that require decision making under uncertainty, and capture a wide range of real world tasks. Today, effective planning approaches exist that generate effective strategies given black-box models of a POMDP task. Yet, an open question is how to acquire accurate models for complex domains. In this paper we propose DELIP, an approach to model learning for POMDPs that utilizes structured, amortized variational inference. We empirically show that our model leads to effective control strategies when coupled with state-of-the-art planners. Intuitively, model-based approaches should be particularly beneficial in environments with changing reward structures, or where rewards are initially unknown. Our experiments confirm that DELIP is particularly effective in this setting.
Automatic Table Ground Truth Generation and a Background-Analysis-Based Table Structure Extraction Method

In this paper, we first describe an automatic table ground truth generation system which can efficiently generate a large amount of accurate table ground truth suitable for the development of table detection algorithms. Then a novel background-analysis-based, coarse-to-fine table identification algorithm and an X-Y cut table decomposition algorithm are described. We discuss an experimental protocol to evaluate the table detection algorithms. For a total of 1; 125 document pages having 518 table entities and a total of 10; 941 cell entities, our table detection algorithm takes line, word segmentation results as input and obtains around 90% cell correct detection rates.
Accidental displacement and migration of endosseous implants into 
adjacent craniofacial structures: A review and update

Accidental displacement of endosseous implants into the maxillary sinus is an unusual but potential complication in implantology procedures due to the special features of the posterior aspect of the maxillary bone; there is also a possibility of migration throughout the upper paranasal sinuses and adjacent structures. The aim of this paper is to review the published literature about accidental displacement and migration of dental implants into the maxillary sinus and other adjacent structures.



A review has been done based on a search in the main on-line medical databases looking for papers about migration of dental implants published in major oral surgery, periodontal, dental implant and ear-nose-throat journals, using the keywords "implant," "migration," "complication," "foreign body" and "sinus."



24 articles showing displacement or migration to maxillary, ethmoid and sphenoid sinuses, orbit and cranial fossae, with different degrees of associated symptoms, were identified. Techniques found to solve these clinical issues include Cadwell-Luc approach, transoral endoscopy approach via canine fossae and transnasal functional endoscopy surgery.



Before removing the foreign body, a correct diagnosis should be done in order to evaluate the functional status of the ostiomeatal complex and the degree of affectation of paranasal sinuses and other involved structures, determining the size and the exact location of the foreign body. After a complete diagnosis, an indicated procedure for every case would be decided.
A Deep-Learning Approach for the Detection of Overexposure in Automotive Camera Images

To bring autonomous driving onto public roads, autonomous vehicles must be able to make safe driving decisions. In order to achieve this, they need to be self-aware, meaning they have to be aware of their current capabilities at all times. One step towards self-awareness is the assessment of the quality of the available sensor data and the estimation of its impact on the processing chain. Knowing when sensor data is compromised will contribute to safer driving decisions of the vehicle. In this contribution, we present a novel, deep-learning approach for overexposure detection in camera images as one step towards sensor data quality monitoring.
Challenges and trends in low-power 3D die-stacked IC designs using RAM, memristor logic, and resistive memory (ReRAM)

Low power 3D-IC is well-suited to mobile systems; however, it poses a number of challenges associated with thermal stress, particularly in designs with many stacked layers. The use of a low supply voltage (VDD) and power-down mode help to reduce the power consumption of 3D-ICs, while alleviating aging and thermal effects. These solutions require low-voltage memory and power-down circuitry. Memristor-based logic provides good state retention and restore for power-down operation, and resistive RAM (ReRAM) uses a lower write voltage than conventional Flash memory. This paper reviews design challenges associated with low-voltage SRAM, memristor logic, and ReRAM. We also propose a novel scheme involving homogeneous memory with heterogeneous VDD (HMHV) to further reduce the power consumption of 3D-ICs comprising multiple memory layers.
A Low-Cost Sensor Network for Real-Time Monitoring and Contamination Detection in Drinking Water Distribution Systems

This paper presents a low cost and holistic approach to the water quality monitoring problem for drinking water distribution systems as well as for consumer sites. Our approach is based on the development of low cost sensor nodes for real time and in-pipe monitoring and assessment of water quality on the fly. The main sensor node consists of several in-pipe electrochemical and optical sensors and emphasis is given on low cost, lightweight implementation, and reliable long time operation. Such implementation is suitable for large scale deployments enabling a sensor network approach for providing spatiotemporally rich data to water consumers, water companies, and authorities. Extensive literature and market research are performed to identify low cost sensors that can reliably monitor several parameters, which can be used to infer the water quality. Based on selected parameters, a sensor array is developed along with several microsystems for analog signal conditioning, processing, logging, and remote presentation of data. Finally, algorithms for fusing online multisensor measurements at local level are developed to assess the water contamination risk. Experiments are performed to evaluate and validate these algorithms on intentional contamination events of various concentrations of escherichia coli bacteria and heavy metals (arsenic). Experimental results indicate that this inexpensive system is capable of detecting these high impact contaminants at fairly low concentrations. The results demonstrate that this system satisfies the online, in-pipe, low deployment-operation cost, and good detection accuracy criteria of an ideal early warning system.
Cassandra: a decentralized structured storage system

Cassandra is a distributed storage system for managing very large amounts of structured data spread out across many commodity servers, while providing highly available service with no single point of failure. Cassandra aims to run on top of an infrastructure of hundreds of nodes (possibly spread across different data centers). At this scale, small and large components fail continuously. The way Cassandra manages the persistent state in the face of these failures drives the reliability and scalability of the software systems relying on this service. While in many ways Cassandra resembles a database and shares many design and implementation strategies therewith, Cassandra does not support a full relational data model; instead, it provides clients with a simple data model that supports dynamic control over data layout and format. Cassandra system was designed to run on cheap commodity hardware and handle high write throughput while not sacrificing read efficiency.
A Flight Demonstrations of unmanned Aerial Vehicle swarming concepts

pL has been engaged in a number of independent research and development projects over the past 5 years intended to demonstrate the cooperative behaviors of swarms of small, autonomous unmanned aerial vehicles (uAVs). swarm members cooperate to accomplish complex mission goals with no human in the loop. These projects represent a variety of approaches to uAV swarming, including teaming, consensus variables, and stigmergic potential fields. A series of experiments was conducted from 2001 through 2005 to demonstrate these concepts, and research in this area is ongoing. As a result of these efforts, ApL has developed autonomy frameworks, hardware architectures, and communications concepts that are applicable across a broad range of small, autonomous aerial vehicles.