SoroushVahidi/scidocs huggingface dataset:
Enabling agricultural automation to optimize utilization of water, fertilizer and insecticides by implementing Internet of Things (IoT)
(2016)

With the proliferation of smart devices, Internet can be extended into the physical realm of Internet-of-Things (IoT) by deploying them into a communicating-actuating network. In Ion, sensors and actuators blend seamlessly with the environment; collaborate globally with each other through internet to accomplish a specific task. Wireless Sensor Network (WSN) can be integrated into Ion to meet the challenges of seamless communication between any things (e.g., humans or objects). The potentialities of IoT can be brought to the benefit of society by developing novel applications in transportation and logistics, healthcare, agriculture, smart environment (home, office or plant). This research gives a framework of optimizing resources (water, fertilizers, insecticides and manual labour) in agriculture through the use of IoT. The issues involved in the implementation of applications are also investigated in the paper. This frame work is named as AgriTech.
A review on stress inducement stimuli for assessing human stress using physiological signals
(2011)

Assessing human stress in real-time is more difficult and challenging today. The present review deals about the measurement of stress in laboratory environment using different stress inducement stimuli by the help of physiological signals. Previous researchers have been used different stress inducement stimuli such as stroop colour word test (CWT), mental arithmetic test, public speaking task, cold pressor test, computer games and works used to induce the stress. Most of the researchers have been analyzed stress using questionnaire based approach and physiological signals. The several physiological signals like Electrocardiogram (ECG), Electromyogram (EMG), Galvanic Skin Response (GSR), Blood Pressure (BP), Skin Temperature (ST), Blood Volume Pulse (BVP), respiration rate (RIP) and Electroencephalogram (EEG) were briefly investigated to identify the stress. Different statistical methods like Analysis of variance (ANOVA), two-way ANOVA, Multivariate analysis of variance (MANOVA), t-test, paired t-tests and student t-tests have used to describe the correlation between stress inducement stimuli, subjective parameters (age, gender and etc.,) and physiological signals. This present works aims to find the most appropriate stress inducement stimuli, physiological signals and statistical method to efficiently asses the human stress.
Towards Principled Methods for Training Generative Adversarial Networks
(2017)

The goal of this paper is not to introduce a single algorithm or method, but to make theoretical steps towards fully understanding the training dynamics of generative adversarial networks. In order to substantiate our theoretical analysis, we perform targeted experiments to verify our assumptions, illustrate our claims, and quantify the phenomena. This paper is divided into three sections. The first section introduces the problem at hand. The second section is dedicated to studying and proving rigorously the problems including instability and saturation that arize when training generative adversarial networks. The third section examines a practical and theoretically grounded direction towards solving these problems, while introducing new tools to study them.
Design Exploration of Hybrid CMOS and Memristor Circuit by New Modified Nodal Analysis
(2012)

Design of hybrid circuits and systems based on CMOS and nano-device requires rethinking of fundamental circuit analysis to aid design exploration. Conventional circuit analysis with modified nodal analysis (MNA) cannot consider new nano-devices such as memristor together with the traditional CMOS devices. This paper has introduced a new MNA method with magnetic flux (Φ) as new state variable. New SPICE-like circuit simulator is thereby developed for the design of hybrid CMOS and memristor circuits. A number of CMOS and memristor-based designs are explored, such as oscillator, chaotic circuit, programmable logic, analog-learning circuit, and crossbar memory, where their functionality, performance, reliability and power can be efficiently verified by the newly developed simulator. Specifically, one new 3-D-crossbar architecture with diode-added memristor is also proposed to improve integration density and to avoid sneak path during read-write operation.
Facial Expression Recognition with Convolutional Neural Networks
(2016)

Facial expression recognition systems have attracted much research interest within the field of artificial intelligence. Many established facial expression recognition (FER) systems apply standard machine learning to extracted image features, and these methods generalize poorly to previously unseen data. This project builds upon recent research to classify images of human faces into discrete emotion categories using convolutional neural networks (CNNs). We experimented with different architectures and methods such as fractional max-pooling and finetuning, ultimately achieving an accuracy of 0.48 in a sevenclass classification task.
Object Constraint Language (OCL): A Definitive Guide
(2012)

The Object Constraint Language (OCL) started as a complement of the UML notation with the goal to overcome the limitations of UML (and in general, any graphical notation) in terms of precisely specifying detailed aspects of a system design. Since then, OCL has become a key component of any model-driven engineering (MDE) technique as the default language for expressing all kinds of (meta)model query, manipulation and specification requirements. Among many other applications, OCL is frequently used to express model transformations (as part of the source and target patterns of transformation rules), well-formedness rules (as part of the definition of new domain-specific languages), or code-generation templates (as a way to express the generation patterns and rules). This chapter pretends to provide a comprehensive view of this language, its many applications and available tool support as well as the latest research developments and open challenges around it.
Generating Descriptions with Grounded and Co-referenced People
(2017)

Learning how to generate descriptions of images or videos received major interest both in the Computer Vision and Natural Language Processing communities. While a few works have proposed to learn a grounding during the generation process in an unsupervised way (via an attention mechanism), it remains unclear how good the quality of the grounding is and whether it benefits the description quality. In this work we propose a movie description model which learns to generate description and jointly ground (localize) the mentioned characters as well as do visual co-reference resolution between pairs of consecutive sentences/clips. We also propose to use weak localization supervision through character mentions provided in movie descriptions to learn the character grounding. At training time, we first learn how to localize characters by relating their visual appearance to mentions in the descriptions via a semi-supervised approach. We then provide this (noisy) supervision into our description model which greatly improves its performance. Our proposed description model improves over prior work w.r.t. generated description quality and additionally provides grounding and local co-reference resolution. We evaluate it on the MPII Movie Description dataset using automatic and human evaluation measures and using our newly collected grounding and co-reference data for characters.
Water content of latent fingerprints - Dispelling the myth.
(2016)

Changing procedures in the handling of rare and precious documents in museums and elsewhere, based on assumptions about constituents of latent fingerprints, have led the author to an examination of available data. These changes appear to have been triggered by one paper using general biological data regarding eccrine sweat production to infer that deposited fingerprints are mostly water. Searching the fingerprint literature has revealed a number of reference works similarly quoting figures for average water content of deposited fingerprints of 98% or more. Whilst accurate estimation is difficult there is no evidence that the residue on fingers could be anything like 98% water, even if there were no contamination from sebaceous glands. Consideration of published analytical data of real fingerprints, and several theoretical considerations regarding evaporation and replenishment rates, indicates a probable initial average water content of a fingerprint, soon after deposition, of 20% or less.
A multiscale measure for mixing
(2005)

We present a multiscale measure for mixing that is based on the concept of weak convergence and averages the “mixedness” of an advected scalar field at various scales. This new measure, referred to as the Mix-Norm, resolves the inability of the L2 variance of the scalar density field to capture small-scale variations when advected by chaotic maps or flows. In addition, the Mix-Norm succeeds in capturing the efficiency of a mixing protocol in the context of a particular initial scalar field, wherein Lyapunov-exponent based measures fail to do so. We relate the Mix-Norm to the classical ergodic theoretic notion of mixing and present its formulation in terms of the power spectrum of the scalar field. We demonstrate the utility of the Mix-Norm by showing how it measures the efficiency of mixing due to various discrete dynamical systems and to diffusion. In particular, we show that the Mix-Norm can capture known exponential and algebraic mixing properties of certain maps. We also analyze numerically the behaviour of scalar fields evolved by the Standard Map using the Mix-Norm. © 2005 Elsevier B.V. All rights reserved.
Artificial cooperative search algorithm for numerical optimization problems
(2013)

In this paper, a new two-population based global search algorithm, the Artificial Cooperative Search Algorithm (ACS), is introduced. ACS algorithm has been developed to be used in solving real-valued numerical optimization problems. For purposes of examining the success of ACS algorithm in solving numerical optimization problems, 91 benchmark problems that have different specifications were used in the detailed tests. The success of ACS algorithm in solving the related benchmark problems was compared to the successes obtained by PSO, SADE, CLPSO, BBO, CMA-ES, CK and DSA algorithms in solving the related benchmark problems by using Wilcoxon Signed-Rank Statistical Test with Bonferroni-Holm correction. The results obtained in the statistical analysis demonstrate that the success achieved by ACS algorithm in solving numerical optimization problems is better in comparison to the other computational intelligence algorithms used in this paper. 2012 Elsevier Inc. All rights reserved.
Abstraction Refinement for Probabilistic Software
(2008)

ion Refinement for Probabilistic Software Mark Kattenbelt, Marta Kwiatkowska, Gethin Norman, and David Parker Oxford University Computing Laboratory, Parks Road, Oxford, OX1 3QD Abstract. We present a methodology and implementation for verifying ANSI-C programs that exhibit probabilistic behaviour, such as failures or randomisation. We use abstraction-refinement techniques that represent We present a methodology and implementation for verifying ANSI-C programs that exhibit probabilistic behaviour, such as failures or randomisation. We use abstraction-refinement techniques that represent probabilistic programs as Markov decision processes and their abstractions as stochastic two-player games. Our techniques target quantitative properties of software such as “the maximum probability of file-transfer failure” or “the minimum expected number of loop iterations” and the abstractions we construct yield lower and upper bounds on these properties, which then guide the refinement process. We build upon stateof-the-art techniques and tools, using SAT-based predicate abstraction, symbolic implementations of probabilistic model checking and components from GOTO-CC, SATABS and PRISM. Experimental results show that our approach performs very well in practice, successfully verifying actual networking software whose complexity is significantly beyond the scope of existing probabilistic verification tools.
A study of SSL Proxy attacks on Android and iOS mobile applications
(2014)

According to recent articles in popular technology websites, some mobile applications function in an insecure manner when presented with untrusted SSL certificates. These non-browser based applications seem to, in the absence of a standard way of alerting a user of an SSL error, accept any certificate presented to it. This paper intends to research these claims and show whether or not an invisible proxy based SSL attack can indeed steal user's credentials from mobile applications, and which types applications are most likely to be vulnerable to this attack vector. To ensure coverage of the most popular platforms, applications on both Android 4.2 and iOS 6 are tested. The results of our study showed that stealing credentials is indeed possible using invisible proxy man in the middle attacks.
Transient effects in application of PWM inverters to induction motors
(1991)

Standard squirrel cage induction motors are subjected to nonsinusoidal wave shapes, when supplied from adjustable frequency inverters. In addition to causing increased heating, these wave patterns can be destructive to the insulation. Pulse width modulated (PWM) inverter output amplitudes and risetimes are investigated, and motor insulation capabilities are discussed. Voltage reflections are simulated for various cable lengths and risetimes and are presented graphically. Simulations confirm potential problems with long cables and short risetimes. Application precautions are also discussed.<<ETX>>
Achieving Fairness through Adversarial Learning: an Application to Recidivism Prediction
(2018)

Recidivism prediction scores are used across the USA to determine sentencing and supervision for hundreds of thousands of inmates. One such generator of recidivism prediction scores is Northpointe's Correctional Offender Management Profiling for Alternative Sanctions (COMPAS) score, used in states like California and Florida, which past research has shown to be biased against black inmates according to certain measures of fairness. To counteract this racial bias, we present an adversarially-trained neural network that predicts recidivism and is trained to remove racial bias. When comparing the results of our model to COMPAS, we gain predictive accuracy and get closer to achieving two out of three measures of fairness: parity and equality of odds. Our model can be generalized to any prediction and demographic. This piece of research contributes an example of scientific replication and simplification in a high-stakes real-world application like recidivism prediction.
Perpetual development: A model of the Linux kernel life cycle
(2012)

Software evolution is widely recognized as an important and common phenomenon, whereby the system follows an ever-extending development trajectory w ith intermittent releases. Nevertheless there have been only few lifecycle models that attempt to por tray such evolution. We use the evolution of the Linux kernel as the basis for the formulation of such a model, integrating the progress in time with growth of the codebase, and differentiating bet ween development of new functionality and maintenance of production versions. A unique elem nt of the model is the sequence of activities involved in releasing new production versions, and how this has changed with the growth of Linux. In particular, the release follow-up phase before th forking of a new development version, which was prominent in early releases of production ve rsions, has been eliminated in favor of a concurrent merge window in the release of 2.6.x versions . We also show that a piecewise linear model with increasing slopes provides the best descr iption of the growth of Linux. The perpetual development model is used as a framework in which c ommonly recognized benefits of incremental and evolutionary development may be demonstra ted, nd to comment on issues such as architecture, conservation of familiarity, and failed p rojects. We suggest that this model and variants thereof may apply to many other projects in additio n to Linux.
Robust Monte Carlo localization for mobile robots
(2001)

Mobile robot localization is the problem of determining a robot's pose from sensor data. Monte Carlo Localization is a family of algorithms for localization based on particle filters, which are approximate Bayes filters that use random samples for posterior estimation. Recently, they have been applied with great success for robot localization. Unfortunately, regular particle filters perform poorly in certain situations. Mixture-MCL, the algorithm described here, overcomes these problems by using a "dual" sampler, integrating two complimentary ways of generating samples in the estimation. To apply this algorithm for mobile robot localization, a kd-tree is learned from data that permits fast dual sampling. Systematic empirical results obtained using data collected in crowded public places illustrate superior performance, robustness, and efficiency, when compared to other state-of-the-art localization algorithms.
Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories
(2006)

This paper presents a method for recognizing scene categories based on approximate global geometric correspondence. This technique works by partitioning the image into increasingly fine sub-regions and computing histograms of local features found inside each sub-region. The resulting "spatial pyramid" is a simple and computationally efficient extension of an orderless bag-of-features image representation, and it shows significantly improved performance on challenging scene categorization tasks. Specifically, our proposed method exceeds the state of the art on the Caltech-101 database and achieves high accuracy on a large database of fifteen natural scene categories. The spatial pyramid framework also offers insights into the success of several recently proposed image descriptions, including Torralba’s "gist" and Lowe’s SIFT descriptors.
What, where and who? Classifying events by scene and object recognition
(2007)

We propose a first attempt to classify events in static images by integrating scene and object categorizations. We define an event in a static image as a human activity taking place in a specific environment. In this paper, we use a number of sport games such as snow boarding, rock climbing or badminton to demonstrate event classification. Our goal is to classify the event in the image as well as to provide a number of semantic labels to the objects and scene environment within the image. For example, given a rowing scene, our algorithm recognizes the event as rowing by classifying the environment as a lake and recognizing the critical objects in the image as athletes, rowing boat, water, etc. We achieve this integrative and holistic recognition through a generative graphical model. We have assembled a highly challenging database of 8 widely varied sport events. We show that our system is capable of classifying these event classes at 73.4% accuracy. While each component of the model contributes to the final recognition, using scene or objects alone cannot achieve this performance.
Multiresolution Gray-Scale and Rotation Invariant Texture Classification with Local Binary Patterns
(2002)

ÐThis paper presents a theoretically very simple, yet efficient, multiresolution approach to gray-scale and rotation invariant texture classification based on local binary patterns and nonparametric discrimination of sample and prototype distributions. The method is based on recognizing that certain local binary patterns, termed auniform,o are fundamental properties of local image texture and their occurrence histogram is proven to be a very powerful texture feature. We derive a generalized gray-scale and rotation invariant operator presentation that allows for detecting the auniformo patterns for any quantization of the angular space and for any spatial resolution and presents a method for combining multiple operators for multiresolution analysis. The proposed approach is very robust in terms of gray-scale variations since the operator is, by definition, invariant against any monotonic transformation of the gray scale. Another advantage is computational simplicity as the operator can be realized with a few operations in a small neighborhood and a lookup table. Excellent experimental results obtained in true problems of rotation invariance, where the classifier is trained at one particular rotation angle and tested with samples from other rotation angles, demonstrate that good discrimination can be achieved with the occurrence statistics of simple rotation invariant local binary patterns. These operators characterize the spatial configuration of local image texture and the performance can be further improved by combining them with rotation invariant variance measures that characterize the contrast of local image texture. The joint distributions of these orthogonal measures are shown to be very powerful tools for rotation invariant texture analysis. Index TermsÐNonparametric, texture analysis, Outex, Brodatz, distribution, histogram, contrast.
Emotion recognition system using brain and peripheral signals: Using correlation dimension to improve the results of EEG
(2009)

This paper proposed a multimodal fusion between brain and peripheral signals for emotion detection. The input signals were electroencephalogram, galvanic skin resistance, temperature, blood pressure and respiration, which can reflect the influence of emotion on the central nervous system and autonomic nervous system respectively. The acquisition protocol is based on a subset of pictures which correspond to three specific areas of valance-arousal emotional space (positively excited, negatively excited, and calm). The features extracted from input signals, and to improve the results, correlation dimension as a strong nonlinear feature is used for brain signals. The performance of the Quadratic Discriminant Classifier has been evaluated on different feature sets: peripheral signals, EEG's, and both. In comparison among the results of different feature sets, EEG signals seem to perform better than other physiological signals, and the results confirm the interest of using brain signals as peripherals in emotion assessment. According to the improvement in EEG results compare in each raw of the table, it seems that nonlinear features would lead to better understanding of how emotional activities work.