nils-herrmann/clean_scirepeval huggingface dataset:
RISK FACTORS FOR INJURY TO WOMEN FROM DOMESTIC VIOLENCE

A BSTRACT Background Domestic violence is the most common cause of nonfatal injury to women in the United States. To identify risk factors for such injuries, we examined the socioeconomic and behavioral characteristics of women who were victims of domestic violence and the men who injured them.  We conducted a case–control study at eight large, university-affiliated emergency departments. The 256 intentionally injured women had acute injuries resulting from a physical assault by a male partner. The 659 controls were women treated for other conditions in the emergency department. Information was collected with a standardized questionnaire; no information was obtained directly from the male partners.  The 256 intentionally injured women had a total of 434 contusions and abrasions, 89 lacerations, and 41 fractures and dislocations. In a multivariate analysis, the characteristics of the partners that were most closely associated with an increased risk of inflicting injury as a result of domestic violence were alcohol abuse (adjusted relative risk, 3.6; 95 percent confidence interval, 2.2 to 5.9); drug use (adjusted relative risk, 3.5; 95 percent confidence interval, 2.0 to 6.4); intermittent employment (adjusted relative risk, 3.1; 95 percent confidence interval, 1.1 to 8.8); recent unemployment (adjusted relative risk, 2.7; 95 percent confidence interval, 1.2 to 6.5); having less than a high-school education (adjusted relative risk, 2.5; 95 percent confidence interval, 1.4 to 4.4); and being a former husband, estranged husband, or former boyfriend (adjusted relative risk, 3.5; 95 percent confidence interval, 1.5 to 8.3).  Women at greatest risk for injury from domestic violence include those with male partners who abuse alcohol or use drugs, are unemployed or intermittently employed, have less than a high-school education, and are former husbands, estranged husbands, or former boyfriends of the women. ( 1999;341:1892-8.
Distributed hierarchical processing in the primate cerebral cortex.

In recent years, many new cortical areas have been identified in the macaque monkey. The number of identified connections between areas has increased even more dramatically. We report here on (1) a summary of the layout of cortical areas associated with vision and with other modalities, (2) a computerized database for storing and representing large amounts of information on connectivity patterns, and (3) the application of these data to the analysis of hierarchical organization of the cerebral cortex. Our analysis concentrates on the visual system, which includes 25 neocortical areas that are predominantly or exclusively visual in function, plus an additional 7 areas that we regard as visual-association areas on the basis of their extensive visual inputs. A total of 305 connections among these 32 visual and visual-association areas have been reported. This represents 31% of the possible number of pathways if each area were connected with all others. The actual degree of connectivity is likely to be closer to 40%. The great majority of pathways involve reciprocal connections between areas. There are also extensive connections with cortical areas outside the visual system proper, including the somatosensory cortex, as well as neocortical, transitional, and archicortical regions in the temporal and frontal lobes. In the somatosensory/motor system, there are 62 identified pathways linking 13 cortical areas, suggesting an overall connectivity of about 40%. Based on the laminar patterns of connections between areas, we propose a hierarchy of visual areas and of somatosensory/motor areas that is more comprehensive than those suggested in other recent studies. The current version of the visual hierarchy includes 10 levels of cortical processing. Altogether, it contains 14 levels if one includes the retina and lateral geniculate nucleus at the bottom as well as the entorhinal cortex and hippocampus at the top. Within this hierarchy, there are multiple, intertwined processing streams, which, at a low level, are related to the compartmental organization of areas V1 and V2 and, at a high level, are related to the distinction between processing centers in the temporal and parietal lobes. However, there are some pathways and relationships (about 10% of the total) whose descriptions do not fit cleanly into this hierarchical scheme for one reason or another. In most instances, though, it is unclear whether these represent genuine exceptions to a strict hierarchy rather than inaccuracies or uncertainities in the reported assignment.
7.2 A 28GHz 32-element phased-array transceiver IC with concurrent dual polarized beams and 1.4 degree beam-steering resolution for 5G communication

Next-generation mobile technology (5G) aims to provide an improved experience through higher data-rates, lower latency, and improved link robustness. Millimeter-wave phased arrays offer a path to support multiple users at high data-rates using high-bandwidth directional links between the base station and mobile devices. To realize this vision, a phased-array-based pico-cell must support a large number of precisely controlled beams, yet be compact and power efficient. These system goals have significant mm-wave radio interface implications, including scalability of the RFIC+antenna-array solution, increase in the number of concurrent beams by supporting dual polarization, precise beam steering, and high output power without sacrificing TX power efficiency. Packaged Si-based phased arrays [1–3] with nonconcurrent dual-polarized TX and RX operation [2,3], concurrent dual-polarized RX operation  and multi-IC scaling [3,4] have been demonstrated. However, support for concurrent dual-polarized operation in both RX and TX remains unaddressed, and high output power comes at the cost of power consumption, cooling complexity and increased size. The RFIC reported here addresses these challenges. It supports concurrent and independent dual-polarized operation in TX and RX modes, and is compatible with a volume-efficient, scaled, antenna-in-package array. A new TX/RX switch at the shared antenna interface enables high output power without sacrificing TX efficiency, and a t-line-based phase shifter achieves <1° RMS error and <5° phase steps for precise beam control.
A Secure Communication Architecture for Distributed Microgrid Control

Microgrids are a key component in the evolution of the power grid. Microgrids are required to operate in both grid connected and standalone island mode using local sources of power. A major challenge in implementing microgrids is the communications and control to support transition from grid connected mode and operation in island mode. Here, we propose a secure communication architecture to support microgrid operation and control. A security model, including network, data, and attack models, is defined and a security protocol to address the real-time communication needs of microgrids is proposed. The implementation of the proposed security scheme is discussed and its performance evaluated using theoretical and co-simulation analysis, which shows it to be superior to existing protocols.
Predicting Fault Incidence Using Software Change History

ÐThis paper is an attempt to understand the processes by which software ages. We define code to be aged or decayed if its structure makes it unnecessarily difficult to understand or change and we measure the extent of decay by counting the number of faults in code in a period of time. Using change management data from a very large, long-lived software system, we explore the extent to which measurements from the change history are successful in predicting the distribution over modules of these incidences of faults. In general, process measures based on the change history are more useful in predicting fault rates than product metrics of the code: For instance, the number of times code has been changed is a better indication of how many faults it will contain than is its length. We also compare the fault rates of code of various ages, finding that if a module is, on the average, a year older than an otherwise similar module, the older module will have roughly a third fewer faults. Our most successful model measures the fault potential of a module as the sum of contributions from all of the times the module has been changed, with large, recent changes receiving the most weight. Index TermsÐFault potential, code decay, change management data, metrics, statistical analysis, generalized linear models.
Coded exposure deblurring: Optimized codes for PSF estimation and invertibility

We consider the problem of single image object motion deblurring from a static camera. It is well-known that deblurring of moving objects using a traditional camera is ill-posed, due to the loss of high spatial frequencies in the captured blurred image. A coded exposure camera modulates the integration pattern of light by opening and closing the shutter within the exposure time using a binary code. The code is chosen to make the resulting point spread function (PSF) invertible, for best deconvolution performance. However, for a successful deconvolution algorithm, PSF estimation is as important as PSF invertibility. We show that PSF estimation is easier if the resulting motion blur is smooth and the optimal code for PSF invertibility could worsen PSF estimation, since it leads to non-smooth blur. We show that both criterions of PSF invertibility and PSF estimation can be simultaneously met, albeit with a slight increase in the deconvolution noise. We propose design rules for a code to have good PSF estimation capability and outline two search criteria for finding the optimal code for a given length. We present theoretical analysis comparing the performance of the proposed code with the code optimized solely for PSF invertibility. We also show how to easily implement coded exposure on a consumer grade machine vision camera with no additional hardware. Real experimental results demonstrate the effectiveness of the proposed codes for motion deblurring.
A Unified Approach for Learning the Parameters of Sum-Product Networks

• We present a unified approach for learning the parameters of Sum-Product networks (SPNs). • We construct a more efficient factorization of complete and decomposable SPN into a mixture of trees, with each tree being a product of univariate distributions. • We show that the MLE problem for SPNs can be formulated as a signomial program. • We construct two parameter learning algorithms for SPNs by using sequential monomial approximations (SMA) and the concave-convex procedure (CCCP). Both SMA and CCCP admit multiplicative weight updates. • We prove the convergence of CCCP on SPNs.
Learning to Decode Cognitive States from Brain Images

Over the past decade, functional Magnetic Resonance Imaging (fMRI) has emerged as a powerful new instrument to collect vast quantities of data about activity in the human brain. A typical fMRI experiment can produce a three-dimensional image related to the human subject's brain activity every half second, at a spatial resolution of a few millimeters. As in other modern empirical sciences, this new instrumentation has led to a flood of new data, and a corresponding need for new data analysis methods. We describe recent research applying machine learning methods to the problem of classifying the cognitive state of a human subject based on fRMI data observed over a single time interval. In particular, we present case studies in which we have successfully trained classifiers to distinguish cognitive states such as (1) whether the human subject is looking at a picture or a sentence, (2) whether the subject is reading an ambiguous or non-ambiguous sentence, and (3) whether the word the subject is viewing is a word describing food, people, buildings, etc. This learning problem provides an interesting case study of classifier learning from extremely high dimensional (105 features), extremely sparse (tens of training examples), noisy data. This paper summarizes the results obtained in these three case studies, as well as lessons learned about how to successfully apply machine learning methods to train classifiers in such settings.
Compact Microstrip-to-CPS Transition for UWB Application

A novel ultra-wideband (UWB) microstrip-to-CPS (coplanar stripline) transition has been developed. This transition or balun structure has several attractive advantages such as good impedance transformation, compact size and wide bandwidth. After the parallel-coupled line section between the microstrip line and CPS is investigated under varied traversal dimensions, a wide transmitting band is well achieved with the emergence of two transmission poles. Next, such a single transition circuit is optimally designed to cover the whole UWB band (3.1 GHz to 10.6 GHz). To verify the predicted results in experiment, the two back-to-back transitions with the same 50 Omega microstrip feed lines are fabricated and tested. Measured results exhibit the return loss close to 10.0 dB over a band from 3.5 GHz to 10.0 GHz.
Emotion representation and physiology assignments in digital systems

Emotions are of increasing interest to the HCI community. Within the last decade, emotion research in HCI grew from an eccentric hobby of some visionary scientists to a widely accepted field of research. A number of proof-of-concept prototypes and studies have been published, dedicated sensor systems and technology frameworks have been developed, and theoretical considerations have been made. While they all represent a very valuable contribution to this young field of research, they lack a common theoretical basis. Particularly, there exists no applicable model of emotions suitable for designing emotion-aware systems or performing HCI-related emotion studies. However, in order to become a mature discipline, emotion research in HCI needs such a rigorous footing that future work can be based on. In this paper, a suitable approach to structure and represent emotions for use in digital systems is introduced, after a detailed and critical review of widely used emotion models is given and representative study results are discussed. The proposed method meets several requirements of HCI researchers and software developers. It avoids artificial categorisation of emotions, requires no naming of emotional states, is language independent, and its implementation is straightforward. The results of an experiment based on this approach are discussed demonstrating its applicability. q 2005 Elsevier B.V. All rights reserved.
Authoritative Sources in a Hyperlinked Environment

The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and report on experiments that demonstrate their effectiveness in a variety of context on the World Wide Web. The central issue we address within our framework is the distillation of broad search topics, through the discovery of “authorative” information sources on such topics. We propose and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages” that join them together in the link structure. Our formulation has connections to the eigenvectors of certain matrices associated with the link graph; these connections in turn motivate additional heuristrics for link-based analysis.
A user-guided approach to program analysis

Program analysis tools often produce undesirable output due to various approximations. We present an approach and a system EUGENE that allows user feedback to guide such approximations towards producing the desired output. We formulate the problem of user-guided program analysis in terms of solving a combination of hard rules and soft rules: hard rules capture soundness while soft rules capture degrees of approximations and preferences of users. Our technique solves the rules using an off-the-shelf solver in a manner that is sound (satisfies all hard rules), optimal (maximally satisfies soft rules), and scales to real-world analyses and programs. We evaluate EUGENE on two different analyses with labeled output on a suite of seven Java programs of size 131–198 KLOC. We also report upon a user study involving nine users who employ EUGENE to guide an information-flow analysis on three Java micro-benchmarks. In our experiments, EUGENE significantly reduces misclassified reports upon providing limited amounts of feedback.
Is Proof More Cost-Effective Than Testing?

ÐThis paper describes the use of formal development methods on an industrial safety-critical application. The Z notation was used for documenting the system specification and part of the design, and the SPARK subset of Ada was used for coding. However, perhaps the most distinctive nature of the project lies in the amount of proof that was carried out: proofs were carried out both at the Z levelÐapproximately 150 proofs in 500 pagesÐand at the SPARK code levelÐapproximately 9,000 verification conditions generated and discharged. The project was carried out under UK Interim Defence Standards 00-55 and 00-56, which require the use of formal methods on safety-critical applications. It is believed to be the first to be completed against the rigorous demands of the 1991 version of these standards. The paper includes comparisons of proof with the various types of testing employed, in terms of their efficiency at finding faults. The most striking result is that the Z proof appears to be substantially more efficient at finding faults than the most efficient testing phase. Given the importance of early fault detection, we believe this helps to show the significant benefit and practicality of large-scale proof on projects of this kind. Index TermsÐSafety-critical software, formal specification, SPARK, specification proof, code proof, proof vs. testing, industrial case study.
Learning representations by back-propagating errors

We describe a new learning procedure, back-propagation, for networks of neurone-like units. The procedure repeatedly adjusts the weights of the connections in the network so as to minimize a measure of the difference between the actual output vector of the net and the desired output vector. As a result of the weight adjustments, internal ‘hidden’ units which are not part of the input or output come to represent important features of the task domain, and the regularities in the task are captured by the interactions of these units. The ability to create useful new features distinguishes back-propagation from earlier, simpler methods such as the perceptron-convergence procedure1.
Load Balancing Under Heavy Traffic in RPL Routing Protocol for Low Power and Lossy Networks

RPL is an IPv6 routing protocol for low-power and lossy networks (LLNs) designed to meet the requirements of a wide range of LLN applications including smart grid AMIs, industrial and environmental monitoring, and wireless sensor networks. RPL allows bi-directional end-to-end IPv6 communication on resource constrained LLN devices, leading to the concept of the Internet of Things (IoT) with thousands and millions of devices interconnected through multihop mesh networks. In this article, we investigate the load balancing and congestion problem of RPL. Specifically, we show that most of the packet losses under heavy traffic are due to congestion, and a serious load balancing problem appears in RPL in terms of routing parent selection. To overcome this problem, this article proposes a simple yet effective queue utilization based RPL (QU-RPL) that achieves load balancing and significantly improves the end-to-end packet delivery performance compared to the standard RPL. QU-RPL is designed for each node to select its parent node considering the queue utilization of its neighbor nodes as well as their hop distances to an LLN border router (LBR). Owing to its load balancing capability, QU-RPL is very effective in lowering queue losses and increasing the packet delivery ratio. We implement QU-RPL on a low-power embedded platform, and verify all of our findings through experimental measurements on a real testbed of a multihop LLN over IEEE 802.15.4. We present the impact of each design element of QU-RPL on performance in detail, and also show that QU-RPL reduces the queue loss by up to 84 percent and improves the packet delivery ratio by up to 147 percent compared to the standard RPL.
AdDroid: privilege separation for applications and advertisers in Android

Advertising is a critical part of the Android ecosystem---many applications use one or more advertising services as a source of revenue. To use these services, developers must bundle third-party, binary-only libraries into their applications. In this model, applications and their advertising libraries share permissions. Advertising-supported applications must request multiple privacy-sensitive permissions on behalf of their advertising libraries, and advertising libraries receive access to all of their host applications' other permissions. We conducted a study of the Android Market and found that 49% of Android applications contain at least one advertising library, and these libraries overprivilege 46% of advertising-supported applications. Further, we find that 56% of the applications with advertisements that request location (34% of all applications) do so only because of advertisements. Such pervasive overprivileging is a threat to user privacy. We introduce AdDroid, a privilege separated advertising framework for the Android platform. AdDroid introduces a new advertising API and corresponding advertising permissions for the Android platform. This enables AdDroid to separate privileged advertising functionality from host applications, allowing applications to show advertisements without requesting privacy-sensitive permissions.
Flat-Region Detection and False Contour Removal in the Digital TV Display

Bit-depth reduction in digital displays results in false contours in the image. Moreover some of video enhancement processing in the digital TV display, such as histogram equalization, contrast enhancement, and increasing sharpness, etc., make false contours more visible. Bit-depth reduction comes from various display limitations such as video memory constraints, physical characteristics of the display, display drivers, and coarse MPEG quantization, etc. Daly, SJ et al., (2004). We present an efficient method for detecting and segmenting flat-region in the image, and a technique for bit-depth extension to effectively remove false contours. We have simulated bit-depth reduction followed by video enhancement processing that cause false contours with various video image sequences including simple patterns. Our result shows that false contours are effectively removed in the flat-region in the image while the sharpness of object edges is preserved
Meta Comments for Summarizing Meeting Speech

This paper is about the extractive summarization of meeting speech, using the ICSI and AMI corpora. In the first set of experiments we use prosodic, lexical, structural and speaker-related features to selec t th most informative dialogue acts from each meeting, with the hypothesis being that such a rich mixture of features will yield the best results. In the second part, w e present an approach in which the identification of “meta-comments” is used to creat e more informative summaries that provide an increased level of abstraction. W e find that the inclusion of these meta comments improves summarization perform ance according to several evaluation metrics.