Intelligent interactive environments are systems whose main features are related to intelligence, interactivity and location. Intelligent interactive environments are implemented in a variety of platforms, such as dis...
详细信息
Intelligent interactive environments are systems whose main features are related to intelligence, interactivity and location. Intelligent interactive environments are implemented in a variety of platforms, such as distributed sensors, actuators and processors for ambient intelligence;distributed and mobile reasoning entities in virtual worlds and augmented reality;and distributed, multiuser information systems such as social networks and service-oriented systems directed to the dissemination of public services and retailing. In the present article, we introduce JamSession, a tool to specify and execute workflow choreographies, as well as to monitor and control heterogeneous resources, which can be specially useful for the specification and implementation of the coordination of real-time, multimodal and multimedia activities. JamSession is used to specify and execute knowledge-based interaction protocols, which are formally grounded and can be formally analysed and verified using a straightforward and user-friendly graphical language. A knowledge-based interaction protocol determines how disparate resources can work cooperatively to build complex behaviour in intelligent interactive environments.
The Flip-Tick Architecture, or FTA for short, is a collection of organizing principles and generic functional units for building distributed systems which are based on cooperative and competitive teams of small or med...
详细信息
The Flip-Tick Architecture, or FTA for short, is a collection of organizing principles and generic functional units for building distributed systems which are based on cooperative and competitive teams of small or medium-grained agents called actors. We describe the design and operation principles of the architecture and present some ideas of how to build applications with an FTA structure. A typical application system comprises tens or hundreds of actors sharing one or several common data storages known as tagboards. There is no explicit point-to-point communication between actors. Instead, actors communicate by reading and posting tags with data on the tagboards using various mechanisms for synchronization. The distribution across several interconnected computers as well as the choice of actor granularity and synchronism are up to the application designers. (C) 2000 Elsevier Science B.V. All rights reserved.
For advanced data-oriented applications in distributed environments, effective information is frequently obtained by integrating or merging various autonomous information sources. There are many problems: how to searc...
详细信息
For advanced data-oriented applications in distributed environments, effective information is frequently obtained by integrating or merging various autonomous information sources. There are many problems: how to search information sources, how to resolve their heterogeneity, how to merge or integrate target sources, how to represent information sources with a common protocol, and how to process queries. We have proposed a new language, QUIK, as an extension of a deductive object-oriented database (DOOD) language, QUIXOTE, and extend typical mediator systems. In this paper, we discuss various features of QUIK: programming capabilities as integrating an exchange model and mediator specifications, merging subsumption relations for maintaining consistency, searching alternative information sources by hypothesis generation, and identifying objects.
We introduce PC grammar systems where the components form clusters and the query symbols refer to clusters not individual grammars, i.e., the addressee of the query is not precisely identified. We prove that if the sa...
详细信息
We introduce PC grammar systems where the components form clusters and the query symbols refer to clusters not individual grammars, i.e., the addressee of the query is not precisely identified. We prove that if the same component replies to all queries issued to a cluster in a rewriting step, then non-returning PC grammar systems with 3 clusters and 7 context-free components are able to generate any recursively enumerable language. We also provide open problems and directions for future research.
Increased requirements for reliability and utilization of existing power systems create a need for a large library of tools to aid operating personnel in solving their tasks. To take advantage of the expanding number ...
详细信息
Increased requirements for reliability and utilization of existing power systems create a need for a large library of tools to aid operating personnel in solving their tasks. To take advantage of the expanding number of tools, the user-interface must provide the power that the user needs to control their execution and examine their input and the results produced. In order to get adequate response times and effectively control the complex tasks involved, a distributedproblem-solving approach seems appropriate. The paper reports the implementation of an expert system for security assessment (CQR) in a distributed problem solving environment (FORS). CQR, initially an integrated program of expert system and numeric procedures, was split up into smaller independent modules written in C and OPS83, called tools, integrated in FORS. FORS supports distributed processing and has an icon-based interface that makes it relatively easy to manipulate data and tools. A compact description of FORS and CQR is followed by a report on the experience gained from the implementation. Shortcomings and suggested extensions to CQR and FORS are discussed in connection with an evaluation of the distributed CQR version. By combining the added functionality offered by expert systems with a distributedproblem-solvingsolving environment, security assessment techniques transcending those presently used become feasible. Some suggestions are made as to what type of techniques these might be, and it is argued that such aids are sure to have an impact on the way dispatchers and planners will perform security assessment in the future.
This paper reports the implementation and operational experience of a knowledge-based system for voltage/var control in a real-time environment. The developed on-line EMS application is a multi-functional, multi-parad...
详细信息
This paper reports the implementation and operational experience of a knowledge-based system for voltage/var control in a real-time environment. The developed on-line EMS application is a multi-functional, multi-paradigm tool fully embedded and consistent with the existing decision support system. Especially designed as an assistant to operation, it consists mainly of a rule-based system for reactive power/voltage monitoring and control, and an optimal power flow (OPF) algorithmic function. The application has been in operation for the last two years. The adopted architectural solution is fully compatible with the existing control structure for process synchronization and task scheduling. Finally, the experience acquired during the project provided an in-depth understanding of past, present and future trends which oriented the planning of future development work.
This article presents an asynchronous algorithm for solvingdistributed constraint optimization problems (DCOPs). The proposed technique unifies asynchronous backtracking (ABT) and asynchronous distributed optimizatio...
详细信息
This article presents an asynchronous algorithm for solvingdistributed constraint optimization problems (DCOPs). The proposed technique unifies asynchronous backtracking (ABT) and asynchronous distributed optimization (ADOPT) where valued nogoods enable more flexible reasoning and more opportunities for communication, leading to an important speed-up. While feedback can be sent in ADOPT by COST messages only to one predefined predecessor, our extension allows for sending such information to any relevant agent. The concept of valued nogood is an extension by Dago and Verfaille of the concept of classic nogood that associates the list of conflicting assignments with a cost and, optionally, with a set of references to culprit constraints. DCOPs have been shown to have very elegant distributed solutions, such as ADOPT, distributed asynchronous overlay (DisAO), or DPOP. These algorithms are typically tuned to minimize the longest causal chain of messages as a measure of how the algorithms will scale for systems with remote agents (with large latency in communication). ADOPT has the property of maintaining the initial distribution of the problem. To be efficient, ADOPT needs a preprocessing step consisting of computing a Depth-First Search (DFS) tree on the constraint graph. Valued nogoods allow for automatically detecting and exploiting the best DFS tree compatible with the current ordering. To exploit such DFS trees it is now sufficient to ensure that they exist. Also, the inference rules available for valued nogoods help to exploit schemes of communication where more feedback is sent to higher priority agents. Together they result in an order of magnitude improvement.
Rapid changes in the operating environments electric utilities call for modifications in their operating strategies. This paper proposes two ways for making modifications. The first is the adoption of an organizationa...
详细信息
Rapid changes in the operating environments electric utilities call for modifications in their operating strategies. This paper proposes two ways for making modifications. The first is the adoption of an organizational scheme, called an A-team (asynchronous team), for EMS (energy management system) software. A-teams are modular and extremely flexible. They have the potential for very high performance. The second proposal is for the use of an event tree that would extend several contingencies from the current operating state into the future. This tree would be continually updated by a set of predictive and prescriptive programs, called control specialists, that would be distributed over a network of computers.
IDA* algorithm is a combination of A* and the IDDFS algorithm. This algorithm finds the shortest path. In this paper, we witness parallel computing. Multithreading is one of the most used and common parallel computing...
详细信息
ISBN:
(纸本)9781665483285;9781665483292
IDA* algorithm is a combination of A* and the IDDFS algorithm. This algorithm finds the shortest path. In this paper, we witness parallel computing. Multithreading is one of the most used and common parallel computing techniques. In this paper, I present some IDA* optimization based on parallel computing and another one is based on some characteristics. Firstly I present a brief introduction A*, IDDFS, and IDA* and the time complexity and growth of those algorithms. Then I discussed 3 optimizations from all the papers I have referenced. Those optimizations are PMIDA*, A*+IDA* and characteristics-based optimization. Then I illustrate the performance measurement table based on A*+IDA* algorithm and PMIDA* visualization. Finally, I compare PMIDA*, A*+IDA*, and characteristics-based optimization optimizations. Among those optimizations, PMIDA* is the best in terms of parallel computing. The performance of the other two optimizations is also fairly decent.
The PAWIAN* system is a knowledge-based image recognition system that uses parallel programming techniques on several system layers to reduce the recognition time factor. The high robustness provided by knowledge-base...
详细信息
ISBN:
(纸本)3540676899
The PAWIAN* system is a knowledge-based image recognition system that uses parallel programming techniques on several system layers to reduce the recognition time factor. The high robustness provided by knowledge-based recognition is supported by data- and model-driven parallelism. Special search techniques and heuristics provide a high performance and good time reduction.
暂无评论