A. Siahaan, S. Aryza, R. Rahim, Andre Hasudungan Lubis
In the Sequitur algorithm, the compression process is performed based on the number of characters having similar similarities. Similarities will be detected on every syllable in the entire text. Determination of the number of characters to be compared will affect the compression level of this algorithm. Using dynamic or static blocks can optimize the number of compressed characters and of course, it affects the speed of data transmission.
{"title":"Comparison Between Dynamic And Static Blocks In Sequitur Algorithm","authors":"A. Siahaan, S. Aryza, R. Rahim, Andre Hasudungan Lubis","doi":"10.9790/0661-1904013943","DOIUrl":"https://doi.org/10.9790/0661-1904013943","url":null,"abstract":"In the Sequitur algorithm, the compression process is performed based on the number of characters having similar similarities. Similarities will be detected on every syllable in the entire text. Determination of the number of characters to be compared will affect the compression level of this algorithm. Using dynamic or static blocks can optimize the number of compressed characters and of course, it affects the speed of data transmission.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81374181","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}
Domination Theory is an important branch of Graph Theory that has wide range of applications to various branches of Science and Technology. A new family of graphs called Butterfly Graphs is introduced and study of its parameters is under progress. Butterfly Graphs are undirected graphs and are widely used in interconnection networks. The bondage number b(G) of a graph G is the minimum cardinality among all sets S E(G) such that γ(G S) > γ(G). In this paper bondage numbers of butterfly graph are studied for various values of n=2, 3, 4, then bondage number of BF(n) is generalized.
{"title":"Bondage Number of a Butterfly Graph","authors":"P. Jyothi, I. Kelkar","doi":"10.9790/3021-0705015865","DOIUrl":"https://doi.org/10.9790/3021-0705015865","url":null,"abstract":"Domination Theory is an important branch of Graph Theory that has wide range of applications to various branches of Science and Technology. A new family of graphs called Butterfly Graphs is introduced and study of its parameters is under progress. Butterfly Graphs are undirected graphs and are widely used in interconnection networks. The bondage number b(G) of a graph G is the minimum cardinality among all sets S E(G) such that γ(G S) > γ(G). In this paper bondage numbers of butterfly graph are studied for various values of n=2, 3, 4, then bondage number of BF(n) is generalized.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84269320","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}
Intrusion Detection Systems considered as an indispensable field of network security to detect passive and anomaly activities in network traffics and packets. In this paper a framework of network based intrusion detection system has been implemented using Logistic Model Trees supervised machine learning algorithm."NSL-KDD" dataset which is an updated dataset from "KDDCup 1999" benchmark dataset for intrusion detection has been used for the experimental analysis using percent of 60% for training phase and the rest for testing phase. The testing and experimental results from the proposed structure shows that using two way functions which are classification with regression combined in Logistic Model Tree is very accurate in term of accuracy and minimum false-positive average with high true-positive average. Two classifications has been performed in the proposed model which are (Attack or Normal)
{"title":"Classification Trees with Logistic Regression Functions for Network Based Intrusion Detection System","authors":"D. Y. Mahmood","doi":"10.9790/0661-1903044852","DOIUrl":"https://doi.org/10.9790/0661-1903044852","url":null,"abstract":"Intrusion Detection Systems considered as an indispensable field of network security to detect passive and anomaly activities in network traffics and packets. In this paper a framework of network based intrusion detection system has been implemented using Logistic Model Trees supervised machine learning algorithm.\"NSL-KDD\" dataset which is an updated dataset from \"KDDCup 1999\" benchmark dataset for intrusion detection has been used for the experimental analysis using percent of 60% for training phase and the rest for testing phase. The testing and experimental results from the proposed structure shows that using two way functions which are classification with regression combined in Logistic Model Tree is very accurate in term of accuracy and minimum false-positive average with high true-positive average. Two classifications has been performed in the proposed model which are (Attack or Normal)","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78075671","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}
Cloud Computing is dealing with an growing interest nowadays as it is present in many purchaser home equipment through advertising the illusion of countless resources in the direction of its clients. Nevertheless it increases intense problems with electricity intake: the better degrees of nice and availability require irrational strength expenses. A digital machine scheduling technique for decreasing strength consumption of IaaS datacenters is required. We need to design a CloudSim-based simulation environment, and implemented actual-international lines for the experiments. We need to show that enormous savings can be accomplished in strength intake with brand new proposed algorithms. Cloud computing is a digital pool of resources which might be supplied to customers through Internet. Cloud computing provider vendors one of the desires is to apply the assets successfully and advantage most profit. This results in task scheduling as a core and challenging difficulty in cloud computing. In this studies a dialogue closer to the useful resource management of digital machines in cloud and a way to make assets extra efficiently available to customers is furnished. The most important focus is on process scheduling. In this present work, a parametric analysis is finished to discover the requirement of technique migration and based totally in this evaluation the migration can be completed on those tactics. . The effectiveness of the paintings is diagnosed in terms of successful execution of the processes inside the deadlines.
{"title":"A New Approach for the Betterment in Energy-Aware VM Scheduling","authors":"Alekhya Orugonda, V. K. Kumar","doi":"10.9790/0661-1903065360","DOIUrl":"https://doi.org/10.9790/0661-1903065360","url":null,"abstract":"Cloud Computing is dealing with an growing interest nowadays as it is present in many purchaser home equipment through advertising the illusion of countless resources in the direction of its clients. Nevertheless it increases intense problems with electricity intake: the better degrees of nice and availability require irrational strength expenses. A digital machine scheduling technique for decreasing strength consumption of IaaS datacenters is required. We need to design a CloudSim-based simulation environment, and implemented actual-international lines for the experiments. We need to show that enormous savings can be accomplished in strength intake with brand new proposed algorithms. Cloud computing is a digital pool of resources which might be supplied to customers through Internet. Cloud computing provider vendors one of the desires is to apply the assets successfully and advantage most profit. This results in task scheduling as a core and challenging difficulty in cloud computing. In this studies a dialogue closer to the useful resource management of digital machines in cloud and a way to make assets extra efficiently available to customers is furnished. The most important focus is on process scheduling. In this present work, a parametric analysis is finished to discover the requirement of technique migration and based totally in this evaluation the migration can be completed on those tactics. . The effectiveness of the paintings is diagnosed in terms of successful execution of the processes inside the deadlines.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80782309","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}
Purva Naik, Rubana P Shaikh, Odelia Diukar, Saylee Dessai
In today’s world the education field is growing, developing widely and becoming one of the most crucial industries. The data available in the educational field can be studied using educational data mining so that the unseen knowledge can be obtained from it. In this paper, various data mining approaches like Clustering, classification and regression our used to predict the students’ performance in examination in advance, so that necessary measures can be taken to improvise on their performance to score better marks. A hybrid approach of Enhanced K-strange points clustering algorithm and Naïve Bayes classification algorithm is presented implemented and compared it with existing hybrid approach which is K-means clustering algorithm and Decision tree. Finally, to predict student performance, multiple linear regression is used. The results obtained after the implementation may be useful for instructor as well as students. This work will help in taking appropriate decision to improve student’s performance.
{"title":"Predicting Student Performance Based On Clustering And Classification","authors":"Purva Naik, Rubana P Shaikh, Odelia Diukar, Saylee Dessai","doi":"10.9790/0661-1903054952","DOIUrl":"https://doi.org/10.9790/0661-1903054952","url":null,"abstract":"In today’s world the education field is growing, developing widely and becoming one of the most crucial industries. The data available in the educational field can be studied using educational data mining so that the unseen knowledge can be obtained from it. In this paper, various data mining approaches like Clustering, classification and regression our used to predict the students’ performance in examination in advance, so that necessary measures can be taken to improvise on their performance to score better marks. A hybrid approach of Enhanced K-strange points clustering algorithm and Naïve Bayes classification algorithm is presented implemented and compared it with existing hybrid approach which is K-means clustering algorithm and Decision tree. Finally, to predict student performance, multiple linear regression is used. The results obtained after the implementation may be useful for instructor as well as students. This work will help in taking appropriate decision to improve student’s performance.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81919326","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}
The Now a days Cloud technologies has become an essential trend in the market of information technology. Virtualization and Internet-based Cloud computing leads to different kinds of failures to arise and hence, leads to the requirement for reliability and availability has become an essential issue. To make ensure for reliability and availability of cloud technologies, a scheme for fault tolerance need to be developed and implemented. As the majority of the early schemes for fault tolerance were focused on the utilization of only one way to tolerate faults. This paper presents an adaptive scheme that deals with the difficulty of fault tolerance in various cloud computing environments. The projected scheme employs adaptive behavior during the selection of replication and fine-grained checkpointing methods for attaining a reliable cloud platform that can handle different client requests. In addition to this the algorithm also determines the best suited fault tolerance method to every designated virtual machine. As the proposed scheme adapts fault tolerance methods it improves the performance of the cloud in terms of availability, throughput, cloud overheads due to huge number of check points and maintenance cost.
{"title":"An Adaptive Fault Reduction Scheme to Provide Reliable Cloud Computing Environment","authors":"M. Damodhar, S. Poojitha","doi":"10.9790/0661-1904016473","DOIUrl":"https://doi.org/10.9790/0661-1904016473","url":null,"abstract":"The Now a days Cloud technologies has become an essential trend in the market of information technology. Virtualization and Internet-based Cloud computing leads to different kinds of failures to arise and hence, leads to the requirement for reliability and availability has become an essential issue. To make ensure for reliability and availability of cloud technologies, a scheme for fault tolerance need to be developed and implemented. As the majority of the early schemes for fault tolerance were focused on the utilization of only one way to tolerate faults. This paper presents an adaptive scheme that deals with the difficulty of fault tolerance in various cloud computing environments. The projected scheme employs adaptive behavior during the selection of replication and fine-grained checkpointing methods for attaining a reliable cloud platform that can handle different client requests. In addition to this the algorithm also determines the best suited fault tolerance method to every designated virtual machine. As the proposed scheme adapts fault tolerance methods it improves the performance of the cloud in terms of availability, throughput, cloud overheads due to huge number of check points and maintenance cost.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91147502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper identifies the correct and wrong approaches of securing digital data. It also proposes further ways of increasing the overall security of data transfer and storage. The variety of data can be encrypted either for comparison only purposes or for further active reuse and update, which implies the need of having a different approach when processing the data flow. Several effective models and techniques of encrypting sensitive digital information are presented in this paper, that excludes all reviewed bad practices.
{"title":"Securing Sensitive Digital Data Techniques","authors":"T. Karavasilev","doi":"10.9790/0661-1903055366","DOIUrl":"https://doi.org/10.9790/0661-1903055366","url":null,"abstract":"This paper identifies the correct and wrong approaches of securing digital data. It also proposes further ways of increasing the overall security of data transfer and storage. The variety of data can be encrypted either for comparison only purposes or for further active reuse and update, which implies the need of having a different approach when processing the data flow. Several effective models and techniques of encrypting sensitive digital information are presented in this paper, that excludes all reviewed bad practices.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87815959","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}
V. Kamat, Shruti Chatti, A. Rodrigues, Chinmayee Shetty, Anusaya Vadji
Glaucoma is an eye disorder that majorly affects the optic nerve head in the retina. The damage caused to optic disc leads to gradual loss of peripheral vision which may further result in complete blindness. Glaucoma cannot be cured, hence early and accurate detection is necessary. This paper proposes a method to detect Glaucoma using fundus images. Enhanced K-Strange Points Clustering (EKSTRAP) algorithm is applied to obtain cup, disc and the blood vessels from the Neuro-Retinal Rim (NRR). Further elliptical fitting method is used to compute cup to disc (CDR) ratio. The Inferior-Superior-Nasal-Temporal (ISNT) ratio is obtained using masking. CDR and ISNT are used as inputs to the Naïve Bayes classifier.
{"title":"Glaucoma Detection Using Enhanced K-Strange Points Clustering Algorithm and Classification","authors":"V. Kamat, Shruti Chatti, A. Rodrigues, Chinmayee Shetty, Anusaya Vadji","doi":"10.9790/0661-1904014449","DOIUrl":"https://doi.org/10.9790/0661-1904014449","url":null,"abstract":"Glaucoma is an eye disorder that majorly affects the optic nerve head in the retina. The damage caused to optic disc leads to gradual loss of peripheral vision which may further result in complete blindness. Glaucoma cannot be cured, hence early and accurate detection is necessary. This paper proposes a method to detect Glaucoma using fundus images. Enhanced K-Strange Points Clustering (EKSTRAP) algorithm is applied to obtain cup, disc and the blood vessels from the Neuro-Retinal Rim (NRR). Further elliptical fitting method is used to compute cup to disc (CDR) ratio. The Inferior-Superior-Nasal-Temporal (ISNT) ratio is obtained using masking. CDR and ISNT are used as inputs to the Naïve Bayes classifier.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78667858","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}
Advances in wireless technology have led to rapid growth on various mobile services. This includes changes of shopping activities by the online shopper. Previously, shoppers use in-store shopping or through web shopping sites which is electronic commerce (e-commerce). Nowadays, with the increased use of smartphones and mobile application, the popularity of mobile commerce (m-commerce) is increased among consumer. Due to growth of m-commerce, it is crucial to ensure the m-commerce applications are highly usable and friendly. Therefore, it is important to properly design the interface of the apps. This paper discusses several interface design principles that m-commerce apps must follow in order to be a good apps. This paper provide the literature review for design guidelines based on several researches from databases such as IEEE, Science Direct, and Google Scholar. There are seven elements of m-commerce interface design such as context, content, community, customization, communication, connection and commerce elements has been found in this review.
{"title":"Mobile Commerce (M-Commerce) Interface Design: A Review of Literature","authors":"Z. Ahmad, Roslina Ibrahim","doi":"10.9790/0661-1903046670","DOIUrl":"https://doi.org/10.9790/0661-1903046670","url":null,"abstract":"Advances in wireless technology have led to rapid growth on various mobile services. This includes changes of shopping activities by the online shopper. Previously, shoppers use in-store shopping or through web shopping sites which is electronic commerce (e-commerce). Nowadays, with the increased use of smartphones and mobile application, the popularity of mobile commerce (m-commerce) is increased among consumer. Due to growth of m-commerce, it is crucial to ensure the m-commerce applications are highly usable and friendly. Therefore, it is important to properly design the interface of the apps. This paper discusses several interface design principles that m-commerce apps must follow in order to be a good apps. This paper provide the literature review for design guidelines based on several researches from databases such as IEEE, Science Direct, and Google Scholar. There are seven elements of m-commerce interface design such as context, content, community, customization, communication, connection and commerce elements has been found in this review.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80389608","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}
Reports have shown the lack of African Americans who take and pass the Advanced Placement (AP) Computer Science (CS) course. Many times, African American students are enrolled in schools that do not offer computer science courses like AP Computer Science. Interventions are needed nationally to provide African American students with equal opportunity to learn computer science. The goal of this research paper is design a study that will evaluate the effectiveness of a program to train high school teachers to teach Advance Placement Computer Science Principals using HBCU students majoring in computer science. Additionally, this program will be evaluated by its effectiveness to train teachers, its effect on the HBCU students who instruct the teachers and it feasibility to be scaled to HBCUs around the nation.
{"title":"Pairing High School Teachers with Historically Black College &University (HBCU) Computer Science Students to Teach Advanced Placement Computer Science Principles","authors":"N. Harris, D. KinnisGoshaPh.","doi":"10.9790/0661-1903060509","DOIUrl":"https://doi.org/10.9790/0661-1903060509","url":null,"abstract":"Reports have shown the lack of African Americans who take and pass the Advanced Placement (AP) Computer Science (CS) course. Many times, African American students are enrolled in schools that do not offer computer science courses like AP Computer Science. Interventions are needed nationally to provide African American students with equal opportunity to learn computer science. The goal of this research paper is design a study that will evaluate the effectiveness of a program to train high school teachers to teach Advance Placement Computer Science Principals using HBCU students majoring in computer science. Additionally, this program will be evaluated by its effectiveness to train teachers, its effect on the HBCU students who instruct the teachers and it feasibility to be scaled to HBCUs around the nation.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89616165","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
扫码关注我们
求助内容：
应助结果提醒方式：