nils-herrmann/clean_scirepeval huggingface dataset:
Instantaneous lateral velocity estimation of a vehicle using Doppler radar

High-resolution image radars open new opportunities for estimating velocity and direction of movement of extended objects from a single observation. Since radar sensors only measure the radial velocity, a tracking system is normally used to determine the velocity vector of the object. A stable velocity is estimated after several frames at the earliest, resulting in a significant loss of time for reacting to certain situations such as cross-traffic. The following paper presents a robust and model-free approach to determine the velocity vector of an extended target. In contrast to the Kalman filter, it does not require data association in time and space. An instant (~ 50 ms) and bias free estimation of its velocity vector is possible. Our approach can handle noise and systematic variations (e.g., micro-Doppler of wheels) in the signal. It is optimized to deal with measurement errors of the radar sensor not only in the radial velocity, but in the azimuth position as well. The accuracy of this method is increased by the fusion of multiple radar sensors.
INTELLIGENT TRAFFIC LIGHTS CONTROL BY FUZZY LOGIC

One of the ways to overcome traffic problems in large cities is through the development of an intelligent monitoring and control of traffic lights system. This paper addresses the design and implementation of an intelligent traffic lights controller based on fuzzy logic technology. A software has been developed to simulate the situation of an isolated traffic junction based on this technology. The software is highly graphical in nature and uses the Windows system. The software allows simulation of different traffic conditions at the junction and comparison can be made between the fuzzy logic controller and a conventional fixed-time controller. Simulation results show that the fuzzy logic controller has better performance and is more cost benefit.
Multi-Document Summarization By Sentence Extraction

This paper discusses a text extraction approach to multidocument summarization that builds on single-document summarization methods by using additional, available in-, formation about the document set as a whole and the relationships between the documents. Multi-document summarization differs from single in that the issues of compression, speed, redundancy and passage selection are critical in the formation of useful summaries. Our approach addresses these issues by using domainindependent techniques based mainly on fast, statistical processing, a metric for reducing redundancy and maximizing diversity in the selected passages, and a modular framework to allow easy parameterization for different genres, corpora characteristics and user requirements.
An Evaluation of Distributed Concurrency Control

Increasing transaction volumes have led to a resurgence of interest in distributed transaction processing. In particular, partitioning data across several servers can improve throughput by allowing servers to process transactions in parallel. But executing transactions across servers limits the scalability and performance of these systems. In this paper, we quantify the effects of distribution on concurrency control protocols in a distributed environment. We evaluate six classic and modern protocols in an in-memory distributed database evaluation framework called Deneva, providing an apples-to-apples comparison between each. Our results expose severe limitations of distributed transaction processing engines. Moreover, in our analysis, we identify several protocol-specific scalability bottlenecks. We conclude that to achieve truly scalable operation, distributed concurrency control solutions must seek a tighter coupling with either novel network hardware (in the local area) or applications (via data modeling and semantically-aware execution), or both.
Robot Programming by Demonstration with Crowdsourced Action Fixes

Programming by Demonstration (PbD) can allow endusers to teach robots new actions simply by demonstrating them. However, learning generalizable actions requires a large number of demonstrations that is unreasonable to expect from end-users. In this paper, we explore the idea of using crowdsourcing to collect action demonstrations from the crowd. We propose a PbD framework in which the end-user provides an initial seed demonstration, and then the robot searches for scenarios in which the action will not work and requests the crowd to fix the action for these scenarios. We use instance-based learning with a simple yet powerful action representation that allows an intuitive visualization of the action. Crowd workers directly interact with these visualizations to fix them. We demonstrate the utility of our approach with a user study involving local crowd workers (N=31) and analyze the collected data and the impact of alternative design parameters so as to inform a real-world deployment of our system.
Exploiting Similarities among Languages for Machine Translation

Dictionaries and phrase tables are the basis of modern statistical machine translation systems. This paper develops a method that can automate the process of generating and extending dictionaries and phrase tables. Our method can translate missing word and phrase entries by learning language structures based on large monolingual data and mapping between languages from small bilingual data. It uses distributed representation of words and learns a linear mapping between vector spaces of languages. Despite its simplicity, our method is surprisingly effective: we can achieve almost 90% precision@5 for translation of words between English and Spanish. This method makes little assumption about the languages, so it can be used to extend and refine dictionaries and translation tables for any language pairs.
Image Noise Level Estimation by Principal Component Analysis

The problem of blind noise level estimation arises in many image processing applications, such as denoising, compression, and segmentation. In this paper, we propose a new noise level estimation method on the basis of principal component analysis of image blocks. We show that the noise variance can be estimated as the smallest eigenvalue of the image block covariance matrix. Compared with 13 existing methods, the proposed approach shows a good compromise between speed and accuracy. It is at least 15 times faster than methods with similar accuracy, and it is at least two times more accurate than other methods. Our method does not assume the existence of homogeneous areas in the input image and, hence, can successfully process images containing only textures.
Identifying Opinion Leaders in BBS

Opinion leaders play a very important role in information diffusion; they are found in all fields of society and influence the opinions of the masses in their fields. Most proposed algorithms on identifying opinion leaders in internet social network are global measure algorithms and usually omit the fact that opinion leaders are field-limited. We propose and test several algorithms, including interest-field based algorithms and global measure algorithms, to identify opinion leaders in BBS. Our experiments show that different algorithms are sensitive to different indicators; the interest-field based algorithms which not only take into account of the social networks’ structure but also the users’ interest space are more reasonable and effective in identifying opinion leaders in BBS. The interest-field based algorithms are sensitive to the high status nodes in the social network, and their performance relies on the quality of field discovery.
Caraoke: An E-Toll Transponder Network for Smart Cities

Electronic toll collection transponders, e.g., E-ZPass, are a widely-used wireless technology. About 70% to 89% of the cars in US have these devices, and some states plan to make them mandatory. As wireless devices however, they lack a basic function: a MAC protocol that prevents collisions. Hence, today, they can be queried only with directional antennas in isolated spots. However, if one could interact with e-toll transponders anywhere in the city despite collisions, it would enable many smart applications. For example, the city can query the transponders to estimate the vehicle flow at every intersection. It can also localize the cars using their wireless signals, and detect those that run a red-light. The same infrastructure can also deliver smart street-parking, where a user parks anywhere on the street, the city localizes his car, and automatically charges his account. This paper presents Caraoke, a networked system for delivering smart services using e-toll transponders. Our design operates with existing unmodified transponders, allowing for applications that communicate with, localize, and count transponders, despite wireless collisions. To do so, Caraoke exploits the structure of the transponders' signal and its properties in the frequency domain. We built Caraoke reader into a small PCB that harvests solar energy and can be easily deployed on street lamps. We also evaluated Caraoke on four streets on our campus and demonstrated its capabilities.
Applications of approximation algorithms to cooperative games

The Internet, which is intrinsically a common playground for a large number of players with varying degrees of collaborative and sel sh motives, naturally gives rise to numerous new game theoretic issues. Computational problems underlying solutions to these issues, achieving desirable economic criteria, often turn out to be NP-hard. It is therefore natural to apply notions from the area of approximation algorithms to these problems. The connection is made more meaningful by the fact that the two areas of game theory and approximation algorithms share common methodology { both heavily use machinery from the theory of linear programming. Various aspects of this connection have been explored recently by researchers [8, 10, 15, 20, 21, 26, 27, 29]. In this paper we will consider the problem of sharing the cost of a jointly utilized facility in a \fair" manner. Consider a service providing company whose set of possible customers, also called users, is U . For each set S U C(S) denotes the cost incurred by the company to serve the users in S. The function C is known as the cost function. For concreteness, assume that the company broadcasts news of common interest, such as nancial news, on the net. Each user, i, has a utility, u0i, for receiving the news. This utility u 0 i is known only to user i. User i enjoys a bene t of u0i xi if she gets the news at the price xi. If she does not get the news then her bene t is 0. Each user is assumed to be sel sh, and hence in order to maximize bene t, may misreport her utility as some other number, say ui. For the rest of the discussion, the utility of user i will mean the number ui. A cost sharing mechanism determines which users receive the broadcast and at what price. The mechanism is strategyproof if the dominant strategy of each user is to reveal the
Peristaltic locomotion with antagonistic actuators in soft robotics

This paper presents a soft robotic platform that exhibits peristaltic locomotion. The design principle is based on the unique antagonistic arrangement of radial/circular and longitudinal muscle groups of Oligochaeta. Sequential antagonistic motion is achieved in a flexible braided mesh-tube structure with NiTi coil actuators. A numerical model for the mesh structure describes how peristaltic motion induces robust locomotion and details the deformation by the contraction of NiTi actuators. Several peristaltic locomotion modes are modeled, tested, and compared on the basis of locomotion speed. The entire mechanical structure is made of flexible mesh materials and can withstand significant external impacts during locomotion. This approach can enable a completely soft robotic platform by employing a flexible control unit and energy sources.
Probabilistic Visual Learning for Object Representation

We present an unsupervised technique for visual learning, which is based on density estimation in high-dimensional spaces using an eigenspace decomposition. Two types of density estimates are derived for modeling the training data: a multivariate Gaussian (for unimodal distributions) and a Mixture-of-Gaussians model (for multimodal distributions). These probability densities are then used to formulate a maximum-likelihood estimation framework for visual search and target detection for automatic object recognition and coding. Our learning technique is applied to the probabilistic visual modeling, detection, recognition, and coding of human faces and nonrigid objects, such as hands.
Class segmentation and object localization with superpixel neighborhoods

We propose a method to identify and localize object classes in images. Instead of operating at the pixel level, we advocate the use of superpixels as the basic unit of a class segmentation or pixel localization scheme. To this end, we construct a classifier on the histogram of local features found in each superpixel. We regularize this classifier by aggregating histograms in the neighborhood of each superpixel and then refine our results further by using the classifier in a conditional random field operating on the superpixel graph. Our proposed method exceeds the previously published state-of-the-art on two challenging datasets: Graz-02 and the PASCAL VOC 2007 Segmentation Challenge.
Human-level concept learning through probabilistic program induction

People learning new concepts can often generalize successfully from just a single example, yet machine learning algorithms typically require tens or hundreds of examples to perform with similar accuracy. People can also use learned concepts in richer ways than conventional algorithms—for action, imagination, and explanation. We present a computational model that captures these human learning abilities for a large class of simple visual concepts: handwritten characters from the world’s alphabets. The model represents concepts as simple programs that best explain observed examples under a Bayesian criterion. On a challenging one-shot classification task, the model achieves human-level performance while outperforming recent deep learning approaches. We also present several “visual Turing tests” probing the model’s creative generalization abilities, which in many cases are indistinguishable from human behavior.
Accelerated Inexact Soft-Impute for Fast Large-Scale Matrix Completion

A 3 AIS-Impute (proposed algorithm).  partially observed matrix O, parameter λ, decay parameter ν ∈ (0, 1), threshold ; 1: [U0, λ0, V0] = rank-1 SVD(PΩ(O)); 2: c = 1, ̃0 = ‖PΩ(O)‖F , X0 = X1 = λ0U0V > 0 ; 3: for t = 1, 2, . . . do 4: ̃t = ν̃0; θt = (c− 1)/(c+ 2); 5: λt = ν(λ0 − λ) + λ; 6: Yt = Xt + θt(Xt −Xt−1); 7: Z̃t = Yt + PΩ(O − Yt); 8: Vt−1 = Vt−1 − Vt(VtVt−1), remove zero columns; 9: Rt = QR([Vt, Vt−1]); 10: [Ut+1,Σt+1, Vt+1] = approx-SVT(Z̃t, Rt, λt, ̃t); 11: if F (Ut+1Σt+1V > t+1) > F (UtΣtV > t ); c = 1 else c = c+ 1; 12: end for 13: return Xt+1 = Ut+1Σt+1V > t+1.
Improved asynchronous voltage regulation strategy of non-inverting Buck-Boost converter for renewable energy integration

A systematic control strategy for Non-inverting Buck-Boost converter based on equivalent duty ratio is presented in this paper. Extend-Buck mode and Extend-Boost mode are first derived as transition mode for least inductor current in constant frequency operation and are modified with consideration of parasitic elements. Equivalent duty cycle is introduced to switch among different working modes and to regulate output voltage during each mode. Gain-scheduling based controller is employed considering mode switching nonlinearity. Special benefits offered by this method are decreased inductor current and losses, continuous voltage conversion ratio and easy-implemented constant frequency operation without input voltage measurement.
Optical Character Recognition for Cursive Handwriting

ÐIn this paper, a new analytic scheme, which uses a sequence of segmentation and recognition algorithms, is proposed for offline cursive handwriting recognition problem. First, some global parameters, such as slant angle, baselines, and stroke width and height are estimated. Second, a segmentation method finds character segmentation paths by combining gray scale and binary information. Third, Hidden Markov Model (HMM) is employed for shape recognition to label and rank the character candidates. For this purpose, a string of codes is extracted from each segment to represent the character candidates. The estimation of feature space parameters is embedded in HMM training stage together with the estimation of the HMM model parameters. Finally, the lexicon information and HMM ranks are combined in a graph optimization problem for word-level recognition. This method corrects most of the errors produced by segmentation and HMM ranking stages by maximizing an information measure in an efficient graph search algorithm. The experiments in dicate higher recognition rates compared to the available methods reported in the literature. Index TermsÐHandwritten word recognition, preprocessing, segmentation, optical character recognition, cursive handwriting, hidden Markov model, search, graph, lexicon matching.
Comparing Prediction Market Structures, With an Application to Market Making

Ensuring sufficient liquidity is one of the key challenges for designers of prediction markets. Various market making algorithms have been proposed in the literature and deployed in practice, but there has been little effort to evaluate their benefits and disadvantages in a systematic manner. We introduce a novel experimental design for comparing market structures in live trading that ensures fair comparison between two different microstructures with the same trading population. Participants trade on outcomes related to a two-dimensional random walk that they observe on their computer screens. They can simultaneously trade in two markets, corresponding to the independent horizontal and vertical random walks. We use this experimental design to compare the popular inventory-based logarithmic market scoring rule (LMSR) market maker and a new information based Bayesian market maker (BMM). Our experiments reveal that BMM can offer significant benefits in terms of price stability and expected loss when controlling for liquidity; the caveat is that, unlike LMSR, BMM does not guarantee bounded loss. Our investigation also elucidates some general properties of market makers in prediction markets. In particular, there is an inherent tradeoff between adaptability to market shocks and convergence during market equilibrium.
Intrinsic Statistics on Riemannian Manifolds: Basic Tools for Geometric Measurements

In medical image analysis and high level computer vision, there is an intensive use of geometric features like orientations, lines, and geometric transformations ranging from simple ones (orientations, lines, rigid body or affine transformations, etc.) to very complex ones like curves, surfaces, or general diffeomorphic transformations. The measurement of such geometric primitives is generally noisy in real applications and we need to use statistics either to reduce the uncertainty (estimation), to compare observations, or to test hypotheses. Unfortunately, even simple geometric primitives often belong to manifolds that are not vector spaces. In previous works [1, 2], we investigated invariance requirements to build some statistical tools on transformation groups and homogeneous manifolds that avoids paradoxes. In this paper, we consider finite dimensional manifolds with a Riemannian metric as the basic structure. Based on this metric, we develop the notions of mean value and covariance matrix of a random element, normal law, Mahalanobis distance and χ2 law. We provide a new proof of the characterization of Riemannian centers of mass and an original gradient descent algorithm to efficiently compute them. The notion of Normal law we propose is based on the maximization of the entropy knowing the mean and covariance of the distribution. The resulting family of pdfs spans the whole range from uniform (on compact manifolds) to the point mass distribution. Moreover, we were able to provide tractable approximations (with their limits) for small variances which show that we can effectively implement and work with these definitions.
A preamplifier-latch comparator for high accuracy high speed switched-capacitors pipelined ADC

In this paper, a gain-boosting preamplifier-latch comparator with minimum input referred offset voltage is proposed. The preamplifier utilizes telescope structure with cross-coupled active loading, which enhances the gain of preamplifier. In order to minimize the delay time of comparator, the input DC range and the ratio of PMOS/NMOS are selected carefully. The circuit is fabricated in TSMC 0.18um with 1.8V power supply.
Bottom-Up Relational Learning of Pattern Matching Rules for Information Extraction

Information extraction is a form of shallow text processing that locates a specified set of relevant items in a natural-language document. Systems for this task require significant domain-specific knowledge and are time-consuming and difficult to build by ha nd, making them a good application for machine learning. We present an algorithm, R APIER, that uses pairs of sample documents and filled templates to induce pattern-match rules that dire ctly extract fillers for the slots in the template. RAPIER is a bottom-up learning algorithm that incorporates techni ques from several inductive logic programming systems. We have implemented t h algorithm in a system that allows patterns to have constraints on the words, part-of-speech t ags, and semantic classes present in the filler and the surrounding text. We present encouraging expe rimental results on two domains.
Boosting Algorithms as Gradient Descent

We provide an abstract characterization of boosting algorithms as gradient decsent on cost-functionals in an inner-product function space. We prove convergence of these functional-gradient-descent algorithms under quite weak conditions. Following previous theoretical results bounding the generalization performance of convex combinations of classifiers in terms of general cost functions of the margin, we present a new algorithm (DOOM II) for performing a gradient descent optimization of such cost functions. Experiments on several data sets from the UC Irvine repository demonstrate that DOOM II generally outperforms AdaBoost, especially in high noise situations, and that the overfitting behaviour of AdaBoost is predicted by our cost functions.
Leakage current mechanisms and leakage reduction techniques in deep-submicrometer CMOS circuits

High leakage current in deep-submicrometer regimes is becoming a significant contributor to power dissipation of CMOS circuits as threshold voltage, channel length, and gate oxide thickness are reduced. Consequently, the identification and modeling of different leakage components is very important for estimation and reduction of leakage power, especially for low-power applications. This paper reviews various transistor intrinsic leakage mechanisms, including weak inversion, drain-induced barrier lowering, gate-induced drain leakage, and gate oxide tunneling. Channel engineering techniques including retrograde well and halo doping are explained as means to manage short-channel effects for continuous scaling of CMOS devices. Finally, the paper explores different circuit techniques to reduce the leakage power consumption.