Product information is complex and discrete in terms of design methods and manufacturing processes, its long term retention has for time been a great challenge. This paper presents an initial investigation into the small world phenomenon within product information with an emphasis on computer-aided design (CAD) data and its generating systems. The objective is to construct a networking model in the notion of six degrees separation and thereafter to produce useful findings for future reference in information organization. It is expected that this model will be an essence for effective CAD data translation, exchange, index and migration and for helping to deal with the key problems in long term retention of product data.
{"title":"An Investigation into Small World Phenomenon in Engineering Informatics","authors":"Zhengxu Zhao, Jinsheng Fan","doi":"10.1109/ICCGI.2008.9","DOIUrl":"https://doi.org/10.1109/ICCGI.2008.9","url":null,"abstract":"Product information is complex and discrete in terms of design methods and manufacturing processes, its long term retention has for time been a great challenge. This paper presents an initial investigation into the small world phenomenon within product information with an emphasis on computer-aided design (CAD) data and its generating systems. The objective is to construct a networking model in the notion of six degrees separation and thereafter to produce useful findings for future reference in information organization. It is expected that this model will be an essence for effective CAD data translation, exchange, index and migration and for helping to deal with the key problems in long term retention of product data.","PeriodicalId":367280,"journal":{"name":"2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129997938","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}
Peer-to-peer (P2P) networks attract attentions worldwide with their great success in file sharing networks (e.g. Napster, Gnutella, BitTorrent, and Kazaa). In the last decade, numerous studies have been devoted to the problem of resource discovery in P2P networks. However, efficient resource discovery remains a key challenge for large-scale P2P networks. An investigation of existing research on resource discovery towards efficient social P2P networks will be given in this paper.
{"title":"Investigation of Research towards Efficient Social Peer-to-Peer Networks","authors":"Lu Liu, N. Antonopoulos, J. Xu, D. Russell","doi":"10.1109/ICCGI.2008.15","DOIUrl":"https://doi.org/10.1109/ICCGI.2008.15","url":null,"abstract":"Peer-to-peer (P2P) networks attract attentions worldwide with their great success in file sharing networks (e.g. Napster, Gnutella, BitTorrent, and Kazaa). In the last decade, numerous studies have been devoted to the problem of resource discovery in P2P networks. However, efficient resource discovery remains a key challenge for large-scale P2P networks. An investigation of existing research on resource discovery towards efficient social P2P networks will be given in this paper.","PeriodicalId":367280,"journal":{"name":"2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129985547","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}
To analyze fuzzy data in uncertain evidential reasoning, some researchers have recently extended the D-S evidence theory to fuzzy sets. But there are some insufficiencies in the definition of the fuzzy belief function and the combination rule on fuzzy sets of the D-S evidence theory. This paper describes a new definition of the similarity degree between two fuzzy sets and the improved extension combination rule of the evidence theory on fuzzy sets. It also presents the corresponding mathematical proof to validate the improved combination rule. Compared with other generalizing combination rules, the results of the numerical experiments show that the new combination rule in this paper can acquire more changing information to the change of fuzzy focal elements more effectively, and it overcomes the insufficiencies of other existing combination rules and enhances the robustness of fusion decision systems effectively.
{"title":"An Improved Extension of the D-S Evidence Theory to Fuzzy Sets","authors":"Y. Miao, X.P. Ma, H.X. Zhang, J.W. Zhang, Z. Zhao","doi":"10.1109/ICCGI.2008.44","DOIUrl":"https://doi.org/10.1109/ICCGI.2008.44","url":null,"abstract":"To analyze fuzzy data in uncertain evidential reasoning, some researchers have recently extended the D-S evidence theory to fuzzy sets. But there are some insufficiencies in the definition of the fuzzy belief function and the combination rule on fuzzy sets of the D-S evidence theory. This paper describes a new definition of the similarity degree between two fuzzy sets and the improved extension combination rule of the evidence theory on fuzzy sets. It also presents the corresponding mathematical proof to validate the improved combination rule. Compared with other generalizing combination rules, the results of the numerical experiments show that the new combination rule in this paper can acquire more changing information to the change of fuzzy focal elements more effectively, and it overcomes the insufficiencies of other existing combination rules and enhances the robustness of fusion decision systems effectively.","PeriodicalId":367280,"journal":{"name":"2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128045931","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}
This paper presents a restricted-area-based localization algorithm (RAL) for wireless sensor networks (WSN), in which radio connectivity and principle of perpendicular bisectors are used to provide a lower estimation error than some of restricted-area-based localization algorithms. In the RAL algorithm, anchor nodes can transmit beacon signals at different power levels, which divide the possible transmission ranges of an anchor into a circle and multiple rings. The intersection of circle or rings of all the anchors heard by unknown node forms restricted-area I. In addition, we utilize all the perpendicular bisectors of the line which connects each pair of anchor nodes to obtain restricted-area II. Based on the restricted-area I and restricted-area II, we can calculate valid intersection points, and take average value of all these points as the estimated location of the unknown nodes. The proposed algorithm is range-free and energy efficient. Neighboring sensor nodes do not need to exchange information. Each sensor node only relies on information of anchors it heard to compute two kinds of restricted-areas and estimates its location. Simulation results show that the proposed algorithm has less estimation error than Centroid, Convex and CAB localization algorithms.
{"title":"A Range Free Localization Algorithm Based on Restricted-Area for Wireless Sensor Networks","authors":"Chao Wang, Kai Liu, Nan Xiao","doi":"10.1109/ICCGI.2008.47","DOIUrl":"https://doi.org/10.1109/ICCGI.2008.47","url":null,"abstract":"This paper presents a restricted-area-based localization algorithm (RAL) for wireless sensor networks (WSN), in which radio connectivity and principle of perpendicular bisectors are used to provide a lower estimation error than some of restricted-area-based localization algorithms. In the RAL algorithm, anchor nodes can transmit beacon signals at different power levels, which divide the possible transmission ranges of an anchor into a circle and multiple rings. The intersection of circle or rings of all the anchors heard by unknown node forms restricted-area I. In addition, we utilize all the perpendicular bisectors of the line which connects each pair of anchor nodes to obtain restricted-area II. Based on the restricted-area I and restricted-area II, we can calculate valid intersection points, and take average value of all these points as the estimated location of the unknown nodes. The proposed algorithm is range-free and energy efficient. Neighboring sensor nodes do not need to exchange information. Each sensor node only relies on information of anchors it heard to compute two kinds of restricted-areas and estimates its location. Simulation results show that the proposed algorithm has less estimation error than Centroid, Convex and CAB localization algorithms.","PeriodicalId":367280,"journal":{"name":"2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115640993","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}
Reputation is a crucial factor in trust and thus in Web communities. Trust strategies may involve investigating user reputation or directly using transitive reputation to form the Web of Trust. We suggest an approach that takes advantage of both strategies without increasing the cost of investigation. Several systems nowadays form what we call ldquouser Web communitiesrdquo. In these communities, reputation related to different contexts needs to be exchanged. The perception, calculation and interpretation of this reputation differ from one community to another. We propose the development of reference models to diminish the distance between these multi-perceptions. We also propose the use of reputation centers to facilitate reputation transfer and highlight the importance of their role in analyzing attacks on reputation.
{"title":"Getting More from Reputation Systems: A Context–Aware Reputation Framework Based on Trust Centers and Agent Lists","authors":"R. Alnemr, C. Meinel","doi":"10.1109/ICCGI.2008.45","DOIUrl":"https://doi.org/10.1109/ICCGI.2008.45","url":null,"abstract":"Reputation is a crucial factor in trust and thus in Web communities. Trust strategies may involve investigating user reputation or directly using transitive reputation to form the Web of Trust. We suggest an approach that takes advantage of both strategies without increasing the cost of investigation. Several systems nowadays form what we call ldquouser Web communitiesrdquo. In these communities, reputation related to different contexts needs to be exchanged. The perception, calculation and interpretation of this reputation differ from one community to another. We propose the development of reference models to diminish the distance between these multi-perceptions. We also propose the use of reputation centers to facilitate reputation transfer and highlight the importance of their role in analyzing attacks on reputation.","PeriodicalId":367280,"journal":{"name":"2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124365879","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}
B. Freudenthaler, G. Gutenbrunner, R. Stumptner, J. King
This paper deals with the support of human experts in making decisions in the field of bridge monitoring. Thereby, the methodology case-based reasoning is described to develop a decision support system for the interpretation of measurement results of bridges. Case-based reasoning is a cyclic problem solving method whereby already known knowledge about bridges is stored in form of cases. The system uses these cases to help the engineers in interpreting measurement results. Each bridge has different dynamic parameters. Therefore, analysis and interpretation of the raw datais very time-consuming and cost-intensive. Furthermore, the interpretation by human experts is done in a subjective way because each engineer has different concepts and experience in the interpretation of bridge measurement data. On this account, there is a need for an intelligent decision support system to support engineers in interpreting measurement results and making decisions.
{"title":"Case-Based Decision Support for Bridge Monitoring","authors":"B. Freudenthaler, G. Gutenbrunner, R. Stumptner, J. King","doi":"10.1109/ICCGI.2008.33","DOIUrl":"https://doi.org/10.1109/ICCGI.2008.33","url":null,"abstract":"This paper deals with the support of human experts in making decisions in the field of bridge monitoring. Thereby, the methodology case-based reasoning is described to develop a decision support system for the interpretation of measurement results of bridges. Case-based reasoning is a cyclic problem solving method whereby already known knowledge about bridges is stored in form of cases. The system uses these cases to help the engineers in interpreting measurement results. Each bridge has different dynamic parameters. Therefore, analysis and interpretation of the raw datais very time-consuming and cost-intensive. Furthermore, the interpretation by human experts is done in a subjective way because each engineer has different concepts and experience in the interpretation of bridge measurement data. On this account, there is a need for an intelligent decision support system to support engineers in interpreting measurement results and making decisions.","PeriodicalId":367280,"journal":{"name":"2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124412409","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}
Target tracking based on passive sensor data is of great importance in practical applications. In bearing only target tracking, the basic parameters defining the target motion is estimated through noise corrupted measurement data. Depending on the noise characteristics, the search space has many local minima. Obtaining the global minimum -that is the optimal solution - is an active area of research over the past few decades. In this work, a new optimization algorithm, namely Big Bang - Big Crunch algorithm is shown to fit this problem. The results are superior relative to classical genetic algorithm approach both in terms of speed and accuracy.
{"title":"Bearing-Only Target Tracking Based on Big Bang – Big Crunch Algorithm","authors":"H. Genç, A. K. Hocaoglu","doi":"10.1109/ICCGI.2008.53","DOIUrl":"https://doi.org/10.1109/ICCGI.2008.53","url":null,"abstract":"Target tracking based on passive sensor data is of great importance in practical applications. In bearing only target tracking, the basic parameters defining the target motion is estimated through noise corrupted measurement data. Depending on the noise characteristics, the search space has many local minima. Obtaining the global minimum -that is the optimal solution - is an active area of research over the past few decades. In this work, a new optimization algorithm, namely Big Bang - Big Crunch algorithm is shown to fit this problem. The results are superior relative to classical genetic algorithm approach both in terms of speed and accuracy.","PeriodicalId":367280,"journal":{"name":"2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131996702","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}
Node sampling services provide peers in a peer-to-peer system with a source of randomly chosen addresses of other nodes. Ideally, samples should be independent and uniform. The restrictions of a distributed environment, however, introduce various dependancies between samples. We review gossip-based sampling protocols proposed in previous work, and identify sources of inaccuracy. These include replicating the items from which samples are drawn, and imprecise management of the process of refreshing items. Based on this analysis, we propose a new protocol, Eddy, which seeks to minimize temporal and spatial dependancies between samples. We demonstrate that these changes lead to a better sampling service by showing, through simulations, that using Eddy improves the accuracy of a network-size estimation algorithm that uses the random samples from the protocol.
{"title":"Improving the Accuracy of Peer-to-Peer Sampling Services","authors":"E. Ogston, S. Jarvis","doi":"10.1109/ICCGI.2008.39","DOIUrl":"https://doi.org/10.1109/ICCGI.2008.39","url":null,"abstract":"Node sampling services provide peers in a peer-to-peer system with a source of randomly chosen addresses of other nodes. Ideally, samples should be independent and uniform. The restrictions of a distributed environment, however, introduce various dependancies between samples. We review gossip-based sampling protocols proposed in previous work, and identify sources of inaccuracy. These include replicating the items from which samples are drawn, and imprecise management of the process of refreshing items. Based on this analysis, we propose a new protocol, Eddy, which seeks to minimize temporal and spatial dependancies between samples. We demonstrate that these changes lead to a better sampling service by showing, through simulations, that using Eddy improves the accuracy of a network-size estimation algorithm that uses the random samples from the protocol.","PeriodicalId":367280,"journal":{"name":"2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132197391","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}
Service-oriented computing paradigms have considerably enhanced support for dynamic in modern computing environments by providing loosely coupled interactions between components. The key attainment is the ability to perform a late binding of service compositions, i.e., an allocation of actual services to service place holders during run-time. However, this attainment is limited to the binding of services and cannot operate on the service composition plans itself. Moreover, many service composition representations do not consider the realtime behavior of single services, failing to address a key need of service compositions within dynamic environments that are characterized by a high node mobility. Within this paper, we introduce a service composition model based on a bipartite graph representation that enables the rapid modification of already existing service composition plans. Here, the workflow within a service composition is modeled with a timed automaton while a labeled digraph ensures the correct flow of data between the single services.
{"title":"Modeling and Controlling Dynamic Service Compositions","authors":"H. Pfeffer, D. Linner, S. Steglich","doi":"10.1109/ICCGI.2008.40","DOIUrl":"https://doi.org/10.1109/ICCGI.2008.40","url":null,"abstract":"Service-oriented computing paradigms have considerably enhanced support for dynamic in modern computing environments by providing loosely coupled interactions between components. The key attainment is the ability to perform a late binding of service compositions, i.e., an allocation of actual services to service place holders during run-time. However, this attainment is limited to the binding of services and cannot operate on the service composition plans itself. Moreover, many service composition representations do not consider the realtime behavior of single services, failing to address a key need of service compositions within dynamic environments that are characterized by a high node mobility. Within this paper, we introduce a service composition model based on a bipartite graph representation that enables the rapid modification of already existing service composition plans. Here, the workflow within a service composition is modeled with a timed automaton while a labeled digraph ensures the correct flow of data between the single services.","PeriodicalId":367280,"journal":{"name":"2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122129053","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}
In the present paper, we propose a file replication method to dynamically balance loads of peers in unstructured peer-to-peer (P2P) file-sharing networks. Load balancing is considered to require uniform storage access by file replication. We then define the load index as the storage access ratio. In the proposed method, each peer autonomously regulates the file replication probability to uniform storage accesses as thermal diffusion phenomena. Simulation results reveal that the proposed method can control the file sharing network to balance loads while dynamically adapting to change of storage accesses that is caused by change of popularity trends, and therefore keep load balancing performance stable. In addition, the proposed method achieves greater adaptability to sudden changes in storage accesses than our previous method.
{"title":"Thermal Diffusion-Based Access Load Balancing for P2P File Sharing Networks","authors":"M. Takaoka, K. Ohnishi, M. Uchida, Y. Oie","doi":"10.1109/ICCGI.2008.36","DOIUrl":"https://doi.org/10.1109/ICCGI.2008.36","url":null,"abstract":"In the present paper, we propose a file replication method to dynamically balance loads of peers in unstructured peer-to-peer (P2P) file-sharing networks. Load balancing is considered to require uniform storage access by file replication. We then define the load index as the storage access ratio. In the proposed method, each peer autonomously regulates the file replication probability to uniform storage accesses as thermal diffusion phenomena. Simulation results reveal that the proposed method can control the file sharing network to balance loads while dynamically adapting to change of storage accesses that is caused by change of popularity trends, and therefore keep load balancing performance stable. In addition, the proposed method achieves greater adaptability to sudden changes in storage accesses than our previous method.","PeriodicalId":367280,"journal":{"name":"2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124980652","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：