Proceedings 5th International Symposium on Autonomous Decentralized Systems最新文献_第2页

A high assurance on-line recovery technology for a space on-board computer 一种空间星载计算机高保证在线恢复技术

Proceedings 5th International Symposium on Autonomous Decentralized Systems Pub Date : 2001-03-26 DOI: 10.1109/ISADS.2001.917394

H. Yashiro, T. Fujiwara, K. Mori

引用次数: 9

Autonomous information provision to achieve reliability for users and providers 自主提供信息，实现用户和提供者的可靠性

Proceedings 5th International Symposium on Autonomous Decentralized Systems Pub Date : 2001-03-26 DOI: 10.1109/ISADS.2001.917396

H. F. Ahmad, G. Sun, K. Mori

{"title":"Autonomous information provision to achieve reliability for users and providers","authors":"H. F. Ahmad, G. Sun, K. Mori","doi":"10.1109/ISADS.2001.917396","DOIUrl":"https://doi.org/10.1109/ISADS.2001.917396","url":null,"abstract":"The rapid growth of information technology and the Internet have given rise to an increasing demand for information services. A large number of service providers offer information services to diversified users on the Internet. Users' requirements are heterogeneous and change very quickly. Popular servers are overloaded and cannot dynamically adapt to meet users' heterogeneous requirements. It is necessary to design an information service system that can meet users' heterogeneous requirements for services, and to design in the adaptability of services to cope with ever-changing situations, to provide assurance. A faded information field architecture and push/pull mobile agent technologies have been proposed as basic components of an autonomous information service system to achieve these goals. The system has been proposed from the users' and providers' points of view, and therefore techniques for balancing users' and providers' costs are required for the realization of the system. The system leads to dynamic and autonomous information allocation, in which each node on the network may determine the amount of information based on the push/pull cost of the mobile agents. In this paper, we propose the initial construction of the faded information field based on providers' and users' heterogeneous reliability requirements. The through rate is used to reconstruct the faded information field dynamically and autonomously. We prove the effectiveness of the proposed technology through simulation.","PeriodicalId":193918,"journal":{"name":"Proceedings 5th International Symposium on Autonomous Decentralized Systems","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116649092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Formal analysis of software security system architectures 软件安全系统架构的形式化分析

Proceedings 5th International Symposium on Autonomous Decentralized Systems Pub Date : 2001-03-26 DOI: 10.1109/ISADS.2001.917448

Yi Deng, Jiacun Wang, J. Tsai

引用次数: 7

Reconfigurable context-sensitive middleware for ADS applications in mobile ad hoc network environments 移动自组织网络环境中用于ADS应用的可重构上下文敏感中间件

Proceedings 5th International Symposium on Autonomous Decentralized Systems Pub Date : 2001-03-26 DOI: 10.1109/ISADS.2001.917435

S. Yau, F. Karim

引用次数: 27

A stabilizing search tree with availability properties 具有可用性属性的稳定搜索树

Proceedings 5th International Symposium on Autonomous Decentralized Systems Pub Date : 2001-03-26 DOI: 10.1109/ISADS.2001.917445

T. Herman, T. Masuzawa

{"title":"A stabilizing search tree with availability properties","authors":"T. Herman, T. Masuzawa","doi":"10.1109/ISADS.2001.917445","DOIUrl":"https://doi.org/10.1109/ISADS.2001.917445","url":null,"abstract":"The ability of a system to recover from unexpected change in its environment or disruptions to its internal state is an indication of robust design and autonomous control. Recovery can be constrained by service availability requirements, so that even during periods of recovery, new service requests should be admitted and processed in a timely manner. Given that complex systems are constructed from many components, it is sensible to investigate how individual components can facilitate recovery and also satisfy availability requirements. The component presented is a search tree data structure that can recover from any disruption: it is a self-stabilizing data structure. No matter how severe the damage to its internal state, new operations on the data structure behave properly and the responses to operations are accurate indicators of any change to the search tree, even as the search tree recovery is underway. This paper resolves, for the first time, issues of dynamic allocation and pointer organization in a stabilizing data structure. After any sequence of O(m) operations in an arbitrary initial search tree of m nodes, the tree becomes balanced, all operations have O(lg n) running time, and free chains are adequate to supply new nodes for insertions. To meet availability constraints, operations have O(lg K) running time during periods of recovery, where K is the maximum number of items that the data structure can contain.","PeriodicalId":193918,"journal":{"name":"Proceedings 5th International Symposium on Autonomous Decentralized Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133495333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Autonomous data consistency technique through fair evaluation among heterogeneous systems 基于异构系统间公平评价的自主数据一致性技术

Proceedings 5th International Symposium on Autonomous Decentralized Systems Pub Date : 2001-03-26 DOI: 10.1109/ISADS.2001.917450

I. Kaji, S. Kato, K. Mori

{"title":"Autonomous data consistency technique through fair evaluation among heterogeneous systems","authors":"I. Kaji, S. Kato, K. Mori","doi":"10.1109/ISADS.2001.917450","DOIUrl":"https://doi.org/10.1109/ISADS.2001.917450","url":null,"abstract":"By integrating heterogeneous systems with different individual requirements, it becomes possible for application systems to use the various data generated in the heterogeneous systems. Integrated systems also make it possible to process the applications from different points of view and to obtain higher assurance levels. The important requirements for the integration of application systems are not to halt the entire systems, not to violate individual system missions and to derive a synergetic effect. The autonomous decentralized system (ADS), by its online property, enables the integration of systems without stopping any system and without violating any system's mission. To collect consistent data combinations from different systems each subsystem needs to determine the combination independently and autonomously. This paper proposes a new concept, the data alliance, to determine consistent data combination from heterogeneous systems. In addition, the fairness must be maintained between the subsystems to achieve the consistency to satisfy the nature of the autonomous coordinability. This paper defines the fairness among systems in terms of the cost of the data freshness and the alliance waiting time. The data freshness value expresses the degree of how recent the data combination is for the subsystem, and the alliance waiting time expresses how long the subsystem must wait to get agreement among cooperating applications. The last part of the paper shows by simulation that the proposed technique is effective in different system topologies.","PeriodicalId":193918,"journal":{"name":"Proceedings 5th International Symposium on Autonomous Decentralized Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114318437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Formal analysis of e-commerce protocols 电子商务协议的形式化分析

Proceedings 5th International Symposium on Autonomous Decentralized Systems Pub Date : 2001-03-26 DOI: 10.1109/ISADS.2001.917391

M. Papa, O. Bremer, John Hale, S. Shenoi

引用次数: 14

Concepts and architecture of a security-centric mobile agent server 以安全为中心的移动代理服务器的概念和体系结构

Proceedings 5th International Symposium on Autonomous Decentralized Systems Pub Date : 2001-03-26 DOI: 10.1109/ISADS.2001.917449

Volker Roth, Mehrdad Jalali-Sohi

引用次数: 71

Autonomous navigation in information service systems for load balancing user demands 基于负载均衡的信息服务系统自主导航

Proceedings 5th International Symposium on Autonomous Decentralized Systems Pub Date : 2001-03-26 DOI: 10.1109/ISADS.2001.917453

H. Arfaoui, K. Mori

引用次数: 4

The need for verification and validation techniques for adaptive control system 对自适应控制系统验证技术的需求

Proceedings 5th International Symposium on Autonomous Decentralized Systems Pub Date : 2001-03-26 DOI: 10.1109/ISADS.2001.917431

B. Cukic

{"title":"The need for verification and validation techniques for adaptive control system","authors":"B. Cukic","doi":"10.1109/ISADS.2001.917431","DOIUrl":"https://doi.org/10.1109/ISADS.2001.917431","url":null,"abstract":"Adaptive systems are systems whose function evolves over time, as they improve their performance through learning. The advantage of adaptive systems is that they can, through judicious learning, react to situations that were never individually identified and analyzed by the designer. If learning and adaptation are allowed to occur after the control system is deployed, the system is called an online adaptive system. Online adaptive systems are attracting increasing attention in application domains where autonomy is an important feature, or where it is virtually impossible to analyze ahead of time all the possible combinations of environmental conditions that may arise. An archetype of the former are long term space missions where communication delays to ground stations are prohibitively long, and we have to depend on the systems' local capabilities to deal with unforeseen circumstances. An archetype of the latter are flight control systems, which deal with a wide range of parameters, and a wide range of environmental factors. In recent years NASA conducted experiments evaluating adaptive computational paradigms (neural networks, AI planners) for providing fault tolerance capabilities in control systems following sensor and/or actuator faults. Experimental success suggests significant potential for future use. The critical factor limiting wider use of neural networks and other soft-computing paradigms in process control applications, is our (in)ability to provide a theoretically sound and practical approach to their verification and validation.","PeriodicalId":193918,"journal":{"name":"Proceedings 5th International Symposium on Autonomous Decentralized Systems","volume":"369 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124625396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18