SoroushVahidi/scidocs huggingface dataset:
Indoor climate, psychosocial work environment and symptoms in open-plan offices.
(2006)

To study the indoor climate, the psychosocial work environment and occupants' symptoms in offices a cross-sectional questionnaire survey was made in 11 naturally and 11 mechanically ventilated office buildings. Nine of the buildings had mainly cellular offices; five of the buildings had mainly open-plan offices, whereas eight buildings had a mixture of cellular, multi-person and open-plan offices. A total of 2301 occupants, corresponding to a response rate of 72%, completed a retrospective questionnaire. The questionnaire comprised questions concerning environmental perceptions, mucous membrane irritation, skin irritation, central nervous system (CNS) symptoms and psychosocial factors. Occupants in open-plan offices are more likely to perceive thermal discomfort, poor air quality and noise and they more frequently complain about CNS and mucous membrane symptoms than occupants in multi-person and cellular offices. The association between psychosocial factors and office size was weak. Open-plan offices may not be suited for all job types. PRACTICAL IMPLICATION: Open-plan offices may be a risk factor for adverse environmental perceptions and symptoms.
Natural Language Interface to Database-An Introduction
(2015)

Information plays an important role in our lives .it is required numerous applications. One of the major sources of information is databases. Databases and database technology are growing rapidly and are having major impact on the growing use of computers. Computers are used in accessing of information from database. Almost all IT applications are storing, retrieving organizing, accessing analyzing, and information from databases. using the internet. Retrieving information from database requires knowledge of database languages like Structured Query Language (SQL) However, not everybody is able to write SQL queries as they may not be aware of the syntax of SQL structure of the database,. This has lead to the developing such a system where non-expert users compose their questions in their natural language and obtain the results in the form of database. So instead of working with the SQL one can query relational databases in their natural language. This new idea is provoked to develop new type of processing system called natural language interface to database Natural language interface to database enhances the users performance and is a flexible approach querying in database. This paper is an introduction to natural language interfaces to databases (NLIDBS). Covers a brief overview of the NLIDB its components its advantages disadvantages, approaches and techniques .
Active Learning for Convolutional Neural Networks: A Core-Set Approach
(2018)

Convolutional neural networks (CNNs) have been successfully applied to many recognition and learning tasks using a universal recipe; training a deep model on a very large dataset of supervised examples. However, this approach is rather restrictive in practice since collecting a large set of labeled images is very expensive. One way to ease this problem is coming up with smart ways for choosing images to be labelled from a very large collection (i.e. active learning). Our empirical study suggests that many of the active learning heuristics in the literature are not effective when applied to CNNs in batch setting. Inspired by these limitations, we define the problem of active learning as core-set selection, i.e. choosing set of points such that a model learned over the selected subset is competitive for the remaining data points. We further present a theoretical result characterizing the performance of any selected subset using the geometry of the datapoints. As an active learning algorithm, we choose the subset which is expected to yield best result according to our characterization. Our experiments show that the proposed method significantly outperforms existing approaches in image classification experiments by a large margin.
Brain mechanisms of pain affect and pain modulation
(2002)

Recent animal studies reveal ascending nociceptive and descending modulatory pathways that may contribute to the affective-motivational aspects of pain and play a critical role in the modulation of pain. In humans, a reliable pattern of cerebral activity occurs during the subjective experience of pain. Activity within the anterior cingulate cortex and possibly in other classical limbic structures, appears to be closely related to the subjective experience of pain unpleasantness and may reflect the regulation of endogenous mechanisms of pain modulation.
Crime Data Analysis and Prediction of Perpetrator Identity Using Machine Learning Approach
(2018)

Crime is one of the most predominant and alarming aspects in our society and its prevention is a vital task. Crime analysis is a systematic way of detecting and investigating patterns and trends in crime. The aim of this model is to increase the efficiency of crime investigation systems. This model detects crime patterns from inferences collected from the crime scene and predicts the description of the perpetrator who is likely suspected to commit the crime. This work has two major aspects: Crime Analysis and Prediction of perpetrator identity. The Crime Analysis phase identifies the number of unsolved crimes, and analyses the influence of various factors like year, month, and weapon on the unsolved crimes. The prediction phase estimates the description of the perpetrators like, their age, sex and relationship with the victim. These predictions are done based on the evidences collected from the crime scene. The system predicts the description of the perpetrator using algorithms like, Multilinear Regression, K- Neighbors Classifier and Neural Networks. It was trained and tested using San Francisco Homicide dataset (1981–2014) and implemented using python.
Robust Distant Supervision Relation Extraction via Deep Reinforcement Learning
(2018)

Distant supervision has become the standard method for relation extraction. However, even though it is an efficient method, it does not come at no cost—The resulted distantly-supervised training samples are often very noisy. To combat the noise, most of the recent state-of-theart approaches focus on selecting onebest sentence or calculating soft attention weights over the set of the sentences of one specific entity pair. However, these methods are suboptimal, and the false positive problem is still a key stumbling bottleneck for the performance. We argue that those incorrectly-labeled candidate sentences must be treated with a hard decision, rather than being dealt with soft attention weights. To do this, our paper describes a radical solution—We explore a deep reinforcement learning strategy to generate the false-positive indicator, where we automatically recognize false positives for each relation type without any supervised information. Unlike the removal operation in the previous studies, we redistribute them into the negative examples. The experimental results show that the proposed strategy significantly improves the performance of distant supervision comparing to state-of-the-art systems.
MATHEMATICAL MODELING AND SIMULATION OF AN ELECTRIC VEHICLE
(2015)

As electric vehicles become promising alternatives for sustainable and cleaner energy emissions in transportation, the modeling and simulation of electric vehicles has attracted increasing attention from researchers. This paper presents a simulation model of a full electric vehicle on the Matlab-Simulink platform to examine power flow during motoring and regeneration. The drive train components consist of a motor, a battery, a motor controller and a battery controller; modeled according to their mathematical equations. All simulation results are plotted and discussed. The torque and speed conditions during motoring and regeneration were used to determine the energy flow, and performance of the drive. This study forms the foundation for further research and development.
The child sexual abuse accommodation syndrome.
(1983)

Child victims of sexual abuse face secondary trauma in the crisis of discovery. Their attempts to reconcile their private experiences with the realities of the outer world are assaulted by the disbelief, blame and rejection they experience from adults. The normal coping behavior of the child contradicts the entrenched beliefs and expectations typically held by adults, stigmatizing the child with charges of lying, manipulating or imagining from parents, courts and clinicians. Such abandonment by the very adults most crucial to the child's protection and recovery drives the child deeper into self-blame, self-hate, alienation and revictimization. In contrast, the advocacy of an empathic clinician within a supportive treatment network can provide vital credibility and endorsement for the child. Evaluation of the responses of normal children to sexual assault provides clear evidence that societal definitions of "normal" victim behavior are inappropriate and procrustean, serving adults as mythic insulators against the child's pain. Within this climate of prejudice, the sequential survival options available to the victim further alienate the child from any hope of outside credibility or acceptance. Ironically, the child's inevitable choice of the "wrong" options reinforces and perpetuates the prejudicial myths. The most typical reactions of children are classified in this paper as the child sexual abuse accommodation syndrome. The syndrome is composed of five categories, of which two define basic childhood vulnerability and three are sequentially contingent on sexual assault: (1) secrecy, (2) helplessness, (3) entrapment and accommodation, (4) delayed, unconvincing disclosure, and (5) retraction. The accommodation syndrome is proposed as a simple and logical model for use by clinicians to improve understanding and acceptance of the child's position in the complex and controversial dynamics of sexual victimization. Application of the syndrome tends to challenge entrenched myths and prejudice, providing credibility and advocacy for the child within the home, the courts, and throughout the treatment process. The paper also provides discussion of the child's coping strategies as analogs for subsequent behavioral and psychological problems, including implications for specific modalities of treatment.
All-hex meshing using closed-form induced polycube
(2016)

The polycube-based hexahedralization methods are robust to generate all-hex meshes without internal singularities. They avoid the difficulty to control the global singularity structure for a valid hexahedralization in frame-field based methods. To thoroughly utilize this advantage, we propose to use a frame field without internal singularities to guide the polycube construction. Theoretically, our method extends the vector fields associated with the polycube from exact forms to closed forms, which are curl free everywhere but may be not globally integrable. The closed forms give additional degrees of freedom to deal with the topological structure of high-genus models, and also provide better initial axis alignment for subsequent polycube generation. We demonstrate the advantages of our method on various models, ranging from genus-zero models to high-genus ones, and from single-boundary models to multiple-boundary ones.
A Wideband Magnetoelectric Dipole Antenna With Microstrip Line Aperture-Coupled Excitation
(2017)

In this communication, a novel wideband magnetoelectric (ME) dipole antenna is proposed and investigated. A microstrip line aperture-coupled feeding structure is used to excite the antenna. This simple feeding structure can significantly enhance the impedance bandwidth. An antenna prototype is fabricated and exemplified to validate the proposed concept. Measured results show that the proposed ME dipole antenna with microstrip line aperture-coupled excitation achieves an impedance bandwidth of 85% for VSWR < 2 from 2.5 to 6.2 GHz. Further, a measured maximum boresight gain up to 8 dBi is obtained and a 1 dB gain bandwidth is about 67% from 2.5 to 5 GHz. The antenna radiation patterns perform well over the 1 dB gain bandwidth range. A low cross-polarization level is obtained over the operating band.
A Spatio-temporal Role-Based Access Control Model
(2007)

With the growing advancement of pervasive computing technologies, we are moving towards an era where spatio-temporal information will be necessary for access control. The use of such information can be used for enhancing the security of an application, and it can also be exploited to launch attacks. For critical applications, a formal model for spatio-temporal-based access control is needed that increases the security of the application and ensures that the location information cannot be exploited to cause harm. In this paper, we propose a spatio-temporal access control model, based on the Role-Based Access Control (RBAC) model, that is suitable for pervasive computing applications. We show the association of each component of RBAC with spatio-temporal information. We formalize the model by enumerating the constraints. This model can be used for applications where spatial and temporal information of a subject and an object must be taken into account before granting or denying access.
Functional maps: a flexible representation of maps between shapes
(2012)

We present a novel representation of maps between pairs of shapes that allows for efficient inference and manipulation. Key to our approach is a generalization of the notion of map that puts in correspondence real-valued functions rather than points on the shapes. By choosing a multi-scale basis for the function space on each shape, such as the eigenfunctions of its Laplace-Beltrami operator, we obtain a representation of a map that is very compact, yet fully suitable for global inference. Perhaps more remarkably, most natural constraints on a map, such as descriptor preservation, landmark correspondences, part preservation and operator commutativity become linear in this formulation. Moreover, the representation naturally supports certain algebraic operations such as map sum, difference and composition, and enables a number of applications, such as function or annotation transfer without establishing point-to-point correspondences. We exploit these properties to devise an efficient shape matching method, at the core of which is a single linear solve. The new method achieves state-of-the-art results on an isometric shape matching benchmark. We also show how this representation can be used to improve the quality of maps produced by existing shape matching methods, and illustrate its usefulness in segmentation transfer and joint analysis of shape collections.
Fault Diagnosis for Rotating Machinery Using Vibration Measurement Deep Statistical Feature Learning
(2016)

Fault diagnosis is important for the maintenance of rotating machinery. The detection of faults and fault patterns is a challenging part of machinery fault diagnosis. To tackle this problem, a model for deep statistical feature learning from vibration measurements of rotating machinery is presented in this paper. Vibration sensor signals collected from rotating mechanical systems are represented in the time, frequency, and time-frequency domains, each of which is then used to produce a statistical feature set. For learning statistical features, real-value Gaussian-Bernoulli restricted Boltzmann machines (GRBMs) are stacked to develop a Gaussian-Bernoulli deep Boltzmann machine (GDBM). The suggested approach is applied as a deep statistical feature learning tool for both gearbox and bearing systems. The fault classification performances in experiments using this approach are 95.17% for the gearbox, and 91.75% for the bearing system. The proposed approach is compared to such standard methods as a support vector machine, GRBM and a combination model. In experiments, the best fault classification rate was detected using the proposed model. The results show that deep learning with statistical feature extraction has an essential improvement potential for diagnosing rotating machinery faults.
Numba: a LLVM-based Python JIT compiler
(2015)

Dynamic, interpreted languages, like Python, are attractive for domain-experts and scientists experimenting with new ideas. However, the performance of the interpreter is often a barrier when scaling to larger data sets. This paper presents a just-in-time compiler for Python that focuses in scientific and array-oriented computing. Starting with the simple syntax of Python, Numba compiles a subset of the language into efficient machine code that is comparable in performance to a traditional compiled language. In addition, we share our experience in building a JIT compiler using LLVM[1].
Modelling Railway Interlocking Tables Using Coloured Petri Nets
(2010)

Interlocking tables are the functional specification defining the routes, on which the passage of the train is allowed. Associated with the route, the states and actions of all related signalling equipment are also specified. This paper formally models the interlocking tables using Coloured Petri Nets (CPN). The CPN model comprises two parts: Signaling Layout and Interlocking Control. The Signaling Layout part is used to simulate the passage of the train. It stores geographic information of the signalling layout in tokens. The Interlocking Control part models actions of the controller according to the functions specified in the interlocking tables. The arc inscriptions in the model represent the content of the interlocking tables. Following our modelling approach we can reuse the same CPN net structure to model any new or modified interlocking system regardless of its size. Experimental results are presented to provide increased confidence in the model correctness.
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
(2007)

Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Detection of maximum common subgraph (MCS) is useful for matching, comparing and evaluate the similarity of patterns. MCS is a well known NP-complete problem for which optimal and suboptimal algorithms are known from the literature. Nevertheless, until now no effort has been done for characterizing their performance. The lack of a large database of graphs makes the task of comparing the performance of different graph matching algorithms difficult, and often the selection of an algorithm is made on the basis of a few experimental results available. In this paper, three optimal and well-known algorithms for maximum common subgraph detection are described. Moreover a large database containing various categories of pairs of graphs (e.g. random graphs, meshes, bounded valence graphs), is presented, and the performance of the three algorithms is evaluated on this database. Article Type Communicated by Submitted Revised Regular Paper U. Brandes September 2005 January 2007 D. Conte et al., Maximum Common Subgraph, JGAA, 11(1) 99–143 (2007) 100
Probabilistic Subgraph Matching Based on Convex Relaxation
(2005)

We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with a regularization term that measures differences of the relational structure. For the resulting quadratic integer program, a mathematically tight relaxation is derived by exploiting the degrees of freedom of the embedding space of positive semidefinite matrices. We show that the global minimum of the relaxed convex problem can be interpreted as probability distribution over the original space of matching matrices, providing a basis for efficiently sampling all close-to-optimal combinatorial matchings within the original solution space. As a result, the approach can even handle completely ambiguous situations, despite uniqueness of the relaxed convex problem. Exhaustive numerical experiments demonstrate the promising performance of the approach which – up to a single inevitable regularization parameter that weights feature similarity against structural similarity – is free of any further tuning parameters.
Clustering by passing messages between data points.
(2007)

Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such "exemplars" can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only if that initial choice is close to a good solution. We devised a method called "affinity propagation," which takes as input measures of similarity between pairs of data points. Real-valued messages are exchanged between data points until a high-quality set of exemplars and corresponding clusters gradually emerges. We used affinity propagation to cluster images of faces, detect genes in microarray data, identify representative sentences in this manuscript, and identify cities that are efficiently accessed by airline travel. Affinity propagation found clusters with much lower error than other methods, and it did so in less than one-hundredth the amount of time.
A Comparison of String Metrics for Matching Names and Records
(2003)

We describe an open-source Java toolkit of methods for matching names and records. We summarize results obtained from using various string distance metrics on the task of matching entity names: these metrics include distance functions proposed by several different communities, including edit-distance metrics, fast heuristic string comparators, token-based distance metrics, and hybrid methods. We then describe an extension to the toolkit which allows records to be compared. We discuss some issues involved in performing a similar comparison for record-matching techniques, and finally present results for some baseline record-matching algorithms which are based on string comparisons between fields.
Development and validation of blue ray, an optical modem for the MEDUSA class AUVs
(2016)

Wireless optical communications are emerging as a viable solution for high-speed data transmission over short ranges in the ocean, complementing mainstream acoustic communication systems that operate over much longer ranges, but at lower data rates. The current drive to develop cooperative autonomous vehicular systems to carry out surveying and other complex missions in the ocean critically depends on the existence of such communication links to share sensory and coordination information. This paper presents a compact, low power consumption, cost-efficient, and lightweight optical modem designed for fast data transmission between MEDUSA underwater vehicles at ranges on the order of 10 m. The transmitter uses LEDs for ON-OFF keying, while the receiver front-end adopts a transimpedance architecture with a photodiode detector. This simplistic transmission and reception technique reduces the overall design and hardware complexities compared to, e.g., laser diodes and photomultiplier tubes. The LEDs are arranged in a circular array, with a photodiode at the centre to enable half-duplex operation. These modems are designed to achieve data rates of 20-200 kb/s over short-range, line-of-sight, configurations. A transparent casing is customised to fit the Medusa vehicles, with proper alignment for inter-vehicle communication when they move in formation.