nils-herrmann/clean_scirepeval huggingface dataset:
Sliding mode control strategy for three-phase DVR employing twelve-switch voltage source converter

In this study, a new method is proposed for the suppression of voltage amplitude fluctuations on the load terminals. Moreover, the voltage harmonics on the load terminals are effectively reduced below the defined limits in the IEEE-519 standard. In the studied topology, a twelve-switch three-phase voltage source converter is used for effective control on the zero-sequence components due to the unbalanced voltages or single phase voltage sags. In order to obtain a fast dynamic response, sliding mode control strategy is used to control the system. The existence condition of the sliding mode is presented. The performance of the closed-loop system is verified with cases of voltage sag and utility voltage harmonics. The overall system is explained in detail and verified by using MATLAB/Simulink.
Limits to the diffusion of innovation A literature review and integrative model

The purpose of this article is to integrate existing theoretical explanations for innovation diffusion across the disciplines of marketing, innovation and sociology research.  Literature reviews and historical case analysis were used to support an integrative model.  Innovation diffusion is affected by technological, social and learning “conditions” while operating in the contextual “domain” of the individual, community or market/industry.  The model is drawn from new product development and marketing theory. Both fields are dominated by the assumption that users adopt new technology to maximise their utility. Also, the model does not integrate the overlapping effects of the different contexts and domains.  The article provides a sound model for orienting new product development strategy, since it may reduce the risk of low and slow user adoption of radical innovations due, for instance, to their technological, social, and cognitive differences with former products. A second critical managerial implication is that technological, social and learning conditions clearly have an effect on marketing actions and competitive strategies.  The article provides a literature review of resistance to technology adoption through a multidisciplinary lens.
A Study on Balancing Parallelism, Data Locality, and Recomputation in Existing PDE Solvers

Structured-grid PDE solver frameworks parallelize over boxes, which are rectangular domains of cells or faces in a structured grid. In the Chombo framework, the box sizes are typically 163 or 323, but larger box sizes such as 1283 would result in less surface area and therefore less storage, copying, and/or ghost cells communication overhead. Unfortunately, current on-node parallelization schemes perform poorly for these larger box sizes. In this paper, we investigate 30 different inter-loop optimization strategies and demonstrate the parallel scaling advantages of some of these variants on NUMA multicore nodes. Shifted, fused, and communication-avoiding variants for 1283 boxes result in close to ideal parallel scaling and come close to matching the performance of 163 boxes on three different multicore systems for a benchmark that is a proxy for program idioms found in Computational Fluid Dynamic (CFD) codes.
Modeling and Tracking the Driving Environment With a Particle-Based Occupancy Grid

Modeling and tracking the driving environment is a complex problem due to the heterogeneous nature of the real world. In many situations, modeling the obstacles and the driving surfaces can be achieved by the use of geometrical objects, and tracking becomes the problem of estimating the parameters of these objects. In the more complex cases, the scene can be modeled and tracked as an occupancy grid. This paper presents a novel occupancy grid tracking solution based on particles for tracking the dynamic driving environment. The particles will have a dual nature-they will denote hypotheses, as in the particle filtering algorithms, but they will also be the building blocks of our modeled world. The particles have position and speed, and they can migrate in the grid from cell to cell, depending on their motion model and motion parameters, but they will be also created and destroyed using a weighting-resampling mechanism that is specific to particle filtering algorithms. The tracking algorithm will be centered on particles, instead of cells. An obstacle grid derived from processing a stereovision-generated elevation map is used as measurement information, and the measurement model takes into account the uncertainties of the stereo reconstruction. The resulting system is a flexible real-time tracking solution for dynamic unstructured driving environments.
Recycling ambient microwave energy with broad-band rectenna arrays

This paper presents a study of reception and rectification of broad-band statistically time-varying low-power-density microwave radiation. The applications are in wireless powering of industrial sensors and recycling of ambient RF energy. A 64-element dual-circularly-polarized spiral rectenna array is designed and characterized over a frequency range of 2-18 GHz with single-tone and multitone incident waves. The integrated design of the antenna and rectifier, using a combination of full-wave electromagnetic field analysis and harmonic balance nonlinear circuit analysis, eliminates matching and filtering circuits, allowing for a compact element design. The rectified dc power and efficiency is characterized as a function of dc load and dc circuit topology, RF frequency, polarization, and incidence angle for power densities between 10/sup -5/-10/sup -1/ mW/cm/sup 2/. In addition, the increase in rectenna efficiency for multitone input waves is presented.
Key Risk Indicators – Their Role in Operational Risk Management and Measurement

In comparison with other operational risk management and measurement tools such as loss data (internal, public and consortium), risk-and-control assessments, capital allocation and performance measurement, key risk indicators (KRIs) remain one of the outstanding action items on most firms’ to-do lists, along with scenario analysis. KRIs are not new, but, up until recently, attempts to implement such programmes have often been characterised as less than effective. We believe that there are emerging best practices for KRI programmes that overcome some of the traditional challenges in KRI implementations. Further, we believe that investment in KRI programmes will reap many benefits, including the ability to clearly convey risk appetite, optimise risk and return, and improve the likelihood of achieving primary business goals through more effective operational risk management. In this chapter, we will seek to demystify KRIs, understand the basic fundamentals in identifying, specifying, selecting and implementing quality indicators, and consider how to monitor and report on them, in conjunction with other useful operational risk management information, to create powerful management reporting. We will also examine the potential for more advanced applications of KRIs, touching on the measurement of risk for correlation purposes, and the potential for composite indicators as well as KRI benchmarking. Finally, we will overview an industry KRI 10
Ontology-Based Integration of Cross-Linked Datasets

In this paper we tackle the problem of answering SPARQL queries over virtually integrated databases. We assume that the entity resolution problem has already been solved and explicit information is available about which records in the different databases refer to the same real world entity. Surprisingly, to the best of our knowledge, there has been no attempt to extend the standard Ontology-Based Data Access (OBDA) setting to take into account these DB links for SPARQL query-answering and consistency checking. This is partly because the OWL built-in owl:sameAs property, the most natural representation of links between data sets, is not included in OWL 2 QL, the de facto ontology language for OBDA. We formally treat several fundamental questions in this context: how links over database identifiers can be represented in terms of owl:sameAs statements, how to recover rewritability of SPARQL into SQL (lost because of owl:sameAs statements), and how to check consistency. Moreover, we investigate how our solution can be made to scale up to large enterprise datasets. We have implemented the approach, and carried out an extensive set of experiments showing its scalability.
Deep Transfer Metric Learning

Conventional metric learning methods usually assume that the training and test samples are captured in similar scenarios so that their distributions are assumed to be the same. This assumption does not hold in many real visual recognition applications, especially when samples are captured across different data sets. In this paper, we propose a new deep transfer metric learning (DTML) method to learn a set of hierarchical nonlinear transformations for cross-domain visual recognition by transferring discriminative knowledge from the labeled source domain to the unlabeled target domain. Specifically, our DTML learns a deep metric network by maximizing the inter-class variations and minimizing the intra-class variations, and minimizing the distribution divergence between the source domain and the target domain at the top layer of the network. To better exploit the discriminative information from the source domain, we further develop a deeply supervised transfer metric learning (DSTML) method by including an additional objective on DTML, where the output of both the hidden layers and the top layer are optimized jointly. To preserve the local manifold of input data points in the metric space, we present two new methods, DTML with autoencoder regularization and DSTML with autoencoder regularization. Experimental results on face verification, person re-identification, and handwritten digit recognition validate the effectiveness of the proposed methods.
Emerging topic detection using dictionary learning

Streaming user-generated content in the form of blogs, microblogs, forums, and multimedia sharing sites, provides a rich source of data from which invaluable information and insights maybe gleaned. Given the vast volume of such social media data being continually generated, one of the challenges is to automatically tease apart the emerging topics of discussion from the constant background chatter. Such emerging topics can be identified by the appearance of multiple posts on a unique subject matter, which is distinct from previous online discourse. We address the problem of identifying emerging topics through the use of dictionary learning. We propose a two stage approach respectively based on detection and clustering of novel user-generated content. We derive a scalable approach by using the alternating directions method to solve the resulting optimization problems. Empirical results show that our proposed approach is more effective than several baselines in detecting emerging topics in traditional news story and newsgroup data. We also demonstrate the practical application to social media analysis, based on a study on streaming data from Twitter.
A review of overview+detail, zooming, and focus+context interfaces

There are many interface schemes that allow users to work at, and move between, focused and contextual views of a dataset. We review and categorize these schemes according to the interface mechanisms used to separate and blend views. The four approaches are overview+detail, which uses a spatial separation between focused and contextual views; zooming, which uses a temporal separation; focus+context, which minimizes the seam between views by displaying the focus within the context; and cue-based techniques which selectively highlight or suppress items within the information space. Critical features of these categories, and empirical evidence of their success, are discussed. The aim is to provide a succinct summary of the state-of-the-art, to illuminate both successful and unsuccessful interface strategies, and to identify potentially fruitful areas for further work.
An Empirical Analysis of Traceability in the Monero Blockchain

Monero is a privacy-centric cryptocurrency that allows users to obscure their transactions by including chaff coins, called “mixins,” along with the actual coins they spend. In this paper, we empirically evaluate two weaknesses in Monero’s mixin sampling strategy. First, about 62% of transaction inputs with one or more mixins are vulnerable to “chain-reaction” analysis — that is, the real input can be deduced by elimination. Second, Monero mixins are sampled in such a way that they can be easily distinguished from the real coins by their age distribution; in short, the real input is usually the “newest” input. We estimate that this heuristic can be used to guess the real input with 80% accuracy over all transactions with 1 or more mixins. Next, we turn to the Monero ecosystem and study the importance of mining pools and the former anonymous marketplace AlphaBay on the transaction volume. We find that after removing mining pool activity, there remains a large amount of potentially privacy-sensitive transactions that are affected by these weaknesses. We propose and evaluate two countermeasures that can improve the privacy of future transactions. DOI 10.1515/popets-2018-0025 Received 2017-11-30; revised 2018-03-15; accepted 2018-03-16.  Malte Möser: Princeton University, E-mail: mmoeser@princeton.edu Kyle Soska: Carnegie Mellon University, E-mail:
Comparing NoSQL MongoDB to an SQL DB

NoSQL database solutions are becoming more and more prevalent in a world currently dominated by SQL relational databases. NoSQL databases were designed to provide database solutions for large volumes of data that is not structured. However, the advantages (or disadvantages) of using a NoSQL database for data that is structured, and not necessarily "Big," is not clear. There are not many studies that compare the performance of processing a modest amount of structured data in a NoSQL database with a traditional relational database. In this paper, we compare one of the NoSQL solutions, MongoDB, to the standard SQL relational database, SQL Server. We compare the performance, in terms of runtime, of these two databases for a modest-sized structured database. Results show that MongoDB performs equally as well or better than the relational database, except when aggregate functions are utilized.
Lessons learned from the deployment of a smartphone-based access-control system

Grey is a smartphone-based system by which a user can exercise her authority to gain access to rooms in our university building, and by which she can delegate that authority to other users. We present findings from a trial of Grey, with emphasis on how common usability principles manifest themselves in a smartphone-based security application. In particular, we demonstrate aspects of the system that gave rise to failures, misunderstandings, misperceptions, and unintended uses; network effects and new flexibility enabled by Grey; and the implications of these for user behavior. We argue that the manner in which usability principles emerged in the context of Grey can inform the design of other such applications.
Automatic PCB Defects Detection and Classification using Matlab

The importance of the Printed Circuit Board inspection process has been magnified by requirements of the modern manufacturing environment. In electronics mass production manufacturing facilities, an attempt is often to achieve 100% quality assurance. In this work Machine Vision PCB Inspection System is applied at the first step of manufacturing. In this system a PCB inspection system is proposed and the inspection algorithm mainly focuses on the defect detection and defect classification of the defects. Defect classification is essential to the identification of the defect sources. The purpose of the system is to provide the automatic defect detection of PCB and relieve the human inspectors from the tedious task of finding the defects in PCB which may lead to electric failure. We first compare a standard PCB inspection image with a PCB image to be inspected. The MATLAB tool is used to detect the defects and to classify the defects. With the solutions designed and implemented in this thesis the algorithm designed in the proposed system is able to detect and classify all the known 14 types of defects successfully with greater accuracy. The algorithm makes use of image subtraction method for defect detection and kNN classification algorithm for the classification of the defects. This thesis will present and analyze the performance of the proposed inspection algorithm. The experiment will measure the accuracy of the system.
On-line cursive script recognition using time-delay neural networks and hidden Markov models

We present a writer-independent system for online handwriting recognition that can handle a variety of writing styles including cursive script and handprinting. The input to our system contains the pen trajectory information, encoded as a time-ordered sequence of feature vectors. A time-delay neural network is used to estimate a posteriori probabilities for characters in a word. A hidden Markov model segments the word in a way that optimizes the global word score, using a dictionary in the process. A geometrical normalization scheme and a fast but efficient dictionary search are also presented. Trained on 20 k words from 59 writers, using a 25 k-word dictionary, our system reached recognition rates of 89% for characters and 80% for words on test data from a disjoint set of writers.
Texture synthesis using convolutional neural networks with long-range consistency and spectral constraints

Procedural texture generation enables the creation of more rich and detailed virtual environments without the help of an artist. However, finding a flexible generative model of real world textures remains an open problem. We present a novel Convolutional Neural Network based texture model consisting of two summary statistics (the Gramian and Translation Gramian matrices), as well as spectral constraints. We investigate the Fourier Transform or Window Fourier Transform in applying spectral constraints, and find that the Window Fourier Transform improved the quality of the generated textures. We demonstrate the efficacy of our system by comparing generated output with that of related state of the art systems.
How to Prove Yourself: Practical Solutions to Identification and Signature Problems

In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack if factoring is difficult, and typical implementations require only 1% to 4% of the number of modular multiplications required by the RSA scheme. Due to their simplicity, security and speed, these schemes are ideally suited for microprocessor-based devices such as smart cards, personal computers, and remote control systems.
A probabilistic roadmap planner for flexible objects with a workspace medial-axis-based sampling approach

Probabilistic roadmap planners have been used with success to plan paths for flexible objects such as metallic plates or plastic flexible pipes. This paper improves the performance of these planners by using the medial axis of the workspace to guide the random sampling. At a preprocessing stage, the medial axis of the workspace is computed using a recent efficient algorithm. Then the flexible object is fitted at random points along the medial axis. The energy of all generated configurations is minimized and the planner proceeds to connect them with low-energy quasi-static paths in a roadmap that captures the connectivity of the free space. Given an initial and a final configuration, the planner connects these to the roadmap and searches the roadmap for a path. Our experimental results show that the new sampling scheme is successful in identifying critical deformations of the object along solution paths which results in a significant reduction of the computation time. Our work on planning for flexible objects has applications in industrial settings, virtual reality environments, and
Object-Oriented Bayesian Networks

Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applications. However, when faced with a large complex domain, the task of modeling using Bayesian networks begins to resemble the task of programming using logical circuits. In this paper, we describe an object-oriented Bayesian network (OOBN) language, which allows complex domains to be described in terms of inter-related objects. We use a Bayesian network fragment to describe the probabilistic relations between the attributes of an object. These attributes can themselves be objects, providing a natural framework for encoding part-of hierarchies. Classes are used to provide a reusable probabilistic model which can be applied to multiple similar objects. Classes also support inheritance of model fragments from a class to a subclass, allowing the common aspects of related classes to be defined only once. Our language has clear declarative semantics: an OOBN can be interpreted as a stochastic functional program, so that it uniquely specifies a probabilistic model. We provide an inference algorithm for OOBNs, and show that much of the structural information encoded by an OOBN—particularly the encapsulation of variables within an object and the reuse of model fragments in different contexts—can also be used to speed up the inference process.
Outliers , Level Shifts , and Variance Changes in Time Series

Outliers, level shifts, and variance changes are commonplace in applied time series analysis. However, their existence is often ignored and their impact is overlooked, for the lack of simple and useful methods to detect and handle those extraordinary events. The problem of detecting outliers, level shifts, and variance changes in a univariate time series is considered. The methods employed are extremely simple yet useful. Only the least squares techniques and residual variance ratios are used. The effectiveness of these simple methods is demonstrated by analysing three real data sets.