nils-herrmann/clean_scirepeval huggingface dataset:
Learning Non-Stationary Dynamic Bayesian Networks

Learning dynamic Bayesian network structures provides a pr inci led mechanism for identifying conditional dependencies in time-series data. An importan t assumption of traditional DBN structure learning is that the data are generated by a stationary p rocess, an assumption that is not true in many important settings. In this paper, we introduce a new cl ass of graphical model called a nonstationary dynamic Bayesian network, in which the conditio nal dependence structure of the underlying data-generation process is permitted to change over t im . Non-stationary dynamic Bayesian networks represent a new framework for studying problems in which the structure of a network is evolving over time. Some examples of evolving networks are t ranscriptional regulatory networks during an organism’s development, neural pathways during l earning, and traffic patterns during the day. We define the non-stationary DBN model, present an MCMC s ampling algorithm for learning the structure of the model from time-series data under diffe rent assumptions, and demonstrate the effectiveness of the algorithm on both simulated and biolog ical data.
What does it take to generate natural textures

Natural image generation is currently one of the most actively explored fields in Deep Learning. Many approaches, e.g. for state-of-the-art artistic style transfer or natural texture synthesis, rely on the statistics of hierarchical representations in supervisedly trained deep neural networks. It is, however, unclear what aspects of this feature representation are crucial for natural image generation: is it the depth, the pooling or the training of the features on natural images? We here address this question for the task of natural texture synthesis and show that none of the above aspects are indispensable. Instead, we demonstrate that natural textures of high perceptual quality can be generated from networks with only a single layer, no pooling and random filters.
Millimeter-Wave MultiBeam Aperture-Coupled Magnetoelectric Dipole Array With Planar Substrate Integrated Beamforming Network for 5G Applications

A modified topology of the 2-D multibeam antenna array fed by a passive beamforming network (BFN) is proposed by introducing two sets of vertical interconnections into the conventional array configuration. Different from the traditional design, the new array structure can be integrated into multilayered planar substrates conveniently, which has advantages of low loss characteristics, ease of realization, and low fabrication cost for millimeter-wave (mmWave) applications.  As the crucial components of the design, two kinds of aperture-coupled magnetoelectric dipole antenna elements with multilayered feed structures and three types of vertical interconnections consisting of the vertical substrate integrated waveguides are investigated, respectively. Wide bandwidth of 16.4%, stable radiation beams, and gain up to 14.7 dBi are achieved by the fabricated prototype. The proposed array configuration provides a new mean to implement the relatively large size 2-D multibeam antenna arrays with planar passive BFNs, which would be attractive for future mmWave wireless systems used for 5G communications and other applications.
Sanity Check: A Strong Alignment and Information Retrieval Baseline for Question Answering

While increasingly complex approaches to question answering (QA) have been proposed, the true gain of these systems, particularly with respect to their expensive training requirements, can be in- flated when they are not compared to adequate baselines. Here we propose an unsupervised, simple, and fast alignment and informa- tion retrieval baseline that incorporates two novel contributions: a one-to-many alignment between query and document terms and negative alignment as a proxy for discriminative information. Our approach not only outperforms all conventional baselines as well as many supervised recurrent neural networks, but also approaches the state of the art for supervised systems on three QA datasets. With only three hyperparameters, we achieve 47% P@1 on an 8th grade Science QA dataset, 32.9% P@1 on a Yahoo! answers QA dataset and 64% MAP on WikiQA.
Buck-boost converter fed BLDC motor drive for solar PV array based water pumping

Solar photovoltaic (SPV) array based water pumping is receiving wide attention now a days because the everlasting solar energy is the best alternative to the conventional energy sources. This paper deals with the utilization of a buck-boost converter in solar PV array based water pumping as an intermediate DC-DC converter between a solar PV array and a voltage source inverter (VSI) in order to achieve the maximum efficiency of the solar PV array and the soft starting of the permanent magnet brushless DC (BLDC) motor by proper control. Consisting of a least number of components and single switch, the buck-boost converter exhibits very good conversion efficiency. Moreover, buck-boost DC-DC converter topology is the only one allowing follow-up of the PV array maximum power point (MPP) regardless of temperature, irradiance, and connected load. A BLDC motor is employed to drive a centrifugal type of water pump because its load characteristic is well matched to the maximum power locus of the PV generator. The transient, dynamic and steady state behaviors of the proposed solar PV array powered buck-boost converter fed BLDC motor driven water pumping system are evaluated under the rapid and slowly varying atmospheric conditions using the sim-power-system toolboxes of the MATLAB/Simulink environment.
Mesh Location in Open Ventral Hernia Repair: A Systematic Review and Network Meta-analysis

There is no consensus on the ideal location for mesh placement in open ventral hernia repair (OVHR). We aim to identify the mesh location associated with the lowest rate of recurrence following OVHR using a systematic review and meta-analysis. A search was performed for studies comparing at least two of four locations for mesh placement during OVHR (onlay, inlay, sublay, and underlay). Outcomes assessed were hernia recurrence and surgical site infection (SSI). Pairwise meta-analysis was performed to compare all direct treatment of mesh locations. A multiple treatment meta-analysis was performed to compare all mesh locations in the Bayesian framework. Sensitivity analyses were planned for the following: studies with a low risk of bias, incisional hernias, by hernia size, and by mesh type (synthetic or biologic). Twenty-one studies were identified (n = 5,891). Sublay placement of mesh was associated with the lowest risk for recurrence [OR 0.218 (95 % CI 0.06–0.47)] and was the best of the four treatment modalities assessed [Prob (best) = 94.2 %]. Sublay was also associated with the lowest risk for SSI [OR 0.449 (95 % CI 0.12–1.16)] and was the best of the 4 treatment modalities assessed [Prob (best) = 77.3 %]. When only assessing studies at low risk of bias, of incisional hernias, and using synthetic mesh, the probability that sublay had the lowest rate of recurrence and SSI was high. Sublay mesh location has lower complication rates than other mesh locations. While additional randomized controlled trials are needed to validate these findings, this network meta-analysis suggests the probability of sublay being the best location for mesh placement is high.
Real-Time Physics-Based 3D Biped Character Animation Using an Inverted Pendulum Model

We present a physics-based approach to generate 3D biped character animation that can react to dynamical environments in real time. Our approach utilizes an inverted pendulum model to online adjust the desired motion trajectory from the input motion capture data. This online adjustment produces a physically plausible motion trajectory adapted to dynamic environments, which is then used as the desired motion for the motion controllers to track in dynamics simulation. Rather than using Proportional-Derivative controllers whose parameters usually cannot be easily set, our motion tracking adopts a velocity-driven method which computes joint torques based on the desired joint angular velocities. Physically correct full-body motion of the 3D character is computed in dynamics simulation using the computed torques and dynamical model of the character. Our experiments demonstrate that tracking motion capture data with real-time response animation can be achieved easily. In addition, physically plausible motion style editing, automatic motion transition, and motion adaptation to different limb sizes can also be generated without difficulty.
Cuff-less and Noninvasive Measurements of Arterial Blood Pressure by Pulse Transit Time

The current blood pressure (BP) measurement devices are mostly built on the principle of auscultation, oscillometry or tonometry, all of which use an inflatable cuff to occlude or unload the artery. The need of a cuff in these devices limits the further reduction in size and power consumption, and restricts the frequency and ease of their usage. Therefore, this study aims to develop a cuff-less and noninvasive technique for measuring BP by pulse transit time. The technique was evaluated on 85 subjects, aged 57plusmn29 yrs., including 36 males and 39 hypertensives, over an average period of 6.4 wks. A total of 999 pairs of systolic BP (SBP) and diastolic BP (DBP) estimations were made. The average of BP readings reported by an experienced registered nurse and those obtained from a clinically approved automatic BP meter was used as reference. It is found that the estimated SBP and DBP differed from the reference BP by 0.6plusmn9.8 mmHg and 0.9plusmn5.6 mmHg respectively. When compared to the AAMI requirement (5plusmn8 mmHg for both SBP and DBP estimation), the results suggest that the cuff-less technology has great potential to be developed into wearable devices that are useful in self BP monitoring for home healthcare and eventually in clinical diagnosis
Modular Construction of Time-Delay Neural Networks for Speech Recognition

Several strategies are described that overcome limitations of basic network models as steps towards the design of large connectionist speech recognition systems. The two major areas of concern are the problem of time and the problem of scaling. Speech signals continuously vary over time and encode and transmit enormous amounts of human knowledge. To decode these signals, neural networks must be able to use appropriate representations of time and it must be possible to extend these nets to almost arbitrary sizes and complexity within finite resources. The problem of time is addressed by the development of a Time-Delay Neural Network; the problem of scaling by Modularity and Incremental Design of large nets based on smaller subcomponent nets. It is shown that small networks trained to perform limited tasks develop time invariant, hidden abstractions that can subsequently be exploited to train larger, more complex nets efficiently. Using these techniques, phoneme recognition networks of increasing complexity can be constructed that all achieve superior recognition performance.
A visitor's guide in an active museum: Presentations, communications, and reflection

Technology can play a crucial role in supporting museum visitors and enhancing their overall museum visit experiences. Visitors coming to a museum do not want to be overloaded with information, but to receive the relevant information, learn, and have an overall interesting experience. To serve this goal, a user-friendly and flexible system is needed. The design of such a system poses several challenges that need to be addressed in parallel. The user interface should be intuitive and let the visitors focus on the exhibits, not on the technology. Content and delivery must provide relevant information and at the same time allow visitors to get the level of detail and the perspectives in which they are interested. Personalization may play a key role in providing relevant information to individuals. Yet, since visitors tend to visit the museum in small groups, technology should also contribute to and facilitate during-the-visit communication or post-visit group interaction. The PIL project applied at the Hecht museum extended the research results of the PEACH project and tried to address all of these considerations. Evaluation involving users substantiated several aspects of the design.
Learning from examples to improve code completion systems

The suggestions made by current IDE's code completion features are based exclusively on static type system of the programming language. As a result, often proposals are made which are irrelevant for a particular working context. Also, these suggestions are ordered alphabetically rather than by their relevance in a particular context. In this paper, we present intelligent code completion systems that learn from existing code repositories. We have implemented three such systems, each using the information contained in repositories in a different way. We perform a large-scale quantitative evaluation of these systems, integrate the best performing one into Eclipse, and evaluate the latter also by a user study. Our experiments give evidence that intelligent code completion systems which learn from examples significantly outperform mainstream code completion systems in terms of the relevance of their suggestions and thus have the potential to enhance developers' productivity.
A New Isolation Technique for Reverse Blocking IGBT with Ion Implantation and Laser Annealing to Tapered Chip Edge Sidewalls

This paper presents a new isolation technique for high breakdown voltage RB-IGBT, whose termination area is extremely small in comparison with conventional isolation technique with thermal diffusion. The p+ isolation layer for the reverse blocking capability was successively fabricated with negligible thermal budget by means of ion implantation and laser annealing to the chip edges. Sufficient blocking capability over 1200V was demonstrated with the new method
Detecting Review Spammer Groups via Bipartite Graph Projection

Online product reviews play an important role in E-commerce websites because most customers read and rely on them when making purchases. For the sake of profit or reputation, review spammers deliberately write fake reviews to promote or demote target products, some even fraudulently work in groups to try and control the sentiment about a product. To detect such spammer groups, previous work exploits frequent itemset mining (FIM) to generate candidate spammer groups, which can only find tightly coupled groups, i.e. each reviewer in the group reviews every target product. In this paper, we present the loose spammer group detection problem, i.e. each group member is not required to review every target product. We solve this problem using bipartite graph projection. We propose a set of group spam indicators to measure the spamicity of a loose spammer group, and design a novel algorithm to identify highly suspicious loose spammer groups in a divide and conquer manner. Experimental results show that our method not only can find loose spammer groups with high precision and recall, but also can generate more meaningful candidate spammer groups than FIM, thus it can also be used as an alternative preprocessing tool for existing FIM-based approaches.
Automated extractive single-document summarization: beating the baselines with a new approach

Single document summarization, which is as important as multiple document summarization for a variety of reasons, has been attracting declining interest recently. The goal of this study is to introduce a new approach to single document summarization and its implementation, SynSem. Our approach fuses syntactic, semantic, and statistical methodologies and reflects the importance of text headings in articles along with the presence of thematic keywords in sentences. Successful summary evaluation results are demonstrated when SynSem is tested on the Document Understanding Conference (DUC) 2002 data set using ROUGE, which compares single document summaries to baselines.
Churn Prediction

The rapid growth of the market in every sector is leading to a bigger subscriber base for service providers. More competitors, new and innovative business models and better services are increasing the cost of customer acquisition. In this environment service providers have realized the importance of the retention of existing customers. Therefore, providers are forced to put more efforts for prediction and prevention of churn. This paper aims to present commonly used data mining techniques for the identification of churn. Based on historical data these methods try to find patterns which can point out possible churners. Well-known techniques used for this are Regression analysis, Decision Trees, Neural Networks and Rule based learning. In section 1 we give a short introduction describing the current state of the market, then in section 2 a definition of customer churn, its’ types and the imporance of identification of churners is being discussed. Section 3 reviews different techniques used, pointing out advantages and disadvantages. Finally, current state of research and new emerging algorithms are being presented.
Polarization Reconfigurable U-Slot Patch Antenna

A compact U-slot microstrip patch antenna with reconfigurable polarization is proposed for wireless local area network (WLAN) applications. PIN diodes are appropriately positioned to change the length of the U-slot arms, which alters the antenna's polarization state. Two antenna prototypes with identical dimensions are designed, fabricated and measured. The first antenna prototype enables switching between linear and circular polarization by using a PIN diode and a capacitor located on the U-slot. The second antenna prototype uses two PIN diodes to switch between the two circular polarization senses. A good impedance match (S11 ≤-10 dB) for both linear and circular polarization is achieved from 5.725 to 5.85 GHz, a band typically used for WLAN applications, and the 3 dB axial ratio bandwidth is greater than 2.8%. Details of the simulated and measured reflection coefficient, axial ratio, gain and radiation patterns are presented.
Cathodic protection by zinc sacrificial anodes: impact on marine sediment metallic contamination.

Cathodic protection by sacrificial zinc anodes is often applied to prevent immerged metallic structures from corrosion. But this technique induces the zinc anodes dissolution, which can induce marine sediments and seawater contamination. A large scale experiment, in natural seawater, was conducted during 12 months, in order to evaluate the potential environmental impact of this continuous zinc dissolution, and of some necessary cleaning operations of the anodes surfaces. The heavy metal (Cr, Cu, Pb and Zn) concentration in water and sediment samples was monitored. A sequential extraction procedure was applied on sediment samples to differentiate the zinc mobile fractions from the residual one. A significant increase of zinc concentration was observed in water as well as in the surface sediments under the specific operating conditions. Sediments then become a secondary pollution source, as the sorbed labile zinc can be remobilized to seawater.
MR-DBSCAN: a scalable MapReduce-based DBSCAN algorithm for heavily skewed data

DBSCAN (density-based spatial clustering of applications with noise) is an important spatial clustering technique that is widely adopted in numerous applications. As the size of datasets is extremely large nowadays, parallel processing of complex data analysis such as DBSCAN becomes indispensable. However, there are three major drawbacks in the existing parallel DBSCAN algorithms. First, they fail to properly balance the load among parallel tasks, especially when data are heavily skewed. Second, the scalability of these algorithms is limited because not all the critical sub-procedures are parallelized. Third, most of them are not primarily designed for shared-nothing environments, which makes them less portable to emerging parallel processing paradigms. In this paper, we present MR-DBSCAN, a scalable DBSCAN algorithm using MapReduce. In our algorithm, all the critical sub-procedures are fully parallelized. As such, there is no performance bottleneck caused by sequential processing. Most importantly, we propose a novel data partitioning method based on computation cost estimation. The objective is to achieve desirable load balancing even in the context of heavily skewed data. Besides, We conduct our evaluation using real large datasets with up to 1.2 billion points. The experiment results well confirm the efficiency and scalability of MR-DBSCAN.
Multi Objective Segmentation for Vehicle License Plate Detection with Immune-based Classifier: A General Framework

Vehicle License Plate Recognition (VLPR) is an important system for harmonious traffic. Moreover this system is helpful in many fields and places as private and public entrances, parking lots, border control and theft control. This paper presents a new framework for Sudanese VLPR system. The proposed framework uses Multi Objective Particle Swarm Optimization (MOPSO) and Connected Component Analysis (CCA) to extract the license plate. Horizontal and vertical projection will be used for character segmentation and the final recognition stage is based on the Artificial Immune System (AIS). A new dataset that contains samples for the current shape of Sudanese license plates will be used for training and testing the proposes framework.
An Empirical Comparison of PDDL-based and ASP-based Task Planners

General purpose planners enable AI systems to solve many different types of planning problems. However, many different planners exist, each with different strengths and weaknesses, and there are no general rules for which planner would be best to apply to a given problem. In this paper, we empirically compare the performance of state-of-the-art planners that use either the Planning Domain Description Language (PDDL), or Answer Set Programming (ASP) as the underlying action language. PDDL is designed for automated planning, and PDDL-based planners are widely used for a variety of planning problems. ASP is designed for knowledge-intensive reasoning, but can also be used for solving planning problems. Given domain encodings that are as similar as possible, we find that PDDL-based planners perform better on problems with longer solutions, and ASP-based planners are better on tasks with a large number of objects or in which complex reasoning is required to reason about action preconditions and effects. The resulting analysis can inform selection among general purpose planning systems for a particular domain.