nils-herrmann/clean_scirepeval huggingface dataset:
Query-Based Data Pricing

Data is increasingly being bought and sold online, and Web-based marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are very simple: buyers can choose only from a set of explicit views, each with a specific price. In this article, we propose a framework for pricing data on the Internet that, given the price of a few views, allows the price of any query to be derived automatically. We call this capability query-based pricing. We first identify two important properties that the pricing function must satisfy, the arbitrage-free and discount-free properties. Then, we prove that there exists a unique function that satisfies these properties and extends the seller's explicit prices to all queries. Central to our framework is the notion of query determinacy, and in particular instance-based determinacy: we present several results regarding the complexity and properties of it.
 When both the views and the query are unions of conjunctive queries or conjunctive queries, we show that the complexity of computing the price is high. To ensure tractability, we restrict the explicit prices to be defined only on selection views (which is the common practice today). We give algorithms with polynomial time data complexity for computing the price of two classes of queries: chain queries (by reducing the problem to network flow), and cyclic queries. Furthermore, we completely characterize the class of conjunctive queries without self-joins that have PTIME data complexity, and prove that pricing all other queries is NP-complete, thus establishing a dichotomy on the complexity of the pricing problem when all views are selection queries.
Pre-service Teachers’ Perceived Ease of Use, Perceived Usefulness, Attitude and Intentions Towards Virtual Laboratory Package Utilization in Teaching and Learning of Physics

This study was carried out to investigate pre-service teachers’ perceived ease of use, perceived usefulness, attitude and intentions towards the utilization of virtual laboratory package in teaching and learning of Nigerian secondary school physics concepts. Descriptive survey research was employed and 66 fourth and fifth year Physics education students were purposively used as research sample. Four research questions guided the study and a 16-item questionnaire was used as instrument for data collection. The questionnaire was validated by educational technology experts, physics expert and guidance and counselling experts. Pilot study was carried out on year three physics education students and a reliability coefficients ranging from 0.76 to 0.89 was obtained for each of the four sections of the questionnaire. Data collected from the administration of the research instruments were analyzed using descriptive statistics of Mean and Standard Deviation. A decision rule was set, in which, a mean score of 2.50 and above was considered Agreed while a mean score below 2.50 was considered Disagreed. Findings revealed that pre-service physics teachers perceived the virtual laboratory package easy to use and useful with mean scores of 3.18 and 3.34 respectively. Also, respondents’ attitude and intentions to use the package in teaching and learning of physics were positive with mean scores of 3.21 and 3.37 respectively. Based on these findings, it was recommended among others that administrators should equip schools with adequate Information and Communication Technology facilities that would aid students and teachers’ utilization of virtual-based learning environments in teaching and learning process.
The design and function of birds' nests

All birds construct nests in which to lay eggs and/or raise offspring. Traditionally, it was thought that natural selection and the requirement to minimize the risk of predation determined the design of completed nests. However, it is becoming increasingly apparent that sexual selection also influences nest design. This is an important development as while species such as bowerbirds build structures that are extended phenotypic signals whose sole purpose is to attract a mate, nests contain eggs and/or offspring, thereby suggesting a direct trade-off between the conflicting requirements of natural and sexual selection. Nest design also varies adaptively in order to both minimize the detrimental effects of parasites and to create a suitable microclimate for parents and developing offspring in relation to predictable variation in environmental conditions. Our understanding of the design and function of birds' nests has increased considerably in recent years, and the evidence suggests that nests have four nonmutually exclusive functions. Consequently, we conclude that the design of birds' nests is far more sophisticated than previously realized and that nests are multifunctional structures that have important fitness consequences for the builder/s.
Collapsar: A VM-based honeyfarm and reverse honeyfarm architecture for network attack capture and detention

The honeypot has emerged as an effective tool to provide insights into new attacks and exploitation trends. However, a single honeypot or multiple independently operated honeypots only provide limited local views of network attacks. Coordinated deployment of honeypots in different network domains not only provides broader views, but also create opportunities of early network anomaly detection, attack correlation, and global network status inference. Unfortunately, coordinated honeypot operation require close collaboration and uniform security expertise across participating network domains. The conflict between distributed presence and uniform management poses a major challenge in honeypot deployment and operation. To address this challenge, we present Collapsar, a virtual machine-based architecture for network attack capture and detention. A Collapsar center hosts and manages a large number of high-interaction virtual honeypots in a local dedicated network. To attackers, these honeypots appear as real systems in their respective production networks. Decentralized logical presence of honeypots provides a wide diverse view of network attacks, while the centralized operation enables dedicated administration and convenient event correlation, eliminating the need for honeypot expertise in every production network domain. Collapsar realizes the traditional honeyfarm vision as well as our new reverse honeyfarm vision, where honeypots act as vulnerable clients exploited by real-world malicious servers. We present the design, implementation, and evaluation of a Collapsar prototype. Our experiments with a number of real-world attacks demonstrate the effectiveness and practicality of Collapsar.
The facial flow concept: An organic orofacial analysis-the vertical component.

Orofacial analysis has been used by dentists for many years. The process involves applying mathematical rules, geometric principles, and straight lines to create either parallel or perpendicular references based on the true horizon and/or natural head position. These reference lines guide treatment planning and smile design for restorative treatments to achieve harmony between the new smile and the face. The goal is to obtain harmony and not symmetry. Faces are asymmetrical entities and because of that cannot be analyzed using purely straight lines. In this article, a more natural, organic, and dynamic process of evaluation is presented to minimize errors and generate harmoniously balanced smiles instead of perfect, mathematical smiles.
PRODIGY: An Integrated Architecture for Planning and Learning

Artificial intelligence has progressed to the point where multiple cognitive capabilities are being integrated into computational architectures, such as SOAR, PRODIGY, THEO, and ICARUS. This paper reports on the PRODIGY architecture, describing its planning and problem solving capabilities and touching upon its multiple learning methods. Learning in PRODIGY occurs at all decision points and integration in PRODIGY is at the knowledge level; the learning and reasoning modules produce mutually interpretable knowledge structures. Issues in architectural design are discussed, providing a context to examine the underlying tenets of the PRODIGY architecture.
Production of Electricity from Acetate or Butyrate Using a Single-Chamber Microbial Fuel Cell

Hydrogen can be recovered by fermentation of organic material rich in carbohydrates, but much of the organic matter remains in the form of acetate and butyrate. An alternative to methane production from this organic matter is the direct generation of electricity in a microbial fuel cell (MFC). Electricity generation using a single-chambered MFC was examined using acetate or butyrate. Power generated with acetate (800 mg/L) (506 mW/m2 or 12.7 mW/ L) was up to 66% higher than that fed with butyrate (1000 mg/L) (305 mW/m2 or 7.6 mW/L), demonstrating that acetate is a preferred aqueous substrate for electricity generation in MFCs. Power output as a function of substrate concentration was well described by saturation kinetics, although maximum power densities varied with the circuit load. Maximum power densities and half-saturation constants were Pmax ) 661 mW/m2 and Ks ) 141 mg/L for acetate (218 Ω) and Pmax ) 349 mW/m2 and Ks ) 93 mg/L for butyrate (1000 Ω). Similar open circuit potentials were obtained in using acetate (798 mV) or butyrate (795 mV). Current densities measured for stable power output were higher for acetate (2.2 A/m2) than those measured in MFCs using butyrate (0.77 A/m2). Cyclic voltammograms suggested that the main mechanism of power production in these batch tests was by direct transfer of electrons to the electrode by bacteria growing on the electrode and not by bacteria-produced mediators. Coulombic efficiencies and overall energy recovery were 10-31 and 3-7% for acetate and 8-15 and 2-5% for butyrate, indicating substantial electron and energy losses to processes other than electricity generation. These results demonstrate that electricity generation is possible from soluble fermentation end products such as acetate and butyrate, but energy recoveries should be increased to improve the overall process performance.
Transcript assembly and abundance estimation from RNA-Seq reveals thousands of new transcripts and switching among isoforms

High-throughput mRNA sequencing (RNA-Seq) promises simultaneous transcript discovery and abundance estimation. However, this would require algorithms that are not restricted by prior gene annotations and that account for alternative transcription and splicing. Here we introduce such algorithms in an open-source software program called Cufflinks. To test Cufflinks, we sequenced and analyzed >430 million paired 75-bp RNA-Seq reads from a mouse myoblast cell line over a differentiation time series. We detected 13,692 known transcripts and 3,724 previously unannotated ones, 62% of which are supported by independent expression data or by homologous genes in other species. Over the time series, 330 genes showed complete switches in the dominant transcription start site (TSS) or splice isoform, and we observed more subtle shifts in 1,304 other genes. These results suggest that Cufflinks can illuminate the substantial regulatory flexibility and complexity in even this well-studied model of muscle development and that it can improve transcriptome-based genome annotation.
Intelligent traffic signal control system for ambulance using RFID and cloud

Road traffic congestion becomes a major issues for highly crowded metropolitan cities like, Chennai. Ambulance service is one of the major services which gets affected by traffic jams. To smoothen the ambulance movement this paper have come up with the solution of “Intelligent automatic traffic control for ambulance”. The proposed system creates a android app that connects both the ambulance and the traffic signal station using cloud network. This system makes uses RFID (radio frequency identification) technology to implement the Intelligent traffic signal control. The basic idea behind the proposed system is, if the Ambulance halts on the way due to a traffic signal, RFID installed at the traffic signal tracks the RFID tagged ambulance and sends the data to the cloud. After the acknowledgment for the user through the mobile app, the particular signal is made Green for some time and after the ambulance passes by, it regains its original flow of sequence of signaling If, this scheme is fully automated, it finds the ambulance spot, controls the traffic lights. This system control the traffic lights and save the time in emergency periods. Thus it acts as a life saver project.
The Surprise Examination or Unexpected Hanging Paradox

Many mathematicians have a dismissive attitude towards paradoxes. This is unfortunate, because many paradoxes are rich in content, having connections with serious mathematical ideas as well as having pedagogical value in teaching elementary logical reasoning. An excellent example is the so-called “surprise examination paradox” (described below), which is an argument that seems at first to be too silly to deserve much attention. However, it has inspired an amazing variety of philosophical and mathematical investigations that have in turn uncovered links to Gödel’s incompleteness theorems, game theory, and several other logical paradoxes (e.g., the liar paradox and the sorites paradox). Unfortunately, most mathematicians are unaware of this because most of the literature has been published in philosophy journals.
Ironies of automation

-This paper discusses the ways in which automation of industrial processes may expand rather than eliminate problems with the human operator. Some comments will be made on methods of alleviating these problems within the "classic' approach of leaving the operator with responsibility for abnormal conditions, and on the potential for continued use of the human operator for on-line decision-making within human-computer collaboration.  combination of circumstances, the result of which is the direct opposite of what might be expected. Paradox: seemingly absurd though perhaps really well-founded
Trust-PCL: An Off-Policy Trust Region Method for Continuous Control

Trust region methods, such as TRPO, are often used to stabilize policy optimization algorithms in reinforcement learning (RL). While current trust region strategies are effective for continuous control, they typically require a large amount of on-policy interaction with the environment. To address this problem, we propose an off-policy trust region method, Trust-PCL, which exploits an observation that the optimal policy and state values of a maximum reward objective with a relative-entropy regularizer satisfy a set of multi-step pathwise consistencies along any path. The introduction of relative entropy regularization allows Trust-PCL to maintain optimization stability while exploiting off-policy data to improve sample efficiency. When evaluated on a number of continuous control tasks, Trust-PCL significantly improves the solution quality and sample efficiency of TRPO.1
Microglia constitute a barrier that prevents neurotoxic protofibrillar Aβ42 hotspots around plaques

In Alzheimer's disease (AD), β-amyloid (Aβ) plaques are tightly enveloped by microglia processes, but the significance of this phenomenon is unknown. Here we show that microglia constitute a barrier with profound impact on plaque composition and toxicity. Using high-resolution confocal and in vivo two-photon imaging in AD mouse models, we demonstrate that this barrier prevents outward plaque expansion and leads to compact plaque microregions with low Aβ42 affinity. Areas uncovered by microglia are less compact but have high Aβ42 affinity, leading to the formation of protofibrillar Aβ42 hotspots that are associated with more severe axonal dystrophy. In ageing, microglia coverage is reduced leading to enlarged protofibrillar Aβ42 hotspots and more severe neuritic dystrophy. CX3CR1 gene deletion or anti-Aβ immunotherapy causes expansion of microglia coverage and reduced neuritic dystrophy. Failure of the microglia barrier and the accumulation of neurotoxic protofibrillar Aβ hotspots may constitute novel therapeutic and clinical imaging targets for AD.
On the Complexity of CCG Parsing

We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994). As our main result, we prove that any parsing algorithm for this formalism will take in the worst case exponential time when the size of the grammar, and not only the length of the input sentence, is included in the analysis. This sets the formalism of Vijay-Shanker andWeir (1994) apart from weakly equivalent formalisms such as Tree-Adjoining Grammar (TAG), for which parsing can be performed in time polynomial in the combined size of grammar and input sentence. Our results contribute to a refined understanding of the class of mildly context-sensitive grammars, and inform the search for new, mildly context-sensitive versions of CCG.
Complex analysis of movement in evaluation of flat bench press performance.

The complex methodology of investigations was applied to study a movement structure on bench press. We have checked the usefulness of multimodular measuring system (SMART-E, BTS company, Italy) and a special device for tracking the position of barbell (pantograph). Software Smart Analyser was used to create a database allowing chosen parameters to be compared. The results from different measuring devices are very similar, therefore the replacement of many devices by one multimodular system is reasonable. In our study, the effect of increased barbell load on the values of muscles activity and bar kinematics during the flat bench press movement was clearly visible. The greater the weight of a barbell, the greater the myoactivity of shoulder muscles and vertical velocity of the bar. It was also confirmed the presence of the so-called sticking point (period) during the concentric phase of the bench press. In this study, the initial velocity of the barbell decreased (v(min)) not only under submaximal and maximal loads (90 and 100% of the one repetition maximum; 1-RM), but also under slightly lighter weights (70 and 80% of 1-RM).
A Review of Game-Tree Pruning

Chess programs ha ve three major components: mo ve generation, search, and evaluation. All components are important, although e valuation with its quiescence analysis is the part which mak es each program’ s play unique. The speed of a chess program is a function of its mo ve generation cost, the comple xity of the position under study and the bre vity of its evaluation. Moreimportant, however, is the quality of the mechanisms used to discontinue (prune) search of unprofitable continuations. The most reliable pruning method in popular use is the rob ust alpha-beta algorithm, and its man y supporting aids. These essential parts of g ame-tree searching and pruning are reviewed here, and the performance of refinements, such as aspiration and principal variation search, and aids lik e transposition and history tables are compared. † Much of this article is a re vision of material condensed from an entry entitled ‘‘ Computer Chess Methods, ’’ p repared for theEncyclopedia of Artificial Intellig ence, S. Shapiro (editor), to be published by John W iley & Sons in 1987.The transposition table pseudo code of Figure 7 is similar to that in another paper: ‘ ‘Pa allel Search of Strongly Ordered Game T rees, ’’ T. A. Marsland and M. Campbell, ACM Computing Surveys, Vol 14, No. 4, cop yright 1982, Association for Computing Machinery Inc., and is reprinted by permission. Final draft: ICCA Journal, V ol. 9, No. 1, March 1986, pp. 3-19.
Analyzing the Subjective Interestingness of Association Rules

Association rules are a class of important regularities in databases. They are found to be very useful in practical applications. However, association rule mining algorithms tend to produce a huge number of rules, most of which are of no interest to the user. Due to the large number of rules, it is very diff icult for the user to analyze them manually in order to identify those truly interesting ones. In this paper, we propose a new approach to assist the user in finding interesting rules (in particular, unexpected rules) from a set of discovered association rules. This technique is characterized by analyzing the discovered association rules using the user’ s existing knowledge about the domain and then ranking the discovered rules according to various interestingness criteria, e.g., conformity and various types of unexpectedness. This technique has been implemented and successfully used in a number of applications.
Rhinitis sicca, dry nose and atrophic rhinitis: a review of the literature

Despite the fact that many people suffer from it, an unequivocal definition of dry nose (DN) is not available. Symptoms range from the purely subjective sensation of a rather dry nose to visible crusting of the (inner) nose (nasal mucosa), and a wide range of combinations are met with. Relevant diseases are termed rhinitis sicca anterior, primary and secondary rhinitis atrophicans, rhinitis atrophicans with foetor (ozena), and empty nose syndrome. The diagnosis is based mainly on the patient’s history, inspection of the external and inner nose, endoscopy of the nasal cavity (and paranasal sinuses) and the nasopharynx, with CT, allergy testing and microbiological swabs being performed where indicated. Treatment consists in the elimination of predisposing factors, moistening, removal of crusts, avoidance of injurious factors, care of the mucosa, treatment of infections and where applicable, correction of an over-large air space. Since the uncritical resection of the nasal turbinates is a significant and frequent factor in the genesis of dry nose, secondary RA and ENS, the inferior and middle turbinate should not be resected without adequate justification, and the simultaneous removal of both should not be done other than for a malignant condition. In this paper, we review both the aetiology and clinical presentation of the conditions associated with the symptom dry nose, and its conservative and surgical management.
5G: The Convergence of Wireless Communications

As the rollout of 4G mobile communication networks takes place, representatives of industry and academia have started to look into the technological developments toward the next generation (5G). Several research projects involving key international mobile network operators, infrastructure manufacturers, and academic institutions, have been launched recently to set the technological foundations of 5G. However, the architecture of future 5G systems, their performance, and mobile services to be provided have not been clearly defined. In this paper, we put forth the vision for 5G as the convergence of evolved versions of current cellular networks with other complementary radio access technologies. Therefore, 5G may not be a single radio access interface but rather a "network of networks". Evidently, the seamless integration of a variety of air interfaces, protocols, and frequency bands, requires paradigm shifts in the way networks cooperate and complement each other to deliver data rates of several Gigabits per second with end-to-end latency of a few milliseconds. We provide an overview of the key radio technologies that will play a key role in the realization of this vision for the next generation of mobile communication networks. We also introduce some of the research challenges that need to be addressed.