nils-herrmann/clean_scirepeval huggingface dataset:
Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret

Social advertisement is one of the fastest growing sectors in the digital advertisement landscape: ads in the form of promoted posts are shown in the feed of users of a social networking platform, along with normal social posts; if a user clicks on a promoted post, the host (social network owner) is paid a fixed amount from the advertiser. In this context, allocating ads to users is typically performed by maximizing click-through-rate, i.e., the likelihood that the user will click on the ad. However, this simple strategy fails to leverage the fact the ads can propagate virally through the network, from endorsing users to their followers. In this paper, we study the problem of allocating ads to users through the viral-marketing lens. Advertisers approach the host with a budget in return for the marketing campaign service provided by the host. We show that allocation that takes into account the propensity of ads for viral propagation can achieve significantly better performance. However, uncontrolled virality could be undesirable for the host as it creates room for exploitation by the advertisers: hoping to tap uncontrolled virality, an advertiser might declare a lower budget for its marketing campaign, aiming at the same large outcome with a smaller cost. This creates a challenging trade-off: on the one hand, the host aims at leveraging virality and the network effect to improve advertising efficacy, while on the other hand the host wants to avoid giving away free service due to uncontrolled virality. We formalize this as the problem of ad allocation with minimum regret, which we show is NP-hard and inapproximable w.r.t. any factor. However, we devise an algorithm that provides approximation guarantees w.r.t. the total budget of all advertisers. We develop a scalable version of our approximation algorithm, which we extensively test on four real-world data sets, confirming that our algorithm delivers high quality solutions, is scalable, and significantly outperforms several natural baselines.
A new shampoo based on neem (Azadirachta indica) is highly effective against head lice in vitro

Because topical compounds based on insecticidal chemicals are the mainstay of head lice treatment, but resistance is increasing, alternatives, such as herbs and oils are being sold to treat head lice. To test a commercial shampoo based on seed extract of Azadirachta indica (neem tree) for its in vitro effect, head lice (n=17) were collected from school children in Australia and immersed in Wash-Away Louse™ shampoo (Alpha-Biocare GmbH, Germany). Vitality was evaluated for more than 3 h by examination under a dissecting microscope. Positive and negative controls were a commercially available head lice treatment containing permethrin 1% (n=19) and no treatment (n=14). All lice treated with the neem shampoo did not show any vital signs from the initial examination after immersion at 5–30 min; after 3 h, only a single louse showed minor signs of life, indicated by gut movements, a mortality of 94%. In the permethrin group, mortality was 20% at 5 min, 50% at 15 min, and 74% after 3 h. All 14 head lice of the negative control group survived during the observation period. Our data show that Wash-Away Louse™ is highly effective in vitro against head lice. The neem shampoo was more effective than the permethrin-based product. We speculate that complex plant-based compounds will replace the well-defined chemical pediculicides if resistance to the commonly used products further increases.
Data Center Diagnostics with Network Provenance

Diagnosing problems in data centers has always been a challenging problem due to their complexity and heterogeneity. Among recent proposals for addressing this challenge, one promising approach leverages provenance, which provides the fundamental functionality that is needed for performing fault diagnosis and debugging—a way to track direct and indirect causal relationships between system states and their changes. This information is valuable, since it permits system operators to tie observed symptoms of a faults to their potential root causes. However, capturing provenance in a data center is challenging because, at high data rates, it would impose a substantial cost. In this paper, we introduce techniques that can help with this: We show how to reduce the cost of maintaining provenance by leveraging structural similarities for compression, and by offloading expensive but highly parallel operations to hardware. We also discuss our progress towards transforming provenance into compact actionable diagnostic decisions to repair problems caused by misconfigurations and program bugs.
An Exploration of Optimization Algorithms for High Performance Tensor Completion

Tensor completion is a powerful tool used to estimate or recover missing values in multi-way data. It has seen great success in domains such as product recommendation and healthcare. Tensor completion is most often accomplished via low-rank sparse tensor factorization, a computationally expensive non-convex optimization problem which has only recently been studied in the context of parallel computing. In this work, we study three optimization algorithms that have been successfully applied to tensor completion: alternating least squares (ALS), stochastic gradient descent (SGD), and coordinate descent (CCD++). We explore opportunities for parallelism on shared- and distributed-memory systems and address challenges such as memory- and operation-efficiency, load balance, cache locality, and communication. Among our advancements are an SGD algorithm which combines stratification with asynchronous communication, an ALS algorithm rich in level-3 BLAS routines, and a communication-efficient CCD++ algorithm. We evaluate our optimizations on a variety of real datasets using a modern supercomputer and demonstrate speedups through 1024 cores. These improvements effectively reduce time-to-solution from hours to seconds on real-world datasets. We show that after our optimizations, ALS is advantageous on parallel systems of small-to-moderate scale, while both ALS and CCD++ will provide the lowest time-to-solution on large-scale distributed systems.
An Adaptive Recurrent Neural Network for Remaining Useful Life Prediction of Lithium-ion Batteries

Prognostics is an emerging science of predicting the health condition of a system (or its components) based upon current and previous system states. A reliable predictor is very useful to a wide array of industries to predict the future states of the system such that the maintenance service could be scheduled in advance when needed. In this paper, an adaptive recurrent neural network (ARNN) is proposed for system dynamic state forecasting. The developed ARNN is constructed based on the adaptive/recurrent neural network architecture and the network weights are adaptively optimized using the recursive Levenberg-Marquardt (RLM) method. The effectiveness of the proposed ARNN is demonstrated via an application in remaining useful life prediction of lithium-ion batteries.
A Survey on Feature Extraction Methods for Handwritten Digits Recognition

Hand written digit recognition is highly nonlinear problem. Recognition of handwritten numerals plays an active role in day to day life now days. Office automation, e-governors and many other areas, reading printed or handwritten documents and convert them to digital media is very crucial and time consuming task. So the system should be designed in such a way that it should be capable of reading handwritten numerals and provide appropriate response as humans do. However, handwritten digits are varying from person to person because each one has their own style of writing, means the same digit or character/word written by different writer will be different even in different languages. This paper presents survey on handwritten digit recognition systems with recent techniques, with three well known classifiers namely MLP, SVM and k-NN used for classification. This paper presents comparative analysis that describes recent methods and helps to find future scope.
Parameter selection for total-variation-based image restoration using discrepancy principle

There are two key issues in successfully solving the image restoration problem: 1) estimation of the regularization parameter that balances data fidelity with the regularity of the solution and 2) development of efficient numerical techniques for computing the solution. In this paper, we derive a fast algorithm that simultaneously estimates the regularization parameter and restores the image. The new approach is based on the total-variation (TV) regularized strategy and Morozov's discrepancy principle. The TV norm is represented by the dual formulation that changes the minimization problem into a minimax problem. A proximal point method is developed to compute the saddle point of the minimax problem. By adjusting the regularization parameter adaptively in each iteration, the solution is guaranteed to satisfy the discrepancy principle. We will give the convergence proof of our algorithm and numerically show that it is better than some state-of-the-art methods in terms of both speed and accuracy.
EPCBC - A Block Cipher Suitable for Electronic Product Code Encryption

In this paper, we present EPCBC, a lightweight cipher that has 96-bit key size and 48-bit/96-bit block size. This is suitable for Electronic Product Code (EPC) encryption, which uses low-cost passive RFID-tags and exactly 96 bits as a unique identifier on the item level. EPCBC is based on a generalized PRESENT with block size 48 and 96 bits for the main cipher structure and customized key schedule design which provides strong protection against related-key differential attacks, a recent class of powerful attacks on AES. Related-key attacks are especially relevant when a block cipher is used as a hash function. In the course of proving the security of EPCBC, we could leverage on the extensive security analyses of PRESENT, but we also obtain new results on the differential and linear cryptanalysis bounds for the generalized PRESENT when the block size is less than 64 bits, and much tighter bounds otherwise. Further, we analyze the resistance of EPCBC against integral cryptanalysis, statistical saturation attack, slide attack, algebraic attack and the latest higher-order differential cryptanalysis from FSE 2011 . Our proposed cipher would be the most efficient at EPC encryption, since for other ciphers such as AES and PRESENT, it is necessary to encrypt 128-bit blocks (which results in a 33% overhead being incurred). The efficiency of our proposal therefore leads to huge market implications. Another contribution is an optimized implementation of PRESENT that is smaller and faster than previously published results.
Fog detection system based on computer vision techniques

In this document, a real-time fog detection system using an on-board low cost b&w camera, for a driving application, is presented. This system is based on two clues: estimation of the visibility distance, which is calculated from the camera projection equations and the blurring due to the fog. Because of the water particles floating in the air, sky light gets diffuse and, focus on the road zone, which is one of the darkest zones on the image. The apparent effect is that some part of the sky introduces in the road. Also in foggy scenes, the border strength is reduced in the upper part of the image. These two sources of information are used to make this system more robust. The final purpose of this system is to develop an automatic vision-based diagnostic system for warning ADAS of possible wrong working conditions. Some experimental results and the conclusions about this work are presented.
A novel oral iron-complex formulation: Encapsulation of hemin in polymeric micelles and its in vitro absorption.

Anemia resulting from iron deficiency is one of the most prevalent diseases in the world. As iron has important roles in several biological processes such as oxygen transport, DNA synthesis and cell growth, there is a high need for iron therapies that result in high iron bioavailability with minimal toxic effects to treat patients suffering from anemia. This study aims to develop a novel oral iron-complex formulation based on hemin-loaded polymeric micelles composed of the biodegradable and thermosensitive polymer methoxy-poly(ethylene glycol)-b-poly[N-(2-hydroxypropyl)methacrylamide-dilactate], abbreviated as mPEG-b-p(HPMAm-Lac2). Hemin-loaded micelles were prepared by addition of hemin dissolved in DMSO:DMF (1:9, one volume) to an aqueous polymer solution (nine volumes) of mPEG-b-p(HPMAm-Lac2) followed by rapidly heating the mixture at 50°C to form hemin-loaded micelles that remain intact at room and physiological temperature. The highest loading capacity for hemin in mPEG-b-p(HPMAm-Lac2) micelles was 3.9%. The average particle diameter of the hemin-micelles ranged from 75 to 140nm, depending on the concentration of hemin solution that was used to prepare the micelles. The hemin-loaded micelles were stable at pH 2 for at least 3 h which covers the residence time of the formulation in the stomach after oral administration and up to 17 h at pH 7.4 which is sufficient time for uptake of the micelles by the enterocytes. Importantly, incubation of Caco-2 cells with hemin-micelles for 24 h at 37°C resulted in ferritin levels of 2500ng/mg protein which is about 10-fold higher than levels observed in cells incubated with iron sulfate under the same conditions. The hemin formulation also demonstrated superior cell viability compared to iron sulfate with and without ascorbic acid. The study presented here demonstrates the development of a promising novel iron complex for oral delivery.
Paramaligne Symptome des kleinzelligen Lungencarcinoms

Paramaligne Erscheinungen stellen eigenartige Symptome der Krebskrankheit dar. Sie sind meist bei den Lungeneareinomen und hier haupts/tchlieh bei den kleinzelligen Carcinomen zu verzeichnen. Es kommen vor (BA~I~TY, CouRY u. RULLI~RE, 1964) neurologische, osteoartikul~re, h/~matologische, vascul/ire, metabolische, Muskelund Hauterscheinungen. Bei den endokrinologisehen Symptomen kSnnen die bioehemisehen Untersuehungen reeht interessante Ergebnisse zeigen (CrrA~OT, 1964; AZZOPARDI u. BELLAU, 1965). Von diesen Symptomen sind die osteoartikul/~ren die h~ufigsten. In unserer Zusammensteliung von 225 kleinzelligen Lungencarcinomen haben wir 44 Kranke mit verschieden stark ent~,iekelten Ver~nderungen im Sinne der Trommelschlegel finger gefunden (Tab.).
Guidelines for the diagnosis and treatment of chronic lymphocytic leukemia: a report from the International Workshop on Chronic Lymphocytic Leukemia updating the National Cancer Institute-Working Group 1996 guidelines.

Standardized criteria for diagnosis and response assessment are needed to interpret and compare clinical trials and for approval of new therapeutic agents by regulatory agencies. Therefore, a National Cancer Institute-sponsored Working Group (NCI-WG) on chronic lymphocytic leukemia (CLL) published guidelines for the design and conduct of clinical trials for patients with CLL in 1988, which were updated in 1996. During the past decade, considerable progress has been achieved in defining new prognostic markers, diagnostic parameters, and treatment options. This prompted the International Workshop on Chronic Lymphocytic Leukemia (IWCLL) to provide updated recommendations for the management of CLL in clinical trials and general practice.
Lithium and bipolar disorder: Impacts from molecular to behavioural circadian rhythms.

Bipolar disorder (BD) is a severe and common psychiatric disorder. BD pathogenesis, clinical manifestations and relapses are associated with numerous circadian rhythm abnormalities. Lithium (Li) is the first-line treatment in BD, and its therapeutic action has been related to its ability to alter circadian rhythms. We systematically searched the PubMed database until January 2016, aiming to critically examine published studies investigating direct and indirect effects of Li on circadian rhythms. The results, from the 95 retained studies, indicated that Li: acts directly on the molecular clocks; delays the phase of sleep-wakefulness rhythms and the peak elevation of diurnal cycle body temperature; reduces the amplitude and shortens the duration of activity rhythms and lengthens free-running rhythms. Chronic Li treatment stabilizes free-running activity rhythms, by improving day-to-day rhythmicity of the activity, with effects that appear to be dose related. Pharmacogenetics demonstrate several associations of Li's response with circadian genes (NR1D1, GSK3β, CRY1, ARNTL, TIM, PER2). Finally, Li acts on the retinal-hypothalamic pineal pathway, influencing light sensitivity and melatonin secretion. Li is a highly investigated chronobiologic agent, and although its chronobiological effects are not completely understood, it seems highly likely that they constitute an inherent component of its therapeutic action in the treatment of mood disorders.
The Fast Fourier Transform

sprightly style and is interesting from cover to cover. The comments, critiques, and summaries that accompany the chapters are very helpful in crystalizing the ideas and answering questions that may arise, particularly to the self-learner. The transparency in the presentation of the material in the book equips the reader to proceed quickly to a wealth of problems included at the end of each chapter. These problems ranging from elementary to research-level are very valuable in that a solid working knowledge of the invariant imbedding techniques is acquired as well as good insight in attacking problems in various applied areas. Furthermore, a useful selection of references is given at the end of each chapter. This book may not appeal to those mathematicians who are interested primarily in the sophistication of mathematical theory, because the authors have deliberately avoided all pseudo-sophistication in attaining transparency of exposition. Precisely for the same reason the majority of the intended readers who are applications-oriented and are eager to use the techniques quickly in their own fields will welcome and appreciate the efforts put into writing this book. From a purely mathematical point of view, some of the invariant imbedding results may be considered to be generalizations of the classical theory of first-order partial differential equations, and a part of the analysis of invariant imbedding is still at a somewhat heuristic stage despite successes in many computational applications. However, those who are concerned with mathematical rigor will find opportunities to explore the foundations of the invariant imbedding method. In conclusion, let me quote the following: "What is the best method to obtain the solution to a problem'? The answer is, any way that works." (Richard P. Feyman, Engineering and Science, March 1965,  In this well-written book, Bellman and Wing have indeed accomplished the task of introducing the simplicity of the invariant imbedding method to tackle various problems of interest to engineers, physicists, applied mathematicians, and numerical analysts.
Efficient implementation of sorting on multi-core SIMD CPU architecture

Sorting a list of input numbers is one of the most fundamental problems in the field of computer science in general and high-throughput database applications in particular. Although literature abounds with various flavors of sorting algorithms, different architectures call for customized implementations to achieve faster sorting times. This paper presents an efficient implementation and detailed analysis of MergeSort on current CPU architectures. Our SIMD implementation with 128-bit SSE is 3.3X faster than the scalar version. In addition, our algorithm performs an efficient multiway merge, and is not constrained by the memory bandwidth. Our multi-threaded, SIMD implementation sorts 64 million floating point numbers in less than 0.5 seconds on a commodity 4-core Intel processor. This measured performance compares favorably with all previously published results. Additionally, the paper demonstrates performance scalability of the proposed sorting algorithm with respect to certain salient architectural features of modern chip multiprocessor (CMP) architectures, including SIMD width and core-count. Based on our analytical models of various architectural configurations, we see excellent scalability of our implementation with SIMD width scaling up to 16X wider than current SSE width of 128-bits, and CMP core-count scaling well beyond 32 cores. Cycle-accurate simulation of Intel’s upcoming x86 many-core Larrabee architecture confirms scalability of our proposed algorithm.
The morphology, life-history and systematic position of Haplorchoides mehrai Pande & Shukla, 1976 (Trematoda: Heterophyidae)

The life-history of Haplorchoides mehrai Pande & Shukla, 1976 is elucidated. The cercariae occurred in the thiarid snail Melanoides tuberculatus (Muller) collected from Chilka Lake, Orissa State. Metacercariae were found beneath the scales of Puntius sophore (Hamilton). Several species of catfishes in the lake served as definitive hosts. All stages in the life-cycle were successfully established under experimental conditions in the laboratory. The cercariae are of opisthorchioid type with a large globular and highly granular excretory bladder and seven pairs of pre-vesicular penetration glands. The adult flukes are redescribed to include details of the ventro-genital complex. Only three Indian species of the genus, i.e. H. attenuatus (Srivastava, 1935), H. pearsoni Pande & Shukla, 1976 and H. mehrai Pande & Shukla, 1976, are considered valid, and the remaining Indian species of the genus are considered as species inquirendae. The generic diagnosis of Haplorchoides is amended and the genus is included in the subfamily Haplorchiinae and the family Heterophyidae.
Tools for inventing organizations: toward a handbook of organizational processes

This paper describes a new project intended to provide a firmer theoretical and empirical foundation for such tasks as enterprise modeling, enterprise integration, and process re-engineering. The project includes ( 1 ) collecting examples of how different organizations perform sim'lar processes, and ( 2 ) representing these examples in an on-line "process handbook" which includes the relative advantages of the alternatives. The handbook is intended to help (a) redesign existing Organizational processes, ( b ) invent new organizational processes that take advantage of information technology, and perhaps (e ) automatically generate sofivare to support organizational processes. A key element of the work is a novel approach to representing processes at various levels of abstraction. This approach uses ideas from computer science about inheritance and from coordinalion theory about managing dependencies. Its primary advantage is that it allows users to explicitly represent the similarities (and differences) among related processes and to easily find or generate sensible alternatives for how a given process could be
An Integrated Approach for Arabic-English Named Entity Translation

Translation of named entities (NEs), such as person names, organization names and location names is crucial for cross lingual information retrieval, machine translation, and many other natural language processing applications. Newly named entities are introduced on daily basis in newswire and this greatly complicates the translation task. Also, while some names can be translated, others must be transliterated, and, still, others are mixed. In this paper we introduce an integrated approach for named entity translation deploying phrase-based translation, word-based translation, and transliteration modules into a single framework. While Arabic based, the approach introduced here is a unified approach that can be applied to NE translation for any language pair.