Pub Date : 2006-05-08DOI: 10.1109/ICACT.2006.205987
Ki-Hyuk Nam, Junkil Park, Jin-Young Choi, Jeong-Joon Lee, W. Choi
Software streaming is an emerging technology that enables SAV applications to be executed on-demand without download and installation, so that the applications are available virtually everywhere in the network. In developing software streaming systems, the engine and protocols must be carefully designed since the performance and reliability of the streamed software are directly affected by that of streaming engine and network status. In this paper, we present the application of formal verification in the design and implementation of the software streaming systems to take precautions against any potential defects. To achieve this goal, we use the model checker SPIN to model and verify the base architecture and protocol of the system. The effects of the use of formal verification is much more satisfactory than we expected
{"title":"Verifying Software Streaming Systems","authors":"Ki-Hyuk Nam, Junkil Park, Jin-Young Choi, Jeong-Joon Lee, W. Choi","doi":"10.1109/ICACT.2006.205987","DOIUrl":"https://doi.org/10.1109/ICACT.2006.205987","url":null,"abstract":"Software streaming is an emerging technology that enables SAV applications to be executed on-demand without download and installation, so that the applications are available virtually everywhere in the network. In developing software streaming systems, the engine and protocols must be carefully designed since the performance and reliability of the streamed software are directly affected by that of streaming engine and network status. In this paper, we present the application of formal verification in the design and implementation of the software streaming systems to take precautions against any potential defects. To achieve this goal, we use the model checker SPIN to model and verify the base architecture and protocol of the system. The effects of the use of formal verification is much more satisfactory than we expected","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132533192","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 : 2006-05-08DOI: 10.1109/ICACT.2006.205933
Bo-heung Chung, Jae-Deok Lim, Seungho Ryu, Young-ho Kim, Ki-young Kim
This paper proposes the fragment packet partial re-assembly method for intrusion detection. In the proposed method, intrusion detection is performed not with all the fragment packets but with partial fragment packets. If the fragment packet comes, the packet-matching-buffer containing the partial part of the previous fragment packet and this packet is merged into a packet-matching-buffer. After this work, pattern matching for this buffer is done. Finally, for the purpose of the next packet, the partial region of the current packet is stored into the packet-matching-buffer. With the help of these steps, there are two advantages. The one is that it doesn't need to re-assemble all fragment packets for intrusion detection. The other is that the size of buffer can be smaller than all fragment packet re-assembly and can be predictable as a constant size. The proposed method can be used efficiently to prevent malicious code of attackers for avoiding intrusion detection system
{"title":"Fragment packet partial re-assembly method for intrusion detection","authors":"Bo-heung Chung, Jae-Deok Lim, Seungho Ryu, Young-ho Kim, Ki-young Kim","doi":"10.1109/ICACT.2006.205933","DOIUrl":"https://doi.org/10.1109/ICACT.2006.205933","url":null,"abstract":"This paper proposes the fragment packet partial re-assembly method for intrusion detection. In the proposed method, intrusion detection is performed not with all the fragment packets but with partial fragment packets. If the fragment packet comes, the packet-matching-buffer containing the partial part of the previous fragment packet and this packet is merged into a packet-matching-buffer. After this work, pattern matching for this buffer is done. Finally, for the purpose of the next packet, the partial region of the current packet is stored into the packet-matching-buffer. With the help of these steps, there are two advantages. The one is that it doesn't need to re-assemble all fragment packets for intrusion detection. The other is that the size of buffer can be smaller than all fragment packet re-assembly and can be predictable as a constant size. The proposed method can be used efficiently to prevent malicious code of attackers for avoiding intrusion detection system","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132606526","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 : 2006-05-08DOI: 10.1109/ICACT.2006.205976
Md. Abdul Hamid, M. Mamun-Or-Rashid, C. Hong
We consider wireless sensor network (WSN) security and focus our attention to tolerate damage caused by an adversary who has compromised deployed sensor node to modify, block, or inject packets. We adopt a probabilistic secret sharing protocol where secrets shared between two sensor nodes are not exposed to any other nodes. Adapting to WSN characteristics, we incorporate these secrets to establish new pairwise key for node to node authentication and design multi-path routing to multiple base stations to defend against HELLO flood attacks. We then analytically show that our defense mechanisms against HELLO flood attack can tolerate damage caused by an intruder
{"title":"Defense against lap-top class attacker in wireless sensor network","authors":"Md. Abdul Hamid, M. Mamun-Or-Rashid, C. Hong","doi":"10.1109/ICACT.2006.205976","DOIUrl":"https://doi.org/10.1109/ICACT.2006.205976","url":null,"abstract":"We consider wireless sensor network (WSN) security and focus our attention to tolerate damage caused by an adversary who has compromised deployed sensor node to modify, block, or inject packets. We adopt a probabilistic secret sharing protocol where secrets shared between two sensor nodes are not exposed to any other nodes. Adapting to WSN characteristics, we incorporate these secrets to establish new pairwise key for node to node authentication and design multi-path routing to multiple base stations to defend against HELLO flood attacks. We then analytically show that our defense mechanisms against HELLO flood attack can tolerate damage caused by an intruder","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133347699","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206261
Juhee Kim, Eunkyung Kim, K. Kim
In this paper, we propose an efficient structure of base station (BS) scheduler for the wireless broadband (WiBro) system. The BS scheduler consists of an uplink scheduling block, a downlink scheduling block and a channel quality information block. Both uplink and downlink scheduling blocks operate closely with a channel quality information block to schedule downlink packets and allocate uplink/downlink radio resources. Next, we propose a new efficient scheduling algorithm for WiBro systems. The proposed algorithm utilizes the user-based scheduling to relieve the MAP overhead problem and to modify the normal proportional fair (PF) scheduling algorithm to guarantee user-based quality of service (QoS). The simulation study shows that the proposed algorithm relieves the MAP overhead problem by allocating the minimum number of user bursts in a frame and supports better fairness performance, while supporting the system throughput performance similar to that of the normal PF scheduling algorithm
{"title":"A new efficient BS scheduler and scheduling algorithm in WiBro systems","authors":"Juhee Kim, Eunkyung Kim, K. Kim","doi":"10.1109/ICACT.2006.206261","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206261","url":null,"abstract":"In this paper, we propose an efficient structure of base station (BS) scheduler for the wireless broadband (WiBro) system. The BS scheduler consists of an uplink scheduling block, a downlink scheduling block and a channel quality information block. Both uplink and downlink scheduling blocks operate closely with a channel quality information block to schedule downlink packets and allocate uplink/downlink radio resources. Next, we propose a new efficient scheduling algorithm for WiBro systems. The proposed algorithm utilizes the user-based scheduling to relieve the MAP overhead problem and to modify the normal proportional fair (PF) scheduling algorithm to guarantee user-based quality of service (QoS). The simulation study shows that the proposed algorithm relieves the MAP overhead problem by allocating the minimum number of user bursts in a frame and supports better fairness performance, while supporting the system throughput performance similar to that of the normal PF scheduling algorithm","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133439906","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 : 2006-05-08DOI: 10.1109/ICACT.2006.205968
D. Thakker, T. Osman, D. Al-Dabass
Web services are used in distributed computing technology including ubiquitous and pervasive computing and communication networks. Composition models of such Web services are an active research area. Classified as static, dynamic and semi-automatic composition models, these models address different application areas and requirements. . Thus far, the most successful practical approach to Web-services composition, largely endorsed by industry, borrows from business processes' workflow management. Unfortunately, standards subscribing to this approach fall under the static composition category, therefore the service selection and flow management are done a priori and manually. The second approach to Web-services composition aspires to achieve more dynamic composition by semantically describing the process model of Web service and thus making it comprehensible to reasoning engines and software agents. In this paper, we attempt to bridge the gap between the two approaches by introducing semantics to workflow-based composition. We aim to present a composition framework based on a hybrid solution that merges the benefit of practicality of use and adoption popularity of workflow-based composition, with the advantage of using semantic description to aid both service developers and composers in the composition process and facilitate the dynamic integration of Web services into it
{"title":"Web services hybrid dynamic composition models for ubiquitous computing networks","authors":"D. Thakker, T. Osman, D. Al-Dabass","doi":"10.1109/ICACT.2006.205968","DOIUrl":"https://doi.org/10.1109/ICACT.2006.205968","url":null,"abstract":"Web services are used in distributed computing technology including ubiquitous and pervasive computing and communication networks. Composition models of such Web services are an active research area. Classified as static, dynamic and semi-automatic composition models, these models address different application areas and requirements. . Thus far, the most successful practical approach to Web-services composition, largely endorsed by industry, borrows from business processes' workflow management. Unfortunately, standards subscribing to this approach fall under the static composition category, therefore the service selection and flow management are done a priori and manually. The second approach to Web-services composition aspires to achieve more dynamic composition by semantically describing the process model of Web service and thus making it comprehensible to reasoning engines and software agents. In this paper, we attempt to bridge the gap between the two approaches by introducing semantics to workflow-based composition. We aim to present a composition framework based on a hybrid solution that merges the benefit of practicality of use and adoption popularity of workflow-based composition, with the advantage of using semantic description to aid both service developers and composers in the composition process and facilitate the dynamic integration of Web services into it","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132337907","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206437
Wonjae Lee, Y. Bak, Sangmin Woo, Changsoo Kim, Okgi Min, Hak-Young Kim
This paper provides a general overview of the script-based service deployment solution for Unix environments. Our solution requires password-less or pass-phrase-less SSH configuration for basic functionality. The service deployment solution overcomes limitations of Nixes, while maintaining simplicity and ease of use
{"title":"Design and implementation of the script-based service deployment solution","authors":"Wonjae Lee, Y. Bak, Sangmin Woo, Changsoo Kim, Okgi Min, Hak-Young Kim","doi":"10.1109/ICACT.2006.206437","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206437","url":null,"abstract":"This paper provides a general overview of the script-based service deployment solution for Unix environments. Our solution requires password-less or pass-phrase-less SSH configuration for basic functionality. The service deployment solution overcomes limitations of Nixes, while maintaining simplicity and ease of use","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134299153","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206443
P. Nkomo, A. Terzoli, Hippolyte Muyingi, G. S. V. R. K. Rao, Telkom
The paper presents the feasibility of setting up a smart card based platform using free and open source that is card terminal vendor independent. This is important in accelerating smart card usage since lack of vendor independence has been a barrier to smart card adoption. The thesis also proves the feasibility of integrating free and open source technologies in enhancing e-government in the South Africa context. This is important because adopting free and open source software allows African government the opportunity to roll out online government services at lesser costs and be in full control of localization and adaptation
{"title":"Smart card initiative for South African e-governance - a study","authors":"P. Nkomo, A. Terzoli, Hippolyte Muyingi, G. S. V. R. K. Rao, Telkom","doi":"10.1109/ICACT.2006.206443","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206443","url":null,"abstract":"The paper presents the feasibility of setting up a smart card based platform using free and open source that is card terminal vendor independent. This is important in accelerating smart card usage since lack of vendor independence has been a barrier to smart card adoption. The thesis also proves the feasibility of integrating free and open source technologies in enhancing e-government in the South Africa context. This is important because adopting free and open source software allows African government the opportunity to roll out online government services at lesser costs and be in full control of localization and adaptation","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134353276","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 : 2006-05-08DOI: 10.1093/ietcom/e89-b.12.3356
Jaeyoon Lee, D. Yoon, K. Hyun
The I/Q unbalance which is generated by a non-ideal component is an inevitable physical phenomenon and leads to performance degradation when we implement a practical two-dimensional (2-D) modulation system. This paper provides an exact and general expression involving the 2-D Gaussian Q-function for the SER/BER of arbitrary 2-D signaling with I/Q amplitude and phase unbalances over an additive white Gaussian noise (AWGN) channel by using the coordinate rotation and shifting technique. Through Monte Carlo simulations we verify our expression provided here for various 16-quadrature amplitude modulation (QAM) circular constellations
{"title":"General Expression for the Error Probability of Arbitrary Two-Dimensional Signaling with I/Q Amplitude and Phase Unbalances","authors":"Jaeyoon Lee, D. Yoon, K. Hyun","doi":"10.1093/ietcom/e89-b.12.3356","DOIUrl":"https://doi.org/10.1093/ietcom/e89-b.12.3356","url":null,"abstract":"The I/Q unbalance which is generated by a non-ideal component is an inevitable physical phenomenon and leads to performance degradation when we implement a practical two-dimensional (2-D) modulation system. This paper provides an exact and general expression involving the 2-D Gaussian Q-function for the SER/BER of arbitrary 2-D signaling with I/Q amplitude and phase unbalances over an additive white Gaussian noise (AWGN) channel by using the coordinate rotation and shifting technique. Through Monte Carlo simulations we verify our expression provided here for various 16-quadrature amplitude modulation (QAM) circular constellations","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133877559","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 : 2006-05-08DOI: 10.1109/ICACT.2006.205961
Hye-Jin Kim, Keun-Chang Kwak, Jaeyeon Lee
This paper proposes a novel real-time hand tracking algorithm in the presence of occlusion. For this purpose, we construct a limb model and maintain the model obtained from AR-KLT methods with respect to second-order auto-regression model and Kanade-Lucas-Tomasi(KLT) features, respectively. Furthermore, this method do not require to categorize types of superimposed hand motion based on directivity obtained by the slope's direction of KLT regression. Thus, we can develop a method of hand tracking for gesture and activity recognition techniques frequently used in conjunction with human-robot interaction (HRI) components. The experimental results show that the proposed method yields a good performance in the intelligent service robots, so called WEVER developed in ETRI
{"title":"Fast 2D both handstracking with articulate motion prediction","authors":"Hye-Jin Kim, Keun-Chang Kwak, Jaeyeon Lee","doi":"10.1109/ICACT.2006.205961","DOIUrl":"https://doi.org/10.1109/ICACT.2006.205961","url":null,"abstract":"This paper proposes a novel real-time hand tracking algorithm in the presence of occlusion. For this purpose, we construct a limb model and maintain the model obtained from AR-KLT methods with respect to second-order auto-regression model and Kanade-Lucas-Tomasi(KLT) features, respectively. Furthermore, this method do not require to categorize types of superimposed hand motion based on directivity obtained by the slope's direction of KLT regression. Thus, we can develop a method of hand tracking for gesture and activity recognition techniques frequently used in conjunction with human-robot interaction (HRI) components. The experimental results show that the proposed method yields a good performance in the intelligent service robots, so called WEVER developed in ETRI","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115353039","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206071
Lau Bee Theng, Wang Yin Chai
Multimeasure structural similarity for object retrieval is an active research area in spatial databases management software. The similarity is particularly important for development of spatial database system like Geographic Information Systems (GIS) and navigation system. This paper presents research findings from the developed SMSS, single measure structural similarity model for spatial databases management systems. The model is proven to be more effective than existing multimeasure models in several areas that are reduced similarity measures, reduced object associations, and eliminated object approximation
{"title":"Single measure similarity for spatial data management system","authors":"Lau Bee Theng, Wang Yin Chai","doi":"10.1109/ICACT.2006.206071","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206071","url":null,"abstract":"Multimeasure structural similarity for object retrieval is an active research area in spatial databases management software. The similarity is particularly important for development of spatial database system like Geographic Information Systems (GIS) and navigation system. This paper presents research findings from the developed SMSS, single measure structural similarity model for spatial databases management systems. The model is proven to be more effective than existing multimeasure models in several areas that are reduced similarity measures, reduced object associations, and eliminated object approximation","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"277 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114439360","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
扫码关注我们
求助内容：
应助结果提醒方式：