Friday, July 01, 2005

Primality Proving 4.3: A polynomial-time algorithm 

Primality Proving 4.3: A polynomial-time algorithm
"As we mentioned before, many of the primality proving methods are conjectured to be polynomial-time. For example, Miller's test is polynomial if ERH is true (and Rabin gave a version of this test that was unconditionally randomized polynomial-time [Rabin80]). Adleman and Hang [AH1992] modified the Goldwasser-Killian algorithm [GK86] to produce a randomized polynomial time algorithm that always produced a certificate of primality... So it is not surprising that there exists a polynomial-time algorithm for proving primality. But what is surprising is that in 2002 Agrawal, Kayal and Saxena [AKS2002] found a relatively simple deterministic algorithm which relies on no unproved assumptions. We present this algorithm below then briefly refer to a related algorithm of Bernstein."

Thursday, June 30, 2005

2005 International Conference on Self-Organization and Adaptation of Multi-agent and Grid Systems 

"1. Aim and Scope

A multi-agent system is such a system that is comprised of a collection of fully or semi- autonomous entities/components and whose global behaviours come from the emergent interactions among these entities/components. Such multi-agent systems have been studied widely, not only in computer science, software engineering and artificial intelligence, but even more widely in economics, management science, sociology, systems science, etc. In fact, multi-agent systems permeate social, economic, and technical domains.

Grid computing is the new generation distributed and networked information and computing systems which have the capacity to enable users and applications in an emergent manner to transcend the organizational boundaries and to gain access to the local computing resources administrated by different organizations. A Grid computing system is by nature a large, complex, and open multi-agent system. Grid computing integrates distributed computing resource management, semantic web technology, service oriented architecture and service management, distributed workflow management, monitoring and control of distributed problem solving, etc.

While self-organization and adaptation have been studied intensively in control theory, systems theory, adaptive complex systems, robotics, etc., they are relatively new concepts for computing systems. In recent years it has widely been recognized that large complex computing systems are increasingly demanding self-organization and adaptation, as advocated by the autonomic/adaptive computing initiatives in, e.g., IBM, HP, etc. The challenge here is that computing systems basically are artificial systems, which prevents conventional principles and approaches for self-organization and adaptation, which are mainly aimed at physical laws governed systems, from being applied to computing systems. To tackle the complexities of physical laws governed systems such as openness, uncertainty, discrete event randomness, etc., there have been established frameworks of principles and approaches for understanding and engineering self-organization and adaptation. However, for artificial systems such as large complex computing systems, the understanding of the openness, uncertainty, discrete event dynamics, etc. is still very limited and the framework for self-organization and adaptation has yet to be established.

To respond to the challenge above, apparently there is the urgency to have a focal forum to exchange and disseminate the state-of-the art developments from different disciplines. The SOAS’05 Conference aims to provide a timely forum to present the latest theoretical and practical results on self-organization and adaptation that have been arising in recent years in the areas of Multi-agent Systems, Grid Computing and Autonomic/Adaptive Computing. SOAS’05 Conference will also serve as an exclusive opportunity to think about the challenges and to shape the future.

SOAS’05 Conference is an integral event and is comprised of six thematic Workshops as follows.

Workshop 1: Self-Organization, Adaptation, and Learning of Multi-Agent Systems
Workshop 2: Self-Organizing Grid Computing and Adaptive Grid Service Management
Workshop 3: Autonomic and Adaptive Computing
Workshop 4: Basic Principles and Methodologies of Self-Organization and Adaptation
Workshop 5: Prototypes, Case Studies and Applications
Workshop 6: Works in Progress and Doctoral Research"

Wednesday, June 29, 2005


"Jastor is a open source Java code generator that emits Java Beans from Web Ontologies (OWL) enabling convenient, type safe access and eventing of RDF stored in a Jena Semantic Web Framework model. Jastor generates Java interfaces, implementations, factories, and listeners based on the properties and class hierarchies in the Web Ontologies. Jastor is based on several ideas from Automatic Mapping of OWL Ontologies to Java (PDF). "

ElComAg - Electronic Commercial Agents 

ElComAg - Electronic Commercial Agents
"Project Overview
The ElComAg (Electronic Commercial Agents) project at the Norwegian University of Science and Technology is financed by the Norwegian Research Foundation (NFR) in the framework of notional program Distributed Information Technology Systems (DITS). A focus of the project is on facilities for trading of knowledge by electronic commerce, including

We are a member of the AgentLink's Special Interest Group on Agent-Mediated Mobile Commerce (AMEC) "

GameMining - Research on Data Mining for Multiplayer Games 

GameMining - Research on Data Mining for Multiplayer Games: " is a part of the Electronic Commercial Agents ( project (financed by the Norwegian Research Council).

Research Focus:
How to develop commercially useful data mining methods for massively multiplayer games.
More information? - read our first paper about Data Mining in Computer Games "

jfipa - Java-support for the FIPA Agent Communication Language 

jfipa - Java-support for the FIPA Agent Communication Language
"What is jfipa?
jfipa is a set of java-based tools that supports parsing and routing of envelopes/messages of the FIPA Agent Communication Language (ACL) encoded as XML.
Motivated by the need for a simple, yet scalable, software-based router that enables software agents to easily send, interpret and receive messages of the FIPA Agent Communication Language. Examples of areas where FIPA ACL-based message can useful is in agent-based information retrieval, peer-to-peer applications etc. "

Monday, June 27, 2005

John Holland's ECHO 

John Holland's ECHO
"Echo is a simulation tool developed to investigate mechanisms which regulate diversity and information-processing in systems comprised of many interacting adaptive agents, or complex adaptive systems (CAS). Echo agents interact via combat, trade and mating and develop strategies to ensure survival in resource-limited environments. Individual genotypes encode rules for interactions. In a typical simulation, populations of these genomes evolve interaction networks which regulate the flow of resources. Resulting networks resemble species communities in ecological systems. Flexibly defined parameters and initial conditions enable researchers to conduct a range of "what-if" experiments."

This page is powered by Blogger. Isn't yours?