SoroushVahidi/scidocs huggingface dataset:
Walking > Walking-in-Place > Flying, in Virtual Environments
(1999)

A study by Slater, et al., [1995] indicated that naive subjects in an immersive virtual environment experience a higher subjective sense of presence when they locomote by walking-in-place (virtual walking) than when they push-button-fly (along the floor plane). We replicated their study, adding real walking as a third condition. Our study confirmed their findings. We also found that real walking is significantly better than both virtual walking and flying in ease (simplicity, straightforwardness, naturalness) as a mode of locomotion. The greatest difference in subjective presence was between flyers and both kinds of walkers. In addition, subjective presence was higher for real walkers than virtual walkers, but the difference was statistically significant only in some models. Follow-on studies show virtual walking can be substantially improved by detecting footfalls with a head accelerometer. As in the Slater study, subjective presence significantly correlated with subjects’ degree of association with their virtual bodies (avatars). This, our strongest statistical result, suggests that substantial potential presence gains can be had from tracking all limbs and customizing avatar appearance. An unexpected by-product was that real walking through our enhanced version of Slater’s visual-cliff virtual environment (Figure 1) yielded a strikingly compelling virtual experience—the strongest we and most of our visitors have yet experienced. The most needed system improvement is the substitution of wireless technology for all links to the user. CR
NL2KB: Resolving Vocabulary Gap between Natural Language and Knowledge Base in Knowledge Base Construction and Retrieval
(2016)

Words to express relations in natural language (NL) statements may be different from those to represen t properties in knowledge bases (KB). The vocabulary g p becomes barriers for knowledge base construction and retrieval. With the demo system called NL2KB in this paper, users can browse which properties in KB side may be mapped to for a given relati onal pattern in NL side. Besides, they can retrieve the sets of relational patterns in NL side for a given property in KB side. We describe how the mapping is established in detail. Although the mined patterns are used for Chinese knowledge base applications, t he methodology can be extended to other languages.
Building a Web-Scale Dependency-Parsed Corpus from CommonCrawl
(2017)

We present DEPCC, the largest-to-date linguistically analyzed corpus in English including 365 million documents, composed of 252 billion tokens and 7.5 billion of named entity occurrences in 14.3 billion sentences from a web-scale crawl of the COMMON CRAWL project. The sentences are processed with a dependency parser and with a named entity tagger and contain provenance information, enabling various applications ranging from training syntax-based word embeddings to open information extraction and question answering. We built an index of all sentences and their linguistic meta-data enabling quick search across the corpus. We demonstrate the utility of this corpus on the verb similarity task by showing that a distributional model trained on our corpus yields better results than models trained on smaller corpora, like Wikipedia. This distributional model outperforms the state of art models of verb similarity trained on smaller corpora on the SimVerb3500 dataset.
Universal Blind Quantum Computation
(2009)

We present a protocol which allows a client to have a server carry out a quantum computation for her such that the client's inputs, outputs and computation remain perfectly private, and where she does not require any quantum computational power or memory. The client only needs to be able to prepare single qubits randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. Our protocol is interactive: after the initial preparation of quantum states, the client and server use two-way classical communication which enables the client to drive the computation, giving single-qubit measurement instructions to the server, depending on previous measurement outcomes. Our protocol works for inputs and outputs that are either classical or quantum. We give an authentication protocol that allows the client to detect an interfering server; our scheme can also be made fault-tolerant. We also generalize our result to the setting of a purely classical client who communicates classically with two non-communicating entangled servers, in order to perform a blind quantum computation. By incorporating the authentication protocol, we show that any problem in BQP has an entangled two-prover interactive proof with a purely classical verifier. Our protocol is the first universal scheme which detects a cheating server, as well as the first protocol which does not require any quantum computation whatsoever on the client's side. The novelty of our approach is in using the unique features of measurement-based quantum computing which allows us to clearly distinguish between the quantum and classical aspects of a quantum computation.
The evolution to 4G cellular systems: LTE-Advanced
(2010)

This paper provides an in-depth view on the technologies being considered for Long Term Evolution-Advanced (LTE-Advanced). First, the evolution from third generation (3G) to fourth generation (4G) is described in terms of performance requirements and main characteristics. The new network architecture developed by the Third Generation Partnership Project (3GPP), which supports the integration of current and future radio access technologies, is highlighted. Then, the main technologies for LTE-Advanced are explained, together with possible improvements, their associated challenges, and some approaches that have been considered to tackle those challenges.
MRR: an unsupervised algorithm to rank reviews by relevance
(2017)

The automatic detection of relevant reviews plays a major role in tasks such as opinion summarization, opinion-based recommendation, and opinion retrieval. Supervised approaches for ranking reviews by relevance rely on the existence of a significant, domain-dependent training data set. In this work, we propose MRR (Most Relevant Reviews), a new unsupervised algorithm that identifies relevant revisions based on the concept of graph centrality. The intuition behind MRR is that central reviews highlight aspects of a product that many other reviews frequently mention, with similar opinions, as expressed in terms of ratings. MRR constructs a graph where nodes represent reviews, which are connected by edges when a minimum similarity between a pair of reviews is observed, and then employs PageRank to compute the centrality. The minimum similarity is graph-specific, and takes into account how reviews are written in specific domains. The similarity function does not require extensive pre-processing, thus reducing the computational cost. Using reviews from books and electronics products, our approach has outperformed the two unsupervised baselines and shown a comparable performance with two supervised regression models in a specific setting. MRR has also achieved a significantly superior run-time performance in a comparison with the unsupervised baselines.
A generalized uncertainty principle and sparse representation in pairs of bases
(2002)

An elementary proof of a basic uncertainty principle concerning pairs of representations of RN vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pairs of orthonormal bases as overcomplete dictionaries. The main contribution in this paper is the improvement of an important result due to Donoho and Huo concerning the replacement of the l0 optimization problem by a linear programming minimization when searching for the unique sparse representation.
Happiness unpacked: positive emotions increase life satisfaction by building resilience.
(2009)

Happiness-a composite of life satisfaction, coping resources, and positive emotions-predicts desirable life outcomes in many domains. The broaden-and-build theory suggests that this is because positive emotions help people build lasting resources. To test this hypothesis, the authors measured emotions daily for 1 month in a sample of students (N = 86) and assessed life satisfaction and trait resilience at the beginning and end of the month. Positive emotions predicted increases in both resilience and life satisfaction. Negative emotions had weak or null effects and did not interfere with the benefits of positive emotions. Positive emotions also mediated the relation between baseline and final resilience, but life satisfaction did not. This suggests that it is in-the-moment positive emotions, and not more general positive evaluations of one's life, that form the link between happiness and desirable life outcomes. Change in resilience mediated the relation between positive emotions and increased life satisfaction, suggesting that happy people become more satisfied not simply because they feel better but because they develop resources for living well.
Interpretable Learning for Self-Driving Cars by Visualizing Causal Attention
(2017)

Deep neural perception and control networks are likely to be a key component of self-driving vehicles. These models need to be explainable - they should provide easy-tointerpret rationales for their behavior - so that passengers, insurance companies, law enforcement, developers etc., can understand what triggered a particular behavior. Here we explore the use of visual explanations. These explanations take the form of real-time highlighted regions of an image that causally influence the network’s output (steering control). Our approach is two-stage. In the first stage, we use a visual attention model to train a convolution network endto- end from images to steering angle. The attention model highlights image regions that potentially influence the network’s output. Some of these are true influences, but some are spurious. We then apply a causal filtering step to determine which input regions actually influence the output. This produces more succinct visual explanations and more accurately exposes the network’s behavior. We demonstrate the effectiveness of our model on three datasets totaling 16 hours of driving. We first show that training with attention does not degrade the performance of the end-to-end network. Then we show that the network causally cues on a variety of features that are used by humans while driving.
An exploratory study of backtracking strategies used by developers
(2012)

Developers frequently backtrack while coding. They go back to an earlier state by removing inserted code or by restoring removed code for various reasons. However, little is known about when and how the developers backtrack, and modern IDEs do not provide much assistance for backtracking. As a first step towards gathering baseline knowledge about backtracking and designing more robust backtracking assistance tools in modern IDEs, we conducted an exploratory study with 12 professional developers and a follow-up online survey. Our study revealed several barriers they faced while backtracking. Subjects often manually commented and uncommented code, and often had difficulty finding relevant parts to backtrack. Backtracking was reported to be needed by 3/4 of the developers at least "sometimes".
Animal-assisted therapy and loneliness in nursing homes: use of robotic versus living dogs.
(2008)

Loneliness is a common problem in long-term care facilities (LTCF) and previous work has shown that animal-assisted therapy (AAT) can to some degree reverse loneliness. Here, we compared the ability of a living dog (Dog) and a robotic dog (AIBO) to treat loneliness in elderly patients living in LTCF. In comparison with a control group not receiving AAT, both the Dog and AIBO groups had statistically significant improvements in their levels of loneliness. As measured by a modified Lexington Attachment to Pets Scale (MLAPS), residents showed high levels of attachment to both the dog and AIBO. Subscale analysis showed that the AIBO group scored lower than the living dog on "animal rights/animal welfare" but not on "general attachment" or "people substituting." However, MLAPS measures did not correlate with changes in loneliness, showing that attachment was not the mechanism by which AAT decreases loneliness. We conclude that interactive robotic dogs can reduce loneliness in residents of LTCF and that residents become attached to these robots. However, level of attachment does not explain the decrease in loneliness associated with AAT conducted with either a living or robotic dog.
Modelling and Simulation of Four Quadrant Operation of Three Phase Brushless DC Motor With Hysteresis Current
(2013)

Brushless DC (BLDC) motor drives are becoming more popular in industrial, traction applications. This makes the control of BLDC motor in all the four quadrants very vitalThe motor is operated in four steady state operating modes of torque-speed plane. To control a BLDC machine it is generally required to measure the speed and position of rotor by using the sensor because the inverter phases, acting at any time, must be commutated depending on the rotor position. Simulation of the proposed model was done using MATLAB/ SIMULINK.
3D Soft Tissue Analysis – Part 1: Sagittal Parameters
(2010)

The aim of this study was to develop a reliable threedimensional (3D) analysis of facial soft tissues. We determined the mean sagittal 3D values and relationships between sagittal skeletal parameters, and digitally recorded 3D soft tissue parameters. A total of 100 adult patients (nª = 53, nº = 47) of Caucasian ethnic origin were included in this study. Patients with syndromes, cleft lip and palate, noticeable asymmetry or anomalies in the number of teeth were excluded. Arithmetic means for seven sagittal 3D soft tissue parameters were calculated. The parameters were analyzed biometrically in terms of their reliability and gender-specific differences. The 3D soft tissue values were further analyzed for any correlations with sagittal cephalometric values. Reproducible 3D mean values were defined for 3D soft tissue parameters. We detected gender-specific differences among the parameters. Correlations between the sagittal 3D soft tissue and cephalometric measurements were statistically significant. 3D soft tissue analysis provides additional information on the sagittal position of the jaw bases and on intermaxillary sagittal relations. Further studies are needed to integrate 3D soft tissue analysis in future treatment planning and assessment as a supportive diagnostic tool. Ziel dieser Untersuchung war die Entwicklung einer reliablen dreidimensionalen (3D) Analyse der Gesichtsweichteile. Es sollten sagittale 3D-Durchschnittswerte bestimmt werden und Beziehungen zwischen sagittalen skelettalen Parametern und digital erfassten 3D-Weichteilparametern dargestellt werden. In die Studie eingeschlossen wurden 100 erwachsene Patienten (nª = 53, nº = 47) kaukasischer Herkunft. Ausgeschlossen wurden Patienten mit Syndromen, LKGSSpalten, auffälligen Asymmetrien oder Anomalien der Zahnzahl. Es wurden arithmetische Mittelwerte für sieben sagittale 3DWeichteilparameter ermittelt. Die Parameter wurden biometrisch hinsichtlich ihrer Reliabilität und geschlechtsspezifischer Unterschiede analysiert. Des Weiteren wurden die 3D-Weichteilwerte bezüglich bestehender Korrelationen zu sagittalen kephalometrischen Werten untersucht. Für die 3D-Weichteilparameter konnten reproduzierbare 3D-Durchschnittswerte definiert werden. Innerhalb der Parameter ließen sich geschlechtsspezifische Unterschiede feststellen. Die Korrelationen zwischen den sagittalen 3D-Weichteilmessungen und den kephalometrischen Messungen waren statistisch signifikant. Die 3D-Weichteilanalyse lässt Aussagen sowohl über den sagittalen Einbau der Kieferbasen als auch über die sagittalen intermaxillären Beziehungen zu. Weitere Untersuchungen sind wünschenswert, um die 3D-Weichteildiagnostik zukünftig als unterstützendes diagnostisches Instrument in die Behandlungsplanung und -bewertung integrieren zu können.
Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval
(2000)

This paper discusses the interest of binary partition trees as a region-oriented image representation. Binary partition trees concentrate in a compact and structured representation a set of meaningful regions that can be extracted from an image. They offer a multiscale representation of the image and define a translation invariant 2-connectivity rule among regions. As shown in this paper, this representation can be used for a large number of processing goals such as filtering, segmentation, information retrieval and visual browsing. Furthermore, the processing of the tree representation leads to very efficient algorithms. Finally, for some applications, it may be interesting to compute the binary partition tree once and to store it for subsequent use for various applications. In this context, the paper shows that the amount of bits necessary to encode a binary partition tree remains moderate.
Making sense of social media streams through semantics: A survey
(2014)

Using semantic technologies for mining and intelligent information access to social media is a challenging, emerging research area. Traditional search methods are no longer able to address the more complex information seeking behaviour in media streams, which has evolved towards sense making, learning, investigation, and social search. Unlike carefully authored news text and longer web context, social media streams pose a number of new challenges, due to their large-scale, short, noisy, contextdependent, and dynamic nature. This paper defines five key research questions in this new application area, examined through a survey of state-of-the-art approaches for mining semantics from social media streams; user, network, and behaviour modelling; and intelligent, semanticbased information access. The survey includes key methods not just from the Semantic Web research field, but also from the related areas of natural language processing and user modelling. In conclusion, key outstanding challenges are discussed and new directions for research are proposed.
A Document Skew Detection Method Using the Hough Transform
(2000)

Document image processing has become an increasingly important technology in the automation of office documentation tasks. Automatic document scanners such as text readers and OCR (Optical Character Recognition) systems are an essential component of systems capable of those tasks. One of the problems in this field is that the document to be read is not always placed correctly on a flatbed scanner. This means that the document may be skewed on the scanner bed, resulting in a skewed image. This skew has a detrimental effect on document on document analysis, document understanding, and character segmentation and recognition. Consequently, detecting the skew of a document image and correcting it are important issues in realising a practical document reader. In this paper we describe a new algorithm for skew detection. We then compare the performance and results of this skew detection algorithm to other publidhed methods form O'Gorman, Hinds, Le, Baird, Posel and Akuyama. Finally, we discuss the theory of skew detection and the different apporaches taken to solve the problem of skew in documents. The skew correction algorithm we propose has been shown to be extremenly fast, with run times averaging under 0.25 CPU seconds to calculate the angle on the DEC 5000/20 workstation.
Performance Evaluation of Bridgeless PFC Boost Rectifiers
(2007)

In this paper, a systematic review of bridgeless power factor correction (PFC) boost rectifiers, also called dual boost PFC rectifiers, is presented. Performance comparison between the conventional PFC boost rectifier and a representative member of the bridgeless PFC boost rectifier family is performed. Loss analysis and experimental efficiency evaluation for both CCM and DCM/CCM boundary operations are provided.
State-of-the-art, single-phase, active power-factor-correction techniques for high-power applications - an overview
(2005)

A review of high-performance, state-of-the-art, active power-factor-correction (PFC) techniques for high-power, single-phase applications is presented. The merits and limitations of several PFC techniques that are used in today's network-server and telecom power supplies to maximize their conversion efficiencies are discussed. These techniques include various zero-voltage-switching and zero-current-switching, active-snubber approaches employed to reduce reverse-recovery-related switching losses, as well as techniques for the minimization of the conduction losses. Finally, the effect of recent advancements in semiconductor technology, primarily silicon-carbide technology, on the performance and design considerations of PFC converters is discussed.
Bridgeless PFC implementation using one cycle control technique
(2005)

Conventional boost PFC suffers from the high conduction loss in the input rectifier-bridge. Higher efficiency can be achieved by using the bridgeless boost topology. This new circuit has issues such as voltage sensing, current sensing and EMI noise. In this paper, one cycle control technique is used to solve the issues of the voltage sensing and current sensing. Experimental results show efficiency improvement and EMI performance
Common mode noise modeling and analysis of dual boost PFC circuit
(2004)

To achieve high efficiency PFC front stage in switching mode power supply (SMPS), dual boost PFC (DBPFC) topology shows superior characteristics compared with traditional boost PFC, but it by nature brings higher EMI noise, especially common mode (CM) noise. This paper deals with the modeling and analysis of DBPFC CM noise based on and compared with boost PFC, noise propagation equivalent circuits of both topologies are deduced, and theoretical analysis illustrates the difference. Experiments are performed to validate the EMI model and analysis.
Common mode EMI noise suppression in bridgeless boost PFC converter
(2007)

Bridgeless boost PFC converter has high efficiency by eliminating the input diode bridge. However, Common Mode (CM) conducted EMI becomes a great issue. The goal of this paper is to study the possibility to minimize the CM noise in this converter. First the noise model is studied. Then a balance concept is introduced and applied to cancel the CM noise. Two approaches to minimize CM noise are introduced and compared. Experiments verify the effectiveness of both approaches.