Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461185
Chung-Kuo Chang, J. Overhage, J. Huang
Since the inception of sensor networks, it is recognized that the foremost application of such a network is on monitoring environmental activities. Due to the extreme resource constraints, a critical feature of such a network is to conserve energy to extend the lifetime of the sensors. A variety of energy aware algorithms have been developed for these networks by aggregating or filtering of data being transmitted. Energy can also be saved by selecting a subgroup of sensors to activate each time. Uncertainties are introduced due to the inaccuracy in sensor readings, noise or failure of sensors, or the omissions of data transmission following those energy aware algorithms. On the other hand, there usually are uncertainties inherited in the application where these sensor networks are built. Its usefulness depends on whether we can find a strategy to reduce uncertainties and at the same time conserve energy in such a system. We discuss the application of sensor networks in the problem of syndromic surveillance. The aggregated action of the sensors would provide early evidence for screening and identification of outbreaks of diseases or bio-agents. We study the effects of using the Bayesian methods to reduce uncertainties in sensor networks for medical decision-making. Experimental results obtained using operational data are used to verify our assumptions. A lot of study has been done on applying sensor networks to tasks such as tracking of a moving object, which is mapping an estimation task over a network of sensors. This project is the first case to map a medical decision, which is essentially an uncertainty refinement problem to sensor networks.
{"title":"An application of sensor networks for syndromic surveillance","authors":"Chung-Kuo Chang, J. Overhage, J. Huang","doi":"10.1109/ICNSC.2005.1461185","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461185","url":null,"abstract":"Since the inception of sensor networks, it is recognized that the foremost application of such a network is on monitoring environmental activities. Due to the extreme resource constraints, a critical feature of such a network is to conserve energy to extend the lifetime of the sensors. A variety of energy aware algorithms have been developed for these networks by aggregating or filtering of data being transmitted. Energy can also be saved by selecting a subgroup of sensors to activate each time. Uncertainties are introduced due to the inaccuracy in sensor readings, noise or failure of sensors, or the omissions of data transmission following those energy aware algorithms. On the other hand, there usually are uncertainties inherited in the application where these sensor networks are built. Its usefulness depends on whether we can find a strategy to reduce uncertainties and at the same time conserve energy in such a system. We discuss the application of sensor networks in the problem of syndromic surveillance. The aggregated action of the sensors would provide early evidence for screening and identification of outbreaks of diseases or bio-agents. We study the effects of using the Bayesian methods to reduce uncertainties in sensor networks for medical decision-making. Experimental results obtained using operational data are used to verify our assumptions. A lot of study has been done on applying sensor networks to tasks such as tracking of a moving object, which is mapping an estimation task over a network of sensors. This project is the first case to map a medical decision, which is essentially an uncertainty refinement problem to sensor networks.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115310512","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}
Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461279
Li Li, Guanpi Lai, Feiyue Wang
With increasing demands on driving safety, vehicle steering control attracts significant interests during the last two decades. One important problem is that drivers may overestimate the maximum speed they can adopt or choose a wrong trajectory profile (steering guideline) during steering. This often leads the vehicle run out of the road. To avoid such accidents, this paper analyzes the relationship between navigation speed and the corresponding cruise offset with given steering curvature, and provides an estimation method for maximum safe speed regarding a curve or a lane change trajectory. To improve ride comfort, an optimal guideline planning framework considering different driver/passenger requirement is proposed. Besides, how to choose graphical user interface for steering guidance is also discussed.
{"title":"Safe steering speed estimation and optimal trajectory planning for intelligent vehicles","authors":"Li Li, Guanpi Lai, Feiyue Wang","doi":"10.1109/ICNSC.2005.1461279","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461279","url":null,"abstract":"With increasing demands on driving safety, vehicle steering control attracts significant interests during the last two decades. One important problem is that drivers may overestimate the maximum speed they can adopt or choose a wrong trajectory profile (steering guideline) during steering. This often leads the vehicle run out of the road. To avoid such accidents, this paper analyzes the relationship between navigation speed and the corresponding cruise offset with given steering curvature, and provides an estimation method for maximum safe speed regarding a curve or a lane change trajectory. To improve ride comfort, an optimal guideline planning framework considering different driver/passenger requirement is proposed. Besides, how to choose graphical user interface for steering guidance is also discussed.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114986398","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}
Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461191
Yongchun He, Cong Wang, J. Qiu
At present, as an extension of distributed computing, the technology of mobile agent is becoming more and more popular. In this paper, a model of Web information gathering based on mobile agent technology is constructed, and the design of the model and the working process is introduced. A model of cooperating working for information gathering and a kind of arithmetic to implement this model are given. In addition, the upgrade of information gathered is implemented by making use of mobile agent technology.
{"title":"An information gathering model based on mobile agents","authors":"Yongchun He, Cong Wang, J. Qiu","doi":"10.1109/ICNSC.2005.1461191","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461191","url":null,"abstract":"At present, as an extension of distributed computing, the technology of mobile agent is becoming more and more popular. In this paper, a model of Web information gathering based on mobile agent technology is constructed, and the design of the model and the working process is introduced. A model of cooperating working for information gathering and a kind of arithmetic to implement this model are given. In addition, the upgrade of information gathered is implemented by making use of mobile agent technology.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124470455","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}
Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461313
Lu Qingling, Zeng Guangping, Zhang Wei, Tu Xuyan
SoftMan is a new concept based on the production of distributed technique, intelligent robot and artificial life. SoftMan is the development of a mobile agent and is a virtual robot in the network environment. It inherited many research fruits of robot and agent. Therefore, it has the essential features of the intelligent robot and agent, and at the same time has life features. Comparing with the agent, SoftMan not only has more all-around humanized intelligence, humanized behavior and function, but also has the ability of environment identification, self-determination and free will. SoftMan has some digital life features which agent has none, such as activity, learning and evolution, inheritance, variation and emotion. The corresponding theory and technology fruits provided a good foundation and reference for studying SoftMan. At first, this paper introduces the technology of SoftMan and agent, and then discusses the relationship between SoftMan and agent from the viewpoint of structure model, function, implementation technique, and application example.
{"title":"SoftMan and agent","authors":"Lu Qingling, Zeng Guangping, Zhang Wei, Tu Xuyan","doi":"10.1109/ICNSC.2005.1461313","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461313","url":null,"abstract":"SoftMan is a new concept based on the production of distributed technique, intelligent robot and artificial life. SoftMan is the development of a mobile agent and is a virtual robot in the network environment. It inherited many research fruits of robot and agent. Therefore, it has the essential features of the intelligent robot and agent, and at the same time has life features. Comparing with the agent, SoftMan not only has more all-around humanized intelligence, humanized behavior and function, but also has the ability of environment identification, self-determination and free will. SoftMan has some digital life features which agent has none, such as activity, learning and evolution, inheritance, variation and emotion. The corresponding theory and technology fruits provided a good foundation and reference for studying SoftMan. At first, this paper introduces the technology of SoftMan and agent, and then discusses the relationship between SoftMan and agent from the viewpoint of structure model, function, implementation technique, and application example.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"46 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123266844","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}
Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461246
Yu-Cheng Lin, Ji-Chang Lo
This paper studies an H/sub /spl infin// output feedback control problem for continuous-time T-S fuzzy systems with time-varying delays both in state variables and forced input. Unlike the existing results need the information on derivative of delay time, we propose two delay-dependent sufficient conditions free from derivative information on delay time, which means a fast-varying delay time is allowed. Based on Lyapunov theory, the sufficient conditions are expressed in terms of LMIs. Lastly, an example is demonstrated using the proposed design methodology.
{"title":"H/sub /spl infin// output feedback control for delay Takagi-Sugeno fuzzy systems","authors":"Yu-Cheng Lin, Ji-Chang Lo","doi":"10.1109/ICNSC.2005.1461246","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461246","url":null,"abstract":"This paper studies an H/sub /spl infin// output feedback control problem for continuous-time T-S fuzzy systems with time-varying delays both in state variables and forced input. Unlike the existing results need the information on derivative of delay time, we propose two delay-dependent sufficient conditions free from derivative information on delay time, which means a fast-varying delay time is allowed. Based on Lyapunov theory, the sufficient conditions are expressed in terms of LMIs. Lastly, an example is demonstrated using the proposed design methodology.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123883506","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}
Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461332
Meng Yu, Wanyu Zang, Peng Liu, Jiacun Wang
Distributed computing systems are important in daily business processing. Since vulnerability cannot be totally removed from a distributed computing system, successful attacks always happen and may inject malicious tasks or incorrect data into the distributed system. Referring to the incorrect data will further corrupt more data objects in the system, which comprises the integrity level of the system. In this paper, based on our recovery theories and algorithms proposed in [Yu, M., et al. (2004)], we build an architecture of a distributed attack recovery system. Our work can help the user to build a real recovery system and serve as a test bed to evaluate both our attack recovery techniques and new developed attack recovery techniques in the future.
分布式计算系统在日常业务处理中非常重要。由于分布式计算系统不可能完全消除漏洞,因此总会发生成功的攻击,并可能向分布式系统注入恶意任务或错误数据。引用不正确的数据将进一步破坏系统中的更多数据对象,这构成了系统的完整性级别。本文在[Yu, M., et al.(2004)]中提出的恢复理论和算法的基础上,构建了分布式攻击恢复系统的体系结构。我们的工作可以帮助用户建立一个真实的恢复系统,并作为一个测试平台来评估我们的攻击恢复技术和未来新开发的攻击恢复技术。
{"title":"The architecture of an automatic distributed recovery system","authors":"Meng Yu, Wanyu Zang, Peng Liu, Jiacun Wang","doi":"10.1109/ICNSC.2005.1461332","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461332","url":null,"abstract":"Distributed computing systems are important in daily business processing. Since vulnerability cannot be totally removed from a distributed computing system, successful attacks always happen and may inject malicious tasks or incorrect data into the distributed system. Referring to the incorrect data will further corrupt more data objects in the system, which comprises the integrity level of the system. In this paper, based on our recovery theories and algorithms proposed in [Yu, M., et al. (2004)], we build an architecture of a distributed attack recovery system. Our work can help the user to build a real recovery system and serve as a test bed to evaluate both our attack recovery techniques and new developed attack recovery techniques in the future.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126269674","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}
Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461300
Bin Ye, Zhonggui Ma, Cong Wang, Xuyan Tu
This paper presented a structure model of distributed intelligent ERP system based on SoftMan technology, multiple base cooperation technology. The authors analyzed the disadvantage of traditional ERP system. Many defects of system, such as the bad intelligence and flexibility, are indicated. These work supplies the foundation in order to design and apply the distributed intelligent ERP system.
{"title":"Research on the architecture of distributed intelligent ERP system","authors":"Bin Ye, Zhonggui Ma, Cong Wang, Xuyan Tu","doi":"10.1109/ICNSC.2005.1461300","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461300","url":null,"abstract":"This paper presented a structure model of distributed intelligent ERP system based on SoftMan technology, multiple base cooperation technology. The authors analyzed the disadvantage of traditional ERP system. Many defects of system, such as the bad intelligence and flexibility, are indicated. These work supplies the foundation in order to design and apply the distributed intelligent ERP system.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125794406","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}
Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461245
Yuh-Horng Wen, Tsu-Tian Lee, Hsun-Jung Cho
This paper develops a data processing with hybrid models toward data treatment and data fusion for traffic detector data on freeways. hybrid grey-theory-based pseudo-nearest neighbor method and grey time-series model are developed to recover spatial and temporal data failures. Both spatial and temporal patterns of traffic data are also considered in travel time data fusion. Two travel time data fusion models are presented using a speed-based link travel time extrapolation model for analytical travel time estimation and a recurrent neural network with grey-models for real-time travel time prediction. Field data from the Taiwan national freeway no. 1 were used as a case study for testing the proposed models. Study results shown that the data treatment models for faulty data recovery were accurate. The data fusion models were capable of accurately predicting travel times. The results indicated that the proposed hybrid data processing approaches can ensure the accuracy of travel time estimation with incomplete data sets.
{"title":"Hybrid models toward traffic detector data treatment and data fusion","authors":"Yuh-Horng Wen, Tsu-Tian Lee, Hsun-Jung Cho","doi":"10.1109/ICNSC.2005.1461245","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461245","url":null,"abstract":"This paper develops a data processing with hybrid models toward data treatment and data fusion for traffic detector data on freeways. hybrid grey-theory-based pseudo-nearest neighbor method and grey time-series model are developed to recover spatial and temporal data failures. Both spatial and temporal patterns of traffic data are also considered in travel time data fusion. Two travel time data fusion models are presented using a speed-based link travel time extrapolation model for analytical travel time estimation and a recurrent neural network with grey-models for real-time travel time prediction. Field data from the Taiwan national freeway no. 1 were used as a case study for testing the proposed models. Study results shown that the data treatment models for faulty data recovery were accurate. The data fusion models were capable of accurately predicting travel times. The results indicated that the proposed hybrid data processing approaches can ensure the accuracy of travel time estimation with incomplete data sets.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129393382","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}
Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461206
G. York, D. Pack
In this paper, we evaluate two different methods to search, detect, and locate mobile radio frequency (RF) targets using multiple cooperative unmanned aerial vehicles (VAVs). The primary difference between the two methods is the target localization technique used: the Kalman estimation technique and the triangulation technique. We compare the two methods on the basis of the total task completion time and the total average target location accuracy. The qualitative results generated by a graphical simulator are presented as a part of our comparison study.
{"title":"Comparative study on time-varying target localization methods using multiple unmanned aerial vehicles: Kalman estimation and triangulation techniques","authors":"G. York, D. Pack","doi":"10.1109/ICNSC.2005.1461206","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461206","url":null,"abstract":"In this paper, we evaluate two different methods to search, detect, and locate mobile radio frequency (RF) targets using multiple cooperative unmanned aerial vehicles (VAVs). The primary difference between the two methods is the target localization technique used: the Kalman estimation technique and the triangulation technique. We compare the two methods on the basis of the total task completion time and the total average target location accuracy. The qualitative results generated by a graphical simulator are presented as a part of our comparison study.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129515685","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}
Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461283
F. Velasco, Félix Ramos
Web services have become very popular over the past few years. However, users are facing the problem of the perceived QoS. Practical approaches to address this issue are based on service replication at multiple locations and on allocation mechanisms to dispatch requests in such a way that the QoS perceived by the user is improved. In this paper we compare user perceived QoS performance of three dynamic request placement techniques. One technique randomly allocates Web requests while the other two techniques implement a market-based mechanism for QoS negotiation and request allocation. The analysis is conducted via simulation with SIDE using a behavioral model of Web traffic to simulate accurate traffic conditions and determine the limitations or validity of these techniques.
{"title":"Performance evaluation of quality of service aware request placement techniques","authors":"F. Velasco, Félix Ramos","doi":"10.1109/ICNSC.2005.1461283","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461283","url":null,"abstract":"Web services have become very popular over the past few years. However, users are facing the problem of the perceived QoS. Practical approaches to address this issue are based on service replication at multiple locations and on allocation mechanisms to dispatch requests in such a way that the QoS perceived by the user is improved. In this paper we compare user perceived QoS performance of three dynamic request placement techniques. One technique randomly allocates Web requests while the other two techniques implement a market-based mechanism for QoS negotiation and request allocation. The analysis is conducted via simulation with SIDE using a behavioral model of Web traffic to simulate accurate traffic conditions and determine the limitations or validity of these techniques.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130927190","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}