nils-herrmann/clean_scirepeval huggingface dataset:
Detection of curcumin and its metabolites in hepatic tissue and portal blood of patients following oral administration

Studies in vitro and in animal models of colorectal and hepatocellular cancers suggest that curcumin is an effective chemopreventive agent. In this pilot trial, we investigated whether oral administration of curcumin results in concentrations of the agent in normal and malignant human liver tissue, which are sufficient to elicit pharmacological activity. In total, 12 patients with hepatic metastases from colorectal cancer received 450–3600 mg of curcumin daily, for 1 week prior to surgery. Levels of curcumin and its metabolites were measured by HPLC in portal and peripheral blood, bile and liver tissue. Curcumin was poorly available, following oral administration, with low nanomolar levels of the parent compound and its glucuronide and sulphate conjugates found in the peripheral or portal circulation. While curcumin was not found in liver tissue, trace levels of products of its metabolic reduction were detected. In patients who had received curcumin, levels of malondialdehyde-DNA (M1G) adduct, which reflect oxidative DNA changes, were not decreased in post-treatment normal and malignant liver tissue when compared to pretreatment samples. The results suggest that doses of curcumin required to furnish hepatic levels sufficient to exert pharmacological activity are probably not feasible in humans.
Comparison Study between NOMA and SCMA

—In this paper, the performance and system complexity of the candidate multiple access (MA) techniques for the next generation of cellular systems, namely, non-orthogonal multiple access (NOMA) (in this paper, we consider power domain MA as NOMA) and sparse code multiple access (SCMA), are investigated. To this end, for each MA technique, a resource allocation problem considering heterogeneous cellular networks (HetNet) is formulated. We apply successive convex approximation (SCA) method to each problem and obtain their solutions. The simulation results show that SCMA-based system achieves better performance than NOMA-based one at the cost of more complexity.
Skin buttons: cheap, small, low-powered and clickable fixed-icon laser projectors

Smartwatches are a promising new interactive platform, but their small size makes even basic actions cumbersome. Hence, there is a great need for approaches that expand the interactive envelope around smartwatches, allowing human input to escape the small physical confines of the device. We propose using tiny projectors integrated into the smartwatch to render icons on the user's skin. These icons can be made touch sensitive, significantly expanding the interactive region without increasing device size. Through a series of experiments, we show that these 'skin buttons' can have high touch accuracy and recognizability, while being low cost and power-efficient.
Evaluating iterative optimization across 1000 datasets

While iterative optimization has become a popular compiler optimization approach, it is based on a premise which has never been truly evaluated: that it is possible to learn the best compiler optimizations across data sets. Up to now, most iterative optimization studies find the best optimizations through repeated runs on the same data set. Only a handful of studies have attempted to exercise iterative optimization on a few tens of data sets.
 In this paper, we truly put iterative compilation to the test for the first time by evaluating its effectiveness across a large number of data sets. We therefore compose KDataSets, a data set suite with 1000 data sets for 32 programs, which we release to the public. We characterize the diversity of KDataSets, and subsequently use it to evaluate iterative optimization.We demonstrate that it is possible to derive a robust iterative optimization strategy across data sets: for all 32 programs, we find that there exists at least one combination of compiler optimizations that achieves 86% or more of the best possible speedup across all data sets using Intel's ICC (83% for GNU's GCC). This optimal combination is program-specific and yields speedups up to 1.71 on ICC and 2.23 on GCC over the highest optimization level (-fast and -O3, respectively). This finding makes the task of optimizing programs across data sets much easier than previously anticipated, and it paves the way for the practical and reliable usage of iterative optimization. Finally, we derive pre-shipping and post-shipping optimization strategies for software vendors.
The spatial and temporal meanings of English prepositions can be independently impaired

English uses the same prepositions to describe both spatial and temporal relationships (e.g., at the corner, at 1:30), and other languages worldwide exhibit similar patterns. These space-time parallelisms have been explained by the Metaphoric Mapping Theory, which maintains that humans have a cognitive predisposition to structure temporal concepts in terms of spatial schemas through the application of a TIME IS SPACE metaphor. Evidence comes from (among other sources) historical investigations showing that languages consistently develop in such a way that expressions that originally have only spatial meanings are gradually extended to take on analogous temporal meanings. It is not clear, however, if the metaphor actively influences the way that modern adults process prepositional meanings during language use. To explore this question, a series of experiments was conducted with four brain-damaged subjects with left perisylvian lesions. Two subjects exhibited the following dissociation: they failed a test that assesses knowledge of the spatial meanings of prepositions, but passed a test that assesses knowledge of the corresponding temporal meanings of the same prepositions. This result suggests that understanding the temporal meanings of prepositions does not necessarily require establishing structural alignments with their spatial correlates. Two other subjects exhibited the opposite dissociation: they performed better on the spatial test than on the temporal test. Overall, these findings support the view that although the spatial and temporal meanings of prepositions are historically linked by virtue of the TIME IS SPACE metaphor, they can be (and may normally be) represented and processed independently of each other in the brains of modern adults.
Fast and Accurate Crop and Weed Identification with Summarized Train Sets for Precision Agriculture

In this paper we present a perception system for agriculture robotics that enables an unmanned ground vehicle (UGV) equipped with a multi spectral camera to automatically perform the crop/weed detection and classification tasks in real-time. Our approach exploits a pipeline that includes two different convolutional neural networks (CNNs) applied to the input RGB+near infra-red (NIR) images. A lightweight CNN is used to perform a fast and robust, pixelwise, binary image segmentation, in order to extract the pixels that represent projections of 3D points that belong to green vegetation. A deeper CNN is then used to classify the extracted pixels between the crop and weed classes. A further important contribution of this work is a novel unsupervised dataset summarization algorithm that automatically selects from a large dataset the most informative subsets that better describe the original one. This enables to streamline and speed-up the manual dataset labeling process, otherwise extremely time consuming, while preserving good classification performances. Experiments performed on different datasets taken from a real farm robot confirm the effectiveness of our approach.
MANAGING HEALTH CARE SUPPLY CHAIN : TRENDS , ISSUES , AND SOLUTIONS FROM A LOGISTICS PERSPECTIVE

The U.S. healthcare industry is a large enterprise accounting for over 14.1% of the national economic output in 2001. It has been under pressure for cost containment and providing quality health care services to consumers. Its record of investing heavily on development of sophisticated drugs and diagnostic systems does not match that of technologies to manage its day-to-day operations. In order to achieve improved performance, healthcare supply chain must be efficient and integrated. The driver for this integration is logistics and supply chain management. This paper describes trends, issues and some solutions for logistics management for Health Care Supply Chain with concepts drawn from Industrial Engineering, and Operations Research disciplines applied to specific domains. A healthcare supply chain template utilizing Ecommerce strategy is presented. Use of simulation, optimization, and information sharing techniques are demonstrated to optimize purchasing and inventory policies.
Forensic Image Inspection Assisted by Deep Learning

Investigations on the charge of possessing child pornography usually require manual forensic image inspection in order to collect evidence. When storage devices are confiscated, law enforcement authorities are hence often faced with massive image datasets which have to be screened within a limited time frame. As the ability to concentrate and time are highly limited factors of a human investigator, we believe that intelligent algorithms can effectively assist the inspection process by rearranging images based on their content. Thus, more relevant images can be discovered within a shorter time frame, which is of special importance in time-critical investigations of triage character.
 While currently employed techniques are based on black- and whitelisting of known images, we propose to use deep learning algorithms trained for the detection of pornographic imagery, as they are able to identify new content. In our approach, we evaluated three state-of-the-art neural networks for the detection of pornographic images and employed them to rearrange simulated datasets of 1 million images containing a small fraction of pornographic content. The rearrangement of images according to their content allows a much earlier detection of relevant images during the actual manual inspection of the dataset, especially when the percentage of relevant images is low. With our approach, the first relevant image could be discovered between positions 8 and 9 in the rearranged list on average. Without using our approach of image rearrangement, the first relevant image was discovered at position 1,463 on average.
Automatic design of low power CMOS buffer-chain circuit using differential evolutionary algorithm and particle swarm optimization

PSO and DE algorithms and its variants are used for the optimization of a buffer-chain circuit and the results of all the algorithms are compared in this literature. By testing these algorithms on different mathematical benchmark functions the best parameter values of buffer chain circuit are obtained in such a way that it reduces the error between simulated output and optimized output, hence giving the best circuit performance. Evolutionary algorithms are better in performance and speed than the classical methods. 130nm CMOS technology has been used in this work. With the help of these parameter values the circuit simulator gives the values of power consumption, symmetry, rise time and fall time, which are almost closer to the desired specification of the buffer chain circuit.
Bidirectional RNN for Medical Event Detection in Electronic Health Records

Sequence labeling for extraction of medical events and their attributes from unstructured text in Electronic Health Record (EHR) notes is a key step towards semantic understanding of EHRs. It has important applications in health informatics including pharmacovigilance and drug surveillance. The state of the art supervised machine learning models in this domain are based on Conditional Random Fields (CRFs) with features calculated from fixed context windows. In this application, we explored recurrent neural network frameworks and show that they significantly out-performed the CRF models.
Constructing topical hierarchies in heterogeneous information networks

Many digital documentary data collections (e.g., scientific publications, enterprise reports, news articles, and social media) can be modeled as a heterogeneous information network, linking text with multiple types of entities. Constructing high-quality hierarchies that can represent topics at multiple granularities benefits tasks such as search, information browsing, and pattern mining. In this work, we present an algorithm for recursively constructing multi-typed topical hierarchies. Contrary to traditional text-based topic modeling, our approach handles both textual phrases and multiple types of entities by a newly designed clustering and ranking algorithm for heterogeneous network data, as well as mining and ranking topical patterns of different types. Our experiments on datasets from two different domains demonstrate that our algorithm yields high-quality, multi-typed topical hierarchies.
Ethernet-Based Real-Time and Industrial Communications

Despite early attempts to use Ethernet in the industrial context, only recently has it attracted a lot of attention as a support for industrial communication. A number of vendors are offering industrial communication products based on Ethernet and TCP/IP as a means to interconnect field devices to the first level of automation. Others restrict their offer to communication between automation devices such as programmable logic controllers and provide integration means to existing fieldbuses. This paper first details the requirements that an industrial network has to fulfill. It then shows how Ethernet has been enhanced to comply with the real-time requirements in particular in the industrial context. Finally, we show how the requirements that cannot be fulfilled at layer 2 of the OSI model can be addressed in the higher layers adding functionality to existing standard protocols.
Didn't you see my message?: predicting attentiveness to mobile instant messages

Mobile instant messaging (e.g., via SMS or WhatsApp) often goes along with an expectation of high attentiveness, i.e., that the receiver will notice and read the message within a few minutes. Hence, existing instant messaging services for mobile phones share indicators of availability, such as the last time the user has been online. However, in this paper we not only provide evidence that these cues create social pressure, but that they are also weak predictors of attentiveness. As remedy, we propose to share a machine-computed prediction of whether the user will view a message within the next few minutes or not. For two weeks, we collected behavioral data from 24 users of mobile instant messaging services. By the means of machine-learning techniques, we identified that simple features extracted from the phone, such as the user's interaction with the notification center, the screen activity, the proximity sensor, and the ringer mode, are strong predictors of how quickly the user will attend to the messages. With seven automatically selected features our model predicts whether a phone user will view a message within a few minutes with 70.6% accuracy and a precision for fast attendance of 81.2%
Towards Real-Time Detection and Tracking of Basketball Players using Deep Neural Networks

Online multi-player detection and tracking in broadcast basketball videos are significant challenging tasks. In this environments, the target distributions are highly non-linear, and the varying number of objects creates complex interactions with overlap and ambiguities. In this paper, we present a real-time multi-person detection and tracking framework that is able to perform detection and tracking of basketball players on sequences of videos. Our framework is based on YOLOv2, a state-of-the-art real-time object detection system, and SORT, an object tracking framework based on data association and state estimation techniques. For training and testing, we use a given subset of the NCAA Basketball Dataset. As part of the bonus, we trained a two-layer LSTM to do action recognition.
Miniaturized rat-race coupler with bandpass response and good stopband rejection

Coupled-resonator network is applied to the design of a rat-race coupler with bandpass response in this paper. Net-type resonators are used to reduce the circuit size and control the harmonics. As a result, the proposed coupler exhibits not only a compact size but also good stopband rejection. The proposed coupler occupies only one sixth area of the conventional design, while the rejection level in the stopband is better than 30 dB up to 4.3ƒ0. The measured results are in good agreement with the simulated predictions.
Natural Language Processing in Information Retrieval

Many Natural Language Processing (NLP) techniques have been used in Information Retrieval. The results are not encouraging. Simple methods (stopwording, porter-style stemming, etc.) usually yield significant improvements, while higher-level processing (chunking, parsing, word sense disambiguation, etc.) only yield very small improvements or even a decrease in accuracy. At the same time, higher-level methods increase the processing and storage cost dramatically. This makes them hard to use on large collections. We review NLP techniques and come to the conclusion that (a) NLP needs to be optimized for IR in order to be effective and (b) document retrieval is not an ideal application for NLP, at least given the current state-of-the-art in NLP. Other IR-related tasks, e.g., question answering and information extraction, seem to be better suited.
Impact of probing procedure on flip chip reliability

Probe-after-bump is the primary probing procedure for flip chip technology, since it does not directly contact the bump pad, and involves a preferred under bump metallurgy (UBM) step coverage on the bump pads. However, the probe-after-bump procedure suffers from low throughputs and high cost. It also delays the yield feedback to the fab, and makes difficult clarification of the accountability of the low yield bumped wafer between the fab and the bumping house. The probe-before-bump procedure can solve these problems, but the probing tips may over-probe or penetrate the bump pads, leading to poor UBM step coverage, due to inadequate probing conditions or poor probing cards. This work examines the impact of probing procedure on flip chip reliability, using printing and electroplating bumpings on aluminum and copper pads. Bump height, bump shear strength, die shear force, UBM step coverage, and reliability testing are used to determine the influence of probing procedure on flip chip reliability. The experimental results reveal that bump quality and reliability test in the probe-before-bump procedure, under adequate probing conditions, differ slightly from the corresponding items in the probe-after-bump procedure. UBM gives superior step coverage of probe marks in both probe-before-bump and probe-after-bump procedures, implying that UBM achieves greater adhesion and barrier function between the solder bump and the bump pad. Both printing and electroplating bump processes slightly influence all evaluated items. The heights of probe marks on the copper pads are 40–60% lower than those on the aluminum pads, indicating that the copper pad enhances UBM step coverage. This finding reveals that adequate probing conditions of the probe-before-bump procedure are suited to sort flip chip wafers and do not significantly affect bump height, bump shear strength, die shear force, or flip chip reliability.
TSC-DL: Unsupervised trajectory segmentation of multi-modal surgical demonstrations with Deep Learning

The growth of robot-assisted minimally invasive surgery has led to sizable datasets of fixed-camera video and kinematic recordings of surgical subtasks. Segmentation of these trajectories into locally-similar contiguous sections can facilitate learning from demonstrations, skill assessment, and salvaging good segments from otherwise inconsistent demonstrations. Manual, or supervised, segmentation can be prone to error and impractical for large datasets. We present Transition State Clustering with Deep Learning (TSC-DL), a new unsupervised algorithm that leverages video and kinematic data for task-level segmentation, and finds regions of the visual feature space that correlate with transition events using features constructed from layers of pre-trained image classification Deep Convolutional Neural Networks (CNNs). We report results on three datasets comparing Deep Learning architectures (AlexNet and VGG), choice of convolutional layer, dimensionality reduction techniques, visual encoding, and the use of Scale Invariant Feature Transforms (SIFT). We find that the deep architectures extract features that result in up-to a 30.4% improvement in Silhouette Score (a measure of cluster tightness) over the traditional “shallow” features from SIFT. We also present cases where TSC-DL discovers human annotator omissions.
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces

We consider the computational problem of nding nearest neighbors in general metric spaces Of particular interest are spaces that may not be conveniently embedded or approxi mated in Euclidian space or where the dimensionality of a Euclidian representation is very high Also relevant are high dimensional Euclidian settings in which the distribution of data is in some sense of lower di mension and embedded in the space The vp tree vantage point tree is introduced in several forms together with associated algorithms as an improved method for these di cult search problems Tree construc tion executes in O n log n time and search is under certain circumstances and in the limit O log n expected time The theoretical basis for this approach is developed and the results of several experiments are reported In Euclidian cases kd tree performance is compared
Deep Action Conditional Neural Network for Frame Prediction in Atari Games

In many problems in computer vision and video frame prediction, such as in robotic control or self driving cars, future frames are not only dependent on past frames, but also on external actions. We study this problem by looking at video frame prediction in the context of Atari 2600 video games where future frames are dependent on past frames as well as actions performed by the players. Based off of previous work such as  and [6] we implement a convolutional feedforward model for predicting future frames and rewards as well as a baseline multi-layer perceptron (MLP). We test various training schemes including using an autoencoder to improve prediction clarity and using different loss functions such as the l2 loss, the l1 loss, and the Structural Dissimilarity (DSSIM). We generate data by collecting frames and rewards from a Deep Q Network (DQN) trained to play the game. We found that both quantitatively and qualitatively the convolutional feedforward model achieves better results than the MLP.
Document-level Multi-aspect Sentiment Classification by Jointly Modeling Users, Aspects, and Overall Ratings

Document-level multi-aspect sentiment classification aims to predict user’s sentiment polarities for different aspects of a product in a review. Existing approaches mainly focus on text information. However, the authors (i.e. users) and overall ratings of reviews are ignored, both of which are proved to be significant on interpreting the sentiments of different aspects in this paper. Therefore, we propose a model called Hierarchical User Aspect Rating Network (HUARN) to consider user preference and overall ratings jointly. Specifically, HUARN adopts a hierarchical architecture to encode word, sentence, and document level information. Then, user attention and aspect attention are introduced into building sentence and document level representation. The document representation is combined with user and overall rating information to predict aspect ratings of a review. Diverse aspects are treated differently and a multi-task framework is adopted. Empirical results on two real-world datasets show that HUARN achieves state-of-the-art performances.