SoroushVahidi/scidocs huggingface dataset:
Deep Visuo-Tactile Learning: Estimation of Material Properties from Images
(2018)

Estimation of materials properties, such as softness or roughness from visual perception is an essential factor in deciding our way of interaction with our environment in e.g., object manipulation tasks or walking. In this research, we propose a method for deep visuo-tactile learning in which we train a encoder-decoder network with an intermediate layer in an unsupervised manner with images as input and tactile sequences as output. Materials properties are then represented in the intermediate layer as a continuous feature space and are estimated from image information. Unlike past studies utilizing tactile sensors focusing on classification for object recognition or recognizing material properties, our method does not require manually designing class labels or annotation, does not cause unknown objects to be classified into known discrete classes, and can be used without a tactile sensor after training. To collect data for training, we have attached a uSkin tactile sensor and a camera to the end-effector of a Sawyer robot to stroke surfaces of 21 different material surfaces. Our results after training show that features are indeed expressed continuously, and that our method is able to handle unknown objects in its feature space.
Dynamic modeling and inverse dynamic control of mobile robot
(2017)

This paper presents a dynamic modeling and control studies of mobile robot. The robot is mainly built all around three wheels and platform. A mathematical model of unicycle mobile robot is determined by kinematic and dynamic model. The dynamic modelling equations are based on Lagrangian formulation. The motion control strategy is based on the inverse of dynamic control. This leads to accurate tracking of trajectory. The goal to reach in this paper is to improve the performances of inverse dynamic control of mobile robot. The validity of the proposed controller is demonstrated by the simulation of two wheels mobile robots case.
A Method for Building Personalized Ontology Summaries
(2013)

In the context of ontology engineering, the ontology understanding is the basis for its further development and reuse. One intuitive effective approach to support ontology understanding is the process of ontology summarization which highlights the most important concepts of an ontology. Ontology summarization identifies an excerpt from an ontology that contains the most relevant concepts and produces an abridged ontology. In this article, we present a method for summarizing ontologies that represent a data source schema or describe a knowledge domain. We propose an algorithm to produce a personalized ontology summary based on user-defined parameters, e.g. summary size. The relevance of a concept is determined through user indication or centrality measures, commonly used to determine the relative importance of a vertex within a graph. The algorithm searches for the best ontology summary, i.e., the one containing the most relevant ontology concepts respecting all the original relationships between concepts and the parameters set by the user. Experiments were done comparing our generated ontology summaries against golden standard summaries as well as summaries produced by methods available in related work. We achieved in average more than 62.5% of similarity with golden standard summaries.
Systematic Review of Clustering High-Dimensional and Large Datasets
(2018)

Technological advancement has enabled us to store and process huge amount of data in relatively short spans of time. The nature of data is rapidly changing, particularly its dimensionality is more commonly multi- and high-dimensional. There is an immediate need to expand our focus to include analysis of high-dimensional and large datasets. Data analysis is becoming a mammoth task, due to incremental increase in data volume and complexity in terms of heterogony of data. It is due to this dynamic computing environment that the existing techniques either need to be modified or discarded to handle new data in multiple high-dimensions. Data clustering is a tool that is used in many disciplines, including data mining, so that meaningful knowledge can be extracted from seemingly unstructured data. The aim of this article is to understand the problem of clustering and various approaches addressing this problem. This article discusses the process of clustering from both microviews (data treating) and macroviews (overall clustering process). Different distance and similarity measures, which form the cornerstone of effective data clustering, are also identified. Further, an in-depth analysis of different clustering approaches focused on data mining, dealing with large-scale datasets is given. These approaches are comprehensively compared to bring out a clear differentiation among them. This article also surveys the problem of high-dimensional data and the existing approaches, that makes it more relevant. It also explores the latest trends in cluster analysis, and the real-life applications of this concept. This survey is exhaustive as it tries to cover all the aspects of clustering in the field of data mining.
Scalable Distributed Stream Processing
(2003)

Many stream-based applications are naturally distributed. Applications are often embedded in an environment with numerous connected computing devices with heterogeneous capabilities. As data travels from its point of origin (e.g., sensors) downstream to applications, it passes through many computing devices, each of which is a potential target of computation. Furthermore, to cope with time-varying load spikes and changing demand, many servers would be brought to bear on the problem. In both cases, distributed computation is the norm. Abstract
CLOUDS: A Decision Tree Classifier for Large Datasets
(1998)

Classification for very large datasets has many practical applications in data mining. Techniques such as discretization and dataset sampling can be used to scale up decision tree classifiers to large datasets. Unfortunately, both of these techniques can cause a significant loss in accuracy. We present a novel decision tree classifier called CLOUDS, which samples the splitting points for numeric attributes followed by an estimation step to narrow the search space of the best split. CLOUDS reduces computation and I/O complexity substantially compared to state of the art classifters, while maintaining the quality of the generated trees in terms of accuracy and tree size. We provide experimental results with a number of real and synthetic data~ets.
What are the Gaps in Mobile Patient Portal? Mining Users Feedback Using Topic Modeling
(2018)

Patient portals are positioned as a central component of patient engagement through the potential to change the physician-patient relationship and enable chronic disease self-management. In this article, we extend the existing literature by discovering design gaps for patient portals from a systematic analysis of negative users’ feedback from the actual use of patient portals. Specifically, we adopt topic modeling approach, LDA algorithm, to discover design gaps from online low rating user reviews of a common mobile patient portal, EPIC’s mychart. To validate the extracted gaps, we compared the results of LDA analysis with that of human analysis. Overall, the results revealed opportunities to improve collaboration and to enhance the design of portals intended for patientcentered care.
Text-to-3 D Scene Generation using Semantic Parsing and Spatial Knowledge with Rule Based System
(2017)

Scene Generation plays an important role in digital media to represent a news or a specific domain to the viewers. It’s not easy to produce a scene from a text. Text may not completely express the whole situation in digital media. Most of the people are not conscious about the news until it's not visualized to them. Text to 3D scene generation is a process where people do not need to read a news. The 3D Scene will represent the situation. It will help people to conscious about their life. In this paper, we introduce a rule-based framework where scene generated from text using semantic parsing and spatial knowledge. Semantic parsing has identified the templates, objects, and constraints and spatial knowledge have built the relation between object and template. Our rule based framework has identified the uncountable noun and some spatial relations to generate 3D scenes.
A deadlock prevention method for railway networks using monitors for colored Petri nets
(2003)

The real-time traffic control of railway networks authorizes movements of the trains and imposes safety constraints. The paper deals with the real time traffic control focusing on deadlock prevention problem. Colored Petri nets are used to model the dynamics of the railway network system: places represent tracks and stations, tokens are trains. The prevention policy is expressed by a set of linear inequality constraints, called colored Generalized Mutual Exclusion Constraints that are enforced by adding appropriate monitor places. Using digraph tools, deadlock situations are characterized and a strategy is established to define off-line a set of Generalized Mutual Exclusion Constraints that prevent deadlock. An example shows in detail the design of the proposed control logic.
User Preference Modeling and Exploitation in IoT Scenarios
(2018)

Recommender Systems are commonly used in web applications to support users in finding items of their interest. We here propose to use Recommender Systems in Internet of Things scenarios to support human decision making in the physical world. For instance, users' choices (visit actions) for points of interests (POIs) while they explore a sensor enabled city can be tracked and used to generate recommendations for not yet visited POIs. In this PhD research, we propose a novel learning approach for generating an explainable human behaviour model and relevant recommendations in sensor enabled areas. Moreover, we propose techniques for simulating user behaviour and analyse the collective dynamics of a population of users.
The Race Between Man and Machine : Implications of Technology for Growth , Factor Shares and Employment
(2015)

The advent of automation and the simultaneous decline in the labor share and employment among advanced economies raises concerns that labor will be marginalized and made redundant by new technologies. This paper examines this proposition in a task-based framework wherein not only are tasks previously performed by labor automated, but also more complex versions of existing tasks, in which labor has a comparative advantage, can be created. We fully characterize the structure of equilibrium in this model, establishing how the allocation of factors to tasks and factor prices are determined by the available technology and the endogenous choices of firms between capital and labor. We then demonstrate that although automation tends to reduce employment and the share of labor in national income, the creation of more complex tasks has the opposite effect. Our full model endogenizes the direction of research and development towards automation and the creation of new complex tasks. We show that, under reasonable conditions, there exists a stable balanced growth path in which the two types of innovations go hand-in-hand. Consequently, an increase in automation reduces the wage to rental rate ratio, and thus discourages further automation, encourages greater creation of more labor-intensive tasks, and restores the share of labor in national income and the employment to population ratio back towards their initial values. Though the economy is self-correcting, the equilibrium allocation of research effort is not optimal: to the extent that wages reflect quasi-rents for workers, firms will engage in too much automation. Finally, we extend the model to include workers of different skills. We find that inequality increases during transitions, but the self-correcting forces also serve to limit the increase in inequality over longer periods. Still in Progress. Comments Welcome. ∗We thank Philippe Aghion, David Autor, Erik Brynjolfsson, Chad Jones, and seminar participants at the AEA 2015, the MIT Initiative on the Digital Economy, and the NBER 2015 Economic Growth Group for their valuable comments.
Stock Market Forecasting Using Machine Learning Algorithms
(2012)

Prediction of stock market is a long-time attractive topic to researchers from different fields. In particular, numerous studies have been conducted to predict the movement of stock market using machine learning algorithms such as support vector machine (SVM) and reinforcement learning. In this project, we propose a new prediction algorithm that exploits the temporal correlation among global stock markets and various financial products to predict the next-day stock trend with the aid of SVM. Numerical results indicate a prediction accuracy of 74.4% in NASDAQ, 76% in S&P500 and 77.6% in DJIA. The same algorithm is also applied with different regression algorithms to trace the actual increment in the markets. Finally, a simple trading model is established to study the performance of the proposed prediction algorithm against other benchmarks.
A LSTM-based method for stock returns prediction: A case study of China stock market
(2015)

The presented paper modeled and predicted China stock returns using LSTM. The historical data of China stock market were transformed into 30-days-long sequences with 10 learning features and 3-day earning rate labeling. The model was fitted by training on 900000 sequences and tested using the other 311361 sequences. Compared with random prediction method, our LSTM model improved the accuracy of stock returns prediction from 14.3% to 27.2%. The efforts demonstrated the power of LSTM in stock market prediction in China, which is mechanical yet much more unpredictable.
Learning to trade via direct reinforcement
(2001)

We present methods for optimizing portfolios, asset allocations, and trading systems based on direct reinforcement (DR). In this approach, investment decision-making is viewed as a stochastic control problem, and strategies are discovered directly. We present an adaptive algorithm called recurrent reinforcement learning (RRL) for discovering investment policies. The need to build forecasting models is eliminated, and better trading performance is obtained. The direct reinforcement approach differs from dynamic programming and reinforcement algorithms such as TD-learning and Q-learning, which attempt to estimate a value function for the control problem. We find that the RRL direct reinforcement framework enables a simpler problem representation, avoids Bellman's curse of dimensionality and offers compelling advantages in efficiency. We demonstrate how direct reinforcement can be used to optimize risk-adjusted investment returns (including the differential Sharpe ratio), while accounting for the effects of transaction costs. In extensive simulation work using real financial data, we find that our approach based on RRL produces better trading strategies than systems utilizing Q-learning (a value function method). Real-world applications include an intra-daily currency trader and a monthly asset allocation system for the S&P 500 Stock Index and T-Bills.
A Multi-task Deep Network for Person Re-identification
(2016)

Person re-identification (ReID) focuses on identifying people across different scenes in video surveillance, which is usually formulated as a binary classification task or a ranking task in current person ReID approaches. In this paper, we take both tasks into account and propose a multi-task deep network (MTDnet) that makes use of their own advantages and jointly optimize the two tasks simultaneously for person ReID. To the best of our knowledge, we are the first to integrate both tasks in one network to solve the person ReID. We show that our proposed architecture significantly boosts the performance. Furthermore, deep architecture in general requires a sufficient dataset for training, which is usually not met in person ReID. To cope with this situation, we further extend the MTDnet and propose a cross-domain architecture that is capable of using an auxiliary set to assist training on small target sets. In the experiments, our approach outperforms most of existing person ReID algorithms on representative datasets including CUHK03, CUHK01, VIPeR, iLIDS and PRID2011, which clearly demonstrates the effectiveness of the proposed approach.
T-S Fuzzy Path Controller Design for the Omnidirectional Mobile Robot
(2006)

This paper focuses on the design of T-S fuzzy path controller for improving the high-speed tracking accuracy of a four-wheel omnidirectional mobile robot (ODMR). Usually, when an ODMR moves in high speed, the adverse effects induced by Coriolis force significantly deteriorate the tracking performances. In this paper, a T-S fuzzy control designed with both the state feedback and path tracking error is proposed to meet the design specifications. Moreover, a new approach of kinematics inversion considering the nonlinear term of coordinate transform is proposed to simplify the analysis of ODMR motion. Finally, an example is provided to compare the present T-S fuzzy path controller with the well-tuned PID controller. The simulation results indicate that the proposed approach provides much better tracking performances as the speed of ODMR increases
Beam-steerable patch antenna array using parasitic coupling and reactive loading
(2007)

A parasitically-coupled and reactively-loaded patch antenna array is demonstrated to achieve beam steering in an analog manner. The strong parasitic coupling between closely-spaced patch antennas is used to form a phased array with a single driven element. The phase shift between the array elements is adjustable by changing the reactive loading on the parasitic patch antenna. A prototype of this antenna array is demonstrated at 2.3 GHz.
Food Image Recognition via Superpixel Based Low-Level and Mid-Level Distance Coding for Smart Home Applications
(2017)

Food image recognition is a key enabler for many smart home applications such as smart kitchen and smart personal nutrition log. In order to improve living experience and life quality, smart home systems collect valuable insights of users’ preferences, nutrition intake and health conditions via accurate and robust food image recognition. In addition, efficiency is also a major concern since many smart home applications are deployed on mobile devices where high-end GPUs are not available. In this paper, we investigate compact and efficient food image recognition methods, namely low-level and mid-level approaches. Considering the real application scenario where only limited and noisy data are available, we first proposed a superpixel based Linear Distance Coding (LDC) framework where distinctive low-level food image features are extracted to improve performance. On a challenging small food image dataset where only 12 training images are available per category, our framework has shown superior performance in both accuracy and robustness. In addition, to better model deformable food part distribution, we extend LDC’s feature-to-class distance idea and propose a mid-level superpixel food parts-to-class distance mining framework. The proposed framework show superior performance on a benchmark food image datasets compared to other low-level and mid-level approaches in the literature.
Vulnerability , risk and adaptation : A conceptual framework
(2002)

The purpose of this paper is to present a tentative conceptual framework for studies of vulnerability and adaptation to climate variability and change, generally applicable to a wide range of contexts, systems and hazards. Social vulnerability is distinguished from biophysical vulnerability, which is broadly equivalent to the natural hazards concept of risk. The IPCC definition of vulnerability is discussed within this context, which helps us to reconcile apparently contradictory definitions of vulnerability. A concise typology of physically defined hazards is presented; the relationship between the vulnerability and adaptive capacity of a human system depends critically on the nature of the hazard faced. Adaptation by a system may be inhibited by process originating outside the system; it is therefore important to consider " external " obstacles to adaptation, and links across scales, when assessing adaptive capacity.
Boosting Neural Machine Translation
(2017)

Training efficiency is one of the main problems for Neural Machine Translation (NMT). Deep networks need for very large data as well as many training iterations to achieve state-of-the-art performance. This results in very high computation cost, slowing down research and industrialisation. In this paper, we propose to alleviate this problem with several training methods based on data boosting and bootstrap with no modifications to the neural network. It imitates the learning process of humans, which typically spend more time when learning “difficult” concepts than easier ones. We experiment on an English-French translation task showing accuracy improvements of up to 1.63 BLEU while saving 20% of training time.
Markov Chain Monte Carlo with People
(2007)

Many formal models of cognition implicitly use subjective probability distributions to capture the assumptions of human learners. Most applications of these models determine these distributions indirectly. We propose a method for directly determining the assumptions of human learners by sampling from subjective probability distributions. Using a correspondence between a model of human choice and Markov chain Monte Carlo (MCMC), we describe a method for sampling from the distributions over objects that people associate with different categories. In our task, subjects choose whether to accept or reject a proposed change to an object. The task is constructed so that these decisions follow an MCMC acceptance rule, defining a Markov chain for which the stationary distribution is the category distribution. We test this procedure for both artificial categories acquired in the laboratory, and natural categories acquired from experience.
An Approach to Capture Role-Based Access Control Models from Spring Web Applications
(2017)

To mitigate potential misinterpretation and security violations, software developers should use tools that reflect the state of web applications and visualise them as graphical models. Modelling helps to ensure that functionality and access control mechanisms are consistently interconnected. In this paper, we propose an approach to support Web application development using the Spring platform. Our proposal is supported by the Eclipse IDE plugin tool, which recognises Spring Security configuration captures, its notations, and visualises them in the role-based access control (RBAC) models. The RBAC models are represented using SecureUML modelling language. The plugin is validated through survey taken by software developers.