{"title":"Electrical collector topologies for offshore wind power plants: A survey","authors":"Ramu Srikakulapu, U. Vinatha","doi":"10.1109/ICIINFS.2015.7399034","DOIUrl":"https://doi.org/10.1109/ICIINFS.2015.7399034","url":null,"abstract":"This paper gives an overview of various collector topologies for offshore wind farms. A comparative analysis of different DC and AC collector system topologies for offshore wind power plant are presented. The advantages and disadvantages of collector system topologies in terms of cost, reliability and efficiency are discussed. The paper discusses various updated collector topologies like radial, single sided ring, double sided ring, star and hybrid AC-DC etc. in AC collector systems and series, parallel, hybrid and matrix interconnected topology etc in DC collector systems. At the end alternative topologies based on bypassing method for radial, double sided topology are explained.","PeriodicalId":174378,"journal":{"name":"2015 IEEE 10th International Conference on Industrial and Information Systems (ICIIS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124665614","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}
{"title":"Low-complexity LDPC decoder for physical layer network coded multi-way wireless relay systems","authors":"Nuwan Balasuriya, C. Wavegedara","doi":"10.1109/ICIINFS.2015.7399015","DOIUrl":"https://doi.org/10.1109/ICIINFS.2015.7399015","url":null,"abstract":"Recently, in multi-way relay systems employing physical-layer network coding (PNC), channel condition-based pair selection for pairwise information exchange has drawn increased attention as it provides improved performance over the alternative approaches such as round-robin scheduling of node pairs. With pairwise information exchange, there is additional time diversity available due to transmission of the same coded information block of most of the nodes twice in two adjacent time slots. This additional time diversity can be exploited to further enhance the system performance by means of joint channel decoding-network coding. To this end, a joint belief propagation (BP)-based channel decoding-network coding algorithm was proposed by us in [9] for the relay node of low density parity check (LDPC)-coded multi-way relay systems. Even though the algorithm of [9] offers much superior performance over separate channel decoding, it is highly computational expensive and may not be suitable for applications in wireless sensor networks. Alternatively, bit-flipping (BF)-based LDPC decoding can be adopted at much lower computational complexity. In this paper, we develop a low complexity joint bit-flipping (BF)-based channel decoding and network coding algorithm for LDPC-based multi-way relay systems. The BER performance of the proposed algorithm is investigated using computer simulation for two commonly used LDPC codes. The simulation results demonstrate that superior BER performance can be achieved using the proposed joint decoding algorithm over separate and independent bit-flipping-based LDPC channel decoding at the relay. The simulation results also verify that our proposed algorithm is capable of harnessing the aforesaid additional time diversity available. Though the performance of the proposed joint decoding algorithm is inferior to the BP-based algorithm of [9], due to its low computationally complexity, this algorithm may be appealing for applications in relay nodes with low computational capabilities and memory constraints.","PeriodicalId":174378,"journal":{"name":"2015 IEEE 10th International Conference on Industrial and Information Systems (ICIIS)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122306712","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}
{"title":"Feasibility of using machine learning to access control in Squid proxy server","authors":"Kanchana Ihalagedara, Rajitha Kithuldeniya, Supun Weerasekara, Sampath Deegalla","doi":"10.1109/ICIINFS.2015.7399061","DOIUrl":"https://doi.org/10.1109/ICIINFS.2015.7399061","url":null,"abstract":"Fast Internet connectivity and billions of web sites have made World Wide Web an attractive place for people to use the Internet in their day-to-day life. Educational institutes provide the Internet access to students mainly for educational purposes. However, most of the time, students are allowed to access any content on the web. Therefore, the full bandwidth is consumed due to access to non-educational content such as streaming non-educational videos and downloading large image files, etc. Prevention of Internet usage on non-education content is practically difficult due to various reasons. Usually, this is implemented in the proxy server through maintaining a blacklist of URLs. Most of the time, this is a static list of URLs. With the fast growing content on the World Wide Web maintaining a static blacklist is impractical. In this paper, we propose a methodology to generate dynamic blacklist of URLs using machine learning techniques. We experimentally investigate several machine learning algorithms to predict whether the URL in concern is educational or noneducational. The results of the initial experiments show that linear support vector machines can be used to predict the content with 98.9% accuracy.","PeriodicalId":174378,"journal":{"name":"2015 IEEE 10th International Conference on Industrial and Information Systems (ICIIS)","volume":"68 E-4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126627096","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}
{"title":"Extracting data from the RSCAD electromagnetic simulation platform to perform eigenvalue analysis","authors":"B. W. H. A. Rupasinghe, U. Annakkage","doi":"10.1109/ICIINFS.2015.7399020","DOIUrl":"https://doi.org/10.1109/ICIINFS.2015.7399020","url":null,"abstract":"RSCAD® is an Electromagnetic Transient (EMT) simulation software of the RTDS real-time digital simulator. Currently, the software is able to carry out detailed nonlinear time-domain simulations only. Small signal stability analysis (eigenvalue analysis) of a power system cannot be performed on the software itself. Exporting data of a simulation case from RSCAD®, in order to perform eigenvalue analysis on a separate commercially available software, is also not trivial. The demonstration of extracting data of an RSCAD® simulation case, to perform eigenvalue analysis, is presented. The data is extracted from the files, generated by RSCAD, which the user has access to. Therefore the data extraction and eigenvalue analysis can be done by an external software module as presented. Incorporating the software module to RSCAD® as an internal function is proposed. The software module can perform eigenvalue analysis if all the power system models in the case are generic models, as is the case with commercially available software like SSAT®. Additionally, the proposed module can extract data of user-written linear controller models, and successfully incorporate them to the state space eigenvalue analysis. For full functionality of the module, all generic models should be linearized and included in the database. A common protocol is proposed for future expansion of the module. The extracted data is written into widely accepted file formats in the industry so that RSCAD® data can be exported for interoperability between different software.","PeriodicalId":174378,"journal":{"name":"2015 IEEE 10th International Conference on Industrial and Information Systems (ICIIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115693975","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}
Ahalya Ravendran, K.W.T. Roshali T. de Silva, Ransalu Senanayake
{"title":"Moment invariant features for automatic identification of critical malaria parasites","authors":"Ahalya Ravendran, K.W.T. Roshali T. de Silva, Ransalu Senanayake","doi":"10.1109/ICIINFS.2015.7399058","DOIUrl":"https://doi.org/10.1109/ICIINFS.2015.7399058","url":null,"abstract":"Malaria is a globally widespread mosquito-borne disease which is caused by Plasmodium parasite. Plasmodium falciparum is the most ubiquitous among few species of Plasmodium and its Gametocyte stage is the most virulent among all stages and species. Although blood films are stained for better visualisation through the microscope, the color difference between red blood cells and parasites is barely identifiable for a computer as images are represented in the RGB color space. Moreover, there are several parasites spread throughout the blood film in various orientations and sizes. The automatic classification becomes further challenging due to the presence of many artefacts in the blood film. A photomicrograph analysis method to determine the presence of the most critical parasite -Gametocyte stage of Plasmodium falciparum - in Giemsa-stained blood films is presented. Having extracted the parasite from the background of the image after a series of pre-processing operations, it is classified using both K-nearest neighbors (K-NN) and Gaussian naïve Bayes classifiers. As the key element of the research, moment invariant features are utilised to make the input features invariant to translation, rotation and scale (TRS). Based on leave-one-out cross-validation, true positive rates of 77.78% and 88.89% and, true negative rates of 95.24% and 80.95% were achieved for K-NN and Gaussian naïve Bayes classifiers respectively. Since a higher true positive rate is desirable in this application, Gaussian naïve Bayes qualifies as the classifier while moment invariant features provide robust covariates for classifying Plasmodium falciparum from other Plasmodium species.","PeriodicalId":174378,"journal":{"name":"2015 IEEE 10th International Conference on Industrial and Information Systems (ICIIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128408328","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}
P. T. Abeyrathne, S. Dewasurendra, Dhammika Elkaduwa
{"title":"Strategy to design formally verified hardware/software implementation of network protocols on reconfigurable hardware","authors":"P. T. Abeyrathne, S. Dewasurendra, Dhammika Elkaduwa","doi":"10.1109/ICIINFS.2015.7398980","DOIUrl":"https://doi.org/10.1109/ICIINFS.2015.7398980","url":null,"abstract":"Kernel-based network protocol implementation has led to major performance limitations in high-performance networking owing to excessive transaction latencies. Designing such protocols in reconfigurable hardware such as FPGA has been attempted to overcome these limitations. The use of reconfigurable hardware is needed in the development phase and could eventually lead to ASICs for better performance. However, mission critical nature of such applications needs a performance guarantee on design. This paper proposes a strategy to design formally verified reconfigurable hardware/software based implementation of network protocols in a compositional manner.","PeriodicalId":174378,"journal":{"name":"2015 IEEE 10th International Conference on Industrial and Information Systems (ICIIS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120950084","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}
M. Jiffriya, M. Jahan, Hasindu Gamaarachchi, R. Ragel
{"title":"Accelerating text-based plagiarism detection using GPUs","authors":"M. Jiffriya, M. Jahan, Hasindu Gamaarachchi, R. Ragel","doi":"10.1109/ICIINFS.2015.7399044","DOIUrl":"https://doi.org/10.1109/ICIINFS.2015.7399044","url":null,"abstract":"Plagiarism is known as an unauthorized use of other's contents in writing and ideas in thinking without proper acknowledgment. There are several tools implemented for text-based plagiarism detection using various methods and techniques. However, these tools become inefficient while handling a large number of datasets due to the process of plagiarism detection which comprises of a lot of computational tasks and large memory requirement. Therefore, when we deal with a large number of datasets, there should be a way to accelerate the process by applying acceleration techniques to optimize the plagiarism detection. In response to this, we have developed a parallel algorithm using Compute Unified Device Architecture (CUDA) and tested it on a Graphics Processing Unit (GPU) platform. An equivalent algorithm is run on CPU platform as well. From the comparison of the results, CPU shows better performance when the number and the size of the documents are small. Meantime, GPU is an effective and efficient platform when handling a large number of documents and high in data size due to the increase in the amount of parallelism. It was found out that for our dataset, the performance of the algorithm on the GPU platform is approximately 6x faster than CPU. Thus, introducing GPU based optimization algorithm to the plagiarism detection gives a real solution while handling a large number of data for inter-document plagiarism detection.","PeriodicalId":174378,"journal":{"name":"2015 IEEE 10th International Conference on Industrial and Information Systems (ICIIS)","volume":"49 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133724532","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}
{"title":"Pre-configured backup protection with limited resource sharing in elastic optical networks","authors":"Suthaharan Satkunarajah, K. Ratnam, R. Ragel","doi":"10.1109/ICIINFS.2015.7399065","DOIUrl":"https://doi.org/10.1109/ICIINFS.2015.7399065","url":null,"abstract":"In this paper, we address the problem of providing survivability in elastic optical networks (EONs). In EONs, unlike the traditional 50 GHz fixed grid, fine granular 12.5 GHz flexgrid is used and the frequency spectrum is used more efficiently. For providing survivability, we consider a recently proposed survivability approach known as pre-configured backup protection with sharing (PBPS) because of its benefits over traditional methods. In PBPS, backup paths can be pre-configured and at the same time they can share resources. Therefore, both short recovery time and efficient resource usage can be achieved. PBPS has earlier been investigated for fixed-grid and flexgrid (EONs) networks using switch architectures with the power splitting feature of variable optical splitters (VOSs) and combiners. A potential problem in PBPS is power loss due to possible repeated power splitting. To reduce the power loss, amplifiers can be used at additional high cost. Alternatively, an approach of limiting backup sharing has been investigated in fixed-grid networks. In this approach the number of power splitting on a backup lightpath at intermediate nodes is limited (to a threshold value) to reduce the total power loss. This approach limits the degree of backup sharing. PBPS with limited backup sharing has not been investigated for flexgrid networks (EONs) and this investigation is the focus of this paper. We carry out this investigation with detailed simulation experiments on different network topologies. Our findings are as follows. (1) As seen in fixed-grid networks, even with the small number of power splitting, significant blocking reduction is seen in EONs. (2) Unlike fixed-grid networks, the blocking performance of PBPS with the small number of power splitting is comparable to the performance associated to unlimited power splitting (unlimited sharing) and, therefore, PBPS with limited sharing is more effective in EONs when compared to fixed grid networks.","PeriodicalId":174378,"journal":{"name":"2015 IEEE 10th International Conference on Industrial and Information Systems (ICIIS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132535216","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}
{"title":"Performance analysis of open-source Linux-based HIP implementations","authors":"Jude Okwuibe, Madhusanka Liyanage, M. Ylianttila","doi":"10.1109/ICIINFS.2015.7398986","DOIUrl":"https://doi.org/10.1109/ICIINFS.2015.7398986","url":null,"abstract":"Traditional Internet architecture allows a host and its location to be identified using only Internet Protocol (IP) address. Host Identity Protocol (HIP) separates the dual role of IP addresses as the locator and the identifier and introduces a Host Identity (HI) name space, based on a public key security infrastructure. This change allows applications to use HIs instead of IP addresses at the transport layer, hence offering secure host mobility and multihoming capabilities. This modification to traditional Internet architecture raises concerns from both industries and researchers as to what extent it will affect the ideal performance of a network. In this article, we offer a performance evaluation of two open-source Linux-based HIP implementations, HIP on Linux (HIPL) and OpenHIP. Performance is evaluated on throughput (TCP and UDP), jitter, and end-to-end latency. To account for a heterogeneous mix of network types, different network scenarios were set up on a real world testbed. Based on the outcome of the experiments, we highlight the limitations of each implementation as well as their suitable industrial applications. We further suggest possible modifications to improve the performance of each approach.","PeriodicalId":174378,"journal":{"name":"2015 IEEE 10th International Conference on Industrial and Information Systems (ICIIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131188977","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}
{"title":"The A to Z of building a testbed for Power Analysis attacks","authors":"Hasindu Gamaarachchi, Harsha Ganegoda, R. Ragel","doi":"10.1109/ICIINFS.2015.7399063","DOIUrl":"https://doi.org/10.1109/ICIINFS.2015.7399063","url":null,"abstract":"Correlation Power Analysis (CPA) based Side Channel Attack (SCA) is a popular modern cryptanalysis typically used by adversaries in embedded devices to break their secret keys. CPA uses the correlation between the power consumption of the cryptosystem and the computation performed to derive the secret key. Proposing countermeasures against such attacks require a testbed for implementation and verification. Although, a large number of such attacks and countermeasures are proposed in the literature, building of testbeds are still not presented properly. Therefore, researchers starting to work on CPA have to spend an enormous amount of time for building and debugging such testbeds. Also, a few testbeds presented in the literature have their limitations. In this paper, we present an A to Z guide for preparing a CPA testbed that also addresses the shortcomings of the existing testbeds in the literature.","PeriodicalId":174378,"journal":{"name":"2015 IEEE 10th International Conference on Industrial and Information Systems (ICIIS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117213230","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}