nils-herrmann/clean_scirepeval huggingface dataset:
A Neural Network Approch to Efficient Valuation of Large Portfolios of Variable Annuities

Managing and hedging the risks associated with Variable Annuity (VA) products requires intraday valuation of key risk metrics for these products. The complex structure of VA products and computational complexity of their accurate evaluation has compelled insurance companies to adopt Monte Carlo (MC) simulations to value their large portfolios of VA products. Because the MC simulations are computationally demanding, especially for intraday valuations, insurance companies need more efficient valuation techniques. Recently, a framework based on traditional spatial interpolation techniques has been proposed that can significantly decrease the computational complexity of MC simulation (Gan and Lin, 2015). However, traditional interpolation techniques require the definition of a distance function that can significantly impact their accuracy. Moreover, none of the traditional spatial interpolation techniques provide all of the key properties of accuracy, efficiency, and granularity (Hejazi et al., 2015). In this paper, we present a neural network approach for the spatial interpolation framework that affords an efficient way to find an effective distance function. The proposed approach is accurate, efficient, and provides an accurate granular view of the input portfolio. Our numerical experiments illustrate the superiority of the performance of the proposed neural network approach compared to the traditional spatial interpolation schemes.
Searching for Justice The Discovery of IQ Gains Over Time

Humane-egalitarian ideals, whose aims are group justice and reducing environmental inequality and privilege, must be tested against reality, as revealed by psychology and other social sciences. Four issues are addressed: the equation between IQ and intelligence, whether group potential is determined by a group's mean IQ, whether the BlackWhite IQ gap is genetic, and the meritocratic thesis that genes for IQ will become highly correlated with class. Massive IQ gains over time test the lQ-intelligence equation, reveal groups who achieve far beyond their mean IQs, and falsify prominent arguments for a genetic racial IQ gap. Class IQ trends suggest America is not evolving toward a meritocracy, but a core refutation of that thesis is needed and supplied. Finally, the viability of humane ideals is assessed against a worst-case scenario.
Optimization of hybrid PV/wind power system for remote telecom station

The rapid depletion of fossil fuel resources and environmental concerns has given awareness on generation of renewable energy resources. Among the various renewable resources, hybrid solar and wind energy seems to be promising solutions to provide reliable power supply with improved system efficiency and reduced storage requirements for stand-alone applications. This paper presents a feasibility assessment and optimum size of photovoltaic (PV) array, wind turbine and battery bank for a standalone hybrid Solar/Wind Power system (HSWPS) at remote telecom station of Nepal at Latitude (27°23′50″) and Longitude (86°44′23″) consisting a telecommunication load of Very Small Aperture Terminal (VSAT), Repeater station and Code Division Multiple Access Base Transceiver Station (CDMA 2C10 BTS). In any RES based system, the feasibility assessment is considered as the first step analysis. In this work, feasibility analysis is carried through hybrid optimization model for electric renewables (HOMER) and mathematical models were implemented in the MATLAB environment to perform the optimal configuration for a given load and a desired loss of power supply probability (LPSP) from a set of systems components with the lowest value of cost function defined in terms of reliability and levelized unit electricity cost (LUCE). The simulation results for the existing and the proposed models are compared. The simulation results shows that existing architecture consisting of 6.12 kW KC85T photovoltaic modules, 1kW H3.1 wind turbine and 1600 Ah GFM-800 battery bank have a 36.6% of unmet load during a year. On the other hand, the proposed system includes 1kW ∗2 H3.1 Wind turbine, 8.05 kW TSM-175DA01 photovoltaic modules and 1125 Ah T-105 battery bank with system reliability of 99.99% with a significant cost reduction as well as reliable energy production.
Stealthy malware detection through vmm-based "out-of-the-box" semantic view reconstruction

An alarming trend in malware attacks is that they are armed with stealthy techniques to detect, evade, and subvert malware detection facilities of the victim. On the defensive side, a fundamental limitation of traditional host-based anti-malware systems is that they run inside the very hosts they are protecting ("in the box"), making them vulnerable to counter-detection and subversion by malware. To address this limitation, recent solutions based on virtual machine (VM) technologies advocate placing the malware detection facilities outside of the protected VM ("out of the box"). However, they gain tamper resistance at the cost of losing the native, semantic view of the host which is enjoyed by the "in the box" approach, thus leading to a technical challenge known as the semantic gap.
 In this paper, we present the design, implementation, and evaluation of VMwatcher - an "out-of-the-box" approach that overcomes the semantic gap challenge. A new technique called guest view casting is developed to systematically reconstruct internal semantic views (e.g., files, processes, and kernel modules) of a VM from the outside in a non-intrusive manner. Specifically, the new technique casts semantic definitions of guest OS data structures and functions on virtual machine monitor (VMM)-level VM states, so that the semantic view can be reconstructed. With the semantic gap bridged, we identify two unique malware detection capabilities: (1) view comparison-based malware detection and its demonstration in rootkit detection and (2) "out-of-the-box" deployment of host-based anti-malware software with improved detection accuracy and tamper-resistance. We have implemented a proof-of-concept prototype on both Linux and Windows platforms and our experimental results with real-world malware, including elusive kernel-level rootkits, demonstrate its practicality and effectiveness.
Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds

Convex empirical risk minimization is a basic tool in machine learning and statistics. We provide new algorithms and matching lower bounds for differentially private convex empirical risk minimization assuming only that each data point's contribution to the loss function is Lipschitz and that the domain of optimization is bounded. We provide a separate set of algorithms and matching lower bounds for the setting in which the loss functions are known to also be strongly convex. Our algorithms run in polynomial time, and in some cases even match the optimal nonprivate running time (as measured by oracle complexity). We give separate algorithms (and lower bounds) for (ε, 0)and (ε, δ)-differential privacy; perhaps surprisingly, the techniques used for designing optimal algorithms in the two cases are completely different. Our lower bounds apply even to very simple, smooth function families, such as linear and quadratic functions. This implies that algorithms from previous work can be used to obtain optimal error rates, under the additional assumption that the contributions of each data point to the loss function is smooth. We show that simple approaches to smoothing arbitrary loss functions (in order to apply previous techniques) do not yield optimal error rates. In particular, optimal algorithms were not previously known for problems such as training support vector machines and the high-dimensional median.
Balancing traffic load in wireless networks with curveball routing

We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink pairs. When routing along shortest paths, the nodes that are centrally located forward a disproportionate amount of traffic. This translates into increased congestion and energy consumption. However, the maximum load can be decreased if the packets follow curved paths. We show that the optimum such routing scheme can be expressed in terms of geometric optics and computed by linear programming. We then propose a practical solution, which we call Curveball Routing which achieves results not much worse than the optimum.
 We evaluate our solution at three levels of fidelity: a Java high-level simulator, the ns2 simulator, and the Intel Mirage Sensor Network Testbed. Simulation results using the high-level simulator show that our solution successfully avoids the crowded center of the network, and reduces the maximum load by up to 40%. At the same time, the increase of the expected path length is minimal, i.e., only 8% on average. Simulation results using the ns2 simulator show that our solution can increase throughput on moderately loaded networks by up to 15%, while testbed results show a reduction in peak energy usage by up to 25%. Our prototype suggests that our solution is easily deployable.
Cache Games -- Bringing Access-Based Cache Attacks on AES to Practice

Side channel attacks on cryptographic systems exploit information gained from physical implementations rather than theoretical weaknesses of a scheme. In recent years, major achievements were made for the class of so called access-driven cache attacks. Such attacks exploit the leakage of the memory locations accessed by a victim process. In this paper we consider the AES block cipher and present an attack which is capable of recovering the full secret key in almost real time for AES-128, requiring only a very limited number of observed encryptions. Unlike previous attacks, we do not require any information about the plaintext (such as its distribution, etc.). Moreover, for the first time, we also show how the plaintext can be recovered without having access to the cipher text at all. It is the first working attack on AES implementations using compressed tables. There, no efficient techniques to identify the beginning of AES rounds is known, which is the fundamental assumption underlying previous attacks. We have a fully working implementation of our attack which is able to recover AES keys after observing as little as 100 encryptions. It works against the OpenS SL 0.9.8n implementation of AES on Linux systems. Our spy process does not require any special privileges beyond those of a standard Linux user. A contribution of probably independent interest is a denial of service attack on the task scheduler of current Linux systems (CFS), which allows one to observe (on average) every single memory access of a victim process.
Overall C as a measure of discrimination in survival analysis: model specific population value and confidence interval estimation.

The assessment of the discrimination ability of a survival analysis model is a problem of considerable theoretical interest and important practical applications. This issue is, however, more complex than evaluating the performance of a linear or logistic regression. Several different measures have been proposed in the biostatistical literature. In this paper we investigate the properties of the overall C index introduced by Harrell as a natural extension of the ROC curve area to survival analysis. We develop the overall C index as a parameter describing the performance of a given model applied to the population under consideration and discuss the statistic used as its sample estimate. We discover a relationship between the overall C and the modified Kendall's tau and construct a confidence interval for our measure based on the asymptotic normality of its estimate. Then we investigate via simulations the length and coverage probability of this interval. Finally, we present a real life example evaluating the performance of a Framingham Heart Study model.
Multi-task Domain Adaptation for Sequence Tagging

Many domain adaptation approaches rely on learning cross domain shared representations to transfer the knowledge learned in one domain to other domains. Traditional domain adaptation only considers adapting for one task. In this paper, we explore multi-task representation learning under the domain adaptation scenario. We propose a neural network framework that supports domain adaptation for multiple tasks simultaneously, and learns shared representations that better generalize for domain adaptation. We apply the proposed framework to domain adaptation for sequence tagging problems considering two tasks: Chinese word segmentation and named entity recognition. Experiments show that multi-task domain adaptation works better than disjoint domain adaptation for each task, and achieves the state-of-the-art results for both tasks in the social media domain.
Autonomous Vehicle-target Assignment: a Game-theoretical Formulation

We consider an autonomous vehicle-target assignment problem where a group of vehicles are expected to optimally assign themselves to a set of targets. We introduce a gametheoretical formulation of the problem in which the vehicles are viewed as self-interested decision makers. Thus, we seek the optimization of a global utility function through autonomous vehicles that are capable of making individually rational decisions to optimize their own utility functions. The first important aspect of the problem is to choose the utility functions of the vehicles in such a way that the objectives of the vehicles are localized to each vehicle yet aligned with a global utility function. The second important aspect of the problem is to equip the vehicles with an appropriate negotiation mechanism by which each vehicle pursues the optimization of its own utility function. We present several design procedures and accompanying caveats for vehicle utility design. We present two new negotiation mechanisms, namely, “generalized regret monitoring with fading memory and inertia” and “selective spatial adaptive play,” and provide accompanying proofs of their convergence. Finally, we present simulations that illustrate how vehicle negotiations can consistently lead to near-optimal assignments provided that the utilities of the vehicles are designed appropriately.
Exploiting Morphological Regularities in Distributional Word Representations

We present an unsupervised, language agnostic approach for exploiting morphological regularities present in high dimensional vector spaces. We propose a novel method for generating embeddings of words from their morphological variants using morphological transformation operators. We evaluate this approach on MSR word analogy test set (Mikolov et al., 2013d) with an accuracy of 85% which is 12% higher than the previous best known system.
The association of registered nurse staffing levels and patient outcomes: systematic review and meta-analysis.

To examine the association between registered nurse (RN) staffing and patient outcomes in acute care hospitals.



Twenty-eight studies reported adjusted odds ratios of patient outcomes in categories of RN-to-patient ratio, and met inclusion criteria. Information was abstracted using a standardized protocol.



Random effects models assessed heterogeneity and pooled data from individual studies. Increased RN staffing was associated with lower hospital related mortality in intensive care units (ICUs) [odds ratios (OR), 0.91; 95% confidence interval (CI), 0.86-0.96], in surgical (OR, 0.84; 95% CI, 0.80-0.89), and in medical patients (OR, 0.94; 95% CI, 0.94-0.95) per additional full time equivalent per patient day. An increase by 1 RN per patient day was associated with a decreased odds ratio of hospital acquired pneumonia (OR, 0.70; 95% CI, 0.56-0.88), unplanned extubation (OR, 0.49; 95% CI, 0.36-0.67), respiratory failure (OR, 0.40; 95% CI, 0.27-0.59), and cardiac arrest (OR, 0.72; 95% CI, 0.62-0.84) in ICUs, with a lower risk of failure to rescue (OR, 0.84; 95% CI, 0.79-0.90) in surgical patients. Length of stay was shorter by 24% in ICUs (OR, 0.76; 95% CI, 0.62-0.94) and by 31% in surgical patients (OR, 0.69; 95% CI, 0.55-0.86).



Studies with different design show associations between increased RN staffing and lower odds of hospital related mortality and adverse patient events. Patient and hospital characteristics, including hospitals' commitment to quality of medical care, likely contribute to the actual causal pathway.
ProductRec: Product Bundle Recommendation Based on User's Sequential Patterns in Social Networking Service Environment

With the overload of information on the Web, Recommender Systems (RSs) are becoming increasingly popular and have been employed to provide suggestions to meet different requirements. RSs are utilized in a variety of areas including movies, music, social tags, user group and products as Web services evoked on the Internet either as mobile Apps or PC-based applications. However, it is challenging to achieve personalized recommendations instead of offering up too many lowest common denominator recommendations. Understanding how products relate to each other is important because it has great impact on the performance. Furthermore, the personalized sequential behavior, which is closely related to a particular product, is essential for recommender systems. Most models simply integrate features from users and items without considering potential product bundle relationships between products exposed by users' personalized sequential behaviors. In this paper, a novel method based on Factorizing Personalized Markov Chain (FPMC) is proposed to comprehensively explore the latent bundle relations from users perspective, along with the hidden correlative semantics between products obtained from logic regression method, which provides a unified view to describe the user preferences, product/item features, and the user sequential patterns in timely manner. The involved semantic features are extracted using deep learning models. We evaluate our method on real-world Amazon datasets and our framework significantly outperforms other baseline models, especially on sparse datasets. The experimental results show that our approach qualitatively captures personalized behaviors with superior recommendation performance.
WISDOM: Web intrapage informative structure mining based on document object model

To increase the commercial value and accessibility of pages, most content sites tend to publish their pages with intrasite redundant information, such as navigation panels, advertisements, and copyright announcements. Such redundant information increases the index size of general search engines and causes page topics to drift. In this paper, we study the problem of mining intrapage informative structure in news Web sites in order to find and eliminate redundant information. Note that intrapage informative structure is a subset of the original Web page and is composed of a set of fine-grained and informative blocks. The intrapage informative structures of pages in a news Web site contain only anchors linking to news pages or bodies of news articles. We propose an intrapage informative structure mining system called WISDOM (Web intrapage informative structure mining based on the document object model) which applies Information Theory to DOM tree knowledge in order to build the structure. WISDOM splits a DOM tree into many small subtrees and applies a top-down informative block searching algorithm to select a set of candidate informative blocks. The structure is built by expanding the set using proposed merging methods. Experiments on several real news Web sites show high precision and recall rates which validates WISDOM'S practical applicability.
PIK3CA-related overgrowth spectrum (PROS): diagnostic and testing eligibility criteria, differential diagnosis, and evaluation.

Somatic activating mutations in the phosphatidylinositol-3-kinase/AKT/mTOR pathway underlie heterogeneous segmental overgrowth phenotypes. Because of the extreme differences among patients, we sought to characterize the phenotypic spectrum associated with different genotypes and mutation burdens, including a better understanding of associated complications and natural history. Historically, the clinical diagnoses in patients with PIK3CA activating mutations have included Fibroadipose hyperplasia or Overgrowth (FAO), Hemihyperplasia Multiple Lipomatosis (HHML), Congenital Lipomatous Overgrowth, Vascular Malformations, Epidermal Nevi, Scoliosis/Skeletal and Spinal (CLOVES) syndrome, macrodactyly, Fibroadipose Infiltrating Lipomatosis, and the related megalencephaly syndromes, Megalencephaly-Capillary Malformation (MCAP or M-CM) and Dysplastic Megalencephaly (DMEG). A workshop was convened at the National Institutes of Health (NIH) to discuss and develop a consensus document regarding diagnosis and treatment of patients with PIK3CA-associated somatic overgrowth disorders. Participants in the workshop included a group of researchers from several institutions who have been studying these disorders and have published their findings, as well as representatives from patient-advocacy and support groups. The umbrella term of "PIK3CA-Related Overgrowth Spectrum (PROS)" was agreed upon to encompass both the known and emerging clinical entities associated with somatic PIK3CA mutations including, macrodactyly, FAO, HHML, CLOVES, and related megalencephaly conditions. Key clinical diagnostic features and criteria for testing were proposed, and testing approaches summarized. Preliminary recommendations for a uniform approach to assessment of overgrowth and molecular diagnostic testing were determined. Future areas to address include the surgical management of overgrowth tissue and vascular anomalies, the optimal approach to thrombosis risk, and the testing of potential pharmacologic therapies.
Incremental Dialogue System Faster than and Preferred to its Nonincremental Counterpart

Current dialogue systems generally operate in a pipelined, modular fashion on one complete utterance at a time. Evidence from human language understanding shows that human understanding operates incrementally and makes use of multiple sources of information during the parsing process, including traditionally “later” components such as pragmatics. In this paper we describe a spoken dialogue system that understands language incrementally, provides visual feedback on possible referents during the course of the user’s utterance, and allows for overlapping speech and actions. We further present findings from an empirical study showing that the resulting dialogue system is faster overall than its nonincremental counterpart. Furthermore, the incremental system is preferred to its nonincremental counterpart – beyond what is accounted for by factors such as speed and accuracy. These results indicate that successful incremental understanding systems will improve both performance and usability.