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

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

筛选
英文 中文
Remote sensing image data fusion based on local deviation of wavelet packet transform 基于局部偏差小波包变换的遥感图像数据融合
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452090
Jin Wu, Honglin Huang, J. Tian, Jian Liu
{"title":"Remote sensing image data fusion based on local deviation of wavelet packet transform","authors":"Jin Wu, Honglin Huang, J. Tian, Jian Liu","doi":"10.1109/ISADS.2005.1452090","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452090","url":null,"abstract":"The goal of image fusion is to create new images that are more suitable for human visual perception, machine vision, object detection and target recognition. In order to adequately make use of all kinds of remote sensing image information, a new image fusion method based on local deviation of the wavelet packet transform is proposed. In fusion processing, the fused approximate coefficients are obtained by the weighted average method. For larger local deviation of each decomposed approximate coefficient, we choose a big power gene. The other approximate coefficient chooses a small one. The fused detailed coefficients are obtained by making each coefficient equal to the corresponding input image wavelet packet coefficient that has the greatest local deviation. Both the image information entropy and image clarity are employed to evaluate the performance of the remote sensing fusion algorithm. The experimental results show that the proposed method is more effective than the other methods.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"9 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":"126102454","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}
引用次数: 9
Performance enhancement via two-layer support for peer-to-peer systems using active networking 通过对使用主动网络的对等系统的两层支持来增强性能
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452172
Linlin Xie, D. Hutchison, Paul Smith
{"title":"Performance enhancement via two-layer support for peer-to-peer systems using active networking","authors":"Linlin Xie, D. Hutchison, Paul Smith","doi":"10.1109/ISADS.2005.1452172","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452172","url":null,"abstract":"The stratification of Internet protocols segregates network functionality into two broad layers: the overlay layer (application level) and the underlay layer (network level). Overlay networks are typically not aware of the operation of underlay networks, and conversely underlay networks are blind of the services executing at the overlay layer. Even though there is a prolific deployment of overlay networking based services, this architectural design is proving to have a number of deficiencies. Typically, such services make poor use of underlying networking resources, leading to degraded user-perceived quality of service. We propose a two-layer coordination and control framework aimed at optimizing network performance and enhancing user-perceived service. The framework and corresponding middleware structure make use of active networking technology. We choose peer-to-peer systems as our overlay study case, and discuss the problems associated with providing two-layer optimization and application support for such systems. Finally, we draw conclusions about the potential benefits of this approach and point towards possible directions of future work.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"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":"125772277","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
A new multicast routing protocol based on autonomous clustering in ad hoc networks 一种新的基于自治聚类的组播路由协议
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452072
T. Ohta, Toshifumi Kawaguchi, Y. Kakuda
{"title":"A new multicast routing protocol based on autonomous clustering in ad hoc networks","authors":"T. Ohta, Toshifumi Kawaguchi, Y. Kakuda","doi":"10.1109/ISADS.2005.1452072","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452072","url":null,"abstract":"This paper discusses multicast routing in ad hoc networks. The multicast routing is defined as routing such that the same message is delivered from a node to a set of more than one node called multicast group. Since nodes move around in the ad hoc networks and members join and leaves from the multicast group, it is difficult to manage the multicast group and to maintain routes along which the same message is delivered to the multicast group. We have proposed an autonomous and adaptive clustering scheme to keep sets of connected nodes as clusters. In order to cope with the difficulties mentioned above, this paper proposes a new hierarchical multicast routing protocol to which the autonomous and adaptive clustering is applied in ad hoc networks. Simulation results show that the proposed protocol is effective from the viewpoint of the numbers of control packets and delivered data packets in comparison with a typical core-based multicast routing protocol MAODV.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"48 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":"126598614","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}
引用次数: 5
Blending Web services and agents for mobile users 为移动用户混合Web服务和代理
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452141
Wassam Zahreddine, Q. Mahmoud
{"title":"Blending Web services and agents for mobile users","authors":"Wassam Zahreddine, Q. Mahmoud","doi":"10.1109/ISADS.2005.1452141","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452141","url":null,"abstract":"This paper investigates Web services and mobile agents as two individually powerful technologies and when combined together, provides ease of use and reliability for any user. Web services have their shortfalls but with the help of mobile agents these weaknesses can be overcome. A single Web service may not be enough to satisfy a user's requirements. It might be necessary to combine multiple Web services together (a composite service) to satisfy a requirement; that is where agents can be used to compose Web services on behalf of their users. On the other hand, when agents move around to perform a task on behalf of a user, they will need to execute a service and such a service might be a Web service itself. In this paper, we discuss why agents and Web services should not be viewed as competing technologies and we present methods for integrating them together to deliver reliable services to the end user.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"62 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":"126264320","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
Effect of preventive rejuvenation in communication network system with burst arrival 突发到达通信网络系统预防性返老还童的效果
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452041
H. Okamura, Satoshi Miyahara, T. Dohi
{"title":"Effect of preventive rejuvenation in communication network system with burst arrival","authors":"H. Okamura, Satoshi Miyahara, T. Dohi","doi":"10.1109/ISADS.2005.1452041","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452041","url":null,"abstract":"Long running software systems are known to experience an aging phenomenon called software aging, one in which the accumulation of errors during the execution of software leads to performance degradation and eventually results in failure. To counteract this phenomenon a proactive fault management approach, called software rejuvenation, is particularly useful. It essentially involves gracefully terminating an application or a system and restarting it in a clean internal state. In this paper, we perform the dependability analysis of a client/server software system with rejuvenation under the assumption that the requests arrive according to the Markov modulated Poisson process. Three dependability measures, steady-state availability, loss probability of requests and mean response time on tasks, are derived through the hidden Markovian analysis based on the time-based software rejuvenation scheme. In numerical examples, we investigate the sensitivity of some model parameters to the dependability measures.","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":"130568491","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
Stochastic fluid model for P2P content distribution networks P2P内容分发网络的随机流体模型
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452174
Ying Lu, An Zhang, Haifeng He, Z. Deng
{"title":"Stochastic fluid model for P2P content distribution networks","authors":"Ying Lu, An Zhang, Haifeng He, Z. Deng","doi":"10.1109/ISADS.2005.1452174","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452174","url":null,"abstract":"Traditional content distributions such as Web cache and content distribution networks need to reconfigure the networks or purchase additional servers to support these services. While P2P content distribution networks do not change the underlying infrastructure. We propose to build the multi-P2P networks based on the current unstructured and structured P2P networks. And the contents are distributed between multi-P2P networks. We explore the stochastic fluid analytical models for the purpose of multi-P2P networks performance. And we get the results of the relation between the content get probability and the number of multi-P2P networks, number of nodes, users' request rate, content expiration rate through this analytical model. The number of multi-P2P networks has a more impact on the content get probability than that of the universal P2P network. It has been proved that the scheme of constructing multi-P2P networks is effective.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"50 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":"130908120","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}
引用次数: 10
v-SVM for transient stability assessment in power systems 电力系统暂态稳定评估的v-SVM
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452085
Xiaohong Wang, Sitao Wu, Qunzhan Li, Xiaoru Wang
{"title":"v-SVM for transient stability assessment in power systems","authors":"Xiaohong Wang, Sitao Wu, Qunzhan Li, Xiaoru Wang","doi":"10.1109/ISADS.2005.1452085","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452085","url":null,"abstract":"In this paper, support vector machines (SVMs) are studied in the application of transient stability assessment in power systems. SVMs have the following advantages: automatic determination of the number of hidden neurons, fast convergence rate, good generalization capability, etc. SVMs use the principle of structural risk minimization, and thus reduce the dependency of experience unlike neural networks and have better generalization and classification precision. Furthermore, SVMs are solved by the 2nd order convex programming and the final solution of SVMs is sole and optimal. The performance of SVMs depends on the type of kernel functions and the parameters of kernel functions, which are determined by experience or experiments. So the effects of kernel functions and the parameters of kernel functions are analyzed by experiments in the paper. In addition, Experiments corroborate the superiority of v-SVM applied in TSA in power systems by comparing with BP and RBE.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"11 20 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":"116824946","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}
引用次数: 17
Reputation management: experiments on the robustness of ROCQ 声誉管理:ROCQ鲁棒性实验
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452182
Anurag Garg, R. Battiti, Roberto G. Cascella
{"title":"Reputation management: experiments on the robustness of ROCQ","authors":"Anurag Garg, R. Battiti, Roberto G. Cascella","doi":"10.1109/ISADS.2005.1452182","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452182","url":null,"abstract":"In order for autonomic systems to function, the individual components must co-operate and not indulge in malicious behavior. However, it is almost certain that autonomous systems in. Next generation networks will inadvertently include less than trustworthy components. Identifying such entities is critical to the smooth and effective functioning. We present new experiments conducted with the ROCQ scheme, a reputation-based trust management system that computes the trustworthiness of peers on the basis of transaction-based feedback. The ROCQ model combines four parameters: reputation (R) or a peer's global trust rating, opinion (O) formed by a peer's first-hand interactions, credibility (C) of a reporting peer and quality (Q) or the confidence a reporting peer puts on the feedback it provides. In this paper, we demonstrate that ROCQ is robust against churn and also examine the effect of credibility and quality on the performance of the scheme.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"173 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":"133641345","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
Considerations on transaction response time and configuration checking in autonomous decentralized DB (ADDS) 关于自治分散数据库(add)中事务响应时间和配置检查的考虑
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452013
I. Kaji, K. Kano
{"title":"Considerations on transaction response time and configuration checking in autonomous decentralized DB (ADDS)","authors":"I. Kaji, K. Kano","doi":"10.1109/ISADS.2005.1452013","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452013","url":null,"abstract":"In a distributed computing environment, the autonomous decentralized database system (ADDS) has been proposed to avoid the single point of failure. In ADDS, the update operations at each node are autonomously performed without communicating with other nodes if the amount of update requests are within the allowance volume (AV), thus the short response time of the transactions can be realized. Each node starts the AV adjustments when given AV amounts reach the threshold value, and gets the AV from relatively surplus nodes. To communicate with other nodes, there are two types of communications, one is a point to point (P2P) communication and the other is a mobile agent (MA) circulation. This paper discusses the relationship among the message amount, the configuration check frequency and the transaction response time in the P2P communication. We have defined the configuration checking frequency (f) that expresses how frequently a node confirms the configuration per AV request. It is expected that the value f which gives the minimum transaction response may exist. The simulator has been developed to evaluate the relationship and simulations have been performed in various parameters.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"22 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":"124815527","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
The simulation research for the ATO model based on fuzzy predictive control 基于模糊预测控制的ATO模型仿真研究
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452060
Jinling Zhu, Xiaoyun Feng, Qing He, Jian Xiao
{"title":"The simulation research for the ATO model based on fuzzy predictive control","authors":"Jinling Zhu, Xiaoyun Feng, Qing He, Jian Xiao","doi":"10.1109/ISADS.2005.1452060","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452060","url":null,"abstract":"The train control system is non-linear with large time-delay. It is difficult to get its accurate mathematic model and optimized control solution. Based on the characteristics of train operation control system, a predictive control algorithm is studied in this paper. A satisfactory optimization model and associate algorithm for the maximal operation ability of locomotive are established. The strategies of train maximal capability manipulating control are also proposed. The simulation of train running process based on the proposed model and algorithm is carried on, and the test results show the validity of the model and the algorithm.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"415 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":"124168950","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}
引用次数: 2
首页 上一页 下一页 尾页
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学术官方微信