Sherif Amin | University of Jazan (original) (raw)
Papers by Sherif Amin
Due to the extensive migration of business and scientific applications as well as the enormous gr... more Due to the extensive migration of business and scientific applications as well as the enormous growth in online data produced by IoT devices, numerous problems have arisen in cloud scheduling. Efficient delivery of resources considering user-defined Service Level Agreement (SLA) and Quality of Service (QoS) can only achieve with efficient and state-of-the-art scheduling methods. In this regard, virtual machine (VM) scheduling has been a highly required method for resource scheduling in the ever-changing cloud and multi-access computing environment (MAC). Based on an examination of recent literature, this investigation intends to provide a comprehensive Systematic Literature Review (SLR) of the methods employed for virtual machine scheduling in cloud computing. Besides, the SLR disseminates the challenges and opportunities in VM design and discusses future researchers' baselines. The SLR investigated the VM scheduling techniques and searched the most relevant research databases o...
Expert Systems with Applications
41 www.erpublication.org Abstract— Most of recent advanced sugar crystallization controlling pr... more 41 www.erpublication.org Abstract— Most of recent advanced sugar crystallization controlling programs aims to get the highest sugar yield and quality with minimum cost. This work is the second part of advanced sugar crystallization control program project which based on mathematical model, and focusing in the sugar crystallization in low temperatures with advantages of achievement the highest productivity and quality with cost reduction. The theory based on theoretical comparison between parameters and quantities obtained from crystallization of a certain sugar grade at same conditions of end crystal content and supersaturation and two different operating temperatures by using data of the advanced crystallization control program. The theory was implemented for R1 and R4 sugar crystallization in united sugar company of Egypt USCE and obtained results simulated with that in practice and listed for analysis and discussions.
The fundamental idea behind this encryption technique is the exploitation of DNA cryptographic st... more The fundamental idea behind this encryption technique is the exploitation of DNA cryptographic strength, such as its storing capabilities and parallelism in order to enforce other conventional cryptographic algorithms. In this study, a binary form of data, such as plaintext messages, and images are transformed into sequences of DNA nucleotides. Subsequently, efficient searching algorithms are used to locate the multiple positions of a sequence of four DNA nucleotides. These four DNA nucleotides represent the binary octet of a single plaintext character or the single pixel of an image within, say, a Canis Familiaris genomic chromosome. The process of recording the locations of a sequence of four DNA nucleotides representing a single plain-text character, then returning a single randomly chosen position, will enable us to assemble a file of random pointers of the locations of the four DNA nucleotides in the searched Canis Families genome. We call the file containing the randomly selected position in the searchable DNA strand for each plain text character, the ciphered text. Since there is negligible correlation between the pointers file obtained from the selected genome, with its inherently massive storing capabilities, and the plain-text characters, the method, we believe, is robust against any type of cipher attacks.
IASTED International Conference on Computational Intelligence, San Francisco, Nov 20, 2006
The fundamental idea behind this encryption technique is the exploitation of DNA cryptographic st... more The fundamental idea behind this encryption technique is the exploitation of DNA cryptographic strength, such as its storing capabilities and parallelism in order to enforce other conventional cryptographic algorithms. In this study, a binary form of data, such as plaintext messages, and images are transformed into sequences of DNA nucleotides. Subsequently, efficient searching algorithms are used to locate the multiple positions of a sequence of four DNA nucleotides. These four DNA nucleotides represent ...
Communications in Computer and Information Science, 2012
ABSTRACT In this paper we address the parallelization of genetic algorithm (GA) as a tool to solv... more ABSTRACT In this paper we address the parallelization of genetic algorithm (GA) as a tool to solve optimization problems. The proposed method which is called Parallel Genetic Algorithm with Gene Matrix (PGAGM), is a new parallel genetic algorithm technique that is based on distributed model for high dimensional problems. In this algorithm, Gene Matrix (GM) operator is used as an automatic termination criterion in order to assure that sufficient exploration of the search space has been conducted. The resulting technique shows excellent results with low execution time for finding the optimal solution.
Due to the extensive migration of business and scientific applications as well as the enormous gr... more Due to the extensive migration of business and scientific applications as well as the enormous growth in online data produced by IoT devices, numerous problems have arisen in cloud scheduling. Efficient delivery of resources considering user-defined Service Level Agreement (SLA) and Quality of Service (QoS) can only achieve with efficient and state-of-the-art scheduling methods. In this regard, virtual machine (VM) scheduling has been a highly required method for resource scheduling in the ever-changing cloud and multi-access computing environment (MAC). Based on an examination of recent literature, this investigation intends to provide a comprehensive Systematic Literature Review (SLR) of the methods employed for virtual machine scheduling in cloud computing. Besides, the SLR disseminates the challenges and opportunities in VM design and discusses future researchers' baselines. The SLR investigated the VM scheduling techniques and searched the most relevant research databases o...
Expert Systems with Applications
41 www.erpublication.org Abstract— Most of recent advanced sugar crystallization controlling pr... more 41 www.erpublication.org Abstract— Most of recent advanced sugar crystallization controlling programs aims to get the highest sugar yield and quality with minimum cost. This work is the second part of advanced sugar crystallization control program project which based on mathematical model, and focusing in the sugar crystallization in low temperatures with advantages of achievement the highest productivity and quality with cost reduction. The theory based on theoretical comparison between parameters and quantities obtained from crystallization of a certain sugar grade at same conditions of end crystal content and supersaturation and two different operating temperatures by using data of the advanced crystallization control program. The theory was implemented for R1 and R4 sugar crystallization in united sugar company of Egypt USCE and obtained results simulated with that in practice and listed for analysis and discussions.
The fundamental idea behind this encryption technique is the exploitation of DNA cryptographic st... more The fundamental idea behind this encryption technique is the exploitation of DNA cryptographic strength, such as its storing capabilities and parallelism in order to enforce other conventional cryptographic algorithms. In this study, a binary form of data, such as plaintext messages, and images are transformed into sequences of DNA nucleotides. Subsequently, efficient searching algorithms are used to locate the multiple positions of a sequence of four DNA nucleotides. These four DNA nucleotides represent the binary octet of a single plaintext character or the single pixel of an image within, say, a Canis Familiaris genomic chromosome. The process of recording the locations of a sequence of four DNA nucleotides representing a single plain-text character, then returning a single randomly chosen position, will enable us to assemble a file of random pointers of the locations of the four DNA nucleotides in the searched Canis Families genome. We call the file containing the randomly selected position in the searchable DNA strand for each plain text character, the ciphered text. Since there is negligible correlation between the pointers file obtained from the selected genome, with its inherently massive storing capabilities, and the plain-text characters, the method, we believe, is robust against any type of cipher attacks.
IASTED International Conference on Computational Intelligence, San Francisco, Nov 20, 2006
The fundamental idea behind this encryption technique is the exploitation of DNA cryptographic st... more The fundamental idea behind this encryption technique is the exploitation of DNA cryptographic strength, such as its storing capabilities and parallelism in order to enforce other conventional cryptographic algorithms. In this study, a binary form of data, such as plaintext messages, and images are transformed into sequences of DNA nucleotides. Subsequently, efficient searching algorithms are used to locate the multiple positions of a sequence of four DNA nucleotides. These four DNA nucleotides represent ...
Communications in Computer and Information Science, 2012
ABSTRACT In this paper we address the parallelization of genetic algorithm (GA) as a tool to solv... more ABSTRACT In this paper we address the parallelization of genetic algorithm (GA) as a tool to solve optimization problems. The proposed method which is called Parallel Genetic Algorithm with Gene Matrix (PGAGM), is a new parallel genetic algorithm technique that is based on distributed model for high dimensional problems. In this algorithm, Gene Matrix (GM) operator is used as an automatic termination criterion in order to assure that sufficient exploration of the search space has been conducted. The resulting technique shows excellent results with low execution time for finding the optimal solution.