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

Physical Sciences and Mathematics Commons™

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

Artificial Intelligence and Robotics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 8221 - 8250 of 8476

Full-Text Articles in Physical Sciences and Mathematics

Dewey: The First Ghost-Buster?, Leslie Marsh Jan 2006

Dewey: The First Ghost-Buster?, Leslie Marsh

Leslie Marsh

Ghost-busting, or less colloquially, anti-Cartesianism or non-representationalism, is a loose and internally fluid coalition (philosophical and empirical) comprising Dynamical, Embodied, Extended, Distributed, and Situated (DEEDS) theories of cognition. Gilbert Ryle – DEEDS’ anglophonic masthead [1] – supposedly exorcised the Cartesian propensity to postulate mind as an apparition-like entity somehow situated in the body. Ryle’s behaviouristic recommendation was, that just as we don’t see the wind blowing but only see the trees waving, so too should we conceive intelligence as manifest though action. The Cartesian ghost of old has mutated, taking the form of the ‘Machine in the Machine’, the brain …

Go to article

Computer Models For Legal Prediction, Kevin D. Ashley, Stephanie Bruninghaus Jan 2006

Computer Models For Legal Prediction, Kevin D. Ashley, Stephanie Bruninghaus

Articles

Computerized algorithms for predicting the outcomes of legal problems can extract and present information from particular databases of cases to guide the legal analysis of new problems. They can have practical value despite the limitations that make reliance on predictions risky for other real-world purposes such as estimating settlement values. An algorithm's ability to generate reasonable legal arguments also is important. In this article, computerized prediction algorithms are compared not only in terms of accuracy, but also in terms of their ability to explain predictions and to integrate predictions and arguments. Our approach, the Issue-Based Prediction algorithm, is a program …

Go to article

Incremental Generation Of Spatial Referring Expressions In Situated Dialogue, John D. Kelleher, Geert-Jan Kruijff Jan 2006

Incremental Generation Of Spatial Referring Expressions In Situated Dialogue, John D. Kelleher, Geert-Jan Kruijff

Conference papers

This paper presents an approach to incrementally generating locative expressions. It addresses the issue of combinatorial explosion inherent in the construction of relational context models by: (a) contextually defining the set of objects in the context that may function as a landmark, and (b) sequencing the order in which spatial relations are considered using a cognitively motivated hierarchy of relations, and visual and discourse salience.

Go to article

Examination Dialogue: An Argumentation Framework For Critically Questioning An Expert Opinion, Douglas Walton Jan 2006

Examination Dialogue: An Argumentation Framework For Critically Questioning An Expert Opinion, Douglas Walton

CRRAR Publications

Recent work in argumentation theory (Walton and Krabbe, 1995; Walton, 2005) and artificial intelligence (Bench-Capon, 1992, 2003; Cawsey, 1992; McBurney and Parsons, 2002; Bench-Capon and Prakken, 2005) uses types of dialogue as contexts of argument use. This paper provides an analysis of a special type called examination dialogue, in which one party questions another party, sometimes critically or even antagonistically, to try to find out what that party knows about something. This type of dialogue is most prominent in law and in both legal and non-legal arguments based on expert opinion. It is also central to dialogue systems for questioning …

Go to article

Proximity In Context: An Empirically Grounded Computational Model Of Proximity For Processing Topological Spatial Expression., John D. Kelleher, Geert-Jan Kruijff, Fintan Costello Jan 2006

Proximity In Context: An Empirically Grounded Computational Model Of Proximity For Processing Topological Spatial Expression., John D. Kelleher, Geert-Jan Kruijff, Fintan Costello

Conference papers

The paper presents a new model for context-dependent interpretation of linguistic expressions about spatial proximity between objects in a natural scene. The paper discusses novel psycholinguistic experimental data that tests and verifies the model. The model has been implemented, and enables a conversational robot to identify objects in a scene through topological spatial relations (e.g. ''X near Y''). The model can help motivate the choice between topological and projective prepositions.

Go to article

A Computational Model Of The Referential Semantics Of Projective Prepositions, John D. Kelleher, Josef Van Genabith Jan 2006

A Computational Model Of The Referential Semantics Of Projective Prepositions, John D. Kelleher, Josef Van Genabith

Conference papers

In this paper we present a framework for interpreting locative expressions containing the prepositions in front of and behind. These prepositions have different semantics in the viewer-centred and intrinsic frames of reference (Vandeloise, 1991). We define a model of their semantics in each frame of reference. The basis of these models is a novel parameterized continuum function that creates a 3-D spatial template. In the intrinsic frame of reference the origin used by the continuum function is assumed to be known a priori and object occlusion does not impact on the applicability rating of a point in the spatial template. …

Go to article

Visualization For Analyzing Trajectory-Based Metaheuristic Search Algorithms, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau Jan 2006

Visualization For Analyzing Trajectory-Based Metaheuristic Search Algorithms, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Multiagent Teamwork: Hybrid Approaches, Praveen Paruchuri, Emma Bowring, Ranjit Nair, Jonathan Pearce, Nathan Schurr, Milind Tambe, Pradeep Varakantham Jan 2006

Multiagent Teamwork: Hybrid Approaches, Praveen Paruchuri, Emma Bowring, Ranjit Nair, Jonathan Pearce, Nathan Schurr, Milind Tambe, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Today within the multiagent community, we see at least four competing methods to building multiagent systems: beliefdesireintention (BDI), distributed constraint optimization (DCOP), distributed POMDPs, and auctions or game-theoretic methods. While there is exciting progress within each approach, there is a lack of cross-cutting research. This article highlights the various hybrid techniques for multiagent teamwork developed by the teamcore group. In particular, for the past decade, the TEAMCORE research group has focused on building agent teams in complex, dynamic domains. While our early work was inspired by BDI, we will present an overview of recent research that uses DCOPs and distributed …

Go to article

Hybrid Committee Classifier For A Computerized Colonic Polyp Detection System, Jiang Li, Jianhua Yao, Nicholas Petrick, Ronald M. Summers, Amy K. Hara, Joseph M. Reinhardt (Ed.), Josien P.W. Pluim (Ed.) Jan 2006

Hybrid Committee Classifier For A Computerized Colonic Polyp Detection System, Jiang Li, Jianhua Yao, Nicholas Petrick, Ronald M. Summers, Amy K. Hara, Joseph M. Reinhardt (Ed.), Josien P.W. Pluim (Ed.)

Electrical & Computer Engineering Faculty Publications

We present a hybrid committee classifier for computer-aided detection (CAD) of colonic polyps in CT colonography (CTC). The classifier involved an ensemble of support vector machines (SVM) and neural networks (NN) for classification, a progressive search algorithm for selecting a set of features used by the SVMs and a floating search algorithm for selecting features used by the NNs. A total of 102 quantitative features were calculated for each polyp candidate found by a prototype CAD system. 3 features were selected for each of 7 SVM classifiers which were then combined to form a committee of SVMs classifier. Similarly, features …

Go to article

The History Of Computer Games, Jill Cirasella, Danny Kopec Jan 2006

The History Of Computer Games, Jill Cirasella, Danny Kopec

Publications and Research

This handout presents milestones in the history of computer backgammon, computer bridge, computer checkers, computer chess, computer Go, computer Othello, and computer poker.

Go to article

A History Of Political Experience, Leslie Marsh Dec 2005

A History Of Political Experience, Leslie Marsh

Leslie Marsh

This book survives superficial but fails deeper scrutiny. A facile, undiscerning criticism of Lectures in the History of Political Thought (LHPT) is that on Oakeshott’s own account these are lectures on a non-subject: ‘I cannot detect anything which could properly correspond to the expression “the history of political thought”’ (p. 32). This is an entirely typical Oakeshottian swipe – elegant and oblique – at the title of the lecture course he inherited from Harold Laski. If title and quotation sit awkwardly we should remember that Oakeshott never prepared the text for publication – a fortiori he did not prepare it …

Go to article

Functional Connectivity In A Baseline Resting-State Network In Autism, Vladimir Cherkassky, Rajesh Kana, Timothy Keller, Marcel Just Dec 2005

Functional Connectivity In A Baseline Resting-State Network In Autism, Vladimir Cherkassky, Rajesh Kana, Timothy Keller, Marcel Just

Marcel Adam Just

No abstract provided.

Go to article

Brain Correlates Of Discourse Processing: An Fmri Investigation Of Irony And Conventional Metaphor Comprehension, Zohar Eviatar, Marcel Adam Just Dec 2005

Brain Correlates Of Discourse Processing: An Fmri Investigation Of Irony And Conventional Metaphor Comprehension, Zohar Eviatar, Marcel Adam Just

Marcel Adam Just

No abstract provided.

Go to article

Sentence Comprehension In Autism: Thinking In Pictures With Decreased Functional Connectivity, Rajesh K. Kana, Timothy A. Keller, Vladimir L. Cherkassky, Nancy J. Minshew, Marcel Adam Just Dec 2005

Sentence Comprehension In Autism: Thinking In Pictures With Decreased Functional Connectivity, Rajesh K. Kana, Timothy A. Keller, Vladimir L. Cherkassky, Nancy J. Minshew, Marcel Adam Just

Marcel Adam Just

No abstract provided.

Go to article

Neural Basis Of Dyslexia: A Comparison Between Dyslexic And Non-Dyslexic Children Equated For Reading Ability, Fumiko Hoeft, Arvel Hernandez, Glenn Mcmillon, Heather Taylor-Hill, Jennifer L. Martindale, Ann Meyler, Timothy A. Keller, Wai Ting Siok, Gayle K. Deutsch, Marcel Adam Just, Susan Whitfield-Gabrieli, John D. E. Gabrieli Dec 2005

Neural Basis Of Dyslexia: A Comparison Between Dyslexic And Non-Dyslexic Children Equated For Reading Ability, Fumiko Hoeft, Arvel Hernandez, Glenn Mcmillon, Heather Taylor-Hill, Jennifer L. Martindale, Ann Meyler, Timothy A. Keller, Wai Ting Siok, Gayle K. Deutsch, Marcel Adam Just, Susan Whitfield-Gabrieli, John D. E. Gabrieli

Marcel Adam Just

No abstract provided.

Go to article

Integration Of Probabilistic Graphic Models For Decision Support, Jiang C., Poh K., Tze-Yun Leong Dec 2005

Integration Of Probabilistic Graphic Models For Decision Support, Jiang C., Poh K., Tze-Yun Leong

Research Collection School Of Computing and Information Systems

It is a frequently encountered problem that new knowledge arrived when making decisions in a dynamic world. Usually, domain experts cannot afford enough time and knowledge to effectively assess and combine both qualitative and quantitative information in these models. Existing approaches can solve only one of two tasks instead of both. We propose a four-step algorithm to integrate multiple probabilistic graphic models, which can effectively update existing models with newly acquired models. In this algorithm, the qualitative part of model integration is performed first, followed by the quantitative combination. We illustrate our method with an example of combining three models. …

Go to article

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan Dec 2005

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan

Research Collection School Of Computing and Information Systems

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a well- designed set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that …

Go to article

Enhancing Undergraduate Ai Courses Through Machine Learning Projects, Ingrid Russell, Zdravko Markov, Todd W. Neller, Susan Coleman Oct 2005

Enhancing Undergraduate Ai Courses Through Machine Learning Projects, Ingrid Russell, Zdravko Markov, Todd W. Neller, Susan Coleman

Computer Science Faculty Publications

It is generally recognized that an undergraduate introductory Artificial Intelligence course is challenging to teach. This is, in part, due to the diverse and seemingly disconnected core topics that are typically covered. The paper presents work funded by the National Science Foundation to address this problem and to enhance the student learning experience in the course. Our work involves the development of an adaptable framework for the presentation of core AI topics through a unifying theme of machine learning. A suite of hands-on semester-long projects are developed, each involving the design and implementation of a learning system that enhances a …

Go to article

Cooperative Reinforcement Learning Using An Expert-Measuring Weighted Strategy With Wolf, Kevin Cousin, Gilbert L. Peterson Sep 2005

Cooperative Reinforcement Learning Using An Expert-Measuring Weighted Strategy With Wolf, Kevin Cousin, Gilbert L. Peterson

Faculty Publications

Gradient descent learning algorithms have proven effective in solving mixed strategy games. The policy hill climbing (PHC) variants of WoLF (Win or Learn Fast) and PDWoLF (Policy Dynamics based WoLF) have both shown rapid convergence to equilibrium solutions by increasing the accuracy of their gradient parameters over standard Q-learning. Likewise, cooperative learning techniques using weighted strategy sharing (WSS) and expertness measurements improve agent performance when multiple agents are solving a common goal. By combining these cooperative techniques with fast gradient descent learning, an agent’s performance converges to a solution at an even faster rate. This statement is verified in a …

Go to article

Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework, Hoong Chuin Lau, Lei Zhang, Chang Liu Sep 2005

Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework, Hoong Chuin Lau, Lei Zhang, Chang Liu

Research Collection School Of Computing and Information Systems

The Open Constraint Optimization Problem (OCOP) refers to the COP where constraints and variable domains can change over time and agents' opinions have to be sought over a distributed network to form a solution. The openness of the problem has caused conventional approaches to COP such as branch-and-bound to fail to find optimal solutions. OCOP is a new problem and the approach to find an optimal solution (minimum total cost) introduced in [1] is based on an unrealistic assumption that agents are willing to report their options in nondecreasing order of cost. In this paper, we study a generalized OCOP …

Go to article

Service-Oriented E-Learning Architecture Using Web Service-Based Intelligent Agents, Nasir Hussain, M. Khalid Khan Aug 2005

Service-Oriented E-Learning Architecture Using Web Service-Based Intelligent Agents, Nasir Hussain, M. Khalid Khan

International Conference on Information and Communication Technologies

There is no doubt that e-learning has found its way in our lives. From the very start to the Ph.D. level one can find e-learning courses every where and all the big names are supporting it. One thing that is needed to be understood is that e-learning is basically the integration of various technologies. Now this technology is maturing and we can find different standards for e-learning .New technologies such as agents and web services are promising better results. In this paper we have proposed an e-learning architecture that is dependent on multi-agent systems and web services. These communication technologies …

Go to article

Poster Session A: Fingerprint Matching Using Ridge Patterns, Muhammad Umer Munir, Dr. Muhammad Younus Javed Aug 2005

Poster Session A: Fingerprint Matching Using Ridge Patterns, Muhammad Umer Munir, Dr. Muhammad Younus Javed

International Conference on Information and Communication Technologies

This paper presents a fingerprint matching scheme that utilizes a ridge patterns to match fingerprint images. The proposed scheme uses a set of 16 Gabor filters where spatial frequencies correspond to the average inter-ridge spacing in fingerprints. It is used to capture the ridge strength at equally spaced orientations. A circular tessellation of filtered image is then used to construct the ridge feature map. This ridge feature map contains both global and local details in a fingerprint as a compact fixed length feature vector. The fingerprint matching is based on the Euclidean distance between two corresponding feature vectors. The genuine …

Go to article

Poster Session A: Face Recognition Using Sub-Holistic Pca, Muhammad Murtaza Khan, Dr. Muhammad Younus Javed, Muhammad Almas Anjum Aug 2005

Poster Session A: Face Recognition Using Sub-Holistic Pca, Muhammad Murtaza Khan, Dr. Muhammad Younus Javed, Muhammad Almas Anjum

International Conference on Information and Communication Technologies

This paper proposes a face recognition scheme that enhances the correct face recognition rate as compared to conventional Principal Component Analysis (PCA). The proposed scheme, Sub-Holistic PCA (SH-PCA), was tested using ORL database and out performed PCA for all test scenarios. SH-PCA requires more computational power and memory as compared to PCA however it yields an improvement of 6% correct recognition on the complete ORL database of 400 images. The correct recognition rate for the complete ORL database is 90% for the SH-PCA technique.

Go to article

Tuning Tabu Search Strategies Via Visual Diagnosis, Steven Halim, Wee Chong Wan, Hoong Chuin Lau Aug 2005

Tuning Tabu Search Strategies Via Visual Diagnosis, Steven Halim, Wee Chong Wan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

While designing working metaheuristics can be straightforward, tuning them to solve the underlying combinatorial optimization problem well can be tricky. Several tuning methods have been proposed but they do not address the new aspect of our proposed classification of the metaheuristic tuning problem: tuning search strategies. We propose a tuning methodology based on Visual Diagnosis and a generic tool called Visualizer for Metaheuristics Development Framework(V-MDF) to address specifically the problem of tuning search (particularly Tabu Search) strategies. Under V-MDF, we propose the use of a Distance Radar visualizer where the human and computer can collaborate to diagnose the occurrence of …

Go to article

Evaluation Of Time-Varying Availability In Multi-Echelon Inventory System With Combat Damage, Hoong Chuin Lau, Huawei Song Aug 2005

Evaluation Of Time-Varying Availability In Multi-Echelon Inventory System With Combat Damage, Hoong Chuin Lau, Huawei Song

Research Collection School Of Computing and Information Systems

The models for multi-echelon inventory systems in existing literatures predominantly address failures due to reliability in peacetime. In wartime or even peacetime operational scenarios, unexpected combat damage can cause a large number of systems to be heavily damaged, to the extent that they become irreparable. In this paper, we study a multi-echelon spare parts support system under combat damage, discuss the replenishment policy and propose an approximate method to evaluate the time-varying system performance operational availability considering the effect of passivation. Experiments show our model works well and efficiently against simulation.

Go to article

Exploiting Belief Bounds: Practical Pomdps For Personal Assistant Agents, Pradeep Varakantham, Rajiv Maheswaran, Milind Tambe Jul 2005

Exploiting Belief Bounds: Practical Pomdps For Personal Assistant Agents, Pradeep Varakantham, Rajiv Maheswaran, Milind Tambe

Research Collection School Of Computing and Information Systems

Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users themselves) and making periodic decisions based on such monitoring. POMDPs appear well suited to enable agents to address these challenges, given the uncertain environment and cost of actions, but optimal policy generation for POMDPs is computationally expensive. This paper introduces three key techniques to speedup POMDP policy generation that exploit the notion of progress or dynamics in personal assistant domains. Policy computation is restricted to the belief space polytope that remains …

Go to article

Valuations Of Possible States (Vps): A Unifying Quantitative Framework For Evaluating Privacy In Collaboration, Rajiv T. Maheswaran, Jonathan Pearce, Pradeep Varakantham, Emma Bowring, Milind Tambe Jul 2005

Valuations Of Possible States (Vps): A Unifying Quantitative Framework For Evaluating Privacy In Collaboration, Rajiv T. Maheswaran, Jonathan Pearce, Pradeep Varakantham, Emma Bowring, Milind Tambe

Research Collection School Of Computing and Information Systems

For agents deployed in real-world settings, such as businesses, universities and research laboratories, it is critical that agents protect their individual users’ privacy when interacting with others entities. Indeed, privacy is recognized as a key motivating factor in design of several multiagent algorithms, such as distributed constraint optimization (DCOP) algorithms. Unfortunately, rigorous and general quantitative metrics for analysis and comparison of such multiagent algorithms with respect to privacy loss are lacking. This paper takes a key step towards developing a general quantitative model from which one can analyze and generate metrics of privacy loss by introducing the VPS (Valuations of …

Go to article

Approximate Strategic Reasoning Through Hierarchical Reduction Of Large Symmetric Games, Michael P. Wellman, Daniel M. Reeves, Kevin M. Lochner, Shih-Fen Cheng, Rahul Suri Jul 2005

Approximate Strategic Reasoning Through Hierarchical Reduction Of Large Symmetric Games, Michael P. Wellman, Daniel M. Reeves, Kevin M. Lochner, Shih-Fen Cheng, Rahul Suri

Research Collection School Of Computing and Information Systems

To deal with exponential growth in the size of a game with the number of agents, we propose an approximation based on a hierarchy of reduced games. The reduced game achieves savings by restricting the number of agents playing any strategy to fixed multiples. We validate the idea through experiments on randomly generated local-effect games. An extended application to strategic reasoning about a complex trading scenario motivates the approach, and demonstrates methods for game-theoretic reasoning over incompletely-specified games at multiple levels of granularity.

Go to article

Evaluating Online Trust Using Machine Learning Methods, Weihua Song Apr 2005

Evaluating Online Trust Using Machine Learning Methods, Weihua Song

Doctoral Dissertations

Trust plays an important role in e-commerce, P2P networks, and information filtering. Current challenges in trust evaluations include: (1) fnding trustworthy recommenders, (2) aggregating heterogeneous trust recommendations of different trust standards based on correlated observations and different evaluation processes, and (3) managing efficiently large trust systems where users may be sparsely connected and have multiple local reputations. The purpose of this dissertation is to provide solutions to these three challenges by applying ordered depth-first search, neural network, and hidden Markov model techniques. It designs an opinion filtered recommendation trust model to derive personal trust from heterogeneous recommendations; develops a reputation …

Go to article

Walverine: A Walrasian Trading Agent, Shih-Fen Cheng, Evan Leung, Kevin M. Lochner, Kevin O'Malley, Daniel M. Reeves, Julian L. Schvartzman, Michael P. Wellman Apr 2005

Walverine: A Walrasian Trading Agent, Shih-Fen Cheng, Evan Leung, Kevin M. Lochner, Kevin O'Malley, Daniel M. Reeves, Julian L. Schvartzman, Michael P. Wellman

Research Collection School Of Computing and Information Systems

TAC-02 was the third in a series of Trading Agent Competition events fostering research in automating trading strategies by showcasing alternate approaches in an open-invitation market game. TAC presents a challenging travel-shopping scenario where agents must satisfy client preferences for complementary and substitutable goods by interacting through a variety of market types. Michigan's entry, Walverine, bases its decisions on a competitive (Walrasian) analysis of the TAC travel economy. Using this Walrasian model, we construct a decision-theoretic formulation of the optimal bidding problem, which Walverine solves in each round of bidding for each good. Walverine's optimal bidding approach, as well as …

Go to article

First Prev Next Last