nils-herrmann/clean_scirepeval huggingface dataset:
Heterogeneous Supervision for Relation Extraction: A Representation Learning Approach

Relation extraction is a fundamental task in information extraction. Most existing methods have heavy reliance on annotations labeled by human experts, which are costly and time-consuming. To overcome this drawback, we propose a novel framework, REHESSION, to conduct relation extractor learning using annotations from heterogeneous information source, e.g., knowledge base and domain heuristics. These annotations, referred as heterogeneous supervision, often conflict with each other, which brings a new challenge to the original relation extraction task: how to infer the true label from noisy labels for a given instance. Identifying context information as the backbone of both relation extraction and true label discovery, we adopt embedding techniques to learn the distributed representations of context, which bridges all components with mutual enhancement in an iterative fashion. Extensive experimental results demonstrate the superiority of REHESSION over the state-of-the-art.
Provably secure ciphertext policy ABE

In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on attributes. Decryption is enabled if and only if the user's attribute set satisfies the ciphertext access structure. This provides fine-grained access control on shared data in many practical settings, e.g., secure database and IP multicast.
 In this paper, we study CP-ABE schemes in which access structures are AND gates on positive and negative attributes. Our basic scheme is proven to be chosen plaintext (CPA) secure under the decisional bilinear Diffie-Hellman (DBDH) assumption. We then apply the Canetti-Halevi-Katz technique to obtain a chosen ciphertext (CCA) secure extension using one-time signatures. The security proof is a reduction to the DBDH assumption and the strong existential unforgeability of the signature primitive.
 In addition, we introduce hierarchical attributes to optimize our basic scheme - reducing both ciphertext size and encryption/decryption time while maintaining CPA security. We conclude with a discussion of practical applications of CP-ABE.
Value Locality and Load Value Prediction

Since the introduction of virtual memory demand-paging and cache memories, computer systems have been exploiting spatial and temporal locality to reduce the average latency of a memory reference. In this paper, we introduce the notion of value locality, a third facet of locality that is frequently present in real-world programs, and describe how to effectively capture and exploit it in order to perform load value prediction. Temporal and spatial locality are attributes of storage locations, and describe the future likelihood of references to those locations or their close neighbors. In a similar vein, value locality describes the likelihood of the recurrence of a previously-seen value within a storage location. Modern processors already exploit value locality in a very restricted sense through the use of control speculation (i.e. branch prediction), which seeks to predict the future value of a single condition bit based on previously-seen values. Our work extends this to predict entire 32- and 64-bit register values based on previously-seen values. We find that, just as condition bits are fairly predictable on a per-static-branch basis, full register values being loaded from memory are frequently predictable as well. Furthermore, we show that simple microarchitectural enhancements to two modern microprocessor implementations (based on the PowerPC 620 and Alpha 21164) that enable load value prediction can effectively exploit value locality to collapse true dependencies, reduce average memory latency and bandwidth requirements, and provide measurable performance gains.
A Cognitive Model of Semantic Network Learning

Child semantic development includes learning the meaning of words as well as the semantic relations among words. A presumed outcome of semantic development is the formation of a semantic network that reflects this knowledge. We present an algorithm for simultaneously learning word meanings and gradually growing a semantic network, which adheres to the cognitive plausibility requirements of incrementality and limited computations. We demonstrate that the semantic connections among words in addition to their context is necessary in forming a semantic network that resembles an adult’s semantic knowledge.
Light Field Rendering

A number of techniques ha ve been proposed for flying through scenes by redisplaying pre viously rendered or digitized views. Techniques ha ve also been proposed for interpolating between vie ws by warping input images, using depth information or correspondences between multiple images. In this paper , we describe a simple and rob ust method for generating ne w views from arbitrary camera positions without depth information or feature matching, simply by combining and resampling the a vailable images. Thekey to this technique lies in interpreting the input images as 2D slices of a 4D function the light field. This function completely characterizes the flo w of l ight through unobstructed space in a static scene with fix ed illumination. We describe a sampled representation for light fields that allows for both ef ficient creation and display of inw ard and outward looking views. We hav e created light fields from lar ge arrays of both rendered and digitized images. The latter are acquired using a video camera mounted on a computer -cont olled gantry. Once a light field has been created, ne w views may be constructed in real time by e xtracting slices in appropriate directions. Sincethe success of the method depends on ha ving a high sample rate, we describe a compression system that is able to compress the light fields we ha ve generated by more than a f ctor of 100:1 with very little loss of fidelity. We also address the issues of antialiasing during creation, and resampling during slice e xtraction. CR Categories:I.3.2 [Computer Graphics]: Picture/Image Gener ation —Digitizing and scanning , Viewing algorithms; I.4.2 [Computer Graphics]: Compression — Approximate methods Additional k eywords: image-based rendering, light field, holographic stereogram, v ector quantization, epipolar analysis
Fast tile-binning method by detecting 1D-overlapped primitives

Mobile 3D graphics use tile-based rendering algorithm in order to lower power consumption. For rendering tile by tile in the tile-based rendering, tile-binning process is inevitable and has to store the results of geometry processing into scene buffer, which causes memory access severely. Several methods were proposed to reduce memory bandwidth for tile-binning process. However, these memory-bandwidth reduction methods require more computations. Hsieh et al. attempted to eliminate edges in order to decrease the number of overlap test. Their method could only eliminate 0.02% of edges because the edges parallel to the axes can be eliminated. In this study, we propose a simple method to reduce the number of the overlap test by detecting 1D-tile overlapped primitives, which are overlapped with only one-dimensional tiles while keeping low memory bandwidth.
A Tutorial on Support Vector Machines for Pattern Recognition

The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-separable data, working through a non-trivial example in detail. We describe a mechanical analogy, and discuss when SVM solutions are unique and when they are global. We describe how support vector training can be practically implemented, and discuss in detail the kernel mapping technique which is used to construct SVM solutions which are nonlinear in the data. We show how Support Vector machines can have very large (even infinite) VC dimension by computing the VC dimension for homogeneous polynomial and Gaussian radial basis function kernels. While very high VC dimension would normally bode ill for generalization performance, and while at present there exists no theory which shows that good generalization performance is guaranteed for SVMs, there are several arguments which support the observed high accuracy of SVMs, which we review. Results of some experiments which were inspired by these arguments are also presented. We give numerous examples and proofs of most of the key theorems. There is new material, and I hope that the reader will find that even old material is cast in a fresh light.
A new approach to unwrap a 3-D fingerprint to a 2-D rolled equivalent fingerprint

For many years, fingerprints have been captured by pressing a finger against a paper or hard surface. This touch-based fingerprint acquisition introduces some problems such as distortions and deformations in the acquired images, which arise due to the contact of the fingerprint surface with the sensor platen, and degrades the recognition performance. A new touch-less fingerprint technology has been recently introduced to the market, which can address the problems with the contact-based fingerprint systems. In this paper, we propose a new algorithm for unwrapping the acquired 3-D scan of the subject's finger into a 2-D rolled equivalent image. Therefore, The resulting image can be matched with the conventional 2-D scans; it also can be used for matching unwrapped 3-D fingerprints among themselves with the 2-D fingerprint matching algorithms. The algorithm is based on curvature analysis of the 3-D surface. The quality of the resulting image is evaluated and analyzed using NIST fingerprint image software.
EMPHASIS: An Emotional Phoneme-based Acoustic Model for Speech Synthesis System

We present EMPHASIS, an emotional phoneme-based acoustic model for speech synthesis system. EMPHASIS includes a phoneme duration prediction model and an acoustic parameter prediction model. It uses a CBHG-based regression network to model the dependencies between linguistic features and acoustic features. We modify the input and output layer structures of the network to improve the performance. For the linguistic features, we apply a feature grouping strategy to enhance emotional and prosodic features. The acoustic parameters are designed to be suitable for the regression task and waveform reconstruction. EMPHASIS can synthesize speech in real-time and generate expressive interrogative and exclamatory speech with high audio quality. EMPHASIS is designed to be a multi-lingual model and can synthesize Mandarin-English speech for now. In the experiment of emotional speech synthesis, it achieves better subjective results than other real-time speech synthesis systems.
The behaviour of random forest permutation-based variable importance measures under predictor correlation

Random forests (RF) have been increasingly used in applications such as genome-wide association and microarray studies where predictor correlation is frequently observed. Recent works on permutation-based variable importance measures (VIMs) used in RF have come to apparently contradictory conclusions. We present an extended simulation study to synthesize results. In the case when both predictor correlation was present and predictors were associated with the outcome (HA), the unconditional RF VIM attributed a higher share of importance to correlated predictors, while under the null hypothesis that no predictors are associated with the outcome (H0) the unconditional RF VIM was unbiased. Conditional VIMs showed a decrease in VIM values for correlated predictors versus the unconditional VIMs under HA and was unbiased under H0. Scaled VIMs were clearly biased under HA and H0. Unconditional unscaled VIMs are a computationally tractable choice for large datasets and are unbiased under the null hypothesis. Whether the observed increased VIMs for correlated predictors may be considered a "bias" - because they do not directly reflect the coefficients in the generating model - or if it is a beneficial attribute of these VIMs is dependent on the application. For example, in genetic association studies, where correlation between markers may help to localize the functionally relevant variant, the increased importance of correlated predictors may be an advantage. On the other hand, we show examples where this increased importance may result in spurious signals.
Direct and Indirect Effects of Product Innovation and Product Quality on Brand Image : Empirical Evidence from Automotive Industry

This study examines the effect of product innovation and product quality on brand image with brand trust as mediator. Past studies paid less attention to empirically determine the relationship between the said variables on brand image and using brand trust as mediator between such independent and dependent variables. Therefore, this study aims to fill up this gap and contribute to the body of knowledge by examining the relationship between them. Data is collected using questionnaire from 287 passenger car users at shopping malls in Northern region of Malaysia. Specifically, systematic sampling procedure was followed during data collection. The data is analyzed using structural equation modeling (AMOS). The findings indicate that product innovation and product quality have significant relationship with brand image. The findings also reveal that product innovation and product quality have significant relationship with brand trust. Additionally, brand trust mediates the relationships between product innovation and brand image. It is also found that brand trust mediates the relationship between product quality and brand image. Based on these findings, several conclusions were made with some recommendations for future researches to strengthen our understandings toward the process of developing brand image.
Modeling, Analysis and Testing of Autonomous Operation of an Inverter-Based Microgrid

The analysis of the small-signal stability of conventional power systems is well established, but for inverter based microgrids there is a need to establish how circuit and control features give rise to particular oscillatory modes and which of these have poor damping. This paper develops the modeling and analysis of autonomous operation of inverter-based microgrids. Each sub-module is modeled in state-space form and all are combined together on a common reference frame. The model captures the detail of the control loops of the inverter but not the switching action. Some inverter modes are found at relatively high frequency and so a full dynamic model of the network (rather than an algebraic impedance model) is used. The complete model is linearized around an operating point and the resulting system matrix is used to derive the eigenvalues. The eigenvalues (termed "modes") indicate the frequency and damping of oscillatory components in the transient response. A sensitivity analysis is also presented which helps identifying the origin of each of the modes and identify possible feedback signals for design of controllers to improve the system stability. With experience it is possible to simplify the model (reduce the order) if particular modes are not of interest as is the case with synchronous machine models. Experimental results from a microgrid of three 10-kW inverters are used to verify the results obtained from the model
Malware detection by text and data mining

Cyber frauds are a major security threat to the banking industry worldwide. Malware is one of the manifestations of cyber frauds. Malware authors use Application Programming Interface (API) calls to perpetrate these crimes. In this paper, we propose a static analysis method to detect Malware based on API call sequences using text and data mining in tandem. We analyzed the dataset available at CSMINING group. First, we employed text mining to extract features from the dataset consisting a series of API calls. Further, mutual information is invoked for feature selection. Then, we resorted to over-sampling to balance the data set. Finally, we employed various data mining techniques such as Decision Tree (DT), Multi Layer Perceptron (MLP), Support Vector Machine (SVM), Probabilistic Neural Network (PNN) and Group Method for Data Handling (GMDH). We also applied One Class SVM (OCSVM). Throughout the paper, we used 10-fold cross validation technique for testing the techniques. We observed that SVM and OCSVM achieved 100% sensitivity after balancing the dataset.
Integrated ultra-high impedance front-end for non-contact biopotential sensing

Non-contact ECG/EEG electrodes, which operate primarily through capacitive coupling, have been extensively studied for unobtrusive physiological monitoring. Previous implementations using discrete off-the-shelf amplifiers have been encumbered by the need for manually tuned input capacitance neutralization networks and complex DC-biasing schemes. We have designed and fabricated a custom integrated high input impedance (60 fF∥5TΩ), low noise (0.05 fA/√Hz) non-contact sensor front-end specifically to bypass these limitations. The amplifier fully bootstraps both the internal and external parasitic impedances to achieve an input capacitance of 60 fF without neutralization. To ensure DC stability and eliminate the need for external large valued resistances, a low-leakage, on-chip biasing network is included. Stable frequency response is demonstrated below 0.05 Hz even with coupling capacitances as low as 0.5 pF.
Network analysis in the social sciences.

Over the past decade, there has been an explosion of interest in network research across the physical and social sciences. For social scientists, the theory of networks has been a gold mine, yielding explanations for social phenomena in a wide variety of disciplines from psychology to economics. Here, we review the kinds of things that social scientists have tried to explain using social network analysis and provide a nutshell description of the basic assumptions, goals, and explanatory mechanisms prevalent in the field. We hope to contribute to a dialogue among researchers from across the physical and social sciences who share a common interest in understanding the antecedents and consequences of network phenomena.
Systematic Mapping Studies in Software Engineering

A software engineering systematic map is a defined method to build a classification scheme and structure a software engineering field of interest. The analysis of results focuses on frequencies of publications for categories within the scheme. Thereby, the coverage of the research field can be determined. Different facets of the scheme can also be combined to answer more specific research questions.  We describe how to conduct a systematic mapping study in software engineering and provide guidelines. We also compare systematic maps and systematic reviews to clarify how to chose between them. This comparison leads to a set of guidelines for systematic maps.  We have defined a systematic mapping process and applied it to complete a systematic mapping study. Furthermore, we compare systematic maps with systematic reviews by systematically analyzing existing systematic reviews.  We describe a process for software engineering systematic mapping studies and compare it to systematic reviews. Based on this, guidelines for conducting systematic maps are defined.  Systematic maps and reviews are different in terms of goals, breadth, validity issues and implications. Thus, they should be used complementarily and require different methods (e.g., for analysis).
The task-based approach : some questions and suggestions

This article >rst addresses the question of what tasks are. It suggests that rather than accept the common ‘communicative’ de>nition, we should return to a broader de>nition and then focus on key dimensions that distinguish (from the learner’s perspective) di=erent types of task, notably degrees of taskinvolvement and degrees of focus on form or meaning. This approach helps us to conceptualize the complementary roles of form-focused and meaningfocused tasks in our methodology. It also shows the continuity between taskbased language teaching and the broader communicative approach within which it is a development. Finally the article asks whether ‘task-based approach’ is really the most appropriate term at all for describing these developments in language pedagogy.
Consumption of ultra-processed foods and likely impact on human health. Evidence from Canada.

To investigate consumption of ultra-processed products in Canada and to assess their association with dietary quality.



Application of a classification of foodstuffs based on the nature, extent and purpose of food processing to data from a national household food budget survey. Foods are classified as unprocessed/minimally processed foods (Group 1), processed culinary ingredients (Group 2) or ultra-processed products (Group 3).



All provinces and territories of Canada, 2001.



Households (n 5643).



Food purchases provided a mean per capita energy availability of 8908 (se 81) kJ/d (2129 (se 19) kcal/d). Over 61·7 % of dietary energy came from ultra-processed products (Group 3), 25·6 % from Group 1 and 12·7 % from Group 2. The overall diet exceeded WHO upper limits for fat, saturated fat, free sugars and Na density, with less fibre than recommended. It also exceeded the average energy density target of the World Cancer Research Fund/American Institute for Cancer Research. Group 3 products taken together are more fatty, sugary, salty and energy-dense than a combination of Group 1 and Group 2 items. Only the 20 % lowest consumers of ultra-processed products (who consumed 33·2 % of energy from these products) were anywhere near reaching all nutrient goals for the prevention of obesity and chronic non-communicable diseases.



The 2001 Canadian diet was dominated by ultra-processed products. As a group, these products are unhealthy. The present analysis indicates that any substantial improvement of the diet would involve much lower consumption of ultra-processed products and much higher consumption of meals and dishes prepared from minimally processed foods and processed culinary ingredients.
Protocol Oblivious Forwarding (POF): Software-Defined Networking with Enhanced Programmability

Software-defined networking separates the control and forwarding planes of a network to make it more programmable and application- aware. As one of the initial implementations of SDN, OpenFlow abstracts a forwarding device as a flow table and realizes flow processing by applying the "match-and-act" principle. However, the protocol-dependent nature of OpenFlow still limits the programmability of the forwarding plane. Hence, in this article, we discuss how to leverage protocol-oblivious forwarding (POF) to further enhance the network programmability such that the forwarding plane becomes protocol-independent and can be dynamically reprogrammed to support new protocol stacks seamlessly. We first review the development of OpenFlow and explain the motivations for introducing POF. Then we explain the working principle of POF, discuss our efforts on realizing the POF development ecosystem, and show our implementation of POF-based source routing as a novel use case. Finally, we elaborate on the first WAN-based POF network testbed that includes POF switches located in two cities in China.
Single-inductor four-switch non-inverting buck-boost dc-dc converter

A single-inductor four-switch non-inverting buck-boost dc-dc converter was designed. Compared to other conventional buck-boost typologies, the presented converter reduces the number of external passive components and chip/PCB area. The chip was implemented by using the TSMC 0.35um 3.3V/5V 2P4M polycide CMOS process. The input voltage range of the presented converter covers the full output voltage range of a Li-ion battery, its output voltage is 3.3V, and its maximal load current is 300 mA. The die area of the chip is 1.38 ×1.80 mm2, packed with a 40 S/B package.