nils-herrmann/clean_scirepeval huggingface dataset:
Nutrition transition in India.

The primary objective of this review is to examine the demographic and nutrition transition in India in relation to its contribution to the emerging epidemic of chronic non-communicable diseases in this country.



India, the country as a whole and its different states with a population exceeding 1 billion in 2001.



The review examines demographic changes in the population with consequent effects on the population pyramid, the rapidity and rates of urbanisation with striking variations in chronic disease patterns and the trends in obesity between rural and urban communities, attempting to relate their prevalence with the diet and lifestyle changes accompanying them.



The review is based largely on representative large-scale surveys in the country and other reliable documented data on population characteristics. It also includes a review of the published literature.



The results indicate that the demographic changes, rates of urbanisation and changes in dietary patterns are contributing to the changing trends in chronic disease in India.



There is clear evidence of a demographic, epidemiological and nutrition transition in India that is fuelling the epidemic of chronic diseases and obesity, particularly in the urban areas.
Ellipsis Redundancy and Reduction Redundancy

1 Focus and anaphoric destressing Consider a pronunciation of (1) with prominence on the capitalized noun phrases. In terms of a relational notion of prominence, the subject NP she] is prominent within the clause S she beats me], and NP Sue] is prominent within the clause S Sue beats me]. This prosody seems to have the pragmatic function of putting the two clauses into opposition, with prominences indicating where they diier, and prosodic reduction of the remaining parts indicating where the clauses are invariant. (1) She beats me more often than Sue beats me Car84], Roc86] and Roo92] propose theories of focus interpretation which formalize the idea just outlined. Under my assumptions, the prominences are the correlates of a syntactic focus features on the two prominent NPs, written as F subscripts. Further, the grammatical representation of (1) includes operators which interpret the focus features at the level of the minimal dominating S nodes. In the logical form below, each focus feature is interpreted by an operator written .
Evaluating wake models for wind farm control

Wind turbines are typically operated to maximize their own performance without considering the impact of wake effects on nearby turbines. There is the potential to increase total power and reduce structural loads by properly coordinating the individual turbines in a wind farm. The effective design and analysis of such coordinated controllers requires turbine wake models of sufficient accuracy but low computational complexity. This paper first formulates a coordinated control problem for a two-turbine array. Next, the paper reviews several existing simulation tools that range from low-fidelity, quasi-static models to high-fidelity, computational fluid dynamic models. These tools are compared by evaluating the power, loads, and flow characteristics for the coordinated two-turbine array. The results in this paper highlight the advantages and disadvantages of existing wake models for design and analysis of coordinated wind farm controllers.
Learning Context on a Humanoid Robot using Incremental Latent Dirichlet Allocation

In this paper, we formalize and model context in terms of a set of concepts grounded in the sensorimotor interactions of a robot. The concepts are modeled as a web using Markov Random Field (MRF), inspired from the concept web hypothesis for representing concepts in humans. On this concept web, we treat context as a latent variable of Latent Dirichlet Allocation (LDA), which is a widely-used method in computational linguistics for modeling topics in texts. We extend the standard LDA method in order to make it incremental so that: 1) it does not relearn everything from scratch given new interactions (i.e., it is online); and 2) it can discover and add a new context into its model when necessary. We demonstrate on the iCub platform that, partly owing to modeling context on top of the concept web, our approach is adaptive, online, and robust: it is adaptive and online since it can learn and discover a new context from new interactions. It is robust since it is not affected by irrelevant stimuli and it can discover contexts after a few interactions only. Moreover, we show how to use the context learned in such a model for two important tasks: object recognition and planning.
Comparative evaluation of latency reducing and tolerating techniques

Techniques that can cope with the large latency of memory accesses are essential for achieving high processor utilization in large-scale shared-memory multiprocessors. In this paper, we consider four architectural techniques that address the latency problem: (i) hardware coherent caches, (ii) relaxed memory consistency, (M) softwarecontrolled prefetching, and (iv) multiple-context support. While some studies of benefits of the individual techniques have been done, no study evaluates all of the techniques witi a consistent framework. This paper attempts to remedy this by providing a comprehensive evaluation of the benefits of the four techniques, both individudty and in combinations, using a consistent set of architectural assumptions. The results in this paper have been obtained using detailed simulations of a large-scale shared-memory multiprocessor. Our results show that caches and relaxed consistency uniformly improve performance. The improvements due to prefetcbing and multiple contexts are sizeable, but are much more appficationdependent. Combinations of the various techniques generally attain better performance than each one on its own. Overall, we show that using suitable combinations of the techniques, performance can be improved by 4 to 7 times.
Mining a Sub-Matrix of Maximal Sum

Biclustering techniques have been widely used to identify homogeneous subgroups within large data matrices, such as subsets of genes similarly expressed across subsets of patients. Mining a max-sum sub-matrix is a related but distinct problem for which one looks for a (non-necessarily contiguous) rectangular sub-matrix with a maximal sum of its entries. Le Van et al.  already illustrated its applicability to gene expression analysis and addressed it with a constraint programming (CP) approach combined with large neighborhood search (CP-LNS). In this work, we exhibit some key properties of this NP-hard problem and define a bounding function such that larger problems can be solved in reasonable time. Two different algorithms are proposed in order to exploit the highlighted characteristics of the problem: a CP approach with a global constraint (CPGC) and mixed integer linear programming (MILP). Practical experiments conducted both on synthetic and real gene expression data exhibit the characteristics of these approaches and their relative benefits over the original CP-LNS method. Overall, the CPGC approach tends to be the fastest to produce a good solution. Yet, the MILP formulation is arguably the easiest to formulate and can also be competitive.
Quality-Specific Hand Vein Recognition System

Vein images generally appear darker with low contrast, which require contrast enhancement during preprocessing to design satisfactory hand vein recognition system. However, the modification introduced by contrast enhancement (CE) is reported to bring side effects through pixel intensity distribution adjustments. Furthermore, the inevitable results of fake vein generation or information loss occur and make nearly all vein recognition systems unconvinced. In this paper, a “CE-free” quality-specific vein recognition system is proposed, and three improvements are involved. First, a high-quality lab-vein capturing device is designed to solve the problem of low contrast from the view of hardware improvement. Then, a high quality lab-made database is established. Second, CFISH score, a fast and effective measurement for vein image quality evaluation, is proposed to obtain quality index of lab-made vein images. Then, unsupervised  $K$ -means with optimized initialization and convergence condition is designed with the quality index to obtain the grouping results of the database, namely, low quality (LQ) and high quality (HQ). Finally, discriminative local binary pattern (DLBP) is adopted as the basis for feature extraction. For the HQ image, DLBP is adopted directly for feature extraction, and for the LQ one. CE_DLBP could be utilized for discriminative feature extraction for LQ images. Based on the lab-made database, rigorous experiments are conducted to demonstrate the effectiveness and feasibility of the proposed system. What is more, an additional experiment with PolyU database illustrates its generalization ability and robustness.
Improved Guarantees for Vertex Sparsification in Planar Graphs

Graph Sparsification aims at compressing large graphs into smaller ones while (approximately) preserving important characteristics of the input graph. In this work we study Vertex Sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. Given a weighted graph G = (V,E), and a terminal setK with |K| = k, a quality-q vertex cut sparsifier ofG is a graphH withK ⊂ VH that preserves the value of minimum cuts separating any bipartition of K, up to a factor of q. We show that planar graphs with all the k terminals lying on the same face admit quality-1 vertex cut sparsifier of size O(k2) that are also planar. Our result extends to vertex flow and distance sparsifiers. It improves the previous best known bound of O(k222k) for cut and flow sparsifiers by an exponential factor, and matches an Ω(k2) lower-bound for this class of graphs. We also study vertex reachability sparsifiers for directed graphs. Given a digraph G = (V,E) and a terminal set K, a vertex reachability sparsifier of G is a digraph H = (VH , EH), K ⊂ VH that preserves all reachability information among terminal pairs. We introduce the notion of reachability-preserving minors, i.e., we require H to be a minor of G. Among others, for general planar digraphs, we construct reachability-preserving minors of size O(k2 log2 k). We complement our upper-bound by showing that there exists an infinite family of acyclic planar digraphs such that any reachability-preserving minor must have Ω(k2) vertices.
Neurexin-neuroligin adhesions capture surface-diffusing AMPA receptors through PSD-95 scaffolds.

The mechanisms governing the recruitment of functional glutamate receptors at nascent excitatory postsynapses following initial axon-dendrite contact remain unclear. We examined here the ability of neurexin/neuroligin adhesions to mobilize AMPA-type glutamate receptors (AMPARs) at postsynapses through a diffusion/trap process involving the scaffold molecule PSD-95. Using single nanoparticle tracking in primary rat and mouse hippocampal neurons overexpressing or lacking neuroligin-1 (Nlg1), a striking inverse correlation was found between AMPAR diffusion and Nlg1 expression level. The use of Nlg1 mutants and inhibitory RNAs against PSD-95 demonstrated that this effect depended on intact Nlg1/PSD-95 interactions. Furthermore, functional AMPARs were recruited within 1 h at nascent Nlg1/PSD-95 clusters assembled by neurexin-1β multimers, a process requiring AMPAR membrane diffusion. Triggering novel neurexin/neuroligin adhesions also caused a depletion of PSD-95 from native synapses and a drop in AMPAR miniature EPSCs, indicating a competitive mechanism. Finally, both AMPAR level at synapses and AMPAR-dependent synaptic transmission were diminished in hippocampal slices from newborn Nlg1 knock-out mice, confirming an important role of Nlg1 in driving AMPARs to nascent synapses. Together, these data reveal a mechanism by which membrane-diffusing AMPARs can be rapidly trapped at PSD-95 scaffolds assembled at nascent neurexin/neuroligin adhesions, in competition with existing synapses.
Face Recognition by Humans: Nineteen Results All Computer Vision Researchers Should Know About

A key goal of computer vision researchers is to create automated face recognition systems that can equal, and eventually surpass, human performance. To this end, it is imperative that computational researchers know of the key findings from experimental studies of face recognition by humans. These findings provide insights into the nature of cues that the human visual system relies upon for achieving its impressive performance and serve as the building blocks for efforts to artificially emulate these abilities. In this paper, we present what we believe are 19 basic results, with implications for the design of computational systems. Each result is described briefly and appropriate pointers are provided to permit an in-depth study of any particular result
Social capital : Prospects for a new concept

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://dv1litvip.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
Quantifying Differential Privacy under Temporal Correlations

Differential Privacy (DP) has received increasing attention as a rigorous privacy framework. Many existing studies employ traditional DP mechanisms (e.g., the Laplace mechanism) as primitives, which assume that the data are independent, or that adversaries do not have knowledge of the data correlations. However, continuous generated data in the real world tend to be temporally correlated, and such correlations can be acquired by adversaries. In this paper, we investigate the potential privacy loss of a traditional DP mechanism under temporal correlations in the context of continuous data release. First, we model the temporal correlations using Markov model and analyze the privacy leakage of a DP mechanism when adversaries have knowledge of such temporal correlations. Our analysis reveals that the privacy loss of a DP mechanism may accumulate and increase over time. We call it temporal privacy leakage. Second, to measure such privacy loss, we design an efficient algorithm for calculating it in polynomial time. Although the temporal privacy leakage may increase over time, we also show that its supremum may exist in some cases. Third, to bound the privacy loss, we propose mechanisms that convert any existing DP mechanism into one against temporal privacy leakage. Experiments with synthetic data confirm that our approach is efficient and effective.
Facial fat compartments: a guide to filler placement.

Advances in anatomic understanding are frequently the basis upon which surgical techniques are advanced and refined. Recent anatomic studies of the superficial tissues of the face have led to an increased understanding of the compartmentalized nature of the subcutaneous fat. This report provides a review of the locations and characteristics of the facial fat compartments and provides examples of how this knowledge can be used clinically, specifically with regard to soft tissue fillers.
Mixing plant species in cropping systems: concepts, tools and models. A review

The evolution of natural ecosystems is controled by a high level of biodiversity, In sharp contrast, intensive agricultural systems involve monocultures associated with high input of chemical fertilisers and pesticides. Intensive agricultural systems have clearly negative impacts on soil and water quality and on biodiversity conservation. Alternatively, cropping systems based on carefully designed species mixtures reveal many potential advantages under various conditions, both in temperate and tropical agriculture. This article reviews those potential advantages by addressing the reasons for mixing plant species; the concepts and tools required for understanding and designing cropping systems with mixed species; and the ways of simulating multispecies cropping systems with models. Multispecies systems are diverse and may include annual and perennial crops on a gradient of complexity from 2 to n species. A literature survey shows potential advantages such as (1) higher overall productivity, (2) better control of pests and diseases, (3) enhanced ecological services and (4) greater economic profitability. Agronomic and ecological conceptual frameworks are examined for a clearer understanding of cropping systems, including the concepts of competition and facilitation, above- and belowground interactions and the types of biological interactions between species that enable better pest management in the system. After a review of existing models, future directions in modelling plant mixtures are proposed. We conclude on the need to enhance agricultural research on these multispecies systems, combining both agronomic and ecological concepts and tools.
VLSI Implementation of Internet Checksum Calculation for 10 gigabit Ethernet

Computer networks are limited in performance by the electronic equipment. Terminals have received little attention, but need to be redesigned in order to be able to manage 10 Gigabit Ethernet. The Internet checksum computation, which is used in TCP and UDP requires specialized processing resources. The TUCFP hardware accelerator calculates the Internet checksum. It processes 32 bits in parallel and is designed for easy integration in the general purpose protocol processor. It handles UDP as well as TCP packets in both IPv4 and IPv6 environments. A synthesized implementation for 0.18 micron technology proves a throughput of over 12 Gigabits/s.
Approximate Convex Hull of Data Streams

Given a finite set of points P ⊆ R, we would like to find a small subset S ⊆ P such that the convex hull of S approximately contains P . More formally, every point in P is within distance from the convex hull of S. Such a subset S is called an -hull. Computing an -hull is an important problem in computational geometry, machine learning, and approximation algorithms. In many applications, the set P is too large to fit in memory. We consider the streaming model where the algorithm receives the points of P sequentially and strives to use a minimal amount of memory. Existing streaming algorithms for computing an -hull require O( (1−d)/2) space, which is optimal for a worst-case input. However, this ignores the structure of the data. The minimal size of an -hull of P , which we denote by OPT, can be much smaller. A natural question is whether a streaming algorithm can compute an -hull using only O(OPT) space. We begin with lower bounds that show, under a reasonable streaming model, that it is not possible to have a single-pass streaming algorithm that computes an -hull with O(OPT) space. We instead propose three relaxations of the problem for which we can compute -hulls using space near-linear to the optimal size. Our first algorithm for points in R2 that arrive in random-order uses O(logn ·OPT) space. Our second algorithm for points in R2 makes O(log( −1)) passes before outputting the -hull and requires O(OPT) space. Our third algorithm, for points in R for any fixed dimension d, outputs, with high probability, an -hull for all but δ-fraction of directions and requires O(OPT · log OPT) space. 1 This work was supported in part by the National Science Foundation under grant CCF-1525971. Work was done while the author was at Carnegie Mellon University. 2 This material is based upon work supported in part by the National Science Foundation under Grants No. 1447639, 1650041 and 1652257, Cisco faculty award, and by the ONR Award N00014-18-1-2364. 3 Now at DeepMind. 4 This research was supported by the Franco-American Fulbright Commission and supported in part by National Science Foundation under Grant No. 1447639, 1650041 and 1652257. The author thanks INRIA (l’Institut national de recherche en informatique et en automatique) for hosting him during the writing of this paper. 5 This material is based upon work supported in part by National Science Foundation under Grant No. 1447639, 1650041 and 1652257. Work was done while the author was at Johns Hopkins University. EA T C S © Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, and Lin F. Yang; licensed under Creative Commons License CC-BY 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018).  Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella; Article No. 21; pp. 21:1–21:13 Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany 21:2 Approximate Convex Hull of Data Streams 2012
Driving simulator validation with hazard perception

How should we assess the comparability of driving on a road and ‘‘driving’’ in a simulator? If similar patterns of behaviour are observed, with similar differences between individuals, then we can conclude that driving in the simulator will deliver representative results and the advantages of simulators (controlled environments, hazardous situations) can be appreciated. To evaluate a driving simulator here we compare hazard detection while driving on roads, while watching short film clips recorded from a vehicle moving through traffic, and while driving through a simulated city in a fully instrumented fixed-base simulator with a 90 degree forward view (plus mirrors) that is under the speed/direction control of the driver. In all three situations we find increased scanning by more experienced and especially professional drivers, and earlier eye fixations on hazardous objects for experienced drivers. This comparability encourages the use of simulators in drivers training and testing. ! 2011
Deep convolutional neural networks for annotating gene expression patterns in the mouse brain

Profiling gene expression in brain structures at various spatial and temporal scales is essential to understanding how genes regulate the development of brain structures. The Allen Developing Mouse Brain Atlas provides high-resolution 3-D in situ hybridization (ISH) gene expression patterns in multiple developing stages of the mouse brain. Currently, the ISH images are annotated with anatomical terms manually. In this paper, we propose a computational approach to annotate gene expression pattern images in the mouse brain at various structural levels over the course of development. We applied deep convolutional neural network that was trained on a large set of natural images to extract features from the ISH images of developing mouse brain. As a baseline representation, we applied invariant image feature descriptors to capture local statistics from ISH images and used the bag-of-words approach to build image-level representations. Both types of features from multiple ISH image sections of the entire brain were then combined to build 3-D, brain-wide gene expression representations. We employed regularized learning methods for discriminating gene expression patterns in different brain structures. Results show that our approach of using convolutional model as feature extractors achieved superior performance in annotating gene expression patterns at multiple levels of brain structures throughout four developing ages. Overall, we achieved average AUC of 0.894 ± 0.014, as compared with 0.820 ± 0.046 yielded by the bag-of-words approach. Deep convolutional neural network model trained on natural image sets and applied to gene expression pattern annotation tasks yielded superior performance, demonstrating its transfer learning property is applicable to such biological image sets.