Pub Date : 2018-12-01DOI: 10.1109/ICSENG.2018.8638195
Alina Rakhi Ajayan, Firas Al-Doghman, Z. Chaczko
The world today, as we know it, is profuse with information about humans and objects. Datasets generated by cyber-physical systems are orders of magnitude larger than their current information processing capabilities. Tapping into these big data flows to uncover much deeper perceptions into the functioning, operational logic and smartness levels attainable has been investigated for quite a while. Knowledge Discovery & Representation capabilities across mutiple modalities holds much scope in this direction, with regards to their information holding potential. This paper investigates the applicability of an arithmetic tool Tensor Decompositions and Factorizations in this scenario. Higher order datasets are decomposed for Anomaly Pattern capture which encases intelligence along multiple modes of data flow. Preliminary investigations based on data derived from Smart Grid Smart City Project are compliant with our hypothesis. The results proved that Abnormal patterns detected in decomposed Tensor factors encompass deep information energy content from Big Data as efficiently as other Pattern Extraction and Knowledge Discovery frameworks, while salvaging time and resources.
{"title":"Visualizing Multimodal Big Data Anomaly Patterns in Higher-Order Feature Spaces","authors":"Alina Rakhi Ajayan, Firas Al-Doghman, Z. Chaczko","doi":"10.1109/ICSENG.2018.8638195","DOIUrl":"https://doi.org/10.1109/ICSENG.2018.8638195","url":null,"abstract":"The world today, as we know it, is profuse with information about humans and objects. Datasets generated by cyber-physical systems are orders of magnitude larger than their current information processing capabilities. Tapping into these big data flows to uncover much deeper perceptions into the functioning, operational logic and smartness levels attainable has been investigated for quite a while. Knowledge Discovery & Representation capabilities across mutiple modalities holds much scope in this direction, with regards to their information holding potential. This paper investigates the applicability of an arithmetic tool Tensor Decompositions and Factorizations in this scenario. Higher order datasets are decomposed for Anomaly Pattern capture which encases intelligence along multiple modes of data flow. Preliminary investigations based on data derived from Smart Grid Smart City Project are compliant with our hypothesis. The results proved that Abnormal patterns detected in decomposed Tensor factors encompass deep information energy content from Big Data as efficiently as other Pattern Extraction and Knowledge Discovery frameworks, while salvaging time and resources.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124722054","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 : 2018-12-01DOI: 10.1109/ICSENG.2018.8638176
Balume Mburano, Weisheng Si
The widespread adoption of web vulnerability scanners and their differences in effectiveness make it necessary to benchmark these scanners. Moreover, the literature lacks the comparison of the results of scanners effectiveness from different benchmarks. In this paper, we first compare the performances of some open source web vulnerability scanners of our careful choice by running them against the OWASP benchmark, which is developed by the Open Web Application Security Project (OWASP), a well-known non-profit web security organization. Furthermore, we compare our results from the OWASP benchmark with the existing results from the Web Application Vulnerability Security Evaluation Project (WAVSEP) benchmark, another popular benchmark used to evaluate scanner effectiveness. We are the first to make a comparison between these two benchmarks in literature. Our evaluation results allow us to make some valuable recommendations for the practice of benchmarking web scanners.
{"title":"Evaluation of Web Vulnerability Scanners Based on OWASP Benchmark","authors":"Balume Mburano, Weisheng Si","doi":"10.1109/ICSENG.2018.8638176","DOIUrl":"https://doi.org/10.1109/ICSENG.2018.8638176","url":null,"abstract":"The widespread adoption of web vulnerability scanners and their differences in effectiveness make it necessary to benchmark these scanners. Moreover, the literature lacks the comparison of the results of scanners effectiveness from different benchmarks. In this paper, we first compare the performances of some open source web vulnerability scanners of our careful choice by running them against the OWASP benchmark, which is developed by the Open Web Application Security Project (OWASP), a well-known non-profit web security organization. Furthermore, we compare our results from the OWASP benchmark with the existing results from the Web Application Vulnerability Security Evaluation Project (WAVSEP) benchmark, another popular benchmark used to evaluate scanner effectiveness. We are the first to make a comparison between these two benchmarks in literature. Our evaluation results allow us to make some valuable recommendations for the practice of benchmarking web scanners.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124904916","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 : 2018-12-01DOI: 10.1109/ICSENG.2018.8638224
T. Mazurkiewicz, G. Borowik, T. Luba
Index generation functions attract increasing interest lately due to their important applications. They can be realized using a circuit called index generation unit. However, it requires additional memory to determine, whether an input vector is valid for that function. The better linear reduction of an index generation function is found, the more memory is used. In this paper, a new type of circuit is proposed. It uses probabilistic data structures to determine the validity of an input element. We show that it can be used to efficiently realize index generation functions at the cost of the small probability of false positives.
{"title":"Construction of index generation unit using probabilistic data structures","authors":"T. Mazurkiewicz, G. Borowik, T. Luba","doi":"10.1109/ICSENG.2018.8638224","DOIUrl":"https://doi.org/10.1109/ICSENG.2018.8638224","url":null,"abstract":"Index generation functions attract increasing interest lately due to their important applications. They can be realized using a circuit called index generation unit. However, it requires additional memory to determine, whether an input vector is valid for that function. The better linear reduction of an index generation function is found, the more memory is used. In this paper, a new type of circuit is proposed. It uses probabilistic data structures to determine the validity of an input element. We show that it can be used to efficiently realize index generation functions at the cost of the small probability of false positives.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130178263","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 : 2018-12-01DOI: 10.1109/ICSENG.2018.8638242
H. Mansour, Ahmed Khamis, D. Zydek, H. Selvaraj
Although spread spectrum technique is considered as an old technique, however it still has wide applications in designing reliable and secure communication systems. Due to the recent developments, it becomes not sufficient to full fill all the security and applications requirements, especially from the point of view of the spreading codes. As an alternative solution, chaotic spreading codes appeared to solve most of the problems of the traditional spreading codes. Chaotic codes have better properties from the security point of view. Also, chaotic maps can be used to produce a huge number of sequences; this feature is very desirable in the applications of the multiple accesses. In this paper, the performance of a multi-user hybrid spread spectrum system is presented, an analysis and evaluation of the presented system is performed under fading channel. The system is coded with Viterbi decoder, and has three types of spreading techniques. A performance analysis, evaluation and comparison are performed between different types of improved chaotic codes and Pseudo Noise codes as spreading codes in the Direct Sequence Spread Spectrum. The results show that the chaotic codes give better performance than the Pseudo Noise codes.
{"title":"Performance Analysis and Evaluation of Multi-User Coded Hybrid Spread Spectrum System using Improved Chaotic Sequences","authors":"H. Mansour, Ahmed Khamis, D. Zydek, H. Selvaraj","doi":"10.1109/ICSENG.2018.8638242","DOIUrl":"https://doi.org/10.1109/ICSENG.2018.8638242","url":null,"abstract":"Although spread spectrum technique is considered as an old technique, however it still has wide applications in designing reliable and secure communication systems. Due to the recent developments, it becomes not sufficient to full fill all the security and applications requirements, especially from the point of view of the spreading codes. As an alternative solution, chaotic spreading codes appeared to solve most of the problems of the traditional spreading codes. Chaotic codes have better properties from the security point of view. Also, chaotic maps can be used to produce a huge number of sequences; this feature is very desirable in the applications of the multiple accesses. In this paper, the performance of a multi-user hybrid spread spectrum system is presented, an analysis and evaluation of the presented system is performed under fading channel. The system is coded with Viterbi decoder, and has three types of spreading techniques. A performance analysis, evaluation and comparison are performed between different types of improved chaotic codes and Pseudo Noise codes as spreading codes in the Direct Sequence Spread Spectrum. The results show that the chaotic codes give better performance than the Pseudo Noise codes.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127993361","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 : 2018-12-01DOI: 10.1109/ICSENG.2018.8638244
D. Selvathi, H. Selvaraj
Segmentation of brain tissues and classification in Magnetic Resonance Imaging (MRI) is crucial process for clinical applications. Manual process is a tedious and time consuming task for large amount of data. Automatic method eliminates the need of manual interaction and has received more attention. In this work, a new machine learning algorithm is proposed by combining Random forest algorithm with Modified Adaboost algorithm to segment the tumor from the MRI Brain tissues. Artifacts in imaging introduce distortions which may confuse tissues segmentation. These undesired needs to be eliminated for correct segmentation. Due to the complex structure, Brain tumor tissue texture is formulated using fractal based techniques. Then the fractal and intensity features are given as the input to the random forest classifier and modified Adaboost random forest classifier. The MRI BRATS2013 dataset is used for analysing the performance of the proposed method. Simulation results proved that the hybrid method of modified Adaboost random forest classifier achieves higher accuracy compared to the conventional random forest classifier for tumor segmentation.
{"title":"SEGMENTATION OF BRAIN TUMOR TISSUES IN MR IMAGES USING MULTIRESOLUTION TRANSFORMS AND RANDOM FOREST CLASSIFIER WITH ADABOOST TECHNIQUE","authors":"D. Selvathi, H. Selvaraj","doi":"10.1109/ICSENG.2018.8638244","DOIUrl":"https://doi.org/10.1109/ICSENG.2018.8638244","url":null,"abstract":"Segmentation of brain tissues and classification in Magnetic Resonance Imaging (MRI) is crucial process for clinical applications. Manual process is a tedious and time consuming task for large amount of data. Automatic method eliminates the need of manual interaction and has received more attention. In this work, a new machine learning algorithm is proposed by combining Random forest algorithm with Modified Adaboost algorithm to segment the tumor from the MRI Brain tissues. Artifacts in imaging introduce distortions which may confuse tissues segmentation. These undesired needs to be eliminated for correct segmentation. Due to the complex structure, Brain tumor tissue texture is formulated using fractal based techniques. Then the fractal and intensity features are given as the input to the random forest classifier and modified Adaboost random forest classifier. The MRI BRATS2013 dataset is used for analysing the performance of the proposed method. Simulation results proved that the hybrid method of modified Adaboost random forest classifier achieves higher accuracy compared to the conventional random forest classifier for tumor segmentation.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129458035","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 : 2018-12-01DOI: 10.1109/ICSENG.2018.8638181
Zaihui Deng, Shan Ding, Xiaojun Tong, Liangcai Gan
Degree distribution is the most important component that is responsible for the performance of rateless codes. Evolution Strategy approach has been introduced into the degree optimization process along with Monte Carlo simulation evaluation to obtain a better degree distribution. Compared with Robust Soliton Distribution, this approach can obtain better degree distribution data which have a lower mean value of the degree and a lower successful decoding overhead. Simulation results show that degree distribution optimization approach of LT codes with the evolution strategy algorithm is effective.
{"title":"Optimal Design of Degree Distribution in LT Codes Based on Evolution Strategy","authors":"Zaihui Deng, Shan Ding, Xiaojun Tong, Liangcai Gan","doi":"10.1109/ICSENG.2018.8638181","DOIUrl":"https://doi.org/10.1109/ICSENG.2018.8638181","url":null,"abstract":"Degree distribution is the most important component that is responsible for the performance of rateless codes. Evolution Strategy approach has been introduced into the degree optimization process along with Monte Carlo simulation evaluation to obtain a better degree distribution. Compared with Robust Soliton Distribution, this approach can obtain better degree distribution data which have a lower mean value of the degree and a lower successful decoding overhead. Simulation results show that degree distribution optimization approach of LT codes with the evolution strategy algorithm is effective.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115956057","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 : 2018-12-01DOI: 10.1109/icseng.2018.8638186
{"title":"ICSEng 2018 Copyright Page","authors":"","doi":"10.1109/icseng.2018.8638186","DOIUrl":"https://doi.org/10.1109/icseng.2018.8638186","url":null,"abstract":"","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124002121","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 : 2018-12-01DOI: 10.1109/icseng.2018.8638169
{"title":"ICSEng 2018 Preface","authors":"","doi":"10.1109/icseng.2018.8638169","DOIUrl":"https://doi.org/10.1109/icseng.2018.8638169","url":null,"abstract":"","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115151496","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 : 2018-12-01DOI: 10.1109/ICSENG.2018.8638167
Elham Sheikhi Mehrabadi, S. Sathiakumar
Environmental and economic limitations of the conventional power system could be overcome using cutting-edge technologies, such as microgrid. Recently, combined heat and power (CHP) co-generation units in microgrids have widely attracted attention due to the cost effectiveness and pollution reduction. This work presents a non-dominated sorting genetic algorithm (NSGA-II) to solve electricity and heat generation dispatch problem of CHP–based industrial microgrid (IMG) over a 24-hour period. This multi-objective optimization algorithm aims to minimize the overall system cost and pollutant emission simultaneously, with considering network security and photovoltaic (PV) storages constraints. To demonstrate the performance of optimization process, two scenarios are analyzed. The microgrid isolated mode without using PV and the connected mode with using PVs and PV storages are assessed which the later one indicated more enhanced environmental and economic solutions.
{"title":"Optimal Scheduling of CHP-Based Industrial Microgrid","authors":"Elham Sheikhi Mehrabadi, S. Sathiakumar","doi":"10.1109/ICSENG.2018.8638167","DOIUrl":"https://doi.org/10.1109/ICSENG.2018.8638167","url":null,"abstract":"Environmental and economic limitations of the conventional power system could be overcome using cutting-edge technologies, such as microgrid. Recently, combined heat and power (CHP) co-generation units in microgrids have widely attracted attention due to the cost effectiveness and pollution reduction. This work presents a non-dominated sorting genetic algorithm (NSGA-II) to solve electricity and heat generation dispatch problem of CHP–based industrial microgrid (IMG) over a 24-hour period. This multi-objective optimization algorithm aims to minimize the overall system cost and pollutant emission simultaneously, with considering network security and photovoltaic (PV) storages constraints. To demonstrate the performance of optimization process, two scenarios are analyzed. The microgrid isolated mode without using PV and the connected mode with using PVs and PV storages are assessed which the later one indicated more enhanced environmental and economic solutions.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123489477","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 : 2018-12-01DOI: 10.1109/icseng.2018.8638196
{"title":"ICSEng 2018 Cover Page","authors":"","doi":"10.1109/icseng.2018.8638196","DOIUrl":"https://doi.org/10.1109/icseng.2018.8638196","url":null,"abstract":"","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124951151","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
扫码关注我们
求助内容：
应助结果提醒方式：