Parity prediction schemes have been widely studied in the past. Recently, it has been demonstrated that this prediction scheme can achieve fault-secureness in arithmetic circuits for stuck-at and stuck-open faults. For most cryptographic applications, encryption/decryption algorithms rely on computations in very large finite fields. The hardware implementation may require millions of logic gates and this may lead to the generation of erroneous outputs by the multiplier. In this paper, a concurrent error detection (CED) technique is used in the digit-serial basis multiplier over finite fields of characteristic two. It is shown that all types of normal basis multipliers possess the same parity prediction function.
{"title":"Concurrent Error Detection in Digit-Serial Normal Basis Multiplication over GF(2m)","authors":"Chiou-Yng Lee","doi":"10.1109/WAINA.2008.40","DOIUrl":"https://doi.org/10.1109/WAINA.2008.40","url":null,"abstract":"Parity prediction schemes have been widely studied in the past. Recently, it has been demonstrated that this prediction scheme can achieve fault-secureness in arithmetic circuits for stuck-at and stuck-open faults. For most cryptographic applications, encryption/decryption algorithms rely on computations in very large finite fields. The hardware implementation may require millions of logic gates and this may lead to the generation of erroneous outputs by the multiplier. In this paper, a concurrent error detection (CED) technique is used in the digit-serial basis multiplier over finite fields of characteristic two. It is shown that all types of normal basis multipliers possess the same parity prediction function.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125291522","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}
Storage consolidation as a perspective paradigm inevitably leads to the extensive installations of shared storage servers in product environments. However, owing to the dynamics of both workloads and storage systems, it is pragmatic only if each workload accessing common storage servers can surely possess a specified minimum share of system resources even when competing with other workloads and consequently obtain predictable quality of service (QoS). This paper presents an I/O scheduling framework for shared storage servers. The eMuse algorithm in the framework employs a dynamic assignment mechanism that not only accommodates a weighted bandwidth share for every active workload, but also fulfills their latency requirements through a fair queuing policy. Experimental results demonstrate that our scheduling framework can accomplish performance isolation among multiple competing workloads as well as the effective utilization of system resources.
{"title":"eMuse: QoS Guarantees for Shared Storage Servers","authors":"D. Feng, Chengtao Lu, F. Wang","doi":"10.1109/WAINA.2008.172","DOIUrl":"https://doi.org/10.1109/WAINA.2008.172","url":null,"abstract":"Storage consolidation as a perspective paradigm inevitably leads to the extensive installations of shared storage servers in product environments. However, owing to the dynamics of both workloads and storage systems, it is pragmatic only if each workload accessing common storage servers can surely possess a specified minimum share of system resources even when competing with other workloads and consequently obtain predictable quality of service (QoS). This paper presents an I/O scheduling framework for shared storage servers. The eMuse algorithm in the framework employs a dynamic assignment mechanism that not only accommodates a weighted bandwidth share for every active workload, but also fulfills their latency requirements through a fair queuing policy. Experimental results demonstrate that our scheduling framework can accomplish performance isolation among multiple competing workloads as well as the effective utilization of system resources.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127711288","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 nowadays manufacturing plants there is a certain degree in which the RFID technology has been adopted. This degree may vary from marking the components of a final product (for example a car) using RFID tags in order to verify if they are all in place at the end of the production line, to the production flow monitoring and finally to the supply chain management. The presented system contains advanced high complexity RFID-based control gates and smart connections to an OPC server that acts as central dispatcher. The system is able to satisfy a large number of customer requirements for process monitoring and control.
{"title":"High Complexity Control Gates with Advanced RFID Features for Production Process Monitoring","authors":"V. Gaitan, C. Turcu, A. Goloca","doi":"10.1109/WAINA.2008.232","DOIUrl":"https://doi.org/10.1109/WAINA.2008.232","url":null,"abstract":"In nowadays manufacturing plants there is a certain degree in which the RFID technology has been adopted. This degree may vary from marking the components of a final product (for example a car) using RFID tags in order to verify if they are all in place at the end of the production line, to the production flow monitoring and finally to the supply chain management. The presented system contains advanced high complexity RFID-based control gates and smart connections to an OPC server that acts as central dispatcher. The system is able to satisfy a large number of customer requirements for process monitoring and control.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127765856","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}
The recent video standards like MPEG-4 are generally vulnerable to the packet loss because they achieve high compression ratios by complex calculation of preceding and succeeding frames. But, in the wireless channel, errors tend to occur in burst due to the intrinsic wireless link characteristics. Therefore, an efficient error control mechanism for multimedia streaming is necessary. In this paper, we propose a novel CC-FEC (Cross-correlated Forwarding Error Correction) scheme robust against burst error and suitable for multimedia streaming over the WLAN. The proposed scheme takes advantage of the interleaving and the multi-dimensional FEC schemes. We verify our scheme's superior performance than other FEC schemes through simulation.
{"title":"Cross-Correlated FEC Scheme for Multimedia Streaming over Wireless LAN","authors":"Eunyong Park, Sunyoung Han, Heemin Kim, K. Son","doi":"10.1109/WAINA.2008.183","DOIUrl":"https://doi.org/10.1109/WAINA.2008.183","url":null,"abstract":"The recent video standards like MPEG-4 are generally vulnerable to the packet loss because they achieve high compression ratios by complex calculation of preceding and succeeding frames. But, in the wireless channel, errors tend to occur in burst due to the intrinsic wireless link characteristics. Therefore, an efficient error control mechanism for multimedia streaming is necessary. In this paper, we propose a novel CC-FEC (Cross-correlated Forwarding Error Correction) scheme robust against burst error and suitable for multimedia streaming over the WLAN. The proposed scheme takes advantage of the interleaving and the multi-dimensional FEC schemes. We verify our scheme's superior performance than other FEC schemes through simulation.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127386202","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}
The optimal period interleaver can break the divisibility of the input sequence with N0 as the period of the feedback polynomial. But how to find the optimal period interleaver is still in consideration. Based on the divisibility of polynomial, we give a method to find the optimal period interleaver. The simulation results prove this method a good BER performance in the decoding process of short frame Turbo codes.
{"title":"The Design of Optimal Period Interleaver","authors":"Y. Wang, Xinjun Du, Hui Li, Yumin Wang","doi":"10.1109/WAINA.2008.276","DOIUrl":"https://doi.org/10.1109/WAINA.2008.276","url":null,"abstract":"The optimal period interleaver can break the divisibility of the input sequence with N0 as the period of the feedback polynomial. But how to find the optimal period interleaver is still in consideration. Based on the divisibility of polynomial, we give a method to find the optimal period interleaver. The simulation results prove this method a good BER performance in the decoding process of short frame Turbo codes.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132680975","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 this paper, an approach for modelling and analysis of massively multiplayer online games (MMOGs) is proposed. By using our models, based on Markov process and queuing theory, we can investigate the impact of various factors, such as game types, the number of players, the intensity of players or NCPs interaction, the number of regions in a game world, avatar region-transition rate, and network configuration, on the system performance. A number of resource-cost functions are defined, which map the system resource consumed to the cost during a game play. We choose the federated peer-to-peer architecture as a target for this study, since it is a typical and potential architecture proposed recently and attracting more attention.
{"title":"Resource-Cost Analysis for Massively Multiplayer Online Games","authors":"Z. Wu","doi":"10.1109/WAINA.2008.275","DOIUrl":"https://doi.org/10.1109/WAINA.2008.275","url":null,"abstract":"In this paper, an approach for modelling and analysis of massively multiplayer online games (MMOGs) is proposed. By using our models, based on Markov process and queuing theory, we can investigate the impact of various factors, such as game types, the number of players, the intensity of players or NCPs interaction, the number of regions in a game world, avatar region-transition rate, and network configuration, on the system performance. A number of resource-cost functions are defined, which map the system resource consumed to the cost during a game play. We choose the federated peer-to-peer architecture as a target for this study, since it is a typical and potential architecture proposed recently and attracting more attention.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116577706","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}
We propose a system which extracts faces and person names from news articles with photos on the Web and associates them automatically. The system detects face images in news photos with a face detector and extracts person names from news text with a morphological analyzer. In addition, the bag-of-keypoints technique is applied to the extracted face images for filtering out non-face images. The system uses the eigenface representation as image features of the extracted faces, and associates them with the extracted names by the modified k-means clustering in the eigenface subspace. In the experiment, we obtained the 66% precision rate regarding association of faces and names.
{"title":"Associating Faces and Names in Japanese Photo News Articles on the Web","authors":"Akio Kitahara, Taichi Joutou, Keiji Yanai","doi":"10.1109/WAINA.2008.97","DOIUrl":"https://doi.org/10.1109/WAINA.2008.97","url":null,"abstract":"We propose a system which extracts faces and person names from news articles with photos on the Web and associates them automatically. The system detects face images in news photos with a face detector and extracts person names from news text with a morphological analyzer. In addition, the bag-of-keypoints technique is applied to the extracted face images for filtering out non-face images. The system uses the eigenface representation as image features of the extracted faces, and associates them with the extracted names by the modified k-means clustering in the eigenface subspace. In the experiment, we obtained the 66% precision rate regarding association of faces and names.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132753301","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}
Mobility has emerged as an important new trend in the arena of distributed computing bringing along with it deep social and technical transformations. These changes clearly create an increasing demand for applications and middleware that exploit and support mobility. This paper surveys the main classes of paradigms and middlewares for distributed (mobile) systems and proposes a new paradigm inspired in the concept of magnetic fields from physics. The model is then formally defined and implementation issues concerning extensions to be applied to current middlewares in order to support the paradigm are detailed. Finally, conclusions are drawn and the main future works are listed.
{"title":"A Paradigm Shift in the Design of Mobile Applications","authors":"L. Lima, A. Calsavara","doi":"10.1109/WAINA.2008.295","DOIUrl":"https://doi.org/10.1109/WAINA.2008.295","url":null,"abstract":"Mobility has emerged as an important new trend in the arena of distributed computing bringing along with it deep social and technical transformations. These changes clearly create an increasing demand for applications and middleware that exploit and support mobility. This paper surveys the main classes of paradigms and middlewares for distributed (mobile) systems and proposes a new paradigm inspired in the concept of magnetic fields from physics. The model is then formally defined and implementation issues concerning extensions to be applied to current middlewares in order to support the paradigm are detailed. Finally, conclusions are drawn and the main future works are listed.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"57 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132900594","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}
Injection attack is a technique to bypass or modify the originally intended functionality of the program. Many application's security vulnerabilities result from generic injection problems. Examples of such vulnerabilities are SQL injection, shell injection and script injection (cross site scripting). Proper input validation is an effective countermeasure to act as a defense against input attacks. However, it is challenging because there is no specific answer for what implies valid input across applications. As individual fields often require specific validation, input validation adopting only one filter rule may induce false negative or false positive. We develop a defense system consisting of an event driven security testing framework and an adjustable validation function on a security gateway. The security gateway is allocated in front of application server to eliminate malicious injection vulnerabilities. To verify the efficiency of the adjustable mechanism, we focus on whether the validation functions included in meta-programs have proper filter rules to sanitize input data. Among our experiments, different fields may have various validation rules made up of some sub-rules. By means of these rules, we reduce false rate and increase detection rate. That is to say, we prove that the diversified validation rules produced by our automatic mechanism are more efficient and elastic than only one rule.
{"title":"An Automatic Mechanism for Adjusting Validation Function","authors":"Jin-Cherng Lin, Jan-Min Chen, Cheng-Hsiung Liu","doi":"10.1109/WAINA.2008.89","DOIUrl":"https://doi.org/10.1109/WAINA.2008.89","url":null,"abstract":"Injection attack is a technique to bypass or modify the originally intended functionality of the program. Many application's security vulnerabilities result from generic injection problems. Examples of such vulnerabilities are SQL injection, shell injection and script injection (cross site scripting). Proper input validation is an effective countermeasure to act as a defense against input attacks. However, it is challenging because there is no specific answer for what implies valid input across applications. As individual fields often require specific validation, input validation adopting only one filter rule may induce false negative or false positive. We develop a defense system consisting of an event driven security testing framework and an adjustable validation function on a security gateway. The security gateway is allocated in front of application server to eliminate malicious injection vulnerabilities. To verify the efficiency of the adjustable mechanism, we focus on whether the validation functions included in meta-programs have proper filter rules to sanitize input data. Among our experiments, different fields may have various validation rules made up of some sub-rules. By means of these rules, we reduce false rate and increase detection rate. That is to say, we prove that the diversified validation rules produced by our automatic mechanism are more efficient and elastic than only one rule.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128188447","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}
The computational grid offers services for efficiently scheduling jobs on the grid, but for grid- enabled applications where data handling is a most relevant part in performance, the data grid kicks in. It typically builds on the concept of files, sites and file transfers between sites using services such as GRID-ftp, plus a replica manager to keep track of where replicas are located. Usually, careful original data layout is not considered because the data can be moved based on some replica optimization models to computing sites. We consider cooperative shared computations for huge data that is distributed over a variable number of sites. In this context, data layout is a relevant problem because moving very large amounts of data is too expensive. Consequently, it is a balance between data layout and load-balancing capabilities on top of the basic infrastructure that is the most crucial issue. In this paper we propose a mixed replication layout and load-balancing approach to yield very good performance results in such environments.
{"title":"Efficient Shared Computations over Distributed Sites","authors":"P. Furtado","doi":"10.1109/WAINA.2008.171","DOIUrl":"https://doi.org/10.1109/WAINA.2008.171","url":null,"abstract":"The computational grid offers services for efficiently scheduling jobs on the grid, but for grid- enabled applications where data handling is a most relevant part in performance, the data grid kicks in. It typically builds on the concept of files, sites and file transfers between sites using services such as GRID-ftp, plus a replica manager to keep track of where replicas are located. Usually, careful original data layout is not considered because the data can be moved based on some replica optimization models to computing sites. We consider cooperative shared computations for huge data that is distributed over a variable number of sites. In this context, data layout is a relevant problem because moving very large amounts of data is too expensive. Consequently, it is a balance between data layout and load-balancing capabilities on top of the basic infrastructure that is the most crucial issue. In this paper we propose a mixed replication layout and load-balancing approach to yield very good performance results in such environments.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132226393","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
扫码关注我们
求助内容：
应助结果提醒方式：