Pub Date : 2013-11-01DOI: 10.1109/ICCES.2013.6707171
Y. Afify, I. Moawad, N. Badr, M. Tolba
With the proliferation of Software-as-a-Service in the cloud environment, users find it tiresome and time consuming to search for the right service that satisfies all their requirements. In addition, services may provide the same functionality but differ in their characteristics or the Quality of Service attributes (QoS) they offer. In this paper, we propose a semantic-based system that facilitates the SaaS publication, discovery and selection processes. To achieve these goals, we developed a unified ontology that combines services domain knowledge, SaaS characteristics, QoS metrics and real SaaS offers. A hybrid service matchmaking algorithm is introduced based on the proposed ontology. It integrates semantic-based metadata and ontology-based matching. Prototypical implementation results demonstrate the effectiveness of the proposed system.
{"title":"A semantic-based Software-as-a-Service (SaaS) discovery and selection system","authors":"Y. Afify, I. Moawad, N. Badr, M. Tolba","doi":"10.1109/ICCES.2013.6707171","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707171","url":null,"abstract":"With the proliferation of Software-as-a-Service in the cloud environment, users find it tiresome and time consuming to search for the right service that satisfies all their requirements. In addition, services may provide the same functionality but differ in their characteristics or the Quality of Service attributes (QoS) they offer. In this paper, we propose a semantic-based system that facilitates the SaaS publication, discovery and selection processes. To achieve these goals, we developed a unified ontology that combines services domain knowledge, SaaS characteristics, QoS metrics and real SaaS offers. A hybrid service matchmaking algorithm is introduced based on the proposed ontology. It integrates semantic-based metadata and ontology-based matching. Prototypical implementation results demonstrate the effectiveness of the proposed system.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"5 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":"128517484","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.6707180
Ayman A. Hanafy, Marianne A. Azer, S. Noureldin
Routing plays a vital role in ad hoc networks and Ad hoc On-demand Distance Vector (AODV) protocol is considered one of the most famous routing protocols in ad hoc networks. Unfortunately it doesn't specify security measures. This has motivated the researchers to design secured version of AODV. However Security always collides with performance. The higher the security level is, the lower the performance level. This paper presents a performance comparison between Secure AODV (SAODV) and Modified SAODV (MSAODV).
{"title":"SAODV and modified SAODV performance comparison","authors":"Ayman A. Hanafy, Marianne A. Azer, S. Noureldin","doi":"10.1109/ICCES.2013.6707180","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707180","url":null,"abstract":"Routing plays a vital role in ad hoc networks and Ad hoc On-demand Distance Vector (AODV) protocol is considered one of the most famous routing protocols in ad hoc networks. Unfortunately it doesn't specify security measures. This has motivated the researchers to design secured version of AODV. However Security always collides with performance. The higher the security level is, the lower the performance level. This paper presents a performance comparison between Secure AODV (SAODV) and Modified SAODV (MSAODV).","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"90 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":"133721663","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.6707157
M. Tolba, A. S. Elons
Automated translation systems for sign languages are important in a world that is showing a continuously increasing interest in removing barriers faced by physically challenged individuals in communicating and contributing to the society and the workforce. These systems can greatly facilitate the communication between the vocal and the nonvocal communities. For the hearing-impaired, such systems can serve as the equivalent of speech-recognition systems used by speaking people to interact with machines in a more natural way. Few research projects tried to develop a translation system from and to visual sign language. Very few of these attempts were on Arabic sign language. None of them succeeded to develop a reliable industrial product. This review explores these trials and proposes clear recommendations to convert the lab research to a real product useful to the community.
{"title":"Recent developments in sign language recognition systems","authors":"M. Tolba, A. S. Elons","doi":"10.1109/ICCES.2013.6707157","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707157","url":null,"abstract":"Automated translation systems for sign languages are important in a world that is showing a continuously increasing interest in removing barriers faced by physically challenged individuals in communicating and contributing to the society and the workforce. These systems can greatly facilitate the communication between the vocal and the nonvocal communities. For the hearing-impaired, such systems can serve as the equivalent of speech-recognition systems used by speaking people to interact with machines in a more natural way. Few research projects tried to develop a translation system from and to visual sign language. Very few of these attempts were on Arabic sign language. None of them succeeded to develop a reliable industrial product. This review explores these trials and proposes clear recommendations to convert the lab research to a real product useful to the community.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"158 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":"125778841","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.6707197
A. Ali, A. Hassanien
This paper presents a new algorithm for minimizing the molecular potential energy function. The new algorithm combines a global search genetic algorithm with a local search Nelder-Mead algorithm in order to search for the global minimum of molecular potential energy function. The minimization of molecular potential energy function problem is very challenging, since the number of local minima grows exponentially with the molecular size. The new algorithm is called GNMA (Genetic Nelder-Mead Algorithm). Such hybridization enhances the power of the search technique by combining the wide exploration capabilities of Genetic Algorithm (GA) and the deep exploitation capabilities of Nelder-Mead algorithm. The proposed algorithm can reach the global or near-global optimum for the molecular potential energy function with up to 200 degrees of freedom. The performance of the proposed algorithm has been compared with other 9 existing methods from the literature. The numerical results show that the proposed algorithm is promising and produce high quality solutions with low computational costs.
{"title":"Minimizing molecular potential energy function using genetic Nelder-Mead algorithm","authors":"A. Ali, A. Hassanien","doi":"10.1109/ICCES.2013.6707197","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707197","url":null,"abstract":"This paper presents a new algorithm for minimizing the molecular potential energy function. The new algorithm combines a global search genetic algorithm with a local search Nelder-Mead algorithm in order to search for the global minimum of molecular potential energy function. The minimization of molecular potential energy function problem is very challenging, since the number of local minima grows exponentially with the molecular size. The new algorithm is called GNMA (Genetic Nelder-Mead Algorithm). Such hybridization enhances the power of the search technique by combining the wide exploration capabilities of Genetic Algorithm (GA) and the deep exploitation capabilities of Nelder-Mead algorithm. The proposed algorithm can reach the global or near-global optimum for the molecular potential energy function with up to 200 degrees of freedom. The performance of the proposed algorithm has been compared with other 9 existing methods from the literature. The numerical results show that the proposed algorithm is promising and produce high quality solutions with low computational costs.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"1 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":"130134653","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.6707172
Medhat A. Tawfeek, A. El-Sisi, A. Keshk, F. Torkey
Cloud computing is the development of distributed computing, parallel computing and grid computing, or defined as the commercial implementation of these computer science concepts. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization problem, and many meta-heuristic algorithms have been proposed to solve it. A good task scheduler should adapt its scheduling strategy to the changing environment and the types of tasks. In this paper a cloud task scheduling policy based on ant colony optimization algorithm compared with different scheduling algorithms FCFS and round-robin, has been presented. The main goal of these algorithms is minimizing the makespan of a given tasks set. Ant colony optimization is random optimization search approach that will be used for allocating the incoming jobs to the virtual machines. Algorithms have been simulated using Cloudsim toolkit package. Experimental results showed that the ant colony optimization outperformed FCFS and round-robin algorithms.
{"title":"Cloud task scheduling based on ant colony optimization","authors":"Medhat A. Tawfeek, A. El-Sisi, A. Keshk, F. Torkey","doi":"10.1109/ICCES.2013.6707172","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707172","url":null,"abstract":"Cloud computing is the development of distributed computing, parallel computing and grid computing, or defined as the commercial implementation of these computer science concepts. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization problem, and many meta-heuristic algorithms have been proposed to solve it. A good task scheduler should adapt its scheduling strategy to the changing environment and the types of tasks. In this paper a cloud task scheduling policy based on ant colony optimization algorithm compared with different scheduling algorithms FCFS and round-robin, has been presented. The main goal of these algorithms is minimizing the makespan of a given tasks set. Ant colony optimization is random optimization search approach that will be used for allocating the incoming jobs to the virtual machines. Algorithms have been simulated using Cloudsim toolkit package. Experimental results showed that the ant colony optimization outperformed FCFS and round-robin algorithms.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"108 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":"122727215","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.6707198
Hanaa Ismail Elshazly, A. Elkorany, A. Hassanien, A. Azar
Machine Learning concept offers the biomedical research field a great support. It provides many opportunities for disease discovering and related drugs revealing. The machine learning medical applications had been evolved from the physician needs and motivated by the promising results extracted from empirical studies. Medical support systems can be provided by screening, medical images, pattern classification and microarrays gene expression analysis. Typically medical data is characterized by its huge dimensionality and relatively limited examples. Feature selection is a crucial step to improve classification performance. Recent studies in machine learning field about classification process emerged a novel strong classifier scheme called the ensemble classifier. In this paper, a study for the performance of two novel ensemble classifiers namely Random Forest (RF) and Rotation Forest (ROT) for biomedical data sets is tested with five medical datasets. Three different feature selection methods were used to extract the most relevant features in each data set. Prediction performance is evaluated using accuracy measure. It was observed that ROT achieved the highest classification accuracy in most tested cases.
{"title":"Ensemble classifiers for biomedical data: Performance evaluation","authors":"Hanaa Ismail Elshazly, A. Elkorany, A. Hassanien, A. Azar","doi":"10.1109/ICCES.2013.6707198","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707198","url":null,"abstract":"Machine Learning concept offers the biomedical research field a great support. It provides many opportunities for disease discovering and related drugs revealing. The machine learning medical applications had been evolved from the physician needs and motivated by the promising results extracted from empirical studies. Medical support systems can be provided by screening, medical images, pattern classification and microarrays gene expression analysis. Typically medical data is characterized by its huge dimensionality and relatively limited examples. Feature selection is a crucial step to improve classification performance. Recent studies in machine learning field about classification process emerged a novel strong classifier scheme called the ensemble classifier. In this paper, a study for the performance of two novel ensemble classifiers namely Random Forest (RF) and Rotation Forest (ROT) for biomedical data sets is tested with five medical datasets. Three different feature selection methods were used to extract the most relevant features in each data set. Prediction performance is evaluated using accuracy measure. It was observed that ROT achieved the highest classification accuracy in most tested cases.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"106 46","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113945014","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.6707192
M. Abdelhameed, M. Abdelaziz, S. Maged
The continuous motion of hydraulic implements in industrial is important parameters which affect productivity of mould casting machine. A lab setup is designed to evaluate a position control technique of a hydraulic cylinder at different load patterns. The lab setup consists of two loops, the first loop represents the controlled cylinder and the second loop represents the control of the loading cylinder. Robust and hybrid fuzzy robust controllers are developed to reduce the synchronization errors in cylinders positions to acceptable values. The second loop is controlled so that simulates variable loads with different pattern. A model representing the lab setup is developed and the system response is verified using experimental results.
{"title":"Design and performance analysis of hybrid fuzzy robust controller for hydraulic system against variable loads","authors":"M. Abdelhameed, M. Abdelaziz, S. Maged","doi":"10.1109/ICCES.2013.6707192","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707192","url":null,"abstract":"The continuous motion of hydraulic implements in industrial is important parameters which affect productivity of mould casting machine. A lab setup is designed to evaluate a position control technique of a hydraulic cylinder at different load patterns. The lab setup consists of two loops, the first loop represents the controlled cylinder and the second loop represents the control of the loading cylinder. Robust and hybrid fuzzy robust controllers are developed to reduce the synchronization errors in cylinders positions to acceptable values. The second loop is controlled so that simulates variable loads with different pattern. A model representing the lab setup is developed and the system response is verified using experimental results.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"23 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":"116880052","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.6707164
Ghada M. Farouk, I. Moawad, M. Aref
One of the fundamental and challengeable research areas in Real Time Strategy (RTS) games is opponent modelling. Most current approaches to opponent modelling pretended inefficiency. They are either computationally expensive or required a numerous amount of online gameplays to start learn successful models. Unfortunately, most successful approaches also were game specific. They mainly depend on the expert's knowledge of the game. In this paper, a generic and adaptive opponent modelling approach for RTS games is proposed. It is a completely automated approach for learning the highly informative features of the opponent's behavior of any RTS game. Inspired by the case-based reasoning technique, a case base of different opponent models is constructed in the approach offline phase. The online phase (during gameplay) utilizes only this model base for opponent classification. To better cope with opponents that switch strategies, the approach keeps track of the performance after classification. To show how the proposed approach is beneficial, a case study called SPRING game case-study is presented.
{"title":"Generic opponent modelling approach for real time strategy games","authors":"Ghada M. Farouk, I. Moawad, M. Aref","doi":"10.1109/ICCES.2013.6707164","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707164","url":null,"abstract":"One of the fundamental and challengeable research areas in Real Time Strategy (RTS) games is opponent modelling. Most current approaches to opponent modelling pretended inefficiency. They are either computationally expensive or required a numerous amount of online gameplays to start learn successful models. Unfortunately, most successful approaches also were game specific. They mainly depend on the expert's knowledge of the game. In this paper, a generic and adaptive opponent modelling approach for RTS games is proposed. It is a completely automated approach for learning the highly informative features of the opponent's behavior of any RTS game. Inspired by the case-based reasoning technique, a case base of different opponent models is constructed in the approach offline phase. The online phase (during gameplay) utilizes only this model base for opponent classification. To better cope with opponents that switch strategies, the approach keeps track of the performance after classification. To show how the proposed approach is beneficial, a case study called SPRING game case-study is presented.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"10 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":"128362535","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.6707187
A. Bayoumi, M. Abdelaziz, M. Abdelhameed
In this paper an analytical model for a Photovoltaic/Thermal (PV/T) hybrid system is presented. The simulation in this work is based on an analytical model in solving the equations and determining the Photovoltaic (PV) cells characteristics using both MATLAB and COMSOL Multiphysics. COMSOL is simulating the electromagnetic waves produced by the Sun through solving Maxwell's equations in three dimensions. Beside that COMSOL is used in studying the material absorption capabilities and calculating the material absorption coefficient using its refractive index. In addition to the above a thermal analysis for the PV module and the piping water is presented where the input, output temperatures, rate of heat transfer, overall heat transfer coefficient and thermal efficiency are calculated. As a result, a significant enhancement in the total electrical efficiency is observed with acceptable increased in the output water temperature.
{"title":"Modeling and simulation of Photovoltaic/Thermal hybrid system","authors":"A. Bayoumi, M. Abdelaziz, M. Abdelhameed","doi":"10.1109/ICCES.2013.6707187","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707187","url":null,"abstract":"In this paper an analytical model for a Photovoltaic/Thermal (PV/T) hybrid system is presented. The simulation in this work is based on an analytical model in solving the equations and determining the Photovoltaic (PV) cells characteristics using both MATLAB and COMSOL Multiphysics. COMSOL is simulating the electromagnetic waves produced by the Sun through solving Maxwell's equations in three dimensions. Beside that COMSOL is used in studying the material absorption capabilities and calculating the material absorption coefficient using its refractive index. In addition to the above a thermal analysis for the PV module and the piping water is presented where the input, output temperatures, rate of heat transfer, overall heat transfer coefficient and thermal efficiency are calculated. As a result, a significant enhancement in the total electrical efficiency is observed with acceptable increased in the output water temperature.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"21 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":"121205335","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.6707208
S. Hamad, A. Khalifa
Copyright protection techniques are in great demand due to the widespread illegal copying and communication of digital media. Due to their popularity, various watermarking methods have been proposed lately for digital images. Wavelet-based embedding techniques gained a lot of attention since they provide the perfect balance between imperceptibility and robustness. In this paper, we introduce an algorithm for hiding the complement of a DNA-encoded watermark data into the 3rd level resolution of the wavelet decomposition of a true color image. It applies a quantization operation on the sorted detail coefficients for an enhanced invisible embedding. The extraction process is carried out blindly without the need to refer to the original host image. Experimental results highlighted the excellent invisibility performance of the proposed algorithm. In addition, more than 90% of the embedded watermark survived even under high compression ratios. This outstanding performance continues in comparison with a number of similar methods.
{"title":"Robust blind image watermarking using DNA-encoding and discrete wavelet transforms","authors":"S. Hamad, A. Khalifa","doi":"10.1109/ICCES.2013.6707208","DOIUrl":"https://doi.org/10.1109/ICCES.2013.6707208","url":null,"abstract":"Copyright protection techniques are in great demand due to the widespread illegal copying and communication of digital media. Due to their popularity, various watermarking methods have been proposed lately for digital images. Wavelet-based embedding techniques gained a lot of attention since they provide the perfect balance between imperceptibility and robustness. In this paper, we introduce an algorithm for hiding the complement of a DNA-encoded watermark data into the 3rd level resolution of the wavelet decomposition of a true color image. It applies a quantization operation on the sorted detail coefficients for an enhanced invisible embedding. The extraction process is carried out blindly without the need to refer to the original host image. Experimental results highlighted the excellent invisibility performance of the proposed algorithm. In addition, more than 90% of the embedded watermark survived even under high compression ratios. This outstanding performance continues in comparison with a number of similar methods.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"55 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":"125717378","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
扫码关注我们
求助内容：
应助结果提醒方式：