SoroushVahidi/scidocs huggingface dataset:
A Multimodal, Full-Surround Vehicular Testbed for Naturalistic Studies and Benchmarking: Design, Calibration and Deployment
(2017)

Recent progress in autonomous and semiautonomous driving has been made possible in part through an assortment of sensors that provide the intelligent agent with an enhanced perception of its surroundings. It has been clear for quite some while now that for intelligent vehicles to function effectively in all situations and conditions, a fusion of different sensor technologies is essential. Consequently, the availability of synchronized multi-sensory data streams are necessary to promote the development of fusion based algorithms for low, mid and high level semantic tasks. In this paper, we provide a comprehensive description of our heavily sensorized, panoramic testbed capable of providing high quality data from a slew of synchronized and calibrated sensors such as cameras, LIDARs, radars, and the IMU/GPS. The vehicle has recorded over 100 hours of real world data for a very diverse set of weather, traffic and daylight conditions. All captured data is accurately calibrated and synchronized using timestamps, and stored safely in high performance servers mounted inside the vehicle itself. Details on the testbed instrumentation, sensor layout, sensor outputs, calibration and synchronization are described in this paper.
Prototypical Networks for Few-shot Learning
(2017)

We propose Prototypical Networks for the problem of few-shot classification, where a classifier must generalize to new classes not seen in the training set, given only a small number of examples of each new class. Prototypical Networks learn a metric space in which classification can be performed by computing distances to prototype representations of each class. Compared to recent approaches for few-shot learning, they reflect a simpler inductive bias that is beneficial in this limited-data regime, and achieve excellent results. We provide an analysis showing that some simple design decisions can yield substantial improvements over recent approaches involving complicated architectural choices and meta-learning. We further extend Prototypical Networks to zero-shot learning and achieve state-ofthe-art results on the CU-Birds dataset.
Decoding of EEG Signals Using Deep Long Short-Term Memory Network in Face Recognition Task
(2018)

The paper proposes a novel approach to classify the human memory response involved in the face recognition task by the utilization of event related potentials. Electroencephalographic signals are acquired when a subject engages himself/herself in familiar or unfamiliar face recognition tasks. The signals are analyzed through source Iocalization using eLORETA and artifact removal by ICA from a set of channels corresponding to those selected sources, with an ultimate aim to classify the EEG responses of familiar and unfamiliar faces. The EEG responses of the two different classes (familiar and unfamiliar face recognition)are distinguished by analyzing the Event Related Potential signals that reveal the existence of large N250 and P600 signals during familiar face recognition.The paper introduces a novel LSTM classifier network which is designed to classify the ERP signals to fulfill the prime objective of this work. The first layer of the novel LSTM network evaluates the spatial and local temporal correlations between the obtained samples of local EEG time-windows. The second layer of this network models the temporal correlations between the time-windows. An attention mechanism has been introduced in each layer of the proposed model to compute the contribution of each EEG time-window in face recognition task. Performance analysis reveals that the proposed LSTM classifier with attention mechanism outperforms the efficiency of the conventional LSTM and other classifiers with a significantly large margin. Moreover, source Iocalization using eLORETA shows the involvement of inferior temporal and frontal lobes during familiar face recognition and pre-frontal lobe during unfamiliar face recognition. Thus, the present research outcome can be used in criminal investigation, where meticulous differentiation of familiar and unfamiliar face detection by criminals can be performed from their acquired brain responses.
Algorithmic Prediction of Health-Care Costs
(2008)

The rising cost of health care is one of the world’s most important problems. Accordingly, predicting such costs with accuracy is a significant first step in addressing this problem. Since the 1980s, there has been research on the predictive modeling of medical costs based on (health insurance) claims data using heuristic rules and regression methods. These methods, however, have not been appropriately validated using populations that the methods have not seen. We utilize modern data-mining methods, specifically classification trees and clustering algorithms, along with claims data from over 800,000 insured individuals over three years, to provide rigorously validated predictions of health-care costs in the third year, based on medical and cost data from the first two years. We quantify the accuracy of our predictions using unseen (out-of-sample) data from over 200,000 members. The key findings are: (a) our data-mining methods provide accurate predictions of medical costs and represent a powerful tool for prediction of health-care costs, (b) the pattern of past cost data is a strong predictor of future costs, and (c) medical information only contributes to accurate prediction of medical costs of high-cost members.
Extensive Benchmark and Survey of Modeling Methods for Scene Background Initialization
(2017)

Scene background initialization is the process by which a method tries to recover the background image of a video without foreground objects in it. Having a clear understanding about which approach is more robust and/or more suited to a given scenario is of great interest to many end users or practitioners. The aim of this paper is to provide an extensive survey of scene background initialization methods as well as a novel benchmarking framework. The proposed framework involves several evaluation metrics and state-of-the-art methods, as well as the largest video data set ever made for this purpose. The data set consists of several camera-captured videos that: 1) span categories focused on various background initialization challenges; 2) are obtained with different cameras of different lengths, frame rates, spatial resolutions, lighting conditions, and levels of compression; and 3) contain indoor and outdoor scenes. The wide variety of our data set prevents our analysis from favoring a certain family of background initialization methods over others. Our evaluation framework allows us to quantitatively identify solved and unsolved issues related to scene background initialization. We also identify scenarios for which state-of-the-art methods systematically fail.
Revising Perceptual Linear Prediction (PLP)
(2005)

Mel Frequency Cepstral Coefficients (MFCC) and Perceptual Linear Prediction (PLP) are the most popular acoustic features used in speech recognition. Often it depends on the task, which of the two methods leads to a better performance. In this work we develop acoustic features that combine the advantages of MFCC and PLP. Based on the observation that the techniques have many similarities, we revise the processing steps of PLP. In particular, the filter-bank, the equal-loudness pre-emphasis and the input for the linear prediction are improved. It is shown for a broadcast news transcription task and a corpus of children’s speech that the new variant of PLP performs better than both MFCC and conventional PLP for a wide range of clean and noisy acoustic conditions.
Multi-speaker modeling and speaker adaptation for DNN-based TTS synthesis
(2015)

In DNN-based TTS synthesis, DNNs hidden layers can be viewed as deep transformation for linguistic features and the output layers as representation of acoustic space to regress the transformed linguistic features to acoustic parameters. The deep-layered architectures of DNN can not only represent highly-complex transformation compactly, but also take advantage of huge amount of training data. In this paper, we propose an approach to model multiple speakers TTS with a general DNN, where the same hidden layers are shared among different speakers while the output layers are composed of speaker-dependent nodes explaining the target of each speaker. The experimental results show that our approach can significantly improve the quality of synthesized speech objectively and subjectively, comparing with speech synthesized from the individual, speaker-dependent DNN-based TTS. We further transfer the hidden layers for a new speaker with limited training data and the resultant synthesized speech of the new speaker can also achieve a good quality in term of naturalness and speaker similarity.
Classroom Response Systems: A Review of the Literature.
(2006)

As the frequency with which Classroom Response Systems (CRSs) are used is increasing, it becomes more and more important to define the affordances and limitations of these tools. Currently existing literature is largely either anecdotal or focuses on comparing CRS and non-CRS environments that are unequal in other aspects as well. In addition, the literature primarily describes situations in which the CRS is used to provide an individual as opposed to a group response. This article points to the need for a concerted research effort, one that rigorously explores conditions of use across diverse settings and pedagogies.
An energy-efficient dual sampling SAR ADC with reduced capacitive DAC
(2009)

This paper presents an energy-efficient SAR ADC which adopts reduced MSB cycling step with dual sampling of the analog signal. By sampling and holding the analog signal asymmetrically at both input sides of comparator, the MSB cycling step can be hidden by hold mode. Benefits from this technique, not only the total capacitance of DAC is reduced by half, but also the average switching energy is reduced by 68% compared with conventional SAR ADC. Moreover, switching energy distribution is more uniform over entire output code compared with previous works.
The impact of pretend play on children's development: a review of the evidence.
(2013)

Pretend play has been claimed to be crucial to children's healthy development. Here we examine evidence for this position versus 2 alternatives: Pretend play is 1 of many routes to positive developments (equifinality), and pretend play is an epiphenomenon of other factors that drive development. Evidence from several domains is considered. For language, narrative, and emotion regulation, the research conducted to date is consistent with all 3 positions but insufficient to draw conclusions. For executive function and social skills, existing research leans against the crucial causal position but is insufficient to differentiate the other 2. For reasoning, equifinality is definitely supported, ruling out a crucially causal position but still leaving open the possibility that pretend play is epiphenomenal. For problem solving, there is no compelling evidence that pretend play helps or is even a correlate. For creativity, intelligence, conservation, and theory of mind, inconsistent correlational results from sound studies and nonreplication with masked experimenters are problematic for a causal position, and some good studies favor an epiphenomenon position in which child, adult, and environment characteristics that go along with play are the true causal agents. We end by considering epiphenomenalism more deeply and discussing implications for preschool settings and further research in this domain. Our take-away message is that existing evidence does not support strong causal claims about the unique importance of pretend play for development and that much more and better research is essential for clarifying its possible role.
Adversarial Examples: Attacks on Machine Learning-based Malware Visualization Detection Methods
(2018)

As the threat of malicious software (malware) becomes urgently serious, automatic malware detection techniques have received increasing attention recently, where the machine learning (ML)-based visualization detection plays a significant role. However, this leads to a fundamental problem whether such detection methods can be robust enough against various potential attacks. Even though ML algorithms show superiority to conventional ones in malware detection in terms of high efficiency and accuracy, this paper demonstrates that such ML-based malware detection methods are vulnerable to adversarial examples (AE) attacks. We propose the first AE-based attack framework, named Adversarial Texture Malware Perturbation Attacks (ATMPA), based on the gradient descent or L-norm optimization method. By introducing tiny perturbations on the transformed dataset, ML-based malware detection methods completely fail. The experimental results on the MS BIG malware dataset show that a small interference can reduce the detection rate of convolutional neural network (CNN), support vector machine (SVM) and random forest(RF)-based malware detectors down to 0 and the attack transferability can achieve up to 88.7% and 74.1% on average in different ML-based detection methods.
Block Chain based Searchable Symmetric Encryption
(2017)

The mechanism for traditional Searchable Symmetric Encryption is pay-then-use. That is to say, if a user wants to search some documents that contain special keywords, he needs to pay to the server firstly, then he can enjoy search service. Under this situation, these kinds of things will happen: After the user paying the service fees, the server may either disappear because of the poor management or returning nothing. As a result, the money that the user paid cannot be brought back quickly. Another case is that the server may return incorrect document sets to the user in order to save his own cost. Once such events happen, it needs the arbitration institution to mediate which will cost a long time. Besides, to settle the disputes the user has to pay to the arbitration institution. Ideally, we deeply hope that when the user realizes the server has a tendency to cheat in the task of searching, he can immediately and automatically withdraw his money to safeguard his right. However, the existing SSE protocols cannot satisfy this demand. To solve this dilemma, we find a compromised method by introducing the block chain into SSE. Our scheme achieves three goals stated below. Firstly, when the server does not return any thing to user after he gets the search token, the user can get some compensation from the server, because the server can infer some important information from the Index and this token. Besides, the user also doesn’t pay the service charge. Secondly, if the documents that the server returns are false, the server cannot receive service fees, meanwhile, he will be punished. Lastly, when the user receives some bitcoin from server at the beginning, he may terminate the protocol. Under this situation, the server is a victim. In order to prevent such thing from happening, the server will broadcast a transaction to redeem his pledge after an appointed time. ∗Corresponding author Email addresses: tianhb@mail.sysu.edu.cn (Haibo Tian), isszhfg@mail.sysu.edu.cn (Fangguo Zhang ) Preprint submitted to Elsevier April 26, 2017
Ionospheric Time-Delay Algorithm for Single-Frequency GPS Users
(1987)

The goal in designing an ionospheric time-delay correctionalgorithm for the single-frequency global positioning system userwas to include the main features of the complex behavior of theionosphere, yet require a minimum of coefficients and usercomputational time, while still yielding an rms correction of at least50 percent. The algorithm designed for this purpose, andimplemented in the GPS satellites, requires only eight coefficientssent as part of the satellite message, contains numerousapproximations designed to reduce user computationalrequirements, yet preserves the essential elements required to obtaingroup delay values along multiple satellite viewing directions.
Weighted Similarity Schemes for High Scalability in User-Based Collaborative Filtering
(2015)

Similarity-based algorithms, often referred to as memory-based collaborative filtering techniques, are one of the most successful methods in recommendation systems. When explicit ratings are available, similarity is usually defined using similarity functions, such as the Pearson correlation coefficient, cosine similarity or mean square difference. These metrics assume similarity is a symmetric criterion. Therefore, two users have equal impact on each other in recommending new items. In this paper, we introduce new weighting schemes that allow us to consider new features in finding similarities between users. These weighting schemes, first, transform symmetric similarity to asymmetric similarity by considering the number of ratings given by users on non-common items. Second, they take into account the habit effects of users are regarded on rating items by measuring the proximity of the number of repetitions for each rate on common rated items. Experiments on two datasets were implemented and compared to other similarity measures. The results show that adding weighted schemes to traditional similarity measures These authors contributed equally to this work as the first author. P. Pirasteh · D. Hwang Department of Computer Engineering, Yeungnam University, Gyeongsan, Republic of Korea P. Pirasteh e-mail: parivash63@gmail.com D. Hwang e-mail: dosamhwang@gmail.com J. E. Jung ( ) Department of Computer Engineering, Chung-Ang University, Seoul, Republic of Korea e-mail: ontology.society@gmail.com significantly improve the results obtained from traditional similarity measures.
Optimization tool for direct water cooling system of high power IGBT modules
(2016)

Thermal management of power electronic devices is essential for reliable system performance especially at high power levels. Since even the most efficient electronic circuit becomes hot because of ohmic losses, it is clear that cooling is needed in electronics and even more as the power increases. One of the most important activities in the thermal management and reliability improvement is the cooling system design. As industries are developing smaller power devices with higher power densities, optimized design of cooling systems with minimum thermal resistance and pressure drop become important issue for thermal design engineers. This paper aims to present a user friendly optimization tool for direct water cooling system of a high power module which enables the cooling system designer to identify the optimized solution depending on customer load profiles and available pump power. CFD simulations are implemented to find best solution for each scenario.
BER Analysis of MIMO-OFDM System using Alamouti STBC and MRC Diversity Scheme over Rayleigh Multipath Channel
(2013)

Commons Attribution-Noncommercial 3.0 Unported License http://creativecommons.org/licenses/by-nc/3.0/), permitting all non commercial use, distribution, and reproduction in any medium, provided the original work is properly cited. Global Journal of Researches in Engineering Electrical and Electronics Engineering Volume 13 Issue 13 Version 1.0 Year 2013 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN: 2249-4596 & Print ISSN: 0975-5861
A passivity based Cartesian impedance controller for flexible joint robots - part I: torque feedback and gravity compensation
(2004)

In this paper a novel approach to the Cartesian impedance control problem for robots with flexible joints is presented. The proposed controller structure is based on simple physical considerations, which are motivating the extension of classical position feedback by an additional feedback of the joint torques. The torque feedback action can be interpreted as a scaling of the apparent motor inertia. Furthermore the problem of gravity compensation is addressed. Finally, it is shown that the closed loop system can be seen as a feedback interconnection of passive systems. Based on this passivity property a proof of asymptotic stability is presented.
A unified approach for motion and force control of robot manipulators: The operational space formulation
(1987)

A framework for the analysis and control of manipulator systems with respect to the dynamic behavior of their end-effectors is developed. First, issues related to the description of end-effector tasks that involve constrained motion and active force control are discussed. The fundamentals of the operational space formulation are then presented, and the unified approach for motion and force control is developed. The extension of this formulation to redundant manipulator systems is also presented, constructing the end-effector equations of motion and describing their behavior with respect to joint forces. These results are used in the development of a new and systematic approach for dealing with the problems arising at kinematic singularities. At a singular configuration, the manipulator is treated as a mechanism that is redundant with respect to the motion of the end-effector in the subspace of operational space orthogonal to the singular direction.
A passivity based Cartesian impedance controller for flexible joint robots - part II: full state feedback, impedance design and experiments
(2004)

The paper presents a Cartesian impedance controller for flexible joint robots based on the feedback of the complete state of the system, namely the motor position, the joint torque and their derivatives. The approach is applied to a quite general robot model, in which also a damping element is considered in parallel to the joint stiffness. Since passivity and asymptotic stability of the controller hold also for varying damping matrices, some possibilities of designing those gain matrices (depending on the actual inertia matrix) are addressed. The passivity of the controller relies on the usage of only motor side measurements for the position feedback. A method is introduced, which provides the exact desired link side stiffness based on this motor position information. Experimental results are validating the proposed controller.
On a New Generation of Torque Controlled Light-Weight Robots
(2001)

The paper describes the recent design and development efforts in DLR ́s robotics lab towards the second generation of light-weight robots. The design of the lightweight mechanics, integrated sensors and electronics is outlined. The fully sensorized joint, with motor and link position sensors as well as joint torque sensors enables the implementation of effective vibration damping and advanced control strategies for compliant manipulation. The mechatronic approach incorporates a tight collaboration between mechanics, electronics and controller design as well. Thus we hope, that important steps towards a new generation of service and personal robots have been achieved.
Compact Zigzag-Shaped-Slit Microstrip Antenna With Circular Defected Ground Structure for Wireless Applications
(2015)

In this letter, a compact zigzag-shaped-slit rectangular microstrip patch antenna with circular defected ground structure (DGS) is designed for wireless applications. The probe-fed antenna consisting of a zigzag-shaped slit, dual T-shaped slits on either sides of a rectangular patch, and circular dumbbell-shaped defected ground plane is optimized. The antenna was able to generate three separate resonances to cover both the 2.45/5.28-GHz WLAN bands and the 3.5-GHz WiMAX bands while maintaining a small overall size of 40 ×28 ×3.175 mm3. The return-loss impedance bandwidth values are enhanced significantly for three resonant frequencies. The designed antenna is characterized with better radiation patterns and potentially stable gain around 4-6 dBi over the working bands. Good agreement was obtained between measurements and simulations.