Issa M. Khalil, Abdallah Khreishah, S. Bouktif, Azeem Ahmad
The rate of threats against IT systems is directly proportional to the rate of growing technology. The emergence of new technology requires researchers and practitioner's attention to discover new threats in order to make it reliable. Cloud computing is an emerging technology paradigm that migrates current technological and computing concepts into utility-like solutions similar to electricity and water systems. Security issues in cloud computing is shown to be the biggest obstacle that could subvert the wide benefits of cloud computing. The new concepts that the cloud introduces, such as multi-tenancy, creates new challenges to the security community. Addressing these challenges requires, in addition to the ability to cultivate and tune the security measures developed for other systems, proposing new security policies, models, and protocols to address the unique cloud security challenges. In this work, we provide comprehensive study of cloud computing security that includes classification of known security threats and the state-of-the-art practices in the endeavor to calibrate these threats. This paper also provides the dependency level within classification and provides a solution in form of preventive actions rather than proactive actions.
{"title":"Security Concerns in Cloud Computing","authors":"Issa M. Khalil, Abdallah Khreishah, S. Bouktif, Azeem Ahmad","doi":"10.1109/ITNG.2013.127","DOIUrl":"https://doi.org/10.1109/ITNG.2013.127","url":null,"abstract":"The rate of threats against IT systems is directly proportional to the rate of growing technology. The emergence of new technology requires researchers and practitioner's attention to discover new threats in order to make it reliable. Cloud computing is an emerging technology paradigm that migrates current technological and computing concepts into utility-like solutions similar to electricity and water systems. Security issues in cloud computing is shown to be the biggest obstacle that could subvert the wide benefits of cloud computing. The new concepts that the cloud introduces, such as multi-tenancy, creates new challenges to the security community. Addressing these challenges requires, in addition to the ability to cultivate and tune the security measures developed for other systems, proposing new security policies, models, and protocols to address the unique cloud security challenges. In this work, we provide comprehensive study of cloud computing security that includes classification of known security threats and the state-of-the-art practices in the endeavor to calibrate these threats. This paper also provides the dependency level within classification and provides a solution in form of preventive actions rather than proactive actions.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114942572","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}
Sawn softwood timber is used as a structural component in house walls and roofs. Consequently, the consumption trends generally follow those of the housing industry. Therefore, Government imposes tough quality control and quality assurance on the timber industry to grantee product standard meets the specifications in building industry. Capability Analysis on the timber product plays an important role in assessing the capability of the timber in meeting the market functionality requirements. Two characteristics continuously monitored are the Modulus of Elasticity MOE and the Modulus of Rupture MOR. In this paper, we analyse the data collected from three different mills located in three different states based on both, the government recommended Specification Limits and the Natural Statistical Specification Limits. The analyses show that the government tough recommended Specification Limits results in many timbers to be downgraded.
{"title":"Capability Analysis for Modulus of Elasticity and Modulus of Rupture","authors":"M. Abdollahian","doi":"10.1109/ITNG.2013.73","DOIUrl":"https://doi.org/10.1109/ITNG.2013.73","url":null,"abstract":"Sawn softwood timber is used as a structural component in house walls and roofs. Consequently, the consumption trends generally follow those of the housing industry. Therefore, Government imposes tough quality control and quality assurance on the timber industry to grantee product standard meets the specifications in building industry. Capability Analysis on the timber product plays an important role in assessing the capability of the timber in meeting the market functionality requirements. Two characteristics continuously monitored are the Modulus of Elasticity MOE and the Modulus of Rupture MOR. In this paper, we analyse the data collected from three different mills located in three different states based on both, the government recommended Specification Limits and the Natural Statistical Specification Limits. The analyses show that the government tough recommended Specification Limits results in many timbers to be downgraded.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124302138","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}
Bluetooth provides short range low power wireless communication popularly between laptops, cellular phones and media devices. The original security measurement for Bluetooth looks somewhat inadequate today to meet many important security requirements. In this paper a public key technology based key distribution for Bluetooth is proposed. Taking advantage of `RSA for paranoids', the proposed method makes it possible for low-power and low computational capability embedded microprocessor to compute public-key technology based key distribution in reasonably short time. It is showed that the proposed method clearly has speed advantage when compared to the recent work on Bluetooth key exchange using Diffie-Hellman technology. The security of the proposed scheme against various attacks, including Gilbert's side-channel attack, is also addressed.
{"title":"Public-Key Based Efficient Key Distribution in Bluetooth","authors":"S. Rahman, Yiruo He, Huapeng Wu","doi":"10.1109/ITNG.2013.109","DOIUrl":"https://doi.org/10.1109/ITNG.2013.109","url":null,"abstract":"Bluetooth provides short range low power wireless communication popularly between laptops, cellular phones and media devices. The original security measurement for Bluetooth looks somewhat inadequate today to meet many important security requirements. In this paper a public key technology based key distribution for Bluetooth is proposed. Taking advantage of `RSA for paranoids', the proposed method makes it possible for low-power and low computational capability embedded microprocessor to compute public-key technology based key distribution in reasonably short time. It is showed that the proposed method clearly has speed advantage when compared to the recent work on Bluetooth key exchange using Diffie-Hellman technology. The security of the proposed scheme against various attacks, including Gilbert's side-channel attack, is also addressed.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116376290","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 research investigates how to discover associated services based on the concept of service cooperation. The goal is to provide clues of marketing campaign among services to companies. This study is used to solve the problem by taking into account associated services simultaneously in the example of Las Vegas. The results show the feasibility of service cooperation from different domain in Las Vegas. In addition, our approach also help travel agency or backpacker organize the trip and service companies to work together to gain more profits.
{"title":"A Two-Step Approach for Mining Service Cooperation","authors":"Ling-Yao Huang, Wei-Lun Chang","doi":"10.1109/ITNG.2013.116","DOIUrl":"https://doi.org/10.1109/ITNG.2013.116","url":null,"abstract":"This research investigates how to discover associated services based on the concept of service cooperation. The goal is to provide clues of marketing campaign among services to companies. This study is used to solve the problem by taking into account associated services simultaneously in the example of Las Vegas. The results show the feasibility of service cooperation from different domain in Las Vegas. In addition, our approach also help travel agency or backpacker organize the trip and service companies to work together to gain more profits.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121007712","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}
Human gait walking skeleton model is proposed together with its implementation for gender classifications. The proposed model is based on morphological operations and is similar to the conventional skeleton model which allows calculations of joint angles of human body. Also gender classification method based on the proposed human gait walking skeleton model is proposed. Through experiments with the Class B dataset of Chinese Academy of Sciences (CASIA) silhouettes, it is confirmed that the proposed gender classification method utilizing human gait walking skeleton model allows discrimination between left and right legs even if a single camera acquired image is used. It is also confirmed that the proposed method allows estimation of joint angles accurately together with gender classification with high percent correct classification of 85.33% (it is 11.8% better classification accuracy comparing to the existing method).
{"title":"Gender Classification with Human Gait Based on Skeleton Model","authors":"K. Arai, Rosa Andrie","doi":"10.1109/ITNG.2013.134","DOIUrl":"https://doi.org/10.1109/ITNG.2013.134","url":null,"abstract":"Human gait walking skeleton model is proposed together with its implementation for gender classifications. The proposed model is based on morphological operations and is similar to the conventional skeleton model which allows calculations of joint angles of human body. Also gender classification method based on the proposed human gait walking skeleton model is proposed. Through experiments with the Class B dataset of Chinese Academy of Sciences (CASIA) silhouettes, it is confirmed that the proposed gender classification method utilizing human gait walking skeleton model allows discrimination between left and right legs even if a single camera acquired image is used. It is also confirmed that the proposed method allows estimation of joint angles accurately together with gender classification with high percent correct classification of 85.33% (it is 11.8% better classification accuracy comparing to the existing method).","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121064000","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, we present our continuous work on designing an algorithm to find nearest neighbors to given queries. In our previous work, we analyze the situation that there are multiple queries with different level of importance, and define a weight for each query point. We also propose an algorithm to find nearest neighbors to multiple queries with weights and enhanced our algorithm based on query point distribution. In this paper we analyze the data distribution on various dimensions, and apply the shrinking concept for the improvement and enhancement of our multi-query search approach.
{"title":"Similarity Search Problem Research on Multi-dimensional Data Sets","authors":"Yong Shi, Brian Graham","doi":"10.1109/ITNG.2013.72","DOIUrl":"https://doi.org/10.1109/ITNG.2013.72","url":null,"abstract":"In this paper, we present our continuous work on designing an algorithm to find nearest neighbors to given queries. In our previous work, we analyze the situation that there are multiple queries with different level of importance, and define a weight for each query point. We also propose an algorithm to find nearest neighbors to multiple queries with weights and enhanced our algorithm based on query point distribution. In this paper we analyze the data distribution on various dimensions, and apply the shrinking concept for the improvement and enhancement of our multi-query search approach.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128506329","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}
Software testing is one of the most important phases in development of software. Software testing detects faults in software and ensures quality. Software testing can be performed at unit, integration, or system level. Integration testing tests the interactions of different components, when they are integrated together in specific application, for the smooth functionality of software system. Coupling based testing is an integration testing approach that is based upon coupling relationships that exist among different variables across different call sites in functions. Different types of coupling exist between variables across different call sites. Up until now, test data generation approaches deal only unit level testing. There is no work for test data generation for coupling based integration testing. In this paper, we have proposed a novel approach for automated test data generation for coupling based integration testing of object oriented programs using genetic algorithm. Our approach takes the coupling path as input, containing different sub paths, and generates the test data using genetic algorithm. We have implemented a prototype tool E-Coup in Java and successfully performed different experiments for the generation of test data. In experiments with this tool, our approach has much better results as compared to random testing.
{"title":"Automated Test Data Generation for Coupling Based Integration Testing of Object Oriented Programs Using Evolutionary Approaches","authors":"Shaukat Ali, A. Nadeem","doi":"10.1109/ITNG.2013.59","DOIUrl":"https://doi.org/10.1109/ITNG.2013.59","url":null,"abstract":"Software testing is one of the most important phases in development of software. Software testing detects faults in software and ensures quality. Software testing can be performed at unit, integration, or system level. Integration testing tests the interactions of different components, when they are integrated together in specific application, for the smooth functionality of software system. Coupling based testing is an integration testing approach that is based upon coupling relationships that exist among different variables across different call sites in functions. Different types of coupling exist between variables across different call sites. Up until now, test data generation approaches deal only unit level testing. There is no work for test data generation for coupling based integration testing. In this paper, we have proposed a novel approach for automated test data generation for coupling based integration testing of object oriented programs using genetic algorithm. Our approach takes the coupling path as input, containing different sub paths, and generates the test data using genetic algorithm. We have implemented a prototype tool E-Coup in Java and successfully performed different experiments for the generation of test data. In experiments with this tool, our approach has much better results as compared to random testing.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126340209","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}
Muge Fesci-Sayit, Yagiz Kaymak, Kemal Deniz Teket, C. Çetinkaya, Sercan Demirci, G. Kardas
There are several successful deployments of peer to peer (P2P) video streaming systems which provide acceptable QoS. Researches on these systems continue to improve the experienced quality by system users. Since received video quality mostly depends on the parent selection, an efficient parent selection algorithm can increase the received video bitrate by peers and provide seamless streaming. In this paper, we propose a novel parent selection method based on reinforcement learning. By the proposed system model, the newly joined peer explores the peers in the system first, and uses this information for its further parent selection actions. We implemented our model on a Cool Streaming-like P2P video streaming system in ns3. Our results indicate that, selected parents by using reinforcement learning approach improve the playback continuity, with respect to parent selection method used by Cool Streaming. Furthermore, reinforcement learning approach helps peers to find more stable parents in case of peer churn.
{"title":"Parent Selection via Reinforcement Learning in Mesh-Based P2P Video Streaming","authors":"Muge Fesci-Sayit, Yagiz Kaymak, Kemal Deniz Teket, C. Çetinkaya, Sercan Demirci, G. Kardas","doi":"10.1109/ITNG.2013.89","DOIUrl":"https://doi.org/10.1109/ITNG.2013.89","url":null,"abstract":"There are several successful deployments of peer to peer (P2P) video streaming systems which provide acceptable QoS. Researches on these systems continue to improve the experienced quality by system users. Since received video quality mostly depends on the parent selection, an efficient parent selection algorithm can increase the received video bitrate by peers and provide seamless streaming. In this paper, we propose a novel parent selection method based on reinforcement learning. By the proposed system model, the newly joined peer explores the peers in the system first, and uses this information for its further parent selection actions. We implemented our model on a Cool Streaming-like P2P video streaming system in ns3. Our results indicate that, selected parents by using reinforcement learning approach improve the playback continuity, with respect to parent selection method used by Cool Streaming. Furthermore, reinforcement learning approach helps peers to find more stable parents in case of peer churn.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116863519","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 a priori L2 error analysis of the finite element method (FEM), the Aubin-Nitsche trick is often used. Usually, the convergence order of the L2 error estimates by the Aubin-Nitsche trick is one order higher than the H01 error estimates. As is well known, the convergence order obtained by this technique depends on the shape of the domain because it is dependent on the regularity of solutions for the associated dual problem on the same domain. In this paper, we introduce a technique for getting the optimal order L2 error estimates on the L-shaped domain without Aubin-Nitsche trick. From the numerical evidence based on the guaranteed computations, we could still expect that such a domain dependency is not essential.
{"title":"Some Remarks on the Optimal Error Estimates for the Finite Element Method on the L-Shaped Domain","authors":"T. Kinoshita, M. Nakao","doi":"10.1109/ITNG.2013.30","DOIUrl":"https://doi.org/10.1109/ITNG.2013.30","url":null,"abstract":"In the a priori L2 error analysis of the finite element method (FEM), the Aubin-Nitsche trick is often used. Usually, the convergence order of the L2 error estimates by the Aubin-Nitsche trick is one order higher than the H01 error estimates. As is well known, the convergence order obtained by this technique depends on the shape of the domain because it is dependent on the regularity of solutions for the associated dual problem on the same domain. In this paper, we introduce a technique for getting the optimal order L2 error estimates on the L-shaped domain without Aubin-Nitsche trick. From the numerical evidence based on the guaranteed computations, we could still expect that such a domain dependency is not essential.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130649059","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}
A. Jacinto, Tatiana Martins Almeri, Etiene Lamas, L. Dias, A. Cunha
In recent years, interdisciplinarity has represented one of the most widely used and encouraged teaching practices among educators. This practice has generated a promising expectation of success when applied to undergraduate programs. However, its implementation requires dedication and effort from both students and professors. Through a case study, this paper promotes an analysis about this issue and describes some social games as final product from an interdisciplinary case study, named Project Differences.
{"title":"Computer Science and Interdisciplinarity: A Case Study on an Undergraduate Program","authors":"A. Jacinto, Tatiana Martins Almeri, Etiene Lamas, L. Dias, A. Cunha","doi":"10.1109/ITNG.2013.46","DOIUrl":"https://doi.org/10.1109/ITNG.2013.46","url":null,"abstract":"In recent years, interdisciplinarity has represented one of the most widely used and encouraged teaching practices among educators. This practice has generated a promising expectation of success when applied to undergraduate programs. However, its implementation requires dedication and effort from both students and professors. Through a case study, this paper promotes an analysis about this issue and describes some social games as final product from an interdisciplinary case study, named Project Differences.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122270788","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
扫码关注我们
求助内容：
应助结果提醒方式：