Software Agents Research Papers - Academia.edu (original) (raw)
This chapter provides a tutorial introduction to MySQL by showing how to use the mysql client program to create and use a simple database. mysql (sometimes referred to as the "terminal monitor" or just "monitor") is an... more
This chapter provides a tutorial introduction to MySQL by showing how to use the mysql client program to create and use a simple database. mysql (sometimes referred to as the "terminal monitor" or just "monitor") is an interactive program that allows you to connect to a MySQL server, run queries, and view the results. mysql may also be used in batch mode: you place your queries in a file beforehand, then tell mysql to execute the contents of the file. Both ways of using mysql are covered here.
- by
- •
Currently, knowledge management is a key issue for companies as it gives them a competitive advantage. A Community of Practice (CoP) is a means to encourage employees to manage knowledge and enables them to exchange knowledge and... more
Currently, knowledge management is a key issue for companies as it gives them a competitive advantage. A Community of Practice (CoP) is a means to encourage employees to manage knowledge and enables them to exchange knowledge and experience. Members of these communities, however, are often geographically distributed. This hinders the development of feelings of trust between their members, which limits knowledge reuse. Our proposal seeks to minimize the effect of lack of trust between CoP members, thereby fostering the exchange of knowledge. To achieve this goal, we propose a trust model to calculate trust among CoP members, along with a multi-agent architecture to automatically manage the trust model in a CoP. The agents calculate a trust value in each situation, taking the user’s profile into account. We also present a tool that recommends sources of knowledge and documents that are trustworthy.
In 2004, Botea et al. published the HPA* algorithm (Hierarchical Pathfinding A*), which is the first detailed study of hierarchical pathfinding in games. However, HPA* can be optimized. In this paper, we introduce the DHPA* and SHPA*... more
In 2004, Botea et al. published the HPA* algorithm (Hierarchical Pathfinding A*), which is the first detailed study of hierarchical pathfinding in games. However, HPA* can be optimized. In this paper, we introduce the DHPA* and SHPA* hierarchical pathfinding algorithms, along with a metric for comparing the dynamic performance of pathfinding algorithms in games. We show that DHPA* searches up to an order of magnitude faster than HPA*, but consumes significantly more memory and produces slightly less optimal paths. The SHPA* algorithm searches up to five times faster than HPA* and consumes less memory, but it also produces slightly less optimal paths, and is only fit for static environments. When comparing the algorithms in dynamic environments, our results show that DHPA* often outperforms HPA*. Unlike many other hierarchical pathfinding algorithms, both solutions presented in this paper maintain a read-only terrain representation during search, which simplifies programming and debugging, and improves multithreaded performance.
Job Management Systems (JMSs) are the important component of grid software infrastructure. With many JMSs available commercially and in public domain, it is difficult to choose an optimum JMS for a given computing environment. All... more
Job Management Systems (JMSs) are the important component of grid software infrastructure. With many JMSs available commercially and in public domain, it is difficult to choose an optimum JMS for a given computing environment. All previous comparisons of JMSs had only a conceptual character. In this paper, we present the results of the first empirical study of JMSs reported in the literature. Four popular systems, LSF, PBS Pro, Sun Grid Engine/CODINE, and Condor were included in our study. The study has revealed ...
- by Jacek Radzikowski
- •
In the recent years, the Internet of things (IoT) applications have affected many aspects of human life due to the continuous innovation in hardware, software, and communication technologies along with the growth of the connected devices.... more
In the recent years, the Internet of things (IoT) applications have affected many aspects of human life due to the continuous innovation in hardware, software, and communication technologies along with the growth of the connected devices. The enormous amounts of data generated by these devices must be stored and then processed for analysis and decision-making. One promising solution for this purpose is cloud computing. However, offloading tasks to the cloud imposes costs that must be reduced by intelligent techniques and optimization algorithms. Fortunately, considering cloud computing instances with dynamic pricing referred to as spot instances can significantly reduce the processing costs. Although these instances offer a considerable cost reduction compared to on-demand instances, they can be evicted by the cloud providers and require special scheduling techniques. In this paper, we propose a dynamic scheduling method for IoT task offloading on Amazon EC2 spot instances. The proposed method considers both the predicted execution time of the task and the specified deadline that can be mapped on spot instances. The empirical results denote that the proposed method leads to a considerable reduction in the execution costs, while it simultaneously increases the number of successful tasks executed before the deadline and decreases task turnaround time.
We argue for the value of examining the internal processes that robots might actually use to draw inferences in a timely way in a dynamic world. This requires a significantly different way of thinking about logic and reasoning, which in... more
We argue for the value of examining the internal processes that robots might actually use to draw inferences in a timely way in a dynamic world. This requires a significantly different way of thinking about logic and reasoning, which in turn bears on some traditional logic-related problems such as omniscience and reasoning in the presence of a contradiction, as well as on a wide variety of other AI issues. A nonstandard internally-evolving notion of time seems to be the key that unlocks other tools.
- by Michael Zyda
- •
- Engineering
- by indra setiawan
- •
Dans l’univers des troubles «dys», les personnes atteintes de troubles dysexecutifs sont en attente de nouvelles solutions pour leur reeducation. A partir d’une analyse approfondie de la litterature, un consortium multidisciplinaire a ete... more
Dans l’univers des troubles «dys», les personnes atteintes de troubles dysexecutifs sont en attente de nouvelles solutions pour leur reeducation. A partir d’une analyse approfondie de la litterature, un consortium multidisciplinaire a ete cree afin de specifier et de developper un Serious-Game qui immerge les patients dans un monde virtuel a travers un scenario elabore et des missions variees. Il s’utilise sur une table tactile robotisee de 48’ facile a apprehender. Ce dispositif a trois enjeux majeurs. Tout d’abord la levee de l’anosognosie ainsi que le passage a une motivation intrinseque des patients afin qu’ils soient acteurs de leur reeducation. Ensuite, l’atteinte d’une metacognition suffisante pour qu’ils puissent developper des strategies qui leurs sont propres et qu’ils selectionnent la plus appropriee dans chaque contexte. Enfin, la facilitation du transfert de ces strategies dans la vie quotidienne. Des changements dans l’organisation des therapeutes sont egalement attendus.
Pattern matching in a DNA sequence or searching a pattern from a large data base is a major research area in computational biology. To extract pattern match from a large sequence it takes more time, in order to reduce searching time we... more
Pattern matching in a DNA sequence or searching a pattern from a large data base is a major research area in computational biology. To extract pattern match from a large sequence it takes more time, in order to reduce searching time we have proposed an approach that reduces the search time with accurate retrieval of the matched pattern in the sequence. As performance plays a major role in extracting patterns from a given DNA sequence or from a database independent of the size of the sequence. When sequence databases grow, more efficient approaches to multiple matching are becoming more important. One of the major problems in genomic field is to perform pattern comparison on DNA and protein sequences. Executing pattern comparison on the DNA and protein data is a computationally intensive task. In the current approach we explore a new technique which avoids unnecessary comparisons in the DNA sequence called 2-jump DNA search multiple pattern matching algorithm for DNA sequences. The p...
In a long history of inventing different methods for assessing software quality huge number of software metrics has been proposed. In this paper we will first give a brief overview of different approaches to measure software and all... more
In a long history of inventing different methods for assessing software quality huge number of software metrics has been proposed. In this paper we will first give a brief overview of different approaches to measure software and all processes connected to software development. Particular attention further will be paid on metrics in agent technology and multiagent systems (MAS) that are based on “classical metrics” but introduce novel specific techniques in line with agent paradigm. In spite the fact that there is a number of metrics developed for software agents and MASs it is a little bit strange that in higher ICT education we do not have appropriate topics devoted to these very specific metrics. Such drawback should be resolved in some acceptable way. In this paper we try to propose some adequate ways and possibilities of improving current situation in ICT higher-education in agent paradigm and suggest several slight changes in existing curricula.
Development of Agent-based languages is the natural extension of the research in the area of Agent-based systems. This paper deals with adding the support for the Distributed Non-Axiomatic Reasoning into the ALAS agent-oriented language.... more
Development of Agent-based languages is the natural extension of the research in the area of Agent-based systems. This paper deals with adding the support for the Distributed Non-Axiomatic Reasoning into the ALAS agent-oriented language. This support has been added into the Siebog agent middleware. Siebog is a distributed multiagent system based on the modern web and enterprise standards. Siebog has built in support for reasoning based on the Distributed Non-Axiomatic Reasoning System (DNARS). DNARS is a reasoning system based on nonaxiomatic logic (NAL) and general principles of development of non-axiomatic reasoning systems. So far, the DNARS-enabled agents could be written only in Java programming language. To solve the problem of interoperability within different Siebog platforms, an agentoriented domain-specific language (AODSL) ALAS has been developed. The main purpose of the ALAS is to support agent mobility and implementation and execution of agents on heterogenous platforms...
An autonomous trading agent is a complex piece of software that must operate in a competitive economic environment. We report results of an informal survey of agent design approaches among the competitors in the Trading Agent Competition... more
An autonomous trading agent is a complex piece of software that must operate in a competitive economic environment. We report results of an informal survey of agent design approaches among the competitors in the Trading Agent Competition for Supply Chain Management (TAC SCM).
The MinneTAC trading agent is designed to compete in the Supply-Chain Trading Agent Competition [4]. It is also designed to support the needs of a group of researchers, each of whom is interested in different decision problems related to... more
The MinneTAC trading agent is designed to compete in the Supply-Chain Trading Agent Competition [4]. It is also designed to support the needs of a group of researchers, each of whom is interested in different decision problems related to the competition scenario. The design of MinneTAC breaks out each basic behavior into a separate, configurable component, and allows dynamic construction of analysis and modeling tools from small, single-purpose ���evaluators���. The agent is defined as a set of ���roles���, and a ...
In the last year or so (and going back many decades) there has been extensive claims by major computational scientists, engineers, and others that AGI (artificial general intelligence) is 5 or 10 years away, but without a scintilla of... more
In the last year or so (and going back many decades) there has been extensive claims by major computational scientists, engineers, and others that AGI (artificial general intelligence) is 5 or 10 years away, but without a scintilla of scientific evidence, for a broad body of these claims: Computers will become conscious, have a "theory of mind," think and reason, will become more intelligent than humans, and so on. But the claims are science fiction, not science. This article reviews evidence for the following three (3) propositions using extensive body of scientific research and related sources from the cognitive and neurosciences; evolutionary evidence; linguistics; data science; comparative psychology; self-driving cars, and robotics; and the learning sciences.