Open Access. Powered by Scholars. Published by Universities.®

2012

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 31 - 60 of 67

Full-Text Articles in Artificial Intelligence and Robotics

A Biologically-Inspired Affective Model Based On Cognitive Situational Appraisal, Feng Shu, Ah-Hwee Tan Jun 2012

A Biologically-Inspired Affective Model Based On Cognitive Situational Appraisal, Feng Shu, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Although various emotion models have been proposed based on appraisal theories, most of them focus on designing specific appraisal rules and there is no unified framework for emotional appraisal. Moreover, few existing emotion models are biologically-inspired and are inadequate in imitating emotion process of human brain. This paper proposes a bio-inspired computational model called Cognitive Regulated Affective Architecture (CRAA), inspired by the cognitive regulated emotion theory and the network theory of emotion. This architecture is proposed by taking the following positions: (1) Cognition and emotion are not separated but interacted systems; (2) The appraisal of emotion depends on and should …


Memory Formation, Consolidation, And Forgetting In Learning Agents, Budhitama Susnagdja, Wenwen Wang, Ah-Hwee Tan, Yuan-Sin Tan, Loo-Nin Teow Jun 2012

Memory Formation, Consolidation, And Forgetting In Learning Agents, Budhitama Susnagdja, Wenwen Wang, Ah-Hwee Tan, Yuan-Sin Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

Memory enables past experiences to be remembered and acquired as useful knowledge to support decision making, especially when perception and computational resources are limited. This paper presents a neuropsychological- inspired dual memory model for agents, consisting of an episodic memory that records the agent's experience in real time and a semantic memory that captures factual knowledge through a parallel consolidation process. In addition, the model incorporates a natural forgetting mechanism that prevents memory overloading by removing transient memory traces. Our experimental study based on a real-time first-person-shooter video game has indicated that the memory consolidation and forgetting processes are not …


Stochastic Dominance In Stochastic Dcops For Risk-Sensitive Applications, Nguyen Duc Thien, William Yeoh, Hoong Chuin Lau Jun 2012

Stochastic Dominance In Stochastic Dcops For Risk-Sensitive Applications, Nguyen Duc Thien, William Yeoh, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Distributed constraint optimization problems (DCOPs) are well-suited for modeling multi-agent coordination problems where the primary interactions are between local subsets of agents. However, one limitation of DCOPs is the assumption that the constraint rewards are without uncertainty. Researchers have thus extended DCOPs to Stochastic DCOPs (SDCOPs), where rewards are sampled from known probability distribution reward functions, and introduced algorithms to find solutions with the largest expected reward. Unfortunately, such a solution might be very risky, that is, very likely to result in a poor reward. Thus, in this paper, we make three contributions: (1) we propose a stricter objective for …


Delayed Observation Planning In Partially Observable Domains, Pradeep Reddy Varakantham, Janusz Marecki Jun 2012

Delayed Observation Planning In Partially Observable Domains, Pradeep Reddy Varakantham, Janusz Marecki

Research Collection School Of Computing and Information Systems

Traditional models for planning under uncertainty such as Markov Decision Processes (MDPs) or Partially Observable MDPs (POMDPs) assume that the observations about the results of agent actions are instantly available to the agent. In so doing, they are no longer applicable to domains where observations are received with delays caused by temporary unavailability of information (e.g. delayed response of the market to a new product). To that end, we make the following key contributions towards solving Delayed observation POMDPs (D-POMDPs): (i) We first provide an parameterized approximate algorithm for solving D-POMDPs efficiently, with desired accuracy; and (ii) We then propose …


Active Malware Analysis Using Stochastic Games, Simon Williamson, Pradeep Reddy Varakantham, Debin Gao, Chen Hui Ong Jun 2012

Active Malware Analysis Using Stochastic Games, Simon Williamson, Pradeep Reddy Varakantham, Debin Gao, Chen Hui Ong

Research Collection School Of Computing and Information Systems

Cyber security is increasingly important for defending computer systems from loss of privacy or unauthorised use. One important aspect is threat analysis - how does an attacker infiltrate a system and what do they want once they are inside. This paper considers the problem of Active Malware Analysis, where we learn about the human or software intruder by actively interacting with it with the goal of learning about its behaviours and intentions, whilst at the same time that intruder may be trying to avoid detection or showing those behaviours and intentions. This game-theoretic active learning is then used to obtain …


Prioritized Shaping Of Models For Solving Dec-Pomdps, Pradeep Reddy Varakantham, William Yeoh, Prasanna Velagapudi, Paul Scerri Jun 2012

Prioritized Shaping Of Models For Solving Dec-Pomdps, Pradeep Reddy Varakantham, William Yeoh, Prasanna Velagapudi, Paul Scerri

Research Collection School Of Computing and Information Systems

An interesting class of multi-agent POMDP planning problems can be solved by having agents iteratively solve individual POMDPs, find interactions with other individual plans, shape their transition and reward functions to encourage good interactions and discourage bad ones and then recompute a new plan. D-TREMOR showed that this approach can allow distributed planning for hundreds of agents. However, the quality and speed of the planning process depends on the prioritization scheme used. Lower priority agents shape their models with respect to the models of higher priority agents. In this paper, we introduce a new prioritization scheme that is guaranteed to …


The Interacting Multiple Models Algorithm With State-Dependent Value Assignment, Rastin Rastgoufard May 2012

The Interacting Multiple Models Algorithm With State-Dependent Value Assignment, Rastin Rastgoufard

LSU New Orleans Theses and Dissertations

The value of a state is a measure of its worth, so that, for example, waypoints have high value and regions inside of obstacles have very small value. We propose two methods of incorporating world information as state-dependent modifications to the interacting multiple models (IMM) algorithm, and then we use a game's player-controlled trajectories as ground truths to compare the normal IMM algorithm to versions with our proposed modifications. The two methods involve modifying the model probabilities in the update step and modifying the transition probability matrix in the mixing step based on the assigned values of different target states. …


A Location-Based Incentive Mechanism For Participatory Sensing Systems With Budget Constraints, Luis Gabriel Jaimes May 2012

A Location-Based Incentive Mechanism For Participatory Sensing Systems With Budget Constraints, Luis Gabriel Jaimes

USF Tampa Graduate Theses and Dissertations

Participatory Sensing (PS) systems rely on the willingness of mobile users to participate in the collection and reporting of data using a variety of sensors either embedded or integrated in their

cellular phones. Users agree to use their cellular phone resources to sense and transmit the data of interest because these data will be used to address a collective problem that otherwise would

be very difficult to assess and solve. However, this new data collection paradigm has not been very successful yet mainly because of the lack of incentives for participation and privacy concerns. Without adequate incentive and privacy guaranteeing …


Quest Hierarchy For Hyperspectral Face Recognition, David M. Ryer, Trevor J. Bihl, Kenneth W. Bauer Jr., Steven K. Rogers May 2012

Quest Hierarchy For Hyperspectral Face Recognition, David M. Ryer, Trevor J. Bihl, Kenneth W. Bauer Jr., Steven K. Rogers

Faculty Publications

A qualia exploitation of sensor technology (QUEST) motivated architecture using algorithm fusion and adaptive feedback loops for face recognition for hyperspectral imagery (HSI) is presented. QUEST seeks to develop a general purpose computational intelligence system that captures the beneficial engineering aspects of qualia-based solutions. Qualia-based approaches are constructed from subjective representations and have the ability to detect, distinguish, and characterize entities in the environment Adaptive feedback loops are implemented that enhance performance by reducing candidate subjects in the gallery and by injecting additional probe images during the matching process. The architecture presented provides a framework for exploring more advanced integration …


A Spatially Explicit Agent Based Model Of Muscovy Duck Home Range Behavior, James Howard Anderson Apr 2012

A Spatially Explicit Agent Based Model Of Muscovy Duck Home Range Behavior, James Howard Anderson

USF Tampa Graduate Theses and Dissertations

ABSTRACT

Research in GIScience has identified agent-based simulation methodologies as effective in the study of complex adaptive spatial systems (CASS). CASS are characterized by the emergent nature of their spatial expressions and by the changing relationships between their constituent variables and how those variables act on the system's spatial expression over time. Here, emergence refers to a CASS property where small-scale, individual action results in macroscopic or system-level patterns over time. This research develops and executes a spatially-explicit agent based model of Muscovy Duck home range behavior. Muscovy duck home range behavior is regarded as a complex adaptive spatial system …


Provable De-Anonymization Of Large Datasets With Sparse Dimensions, Anupam Datta, Divya Sharma, Arunesh Sinha Apr 2012

Provable De-Anonymization Of Large Datasets With Sparse Dimensions, Anupam Datta, Divya Sharma, Arunesh Sinha

Research Collection School Of Computing and Information Systems

There is a significant body of empirical work on statistical de-anonymization attacks against databases containing micro-dataabout individuals, e.g., their preferences, movie ratings, or transactiondata. Our goal is to analytically explain why such attacks work. Specifically, we analyze a variant of the Narayanan-Shmatikov algorithm thatwas used to effectively de-anonymize the Netflix database of movie ratings. We prove theorems characterizing mathematical properties of thedatabase and the auxiliary information available to the adversary thatenable two classes of privacy attacks. In the first attack, the adversarysuccessfully identifies the individual about whom she possesses auxiliaryinformation (an isolation attack). In the second attack, the adversarylearns additional …


Motivated Learning For The Development Of Autonomous Agents, Janusz A. Starzyk, James T. Graham, Pawel Raif, Ah-Hwee Tan Apr 2012

Motivated Learning For The Development Of Autonomous Agents, Janusz A. Starzyk, James T. Graham, Pawel Raif, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

A new machine learning approach known as motivated learning (ML) is presented in this work. Motivated learning drives a machine to develop abstract motivations and choose its own goals. ML also provides a self-organizing system that controls a machine’s behavior based on competition between dynamically-changing pain signals. This provides an interplay of externally driven and internally generated control signals. It is demonstrated that ML not only yields a more sophisticated learning mechanism and system of values than reinforcement learning (RL), but is also more efficient in learning complex relations and delivers better performance than RL in dynamically changing environments. In …


Message Passing Algorithms For Map Estimation Using Dc Programming, Akshat Kumar, Shlomo Zilberstein, Marc Toussaint Apr 2012

Message Passing Algorithms For Map Estimation Using Dc Programming, Akshat Kumar, Shlomo Zilberstein, Marc Toussaint

Research Collection School Of Computing and Information Systems

We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of difference of convex functions (DC) programming, and use the concave-convex procedure (CCCP) to develop efficient message-passing solvers. The resulting algorithms are guaranteed to converge to a global optimum of the well-studied local polytope, an outer bound on the MAP marginal polytope. To tighten the outer bound, we show how to combine it with the mean-field based inner bound and, again, solve it using CCCP. We also identify a useful relationship …


Coordinating Occupant Behavior For Building Energy And Comfort Management Using Multi-Agent Systems, Laura Klein, Jun Young Kwak, Geoffrey Kavulya, Farrokh Jazizadeh, Burcin Becerik-Gerber, Pradeep Varakantham, Milind Tambe Mar 2012

Coordinating Occupant Behavior For Building Energy And Comfort Management Using Multi-Agent Systems, Laura Klein, Jun Young Kwak, Geoffrey Kavulya, Farrokh Jazizadeh, Burcin Becerik-Gerber, Pradeep Varakantham, Milind Tambe

Research Collection School Of Computing and Information Systems

There is growing interest in reducing building energy consumption through increased sensor data and increased computational support for building controls. The goal of reduced building energy is often coupled with the desire for improved occupant comfort. Current building systems are inefficient in their energy usage for maintaining occupant comfort as they operate according to fixed schedules and maximum design occupancy assumptions, and they rely on code defined occupant comfort ranges. This paper presents and implements a multi-agent comfort and energy system (MACES) to model alternative management and control of building systems and occupants. MACES specifically improves upon previous multi-agent systems …


Trust And Reputation For Successful Software Self-Organisation, Pierpaolo Dondio, Jean Marc Seigneur Jan 2012

Trust And Reputation For Successful Software Self-Organisation, Pierpaolo Dondio, Jean Marc Seigneur

Books/Book Chapters

Abstract An increasing number of dynamic software evolution approaches is com- monly based on integrating or utilising new pieces of software. This requires reso- lution of issues such as ensuring awareness of newly available software pieces and selection of most appropriate software pieces to use. Other chapters in this book dis- cuss dynamic software evolution focusing primarily on awareness, integration and utilisation of new software pieces, paying less attention on how selection among different software pieces is made. The selection issue is quite important since in the increasingly dynamic software world quite a few new software pieces occur over time, …


Online Path Planning And Control Solution For A Coordinated Attack Of Multiple Unmanned Aerial Vehicles In A Dynamic Environment, Juan Vega-Nevarez Jan 2012

Online Path Planning And Control Solution For A Coordinated Attack Of Multiple Unmanned Aerial Vehicles In A Dynamic Environment, Juan Vega-Nevarez

Electronic Theses and Dissertations

The role of the unmanned aerial vehicle (UAV) has significantly expanded in the military sector during the last decades mainly due to their cost effectiveness and their ability to eliminate the human life risk. Current UAV technology supports a variety of missions and extensive research and development is being performed to further expand its capabilities. One particular field of interest is the area of the low cost expendable UAV since its small price tag makes it an attractive solution for target suppression. A swarm of these low cost UAVs can be utilized as guided munitions or kamikaze UAVs to attack …


Comparing Ai Archetypes And Hybrids Using Blackjack, Robert Edward Noonan Jan 2012

Comparing Ai Archetypes And Hybrids Using Blackjack, Robert Edward Noonan

All Graduate Theses, Dissertations, and Other Capstone Projects

The discipline of artificial intelligence (AI) is a diverse field, with a vast variety of philosophies and implementations to consider. This work attempts to compare several of these paradigms as well as their variations and hybrids, using the card game of blackjack as the field of competition. This is done with an automated blackjack emulator, written in Java, which accepts computer-controlled players of various AI philosophies and their variants, training them and finally pitting them against each other in a series of tournaments with customizable rule sets. In order to avoid bias towards any particular implementation, the system treats each …


Using Self Organizing Maps To Analyze Demographics And Swing State Voting In The 2008 U.S. Presidential Election, Paul T. Pearson, Cameron I. Cooper Jan 2012

Using Self Organizing Maps To Analyze Demographics And Swing State Voting In The 2008 U.S. Presidential Election, Paul T. Pearson, Cameron I. Cooper

Faculty Publications

Emergent self-organizing maps (ESOMs) and k-means clustering are used to cluster counties in each of the states of Florida, Pennsylvania, and Ohio by demographic data from the 2010 United States census. The counties in these clusters are then analyzed for how they voted in the 2008 U.S. Presidential election, and political strategies are discussed that target demographically similar geographical regions based on ESOM results. The ESOM and k-means clusterings are compared and found to be dissimilar by the variation of information distance function.


Profiling Instances In Noise Reduction, Sarah Jane Delany, Nicola Segata, Brian Macnamee Jan 2012

Profiling Instances In Noise Reduction, Sarah Jane Delany, Nicola Segata, Brian Macnamee

Articles

The dependency on the quality of the training data has led to significant work in noise reduction for instance-based learning algorithms. This paper presents an empirical evaluation of current noise reduction techniques, not just from the perspective of their comparative performance, but from the perspective of investigating the types of instances that they focus on for re- moval. A novel instance profiling technique known as RDCL profiling allows the structure of a training set to be analysed at the instance level cate- gorising each instance based on modelling their local competence properties. This profiling approach o↵ers the opportunity of investigating …


The Application Of Fuzzy Granular Computing For The Analysis Of Human Dynamic Behavior In 3d Space, Murad Mohammad Alaqtash Jan 2012

The Application Of Fuzzy Granular Computing For The Analysis Of Human Dynamic Behavior In 3d Space, Murad Mohammad Alaqtash

Open Access Theses & Dissertations

Human dynamic behavior in space is very complex in that it involves many physical, perceptual and motor aspects. It is tied together at a sensory level by linkages between vestibular, visual and somatosensory information that develop through experience of inertial and gravitational reaction forces. Coordinated movement emerges from the interplay among descending output from the central nervous system, sensory input from the body and environment, muscle dynamics, and the emergent dynamics of the whole neuromusculoskeletal system.

There have been many attempts to directly capture the activities of the neuronal system in human locomotion without the ability to clarify how the …


Memristor-Based Reservoir Computing, Manjari S. Kulkarni Jan 2012

Memristor-Based Reservoir Computing, Manjari S. Kulkarni

Dissertations and Theses

In today's nanoscale era, scaling down to even smaller feature sizes poses a significant challenge in the device fabrication, the circuit, and the system design and integration. On the other hand, nanoscale technology has also led to novel materials and devices with unique properties. The memristor is one such emergent nanoscale device that exhibits non-linear current-voltage characteristics and has an inherent memory property, i.e., its current state depends on the past. Both the non-linear and the memory property of memristors have the potential to enable solving spatial and temporal pattern recognition tasks in radically different ways from traditional binary transistor-based …


Scale Invariant Object Recognition Using Cortical Computational Models And A Robotic Platform, Danny Voils Jan 2012

Scale Invariant Object Recognition Using Cortical Computational Models And A Robotic Platform, Danny Voils

Dissertations and Theses

This paper proposes an end-to-end, scale invariant, visual object recognition system, composed of computational components that mimic the cortex in the brain. The system uses a two stage process. The first stage is a filter that extracts scale invariant features from the visual field. The second stage uses inference based spacio-temporal analysis of these features to identify objects in the visual field. The proposed model combines Numenta's Hierarchical Temporal Memory (HTM), with HMAX developed by MIT's Brain and Cognitive Science Department. While these two biologically inspired paradigms are based on what is known about the visual cortex, HTM and HMAX …


Cross-Talk: A Shared Parameter Space For Gesturally Extended Human/Machine Improvisation, William Brent, Adam James Wilson Jan 2012

Cross-Talk: A Shared Parameter Space For Gesturally Extended Human/Machine Improvisation, William Brent, Adam James Wilson

Publications and Research

This paper describes Cross-talk, a piece of music and performance system for two instruments augmented with infrared motion-tracking capability, and an artificial software improviser. Cross-talk was commissioned by the Ammerman Center for Arts and Technology at Connecticut College, for the 13th Biennial Symposium on Arts and Technology. The work is part of an ongoing collaboration focused on developing integrated hardware and software performance systems to extend the timbral and expressive capabilities of traditional musical instruments and to generate musical structure in response to information retrieved from human performers in real-time. Artistic motivations and prior related work are presented here, along …


Sms Spam Filtering: Methods And Data, Sarah Jane Delany, Mark Buckley, Derek Greene Jan 2012

Sms Spam Filtering: Methods And Data, Sarah Jane Delany, Mark Buckley, Derek Greene

Articles

Mobile or SMS spam is a real and growing problem primarily due to the availability of very cheap bulk pre-pay SMS packages and the fact that SMS engenders higher response rates as it is a trusted and personal service. SMS spam filtering is a relatively new task which inherits many issues and solu- tions from email spam filtering. However it poses its own specific challenges. This paper motivates work on filtering SMS spam and reviews recent devel- opments in SMS spam filtering. The paper also discusses the issues with data collection and availability for furthering research in this area, analyses …


Bridging The Research Gap: Making Hri Useful To Individuals With Autism, Elizabeth Kim, Rhea Paul, Frederick Shic, Brian Scassellati Jan 2012

Bridging The Research Gap: Making Hri Useful To Individuals With Autism, Elizabeth Kim, Rhea Paul, Frederick Shic, Brian Scassellati

Communication Disorders Faculty Publications

While there is a rich history of studies involving robots and individuals with autism spectrum disorders (ASD), few of these studies have made substantial impact in the clinical research community. In this paper we first examine how differences in approach, study design, evaluation, and publication practices have hindered uptake of these research results. Based on ten years of collaboration, we suggest a set of design principles that satisfy the needs (both academic and cultural) of both the robotics and clinical autism research communities. Using these principles, we present a study that demonstrates a quantitatively measured improvement in human-human social interaction …


New Multi-Objective Evolutionary Game Theory Algorithm For Border Security, Franciso Oswaldo Aguirre Jan 2012

New Multi-Objective Evolutionary Game Theory Algorithm For Border Security, Franciso Oswaldo Aguirre

Open Access Theses & Dissertations

The complexity of border security relays on the diversity and volume of illegal activity that must be controlled, and the variety of resources that can be deployed to secure the border. A key operational problem encountered by those charged with the task of border security is the scheduling and deployment of patrols. Patrolling can be defined as the act of walking or traveling around an area - network-, at regular intervals, in order to protect or supervise it. The problem of optimizing schedules for patrolling open areas is one that arises in many contexts, and has attracted significant attention from …


Partial Orders For Representing Uncertainty, Causality And Decision Making: General Properties, Operations, And Algorithms, Francisco Adolfo Zapata Jan 2012

Partial Orders For Representing Uncertainty, Causality And Decision Making: General Properties, Operations, And Algorithms, Francisco Adolfo Zapata

Open Access Theses & Dissertations

One of the main objectives of science and engineering is to help people select the most beneficial decisions. To make these decisions, we must know people's preferences, we must have the information about different possible consequences of different decisions. Since information is never absolutely accurate and precise, we must also have information about the degree of certainty of different parts on information. All these types of information naturally lead to partial orders:

- For preferences, a <= b means that b is preferable to a. This relation is used in decision theory.

- For events, a <= b means that a can influence b. This causality relation is one of the fundamental notions of physics, especially of physics of space-time.

* For uncertain statements, a <= b means that a is less certain than b. This relation is used in logics describing uncertainty, such as fuzzy logic.

In each of these areas, there is abundant research about studying the corresponding partial orders. …


Bringing To Life An Ancient Urban Center At Monte Albán, Mexico: Exploiting The Synergy Between The Micro, Meso, And Macro Levels In A Complex System, Thaer W. Jayyousi Jan 2012

Bringing To Life An Ancient Urban Center At Monte Albán, Mexico: Exploiting The Synergy Between The Micro, Meso, And Macro Levels In A Complex System, Thaer W. Jayyousi

Wayne State University Dissertations

In this dissertation, agent-based models of emergent ancient urban centers were constructed through the use of techniques from computational intelligence, agent-based modeling, complex systems, and data-mining of existing archaeological data from the prehistoric urban center, Monte Albán. This real world application was selected because of its importance in understanding the emergence of modern economic and political systems. Specifically, Cultural Algorithms was used to evolve models of early Monte Alban, models that can then be compared with existing models of ancient and modern urban centers.

Features of a complex system were used to help interpret the archaeological data. The analysis went …


Using A Virtual World For Robot Planning, D. Paul Benjamin, John V. Monaco, Yixia Lin, Christopher Funk, Damian M. Lyons Jan 2012

Using A Virtual World For Robot Planning, D. Paul Benjamin, John V. Monaco, Yixia Lin, Christopher Funk, Damian M. Lyons

CSIS Technical Reports

The architecture constructs a real-time virtual copy of the robot and its environment using PhysX, OpenCV, the Point Cloud Library, Soar, and Robot Schemas. A Match-Mediated Difference component compares actual sensory data with corresponding virtual-camera data and alerts the cognitive system to significant divergence. The virtual world can then be run faster than real time to search possible future trajectories for planning.


On A Versatile Stochastic Growth Model, Samiur Arif, Ismail Khalil, Stephan Olariu Jan 2012

On A Versatile Stochastic Growth Model, Samiur Arif, Ismail Khalil, Stephan Olariu

Computer Science Faculty Publications

Growth phenomena are ubiquitous and pervasive not only in biology and the medical sciences, but also in economics, marketing and the computer and social sciences. We introduce a three-parameter version of the classic pure-birth process growth model when suitably instantiated, can be used to model growth phenomena in many seemingly unrelated application domains. We point out that the model is computationally attractive since it admits of conceptually simple, closed form solutions for the time-dependent probabilities.