SoroushVahidi/scidocs huggingface dataset:
High-Throughput and Language-Agnostic Entity Disambiguation and Linking on User Generated Data
(2017)

The Entity Disambiguation and Linking (EDL) task matches entity mentions in text to a unique Knowledge Base (KB) identifier such as a Wikipedia or Freebase id. It plays a critical role in the construction of a high quality information network, and can be further leveraged for a variety of information retrieval and NLP tasks such as text categorization and document tagging. EDL is a complex and challenging problem due to ambiguity of the mentions and real world text being multi-lingual. Moreover, EDL systems need to have high throughput and should be lightweight in order to scale to large datasets and run on off-the-shelf machines. More importantly, these systems need to be able to extract and disambiguate dense annotations from the data in order to enable an Information Retrieval or Extraction task running on the data to be more efficient and accurate. In order to address all these challenges, we present the Lithium EDL system and algorithm a high-throughput, lightweight, language-agnostic EDL system that extracts and correctly disambiguates 75% more entities than state-of-the-art EDL systems and is significantly faster than them.
A hybrid factor analysis and probabilistic PCA-based system for dictionary learning and encoding for robust speaker recognition
(2012)

Probabilistic Principal Component Analysis (PPCA) based low dimensional representation of speech utterances is found to be useful for speaker recognition. Although, performance of the FA (Factor Analysis)-based total variability space model is found to be superior, hyperparameter estimation procedure in PPCA is computationally efficient. In this work, recent insight on the FA-based approach as a combination of dictionary learning and encoding is explored to use its encoding procedure in the PPCA framework. With the use of an alternate encoding technique on dictionaries learnt using PPCA, performance of state-of-the-art FA-based i-vector approach is matched by using the proposed procedure. A speed up of 4x is obtained while estimating the hyperparameter at the cost of 0.51% deterioration in performance in terms of the Equal Error Rate (EER) in the worst case. Compared to the conventional PPCA model, absolute improvements of 2.1% and 2.8% are observed on two telephone conditions of NIST 2008 SRE database. Using Canonical Correlational Analysis, it is shown that the i-vectors extracted from the conventional FA model and the proposed approach are highly correlated.
Remarkable archaeal diversity detected in a Yellowstone National Park hot spring environment.
(1994)

Of the three primary phylogenetic domains--Archaea (archaebacteria), Bacteria (eubacteria), and Eucarya (eukaryotes)--Archaea is the least understood in terms of its diversity, physiologies, and ecological panorama. Although many species of Crenarchaeota (one of the two recognized archaeal kingdoms sensu Woese [Woese, C. R., Kandler, O. & Wheelis, M. L. (1990) Proc. Natl. Acad. Sci. USA 87, 4576-4579]) have been isolated, they constitute a relatively tight-knit cluster of lineages in phylogenetic analyses of rRNA sequences. It seemed possible that this limited diversity is merely apparent and reflects only a failure to culture organisms, not their absence. We report here phylogenetic characterization of many archaeal small subunit rRNA gene sequences obtained by polymerase chain reaction amplification of mixed population DNA extracted directly from sediment of a hot spring in Yellowstone National Park. This approach obviates the need for cultivation to identify organisms. The analyses document the existence not only of species belonging to well-characterized crenarchaeal genera or families but also of crenarchaeal species for which no close relatives have so far been found. The large number of distinct archaeal sequence types retrieved from this single hot spring was unexpected and demonstrates that Crenarchaeota is a much more diverse group than was previously suspected. The results have impact on our concepts of the phylogenetic organization of Archaea.
Interfacing industrial robots using Realtime Primitives
(2010)

Today, most industrial robots are interfaced using text-based programming languages. These languages offer the possibility to declare robotic-specific data types, to specify simple motions, and to interact with tools and sensors via I/O operations. While tailored to the underlying robot controller, they usually only offer a fixed and controller-specific set of possible instructions. The specification of complex motions, the synchronization of cooperating robots and the advanced use of sensors is often very difficult or not even feasible. To overcome these limitations, this paper presents a generic and extensible interface for industrial robots, the Realtime Primitives Interface, as part of a larger software architecture. It allows a flexible specification of complex control instructions and can facilitate the development of sustainable robot controllers. The advantages of this approach are illustrated with several examples.
Adaptive Quantization for Deep Neural Network
(2018)

In recent years Deep Neural Networks (DNNs) have been rapidly developed in various applications, together with increasingly complex architectures. The performance gain of these DNNs generally comes with high computational costs and large memory consumption, which may not be affordable for mobile platforms. Deep model quantization can be used for reducing the computation and memory costs of DNNs, and deploying complex DNNs on mobile equipment. In this work, we propose an optimization framework for deep model quantization. First, we propose a measurement to estimate the effect of parameter quantization errors in individual layers on the overall model prediction accuracy. Then, we propose an optimization process based on this measurement for finding optimal quantization bit-width for each layer. This is the first work that theoretically analyse the relationship between parameter quantization errors of individual layers and model accuracy. Our new quantization algorithm outperforms previous quantization optimization methods, and achieves 20-40% higher compression rate compared to equal bit-width quantization at the same model prediction accuracy.
Toroidal skin drive for snake robot locomotion
(2008)

Small robots have the potential to access confined spaces where humans cannot go. However, the mobility of wheeled and tracked systems is severely limited in cluttered environments. Snake robots using biologically inspired gaits for locomotion can provide better access in many situations, but are slow and can easily snag. This paper introduces an alternative approach to snake robot locomotion, in which the entire surface of the robot provides continuous propulsive force to significantly improve speed and mobility in many environments.
X-band 200W AlGaN/GaN HEMT for high power application
(2011)

A 200 Watts GaN high electron mobility transistor (HEMT) has been developed for X-band applications. The device consists of four dies of 0.35 um-gate GaN HEMT of 16 mm gate periphery together with input and output 2-stage impedance transformers assembled into a low thermal resistance package. The developed GaN HEMT provides 204W output power and 12dB small signal gain at 9.3 GHz with power added efficiency of 32% under pulse condition at a duty of 10% with a pulse width of 100 usec.
Implementation of Sugeno FIS in model reference adaptive system adaptation scheme for speed sensorless control of PMSM
(2014)

Model reference adaptive system (MRAS) is one of the popular methods to observe the speed and the angle information of the Permanent magnet synchronous motor (PMSM). This paper proposes a new adaptation scheme for MRAS to replace the conventional PI controller based on Popov Hyperstability theorem. In this project, the speed of PMSM is controlled by using field oriented control (FOC) method and the MRAS is used to observe the speed and the rotor position of the motor. The reference model for the MRAS is the PMSM itself while the adjustable model is the current model in the rotor reference frame. The Sugeno Fuzzy Logic Inference System (FIS) is implemented in the adaptation scheme in order to tune the error between the reference and the adjustable model. The new proposed method shows it is capable to track the motor speed efficiently at wide range of operating speeds.
Analysis of Oblique Aerial Images for Land Cover and Point Cloud Classification in an Urban Environment
(2015)

In addition to aerial imagery, point clouds are important remote sensing data in urban environment studies. It is essential to extract semantic information from both images and point clouds for such purposes; thus, this study aims to automatically classify 3-D point clouds generated using oblique aerial imagery (OAI)/vertical aerial imagery (VAI) into various urban object classes, such as roof, facade, road, tree, and grass. A multicamera airborne imaging system that can simultaneously acquire VAI and OAI is suggested. The acquired small-format images contain only three RGB spectral bands and are used to generate photogrammetric point clouds through a multiview-stereo dense matching technique. To assign each 3-D point cloud to a corresponding urban object class, we first analyzed the original OAI through object-based image analyses. A rule-based hierarchical semantic classification scheme that utilizes spectral information and geometry- and topology-related features was developed, in which the object height and gradient features were derived from the photogrammetric point clouds to assist in the detection of elevated objects, particularly for the roof and facade. Finally, the photogrammetric point clouds were classified into the aforementioned five classes. The classification accuracy was assessed on the image space, and four experimental results showed that the overall accuracy is between 82.47% and 91.8%. In addition, visual and consistency analyses were performed to demonstrate the proposed classification scheme's feasibility, transferability, and reliability, particularly for distinguishing elevated objects from OAI, which has a severe occlusion effect, image-scale variation, and ambiguous spectral characteristics.
Exploring the Placement and Design of Word-Scale Visualizations
(2014)

We present an exploration and a design space that characterize the usage and placement of word-scale visualizations within text documents. Word-scale visualizations are a more general version of sparklines-small, word-sized data graphics that allow meta-information to be visually presented in-line with document text. In accordance with Edward Tufte's definition, sparklines are traditionally placed directly before or after words in the text. We describe alternative placements that permit a wider range of word-scale graphics and more flexible integration with text layouts. These alternative placements include positioning visualizations between lines, within additional vertical and horizontal space in the document, and as interactive overlays on top of the text. Each strategy changes the dimensions of the space available to display the visualizations, as well as the degree to which the text must be adjusted or reflowed to accommodate them. We provide an illustrated design space of placement options for word-scale visualizations and identify six important variables that control the placement of the graphics and the level of disruption of the source text. We also contribute a quantitative analysis that highlights the effect of different placements on readability and text disruption. Finally, we use this analysis to propose guidelines to support the design and placement of word-scale visualizations.
A deep learning-based method for relative location prediction in CT scan images
(2017)

Relative location prediction in computed tomography (CT) scan images is a challenging problem. In this paper, a regression model based on one-dimensional convolutional neural networks is proposed to determine the relative location of a CT scan image both robustly and precisely. A public dataset is employed to validate the performance of the study’s proposed method using a 5-fold cross validation. Experimental results demonstrate an excellent performance of the proposed model when compared with the state-of-the-art techniques, achieving a median absolute error of 1.04 cm and mean absolute error of 1.69 cm.
Parametric Shape-from-Shading by Radial Basis Functions
(1997)

In this paper, we present a new method of shape from shading by using radial basis functions to parameterize the object depth. The radial basis functions are deformed by adjusting their centers, widths, and weights such that the intensity errors are minimized. The initial centers and widths are arranged hierarchically to speed up convergence and to stabilize the solution. Although the smoothness constraint is used, it can be eventually dropped out without causing instabilities in the solution. An important feature of our parametric shape-from-shading method is that it offers a unified framework for integration of multiple sensory information. We show that knowledge about surface depth and/or surface normals anywhere in the image can be easily incorporated into the shape from shading process. It is further demonstrated that even qualitative knowledge can be used in shape from shading to improve 3D reconstruction. Experimental comparisons of our method with several existing ones are made by using both synthetic and real images. Results show that our solution is more accurate than the others.
Practical Deep Stereo (PDS): Toward applications-friendly deep stereo matching
(2018)

End-to-end deep-learning networks recently demonstrated extremely good performance for stereo matching. However, existing networks are difficult to use for practical applications since (1) they are memory-hungry and unable to process even modest-size images, (2) they have to be trained for a given disparity range. The Practical Deep Stereo (PDS) network that we propose addresses both issues: First, its architecture relies on novel bottleneck modules that drastically reduce the memory footprint in inference, and additional design choices allow to handle greater image size during training. This results in a model that leverages large image context to resolve matching ambiguities. Second, a novel sub-pixel crossentropy loss combined with a MAP estimator make this network less sensitive to ambiguous matches, and applicable to any disparity range without re-training. We compare PDS to state-of-the-art methods published over the recent months, and demonstrate its superior performance on FlyingThings3D and KITTI sets.
Digital Infrastructures : The Missing IS Research Agenda
(2010)

S the inauguration of information systems research (ISR) two decades ago, the information systems (IS) field’s attention has moved beyond administrative systems and individual tools. Millions of users log onto Facebook, download iPhone applications, and use mobile services to create decentralized work organizations. Understanding these new dynamics will necessitate the field paying attention to digital infrastructures as a category of IT artifacts. A state-of-the-art review of the literature reveals a growing interest in digital infrastructures but also confirms that the field has yet to put infrastructure at the centre of its research endeavor. To assist this shift we propose three new directions for IS research: (1) theories of the nature of digital infrastructure as a separate type of IT artifact, sui generis; (2) digital infrastructures as relational constructs shaping all traditional IS research areas; (3) paradoxes of change and control as salient IS phenomena. We conclude with suggestions for how to study longitudinal, large-scale sociotechnical phenomena while striving to remain attentive to the limitations of the traditional categories that have guided IS research.
Running head: Working memory in L2 input processing The role of working memory in processing L2 input: Insights from eye-tracking
(2017)

Our study investigated how attention paid to a target syntactic construction causative had is related the storage capacity and attention regulation function of working memory (WM) and how these WM abilities moderate the change of knowledge of the target construction in different input conditions. 80 Sri Lankan learners of English were exposed to examples of the target construction in explicit and implicit learning conditions and their eye movements were tracked as they read the input. Correlational and multiple regression analyses indicated a very strong relationship between WM abilities and gains in the knowledge of the target construction. WM scores were closely associated with gains in receptive knowledge in all input conditions, but they had a weaker link to the improvement of productive knowledge in the implicit learning conditions. The amount of attention paid to input was also strongly related to WM abilities.
Comparing Alzheimer’s and Parkinson’s diseases networks using graph communities structure
(2016)

Recent advances in large datasets analysis offer new insights to modern biology allowing system-level investigation of pathologies. Here we describe a novel computational method that exploits the ever-growing amount of “omics” data to shed light on Alzheimer’s and Parkinson’s diseases. Neurological disorders exhibit a huge number of molecular alterations due to a complex interplay between genetic and environmental factors. Classical reductionist approaches are focused on a few elements, providing a narrow overview of the etiopathogenic complexity of multifactorial diseases. On the other hand, high-throughput technologies allow the evaluation of many components of biological systems and their behaviors. Analysis of Parkinson’s Disease (PD) and Alzheimer’s Disease (AD) from a network perspective can highlight proteins or pathways common but differently represented that can be discriminating between the two pathological conditions, thus highlight similarities and differences. In this work we propose a strategy that exploits network community structure identified with a state-of-the-art network community discovery algorithm called InfoMap, which takes advantage of information theory principles. We used two similarity measurements to quantify functional and topological similarities between the two pathologies. We built a Similarity Matrix to highlight similar communities and we analyzed statistically significant GO terms found in clustered areas of the matrix and in network communities. Our strategy allowed us to identify common known and unknown processes including DNA repair, RNA metabolism and glucose metabolism not detected with simple GO enrichment analysis. In particular, we were able to capture the connection between mitochondrial dysfunction and metabolism (glucose and glutamate/glutamine). This approach allows the identification of communities present in both pathologies which highlight common biological processes. Conversely, the identification of communities without any counterpart can be used to investigate processes that are characteristic of only one of the two pathologies. In general, the same strategy can be applied to compare any pair of biological networks.
Design of Multimode Net-Type Resonators and Their Applications to Filters and Multiplexers
(2011)

Net-type resonators with dual- and tri-mode electrical behaviors have been presented and analyzed theoretically in this paper. The proposed net-type resonator is constructed by a short-ended and several open-ended transmission-line sections, which has the advantages of small size and more flexible resonant frequency allocation and is therefore particularly suitable for applications to the design of microwave devices. To verify the usefulness of the proposed resonators, three experimental examples, including a dual-mode bandpass filter, a dual-passband filter, and a triplexer, have been designed and fabricated with microstrip technology. Each of the designed circuits occupies a very small size and has a good upper stop and performance. All measured results are in good agreement with the full-wave simulation results.
The coming paradigm shift in forensic identification science.
(2005)

Converging legal and scientific forces are pushing the traditional forensic identification sciences toward fundamental change. The assumption of discernible uniqueness that resides at the core of these fields is weakened by evidence of errors in proficiency testing and in actual cases. Changes in the law pertaining to the admissibility of expert evidence in court, together with the emergence of DNA typing as a model for a scientifically defensible approach to questions of shared identity, are driving the older forensic sciences toward a new scientific paradigm.
Combining minutiae descriptors for fingerprint matching
(2008)

A novel minutiae-based fingerprint matching algorithm is proposed. A minutiae matching algorithm has to solve two problems: correspondence and similarity computation. For the correspondence problem, we assign each minutia two descriptors: texture-based and minutiae-based descriptors, and use an alignment-based greedy matching algorithm to establish the correspondences between minutiae. For the similarity computation, we extract a 17-D feature vector from the matching result, and convert the feature vector into a matching score using support vector classifier. The proposed algorithm is tested on FVC2002 databases and compared to all participators in FVC2002. According to equal error rate, the proposed algorithm ranks 1st on DB3, the most difficult database in FVC2002, and on the average ranks 2nd on all 4 databases. 2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
A Real-Time Matching System for Large Fingerprint Databases
(1996)

With the current rapid growth in multimedia technology, there is an imminent need for efficient techniclues to search and query large image databases. Because of their unique and peculiar needs, image databases cannot be treated iri a similar fashion to other types of digital libraries. The contextual dependencies present in images, and the complex nature of two-dimensional image data make the representation issues more difficult for image databases. An invariant representation of an image is still an open research issue. For these reasons, it is difficult to find a universal content-based retrieval technique. Current approaches based on shape, texture, and color for indexing image databases have met with limited success. Further, these techniques have not been adequately tested in the presence of noise and distortions. A given application domain offers stronger constraints for improving the retrieval performance. Fingerprint databases are characterized by their large size as well as noisy and distorted query images. Distortions are very common in fingerprint images due to elasticity of the skin. In this paper, a method of indexincl large fingerprint image databases is presented. The approach integrates a number of domain-specific high-level features such as pattern class and ridge density at higher levels of the search. At the lowest level, it incorporates elastic structural feature-based matching for indexing the database. With a multilevel indexing approach, we have been able to reduce the search space. The search engine has also been implemented on Splash 2-a field programmable gate array (FPGA)-based array processor to obtain near-,4SIC level speed of matching. Our approach has been tested on a locally collected test data and on NIST-9, a large fingerprint database available in the