SoroushVahidi/scidocs huggingface dataset:
Automatic music transcription: challenges and future directions
(2013)

Automatic music transcription is considered by many to be a key enabling technology in music signal processing. However, the performance of transcription systems is still significantly below that of a human expert, and accuracies reported in recent years seem to have reached a limit, although the field is still very active. In this paper we analyse limitations of current methods and identify promising directions for future research. Current transcription methods use general purpose models which are unable to capture the rich diversity found in music signals. One way to overcome the limited performance of transcription systems is to tailor algorithms to specific use-cases. Semi-automatic approaches are another way of achieving a more reliable transcription. Also, the wealth of musical scores and corresponding audio data now available are a rich potential source of training data, via forced alignment of audio to scores, but large scale utilisation of such data has yet to be attempted. Other promising approaches include the integration of information from multiple algorithms and different musical aspects.
Improving Interaction in HMD-Based Vehicle Simulators through Real Time Object Reconstruction
(2016)

Bringing real objects into the virtual world has been shown to increase usability and presence in virtual reality applications. This paper presents a system to generate a real time virtual reconstruction of real world user interface elements for use in a head mounted display based driving simulator. Our system uses sensor fusion algorithms to combine data from depth and color cameras to generate an accurate, detailed, and fast rendering of the user's hands while using the simulator. We tested our system and show in our results that the inclusion of the participants real hands, the wheel, and the shifter in the virtual environment increases the immersion, presence, and usability of the simulation. Our system can also be used to bring other real objects into the virtual world, especially when accuracy, detail, and real time updates are desired.
Reconfigurable antennas in cognitive radio that can think for themselves?
(2009)

This paper discusses the use of reconfigurable antennas in cognitive radio. Most of the emphasis on cognitive radio so far has been in the area of spectral estimation and signal classification. In this paper we show that once a cognitive device manages to learn the RF environment (cognition part), from past observations and decisions using machine learning techniques, we can use the collected data to train reconfigurable antennas to adapt to any change in the RF environment.
Self-regulation strategies improve self-discipline in adolescents : benefits of mental contrasting and implementation intentions
(2010)

Self-regulation strategies improve self-discipline in adolescents: benefits of mental contrasting and implementation intentions Angela Lee Duckwortha; Heidi Grantb; Benjamin Loewa; Gabriele Oettingenac; Peter M. Gollwitzerad a Department of Psychology, University of Pennsylvania, Philadelphia, PA, USA b Department of Psychology, Lehigh University, Bethlehem, PA, USA c Department of Psychology, University of Hamburg, Hamburg, Germany d Department of Psychology, University of Konstanz, Konstanz, Germany
The FaceSketchID System: Matching Facial Composites to Mugshots
(2014)

Facial composites are widely used by law enforcement agencies to assist in the identification and apprehension of suspects involved in criminal activities. These composites, generated from witness descriptions, are posted in public places and media with the hope that some viewers will provide tips about the identity of the suspect. This method of identifying suspects is slow, tedious, and may not lead to the timely apprehension of a suspect. Hence, there is a need for a method that can automatically and efficiently match facial composites to large police mugshot databases. Because of this requirement, facial composite recognition is an important topic for biometrics researchers. While substantial progress has been made in nonforensic facial composite (or viewed composite) recognition over the past decade, very little work has been done using operational composites relevant to law enforcement agencies. Furthermore, no facial composite to mugshot matching systems have been documented that are readily deployable as standalone software. Thus, the contributions of this paper include: 1) an exploration of composite recognition use cases involving multiple forms of facial composites; 2) the FaceSketchID System, a scalable, and operationally deployable software system that achieves state-of-the-art matching accuracy on facial composites using two algorithms (holistic and component based); and 3) a study of the effects of training data on algorithm performance. We present experimental results using a large mugshot gallery that is representative of a law enforcement agency's mugshot database. All results are compared against three state-of-the-art commercial-off-the-shelf face recognition systems.
Office Procedure as Practical Action: Models of Work and System Design
(1983)

The design of office technology relies upon underlying conceptions of human organization and action. The goal of building office information systems requires a representation of office work and its relevant objects. The concern of this paper is that although system designers recognize the centrality of procedural tasks in the office, they tend to ignore the actual work involved in accomplishing those tasks. A perspicuous instance of work in an accounting office is used to recommend a new line of research into the practical problems of office work, and to suggest preliminary implications of that research for office systems design.
Multilabel classification via calibrated label ranking
(2008)

Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. Hitherto existing approaches to label ranking implicitly operate on an underlying (utility) scale which is not calibrated in the sense that it lacks a natural zero point. We propose a suitable extension of label ranking that incorporates the calibrated scenario and substantially extends the expressive power of these approaches. In particular, our extension suggests a conceptually novel technique for extending the common learning by pairwise comparison approach to the multilabel scenario, a setting previously not being amenable to the pairwise decomposition technique. The key idea of the approach is to introduce an artificial calibration label that, in each example, separates the relevant from the irrelevant labels. We show that this technique can be viewed as a combination of pairwise preference learning and the conventional relevance classification technique, where a separate classifier is trained to predict whether a label is relevant or not. Empirical results in the area of text categorization, image classification and gene analysis underscore the merits of the calibrated model in comparison to state-of-the-art multilabel learning methods.
Graph-based term weighting for information retrieval
(2011)

A standard approach to Information Retrieval (IR) is to model text as a bag of words. Alternatively, text can be modelled as a graph, whose vertices represent words, and whose edges represent relations between the words, defined on the basis of any meaningful statistical or linguistic relation. Given such a text graph, graph theoretic computations can be applied to measure various properties of the graph, and hence of the text. This work explores the usefulness of such graph-based text representations for IR. Specifically, we propose a principled graph-theoretic approach of (1) computing term weights and (2) integrating discourse aspects into retrieval. Given a text graph, whose vertices denote terms linked by co-occurrence and grammatical modification, we use graph ranking computations (e.g. PageRank Page et al. in The pagerank citation ranking: Bringing order to the Web. Technical report, Stanford Digital Library Technologies Project, 1998) to derive weights for each vertex, i.e. term weights, which we use to rank documents against queries. We reason that our graph-based term weights do not necessarily need to be normalised by document length (unlike existing term weights) because they are already scaled by their graph-ranking computation. This is a departure from existing IR ranking functions, and we experimentally show that it performs comparably to a tuned ranking baseline, such as BM25 (Robertson et al. in NIST Special Publication 500-236: TREC-4, 1995). In addition, we integrate into ranking graph properties, such as the average path length, or clustering coefficient, which represent different aspects of the topology of the graph, and by extension of the document represented as a graph. Integrating such properties into ranking allows us to consider issues such as discourse coherence, flow and density during retrieval. We experimentally show that this type of ranking performs comparably to BM25, and can even outperform it, across different TREC (Voorhees and Harman in TREC: Experiment and evaluation in information retrieval, MIT Press, 2005) datasets and evaluation measures.
Confronting the Challenge of Quality Diversity
(2015)

In contrast to the conventional role of evolution in evolutionary computation (EC) as an optimization algorithm, a new class of evolutionary algorithms has emerged in recent years that instead aim to accumulate as diverse a collection of discoveries as possible, yet where each variant in the collection is as fit as it can be. Often applied in both neuroevolution and morphological evolution, these new quality diversity (QD) algorithms are particularly well-suited to evolution's inherent strengths, thereby offering a promising niche for EC within the broader field of machine learning. However, because QD algorithms are so new, until now no comprehensive study has yet attempted to systematically elucidate their relative strengths and weaknesses under different conditions. Taking a first step in this direction, this paper introduces a new benchmark domain designed specifically to compare and contrast QD algorithms. It then shows how the degree of alignment between the measure of quality and the behavior characterization (which is an essential component of all QD algorithms to date) impacts the ultimate performance of different such algorithms. The hope is that this initial study will help to stimulate interest in QD and begin to unify the disparate ideas in the area.
A Finger-Vein Based Cancellable Bio-cryptosystem
(2013)

Irrevocability is one major issue in existing bio-cryptosystems. In this paper, we proposed a cancellable bio-cryptosystem by taking the full advantage of cancellable and non-invertible properties of bio-hashing biometrics. Specifically, two transformed templates are generated by using the bio-hashing algorithm and applied into two different secure sketches, fuzzy commitment sketch and fuzzy vault sketch, respectively. These two secure sketches can be fused in two different ways: AND fusion and OR fusion, so as to emphasis either on the recognition accuracy or the security level of the system. Experimental results and security analysis show the validity of the proposed scheme.
Protocol considerations for a prefix-caching proxy for multimedia streams
(2000)

The increasing popularity of multimedia streaming applications introduces new challenges in content distribution. Web-initiated multimedia streams typically experience high start-up delay, due to large protocol overheads and the poor delay, throughput, and loss properties of the Internet. Internet service providers can improve performance by caching the initial segment (the pre x) of popular streams at proxies near the requesting clients. The proxy can initiate transmission to the client while simultaneously requesting the remainder of the stream from the server. This paper analyzes the challenges of realizing a pre x-caching service in the context of the IETF's Real-Time Streaming Protocol (RTSP), a multimedia streaming protocol that derives from HTTP. We describe how to exploit existing RTSP features, such as the Range header, and how to avoid several round-trip delays by caching protocol information at the proxy. Based on our experiences, we propose extensions to RTSP that would ease the development of new multimedia proxy services. In addition, we discuss how caching the partial contents of multimedia streams introduces new challenges in cache coherency and feedback control. Then, we brie y present our preliminary implementation of pre x caching on a Linux-based PC, and describe how the proxy interoperates with the RealNetworks server and client.
Planning for decentralized control of multiple robots under uncertainty
(2015)

This paper presents a probabilistic framework for synthesizing control policies for general multi-robot systems that is based on decentralized partially observable Markov decision processes (Dec-POMDPs). Dec-POMDPs are a general model of decision-making where a team of agents must cooperate to optimize a shared objective in the presence of uncertainty. Dec-POMDPs also consider communication limitations, so execution is decentralized. While Dec-POMDPs are typically intractable to solve for real-world problems, recent research on the use of macro-actions in Dec-POMDPs has significantly increased the size of problem that can be practically solved. We show that, in contrast to most existing methods that are specialized to a particular problem class, our approach can synthesize control policies that exploit any opportunities for coordination that are present in the problem, while balancing uncertainty, sensor information, and information about other agents. We use three variants of a warehouse task to show that a single planner of this type can generate cooperative behavior using task allocation, direct communication, and signaling, as appropriate. This demonstrates that our algorithmic framework can automatically optimize control and communication policies for complex multi-robot systems.
SCL: Simplifying Distributed SDN Control Planes
(2017)

We consider the following question: what consistency model is appropriate for coordinating the actions of a replicated set of SDN controllers? We first argue that the conventional requirement of strong consistency, typically achieved through the use of Paxos or other consensus algorithms, is conceptually unnecessary to handle unplanned network updates. We present an alternate approach, based on the weaker notion of eventual correctness, and describe the design of a simple coordination layer (SCL) that can seamlessly turn a set of single-image SDN controllers (that obey certain properties) into a distributed SDN system that achieves this goal (whereas traditional consensus mechanisms do not). We then show through analysis and simulation that our approach provides faster responses to network events. While our primary focus is on handling unplanned network updates, our coordination layer also handles policy updates and other situations where consistency is warranted. Thus, contrary to the prevailing wisdom, we argue that distributed SDN control planes need only be slightly more complicated than single-image controllers.
A compact 2.45 GHz, low power wireless energy harvester with a reflector-backed folded dipole rectenna
(2015)

This paper paper describes the design procedure as well as the experimental performance of a 2.45GHz 10 μW wireless energy harvester (WEH) with a maximum total efficiency of ≈ 30% at 1 μW/cm2 incident power density. The WEH integrates a shunt high-speed rectifying diode with a folded dipole. A metal reflector increases the gain of the rectenna and a quarter wavelength differential line is used as a choke. Both a VDI WVD and a Skyworks GaAs Schottky diode are integrated with the antenna and their performance is compared.
A Comparison of Evolutionary Algorithms and Gradient-based Methods for the Optimal Control Problem
(2018)

An experimental comparison of evolutionary algorithms and gradient-based methods for the optimal control problem is carried out. The problem is solved separately by Particle swarm optimization, Grey wolf optimizer, Fast gradient descent method, Marquardt method and Adam method. The simulation is performed on a jet aircraft model. The results of each algorithm performance are compared according to the best found value of the fitness function, the mean value and the standard deviation.
Improving speech recognition by revising gated recurrent units
(2017)

Speech recognition is largely taking advantage of deep learning, showing that substantial benefits can be obtained by modern Recurrent Neural Networks (RNNs). The most popular RNNs are Long Short-Term Memory (LSTMs), which typically reach state-of-the-art performance in many tasks thanks to their ability to learn long-term dependencies and robustness to vanishing gradients. Nevertheless, LSTMs have a rather complex design with three multiplicative gates, that might impair their efficient implementation. An attempt to simplify LSTMs has recently led to Gated Recurrent Units (GRUs), which are based on just two multiplicative gates. This paper builds on these efforts by further revising GRUs and proposing a simplified architecture potentially more suitable for speech recognition. The contribution of this work is two-fold. First, we suggest to remove the reset gate in the GRU design, resulting in a more efficient single-gate architecture. Second, we propose to replace tanh with ReLU activations in the state update equations. Results show that, in our implementation, the revised architecture reduces the per-epoch training time with more than 30% and consistently improves recognition performance across different tasks, input features, and noisy conditions when compared to a standard GRU.
Kineticons: using iconographic motion in graphical user interface design
(2011)

Icons in graphical user interfaces convey information in a mostly universal fashion that allows users to immediately interact with new applications, systems and devices. In this paper, we define Kineticons - an iconographic scheme based on motion. By motion, we mean geometric manipulations applied to a graphical element over time (e.g., scale, rotation, deformation). In contrast to static graphical icons and icons with animated graphics, kineticons do not alter the visual content or "pixel-space" of an element. Although kineticons are not new - indeed, they are seen in several popular systems - we formalize their scope and utility. One powerful quality is their ability to be applied to GUI elements of varying size and shape from a something as small as a close button, to something as large as dialog box or even the entire desktop. This allows a suite of system-wide kinetic behaviors to be reused for a variety of uses. Part of our contribution is an initial kineticon vocabulary, which we evaluated in a 200 participant study. We conclude with discussion of our results and design recommendations.
Sample Size in Factor Analysis
(2004)

The factor analysis literature includes a range of recommendations regarding the minimum sample size necessary to obtain factor solutions that are adequately stable and that correspond closely to population factors. A fundamental misconception about this issue is that the minimum sample size, or the minimum ratio of sample size to the number of variables, is invariant across studies. In fact, necessary sample size is dependent on several aspects of any given study, including the level of communality of the variables and the level of overdetermination of the factors. The authors present a theoretical and mathematical framework that provides a basis for understanding and predicting these effects. The hypothesized effects are verified by a sampling study using artificial data. Results demonstrate the lack of validity of common rules of thumb and provide a basis for establishing guidelines for sample size in factor analysis.
The Fox News Effect: Media Bias and Voting∗
(2005)

Does media bias affect voting? We address this question by looking at the entry of Fox News in cable markets and its impact on voting. Between October 1996 and November 2000, the conservative Fox News Channel was introduced in the cable programming of 20 percent of US towns. Fox News availability in 2000 appears to be largely idiosyncratic. Using a data set of voting data for 9,256 towns, we investigate if Republicans gained vote share in towns where Fox News entered the cable market by the year 2000. We find a significant effect of the introduction of Fox News on the vote share in Presidential elections between 1996 and 2000. Republicans gain 0.4 to 0.6 percentage points in the towns which broadcast Fox News. The results are robust to town-level controls, district and county fixed effects, and alternative specifications. We also find a significant effect of Fox News on Senate vote share and, to a lesser extent, on voter turnout. Our estimates imply that Fox News convinced 3 to 8 percent of its viewers to vote Republican. The evidence is most consistent with voters suffering from persuasion bias. We also discuss a model of rational voter updating that fits most facts. ∗George Akerlof, Stephen Ansolabehere, Larry M. Bartels, Matthew Gentzkow, Alan Gerber, Jay Hamilton, Alan Krueger, Marco Manacorda, Enrico Moretti, Torsten Persson, Sam Popkin, Riccardo Puglisi, Matthew Rabin, Jesse Shapiro, David Stromberg, and audiences at Bonn University, EUI (Florence), Fuqua, Harvard University, IIES (Stockholm), Princeton University, UC Berkeley, University of Chicago GSB, and the NBER 2005 Political Economy and Labor Studies Meetings provided useful comments. We would like to specially thank Jim Collins and Matthew Gentzkow for providing the Scarborough data. Shawn Bananzadeh, Jessica Chan, Marguerite Converse, Neil Dandavati, Tatyana Deryugina, Monica Deza, Dylan Fox, Melissa Galicia, Calvin Ho, Sudhamas Khanchanawong, Richard Kim, Martin Kohan, Vipul Kumar, Jonathan Leung, Clarice Li, Tze Yang Lim, Ming Mai, Sameer Parekh, Sharmini Radakrishnan, Rohan Relan, Chanda Singh, Matthew Stone, Nan Zhang, Sibo Zhao, and Liya Zhu helped collect the voting and the cable data. Dan Acland, Saurabh Bhargava, Avi Ebenstein, and Devin Pope provided excellent research assistance.
Validation of LiDAR point clouds for classification of high-value crops using geometric-and reflectance-based extraction algorithm
(2017)

This study provides an experimental analysis of high-value crop classification using geometric and reflectance-based feature extraction algorithms which can be used to validate extensive classification. The main goal of this study is to identify the class based on the 3D reconstruction of small scale LiDAR scanner and RGB images. The reference used in this study was obtained from the initially classified classes of Mapua-Phil LiDAR2 Project. In validating high-value crops, the classification results were compared to the results obtained using the reference data. The validation procedures involve comparing the locations of previously classified crops and analyzing the crop cycle in the tested fields. The proposed methodology used to identify specific class based on the geometric feature alone are found to be acceptable with an average accuracy of 92.5% while the reflectance based classification alone provides an average accuracy of 90%.