Pub Date : 2013-11-01DOI: 10.1109/ICCES.2013.6707182
A. Khalifa
A hybrid cryptosystem is itself a public-key system, whose public and private keys are the same as in the key encapsulation scheme. In this paper, DNA-steganography and cryptography are used together such that the key distribution process is improved without any sacrifice in security. That is, the session key is hidden inside a chosen DNA sequence and hence can be securely exchanged between parties through public channels such as the internet. The proposed steganographic algorithm; called LSBase, uses the codon degeneracy as an efficient way to hide secret information within DNA sequences without actually affecting the type or structure of the protein they code for. Furthermore, the extraction process can be done blindly without any need to the reference sequence.
{"title":"LSBase: A key encapsulation scheme to improve hybrid crypto-systems using DNA steganography","authors":"A. Khalifa","doi":"10.1109/ICCES.2013.6707182","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707182","url":null,"abstract":"A hybrid cryptosystem is itself a public-key system, whose public and private keys are the same as in the key encapsulation scheme. In this paper, DNA-steganography and cryptography are used together such that the key distribution process is improved without any sacrifice in security. That is, the session key is hidden inside a chosen DNA sequence and hence can be securely exchanged between parties through public channels such as the internet. The proposed steganographic algorithm; called LSBase, uses the codon degeneracy as an efficient way to hide secret information within DNA sequences without actually affecting the type or structure of the protein they code for. Furthermore, the extraction process can be done blindly without any need to the reference sequence.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123542104","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 : 2013-11-01DOI: 10.1109/ICCES.2013.6707207
M. Tayel, Alaa El-Din Sayed Hafez, H. Zied
Security, authentication, and identification are essential requirement for confidential data transmission. The will known methods of data encryption attain certain security levels, they make the encrypted data unreadable and unnatural this attracts some unintended observer attention. To search for a higher security approach, Steganography and Cryptography are two popular ways of sending vital information in a secret way. One hides the existence of the message and the other converts the message into an unreadable format. This paper, describes a method for integrating the advantages of Cryptography and Steganography together through image processing. The paper introduces a New Hybrid Security message Allocation Algorithm (NHSA) to achieve a higher level of security. The statistical evaluation of this system shows that, a higher PSNR and MSE are achieved comparing with the other systems.
{"title":"A new hybrid security allocation steganography algorithm","authors":"M. Tayel, Alaa El-Din Sayed Hafez, H. Zied","doi":"10.1109/ICCES.2013.6707207","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707207","url":null,"abstract":"Security, authentication, and identification are essential requirement for confidential data transmission. The will known methods of data encryption attain certain security levels, they make the encrypted data unreadable and unnatural this attracts some unintended observer attention. To search for a higher security approach, Steganography and Cryptography are two popular ways of sending vital information in a secret way. One hides the existence of the message and the other converts the message into an unreadable format. This paper, describes a method for integrating the advantages of Cryptography and Steganography together through image processing. The paper introduces a New Hybrid Security message Allocation Algorithm (NHSA) to achieve a higher level of security. The statistical evaluation of this system shows that, a higher PSNR and MSE are achieved comparing with the other systems.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122021625","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 : 2013-11-01DOI: 10.1109/ICCES.2013.6707183
Nada El-shennawy, M. Youssef, M. El-Derini, M. Fahmy
Over the past few years, there has been a rapid growth of new services such as online video games, video conferences, and multimedia services to end users. WiMAX is an emerging technology for next generation wireless networks which supports a large number of users. To achieve Quality of Service (QoS) requirements, an efficient and reliable scheduling algorithm is urgently needed. Among a large number of the proposed approaches in the literature, a variably weighted round robin scheduling algorithm (VWRR) has been proven to provide the best performance in an IP backbone network with no attempts on WiMAX networks. This paper proposes a dynamic uplink scheduling algorithm for WiMAX networks based on VWRR to allocate the bandwidth to users to maximize the throughput and ensure the constraints of delay, jitter, and load. A comparative study between the proposed scheduling algorithm and the two most famous scheduling algorithms: weighted round robin algorithm (WRR) and modified deficit round robin algorithm (MDRR) over WiMAX networks, is presented. Simulation results obtained using OPNET reveal that the proposed algorithm has a superior performance compared with WRR with respect to throughput, delay, jitter, and load. Additionally, the proposed scheduling algorithm is shown to provide an excellent level of reliability and scalability when increasing the number of served subscriber stations.
{"title":"A dynamic uplink scheduling scheme for WiMAX networks","authors":"Nada El-shennawy, M. Youssef, M. El-Derini, M. Fahmy","doi":"10.1109/ICCES.2013.6707183","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707183","url":null,"abstract":"Over the past few years, there has been a rapid growth of new services such as online video games, video conferences, and multimedia services to end users. WiMAX is an emerging technology for next generation wireless networks which supports a large number of users. To achieve Quality of Service (QoS) requirements, an efficient and reliable scheduling algorithm is urgently needed. Among a large number of the proposed approaches in the literature, a variably weighted round robin scheduling algorithm (VWRR) has been proven to provide the best performance in an IP backbone network with no attempts on WiMAX networks. This paper proposes a dynamic uplink scheduling algorithm for WiMAX networks based on VWRR to allocate the bandwidth to users to maximize the throughput and ensure the constraints of delay, jitter, and load. A comparative study between the proposed scheduling algorithm and the two most famous scheduling algorithms: weighted round robin algorithm (WRR) and modified deficit round robin algorithm (MDRR) over WiMAX networks, is presented. Simulation results obtained using OPNET reveal that the proposed algorithm has a superior performance compared with WRR with respect to throughput, delay, jitter, and load. Additionally, the proposed scheduling algorithm is shown to provide an excellent level of reliability and scalability when increasing the number of served subscriber stations.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"2006 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117043619","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 : 2013-11-01DOI: 10.1109/ICCES.2013.6707163
M. Gawish, Safia Abbas, M. Mostafa, Abdel-badeeh M. Salem
Creating artificial intelligence (AI) agents with computational models based on human cognitive abilities is an ongoing research area. This paper proposes a new evolutionary cognitive model for cross-domain learning, which aims to improve the cognitive learning process by extracting new experienced knowledge from pre-existing socio-cultural cognitive scripts. This knowledge is necessary for the Al agents to develop learning for the current faced social situation (Target). The model depends basically on two phases; the retrieval phase and the learning phase. In the retrieval phase, Pharaoh algorithm is utilized to retrieve the most relevant cognitive script (Base) to the target script considering the context. Whereas, the learning phase employs evolutional processes to enrich the target script. Finally, the enriched script replaces the target script in the evolved script-base in order to be used in the learning and retrieval phases again.
{"title":"Learning cross-domain social knowledge from cognitive scripts","authors":"M. Gawish, Safia Abbas, M. Mostafa, Abdel-badeeh M. Salem","doi":"10.1109/ICCES.2013.6707163","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707163","url":null,"abstract":"Creating artificial intelligence (AI) agents with computational models based on human cognitive abilities is an ongoing research area. This paper proposes a new evolutionary cognitive model for cross-domain learning, which aims to improve the cognitive learning process by extracting new experienced knowledge from pre-existing socio-cultural cognitive scripts. This knowledge is necessary for the Al agents to develop learning for the current faced social situation (Target). The model depends basically on two phases; the retrieval phase and the learning phase. In the retrieval phase, Pharaoh algorithm is utilized to retrieve the most relevant cognitive script (Base) to the target script considering the context. Whereas, the learning phase employs evolutional processes to enrich the target script. Finally, the enriched script replaces the target script in the evolved script-base in order to be used in the learning and retrieval phases again.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114761547","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 : 2013-11-01DOI: 10.1109/ICCES.2013.6707170
Ibrahim M. Ibrahim, S.H. Nour El-Din, R. Elgohary, H. Faheem, M. Mostafa
This paper proposes robust owner to user framework for secure data sharing in honest but curious cloud environments. The proposed framework presents a robust solution to accomplish the honest but curious cloud environments desired features such as data confidentiality, scalability, fine-grained data access, efficient user revocation, stateless cloud, preventing colluding users from accessing unauthorized data and generic construction. Furthermore, the proposed framework exploits the public key infrastructure (PKI) desired security features to provide an access control mechanism to prevent colluding users to access unauthorized data. Moreover, the proposed framework counters the attack of the rejoining of a revoked user authorized with different attributes to gain access to his previously authorized data. In addition, the proposed framework prohibits the collusion between an authorized user and a revoked user to possess the access privileges once assigned to the revoked user. This is accomplished with the aid of using dual signature technique. Moreover, the proposed framework capitalizes the existence of PKI to maximize the usage of offline operations to enhance the framework performance. Also, the proposed framework makes use of PKI to offer a secure transmission of private data and defends man in the middle attack. The implementation and the complexity analysis of the proposed framework express the framework practicability.
{"title":"A robust owner-to-user data sharing framework in honest but curious cloud environments","authors":"Ibrahim M. Ibrahim, S.H. Nour El-Din, R. Elgohary, H. Faheem, M. Mostafa","doi":"10.1109/ICCES.2013.6707170","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707170","url":null,"abstract":"This paper proposes robust owner to user framework for secure data sharing in honest but curious cloud environments. The proposed framework presents a robust solution to accomplish the honest but curious cloud environments desired features such as data confidentiality, scalability, fine-grained data access, efficient user revocation, stateless cloud, preventing colluding users from accessing unauthorized data and generic construction. Furthermore, the proposed framework exploits the public key infrastructure (PKI) desired security features to provide an access control mechanism to prevent colluding users to access unauthorized data. Moreover, the proposed framework counters the attack of the rejoining of a revoked user authorized with different attributes to gain access to his previously authorized data. In addition, the proposed framework prohibits the collusion between an authorized user and a revoked user to possess the access privileges once assigned to the revoked user. This is accomplished with the aid of using dual signature technique. Moreover, the proposed framework capitalizes the existence of PKI to maximize the usage of offline operations to enhance the framework performance. Also, the proposed framework makes use of PKI to offer a secure transmission of private data and defends man in the middle attack. The implementation and the complexity analysis of the proposed framework express the framework practicability.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126198854","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 : 2013-11-01DOI: 10.1109/ICCES.2013.6707184
Ahmed AL-Otaibi, T. Al-Somani, P. Beckett
In this paper we compare the computational complexity of two parallel scalar multiplication methods used to speed up scalar multiplications for Elliptic Curve Cryptography applications. Pre-computations are advantageous only when the elliptic curve point is fixed. However, during secure communication sessions using either public keys or digital signatures, the elliptic curve point depends on the public key of the communicating entities and is therefore session dependent. Hence, a second method that replaces pre-computations with some post-computations, allows the pre-computation overhead to be distributed amongst parallel processors. Thus scalar multiplication can be computed more efficiently using the post-computation method in the more typical case where the elliptic curve point is variable.
{"title":"Efficient elliptic curve parallel scalar multiplication methods","authors":"Ahmed AL-Otaibi, T. Al-Somani, P. Beckett","doi":"10.1109/ICCES.2013.6707184","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707184","url":null,"abstract":"In this paper we compare the computational complexity of two parallel scalar multiplication methods used to speed up scalar multiplications for Elliptic Curve Cryptography applications. Pre-computations are advantageous only when the elliptic curve point is fixed. However, during secure communication sessions using either public keys or digital signatures, the elliptic curve point depends on the public key of the communicating entities and is therefore session dependent. Hence, a second method that replaces pre-computations with some post-computations, allows the pre-computation overhead to be distributed amongst parallel processors. Thus scalar multiplication can be computed more efficiently using the post-computation method in the more typical case where the elliptic curve point is variable.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122237834","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 : 2013-11-01DOI: 10.1109/ICCES.2013.6707210
Marwa Moustafa, H. M. Ebied, A. Helmy
There is a high demand for high-resolution satellite sensing in modern application. Super Resolution (SR) offers an affordable solution for this high demand. The accuracy of super resolution depends on the accuracy of determining the difference between the low-resolution images. Shift estimation is the first and the most critical step in super resolution. This paper discusses shift estimation techniques in both spatial and frequency domains. It compares Vandewalle algorithm, Lucchese algorithm and Keran algorithm. Two real satellite images (SPOT-5) are used in the experiment. The images have -0.5 and 0.5 sub pixel shift in the horizontal and vertical directions respectively. The experimental results show that the Estimation shift parameters in spatial domain methods outperform the frequency domain methods.
{"title":"Analysis of shift estimation techniques of super resolution applied to satellite images","authors":"Marwa Moustafa, H. M. Ebied, A. Helmy","doi":"10.1109/ICCES.2013.6707210","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707210","url":null,"abstract":"There is a high demand for high-resolution satellite sensing in modern application. Super Resolution (SR) offers an affordable solution for this high demand. The accuracy of super resolution depends on the accuracy of determining the difference between the low-resolution images. Shift estimation is the first and the most critical step in super resolution. This paper discusses shift estimation techniques in both spatial and frequency domains. It compares Vandewalle algorithm, Lucchese algorithm and Keran algorithm. Two real satellite images (SPOT-5) are used in the experiment. The images have -0.5 and 0.5 sub pixel shift in the horizontal and vertical directions respectively. The experimental results show that the Estimation shift parameters in spatial domain methods outperform the frequency domain methods.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131919549","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 : 2013-11-01DOI: 10.1109/ICCES.2013.6707211
Doaa M. A.-Latif, M. A. Salem, H. Ramadan, Mohamed Roushdy
Maps are used extensively to understand the surrounding environment and to navigate through it. This has motivated research in localization and mapping and as a result numerous algorithms have been proposed to construct different types of maps. The mapping problem involves many difficulties such as: the estimation of the sensor position and orientation at each observation, the correct interpretation of data and the error minimization in aligning observations. In this paper a comprehensive overview of the visual SLAM problem is provided along with a comparison of different algorithms used in the construction of 3D maps. The algorithms have been tested on standard 3D datasets of indoor environments.
{"title":"Comparison of 3D feature registration techniques for indoor mapping","authors":"Doaa M. A.-Latif, M. A. Salem, H. Ramadan, Mohamed Roushdy","doi":"10.1109/ICCES.2013.6707211","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707211","url":null,"abstract":"Maps are used extensively to understand the surrounding environment and to navigate through it. This has motivated research in localization and mapping and as a result numerous algorithms have been proposed to construct different types of maps. The mapping problem involves many difficulties such as: the estimation of the sensor position and orientation at each observation, the correct interpretation of data and the error minimization in aligning observations. In this paper a comprehensive overview of the visual SLAM problem is provided along with a comparison of different algorithms used in the construction of 3D maps. The algorithms have been tested on standard 3D datasets of indoor environments.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115349260","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 : 2013-11-01DOI: 10.1109/ICCES.2013.6707195
Hamdy M. Mousa, A. El-Sisi
University course timetabling is one of the most important and time-consuming problem which takes place frequently in all the educational institutes. This paper proposes design and implementation system to generate timetable based on genetic algorithm using different combinations selection algorithm and mutation types. Two cases small problem and big problem are studied. The results show that two cases tournament selection is giving solutions better than roulette wheel Selection. The worst pair is roulette wheel selection and mutation. Mutation error method helps to reach to the best solution faster. In case of conflicts and no solution, our system generates a report, containing conflict constraints that must be remove or modified.
{"title":"Design and implementation of course timetabling system based on genetic algorithm","authors":"Hamdy M. Mousa, A. El-Sisi","doi":"10.1109/ICCES.2013.6707195","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707195","url":null,"abstract":"University course timetabling is one of the most important and time-consuming problem which takes place frequently in all the educational institutes. This paper proposes design and implementation system to generate timetable based on genetic algorithm using different combinations selection algorithm and mutation types. Two cases small problem and big problem are studied. The results show that two cases tournament selection is giving solutions better than roulette wheel Selection. The worst pair is roulette wheel selection and mutation. Mutation error method helps to reach to the best solution faster. In case of conflicts and no solution, our system generates a report, containing conflict constraints that must be remove or modified.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114867719","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 : 2013-11-01DOI: 10.1109/ICCES.2013.6707181
Mona M. Soliman, A. Hassanien, H. Onsi
The objective of this paper is to explore innovative ways to insert the maximum amount of secret information into 3D mesh models without causing perceptual distortion and also make it difficult for the attacker to guess where the watermark was inserted. It is based on clustering 3D vertices into appropriate or inappropriate candidates for watermark insertion using Self Organization Map (SOM). Two methods were used to embed the watermark into 3D model. The first method is a statistical approach that modified the distribution of vertex norms to hide watermark information into host 3D model while the second method is a mixed insertion of watermark bits into host model using vertex norm distribution and mesh vertices at the same time. The robustness of proposed techniques is evaluated experimentally by simulating attacks such as mesh smoothing, noise addition and mesh cropping.
{"title":"Robust watermarking approach for 3D triangular mesh using self organization map","authors":"Mona M. Soliman, A. Hassanien, H. Onsi","doi":"10.1109/ICCES.2013.6707181","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707181","url":null,"abstract":"The objective of this paper is to explore innovative ways to insert the maximum amount of secret information into 3D mesh models without causing perceptual distortion and also make it difficult for the attacker to guess where the watermark was inserted. It is based on clustering 3D vertices into appropriate or inappropriate candidates for watermark insertion using Self Organization Map (SOM). Two methods were used to embed the watermark into 3D model. The first method is a statistical approach that modified the distribution of vertex norms to hide watermark information into host 3D model while the second method is a mixed insertion of watermark bits into host model using vertex norm distribution and mesh vertices at the same time. The robustness of proposed techniques is evaluated experimentally by simulating attacks such as mesh smoothing, noise addition and mesh cropping.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130825797","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
扫码关注我们
求助内容：
应助结果提醒方式：