SoroushVahidi/scidocs huggingface dataset:
An Improved Control Strategy for Grid-Connected Voltage Source Inverters With an LCL Filter
(2008)

A novel current control strategy based on a new current feedback for grid-connected voltage source inverters with an LCL-filter is proposed in this paper. By splitting the capacitor of the LCL-filter into two parts, each with the proportional division of the capacitance, the current flowing between these two parts is measured and used as the feedback to a current regulator to stabilize and improve the system performances. Consequently, the V-1 transfer function of the grid-connected inverter system with the LCL-filter is degraded from a third-order function to a first-order one, therefore the closed-loop current feedback control system can be optimized easily for minimum steady-state error and current harmonic distortion, as well as the system stability. The characteristics of the inverter system with the proposed controller are investigated and compared with those using traditional control strategies. Experimental results are provided, and the new current control strategy has been verified on a 5 kW fuel cell inverter.
A Light Rule-based Approach to English Subject-Verb Agreement Errors on the Third Person Singular Forms
(2015)

Verb errors are one of the most common grammar errors made by non-native writers of English. This work especially focus on an important type of verb usage errors, subject-verb agreement for the third person singular forms, which has a high proportion in errors made by non-native English learners. Existing work has not given a satisfied solution for this task, in which those using supervised learning method usually fail to output good enough performance, and rule-based methods depend on advanced linguistic resources such as syntactic parsers. In this paper, we propose a rule-based method to detect and correct the concerned errors. The proposed method relies on a series of rules to automatically locate subject and predicate in four types of sentences. The evaluation shows that the proposed method gives state-of-the-art performance with quite limited linguistic resources. ∗ Correspondence author † This work was partially supported by the National Natural Science Foundation of China (No. 61170114, and No. 61272248), the National Basic Research Program of China (No. 2013CB329401), the Science and Technology Commission of Shanghai Municipality (No. 13511500200), the European Union Seventh Framework Program (No. 247619), the Cai Yuanpei Program (CSC fund 201304490199 and 201304490171), and the art and science interdiscipline funds of Shanghai Jiao Tong University, No. 14X190040031, and the Key Project of National Society Science Foundation of China, No. 15-ZDA041.
Eyes-Free Barcode Localization and Decoding for Visually Impaired Mobile Phone Users
(2010)

An eyes-free barcode localization and decoding method is presented that enables visually impaired (VI) mobile phone users to decode MSI (Modified Plessy) barcodes on shelves and UPC barcodes on individual boxes, cans, and bottles. Simple and efficient barcode localization and decoding techniques are augmented with an interactive haptic feedback loop that allows the VI user to align the phone’s camera with a fixed surface in the pitch and yaw planes. The method is implemented on a Google Nexus One smart phone running Android 2.1. A laboratory study is presented in which the method was evaluated by one VI and four blindfolded sighted participants.
Text Detection and Character Extraction in Natural Scene Images
(2015)

Detecting text regions in natural scene images has become an important area due to its varies applications. Text Information Extraction (TIE) System involves detecting text regions in a given image, localizing it, extracting the text part and recognizing text using OCR. This work basically concentrates on the detection and extraction of text in natural scene images. In this work, the test image will be preprocessed using RGB to Gray conversion, binarization, Edge Detection method and Geometric based Noise removal method. The features from the pre-processed image are extracted. The extracted features are used by the trained SVM classifier to detect the text regions. After detecting text regions, characters are extracted and finally displayed. Keywords— Text Information Extraction (TIE); Natural Scene Images; Text Detection; Text Extraction; Support Vector Machine (SVM).
Prosody-Based Automatic Segmentation of Speech into Sentences and Topics
(2000)

A crucial step in processing speech audio data for informati onextraction, topicdetection, or browsing/playback is to segment the input into sentence and topic units. Speech segm entation is challenging, since the cues typically present for segmenting text (headers, paragraphs, punctuation) ar e absent in spoken language. We investigate the use of prosody (informationgleaned from the timing and melody of s peech) for these tasks. Using decision tree and hidden Markov modeling techniques, we combine prosodic cues with w ord-based approaches, and evaluate performance on two speech corpora, Broadcast News and Switchboard. Resu lts show that the prosodic model alone performs on par with, or better than, word-based statistical languag e models—for both true and automatically recognized words in news speech. The prosodic model achieves comparabl e performance with significantly less training data, and requires no hand-labeling of prosodic events. Across ta sks nd corpora, we obtain a significant improvement over word-only models using a probabilistic combination of prosodic and lexical information. Inspection reveals that the prosodic models capture language-independent bou dary indicators described in the literature. Finally, cue usage is task and corpus dependent. For example, pause and pi tch features are highly informative for segmenting news speech, whereas pause, duration and word-based cues do minate for natural conversation.
Scalable and Crash-Tolerant Load Balancing Based on Switch Migration for Multiple Open Flow Controllers
(2014)

As the size of networks continues to increase, the scalability of the centralized controller becomes increasingly issues in Software Defined Networking. Distributed controllers have been proposed to solve the problem that the centralized controllers such as NOX and Floodlight suffer from. That logically centralized, but physically distributed architecture divide the network into zones with separate multiple controllers to achieve a better scalability control plane. However, Such distributed architecture introduces a new challenge to the load rebalancing of controllers when uneven load distribution among the controllers due to the statically configured mapping between a switch and a controller. Therefore, under variable traffic conditions in real networks, keeping load balance dynamically among the controller clusters is essential for realizing a high performance and scalability control plane. To address these issues, we propose a dynamic load rebalancing method based on switch migration mechanism for clustered controllers. The multiple controllers use Groups to coordinate actions for switch migration. The whole network is divided into several groups and each group is set up one controller cluster. Our proposed method can dynamically shift the load across the multiple controllers through switch migration. The mechanism support controller failover without switch disconnection avoiding the single point of failure problem. We also implemented a prototype system based on Open Day light Hydrogen controller to evaluated the performance of our design. Our preliminary result shows that the method enables controllers to relieve the overload via switch migration and can improve throughput and reduce the response time of the control plane.
Nature Inspired Methods and Their Industry Applications—Swarm Intelligence Algorithms
(2018)

In this paper, we present the swarm intelligence (SI) concept and mention some metaheuristics belonging to the SI. We present the particle swarm optimization (PSO) algorithm and the ant colony optimization (ACO) method as the representatives of the SI approach. In recent years, researchers are eager to develop and apply a variety of these two methods, despite the development of many other newer methods as Bat or FireFly algorithms. Presenting the PSO and ACO we put their pseudocode, their properties, and intuition lying behind them. Next, we focus on their real-life applications, indicating many papers presented varieties of basic algorithms and the areas of their applications.
LITE Kernel RDMA Support for Datacenter Applications
(2017)

Recently, there is an increasing interest in building data-center applications with RDMA because of its low-latency, high-throughput, and low-CPU-utilization benefits. However, RDMA is not readily suitable for datacenter applications. It lacks a flexible, high-level abstraction; its performance does not scale; and it does not provide resource sharing or flexible protection. Because of these issues, it is difficult to build RDMA-based applications and to exploit RDMA's performance benefits.
 To solve these issues, we built LITE, a Local Indirection TiEr for RDMA in the Linux kernel that virtualizes native RDMA into a flexible, high-level, easy-to-use abstraction and allows applications to safely share resources. Despite the widely-held belief that kernel bypassing is essential to RDMA's low-latency performance, we show that using a kernel-level indirection can achieve both flexibility and low-latency, scalable performance at the same time. To demonstrate the benefits of LITE, we developed several popular datacenter applications on LITE, including a graph engine, a MapReduce system, a Distributed Shared Memory system, and a distributed atomic logging system. These systems are easy to build and deliver good performance. For example, our implementation of PowerGraph uses only 20 lines of LITE code, while outperforming PowerGraph by 3.5x to 5.6x.
Security Enhancements for Mobile Ad Hoc Networks With Trust Management Using Uncertain Reasoning
(2014)

The distinctive features of mobile ad hoc networks (MANETs), including dynamic topology and open wireless medium, may lead to MANETs suffering from many security vulnerabilities. In this paper, using recent advances in uncertain reasoning that originated from the artificial intelligence community, we propose a unified trust management scheme that enhances the security in MANETs. In the proposed trust management scheme, the trust model has two components: trust from direct observation and trust from indirect observation. With direct observation from an observer node, the trust value is derived using Bayesian inference, which is a type of uncertain reasoning when the full probability model can be defined. On the other hand, with indirect observation, which is also called secondhand information that is obtained from neighbor nodes of the observer node, the trust value is derived using the Dempster-Shafer theory (DST), which is another type of uncertain reasoning when the proposition of interest can be derived by an indirect method. By combining these two components in the trust model, we can obtain more accurate trust values of the observed nodes in MANETs. We then evaluate our scheme under the scenario of MANET routing. Extensive simulation results show the effectiveness of the proposed scheme. Specifically, throughput and packet delivery ratio (PDR) can be improved significantly with slightly increased average end-to-end delay and overhead of messages.
Action Observation and Motor Imagery: Innovative Cognitive Tools in the Rehabilitation of Parkinson's Disease
(2015)

Parkinson's disease (PD) is characterized by a progressive impairment of motor skills with deterioration of autonomy in daily living activities. Physiotherapy is regarded as an adjuvant to pharmacological and neurosurgical treatment and may provide small and short-lasting clinical benefits in PD patients. However, the development of innovative rehabilitation approaches with greater long-term efficacy is a major unmet need. Motor imagery (MI) and action observation (AO) have been recently proposed as a promising rehabilitation tool. MI is the ability to imagine a movement without actual performance (or muscle activation). The same cortical-subcortical network active during motor execution is engaged in MI. The physiological basis of AO is represented by the activation of the "mirror neuron system." Both MI and AO are involved in motor learning and can induce improvements of motor performance, possibly mediated by the development of plastic changes in the motor cortex. The review of available evidences indicated that MI ability and AO feasibility are substantially preserved in PD subjects. A few preliminary studies suggested the possibility of using MI and AO as parts of rehabilitation protocols for PD patients.
A Characterization of the Utility of Using Artificial Intelligence to Test Two Artificial Intelligence Systems
(2013)

An artificial intelligence system, designed for operations in a real-world environment faces a nearly infinite set of possible performance scenarios. Designers and developers, thus, face the challenge of validating proper performance across both foreseen and unforeseen conditions, particularly when the artificial intelligence is controlling a robot that will be operating in close proximity, or may represent a danger, to humans. While the manual creation of test cases allows limited testing (perhaps ensuring that a set of foreseeable conditions trigger an appropriate response), this may be insufficient to fully characterize and validate safe system performance. An approach to validating the performance of an artificial intelligence system using a simple artificial intelligence test case producer (AITCP) is presented. The AITCP allows the creation and simulation of prospective operating scenarios at a rate far exceeding that possible by human testers. Four scenarios for testing an autonomous navigation control system are presented: single actor in two-dimensional space, multiple actors in two-dimensional space, single actor in three-dimensional space, and multiple actors in three-dimensional space. The utility of using the AITCP is compared to that of human testers in each of these scenarios.
The game, the player, the world: looking for a heart of gameness
(2003)

This paper proposes a definition of games. I describe the classic game model, a list of six features that are necessary and sufficient for something to be a game. The definition shows games to be transmedial: There is no single game medium, but rather a number of game media, each with its own strengths. The computer is simply the latest game medium to emerge. While computer games 1 are therefore part of the broader area of games, they have in many cases evolved beyond the classic game model.
Homotopic path validation using non-holonomic differential drive robot model
(2017)

In this paper the tracking of collision-free path obtained by using Homotopic Path Planning Method (HPPM) with automatic value assignation of repulsion parameter is presented. This work is center on show the utility of this method to obtain a collision free path for maps with narrow corridors on indoor environments. First, the basis of homotopic path planning method with automatic value assignation of repulsion parameter are explained. Second, the Pure-Pursuit controller is brief explained. Third, the capability of the HPPM is shown by using two experiments that which contain narrow passages and several circular obstacles. Finally, in order to validate the solution paths, a tracking on Robot Operating System by using 3P-DX robot model and on MATLAB using a Pure-Pursuit controller from the Robotics Toolbox is performed.
Accelerated Inexact Soft-Impute for Fast Large-Scale Matrix Completion
(2015)

A 3 AIS-Impute (proposed algorithm). Require: 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.
Multi-Instance Multi-Label Learning with Weak Label
(2013)

Multi-Instance Multi-Label learning (MIML) deals with data objects that are represented by a bag of instances and associated with a set of class labels simultaneously. Previous studies typically assume that for every training example, all positive labels are tagged whereas the untagged labels are all negative. In many real applications such as image annotation, however, the learning problem often suffers from weak label; that is, users usually tag only a part of positive labels, and the untagged labels are not necessarily negative. In this paper, we propose the MIMLwel approach which works by assuming that highly relevant labels share some common instances, and the underlying class means of bags for each label are with a large margin. Experiments validate the effectiveness of MIMLwel in handling the weak label problem.
Why the sunny side is up: association between affect and vertical position.
(2004)

Metaphors linking spatial location and affect (e.g., feeling up or down) may have subtle, but pervasive, effects on evaluation. In three studies, participants evaluated words presented on a computer. In Study 1, evaluations of positive words were faster when words were in the up rather than the down position, whereas evaluations of negative words were faster when words were in the down rather than the up position. In Study 2, positive evaluations activated higher areas of visual space, whereas negative evaluations activated lower areas of visual space. Study 3 revealed that, although evaluations activate areas of visual space, spatial positions do not activate evaluations. The studies suggest that affect has a surprisingly physical basis.
A high-precision time-to-digital converter for pulsed time-of-flight laser radar applications
(1998)

A time-to-digital converter (TDC) has been designed, and six units have been constructed and tested. It consists of integrated digital time-interval measurement electronics with a 10-ns resolution that can be improved to 10 ps by an analog interpolation method. Identical construction of the interpolation electronics leads to stable performance of the TDC. The drifts of all six TDC units remain within 10 ps over a temperature range from 10 C to+50 C. The stability can be improved further by a real-time calibration procedure developed here. The single-shot precision of the TDC is better than 15 ps (standard deviation), but precision can be improved to below 0.1 ps by averaging about 10 000 measurements at the maximum measurement speed of 100 kHz. The time range of the TDC is currently 2.55 s, but this can be increased by adding an external digital counter. The TDC suffers from a periodic nonlinearity over the measured time range from 0 to 1.3 s, the amplitude and period of the nonlinearity being 20 ps and 40 ns, respectively. The reason lies in the integrated digital part of the electronics. The linearity of interpolation in the 10-ns time range improves, however, as more results are averaged.
Towards a better understanding of Vector Quantized Autoencoders
(2018)

Deep neural networks with discrete latent variables offer the promise of better symbolic reasoning, and learning abstractions that are more useful to new tasks. There has been a surge in interest in discrete latent variable models, however, despite several recent improvements, the training of discrete latent variable models has remained challenging and their performance has mostly failed to match their continuous counterparts. Recent work on vector quantized autoencoders (VQ-VAE) has made substantial progress in this direction, with its perplexity almost matching that of a VAE on datasets such as CIFAR-10. In this work, we investigate an alternate training technique for VQ-VAE, inspired by its connection to the Expectation Maximization (EM) algorithm. Training the discrete bottleneck with EM helps us achieve better image reconstruction results on SVHN together with knowledge distillation, allows us to develop a non-autoregressive machine translation model whose accuracy almost matches a strong greedy autoregressive baseline Transformer, while being 3.3 times faster at inference.
Automatic detection of player's identity in soccer videos using faces and text cues
(2006)

In soccer videos, most significant actions are usually followed by close--up shots of players that take part in the action itself. Automatically annotating the identity of the players present in these shots would be considerably valuable for indexing and retrieval applications. Due to high variations in pose and illumination across shots however, current face recognition methods are not suitable for this task. We show how the inherent multiple media structure of soccer videos can be exploited to understand the players' identity without relying on direct face recognition. The proposed method is based on a combination of interest point detector to "read" textual cues that allow to label a player with its name, such as the number depicted on its jersey, or the superimposed text caption showing its name. Players not identified by this process are then assigned to one of the labeled faces by means of a face similarity measure, again based on the appearance of local salient patches. We present results obtained from soccer videos taken from various recent games between national teams.
Deep neural networks employing Multi-Task Learning and stacked bottleneck features for speech synthesis
(2015)

Deep neural networks (DNNs) use a cascade of hidden representations to enable the learning of complex mappings from input to output features. They are able to learn the complex mapping from text-based linguistic features to speech acoustic features, and so perform text-to-speech synthesis. Recent results suggest that DNNs can produce more natural synthetic speech than conventional HMM-based statistical parametric systems. In this paper, we show that the hidden representation used within a DNN can be improved through the use of Multi-Task Learning, and that stacking multiple frames of hidden layer activations (stacked bottleneck features) also leads to improvements. Experimental results confirmed the effectiveness of the proposed methods, and in listening tests we find that stacked bottleneck features in particular offer a significant improvement over both a baseline DNN and a benchmark HMM system.
Restructuring speech representations using a pitch-adaptive time-frequency smoothing and an instantaneous-frequency-based F0 extraction: Possible role of a repetitive structure in sounds
(1999)

A set of simple new procedures has been developed to enable the real-time manipulation of speech parameters. The proposed method uses pitch-adaptive spectral analysis combined with a surface reconstruction method in the time± frequency region. The method also consists of a fundamental frequency (F0) extraction using instantaneous frequency calculation based on a new concept called `fundamentalness'. The proposed procedures preserve the details of time± frequency surfaces while almost perfectly removing ®ne structures due to signal periodicity. This close-to-perfect elimination of interferences and smooth F0 trajectory allow for over 600% manipulation of such speech parameters as pitch, vocal tract length, and speaking rate, while maintaining high reproductive quality. Ó 1999 Elsevier Science B.V. All rights reserved.