M. Hasan, M. Faruque, Md. Moinul Islam, Mohammad Tausiful Islam
{"title":"Multi band negative index metamaterial based on split square shape resonators","authors":"M. Hasan, M. Faruque, Md. Moinul Islam, Mohammad Tausiful Islam","doi":"10.1109/ICCITECHN.2016.7860176","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2016.7860176","url":null,"abstract":"A multi band negative index metamaterial based on split square shape resonators has been discussed in this paper. The proposed metamaterial unit cell structure is a combination of split square shape ring resonators. Commercially available electromagnetic simulator CST Microwave Studio has been used to investigate the calculation of the proposed design. The proposed structure shows resonance at 3.36 GHz, 5.98 GHz, 9.83 GHz, 13.10 GHz and exhibits negative index characteristics at 8.25 GHz. The effective medium ratio of the designed unit cell is 8.90. However, a performances comparison analysis has been done between Rogers RT 5880 and Teflon substrate materials.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131566489","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}
A. S. M. Asadujjaman, M. S. Alam, Shafika Showkat Moni
{"title":"Optimization of ethernet ring protection switching for adaptive modulation in carrier access network","authors":"A. S. M. Asadujjaman, M. S. Alam, Shafika Showkat Moni","doi":"10.1109/ICCITECHN.2016.7860161","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2016.7860161","url":null,"abstract":"The ability of Ethernet Ring Protection Switching (ERPS) to provide carrier grade switchover has made Ethernet technology viable in telecommunication carrier networks enabling network operators to replace SONET/SDH/PDH. Adaptive modulation (AM) is another evolution in technology which may effectively double the capacity of microwave links in favorable weather condition. In this paper, we propose an enhancement of ERPS protocol to support adaptive modulation in ERPS protected microwave access network for improved throughput, reliability and energy efficiency. We present a mathematical model to verify the effectiveness of our proposed modification. Simulation results show that the proposed enhancement achieves significantly higher throughput compared to existing ITU-T G.8032 protocol in varying channel conditions.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131700021","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":"A consideration of towering scheme for efficient arithmetic operation over extension field of degree 18","authors":"Md. Al-Amin Khandaker, Y. Nogami","doi":"10.1109/ICCITECHN.2016.7860209","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2016.7860209","url":null,"abstract":"Barreto-Naehrig (BN) curve is a well studied pairing friendly curve of embedding degree 12, that uses arithmetic in Fpi2. Therefore the arithmetic of Fp12 extension field is well studied. In this paper, we have proposed an efficient approach of arithmetic operation over the extension field of degree 18 by towering. Fp18 extension field arithmetic is considered to be the basis of implementing the next generation pairing based security protocols. We have proposed to use Fp element to construct irreducible binomial for building tower of extension field up to Fp6, where conventional approach uses the root of previous irreducible polynomial to create next irreducible polynomials. Therefore using Fp elements in irreducible binomial construction, reduces the number of multiplications in Fp to calculate inversion and multiplication over Fp18, which effects acceleration in total arithmetic operation over Fp18.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130801747","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 supervised machine learning algorithms for text classification","authors":"Sadia Zaman Mishu, S M Rafiuddin","doi":"10.1109/ICCITECHN.2016.7860233","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2016.7860233","url":null,"abstract":"The demand of text classification is growing significantly in web searching, data mining, web ranking, recommendation systems and so many other fields of information and technology. This paper illustrates the text classification process on different dataset using some standard supervised machine learning techniques. Text documents can be classified through various kinds of classifiers. Labeled text documents are used to classify the text in supervised classifications. This paper applied these classifiers on different kinds of labeled documents and measures the accuracy of the classifiers. An Artificial Neural Network (ANN) model using Back Propagation Network (BPN) is used with several other models to create an independent platform for labeled and supervised text classification process. An existing benchmark approach is used to analysis the performance of classification using labeled documents. Experimental analysis on real data reveals which model works well in terms of classification accuracy.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114594464","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}
Naznin Akter, A. S. Hoque, Rashed Mustafa, M. S. Chowdhury
{"title":"Accuracy analysis of recommendation system using singular value decomposition","authors":"Naznin Akter, A. S. Hoque, Rashed Mustafa, M. S. Chowdhury","doi":"10.1109/ICCITECHN.2016.7860232","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2016.7860232","url":null,"abstract":"Recommendation systems use utility matrix to represent the user ratings for a particular items. But that matrix is sparse, that is, most of the user ratings are unknown. Predicting those unknown ratings is a big challenge of recommendation data mining task. Due to the sparse of data in utility matrix, few features become less important. Those features should be reduced to decline the computational complexity. Singular Value Decomposition (SVD) is a most powerful algorithm to predict unknown ratings by reducing the less significant features. Before applying SVD on utility matrix, all unknown ratings should be filled with some initial values. This paper focuses to generate two predictive matrixes by assigning two different initial values, where one is Zero and other is replacing unknown values with average item rating and then subtracting corresponding average user rating from the values. The accuracy of forecasted ratings has been justified over a sample dataset in this paper as well.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114521102","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}
Md Saiful Islam, M. Islam, M. A. Hossain, Jagoth Jyoti Dey
{"title":"Supervised approach of sentimentality extraction from bengali facebook status","authors":"Md Saiful Islam, M. Islam, M. A. Hossain, Jagoth Jyoti Dey","doi":"10.1109/ICCITECHN.2016.7860228","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2016.7860228","url":null,"abstract":"Sentiment is the only things that separate human and machine. To simulate the feelings for machines many researchers have been trying to create method and automated the process to extract opinion of particular news, product or life entity. Sentiment Analysis (SA) is a combination of opinions, emotions and subjectivity of a text. Currently SA is the most demanding task in Natural Language Processing. Social networking site like Facebook are mostly used in expressing the opinions about a particular entity of life. Newspaper published news about a particular event and user expressed their feedback in news comments. Online product feedback is increasing day by day. So reviews and opinions mining play a very important role in understanding people satisfactions. Such opinion mining has potential for knowledge discovery. The main target of SA is to find opinions from text extract sentiments from them and define their polarity, i.e positive or negative. In this domain most of the model was designed for English Language. This paper describes a novel approach using Naive Bayes classification model for Bengali Language. Here a supervised classification method is used with language rules for detecting sentiment for Bengali Facebook Status.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121865010","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. T. Islam, M. Samsuzzaman, M. Z. Mahmud, M.T. Islam
{"title":"A compact slotted patch antenna for ultrawideband application","authors":"M. T. Islam, M. Samsuzzaman, M. Z. Mahmud, M.T. Islam","doi":"10.1109/ICCITECHN.2016.7860171","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2016.7860171","url":null,"abstract":"A compact antenna with ultra wideband characteristics is proposed which covers the dimension of 23 × 21 mm2. It has a rectangular slotted patch with a circular slot, microstrip feed line and a tapered slot ground with a thickness of 1.6 mm which covers the inexpensive FR4 dielectric substrate. The proposed antenna covers a wider bandwidth of 10.1 GHz (2.90–12 GHz) with stable radiation pattern and constant gain which is ideal for UWB applications. The simulation is done with CST and HFSS simulator. The proposed antenna is low cost, compact in size and have good specifications which make it suitable for using UWB applications.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129430671","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}
Zareen Tasneem, Farissa Tafannum, Maksuda Rahman Anti, Wali Mohammad Abdullah, M. Rahman
{"title":"A modified anti-magic graph labeling for middle graph and total graph related to path","authors":"Zareen Tasneem, Farissa Tafannum, Maksuda Rahman Anti, Wali Mohammad Abdullah, M. Rahman","doi":"10.1109/ICCITECHN.2016.7860220","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2016.7860220","url":null,"abstract":"Graph labeling is the assignment of integers to edges or vertices or both depending on some factors which is consequential in the field of graph theory. In this paper, anti-magic graph labeling of two graphs, middle graph and total graph of path graph have been mainly focused. Modified proofs of theorems on anti-magic graph labeling have been introduced here. Both of the theorems are applicable for strong anti-magic graph. The correctness of the proofs has been demonstrated through various examples.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128460385","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":"Stacked auto encoder training incorporating printed text data for handwritten bangla numeral recognition","authors":"Mahtab Ahmed, A. Paul, M. Akhand","doi":"10.1109/ICCITECHN.2016.7860238","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2016.7860238","url":null,"abstract":"Recognition of handwritten numerals has gained much interest in recent years due to its various application potentials. Bangla is a major language in Indian subcontinent and is the first language of Bangladesh; but unfortunately, study regarding handwritten Bangla numeral recognition (HBNR) is very few with respect to other major languages such as English, Roman etc. Some noteworthy research works have been conducted for recognition of Bangla handwritten numeral using artificial neural network (ANN) as ANN and its various updated models are found to be efficient for classification task. The aim of this study is to develop a better HBNR system and hence investigated deep architecture of stacked auto encoder (SAE) incorporating printed text (SAEPT) method. SAE is a variant of neural networks (NNs) and is applied efficiently for hierarchical feature extraction from its input. The proposed SAEPT contains the encoding of handwritten numeral into printed form in the course of pre-training and finally initializing a multi-layer perceptron (MLP) using these pre-trained weights. Unlike other methods, it does not employ any feature extraction technique. Benchmark dataset with 22000 hand written numerals with different shapes, sizes and variations are used in this study. The proposed method is shown to outperform other prominent existing methods achieving satisfactory recognition accuracy.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129581648","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}
A. Shamsuddin, Turzo Ahsan, Ifrat Rahman, S. Momen
{"title":"Trophallaxis and energy optimization in swarms of robots","authors":"A. Shamsuddin, Turzo Ahsan, Ifrat Rahman, S. Momen","doi":"10.1109/ICCITECHN.2016.7860247","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2016.7860247","url":null,"abstract":"Ability to allocate task on the fly is considered to be one of the most desirable features in a swarm intelligent system. This paper presents a computational model in which swarms of autonomous agents (robots) carry out the task of cleaning the environment by collecting boxes from the environment and dumping them in a dump area. As agents work, they lose energy and when the energy is too low they need to go to the charging area to gain energy. Our model is inspired by how social insects and in particular how ants behave. Experimental results show that incorporating trophallactic behavior in swarms of robots improve the performance of the swarm in terms of the energy consumption over earlier strategies. The proposed model is found to be efficient, accurate and consistent with the biological equivalents.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129048907","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}