SoroushVahidi/scidocs huggingface dataset:
Surfel-Based Next Best View Planning
(2018)

Next best view (NBV) planning is a central task for automated three-dimensional (3-D) reconstruction in robotics. The most expensive phase of NBV computation is the view simulation step, where the information gain of a large number of candidate sensor poses are estimated. Usually, information gain is related to the visibility of unknown space from the simulated viewpoint. A well-established technique is to adopt a volumetric representation of the environment and to compute the NBV from ray casting by maximizing the number of unknown visible voxels. This letter explores a novel approach for NBV planning based on surfel representation of the environment. Surfels are oriented surface elements, such as circular disks, without explicit connectivity. A new kind of surfel is introduced to represent the frontier between empty and unknown space. Surfels are extracted during 3-D reconstruction, with minimal overhead, from a KinectFusion volumetric representation. Surfel rendering is used to generate images from each simulated sensor pose. Experiments in a real robot setup are reported. The proposed approach achieves better performance than volumetric algorithms based on ray casting implemented on graphics processing unit (GPU), with comparable results in terms of reconstruction quality. Moreover, surfel-based NBV planning can be applied in larger environments as a volumetric representation is limited by GPU memory.
Green Internet of Things for Smart World
(2015)

Smart world is envisioned as an era in which objects (e.g., watches, mobile phones, computers, cars, buses, and trains) can automatically and intelligently serve people in a collaborative manner. Paving the way for smart world, Internet of Things (IoT) connects everything in the smart world. Motivated by achieving a sustainable smart world, this paper discusses various technologies and issues regarding green IoT, which further reduces the energy consumption of IoT. Particularly, an overview regarding IoT and green IoT is performed first. Then, the hot green information and communications technologies (ICTs) (e.g., green radio-frequency identification, green wireless sensor network, green cloud computing, green machine to machine, and green data center) enabling green IoT are studied, and general green ICT principles are summarized. Furthermore, the latest developments and future vision about sensor cloud, which is a novel paradigm in green IoT, are reviewed and introduced, respectively. Finally, future research directions and open problems about green IoT are presented. Our work targets to be an enlightening and latest guidance for research with respect to green IoT and smart world.
Learning patterns for discovering domain-oriented opinion words
(2017)

Sentiment analysis is a challenging task that attracted increasing interest during the last years. The availability of online data along with the business interest to keep up with consumer feedback generates a constant demand for online analysis of user-generated content. A key role to this task plays the utilization of domain-specific lexicons of opinion words that enables algorithms to classify short snippets of text into sentiment classes (positive, negative). This process is known as dictionary-based sentiment analysis. The related work tends to solve this lexicon identification problem by either exploiting a corpus and a thesaurus or by manually defining a set of patterns that will extract opinion words. In this work, we propose an unsupervised approach for discovering patterns that will extract domain-specific dictionary. Our approach (DidaxTo) utilizes opinion modifiers, sentiment consistency theories, polarity assignment graphs and pattern similarity metrics. The outcome is compared against lexicons extracted by the state-of-the-art approaches on a sentiment analysis task. Experiments on user reviews coming from a diverse set of products demonstrate the utility of the proposed method. An implementation of the proposed approach in an easy to use application for extracting opinion words from any domain and evaluate their quality is also presented.
Relativity of remembering: why the laws of memory vanished.
(2008)

For 120 years, cognitive psychologists have sought general laws of learning and memory. In this review I conclude that none has stood the test of time. No empirical law withstands manipulation across the four sets of factors that Jenkins (1979) identified as critical to memory experiments: types of subjects, kinds of events to be remembered, manipulation of encoding conditions, and variations in test conditions. Another factor affecting many phenomena is whether a manipulation of conditions occurs in randomized, within-subjects designs rather than between-subjects (or within-subject, blocked) designs. The fact that simple laws do not hold reveals the complex, interactive nature of memory phenomena. Nonetheless, the science of memory is robust, with most findings easily replicated under the same conditions as originally used, but when other variables are manipulated, effects may disappear or reverse. These same points are probably true of psychological research in most, if not all, domains.
Decision quality and satisfaction: the effects of online information sources and self-efficacy
(2017)

Purpose – Digital libraries and social media are two sources of online information with different characteristics. This study integrates self-efficacy into the analysis of the relationship between information sources and decision-making, with the aim of exploring the effect of self-efficacy on decision-making, as well as the interacting effect of self-efficacy and information sources on decision-making. Design/methodology/approach –Survey data were collected and the partial least squares (PLS) structural equation modelling (SEM) was employed to verify the research model. Findings – The effect of digital library usage for acquiring information on perceived decision quality is larger than that of social media usage for acquiring information on perceived decision quality. Self-efficacy in acquiring information stands out as the key determinant for perceived decision quality. The effect of social media usage for acquiring information on perceived decision quality is positively moderated by self-efficacy in acquiring information. Practical implications – Decision-making is a fundamental activity for individuals, but human decision-making is often subject to biases. The findings of this study provide useful insights into decision quality improvement, highlighting the importance of self-efficacy in acquiring information in the face of information overload. Originality/value – This study integrates self-efficacy into the analysis of the relationship between information sources and decision-making, presenting a new perspective for decision-making research and practice alike.
BTS guidelines for the insertion of a chest drain.
(2003)

D Laws, E Neville, J Duffy, on behalf of the British Thoracic Society Pleural Disease Group, a subgroup of the British Thoracic Society Standards of Care Committee . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
LOCOMO satcom terminal: A switchable RHCP/LHCP Array Antenna for on-the-move applications in Ka-band
(2015)

This paper describes the main features of a multilayer antenna panel for a low cost Ka-band Array Antenna for on-the-move applications. The LOCOMO satcom terminal is based on a dual-polarized low-profile antenna with trasmit/receive and RHCP/LHCP switching capability.
A design for an electronically-steerable holographic antenna with polarization control
(2015)

We present a design for an electronic-steerable holographic antenna with polarization control composed of a radial array of Ku-band, electronically-steerable, surface-wave waveguide (SWG) artificial-impedance-surface antennas (AISA). The antenna operates by launching surface waves into each of the SWGs via a central feed network. The surface-wave impedance is electronically controlled with varactor-tuned impedance patches. The impedance is adjusted to scan the antenna in elevation, azimuth and polarization. The radial symmetry allows for 360° azimuthal steering. If constructed with previously-demonstrated SWG AISAs, it is capable of scanning in elevation from -75° to 75° with gain variation of less than 3 dB. The polarization can be switched among V-Pol, H-Pol, LHCP and RHCP at will.
Progressive Visual Analytics: User-Driven Visual Exploration of In-Progress Analytics
(2014)

As datasets grow and analytic algorithms become more complex, the typical workflow of analysts launching an analytic, waiting for it to complete, inspecting the results, and then re-Iaunching the computation with adjusted parameters is not realistic for many real-world tasks. This paper presents an alternative workflow, progressive visual analytics, which enables an analyst to inspect partial results of an algorithm as they become available and interact with the algorithm to prioritize subspaces of interest. Progressive visual analytics depends on adapting analytical algorithms to produce meaningful partial results and enable analyst intervention without sacrificing computational speed. The paradigm also depends on adapting information visualization techniques to incorporate the constantly refining results without overwhelming analysts and provide interactions to support an analyst directing the analytic. The contributions of this paper include: a description of the progressive visual analytics paradigm; design goals for both the algorithms and visualizations in progressive visual analytics systems; an example progressive visual analytics system (Progressive Insights) for analyzing common patterns in a collection of event sequences; and an evaluation of Progressive Insights and the progressive visual analytics paradigm by clinical researchers analyzing electronic medical records.
ℓ<ce:inf loc=post>1</ce:inf>-penalized linear mixed-effects models for high dimensional data with application to BCI
(2011)

Recently, a novel statistical model has been proposed to estimate population effects and individual variability between subgroups simultaneously, by extending Lasso methods. We will for the first time apply this so-called ℓ(1)-penalized linear regression mixed-effects model for a large scale real world problem: we study a large set of brain computer interface data and through the novel estimator are able to obtain a subject-independent classifier that compares favorably with prior zero-training algorithms. This unifying model inherently compensates shifts in the input space attributed to the individuality of a subject. In particular we are now for the first time able to differentiate within-subject and between-subject variability. Thus a deeper understanding both of the underlying statistical and physiological structures of the data is gained.
BotCop: An Online Botnet Traffic Classifier
(2009)

A botnet is a network of compromised computers infected with malicious code that can be controlled remotely under a common command and control (C&C) channel. As one the most serious security threats to the Internet, a botnet cannot only be implemented with existing network applications (e.g. IRC, HTTP, or Peer-to-Peer) but also can be constructed by unknown or creative applications, thus making the botnet detection a challenging problem. In this paper, we propose a new online botnet traffic classification system, called BotCop, in which the network traffic are fully classified into different application communities by using payload signatures and a novel decision tree model, and then on each obtained application community, the temporal-frequent characteristic of flows is studied and analyzed to differentiate the malicious communication traffic created by bots from normal traffic generated by human beings. We evaluate our approach with about 30 million flows collected over one day on a large-scale WiFi ISP network and results show that the proposed approach successfully detects an IRC botnet from about 30 million flows with a high detection rate and a low false alarm rate.
On the compression of recurrent neural networks with an application to LVCSR acoustic modeling for embedded speech recognition
(2016)

We study the problem of compressing recurrent neural networks (RNNs). In particular, we focus on the compression of RNN acoustic models, which are motivated by the goal of building compact and accurate speech recognition systems which can be run efficiently on mobile devices. In this work, we present a technique for general recurrent model compression that jointly compresses both recurrent and non-recurrent inter-layer weight matrices. We find that the proposed technique allows us to reduce the size of our Long Short-Term Memory (LSTM) acoustic model to a third of its original size with negligible loss in accuracy.
Efficient Object Instance Search Using Fuzzy Objects Matching
(2017)

Recently, global features aggregated from local convolutional features of the convolutional neural network have shown to be much more effective in comparison with hand-crafted features for image retrieval. However, the global feature might not effectively capture the relevance between the query object and reference images in the object instance search task, especially when the query object is relatively small and there exist multiple types of objects in reference images. Moreover, the object instance search requires to localize the object in the reference image, which may not be achieved through global representations. In this paper, we propose a Fuzzy Objects Matching (FOM) framework to effectively and efficiently capture the relevance between the query object and reference images in the dataset. In the proposed FOM scheme, object proposals are utilized to detect the potential regions of the query object in reference images. To achieve high search efficiency, we factorize the feature matrix of all the object proposals from one reference image into the product of a set of fuzzy objects and sparse codes. In addition, we refine the feature of the generated fuzzy objects according to its neighborhood in the feature space to generate more robust representation. The experimental results demonstrate that the proposed FOM framework significantly outperforms the state-of-theart methods in precision with less memory and computational cost on three public datasets. The task of object instance search, is to retrieve all the images containing a specific object query and localize the query object in the reference images. It has received a sustained attention over the last decade, leading to many object instance search systems (Meng et al. 2010; Jiang, Meng, and Yuan 2012; Jiang et al. 2015; Tolias, Avrithis, and Jégou 2013; Tao et al. 2014; Razavian et al. 2014a; 2014b; Tolias, Sicre, and Jégou 2016; Meng et al. 2016; Bhattacharjee et al. 2016b; 2016a; Mohedano et al. 2016; Cao et al. 2016; Wu et al. 2016). Since the query object only occupies a small part of an image, the global representation may not be effective to capture the relevance between the query object with reference image. Therefore, the relevance between the query object and one reference image is not determined by the overall similarity between the query and the reference image. Copyright c © 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. ...
Parsing English into Abstract Meaning Representation Using Syntax-Based Machine Translation
(2015)

We present a parser for Abstract Meaning Representation (AMR). We treat Englishto-AMR conversion within the framework of string-to-tree, syntax-based machine translation (SBMT). To make this work, we transform the AMR structure into a form suitable for the mechanics of SBMT and useful for modeling. We introduce an AMR-specific language model and add data and features drawn from semantic resources. Our resulting AMR parser significantly improves upon state-of-the-art results.
An image encryption scheme based on elliptic curve pseudo random and Advanced Encryption System
(2017)

Elliptic curve cryptography (ECC) has proven to be an effective cryptography. ECC has its own advantages such as efficient key size compared to other public key infrastructures. This paper exploits the Elliptic curve random generator defined by National Institute of Standards and Technology (NIST) to generate a sequence of arbitrary numbers based on curves. The random generation phase is based on public shared key and a changing point G, which is a generator of a curve to obtain random sequences. Then, Advanced Encryption System is applied to these sequences acquiring arbitrary keys for encrypting image. Using AES alongside well distributed randoms provides a prominent encryption technique. Our experiments show that the proposed method fulfills the basics of cryptography including simpleness and correctness. Moreover, the results of the evaluation prove the effectiveness and security of the proposed method.
Black Box Testing: Techniques for Functional Testing of Software and Systems
(1995)

Editor: Peter Anderson Rochester Institute of Technology 1 Lomb Memorial Dr. Rochester, NY 14623 pga@cs.rit.edu Each technique receives similar coverage, including a description of its new and prerequisite vocabulary, its model, the bug assumptlons that underlie its effectiveness, typical applications, examples (almost all based on standard IRS tax forms), caveats and limitations, automation and tools for the technique, a self-evaluation quiz, and exercises. Common threads in the presentation show the role
Análisis de la Simplificación de Expresiones Numéricas en Español mediante un Estudio Empírico
(2012)

In this paper we present the results of an empirical study carried out on a parallel corpus of original and manually simplified texts in Spanish and a subsequent survey, with the aim of targeting simplification operations concerning numerical expressions. For the purpose of the study, a “numerical expression” is understood as any phrase expressing quantity possibly modified with a numerical hedge, such as almost a quarter. Data is analyzed both in context and in isolation, and attention is paid to the difference the target reader makes to simplification. Our future work aims at computational implementation of the transformation rules extracted so far.
Sistema de Conversión Texto a Voz de Código Abierto Para Lenguas Ibéricas
(2013)

This paper presents a text-to-speech system based on statistical synthesis which, for the first time, allows generating speech in any of the four official languages of Spain as well as English. Using the AhoTTS system already developed for Spanish and Basque as a starting point, we have added support for Catalan, Galician and English using the code of available open-source modules. The resulting system, named multilingual AhoTTS, has also been released as open-source and it is already being used in real applications.
The RB and p 53 pathways in cancer
(2002)

The life history of cancer cells encompasses a series of genetic missteps in which normal cells are progressively transformed into tumor cells that invade surrounding tissues and become malignant. Most prominent among the regulators disrupted in cancer cells are two tumor suppressors, the retinoblastoma protein (RB) and the p53 transcription factor. Here, we discuss interconnecting signaling pathways controlled by RB and p53, attempting to explain their potentially universal involvement in the etiology of cancer. Pinpointing the various ways by which the functions of RB and p53 are subverted in individual tumors should provide a rational basis for developing more refined tumor-specific therapies.
Creativity, the Turing Test, and the (Better) Lovelace Test
(2001)

The Turing Test (TT) is claimed by many to be a way to test for the presence, in computers, of such ``deep'' phenomena as thought and consciousness. Unfortunately, attempts to build computational systems able to pass TT (or at least restricted versions of this test) have devolved into shallow symbol manipulation designed to, by hook or by crook, trick. The human creators of such systems know all too well that they have merely tried to fool those people who interact with their systems into believing that these systems really have minds. And the problem is fundamental: the structure of the TT is such as to cultivate tricksters. A better test is one that insists on a certain restrictive epistemic relation between an artificial agent (or system) A, its output o, and the human architect H of A – a relation which, roughly speaking, obtains when H cannot account for how A produced o. We call this test the ``Lovelace Test'' in honor of Lady Lovelace, who believed that only when computers originate things should they be believed to have minds.
Social network analysis: a powerful strategy, also for the information sciences
(2002)

Social network analysis (SNA) is not a formal theory in sociology but rather a strategy for investigating social structures. As it is an idea that can be applied in many fields, we study, in particular, its influence in the information sciences. Information scientists study publication, citation and co-citation networks, collaboration structures and other forms of social interaction networks. Moreover, the Internet represents a social network of an unprecedented scale. We are convinced that in all these studies social network analysis can successfully be applied. SNA is further related to recent theories concerning the free market economy, geography and transport networks. The growth of SNA is documented and a co-author network of SNA is drawn. Centrality measures of this network are calculated. * To whom all correspondence should be addressed.
Classifying the Semantic Relations in Noun Compounds via a Domain-Specific Lexical Hierarchy
(2001)

We are developing corpus-based techniques for identifying semantic relations at an intermediate level of description (more specific than those used in case frames, but more general than those used in traditional knowledge representation systems). In this paper we describe a classification algorithm for identifying relationships between two-word noun compounds. We find that a very simple approach using a machine learning algorithm and a domain-specific lexical hierarchy successfully generalizes from training instances, performing better on previously unseen words than a baseline consisting of training on the words themselves.
Studying Online Social Networks
(1997)

What is Social Network Analysis? The Social Network Approach Units of Analysis Relations Ties Multiplexity Composition Beyond the Tie Social Networks Two Views: Ego-Centered and Whole Networks Network Characteristics Partitioning Networks Groups STUDYING ONLINE SOCIAL NETWORKS, by Laura Garton... http://jcmc.indiana.edu/vol3/issue1/garton.html 1 of 32 9/21/11 11:24 AM Positional Analysis Networks of Networks Placing CMC in Context Collecting Network Data for CMC Studies Selecting a Sample Collecting Data How are Network Data Analyzed? Ego-Centered Analysis Whole Network Analysis Conclusions References About the Authors
MAPLSC: A novel multi-class classifier for medical diagnosis
(2011)

Analysis of clinical records contributes to the Traditional Chinese Medicine (TCM) experience expansion and techniques promotion. More than two diagnostic classes (diagnostic syndromes) in the clinical records raise a popular data mining problem: multi-value classification. In this paper, we propose a novel multi-class classifier, named Multiple Asymmetric Partial Least Squares Classifier (MAPLSC). MAPLSC attempts to be robust facing imbalanced data distribution in the multi-value classification. Elaborated comparisons with other seven state-of-the-art methods on two TCM clinical datasets and four public microarray datasets demonstrate MAPLSC's remarkable improvements.