发布求助
文献互助 智能选刊 最新文献

Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.最新文献

筛选
英文 中文
Decentral control of a robot-swarm 机器人群的分散控制
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452083
I. Dahm, Matthias Hebbel, Matthias Hülsbusch, J. Kerdels, Walter Nisticò, C. Schumann, Michael Wachter
{"title":"Decentral control of a robot-swarm","authors":"I. Dahm, Matthias Hebbel, Matthias Hülsbusch, J. Kerdels, Walter Nisticò, C. Schumann, Michael Wachter","doi":"10.1109/ISADS.2005.1452083","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452083","url":null,"abstract":"In this paper, we present an approach to construct a universal architecture to control a team of autonomous robots. The suggested approach is robust against communication problems and robots' hardware failures. The system profits from its decentral architecture. We present, how the control structure is designed and implemented and how basic tasks are scheduled and distributed running the approach. Thereto, we present the three modules of the architecture: A robust communication, a decentral data storage by sensor-fusion, and a decentral task-scheduling. As a matter of fact, we do not focus on a specific implementation but on the concept behind our system-wide approach. For the proof of concept, we reference to an implementation which was honored by the first place of the Open Challenge at RoboCup world championship in Lissboa 2004.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128775426","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}
引用次数: 3
Digital gas fields produce real time scheduling based on intelligent autonomous decentralized system 数字气田基于智能自主分散系统进行实时调度
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452151
Hongbo Wang, Guangping Zeng, Xuyan Tu, Zongjie Wang
{"title":"Digital gas fields produce real time scheduling based on intelligent autonomous decentralized system","authors":"Hongbo Wang, Guangping Zeng, Xuyan Tu, Zongjie Wang","doi":"10.1109/ISADS.2005.1452151","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452151","url":null,"abstract":"In the paper, we focus on exploring to construct a novel digital gas fields produce real-time scheduling system, which is based on the theory of intelligent autonomous decentralized system (IADS). The system combines the practical demand and the characteristics of the gas fields, and it aims at dealing with the real-time property, dynamic and complexity during gas fields produce scheduling. Besides embodying on-line intelligent expansion, intelligent fault tolerance and on-line intelligent maintenance of IADS particular properties, the scheme adequately attaches importance to the flexibility. The model & method based on intelligent information pull push (IIPP) and intelligent management (IM) is applied to the system, thus it is helpful to improve the performance of the scheduling system. In according with the current requirement of gas fields produce scheduling, the concrete solvent is put forward. The related system architecture and software structure is presented. An effective method of solving the real-time property was developed for use in scheduling of the gas field produce. We simulated some experiments, and the result demonstrates the validity of the system. At Last, we predict its promising research trend in the future of gas fields practice application.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126918502","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
Fast algorithm for line rasterization by using slope 1 基于斜率1的直线栅格化快速算法
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452121
Hua Zhang, Changqian Zhu, Jun Yang
{"title":"Fast algorithm for line rasterization by using slope 1","authors":"Hua Zhang, Changqian Zhu, Jun Yang","doi":"10.1109/ISADS.2005.1452121","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452121","url":null,"abstract":"In this paper, a fast algorithm for line rasterization is presented by using approximate pixels. Slope 1 is used to decide which pixel is selected instead of using slope 1/2. Compared with Bresenham's middle point algorithm, three multiplications are reduced in each line raster process. Moreover, experiment shows that at least 6.315 percent of time is saved, and there are almost the same results for viewer compared with those of Bresenham's middle point algorithm.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120990518","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
Ad hoc unidirectional routing protocol based on relay control of route requests 基于中继控制路由请求的Ad hoc单向路由协议
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452167
H. Morino, T. Miyoshi, M. Ogawa
{"title":"Ad hoc unidirectional routing protocol based on relay control of route requests","authors":"H. Morino, T. Miyoshi, M. Ogawa","doi":"10.1109/ISADS.2005.1452167","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452167","url":null,"abstract":"In ad hoc networks where mobile nodes form networks autonomously, many unidirectional links can be generated due to the diversity of transmission range of each node In order to achieve high connectivity in such networks, routing protocols should construct routes by aggressively using unidirectional links. Typical existing routing protocols such as DSR (dynamic source routing) are basically designed assuming links are bidirectional, and they generate substantial control traffic in the unidirectional routing since their optimization schemes are not effective for unidirectional links. This paper presents a novel on-demand ad hoc routing method called FOCUS (controlled-flooding-based ad hoc routing protocol using overheard hop count information to support unidirectional links). FOCUS reduces control traffic of route reconstruction as compared with conventional method by issuing route request in the restricted region around the broken route. The results of performance evaluation by simulation show FOCUS reduces the number of RREQ (route request) packets by about 60 % and reduces packet transmission delay by about 30% compared to DSR.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123793297","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
Towards I-centric business communication tools 走向以i为中心的商务沟通工具
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452110
C. Räck, Thomas Bauer, C. Weckerle, S. Steglich, S. Arbanowski, Taro Nakao, Tadaaki Arimura, Tatsuya Nakamura, Shigetoshi Yokoyama
{"title":"Towards I-centric business communication tools","authors":"C. Räck, Thomas Bauer, C. Weckerle, S. Steglich, S. Arbanowski, Taro Nakao, Tadaaki Arimura, Tatsuya Nakamura, Shigetoshi Yokoyama","doi":"10.1109/ISADS.2005.1452110","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452110","url":null,"abstract":"The vision of I-centric communications is one of the important and well-known paradigms for future ubiquitous user-centric services. Following this vision, the goal of the research project 'I-centric business communication tools (ICBCT)' is to realize a seamless computing environment and supporting tools for mobile workers and users. Context awareness, personalization, adaptation as well as communication support are identified as key features of the envisioned platform. The tools were implemented using YACAN (yet-another context awareness), which is a context awareness framework developed by NTT DATA. During the course of the project, YACAN are enhanced with features derived from the I-centric communications approach. This paper introduces the functional building blocks as well as the logical architecture of the resulting ICBCT platform. Based on this architecture two service scenarios was shown.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"127 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128025412","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
Lattice model based on a new information security function 基于点阵模型的一种新的信息安全函数
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452137
Yihe Liu, Xuwei Li
{"title":"Lattice model based on a new information security function","authors":"Yihe Liu, Xuwei Li","doi":"10.1109/ISADS.2005.1452137","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452137","url":null,"abstract":"Information security is a combination of confidentiality, integrity and availability, and the problem is how to combine them organically. There is a method based on a planar vector concerning the confidentiality and integrity in the paper of Sandhu, (1993), but this method isn't sufficient, so this paper presents a lattice model. A new function H(N, /spl alpha/, /spl beta/) of information security, based on confidentiality and integrity, is introduced. The safety classification of the object is divided by the H(N, /spl alpha/, /spl beta/) value, the information flow policy is described by the function value of two objects and a new information flow lattice model is obtained. The model satisfies the characteristic of Denning (1976), and is found to be reasonable and safe by verification. The model is also an expansion of the lattice-based BLP model and the lattice-based Biba model.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134238851","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}
引用次数: 3
An adaptive key-frame reference picture selection algorithm for video transmission via error prone networks 一种用于易出错网络视频传输的自适应关键帧参考图像选择算法
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452089
Tianwu Yang, Wei Huang, Qiang Peng, Changqian Zhu
{"title":"An adaptive key-frame reference picture selection algorithm for video transmission via error prone networks","authors":"Tianwu Yang, Wei Huang, Qiang Peng, Changqian Zhu","doi":"10.1109/ISADS.2005.1452089","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452089","url":null,"abstract":"When compressed video is transmitted via error prone network, it can suffer from severe degradation. To combat the effect of transmission errors, a novel adaptive key-frame reference picture selection (AKRPS) algorithm is proposed. In this algorithm, key-frames are predefined according to the round-trip delay, and the latest key-frame received ACK signal is used as the reference picture of key-frame while the other frames is encoded normally, which can prevent the temporal error propagation efficiently with keeping high coding efficiency. The required reference picture memory for AKRPS is less than 3 frames independent of the round-trip delay. A frame-layer rate control scheme is also proposed for smoothing the video quality. Simulation results, with different video sequence and H.263+ codec, show that the KRPS can achieve high error resilience at packet error rates (PER) ranging from 1% to 10% in both single-user and multi-user applications.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114547948","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}
引用次数: 6
An improved autonomous clustering scheme for highly mobile large ad hoc networks 一种改进的高移动大型自组织网络自治聚类方案
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452162
T. Ohta, N. Murakami, Ryotaro Oda, Y. Kakuda
{"title":"An improved autonomous clustering scheme for highly mobile large ad hoc networks","authors":"T. Ohta, N. Murakami, Ryotaro Oda, Y. Kakuda","doi":"10.1109/ISADS.2005.1452162","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452162","url":null,"abstract":"Clustering of the ad hoc networks is an important technique for introducing a hierarchical structure into the network. In the previous work we have proposed an autonomous clustering scheme for highly mobile large ad hoc networks, which is adaptive to change of the network topology. In this scheme, the network is logically divided into sets of mobile nodes called clusters, however, is not always geographically divided. As a result, non-preferable situations may occur among clusters. In order to avoid these situations, this paper proposes an improved autonomous clustering scheme for highly mobile large ad hoc networks without using geographic location information on mobile nodes. The simulation results show that the proposed scheme is effective for a geographical division of the network in the sense that the number of gateways among clusters is much decreased and the shape of clusters becomes roundish.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117093607","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}
引用次数: 8
An empirical study on customers' acceptance of Web stores 顾客对网络商店接受度的实证研究
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452139
Zheng Yang, Xiaoli Tan, Y. Mao, Jimo Liu
{"title":"An empirical study on customers' acceptance of Web stores","authors":"Zheng Yang, Xiaoli Tan, Y. Mao, Jimo Liu","doi":"10.1109/ISADS.2005.1452139","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452139","url":null,"abstract":"This paper seeks to find out customers' preference towards Web stores. To serve the purpose, a Fishbein's multi-attribute attitude model was employed to empirically investigate the customers' attitudes toward different product categories at the Web stores. We view the consumer's intention of shopping from the Web stores as a function of beliefs about the attributes possessed by the Web stores weighted by the importance of each attribute. Web-based as well as paper-based surveys are conducted to support the analysis, and we find out products are less acceptable at the Web stores than at the traditional stores t different product categories do have different customers' indices of the Web stores. We also find that non-student shoppers appear to be more positive toward online shopping. Nevertheless, the results from our survey indicate that the gender effect and the experience effect on the acceptance index of the Web stores are not statistically significant.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130181745","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
Creation, deployment, and execution of rule-based services 基于规则的服务的创建、部署和执行
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452097
I. Radusch, S. Arbanowski, S. Steglich, R. Popescu-Zeletin
{"title":"Creation, deployment, and execution of rule-based services","authors":"I. Radusch, S. Arbanowski, S. Steglich, R. Popescu-Zeletin","doi":"10.1109/ISADS.2005.1452097","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452097","url":null,"abstract":"Research in ubiquitous computing showed the possibilities and advantages of deploying personalized and adaptive services in distributed environments. However traditional service creation burdens the users with proprietary device descriptions and service programming skills. New design paradigms, such as general frameworks based on an open cooperating objects standard enable seamless environments for creation, deployment, and execution of services. This open, distributed, and scalable platform supports the realization of evolvable services based on arbitrary combinations of cooperative objects. This paper introduces a system, which allows the adaptable creation, deployment, and execution of rule-based service descriptions. Thereby, services are customizable by the user and automatically adapted to changing environments.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129318106","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信