Pub Date : 2017-12-01DOI: 10.23919/ICITST.2017.8356418
Thomas Briggs, Aspen Olmsted
This paper presents an architecture for answering the popular ‘bacon number’ game utilizing the IMDB dataset. The unique contribution to this well-known game is this paper presents implementing a breadth traversal algorithm and rendering of the data completely in the client. This paper outlines the architecture and presents evidence of comparable speed in the complete clientside rendering of the computation of large data objects as compared to traditional server-side compiled languages.
{"title":"Client side calculation of ‘bacon number’","authors":"Thomas Briggs, Aspen Olmsted","doi":"10.23919/ICITST.2017.8356418","DOIUrl":"https://doi.org/10.23919/ICITST.2017.8356418","url":null,"abstract":"This paper presents an architecture for answering the popular ‘bacon number’ game utilizing the IMDB dataset. The unique contribution to this well-known game is this paper presents implementing a breadth traversal algorithm and rendering of the data completely in the client. This paper outlines the architecture and presents evidence of comparable speed in the complete clientside rendering of the computation of large data objects as compared to traditional server-side compiled languages.","PeriodicalId":440665,"journal":{"name":"2017 12th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130801947","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 : 2017-12-01DOI: 10.23919/ICITST.2017.8356423
Blake Badders, Aspen Olmsted
Hierarchical data models are commonly used in databases to represent data across a multitude of disciplines. In this paper, I will examine two models that can be used to represent hierarchical data in a relational database, the nested interval model, and the nested set model. These models were analyzed on a WAMP server using various queries and CRUD operations. The purpose of this paper is to examine the advantages of using a nested interval model as compared to a nested set model in a database which needs to search quickly, create, update, and destroy large amounts of hierarchical data.
{"title":"Improve CRUD performance on hierarchical data: Nested interval model vs. nested set model","authors":"Blake Badders, Aspen Olmsted","doi":"10.23919/ICITST.2017.8356423","DOIUrl":"https://doi.org/10.23919/ICITST.2017.8356423","url":null,"abstract":"Hierarchical data models are commonly used in databases to represent data across a multitude of disciplines. In this paper, I will examine two models that can be used to represent hierarchical data in a relational database, the nested interval model, and the nested set model. These models were analyzed on a WAMP server using various queries and CRUD operations. The purpose of this paper is to examine the advantages of using a nested interval model as compared to a nested set model in a database which needs to search quickly, create, update, and destroy large amounts of hierarchical data.","PeriodicalId":440665,"journal":{"name":"2017 12th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131068514","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 : 2017-12-01DOI: 10.23919/ICITST.2017.8356376
P. Sadeghian, Aspen Olmsted
Statistical methods have been used in order to classify data from random samples. Generally, if we know the statistical distribution of the data, we can utilize specific classifiers designed for that distribution and anticipate good results. This work assesses the accuracy of Fuzzy Min-Max Neural Network (FMM) and Enhanced Fuzzy Min-Max Neural Network (EFMM) classifiers in classification tasks using data from five different statistical distributions: Negative Binomial, Logistic, Log-Normal, Gamma, and Weibull. Results of the assessment are provided and show different accuracies based on the statistical distribution of the data. This study presents a novel approach to the classification of statistical distributions by presenting two classifiers, namely FMM and EFMM Neural Networks, capable of classifying the above statistical distributions.
{"title":"Assessment of fuzzy min-max neural networks for classification tasks","authors":"P. Sadeghian, Aspen Olmsted","doi":"10.23919/ICITST.2017.8356376","DOIUrl":"https://doi.org/10.23919/ICITST.2017.8356376","url":null,"abstract":"Statistical methods have been used in order to classify data from random samples. Generally, if we know the statistical distribution of the data, we can utilize specific classifiers designed for that distribution and anticipate good results. This work assesses the accuracy of Fuzzy Min-Max Neural Network (FMM) and Enhanced Fuzzy Min-Max Neural Network (EFMM) classifiers in classification tasks using data from five different statistical distributions: Negative Binomial, Logistic, Log-Normal, Gamma, and Weibull. Results of the assessment are provided and show different accuracies based on the statistical distribution of the data. This study presents a novel approach to the classification of statistical distributions by presenting two classifiers, namely FMM and EFMM Neural Networks, capable of classifying the above statistical distributions.","PeriodicalId":440665,"journal":{"name":"2017 12th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124109255","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 : 2017-12-01DOI: 10.23919/ICITST.2017.8356392
Callum Brill, Thomas Nash
In this paper we investigate the performance of various mobile ad hoc network routing protocols. We use AODV and DSDV as our baseline as these are two of the most commonly used protocols in reactive and proactive routing, respectively. We compare these with the performance of an ant colony optimization implementation AntHocNet. This protocol works as a hybrid protocol, using both reactive and proactive elements. We implement the simulations across a variety of scenarios using the NS2 network simulator and present our findings.
{"title":"A comparative analysis of MANET routing protocols through simulation","authors":"Callum Brill, Thomas Nash","doi":"10.23919/ICITST.2017.8356392","DOIUrl":"https://doi.org/10.23919/ICITST.2017.8356392","url":null,"abstract":"In this paper we investigate the performance of various mobile ad hoc network routing protocols. We use AODV and DSDV as our baseline as these are two of the most commonly used protocols in reactive and proactive routing, respectively. We compare these with the performance of an ant colony optimization implementation AntHocNet. This protocol works as a hybrid protocol, using both reactive and proactive elements. We implement the simulations across a variety of scenarios using the NS2 network simulator and present our findings.","PeriodicalId":440665,"journal":{"name":"2017 12th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124871533","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 : 2017-12-01DOI: 10.23919/ICITST.2017.8356339
Tasnime Omrani, Rabei Becheikh, Olfa Mannai, Rhouma Rhouma, S. Belghith
Regarding the intensive use of images in the context of IoT, their security becomes crucial. Despite that severals lightweight ciphers have been proposed, they are not suitable for images data due to their features such as correlation, redundancy and voluminosity. In this context, we treat in this paper the weaknesses of the existent lightweight ciphers concerning the constraints of images. Additionally, we propose an appropriate lightweight image cryptosystem that takes all the features of this kind of data. The experimental results show the effectiveness of the new scheme compared to existent ones.
{"title":"RARE: A robust algorithm for rapid encryption","authors":"Tasnime Omrani, Rabei Becheikh, Olfa Mannai, Rhouma Rhouma, S. Belghith","doi":"10.23919/ICITST.2017.8356339","DOIUrl":"https://doi.org/10.23919/ICITST.2017.8356339","url":null,"abstract":"Regarding the intensive use of images in the context of IoT, their security becomes crucial. Despite that severals lightweight ciphers have been proposed, they are not suitable for images data due to their features such as correlation, redundancy and voluminosity. In this context, we treat in this paper the weaknesses of the existent lightweight ciphers concerning the constraints of images. Additionally, we propose an appropriate lightweight image cryptosystem that takes all the features of this kind of data. The experimental results show the effectiveness of the new scheme compared to existent ones.","PeriodicalId":440665,"journal":{"name":"2017 12th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121396961","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 : 2017-12-01DOI: 10.23919/ICITST.2017.8356424
Juhua Liu, Wei Li, Guoqiang Bai
Recently, a new lightweight block cryptography algorithm, ITUbee, has been proposed by Ferhat Karakoc in Lightsec 2013. An efficient hardware implementation of ITUbee is presented in this paper. Firstly, we reuse certain module, which takes a big share of hardware resource, to achieve better resource utilization. Secondly, we apply composite field to implement 8-bit S-box instead of the traditional looking up tables(LUTs) to save area requirements. In the end, we conclude that the hardware implementation of ITUbee requires about 6448 GE on 0.18 um technology. The area consumption of ITUbee is roughly 31.2% less than the round-based implementation. And it costs 365.6 GE to implement 8-bit S-box by using composite field, 32.7% less than by using LUTs.
{"title":"Efficient hardware implementation of ITUbee for lightweight application","authors":"Juhua Liu, Wei Li, Guoqiang Bai","doi":"10.23919/ICITST.2017.8356424","DOIUrl":"https://doi.org/10.23919/ICITST.2017.8356424","url":null,"abstract":"Recently, a new lightweight block cryptography algorithm, ITUbee, has been proposed by Ferhat Karakoc in Lightsec 2013. An efficient hardware implementation of ITUbee is presented in this paper. Firstly, we reuse certain module, which takes a big share of hardware resource, to achieve better resource utilization. Secondly, we apply composite field to implement 8-bit S-box instead of the traditional looking up tables(LUTs) to save area requirements. In the end, we conclude that the hardware implementation of ITUbee requires about 6448 GE on 0.18 um technology. The area consumption of ITUbee is roughly 31.2% less than the round-based implementation. And it costs 365.6 GE to implement 8-bit S-box by using composite field, 32.7% less than by using LUTs.","PeriodicalId":440665,"journal":{"name":"2017 12th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116538435","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 : 2017-12-01DOI: 10.23919/ICITST.2017.8356415
Wayne Chen, Aspen Olmsted
The focus of this research work is to explore the operational considerations of using a lightweight operating system (OSV) over standard Linux-based operating systems for virtualization. We focus on three aspects: a review of published literature in regards to performance; a comparison of virtualization footprint for a common application (Apache Tomcat), and an analysis of the possible security advantages. The results provide a rationale as to when lightweight operating systems may be advantageous for virtualization.
{"title":"Considerations for OSV over Linux-based virtual machines","authors":"Wayne Chen, Aspen Olmsted","doi":"10.23919/ICITST.2017.8356415","DOIUrl":"https://doi.org/10.23919/ICITST.2017.8356415","url":null,"abstract":"The focus of this research work is to explore the operational considerations of using a lightweight operating system (OSV) over standard Linux-based operating systems for virtualization. We focus on three aspects: a review of published literature in regards to performance; a comparison of virtualization footprint for a common application (Apache Tomcat), and an analysis of the possible security advantages. The results provide a rationale as to when lightweight operating systems may be advantageous for virtualization.","PeriodicalId":440665,"journal":{"name":"2017 12th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122510375","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 : 2017-12-01DOI: 10.23919/ICITST.2017.8356386
Md. Tomig Uddin Ahmed, Nazrul Islam Bhuiya, Md. Mahbubur Rahman
Sustainable and flexible development of an organizational business and achievement of current and future goals of an organization depends on business processes, technologies and information systems. In order to address these issues, there have been a number of enterprise architectures proposed in the literature. Unfortunately, many of the existing architectures pay little attention to security and sustainability. To create an accelerated and flexible IT infrastructure, it is needed to align IT and organizational business demands. Here, we proposed an enterprise architecture which is sustainable, secure and convivial to new technology for a developing or developed organizations. It is a robust and easily understandable architecture which includes single source identification system and a knowledge base with sustainable technology-transformation capabilities. This architecture is based on concepts, modeling and processes which can be used as the framework for both business and IT professionals. The proposed architecture includes kernel based security architecture with risk, incident and audit management systems. It is a high performing architecture which includes all the essential features of modern enterprise architecture (EA) enhanced with security and sustainability.
{"title":"A secure enterprise architecture focused on security and technology-transformation (SEAST)","authors":"Md. Tomig Uddin Ahmed, Nazrul Islam Bhuiya, Md. Mahbubur Rahman","doi":"10.23919/ICITST.2017.8356386","DOIUrl":"https://doi.org/10.23919/ICITST.2017.8356386","url":null,"abstract":"Sustainable and flexible development of an organizational business and achievement of current and future goals of an organization depends on business processes, technologies and information systems. In order to address these issues, there have been a number of enterprise architectures proposed in the literature. Unfortunately, many of the existing architectures pay little attention to security and sustainability. To create an accelerated and flexible IT infrastructure, it is needed to align IT and organizational business demands. Here, we proposed an enterprise architecture which is sustainable, secure and convivial to new technology for a developing or developed organizations. It is a robust and easily understandable architecture which includes single source identification system and a knowledge base with sustainable technology-transformation capabilities. This architecture is based on concepts, modeling and processes which can be used as the framework for both business and IT professionals. The proposed architecture includes kernel based security architecture with risk, incident and audit management systems. It is a high performing architecture which includes all the essential features of modern enterprise architecture (EA) enhanced with security and sustainability.","PeriodicalId":440665,"journal":{"name":"2017 12th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121242408","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 : 2017-12-01DOI: 10.23919/ICITST.2017.8356377
H. Loi, Aspen Olmsted
Backdoor malware are programs that enable hackers to access unauthorized computer systems by introducing a backdoor. These hackers will use this access to steal company information for personal gain. This malware uses a variety of techniques to hide their presence, and computer security researchers use a growing number of exotic techniques to detect them. However, it is not necessary to expend valuable IT resources on expensive security solutions as most of these backdoors can be detected by simple checks. We tested a wide array of in-the-wild malware to verily the effectiveness of these checks.
{"title":"Low-cost detection of backdoor malware","authors":"H. Loi, Aspen Olmsted","doi":"10.23919/ICITST.2017.8356377","DOIUrl":"https://doi.org/10.23919/ICITST.2017.8356377","url":null,"abstract":"Backdoor malware are programs that enable hackers to access unauthorized computer systems by introducing a backdoor. These hackers will use this access to steal company information for personal gain. This malware uses a variety of techniques to hide their presence, and computer security researchers use a growing number of exotic techniques to detect them. However, it is not necessary to expend valuable IT resources on expensive security solutions as most of these backdoors can be detected by simple checks. We tested a wide array of in-the-wild malware to verily the effectiveness of these checks.","PeriodicalId":440665,"journal":{"name":"2017 12th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123286265","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 : 2017-12-01DOI: 10.23919/ICITST.2017.8356451
W. Blair, Aspen Olmsted, Paul E. Anderson
In this paper, we investigate the feasibility and performance improvement of adapting a common stand-alone bioinformatics trimming tool for in-memory processing on a distributed Spark framework. The rapid and continuous rise of genomics technologies and applications demands fast and efficient genomic data processing pipelines. ADAM has emerged as a successful framework for handling large scientific datasets, and efforts are ongoing to expand its functionality in the bioinformatics pipeline. We hypothesize that executing as much of the pipeline as possible within the ADAM framework will improve the pipeline's time and disk requirements. We compare Trimmomatic, one of the most common raw read trimming algorithms, to our own simple Scala trimmer and show that the distributed framework allows our trimmer to suffer less overhead from increasing the number of input files. We conclude that executing Trimmomatic in Spark will improve performance with multiple file inputs. Future work will investigate the performance benefit of passing the distributed dataset directly to ADAM in memory rather than writing out an intermediate file to disk.
{"title":"Spark framework for transcriptomic trimming algorithm reduces cost of reading multiple input files","authors":"W. Blair, Aspen Olmsted, Paul E. Anderson","doi":"10.23919/ICITST.2017.8356451","DOIUrl":"https://doi.org/10.23919/ICITST.2017.8356451","url":null,"abstract":"In this paper, we investigate the feasibility and performance improvement of adapting a common stand-alone bioinformatics trimming tool for in-memory processing on a distributed Spark framework. The rapid and continuous rise of genomics technologies and applications demands fast and efficient genomic data processing pipelines. ADAM has emerged as a successful framework for handling large scientific datasets, and efforts are ongoing to expand its functionality in the bioinformatics pipeline. We hypothesize that executing as much of the pipeline as possible within the ADAM framework will improve the pipeline's time and disk requirements. We compare Trimmomatic, one of the most common raw read trimming algorithms, to our own simple Scala trimmer and show that the distributed framework allows our trimmer to suffer less overhead from increasing the number of input files. We conclude that executing Trimmomatic in Spark will improve performance with multiple file inputs. Future work will investigate the performance benefit of passing the distributed dataset directly to ADAM in memory rather than writing out an intermediate file to disk.","PeriodicalId":440665,"journal":{"name":"2017 12th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121760131","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
扫码关注我们
求助内容：
应助结果提醒方式：