SoroushVahidi/scidocs huggingface dataset:
Finding academic experts on a multisensor approach using Shannon's entropy
(2013)

Expert finding is an information retrieval task concerned wi th the search for the most knowledgeable people, in some topic, with basis on document s describing peoples activities. The task involves taking a user query as input and retur ning a list of people sorted by their level of expertise regarding the user query. This pape r introduces a novel approach for combining multiple estimators of expertise based on a mu ltisensor data fusion framework together with the Dempster-Shafer theory of evidence a nd Shannon’s entropy. More specifically, we defined three sensors which detect heteroge neous information derived from the textual contents, from the graph structure of the citati on patterns for the community of experts, and from profile information about the academic exp erts. Given the evidences collected, each sensor may define different candidates as ex perts and consequently do not agree in a final ranking decision. To deal with these conflicts , we applied the DempsterShafer theory of evidence combined with Shannon’s Entropy f rmula to fuse this information and come up with a more accurate and reliable final rankin g list. Experiments made over two datasets of academic publications from the Compute r Science domain attest for the adequacy of the proposed approach over the traditional s tate of the art approaches. We also made experiments against representative supervised s tat of the art algorithms. Results revealed that the proposed method achieved a similar p erformance when compared to these supervised techniques, confirming the capabilities o f the proposed framework. This work was supported by national funds through FCT Funda ção para a Ciência e a Tecnologia, under project PEst-OE/EEI/LA0021/2011 and supported by nationa l funds through FCT Fundação para a Ciência e a Tecnologia, under project PTDC/EIA-CCO/119722/2010
Crowd detection and management using cascade classifier on ARMv8 and OpenCV-Python
(2017)

The steady increase in population and overcrowding has become an unavoidable factor in any public gathering or on the street during any festive occasions. The intelligent monitoring technology has been developing in recent years and human tracking has made a lot of progress. In this paper, we propose a method to manage the crowd by keeping in track the count of the people in the scene. In our study, we develop a system using Raspberry Pi 3 board that consists of ARMv8 CPU that detects the human heads and provide a count of humans in the region using OpenCV-Python. A Haar cascade classifier is trained for human head detection. Human tracking is achieved by indicating the direction of movement of the person. The results of the analysis will be helpful in managing the crowd in any area with high density of crowds.
ClusType: Effective Entity Recognition and Typing by Relation Phrase-Based Clustering
(2015)

Entity recognition is an important but challenging research problem. In reality, many text collections are from specific, dynamic, or emerging domains, which poses significant new challenges for entity recognition with increase in name ambiguity and context sparsity, requiring entity detection without domain restriction. In this paper, we investigate entity recognition (ER) with distant-supervision and propose a novel relation phrase-based ER framework, called ClusType, that runs data-driven phrase mining to generate entity mention candidates and relation phrases, and enforces the principle that relation phrases should be softly clustered when propagating type information between their argument entities. Then we predict the type of each entity mention based on the type signatures of its co-occurring relation phrases and the type indicators of its surface name, as computed over the corpus. Specifically, we formulate a joint optimization problem for two tasks, type propagation with relation phrases and multi-view relation phrase clustering. Our experiments on multiple genres---news, Yelp reviews and tweets---demonstrate the effectiveness and robustness of ClusType, with an average of 37% improvement in F1 score over the best compared method.
Make new friends, but keep the old: recommending people on social networking sites
(2009)

This paper studies people recommendations designed to help users find known, offline contacts and discover new friends on social networking sites. We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3,000 users. We found all algorithms effective in expanding users' friend lists. Algorithms based on social network information were able to produce better-received recommendations and find more known contacts for users, while algorithms using similarity of user-created content were stronger in discovering new friends. We also collected qualitative feedback from our survey users and draw several meaningful design implications.
Learning for Semantic Parsing
(2007)

Semantic parsing is the task of mapping a natural language sentence into a complete, formal meaning representation. Over the past decade, we have developed a number of machine learning methods for inducing semantic parsers by training on a corpus of sentences paired with their meaning representations in a specified formal language. We have demonstrated these methods on the automated construction of naturallanguage interfaces to databases and robot command languages. This paper reviews our prior work on this topic and discusses directions for future research.
Evaluation of Different Control Strategies for Teams of Unmanned Marine Vehicles ( UMVs ) Comparing the Requirements of Underwater Communication and Navigation in MATLAB ® Simulations
(2007)

Thomas Glotzbach, TU Ilmenau; Fraunhofer Center for Applied Systems Technology, Ilmenau/Germany, thomas.glotzbach@tu-ilmenau.de Andrea Picini, INNOVA S.p.A., Rome/Italy, a.picini@innova-eu.net Antonio Zangrilli, INNOVA S.p.A., Rome/Italy, a.zangrilli@innova-eu.net Mike Eichhorn, TU Ilmenau/Germany, mike.eichhorn@tu-ilmenau.de Peter Otto, TU Ilmenau/Germany, peter.otto@tu-ilmenau.de Matthias Schneider, TU Ilmenau/Germany, schneider.matthias@tu-ilmenau.de
Entity Comparison in RDF Graphs
(2017)

In many applications, there is an increasing need for the new types of RDF data analysis that are not covered by standard reasoning tasks such as SPARQL query answering. One such important analysis task is entity comparison, i.e., determining what are similarities and differences between two given entities in an RDF graph. For instance, in an RDF graph about drugs, we may want to compare Metamizole and Ibuprofen and automatically find out that they are similar in that they are both analgesics but, in contrast to Metamizole, Ibuprofen also has a considerable anti-inflammatory effect. Entity comparison is a widely used functionality available in many information systems, such as universities or product comparison websites. However, comparison is typically domain-specific and depends on a fixed set of aspects to compare. In this paper, we propose a formal framework for domain-independent entity comparison over RDF graphs. We model similarities and differences between entities as SPARQL queries satisfying certain additional properties, and propose algorithms for computing them.
G-SQL: Fast Query Processing via Graph Exploration
(2016)

A lot of real-life data are of graph nature. However, it is not until recently that business begins to exploit data’s connectedness for business insights. On the other hand, RDBMSs are a mature technology for data management, but they are not for graph processing. Take graph traversal, a common graph operation for example, it heavily relies on a graph primitive that accesses a given node’s neighborhood. We need to join tables following foreign keys to access the nodes in the neighborhood if an RDBMS is used to manage graph data. Graph exploration is a fundamental building block of many graph algorithms. But this simple operation is costly due to a large volume of I/O caused by the massive amount of table joins. In this paper, we present G-SQL, our effort toward the integration of a RDBMS and a native in-memory graph processing engine. G-SQL leverages the fast graph exploration capability provided by the graph engine to answer multi-way join queries. Meanwhile, it uses RDBMSs to provide mature data management functionalities, such as reliable data storage and additional data access methods. Specifically, G-SQL is a SQL dialect augmented with graph exploration functionalities and it dispatches query tasks to the in-memory graph engine and its underlying RDMBS. The G-SQL runtime coordinates the two query processors via a unified cost model to ensure the entire query is processed efficiently. Experimental results show that our approach greatly expands capabilities of RDBMs and delivers exceptional performance for SQL-graph hybrid queries.
Kinect Gesture Recognition for Interactive System
(2012)

Gaming systems like Kinect and XBox always have to tackle the problem of extracting features from video data sets and classifying the body movement. In this study, reasonable features like human joints positions, joints velocities, joint angles and joint angular velocities are extracted. We used several machine learning methods including Naive Bayes, Support Vector Machine and Random Forest to learn and classify the human gestures. Simulation results and the final confusion matrix show that by combining delicately preprocessed data sets and Random Forest methods, the F-scores of the correct predictions can be maximized. Such methods can also be applied in real-time scenarios.
Differentially private aggregation of distributed time-series with transformation and encryption
(2010)

We propose the first differentially private aggregation algorithm for distributed time-series data that offers good practical utility without any trusted server. This addresses two important challenges in participatory data-mining applications where (i) individual users collect temporally correlated time-series data (such as location traces, web history, personal health data), and (ii) an untrusted third-party aggregator wishes to run aggregate queries on the data.
 To ensure differential privacy for time-series data despite the presence of temporal correlation, we propose the Fourier Perturbation Algorithm (FPAk). Standard differential privacy techniques perform poorly for time-series data. To answer n queries, such techniques can result in a noise of Θ(n) to each query answer, making the answers practically useless if n is large. Our FPAk algorithm perturbs the Discrete Fourier Transform of the query answers. For answering n queries, FPAk improves the expected error from Θ(n) to roughly Θ(k) where k is the number of Fourier coefficients that can (approximately) reconstruct all the n query answers. Our experiments show that k << n for many real-life data-sets resulting in a huge error-improvement for FPAk.
 To deal with the absence of a trusted central server, we propose the Distributed Laplace Perturbation Algorithm (DLPA) to add noise in a distributed way in order to guarantee differential privacy. To the best of our knowledge, DLPA is the first distributed differentially private algorithm that can scale with a large number of users: DLPA outperforms the only other distributed solution for differential privacy proposed so far, by reducing the computational load per user from O(U) to O(1) where U is the number of users.
Modeling and execution of event stream processing in business processes
(2014)

The Internet of Things and Cyber-physical Systems provide enormous amounts of real-time data in form of streams of events. Businesses can benefit from the integration of these real-world data; new services can be provided to customers, or existing business processes can be improved. Events are a well-known concept in business processes. However, there is no appropriate abstraction mechanism to encapsulate event stream processing in units that represent business functions in a coherent manner across the process modeling, process execution, and IT infrastructure layer. In this paper we present Event Stream Processing Units (SPUs) as such an abstraction mechanism. SPUs encapsulate application logic for event stream processing and enable a seamless transition between process models, executable process representations, and components at the IT layer. We derive requirements for SPUs and introduce EPC and BPMN extensions to model SPUs at the abstract and at the technical process layer. We introduce a transformation from SPUs in EPCs to SPUs in BPMN and implement our modeling notation extensions in Software AG ARIS. We present a runtime infrastructure that executes SPUs and supports implicit invocation and completion semantics. We illustrate our approach using a logistics process as running example.
Issues in Implementing IT Governance in Small and Medium Enterprises
(2011)

Nowadays, almost all the enterprises in the world fall in Small Medium Enterprises (SMEs) category even though SMEs has different definitions in different countries. At the same time, there is no exemplar standard and /or framework for information technology (IT) governance for SMEs. This paper presents the main issues in implementing IT governance in SMEs. Firstly, it explains the definition of SMEs and their characteristics, secondly it discusses IT governance definition and its framework. Finally, some issues and approaches for ITG implementation in SMEs are described, and end with conclusion and future work.
UAV with two passive rotating hemispherical shells for physical interaction and power tethering in a complex environment
(2017)

For the past few years, unmanned aerial vehicles (UAVs) have been successfully employed in several investigations and exploration tasks such as aerial inspection and manipulations. However, most of these UAVs are limited to open spaces distant from any obstacles because of the high risk of falling as a result of an exposed propeller or not enough protection. On the other hand, a UAV with a passive rotating spherical shell can fly over a complex environment but cannot engage in physical interaction and perform power tethering because of the passive rotation of the spherical shell. In this study, we propose a new mechanism that allows physical interaction and power tethering while the UAV is well-protected and has a good flight stability, which enables exploration in a complex environment such as disaster sites. We address the current problem by dividing the whole shell into two separate hemispherical shells that provide a gap unaffected by passive rotation. In this paper, we mainly discuss the concept, general applications, and design of the proposed system. The capabilities of the proposed system for physical interaction and power tethering in a complex space were initially verified through laboratory-based test flights of our experimental prototype.
Loop closure detection for visual SLAM using PCANet features
(2016)

Loop closure detection benefits simultaneous localization and mapping (SLAM) in building a consistent map of the environment by reducing the accumulate error. Handcrafted features have been successfully used in traditional approaches, whereas in this paper, we show that unsupervised features extracted by deep learning models, can improves the accuracy of loop closure detection. In particular, we employ a cascaded deep network, namely the PCANet, to extract features as image descriptors. We tested the performance of our proposed method on open datasets to compare with traditional approaches. We found that the PCANet features outperform state-of-the-art handcrafted competitors, and are computational efficient to be implemented in practical robotics.
Taming THC: potential cannabis synergy and phytocannabinoid-terpenoid entourage effects.
(2011)

Tetrahydrocannabinol (THC) has been the primary focus of cannabis research since 1964, when Raphael Mechoulam isolated and synthesized it. More recently, the synergistic contributions of cannabidiol to cannabis pharmacology and analgesia have been scientifically demonstrated. Other phytocannabinoids, including tetrahydrocannabivarin, cannabigerol and cannabichromene, exert additional effects of therapeutic interest. Innovative conventional plant breeding has yielded cannabis chemotypes expressing high titres of each component for future study. This review will explore another echelon of phytotherapeutic agents, the cannabis terpenoids: limonene, myrcene, α-pinene, linalool, β-caryophyllene, caryophyllene oxide, nerolidol and phytol. Terpenoids share a precursor with phytocannabinoids, and are all flavour and fragrance components common to human diets that have been designated Generally Recognized as Safe by the US Food and Drug Administration and other regulatory agencies. Terpenoids are quite potent, and affect animal and even human behaviour when inhaled from ambient air at serum levels in the single digits ng·mL(-1) . They display unique therapeutic effects that may contribute meaningfully to the entourage effects of cannabis-based medicinal extracts. Particular focus will be placed on phytocannabinoid-terpenoid interactions that could produce synergy with respect to treatment of pain, inflammation, depression, anxiety, addiction, epilepsy, cancer, fungal and bacterial infections (including methicillin-resistant Staphylococcus aureus). Scientific evidence is presented for non-cannabinoid plant components as putative antidotes to intoxicating effects of THC that could increase its therapeutic index. Methods for investigating entourage effects in future experiments will be proposed. Phytocannabinoid-terpenoid synergy, if proven, increases the likelihood that an extensive pipeline of new therapeutic products is possible from this venerable plant. http://dx.doi.org/10.1111/bph.2011.163.issue-7.
Autonomous navigation robot for landmine detection applications
(2012)

Modern robotic technologies have provided efficient solutions to protect workers from hazards in the work environments; such as radioactive, toxic, or explosive. This paper presents a design of a holonomic mobile robot for rough terrain that can replace the human role in the demining applications. A suspension system based on the bogie mechanism was adopted in order to overcome rough terrains. The flexible design of the robot enables it to move in any direction at any instant without changing the orientation of the body. The motion of the robot was simulated using the Pro-Engineer software and the robot stability margins for different road conditions were found in order to predict the possibility of tipping-over before any maneuver.
Multilingual Models for Compositional Distributed Semantics
(2014)

We present a novel technique for learning semantic representations, which extends the distributional hypothesis to multilingual data and joint-space embeddings. Our models leverage parallel data and learn to strongly align the embeddings of semantically equivalent sentences, while maintaining sufficient distance between those of dissimilar sentences. The models do not rely on word alignments or any syntactic information and are successfully applied to a number of diverse languages. We extend our approach to learn semantic representations at the document level, too. We evaluate these models on two cross-lingual document classification tasks, outperforming the prior state of the art. Through qualitative analysis and the study of pivoting effects we demonstrate that our representations are semantically plausible and can capture semantic relationships across languages without parallel data.
Modeling Documents with Deep Boltzmann Machines
(2013)

We introduce a type of Deep Boltzmann Machine (DBM) that is suitable for extracting distributed semantic representations from a large unstructured collection of documents. We overcome the apparent difficulty of training a DBM with judicious parameter tying. This enables an efficient pretraining algorithm and a state initialization scheme for fast inference. The model can be trained just as efficiently as a standard Restricted Boltzmann Machine. Our experiments show that the model assigns better log probability to unseen data than the Replicated Softmax model. Features extracted from our model outperform LDA, Replicated Softmax, and DocNADE models on document retrieval and document classification tasks.
Sentiment Classification Using Machine Learning Techniques with Syntax Features
(2015)

Sentiment classification has adopted machine learning techniques to improve its precision and efficiency. However, the features are always produced by basic words-bag methods without much consideration for words' syntactic properties, which could play an important role in the judgment of sentiment meanings. To remedy this, we firstly generate syntax trees of the sentences, with the analysis of syntactic features of the sentences. Then we introduce multiple sentiment features into the basic words-bag features. Such features were trained on movie reviews as data, with machine learning methods (Naive Bayes and support vector machines). The features and factors introduced by syntax tree were examined to generate a more accurate solution for sentiment classification.
SEM-PPA: A semantical pattern and preference-aware service mining method for personalized point of interest recommendation
(2017)

Point-of-Interest (POI) recommendation has received increasing attention in Location-based Social Networks (LBSNs). It involves user behavior analysis, movement pattern model and trajectory sequence prediction, in order to recommend personalized services to target user. Existing POI recommendation methods are confronted with three problems: (1) they only consider the location information of users' check-ins, which causes data sparsity; (2) they fail to consider the order of users' visited locations, which is valuable to reflect the interest or preference of users; (3) users cannot be recommended the suitable services when they move into the new place. To address the above issues, we propose a semantical pattern and preference-aware service mining method called SEM-PPA to make full use of the semantic information of locations for personalized POI recommendation. In SEM-PPA, we firstly propose a novel algorithm to classify the locations into different types for location identification; then we construct the user model for each user from four aspects, which are location trajectory, semantic trajectory, location popularity and user familiarity; in addition, a potential friends discovery algorithm based on movement pattern is proposed. Finally, we conduct extensive experiments to evaluate the recommendation accuracy and recommendation effectiveness on two real-life datasets from GeoLife and Beijing POI. Experimental results show that SEM-PPA can achieve better recommendation performance in particular for sparse data and recommendation accuracy in comparison with other methods.
Depixelizing pixel art
(2011)

We describe a novel algorithm for extracting a resolution-independent vector representation from pixel art images, which enables magnifying the results by an arbitrary amount without image degradation. Our algorithm resolves pixel-scale features in the input and converts them into regions with smoothly varying shading that are crisply separated by piecewise-smooth contour curves. In the original image, pixels are represented on a square pixel lattice, where diagonal neighbors are only connected through a single point. This causes thin features to become visually disconnected under magnification by conventional means, and creates ambiguities in the connectedness and separation of diagonal neighbors. The key to our algorithm is in resolving these ambiguities. This enables us to reshape the pixel cells so that neighboring pixels belonging to the same feature are connected through edges, thereby preserving the feature connectivity under magnification. We reduce pixel aliasing artifacts and improve smoothness by fitting spline curves to contours in the image and optimizing their control points.