International Conference on Autonomic and Autonomous Systems (ICAS'06)最新文献

Stochastic Linear Optimization for Modeling Uncertainty in Aggregate Production Planning 总体生产计划不确定性建模的随机线性优化

International Conference on Autonomic and Autonomous Systems (ICAS'06) Pub Date : 2006-07-19 DOI: 10.1109/ICAS.2006.57

Zhao Yong-quan, Lu Li-bin, Fang Shu-fen

引用次数: 4

Linearly Ordered Plugins through Self-Organization 线性有序插件通过自组织

International Conference on Autonomic and Autonomous Systems (ICAS'06) Pub Date : 2006-07-19 DOI: 10.1109/ICAS.2006.33

B. Bako, Andreas Borchert, N. Heidenbluth, Johannes Mayer

引用次数: 5

Biologically-Inspired Design of Autonomous and Adaptive Grid Services 自主和自适应网格服务的生物学启发设计

International Conference on Autonomic and Autonomous Systems (ICAS'06) Pub Date : 2006-07-19 DOI: 10.1109/ICAS.2006.15

Chonho Lee, J. Suzuki

引用次数: 8

Blueprint for an Autonomic Service Architecture 自治服务体系结构蓝图

International Conference on Autonomic and Autonomous Systems (ICAS'06) Pub Date : 2006-07-19 DOI: 10.1109/ICAS.2006.17

Ramy Farha, A. Leon-Garcia

引用次数: 21

A Part Release considering Tool Scheduling and Dynamic Tool Allocation in Flexible Manufacturing Systems 柔性制造系统中考虑刀具调度和动态刀具分配的零件放行

International Conference on Autonomic and Autonomous Systems (ICAS'06) Pub Date : 2006-07-19 DOI: 10.1109/ICAS.2006.5

Choong-soo Lee, H. Kim

引用次数: 1

Multi-dimensional Dependency and Conflict Resolution for Self-adaptable Context-aware Systems 自适应上下文感知系统的多维依赖和冲突解决

International Conference on Autonomic and Autonomous Systems (ICAS'06) Pub Date : 2006-07-19 DOI: 10.1109/ICAS.2006.37

D. Preuveneers, Y. Berbers

引用次数: 5

Cross-layer Architecture of a Distributed OS for Ad Hoc Networks 面向Ad Hoc网络的分布式操作系统的跨层架构

International Conference on Autonomic and Autonomous Systems (ICAS'06) Pub Date : 2006-07-19 DOI: 10.1109/ICAS.2006.20

P. Janacik, T. Heimfarth

{"title":"Cross-layer Architecture of a Distributed OS for Ad Hoc Networks","authors":"P. Janacik, T. Heimfarth","doi":"10.1109/ICAS.2006.20","DOIUrl":"https://doi.org/10.1109/ICAS.2006.20","url":null,"abstract":"Despite the advances in wireless, energy-constrained ad hoc networks, there are still many challenges due to the limited capabilities of the current hardware. Therefore, our aim is to develop a lightweight, yet powerful operating system (OS) for such networks. We reject the brute force method of provisioning all necessary OS services at each node of the system. Instead, in our approach, services provided by the OS organise autonomously to achieve an efficient distribution over the network. In order to enable the use of our OS in energy- and hardware-constrained networks, we argue that it is necessary that all layers of the system are designed to cooperate within a cross-layer approach. At the link layer, our contribution includes an emergent topology control protocol taking into account node and network properties enabling the division of roles between nodes. Further, we employ a combined link metric based on signal strength, success rate, and history to enable a more realistic link quality assessment and pheromone adjustments in routing. At the network layer, to avoid costly reorganisation after role changes incurred by topology control, we use a fuzzy distinction between nodes with different roles by adding a role-based component to the probabilistic next-hop selection function of ant colony routing. At the highest level of our approach, we propose a short- and a long-range migration method for OS service states, based solely on local information and autonomous decisions, to improve the overall quality of service, fairness, balance, predictability, and reduce communication overhead. In ns-2 simulations, we demonstrate improvements of quality of service of 80 % and load balancing of 200 to 400 %","PeriodicalId":279708,"journal":{"name":"International Conference on Autonomic and Autonomous Systems (ICAS'06)","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134395285","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}

引用次数: 4

Adaptive Approach to Information Dissemination in Self-Organizing Grids 自组织网格信息传播的自适应方法

International Conference on Autonomic and Autonomous Systems (ICAS'06) Pub Date : 2006-07-19 DOI: 10.1109/ICAS.2006.7

D. C. Erdil, M. Lewis, N. Abu-Ghazaleh

{"title":"Adaptive Approach to Information Dissemination in Self-Organizing Grids","authors":"D. C. Erdil, M. Lewis, N. Abu-Ghazaleh","doi":"10.1109/ICAS.2006.7","DOIUrl":"https://doi.org/10.1109/ICAS.2006.7","url":null,"abstract":"The size, complexity, heterogeneity, and dynamism of large-scale computational grids make autonomic grid services and solutions necessary. In particular, grid schedulers must map applications onto resources whose state (1) influences the effectiveness of scheduling choices, and (2) changes frequently and considerably. A grid resource state information dissemination service must negotiate the inherent tradeoff between covering a large portion of the grid (so that all schedulers can make informed decisions with the largest number of options), and limiting the protocol's overhead (i.e. the number of packets sent). This paper argues that probabilistic forwarding protocols must adapt to state changes, because static assignments of forwarding probabilities lead to excessive overhead or lower-than-possible query satisfaction rates in some scenarios. We introduce an approach that compares a node's local utilization and query generation rates to corresponding rates in the node's vicinity, and in the grid as a whole. These comparisons, in turn, produce a score that is used to adjust forwarding probabilities. We show that even this simple initial adaptive approach can work better than protocols with static forwarding probability assignments","PeriodicalId":279708,"journal":{"name":"International Conference on Autonomic and Autonomous Systems (ICAS'06)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115003581","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}

引用次数: 24

On the conception of an autonomous and modular robot based on an Event Driven OSEK System with deterministic real-time behavior 基于确定性实时行为的事件驱动OSEK系统的自主模块化机器人概念研究

International Conference on Autonomic and Autonomous Systems (ICAS'06) Pub Date : 2006-07-19 DOI: 10.1109/ICAS.2006.40

F. Bimbard, L. George

{"title":"On the conception of an autonomous and modular robot based on an Event Driven OSEK System with deterministic real-time behavior","authors":"F. Bimbard, L. George","doi":"10.1109/ICAS.2006.40","DOIUrl":"https://doi.org/10.1109/ICAS.2006.40","url":null,"abstract":"In this paper, we are interested in the design of an autonomous and modular self-reconfigurable robot having self-assembly capability and deterministic behavior. The ability of a modular robot to meet its mission strongly depends on the artificial intelligence software and on the underlying hardware and software architecture. The artificial intelligence software of a robot is mapped into several elementary tasks with different real-time constraints. We propose in this paper a real-time analysis taking into account kernel overheads for the validation of the real-time behavior of an artificial intelligence software. We study the OSEK operating system that requires few hardware resources and is cost effective. The overheads are due to the context switching mechanism which activates, terminates, and reschedules tasks, and to the periodic timer used to create the time base which is necessary for the periodic tasks model. We show how to take into account those overheads in the feasibility conditions. We compare the theoretical worst case response time obtained with kernel overheads to the response time obtained on a task set, on a real robot, based on the event driven OSEK implementation. We show that the kernel overheads cannot be neglected and that the theoretical results are valid and can be used to ensure a deterministic behavior of the robot","PeriodicalId":279708,"journal":{"name":"International Conference on Autonomic and Autonomous Systems (ICAS'06)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117229238","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}

引用次数: 1

Derandomization of Wireless Channel Access using Automata in Sensor Networks 传感器网络中使用自动机的无线信道访问的非随机化

International Conference on Autonomic and Autonomous Systems (ICAS'06) Pub Date : 2006-07-19 DOI: 10.1109/ICAS.2006.21

J. M. Kay, J. Frolik

引用次数: 4