Gregory M. P. O'Hare

Bio: Gregory M. P. O'Hare is an academic researcher from University College Dublin. The author has contributed to research in topics: Wireless sensor network & Intelligent agent. The author has an hindex of 35, co-authored 376 publications receiving 6109 citations. Previous affiliations of Gregory M. P. O'Hare include Media Lab Europe & Dublin Institute of Technology.

Foundations of distributed artificial intelligence

Abstract: Partial table of contents: FORMULATIVE READINGS. Logical Foundations of Distributed Artificial Intelligence (E. Werner). Distributed Artificial Intelligence Testbeds (K. Decker). COOPERATION, COORDINATION, AND AGENCY. Coordination Techniques for Distributed Artificial Intelligence (N. Jennings). Negotiation Principles (H. Muller). Planning in Distributed Artificial Intelligence (E. Durfee). DAI FRAMEWORKS AND THEIR APPLICATIONS. IMAGINE: An Integrated Environment for Constructing Distributed Artificial Intelligence Systems (D. Steiner). AGenDA--A General Testbed for Distributed Artificial Intelligence Applications (K. Fischer, et al.). Agent Factory: An Environment for the Fabrication of Multiagent Systems (G. O'Hare). RELATED DISCIPLINES. Philosophy and Distributed Artificial Intelligence: The Case of Joint Intention (R. Tuomela). User Design Issues for Distributed Artificial Intelligence (L. Hall). Appendix. Index.

Real-Time Recognition and Profiling of Appliances through a Single Electricity Sensor

Abstract: Sensing, monitoring and actuating systems are expected to play a key role in reducing buildings overall energy consumption. Leveraging sensor systems to support energy efficiency in buildings poses novel research challenges in monitoring space usage, controlling devices, interfacing with smart energy meters and communicating with the energy grid. In the attempt of reducing electricity consumption in buildings, identifying individual sources of energy consumption is key to generate energy awareness and improve efficiency of available energy resources usage. Previous work studied several non-intrusive load monitoring techniques to classify appliances; however, the literature lacks of an comprehensive system that can be easily installed in existing buildings to empower users profiling, benchmarking and recognizing loads in real-time. This has been a major reason holding back the practice adoption of load monitoring techniques. In this paper we present RECAP: RECognition of electrical Appliances and Profiling in real-time. RECAP uses a single wireless energy monitoring sensor easily clipped to the main electrical unit. The energy monitoring unit transmits energy data wirelessly to a local machine for data processing and storage. The RECAP system consists of three parts: (1) Guiding the user for profiling electrical appliances within premises and generating a database of unique appliance signatures; (2) Using those signatures to train an artificial neural network that is then employed to recognize appliance activities (3) Providing a Load descriptor to allow peer appliance benchmarking. RECAP addresses the need of an integrated and intuitive tool to empower building owners with energy awareness. Enabling real-time appliance recognition is a stepping-stone towards reducing energy consumption and allowing a number of major applications including load-shifting techniques, energy expenditure breakdown per appliance, detection of power hungry and faulty appliances, and recognition of occupant activity. This paper describes the system design and performance evaluation in domestic environment.

A Survey of Clustering Techniques in WSNs and Consideration of the Challenges of Applying Such to 5G IoT Scenarios

Abstract: Wireless sensor network (WSN) systems are typically composed of thousands of sensors that are powered by limited energy resources. To extend the networks longevity, clustering techniques have been introduced to enhance energy efficiency. This paper presents a survey on clustering over the last two decades. Existing protocols are analyzed from a quality of service (QoS) perspective including three common objectives, those of energy efficiency, reliable communication and latency awareness. This review reveals that QoS aware clustering demands more attention. Furthermore, there is a need to clarify how to improve quality of user experience (QoE) through clustering. Understanding the users’ requirements is critical in intelligent systems for the purpose of enabling the ability of supporting diverse scenarios. User awareness or user oriented design is one remaining challenging problem in clustering. In additional, this paper discusses the potential challenges of implementing clustering schemes to Internet of Things (IoT) systems in 5G networks. We indicate that clustering techniques enhanced with smart network selection solutions could highly benefit the QoS and QoE in IoT. As the current studies for WSNs are conducted either in homogeneous or low level heterogeneous networks, they are not ideal or even not able to function in highly dynamic IoT systems with a large range of user scenarios. Moreover, when 5G is finally realized, the problem will become more complex than that in traditional simplified WSNs. Several challenges related to applying clustering techniques to IoT in 5G environment are presented and discussed.

Presence equation: an investigation into cognitive factors underlying presence

Abstract: The relationship between presence and cognitive factors such as absorption, creative imagination, empathy, and willingness to experience presence was investigated. Presence was defined, operationalized, and measured using a questionnaire that we devised. Absorption and creative imagination were measured using questionnaires developed in the area of hypnosis, and empathy was assessed through an interpersonal reactivity index. Results indicated significant correlations between presence and each cognitive factor. They showed that persons who are highly fantasy prone, more empathic, more absorbed, more creative, or more willing to be transported to the virtual world experienced a greater sense of presence. Regression analysis led to a presence equation, which could be used to predict presence based on the investigated cognitive factors. Findings are congruent with user characteristics presented by the presence iterature and support the position that individual differences are important for the study of presence.

Radio Sleep Mode Optimization in Wireless Sensor Networks

Abstract: Energy efficiency is a central challenge in sensor networks, and the radio is a major contributor to overall energy node consumption. Current energy-efficient MAC protocols for sensor networks use a fixed low-power radio mode for putting the radio to sleep. Fixed low-power modes involve an inherent trade-off: deep sleep modes have low current draw and high energy cost and latency for switching the radio to active mode, while light sleep modes have quick and inexpensive switching to active mode with a higher current draw. This paper proposes adaptive radio low-power sleep modes based on current traffic conditions in the network. It first introduces a comprehensive node energy model, which includes energy components for radio switching, transmission, reception, listening, and sleeping, as well as the often disregarded microcontroller energy component for determining the optimal sleep mode and MAC protocol to use for given traffic scenarios. The model is then used for evaluating the energy-related performance of our recently proposed RFID impulse protocol enhanced with adaptive low-power modes, and comparing it against BMAC and IEEE 802.15.4, for both MicaZ and TelosB platforms under varying data rates. The comparative analysis confirms that RFID impulse with adaptive low-power modes provides up to 20 times lower energy consumption than IEEE 802.15.4 in low traffic scenario. The evaluation also yields the optimal settings of low-power modes on the basis of data rates for each node platform, and provides guidelines and a simple algorithm for the selection of appropriate MAC protocol, low-power mode, and node platform for a given set of traffic requirements of a sensor network application.

Machine learning

Abstract: Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Pattern Recognition and Machine Learning

Abstract: Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Intelligent Agents: Theory and Practice

Abstract: The concept of an agent has become important in both Artificial Intelligence (AI) and mainstream computer science. Our aim in this paper is to point the reader at what we perceive to be the most important theoretical and practical issues associated with the design and construction of intelligent agents. For convenience, we divide these issues into three areas (though as the reader will see, the divisions are at times somewhat arbitrary). Agent theory is concerned with the question of what an agent is, and the use of mathematical formalisms for representing and reasoning about the properties of agents. Agent architectures can be thought of as software engineering models of agents;researchers in this area are primarily concerned with the problem of designing software or hardware systems that will satisfy the properties specified by agent theorists. Finally, agent languages are software systems for programming and experimenting with agents; these languages may embody principles proposed by theorists. The paper is not intended to serve as a tutorial introduction to all the issues mentioned; we hope instead simply to identify the most important issues, and point to work that elaborates on them. The article includes a short review of current and potential applications of agent technology.

博弈论 : 矛盾冲突分析 = Game theory : analysis of conflict

Abstract: Preface 1. Decision-Theoretic Foundations 1.1 Game Theory, Rationality, and Intelligence 1.2 Basic Concepts of Decision Theory 1.3 Axioms 1.4 The Expected-Utility Maximization Theorem 1.5 Equivalent Representations 1.6 Bayesian Conditional-Probability Systems 1.7 Limitations of the Bayesian Model 1.8 Domination 1.9 Proofs of the Domination Theorems Exercises 2. Basic Models 2.1 Games in Extensive Form 2.2 Strategic Form and the Normal Representation 2.3 Equivalence of Strategic-Form Games 2.4 Reduced Normal Representations 2.5 Elimination of Dominated Strategies 2.6 Multiagent Representations 2.7 Common Knowledge 2.8 Bayesian Games 2.9 Modeling Games with Incomplete Information Exercises 3. Equilibria of Strategic-Form Games 3.1 Domination and Ratonalizability 3.2 Nash Equilibrium 3.3 Computing Nash Equilibria 3.4 Significance of Nash Equilibria 3.5 The Focal-Point Effect 3.6 The Decision-Analytic Approach to Games 3.7 Evolution. Resistance. and Risk Dominance 3.8 Two-Person Zero-Sum Games 3.9 Bayesian Equilibria 3.10 Purification of Randomized Strategies in Equilibria 3.11 Auctions 3.12 Proof of Existence of Equilibrium 3.13 Infinite Strategy Sets Exercises 4. Sequential Equilibria of Extensive-Form Games 4.1 Mixed Strategies and Behavioral Strategies 4.2 Equilibria in Behavioral Strategies 4.3 Sequential Rationality at Information States with Positive Probability 4.4 Consistent Beliefs and Sequential Rationality at All Information States 4.5 Computing Sequential Equilibria 4.6 Subgame-Perfect Equilibria 4.7 Games with Perfect Information 4.8 Adding Chance Events with Small Probability 4.9 Forward Induction 4.10 Voting and Binary Agendas 4.11 Technical Proofs Exercises 5. Refinements of Equilibrium in Strategic Form 5.1 Introduction 5.2 Perfect Equilibria 5.3 Existence of Perfect and Sequential Equilibria 5.4 Proper Equilibria 5.5 Persistent Equilibria 5.6 Stable Sets 01 Equilibria 5.7 Generic Properties 5.8 Conclusions Exercises 6. Games with Communication 6.1 Contracts and Correlated Strategies 6.2 Correlated Equilibria 6.3 Bayesian Games with Communication 6.4 Bayesian Collective-Choice Problems and Bayesian Bargaining Problems 6.5 Trading Problems with Linear Utility 6.6 General Participation Constraints for Bayesian Games with Contracts 6.7 Sender-Receiver Games 6.8 Acceptable and Predominant Correlated Equilibria 6.9 Communication in Extensive-Form and Multistage Games Exercises Bibliographic Note 7. Repeated Games 7.1 The Repeated Prisoners Dilemma 7.2 A General Model of Repeated Garnet 7.3 Stationary Equilibria of Repeated Games with Complete State Information and Discounting 7.4 Repeated Games with Standard Information: Examples 7.5 General Feasibility Theorems for Standard Repeated Games 7.6 Finitely Repeated Games and the Role of Initial Doubt 7.7 Imperfect Observability of Moves 7.8 Repeated Wines in Large Decentralized Groups 7.9 Repeated Games with Incomplete Information 7.10 Continuous Time 7.11 Evolutionary Simulation of Repeated Games Exercises 8. Bargaining and Cooperation in Two-Person Games 8.1 Noncooperative Foundations of Cooperative Game Theory 8.2 Two-Person Bargaining Problems and the Nash Bargaining Solution 8.3 Interpersonal Comparisons of Weighted Utility 8.4 Transferable Utility 8.5 Rational Threats 8.6 Other Bargaining Solutions 8.7 An Alternating-Offer Bargaining Game 8.8 An Alternating-Offer Game with Incomplete Information 8.9 A Discrete Alternating-Offer Game 8.10 Renegotiation Exercises 9. Coalitions in Cooperative Games 9.1 Introduction to Coalitional Analysis 9.2 Characteristic Functions with Transferable Utility 9.3 The Core 9.4 The Shapkey Value 9.5 Values with Cooperation Structures 9.6 Other Solution Concepts 9.7 Colational Games with Nontransferable Utility 9.8 Cores without Transferable Utility 9.9 Values without Transferable Utility Exercises Bibliographic Note 10. Cooperation under Uncertainty 10.1 Introduction 10.2 Concepts of Efficiency 10.3 An Example 10.4 Ex Post Inefficiency and Subsequent Oilers 10.5 Computing Incentive-Efficient Mechanisms 10.6 Inscrutability and Durability 10.7 Mechanism Selection by an Informed Principal 10.8 Neutral Bargaining Solutions 10.9 Dynamic Matching Processes with Incomplete Information Exercises Bibliography Index