nils-herrmann/clean_scirepeval huggingface dataset:
Analytical approach to parallel repetition

We propose an analytical framework for studying parallel repetition, a basic product operation for one-round twoplayer games. In this framework, we consider a relaxation of the value of projection games. We show that this relaxation is multiplicative with respect to parallel repetition and that it provides a good approximation to the game value. Based on this relaxation, we prove the following improved parallel repetition bound: For every projection game G with value at most ρ, the k-fold parallel repetition G⊗k has value at most
 
 This statement implies a parallel repetition bound for projection games with low value ρ. Previously, it was not known whether parallel repetition decreases the value of such games. This result allows us to show that approximating set cover to within factor (1 --- ε) ln n is NP-hard for every ε > 0, strengthening Feige's quasi-NP-hardness and also building on previous work by Moshkovitz and Raz.
 In this framework, we also show improved bounds for few parallel repetitions of projection games, showing that Raz's counterexample to strong parallel repetition is tight even for a small number of repetitions.
 Finally, we also give a short proof for the NP-hardness of label cover(1, Δ) for all Δ > 0, starting from the basic PCP theorem.
BioGateway: a semantic systems biology tool for the life sciences

Life scientists need help in coping with the plethora of fast growing and scattered knowledge resources. Ideally, this knowledge should be integrated in a form that allows them to pose complex questions that address the properties of biological systems, independently from the origin of the knowledge. Semantic Web technologies prove to be well suited for knowledge integration, knowledge production (hypothesis formulation), knowledge querying and knowledge maintenance. We implemented a semantically integrated resource named BioGateway, comprising the entire set of the OBO foundry candidate ontologies, the GO annotation files, the SWISS-PROT protein set, the NCBI taxonomy and several in-house ontologies. BioGateway provides a single entry point to query these resources through SPARQL. It constitutes a key component for a Semantic Systems Biology approach to generate new hypotheses concerning systems properties. In the course of developing BioGateway, we faced challenges that are common to other projects that involve large datasets in diverse representations. We present a detailed analysis of the obstacles that had to be overcome in creating BioGateway. We demonstrate the potential of a comprehensive application of Semantic Web technologies to global biomedical data. The time is ripe for launching a community effort aimed at a wider acceptance and application of Semantic Web technologies in the life sciences. We call for the creation of a forum that strives to implement a truly semantic life science foundation for Semantic Systems Biology. Access to the system and supplementary information (such as a listing of the data sources in RDF, and sample queries) can be found at http://www.semantic-systems-biology.org/biogateway .
NELasso: Group-Sparse Modeling for Characterizing Relations Among Named Entities in News Articles

Named entities such as people, locations, and organizations play a vital role in characterizing online content. They often reflect information of interest and are frequently used in search queries. Although named entities can be detected reliably from textual content, extracting relations among them is more challenging, yet useful in various applications (e.g., news recommending systems). In this paper, we present a novel model and system for learning semantic relations among named entities from collections of news articles. We model each named entity occurrence with sparse structured logistic regression, and consider the words (predictors) to be grouped based on background semantics. This sparse group LASSO approach forces the weights of word groups that do not influence the prediction towards zero. The resulting sparse structure is utilized for defining the type and strength of relations. Our unsupervised system yields a named entities’ network where each relation is typed, quantified, and characterized in context. These relations are the key to understanding news material over time and customizing newsfeeds for readers. Extensive evaluation of our system on articles from TIME magazine and BBC News shows that the learned relations correlate with static semantic relatedness measures like WLM, and capture the evolving relationships among named entities over time.
Are We Having Fun Yet? Misapplying Motivation to Gamification

The practice of gamification has seen a popularity surge in recent years. Despite this, the theoretical underpinnings of gamification remain poorly understood, which has led to numerous failures and criticisms of the process. Self-Determination Theory (SDT) has emerged as the most popular approach for explaining the motivational aspects of gamification, yet many applications use incorrect or specious interpretations of the theory. This may lead to incorrect results about the psychology underlying gamification, or worse still, negatively affect the mental wellbeing of the end-users of gamified systems. This paper summarises the main findings of SDT as they apply to gamification, highlights previous misapplications of SDT in the field, and presents directions for future research. The purpose of this paper is to highlight flaws in current gamification practice, so that they may be rectified and thereby create a more sound foundation for gamification research.
Optimal Design of the Electrical Layout of an Offshore Wind Farm Applying Decomposition Strategies

Electrical layout design is a key element in offshore wind farm planning, with a critical impact on both plant cost and reliability. Offshore Windfarm Layout optimizer (OWL) has been developed to efficiently find optimal electrical layouts in affordable computation times. The tool includes the possibility of HVDC connection and incorporates an approximation of losses, as well as stochasticity in wind inputs and component failures. OWL has been applied to several case studies including Barrow Offshore Wind Farm. OWL produces a significant cost reduction over the actually implemented design, with total realizable savings of EUR 800 k. The optimal layout includes redundant elements and deviates from a symmetrical pattern, therefore showing that a full optimization of the layout, rather than the selection of a pre-defined configuration, is necessary in order to fully capture efficiencies. The model relies on MIP and exploits the structure of the problem via decomposition strategies. Two different approaches have been developed, both resulting in substantial time savings. Benders' decomposition has been further improved by the addition of partially relaxed cuts and the application of scenario aggregation techniques. In addition, the Progressive Contingency Incorporation algorithm proposed by the authors is applied. Computation time savings reach two orders of magnitude.
Development of track-changeable quadruped walking robot TITAN X-design of leg driving mechanism and basic experiment-

We propose track-changeable quadruped walking robot, named “TITAN X”. TITAN X is a new leg-track hybrid mobile robot with a special leg driving system on each leg. A belt on each leg changes to a timing-belt in leg form and a track-belt in track form. TITAN X walks in leg form on rough terrain and makes tracked locomotion using track-belt on level or comparatively low-rough terrain. The characteristics of TITAN X are: 1) it has a hybrid function but is lightweight, 2) it has potential capabilities to demonstrate high-performance on highly-rough terrain. In this paper, details of leg design using a special belt are reported. Also form changing mechanisms are integrated into the system. We have constructed prototype of TITAN X to demonstrate basic performance. Experiments were conducted to verify the validity of the concept of track-changeable walking robot.
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions

We construct a general-purpose multi-input functional encryption scheme in the private-key setting. Namely, we construct a scheme where a functional key corresponding to a function f enables a user holding encryptions of $$x_1, \ldots , x_t$$ x1,…,xt to compute $$f(x_1, \ldots , x_t)$$ f(x1,…,xt) but nothing else. This is achieved starting from any general-purpose private-key single-input scheme (without any additional assumptions) and is proven to be adaptively secure for any constant number of inputs t. Moreover, it can be extended to a super-constant number of inputs assuming that the underlying single-input scheme is sub-exponentially secure. Instantiating our construction with existing single-input schemes, we obtain multi-input schemes that are based on a variety of assumptions (such as indistinguishability obfuscation, multilinear maps, learning with errors, and even one-way functions), offering various trade-offs between security assumptions and functionality. Previous and concurrent constructions of multi-input functional encryption schemes either rely on stronger assumptions and provided weaker security guarantees (Goldwasser et al. in Advances in cryptology—EUROCRYPT, 2014; Ananth and Jain in Advances in cryptology—CRYPTO, 2015), or relied on multilinear maps and could be proven secure only in an idealized generic model (Boneh et al. in Advances in cryptology—EUROCRYPT, 2015). In comparison, we present a general transformation that simultaneously relies on weaker assumptions and guarantees stronger security.
Consensus molecular subtypes and the evolution of precision medicine in colorectal cancer

Consensus molecular subtypes and the evolution of precision medicine in colorectal cancer Rodrigo Dienstmann, Louis Vermeulen, Justin Guinney, Scott Kopetz, Sabine Tejpar and Josep Tabernero Nature Reviews Cancer 17, 79–92 (2017) In this article a source of grant funding for one of the authors was omitted from the Acknowledgements section. The online version of the article has been corrected to include: “The work of R.D. was supported by the Grant for Oncology Innovation under the project ‘Next generation of clinical trials with matched targeted therapies in colorectal cancer’”. C O R R E C T I O N
Is there a safe plateau pressure in ARDS? The right heart only knows

Airway pressure limitation is now a largely accepted strategy in adult respiratory distress syndrome (ARDS) patients; however, some debate persists about the exact level of plateau pressure which can be safely used. The objective of the present study was to examine if the echocardiographic evaluation of right ventricular function performed in ARDS may help to answer to this question. For more than 20 years, we have regularly monitored right ventricular function by echocardiography in ARDS patients, during two different periods, a first (1980–1992) where airway pressure was not limited, and a second (1993–2006) where airway pressure was limited. By pooling our data, we can observe the effect of a large range of plateau pressure upon mortality rate and incidence of acute cor pulmonale. In this whole group of 352 ARDS patients, mortality rate and incidence of cor pulmonale were 80 and 56%, respectively, when plateau pressure was > 35 cmH2O; 42 and 32%, respectively, when plateau pressure was between 27 and 35 cmH2O; and 30 and 13%, respectively, when plateau pressure was < 27 cmH2O. Moreover, a clear interaction between plateau pressure and cor pulmonale was evidenced: whereas the odd ratio of dying for an increase in plateau pressure from 18–26 to 27–35 cm H2O in patients without cor pulmonale was 1.05 (p = 0.635), it was 3.32 in patients with cor pulmonale (p < 0.034). We hypothesize that monitoring of right ventricular function by echocardiography at bedside might help to control the safety of plateau pressure used in ARDS.
GPI transamidase and GPI anchored proteins: oncogenes and biomarkers for cancer.

Cancer is second only to heart disease as a cause of death in the US, with a further negative economic impact on society. Over the past decade, details have emerged which suggest that different glycosylphosphatidylinositol (GPI)-anchored proteins are fundamentally involved in a range of cancers. This post-translational glycolipid modification is introduced into proteins via the action of the enzyme GPI transamidase (GPI-T). In 2004, PIG-U, one of the subunits of GPI-T, was identified as an oncogene in bladder cancer, offering a direct connection between GPI-T and cancer. GPI-T is a membrane-bound, multi-subunit enzyme that is poorly understood, due to its structural complexity and membrane solubility. This review is divided into three sections. First, we describe our current understanding of GPI-T, including what is known about each subunit and their roles in the GPI-T reaction. Next, we review the literature connecting GPI-T to different cancers with an emphasis on the variations in GPI-T subunit over-expression. Finally, we discuss some of the GPI-anchored proteins known to be involved in cancer onset and progression and that serve as potential biomarkers for disease-selective therapies. Given that functions for only one of GPI-T's subunits have been robustly assigned, the separation between healthy and malignant GPI-T activity is poorly defined.
Extracorporeal septoplasty for the markedly deviated septum.

To describe a technique of extracorporeal septal reconstruction to correct the markedly deviated nasal septum.



Retrospective medical chart review of 2119 patients undergoing extracorporeal septoplasty from January 1, 1981, through July 31, 2004, by the author in a tertiary care facial plastic surgery center. The main outcomes measured included surgical complications, revision rate, and the surgeon's subjective determination of functional and aesthetic outcomes.



Of the 2119 patients, 2 cohorts were available for review. From January 1, 1981, to July 31, 1987, the author performed the operation on 459 patients. Fifty-seven complications (12%) occurred, with irregular contour of the dorsum or saddling noted in 38 (8%). Twenty patients (4%) elected to have revision septoplasty. From January 1, 1996, to December 31, 1996, the author supervised residents performing extracorporeal septoplasty in 108 patients. Fourteen postoperative complications (13%) occurred, with dorsal irregularity noted in 12 (11%). Eight patients (7%) elected to have revision septoplasty.



Extracorporeal septal reconstruction is an important surgical option for the correction of the markedly deviated nasal septum. Fixation of the straightened and replanted septum at the nasal spine and dorsal septum border with the upper lateral cartilages is essential. Spreader grafts for stabilization of the internal nasal valve and dorsal onlay grafts to prevent dorsal irregularity are strongly encouraged.
Cobalt-salen complex-catalyzed oxidative generation of alkyl radicals from aldehydes for the preparation of hydroperoxides.

Catalytic generation of alkyl radicals from aldehydes via oxidative deformylation was realized using a cobalt-salen complex with H2O2. The deformylation was thought to proceed through homolytic cleavage of peroxohemiacetal intermediates to provide even primary alkyl radicals under mild conditions. Variously substituted and functionalized hydroperoxides were obtained from corresponding aldehydes in good yield.
SERDES technology for gigabit I/O communications in storage area networking

The paper reviews SERDES technology for storage area networking. A concept of a data switch is introduced to illustrate important role played by switching and backplane SERDES ICs. Selected state-of-the-art devices: 10 Gb/s line side SERDES and backplane drivers are discussed in detail. Particular emphasis is placed on challenges associated with design of high-speed mixed-signal circuitry.
Dialog context language modeling with recurrent neural networks

In this work, we propose contextual language models that incorporate dialog level discourse information into language modeling. Previous works on contextual language model treat preceding utterances as a sequence of inputs, without considering dialog interactions. We design recurrent neural network (RNN) based contextual language models that specially track the interactions between speakers in a dialog. Experiment results on Switchboard Dialog Act Corpus show that the proposed model outperforms conventional single turn based RNN language model by 3.3% on perplexity. The proposed models also demonstrate advantageous performance over other competitive contextual language models.
Representation Properties of Networks: Kolmogorov's Theorem Is Irrelevant

Many neural networks can be regarded as attempting to approximate a multivariate function in terms of one-input one-output units. This note considers the problem of an exact representation of nonlinear mappings in terms of simpler functions of fewer variables. We review Kolmogorov's theorem on the representation of functions of several variables in terms of functions of one variable and show that it is irrelevant in the context of networks for learning.
SPDF: A schedulable parametric data-flow MoC

Dataflow programming models are suitable to express multi-core streaming applications. The design of high-quality embedded systems in that context requires static analysis to ensure the liveness and bounded memory of the application. However, many streaming applications have a dynamic behavior. The previously proposed dataflow models for dynamic applications do not provide any static guarantees or only in exchange of significant restrictions in expressive power or automation. To overcome these restrictions, we propose the schedulable parametric dataflow (SPDF) model. We present static analyses and a quasi-static scheduling algorithm. We demonstrate our approach using a video decoder case study.
Quaternary Logic Lookup Table in Standard CMOS

Interconnections are increasingly the dominant contributor to delay, area and energy consumption in CMOS digital circuits. Multiple-valued logic can decrease the average power required for level transitions and reduces the number of required interconnections, hence also reducing the impact of interconnections on overall energy consumption. In this paper, we propose a quaternary lookup table (LUT) structure, designed to replace or complement binary LUTs in field programmable gate arrays. The circuit is compatible with standard CMOS processes, with a single voltage supply and employing only simple voltagemode structures. A clock boosting technique is used to optimize the switches resistance and power consumption. The proposed implementation overcomes several limitations found in previous quaternary implementations published so far, such as the need for special features in the CMOS process or power-hungry current-mode cells. We present a full adder prototype based on the designed LUT, fabricated in a standard 130-nm CMOS technology, able to work at 100 MHz while consuming 122 μW. The experimental results demonstrate the correct quaternary operation and confirm the power efficiency of the proposed design.
OOPIC simulation of a cylindrical magnetron glow discharge

An Object Oriented Particle-in-Cell model of a plasma glow discharge in a cylindrical magnetron cleaning device has been developed to provide guidance in developing a novel in situ surface conditioning technique. The model tracks the trajectories of particles by solving the equations of motion and the electrostatic field equations. Simulation results are compared to experimental measurements obtained from a plasma probe at various axial positions along the substrate surface.
Arc Length Parameterization of Spline Curves

It is often desirable to evaluate parametric spline curves at points based on their arc-length instead of the curveÕs original parameter. Techniques are presented here for computing a reparameterization curve allowing approximate arc-length evaluation. This reparameterization curve is also expressed as a spline, allowing rapid evaluation as a function of arc-length. Using composition methods developed by DeRose et. al, the original curve and its reparameterization curve may be composed into a single, higher order curve that exhibits approximate arclength parameterization.
Creating Rapport with Virtual Agents

Recent research has established the potential for virtual characters to establish rapport with humans through simple contingent nonverbal behaviors. We hypothesized that the contingency, not just the frequency of positive feedback is crucial when it comes to creating rapport. The primary goal in this study was evaluative: can an agent generate behavior that engenders feelings of rapport in human speakers and how does this compare to human generated feedback? A secondary goal was to answer the question: Is contingency (as opposed to frequency) of agent feedback crucial when it comes to creating feelings of rapport? Results suggest that contingency matters when it comes to creating rapport and that agent generated behavior was as good as human listeners in creating rapport. A “virtual human listener” condition performed worse than other conditions.
On blockchain security and relevant attacks

The blockchain technology witnessed a wide adop­tion and a swift growth in recent years. This ingenious distributed peer-to-peer design attracted several businesses and solicited several communities beyond the financial market. There are also multiple use cases built around its ecosystem. However, this backbone introduced a lot of speculation and has been criticized by several researchers. Moreover, the lack of legislations perceived a lot of attention. In this paper, we are concerned in analyzing blockchain networks and their development, focusing on their security challenges. We took a holistic approach to cover the involved mechanisms and the limitations of Bitcoin, Ethereum and Hyperledger networks. We expose also numerous possible attacks and assess some countermeasures to dissuade vulnerabilities on the network. For occasion, we simulated the majority and the re-entrancy attacks. The purpose of this paper is to evaluate Blockchain security summarizing its current state. Thoroughly showing threatening flaws, we are not concerned with favoring any particular blockchain network.
Linear work suffix array construction

Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space efficiency while theoreticians use suffix trees due to linear-time construction algorithms and more explicit structure. We narrow this gap between theory and practice with a simple linear-time construction algorithm for suffix arrays. The simplicity is demonstrated with a C++ implementation of 50 effective lines of code. The algorithm is called DC3, which stems from the central underlying concept of difference cover. This view leads to a generalized algorithm, DC, that allows a space-efficient implementation and, moreover, supports the choice of a space--time tradeoff. For any v ∈ [1,&nradic;], it runs in O(vn) time using O(n/&vradic;) space in addition to the input string and the suffix array. We also present variants of the algorithm for several parallel and hierarchical memory models of computation. The algorithms for BSP and EREW-PRAM models are asymptotically faster than all previous suffix tree or array construction algorithms.