nils-herrmann/clean_scirepeval huggingface dataset:
DNA transfer: review and implications for casework.

DNA-bearing cellular material can come to be present on a surface by either direct or indirect transfer. Direct transfer includes contact, but also includes activities within the vicinity of an item that may result in the transfer of DNA directly from an individual without any contact, such as speaking, coughing, and sneezing. Indirect transfer of DNA is when DNA from an individual comes to be on an item via an intermediary surface. It is important to consider indirect transfer in the evaluation of trace DNA in casework. The term 'trace DNA' in this review refers solely to DNA that cannot be attributed to an identifiable body fluid. This review presents and considers data from trace DNA experiments to establish whether the quantity of DNA recovered from a crime stain and/or the quality of a DNA profile obtained can be used to infer the likely mechanism of transfer. The data show that varied results are obtained from apparently similar trace DNA samples, presumably due to the many factors that affect the detection of trace DNA. The nature and effect of these varying factors and the application of the data to casework is considered generally and with specific reference to DNA transfer to skin, DNA beneath fingernails, 'wearer DNA', and various contamination considerations.
A Wideband Slotted Bow-Tie Antenna With Reconfigurable CPW-to-Slotline Transition for Pattern Diversity

We propose a slotted bow-tie antenna with pattern reconfigurability. The antenna consists of a coplanar waveguide (CPW) input, a pair of reconfigurable CPW-to-slotline transitions, a pair of Vivaldi-shaped radiating tapered slots, and four PIN diodes for reconfigurability. With suitable arrangement of the bias network, the proposed antenna demonstrates reconfigurable radiation patterns in the frequency range from 3.5 to 6.5 GHz in three states: a broadside radiation with fairly omnidirectional pattern and two end-fire radiations whose main beams are directed to exactly opposite directions. The proposed antenna is investigated comprehensively with the help of the radiation patterns in the two principal cuts and also the antenna gain responses versus frequencies. The simulation and measurement results reveal fairly good agreement and hence sustain the reconfigurability of the proposed design.
Attention, Intentions, and the Structure of Discourse

In this paper we explore a new theory of discourse structure that stresses the role of purpose and processing in discourse. In this theory, discourse structure is composed of three separate but interrelated components: the structure of the sequence of utterances (called the linguistic structure), a structure of purposes (called the intentional structure), and the state of focus of attention (called the attentional state). The linguistic structure consists of segments of the discourse into which the utterances naturally aggregate. The intentional structure captures the discourse-relevant purposes, expressed in each of the linguistic segments as well as relationships among them. The attentional state is an abstraction of the focus of attention of the participants as the discourse unfolds. The attentional state, being dynamic, records the objects, properties, and relations that are salient at each point of the discourse. The distinction among these components is essential to provide an adequate explanation of such discourse phenomena as cue phrases, referring expressions, and interruptions. The theory of attention, intention, and aggregation of utterances is illustrated in the paper with a number of example discourses. Various properties of discourse are described, and explanations for the behavior of cue phrases, referring expressions, and interruptions are explored. This theory provides a framework for describing the processing of utterances in a discourse. Discourse processing requires recognizing how the utterances of the discourse aggregate into segments, recognizing the intentions expressed in the discourse and the relationships among intentions, and tracking the discourse through the operation of the mechanisms associated with attentional state. This processing description specifies in these recognition tasks the role of information from the discourse and from the participants' knowledge of the domain.
A Deep Learning Approach to Identifying Shock Locations in Turbulent Combustion Tensor Fields

We introduce a deep learning approach for the identification of shock locations in large scale tensor field datasets. Such datasets are typically generated by turbulent combustion simulations. In this proof of concept approach, we use deep learning to learn mappings from strain tensors to Schlieren images which serve as labels. The use of neural networks allows for the Schlieren values to be accurately approximated more efficiently than calculating the values from the density gradient. In addition, we show that this approach can be used to predict the Schlieren values for both two-dimensional and three-dimensional tensor fields, potentially allowing for anomaly detection in tensor flows. Results on two shock example datasets show that this approach can assist in the extraction of features from reacting flow tensor fields.
Semi-Global Weighted Least Squares in Image Filtering

Solving the global method of Weighted Least Squares (WLS) model in image filtering is both time- and memory-consuming. In this paper, we present an alternative approximation in a time- and memory- efficient manner which is denoted as Semi-Global Weighed Least Squares (SG-WLS). Instead of solving a large linear system, we propose to iteratively solve a sequence of subsystems which are one-dimensional WLS models. Although each subsystem is one-dimensional, it can take two-dimensional neighborhood information into account due to the proposed special neighborhood construction. We show such a desirable property makes our SG-WLS achieve close performance to the original two-dimensional WLS model but with much less time and memory cost. While previous related methods mainly focus on the 4-connected/8-connected neighborhood system, our SG-WLS can handle a more general and larger neighborhood system thanks to the proposed fast solution. We show such a generalization can achieve better performance than the 4-connected/8-connected neighborhood system in some applications. Our SG-WLS is ~ 20 times faster than the WLS model. For an image of M × N, the memory cost of SG-WLS is at most at the magnitude of max{$$} of that of the WLS model. We show the effectiveness and efficiency of our SG-WLS in a range of applications.
A model for team-based access control (TMAC 2004)

Role based access control (RBAC) has been proved to be effective for defining access control. However, in an environment where collaborative work is needed, additional features should be added on top of RBAC to accommodate the new requirements. In this paper we describe a team access control extension model called TMAC04 (Team-Based Access Control 2004), which is built on the well-known RBAC. The TMAC04 model efficiently represents teamwork in the real world. It allows certain users to join a team based on their existing roles in an organization within limited contexts and new permissions to perform the required work.
Development of a deep silicon phase Fresnel lens using Gray-scale lithography and deep reactive ion etching

We report the first fabrication and development of a deep phase Fresnel lens (PFL) in silicon through the use of gray-scale lithography and deep-reactive ion etching (DRIE). A Gaussian tail approximation is introduced as a method of predicting the height of photoresist gray levels given the relative amount of transmitted light through a gray-scale optical mask. Device mask design is accomplished through command-line scripting in a CAD tool to precisely define the millions of pixels required to generate the appropriate profile in photoresist. Etch selectivity during DRIE pattern transfer is accurately controlled to produce the desired scaling factor between the photoresist and silicon profiles. As a demonstration of this technology, a 1.6-mm diameter PFL is etched 43 /spl mu/m into silicon with each grating profile designed to focus 8.4 keV photons a distance of 118 m.
The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs

In the game of Kal-toh depicted in the television series Star Trek: Voyager, players attempt to create polyhedra by adding to a jumbled collection of metal rods. Inspired by this fictional game, we formulate graph-theoretical questions about polyhedral (triconnected and planar) subgraphs in an on-line environment. The problem of determining the existence of a polyhedral subgraph within a graph G is shown to be NP-hard, and we also give some non-trivial upper bounds for the problem of determining the minimum number of edge additions necessary to guarantee the existence of a polyhedral subgraph in G. A two-player formulation of Kal-toh is also explored, in which the first player to form a target subgraph is declared the winner. We show a polynomial-time solution for simple cases of this game but conjecture that the general problem is NP-hard.
Interactive Visualization of Small World Graphs

Many real world graphs have small world characteristics, that is, they have a small diameter compared to the number of nodes and exhibit a local cluster structure. Examples are social networks, software structures, bibliographic references and biological neural nets. Their high connectivity makes both finding a pleasing layout and a suitable clustering hard. In this paper we present a method to create scalable, interactive visualizations of small world graphs, allowing the user to inspect local clusters while maintaining a global overview of the entire structure. The visualization method uses a combination of both semantical and geometrical distortions, while the layout is generated by a spring embedder algorithm using recently developed force model. We use a cross referenced database of 500 artists as a running example
Deep residual coalesced convolutional network for efficient semantic road segmentation

This paper proposes a deep learning-based efficient and compact solution for road scene segmentation problem, named deep residual coalesced convolutional network (RCC-Net). Initially, the RCC-Net performs dimensionality reduction to compress and extract relevant features, from which it is subsequently delivered to the encoder. The encoder adopts the residual network style for efficient model size. In the core of each residual network, three different convolutional layers are simultaneously coalesced for obtaining broader information. The decoder is then altered to upsample the encoder for pixel-wise mapping from the input images to the segmented output. Experimental results reveal the efficacy of the proposed network over the state-of-the-art methods and its capability to be deployed in an average system.
Joint Bayesian guided metric learning for end-to-end face verification

In this work, we address the problem of face verification, namely determining whether a pair of face images belongs to the same or different subjects. Previous works often consider solving the problem of face verification in two steps: feature extraction and face recognition, resulting in a fragmented procedure. We argue that these techniques, although working well, fail to explicitly exploit a full end-to-end framework for face verification, which has received much attention and achieved significant improvements recently. In this paper, we propose a novel Joint Bayesian guided metric learning technique for dealing with the face verification task, which well integrates the above two steps of face verification into an end-to-end convolutional neural network (CNN) architecture. In the training stage, an initial neural network, which has the similar architecture with GoogLeNet CNN model, is firstly pre-trained by optimizing classification-based objective functions on the publicly available CASIA WebFace database. Based on constructed face pairs dataset from CASIA WebFace and LFW datasets, we then fine-tune the whole network parameters under the guide of the learned knowledge, which is obtained from the highly successful Joint Bayesian model. This guided learning procedure, which can also be seen as a metric learning technique, can further update network parameters for discriminating face pairs. In the testing process, the outputs by this unified network are discriminated with a threshold value to produce the ultimate prediction for the face verification task. Comprehensive evaluations over the LFW dataset well demonstrate the encouraging face verification performance of our proposed framework.
A Model for Competence and Integrity in Variable Payoff Games

Agents often have to trust one another when engaging in joint actions. In many cases, no single design team has the authority to assure that agents cooperate. Trust is required when agents hold potentially different values or conflicting goals. This paper presents a framework and some initial experiments for decomposing agent reputation within a multi-agent society into two characteristics: competence and integrity. The framework models competence as the probability of successfully carrying out an intended action. Integrity is modeled as a rational commitment to maintaining a reputation, based on the agent’s assessment of the game’s discount rate. We show that a simple, one-level-deep recursive model—given accurate knowledge of self and the other agent’s competence and integrity (commitment to reputation)—outperforms titfor-tat and other standard strategies in evolutionary round-robin iterated prisoner’s dilemma tournaments. This indicates that the approach taken here warrants further investigation using more realistic and complex strategies.
Social event extraction: Task, challenges and techniques

Social media (e.g., Facebook and Twitter) serves as a popular platform for online communication and information dissemination, where users can effectively share information such as their recent activities and plans. This kind of information is extremely valuable for building recommendation systems. For example, a user might wish to receive alerts whenever a concert takes place near his current location or when a party will be held in his neighborhood. However, such events may not be widespread across social networks, they have not received sufficient attention. Moreover, traditional event discovery and event extraction techniques trained from formal genres cannot be effectively adapted to this domain. In this paper, we present the first formal definition of social events, discuss the annotation challenges and release a benchmark for the research community. Further more, we propose two novel solutions for extracting elements from social events: (1) an unsupervised content segmentation framework to extract event phrases (2) utilize external knowledge bases to detect fine-grained event locations and unveil their background information. Experimental results convincingly demonstrate that our approach can accurately extract social events from social media.
Study of security and effectiveness of DoIP in vehicle networks

As the number of Electronic Control Unit increased in automotive system, its memory capability and functionalities have also increased in large scale. These large number of high functional Electronic Control Units (ECU) in vehicle system demand for high data rate connectivity to external network and within in-vehicle network. This high data rate requirement lead to the introduction of Ethernet Technology to the vehicle network system, which also provide the remote vehicle access and remote diagnostic functionalities to the vehicle network. Diagnostics over IP (DoIP) have standardized as international standard for diagnostics over IP which is documented in ISO 13400 DIS. This survey studies different technologies in vehicle network and are compared based on the data rate for diagnostics and a study of different Communication scenarios along with safety and security requirements of DoIP protocol is examined.
Robust and Accurate Coronary Artery Centerline Extraction in CTA by Combining Model-Driven and Data-Driven Approaches

Various methods have been proposed to extract coronary artery centerlines from computed tomography angiography (CTA) data. Almost all previous approaches are data-driven, which try to trace a centerline from an automatically detected or manually specified coronary ostium. No or little high level prior information is used; therefore, the centerline tracing procedure may terminate early at a severe occlusion or an anatomically inconsistent centerline course may be generated. Though the connectivity of coronary arteries exhibits large variations, the position of major coronary arteries relative to the heart chambers is quite stable. In this work, we propose to exploit the automatically segmented chambers to 1) predict the initial position of the major coronary centerlines and 2) define a vessel-specific region-of-interest (ROI) to constrain the following centerline refinement. The proposed prior constraints have been integrated into a model-driven algorithm for the extraction of three major coronary centerlines, namely the left anterior descending artery (LAD), left circumflex artery (LCX), and right coronary artery (RCA). After extracting the major coronary arteries, the side branches are traced using a data-driven approach to handle large anatomical variations in side branches. Experiments on the public Rotterdam coronary CTA database demonstrate the robustness and accuracy of the proposed method. We achieve the best average ranking on overlap metrics among automatic methods and our accuracy metric outperforms all other 22 methods (including both automatic and semi-automatic methods).
Semantic Segmentation of Colorectal Polyps with DeepLab and LSTM Networks

In this work we attempted to use the existing deep neural network called DeepLab_v3 to detect the polyps in colonoscopy images. Due to its large structure, the location of polyps may not be preserved and transmitted effectively. To address the issue we combined Long Short-Term Memory networks and DeepLab_v3 in parallel to augment the signal of the polyps' location. The new modification was examined with the colonoscopy image database ‘CVC-ClinicDB’ from MICCAI sub-challenge 2015. After training with 267 images and testing with 345 images, we got a good performance, 93.21% mean Intersection over Union (mIOU). The average computing time is 0.023 second per image. Once the model is applied to clinical colonoscopy exam videos, it could provide effective second opinions in real time to aid the diagnosis.
Neural Audio Synthesis of Musical Notes with WaveNet Autoencoders

Generative models in vision have seen rapid progress due to algorithmic improvements and the availability of high-quality image datasets. In this paper, we offer contributions in both these areas to enable similar progress in audio modeling. First, we detail a powerful new WaveNet-style autoencoder model that conditions an autoregressive decoder on temporal codes learned from the raw audio waveform. Second, we introduce NSynth, a large-scale and high-quality dataset of musical notes that is an order of magnitude larger than comparable public datasets. Using NSynth, we demonstrate improved qualitative and quantitative performance of the WaveNet autoencoder over a well-tuned spectral autoencoder baseline. Finally, we show that the model learns a manifold of embeddings that allows for morphing between instruments, meaningfully interpolating in timbre to create new types of sounds that are realistic and expressive.
INCREMENTAL SENSOR FUSION IN FACTOR GRAPHS WITH UNKNOWN DELAYS

Sensor fusion by incremental smoothing in factor graphs allows the easy incorporation of asynchronous and delayed measurements, which is one of the main advantages of this approach compared to the ubiquitous filtering techniques. While incorporating delayed measurements into the factor graph representation is in principle easy when the delay is known, handling unknown delays is a non-trivial task that has not been explored before in this context. Our paper addresses the problem of performing incremental sensor fusion in factor graphs when some of the sensor information arrive with a significant unknown delay. We develop and compare two techniques to handle such delayed measurements under mild conditions on the characteristics of that delay: We consider the unknown delay to be bounded and quantizable into multiples of the state transition cycle time. The proposed methods are evaluated using a simulation of a dynamic 3-DoF system that fuses odometry and GPS measurements.
Heart rate variability and its relation to prefrontal cognitive function: the effects of training and detraining

The aim of the present study was to investigate the relationship between physical fitness, heart rate variability (HRV) and cognitive function in 37 male sailors from the Royal Norwegian Navy. All subjects participated in an 8-week training program, after which the subjects completed the initial cognitive testing (pre-test). The subjects were assigned into a detrained group (DG) and a trained group (TG) based on their application for further duty. The DG withdrew from the training program for 4 weeks after which all subjects then completed the cognitive testing again (post-test). Physical fitness, measured as maximum oxygen consumption (V̇O2max), resting HRV, and cognitive function, measured using a continuous performance task (CPT) and a working memory test (WMT), were recorded during the pre-test and the post-test, and the data presented as the means and standard deviations. The results showed no between-group differences in V̇O2max or HRV at the pre-test. The DG showed a significant decrease in V̇O2max from the pre- to the post-test and a lower resting HRV than the TG on the post-test. Whereas there were no between-group differences on the CPT or WMT at the pre-test, the TG had faster reaction times and more true positive responses on tests of executive function at the post-test compared to the pre-test. The DG showed faster reaction times on non-executive tasks at the post-test compared to the pre-test. The results are discussed within a neurovisceral integration framework linking parasympathetic outflow to the heart to prefrontal neural functions.
Contributions from research on anger and cognitive dissonance to understanding the motivational functions of asymmetrical frontal brain activity

Research has suggested that approach-related positive emotions are associated with greater left frontal brain activity and that withdrawal-related negative emotions are associated with greater right frontal brain activity. Different explanations have been proposed. One posits that frontal asymmetry is due to emotional valence (positivity/negativity), one posits that frontal asymmetry is due to motivational direction (approach/withdrawal), and one posits that frontal asymmetry is due to a combination of emotional valence and motivational direction (positive-approach/negative-withdrawal). Because research had confounded emotional valence and motivational direction, the theoretical explanation was muddled. Solely supporting the motivational direction model, recent research has revealed that anger and cognitive dissonance, emotions with negative valence and approach motivational tendencies, are related to relatively greater left frontal activity.