Pub Date : 2014-09-07DOI: 10.18495/COMENGAPP.V3I3.92
Nazli B. Karimi
In the last few years, there are many applications for Wireless Sensor Networks (WSNs). One of the main drawbacks of these networks is the limited battery power of sensor nodes. There are many cases to reduce energy consumption in WSNs. One of them is clustering. Sensor nodes partitioned into the clusters so that one is chosen as Cluster Head (CH). Clustering and selection of the proper node as CH is very significant in reducing energy consumption and increasing network lifetime. In this paper, we have surveyed a multi agent clustering algorithms and compared on various parameters like cluster size, cluster count, clusters equality, parameters used in CHs selection, algorithm complexity, types of algorithm used in clustering, nodes location awareness, inter-cluster and intra-cluster topologies, nodes homogeneity and MAC layer communications.
{"title":"Survey on Multi Agent Energy Efficient Clustering Algorithms in Wireless Sensor Networks","authors":"Nazli B. Karimi","doi":"10.18495/COMENGAPP.V3I3.92","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I3.92","url":null,"abstract":"In the last few years, there are many applications for Wireless Sensor Networks (WSNs). One of the main drawbacks of these networks is the limited battery power of sensor nodes. There are many cases to reduce energy consumption in WSNs. One of them is clustering. Sensor nodes partitioned into the clusters so that one is chosen as Cluster Head (CH). Clustering and selection of the proper node as CH is very significant in reducing energy consumption and increasing network lifetime. In this paper, we have surveyed a multi agent clustering algorithms and compared on various parameters like cluster size, cluster count, clusters equality, parameters used in CHs selection, algorithm complexity, types of algorithm used in clustering, nodes location awareness, inter-cluster and intra-cluster topologies, nodes homogeneity and MAC layer communications.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"411 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121927675","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 : 2014-07-16DOI: 10.18495/COMENGAPP.V3I2.57
Mohammad Hassan Dianati, M. Sadreddini, A. Rasekh, S. M. Fakhrahmad, H. Taghi-Zadeh
Words stemming is one of the important issues in the field of natural language processing and information retrieval. There are different methods for stemming which are mostly language-dependent. Therefore, these stemmers are only applicable to particular languages. Because of the importance of this issue, in this paper, the proposed method for stemming is aimed to be language-independent. In the proposed stemmer, a bilingual dictionary is used and all of the words in the dictionary are firstly clustered. The words’ clustering is based on their structural and semantic similarity. Finally, finding the stem of new coming words is performed by making use of the previously formatted clusters. To evaluate the proposed scheme, words stemming is done on both Persian and English languages. The encouraging results indicate the good performance of the proposed method compared with its counterparts.
{"title":"Words Stemming Based on Structural and Semantic Similarity","authors":"Mohammad Hassan Dianati, M. Sadreddini, A. Rasekh, S. M. Fakhrahmad, H. Taghi-Zadeh","doi":"10.18495/COMENGAPP.V3I2.57","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I2.57","url":null,"abstract":"Words stemming is one of the important issues in the field of natural language processing and information retrieval. There are different methods for stemming which are mostly language-dependent. Therefore, these stemmers are only applicable to particular languages. Because of the importance of this issue, in this paper, the proposed method for stemming is aimed to be language-independent. In the proposed stemmer, a bilingual dictionary is used and all of the words in the dictionary are firstly clustered. The words’ clustering is based on their structural and semantic similarity. Finally, finding the stem of new coming words is performed by making use of the previously formatted clusters. To evaluate the proposed scheme, words stemming is done on both Persian and English languages. The encouraging results indicate the good performance of the proposed method compared with its counterparts.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115128737","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 : 2014-07-16DOI: 10.18495/COMENGAPP.V3I2.52
N. Mansouri
Grid environments have gain tremendous importance in recent years since application requirements increased drastically. The heterogeneity and geographic dispersion of grid resources and applications places some complex problems such as job scheduling. Most existing scheduling strategies in Grids only focus on one kind of Grid jobs which can be data-intensive or computation-intensive. However, only considering one kind of jobs in scheduling does not result in suitable scheduling in the viewpoint of all system, and sometimes causes wasting of resources on the other side. To address the challenge of simultaneously considering both kinds of jobs, a new Cost-Based Job Scheduling (CJS) strategy is proposed in this paper. At one hand, CJS algorithm considers both data and computational resource availability of the network, and on the other hand, considering the corresponding requirements of each job, it determines a value called W to the job. Using the W value, the importance of two aspects (being data or computation intensive) for each job is determined, and then the job is assigned to the available resources. The simulation results with OptorSim show that CJS outperforms comparing to the existing algorithms mentioned in literature as number of jobs increases.
{"title":"Improve the Performance of Data Grids by Cost-Based Job Scheduling Strategy","authors":"N. Mansouri","doi":"10.18495/COMENGAPP.V3I2.52","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I2.52","url":null,"abstract":"Grid environments have gain tremendous importance in recent years since application requirements increased drastically. The heterogeneity and geographic dispersion of grid resources and applications places some complex problems such as job scheduling. Most existing scheduling strategies in Grids only focus on one kind of Grid jobs which can be data-intensive or computation-intensive. However, only considering one kind of jobs in scheduling does not result in suitable scheduling in the viewpoint of all system, and sometimes causes wasting of resources on the other side. To address the challenge of simultaneously considering both kinds of jobs, a new Cost-Based Job Scheduling (CJS) strategy is proposed in this paper. At one hand, CJS algorithm considers both data and computational resource availability of the network, and on the other hand, considering the corresponding requirements of each job, it determines a value called W to the job. Using the W value, the importance of two aspects (being data or computation intensive) for each job is determined, and then the job is assigned to the available resources. The simulation results with OptorSim show that CJS outperforms comparing to the existing algorithms mentioned in literature as number of jobs increases.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115417054","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 : 2014-06-30DOI: 10.18495/COMENGAPP.V3I2.81
Rozita Jamili Oskouei, M. Askari
Several research works are attempted to predict students academic performance and assess the evaluating students knowledge or detecting students’ weakness and probability of failure in final semester examinations. However, several factors affect the performance of students in different countries or even in different states of one country. Therefore, understanding these factors and analyzing the effects of each one of those factors in each country, is necessary for improving instructors’ decisions in selecting the best teaching method for helping weak students or increasing performance of other students. This study is motivated to study the students’ academic performance in high school and bachelor degree studies in Iran and comparing these analysis results with the similar study’s results in India.
{"title":"Predicting Academic Performance with Applying Data Mining Techniques (Generalizing the results of two Different Case Studies)","authors":"Rozita Jamili Oskouei, M. Askari","doi":"10.18495/COMENGAPP.V3I2.81","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I2.81","url":null,"abstract":"Several research works are attempted to predict students academic performance and assess the evaluating students knowledge or detecting students’ weakness and probability of failure in final semester examinations. However, several factors affect the performance of students in different countries or even in different states of one country. Therefore, understanding these factors and analyzing the effects of each one of those factors in each country, is necessary for improving instructors’ decisions in selecting the best teaching method for helping weak students or increasing performance of other students. This study is motivated to study the students’ academic performance in high school and bachelor degree studies in Iran and comparing these analysis results with the similar study’s results in India.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134428180","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 : 2014-06-29DOI: 10.18495/COMENGAPP.V3I2.62
Rian Rahmanda Putra, Wanda Kinasih, D. I. Sensuse
Cloud computing is an innovation that allows the use of IT as a utility based on-demand. Since cloud computing is a new technology, its led to a variety of risks that required an assessment model to assess the organization's readiness to adopt cloud computing. Moreover, by using cloud computing services means organizations or outsourcing involves a third party. Before adopting cloud computing technology, organizations need to consider some of the effects that arise as a result of cloud computing, namely in terms of costs, risks and benefits. To assist organizations to consider the migration of existing IT systems to the cloud, it can be used the cost approach valuation models and risk and benefit. This paper discusses two models of cost-based assessment of risk and benefit modeling and modeling that can be used as a tool to assist organizations in making decisions related to the migration of existing IT systems to the cloud.
{"title":"Cost Modeling and Risk and Benefit Modeling Approach as a Tools For Decision Making in Adoption Cloud Computing as IT Strategic Business","authors":"Rian Rahmanda Putra, Wanda Kinasih, D. I. Sensuse","doi":"10.18495/COMENGAPP.V3I2.62","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I2.62","url":null,"abstract":"Cloud computing is an innovation that allows the use of IT as a utility based on-demand. Since cloud computing is a new technology, its led to a variety of risks that required an assessment model to assess the organization's readiness to adopt cloud computing. Moreover, by using cloud computing services means organizations or outsourcing involves a third party. Before adopting cloud computing technology, organizations need to consider some of the effects that arise as a result of cloud computing, namely in terms of costs, risks and benefits. To assist organizations to consider the migration of existing IT systems to the cloud, it can be used the cost approach valuation models and risk and benefit. This paper discusses two models of cost-based assessment of risk and benefit modeling and modeling that can be used as a tool to assist organizations in making decisions related to the migration of existing IT systems to the cloud.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114775594","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 : 2014-06-29DOI: 10.18495/COMENGAPP.V3I2.76
A. Jahani, L. M. Khanli, S. Razavi
Cloud computing is a kind of computing model that promise accessing to information resources in request time and subscription basis. In this environment, there are different type of user’s application with different requirements. In addition, there are different cloud Service providers which present spate services with various qualitative traits. Therefore determining the best cloud computing service for users with specific applications is a serious problem. Service ranking system compares the different services based on quality of services (QoS), in order to select the most appropriate service. In this paper, we propose a W_SR (Weight Service Rank) approach for cloud service ranking that uses from QoS features. Comprehensive experiments are conducted employing real-world QoS dataset, including more than 2500 web services over the world. The experimental results show that execution time of our approach is less than other approaches and it is more flexible and scalable than the others with increase in services or users.
{"title":"W_SR: A QoS Based Ranking Approach for Cloud Computing Service","authors":"A. Jahani, L. M. Khanli, S. Razavi","doi":"10.18495/COMENGAPP.V3I2.76","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I2.76","url":null,"abstract":"Cloud computing is a kind of computing model that promise accessing to information resources in request time and subscription basis. In this environment, there are different type of user’s application with different requirements. In addition, there are different cloud Service providers which present spate services with various qualitative traits. Therefore determining the best cloud computing service for users with specific applications is a serious problem. Service ranking system compares the different services based on quality of services (QoS), in order to select the most appropriate service. In this paper, we propose a W_SR (Weight Service Rank) approach for cloud service ranking that uses from QoS features. Comprehensive experiments are conducted employing real-world QoS dataset, including more than 2500 web services over the world. The experimental results show that execution time of our approach is less than other approaches and it is more flexible and scalable than the others with increase in services or users.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124245023","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 : 2014-06-29DOI: 10.18495/COMENGAPP.V3I2.73
sedigeh razavi babakalak, M. Balafar, A. Farzan
In this paper, a new robust digital image watermarking algorithm which was based on singular value decomposition (SVD) and discrete wavelet transform (DWT) was proposed and simulated for protecting real property rights. A gray scale logo image, rather than a randomly generated Gaussian noise type watermark, was used as a watermark. Its embedding algorithm hid a watermark LL sub-band blocks in the low–low (LL) and high-high (HH) sub-bands of a target non-overlapping block of the host image by modifying singular values on SVD version of these blocks. A semi-blind watermark extraction was designed to estimate the original coefficients. Experimental results showed that the proposed scheme made significant improvements in terms of both transparency and robustness and was superior to the existing methods which were considered in this paper.
{"title":"A new DWT-SVD based robust watermarking scheme for real property rights","authors":"sedigeh razavi babakalak, M. Balafar, A. Farzan","doi":"10.18495/COMENGAPP.V3I2.73","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I2.73","url":null,"abstract":"In this paper, a new robust digital image watermarking algorithm which was based on singular value decomposition (SVD) and discrete wavelet transform (DWT) was proposed and simulated for protecting real property rights. A gray scale logo image, rather than a randomly generated Gaussian noise type watermark, was used as a watermark. Its embedding algorithm hid a watermark LL sub-band blocks in the low–low (LL) and high-high (HH) sub-bands of a target non-overlapping block of the host image by modifying singular values on SVD version of these blocks. A semi-blind watermark extraction was designed to estimate the original coefficients. Experimental results showed that the proposed scheme made significant improvements in terms of both transparency and robustness and was superior to the existing methods which were considered in this paper.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130305773","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 : 2014-02-06DOI: 10.18495/COMENGAPP.V3I1.50
R. Iqbal, Awais Ahmad, A. Gilani
This paper brings up this idea of using Near Field Communication (NFC) for inventory control system instead of using traditional barcodes. NFC because of its high security, ease of use and efficiency can be very suitable for systems like inventory control. In traditional inventory control systems, each product has a barcode pasted on it, which is vulnerable to attacks as barcodes are open and have no security. Furthermore, barcodes are prone to damages and can be unreliable when pasted on different types of products e.g. hot and frozen products, circular shaped products and irregular shaped products like clothes etc. NFC on the other hand is very efficient, secure and reliable when it comes to short-range wireless communication. In this paper we will present our prototype for the inventory control system of an electronic store in which each product has a passive NFC tag pasted to it. When a customer buys a product the receipt of the product is generated using NFC between the NFC passive tag on the product and NFC enabled device (e.g. smart phone or reader) at the cash counter.
{"title":"NFC based inventory control system for secure and efficient communication","authors":"R. Iqbal, Awais Ahmad, A. Gilani","doi":"10.18495/COMENGAPP.V3I1.50","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I1.50","url":null,"abstract":"This paper brings up this idea of using Near Field Communication (NFC) for inventory control system instead of using traditional barcodes. NFC because of its high security, ease of use and efficiency can be very suitable for systems like inventory control. In traditional inventory control systems, each product has a barcode pasted on it, which is vulnerable to attacks as barcodes are open and have no security. Furthermore, barcodes are prone to damages and can be unreliable when pasted on different types of products e.g. hot and frozen products, circular shaped products and irregular shaped products like clothes etc. NFC on the other hand is very efficient, secure and reliable when it comes to short-range wireless communication. In this paper we will present our prototype for the inventory control system of an electronic store in which each product has a passive NFC tag pasted to it. When a customer buys a product the receipt of the product is generated using NFC between the NFC passive tag on the product and NFC enabled device (e.g. smart phone or reader) at the cash counter.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121723392","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 : 2014-02-06DOI: 10.18495/COMENGAPP.V3I1.44
N. Mansouri
Grid computing environments have emerged following the demand of scientists to have a very high computing power and storage capacity. One among the challenges imposed in the use of these environments is the performance problem. To improve performance, scheduling technique is used. Most existing scheduling strategies in Grids only focus on one kind of Grid jobs which can be data-intensive or computation-intensive. However, only considering one kind of jobs in scheduling does not result in suitable scheduling in the viewpoint of all system, and sometimes causes wasting of resources on the other side. To address the challenge of simultaneously considering both kinds of jobs, a new Hybrid Job Scheduling (HJS) strategy is proposed in this paper. At one hand, HJS algorithm considers both data and computational resource availability of the network, and on the other hand, considering the corresponding requirements of each job, it determines a value called W to the job. Using the W value, the importance of two aspects (being data or computation intensive) for each job is determined, and then the job is assigned to the available resources. The simulation results with OptorSim show that HJS outperforms comparing to the existing algorithms mentioned in literature as number of jobs increases.
{"title":"A Hybrid Approach for Scheduling based on Multi-criteria Decision Method in Data Grid","authors":"N. Mansouri","doi":"10.18495/COMENGAPP.V3I1.44","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I1.44","url":null,"abstract":"Grid computing environments have emerged following the demand of scientists to have a very high computing power and storage capacity. One among the challenges imposed in the use of these environments is the performance problem. To improve performance, scheduling technique is used. Most existing scheduling strategies in Grids only focus on one kind of Grid jobs which can be data-intensive or computation-intensive. However, only considering one kind of jobs in scheduling does not result in suitable scheduling in the viewpoint of all system, and sometimes causes wasting of resources on the other side. To address the challenge of simultaneously considering both kinds of jobs, a new Hybrid Job Scheduling (HJS) strategy is proposed in this paper. At one hand, HJS algorithm considers both data and computational resource availability of the network, and on the other hand, considering the corresponding requirements of each job, it determines a value called W to the job. Using the W value, the importance of two aspects (being data or computation intensive) for each job is determined, and then the job is assigned to the available resources. The simulation results with OptorSim show that HJS outperforms comparing to the existing algorithms mentioned in literature as number of jobs increases.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128561414","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 : 2014-02-06DOI: 10.18495/COMENGAPP.V3I1.49
R. Asgari, Reza Ebrahimi Atani
Today, smart cards are widely used in variety of applications of human life.The nature of these cards depends on theirs operating system, in other words the operating system determines that card can be used in what field. Hardware development on the one hand and increasing use of smart cards on the other, have led to that the operating systems have progressed dramatically.Moving from special-purpose operating systems with single application into multi-purpose operating systems with open architecture, is proof of claim.Increase the number of operating systems and variety of their applications, caused that the need to categorize and classify operating systems be felt more than ever.Smart card operating systems can be categorized based on different parameters such as file management, applications management, and historical generations. In this paper we will discussion about smart card operating systems and their classification based on these parameters.
{"title":"Classification of Smart Card Operating Systems","authors":"R. Asgari, Reza Ebrahimi Atani","doi":"10.18495/COMENGAPP.V3I1.49","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I1.49","url":null,"abstract":"Today, smart cards are widely used in variety of applications of human life.The nature of these cards depends on theirs operating system, in other words the operating system determines that card can be used in what field. Hardware development on the one hand and increasing use of smart cards on the other, have led to that the operating systems have progressed dramatically.Moving from special-purpose operating systems with single application into multi-purpose operating systems with open architecture, is proof of claim.Increase the number of operating systems and variety of their applications, caused that the need to categorize and classify operating systems be felt more than ever.Smart card operating systems can be categorized based on different parameters such as file management, applications management, and historical generations. In this paper we will discussion about smart card operating systems and their classification based on these parameters.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133306843","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
扫码关注我们
求助内容：
应助结果提醒方式：