2016 International Conference on Information Technology (ICIT)最新文献

筛选
英文 中文
Implementation of OFDM and Pulsed-OFDM OFDM和脉冲OFDM的实现
2016 International Conference on Information Technology (ICIT) Pub Date : 2016-12-01 DOI: 10.1109/ICIT.2016.033
K. B. Singh, Sheikh Wasmir Hussain, T. V. Mahendra, C. V. R. Rao
{"title":"Implementation of OFDM and Pulsed-OFDM","authors":"K. B. Singh, Sheikh Wasmir Hussain, T. V. Mahendra, C. V. R. Rao","doi":"10.1109/ICIT.2016.033","DOIUrl":"https://doi.org/10.1109/ICIT.2016.033","url":null,"abstract":"This work undertaken, aims to develop pulsed-OFD transmission system, which is used in wide area of wireless communications. It is noteworthy to mention that the system is baseband transmission by excluding the RF (radio frequency) part. Pulsed-OFDM enhances the OFDM that endeavors prominent performance parameters with lesser complexity in implementation. This is possible by pulsating the OFDM symbols and spreading the frequency spectrum of the modulated signals. In this paper the implementation of the pulsed-OFDM transmission, as well as comparison results with OFDM have been presented. Focus is on the architectural characteristics of the system blocks which are used for transmission and reception. In this paper up-sampling is applied to the OFDM signal to induce the pulsed-OFDM signal. Finally, the performance of the system has been analyzed.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"115 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":"117311115","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}
引用次数: 1
Forecasting HPC Workload Using ARMA Models and SSA 用ARMA模型和SSA预测HPC工作负荷
2016 International Conference on Information Technology (ICIT) Pub Date : 2016-12-01 DOI: 10.1109/ICIT.2016.065
Anoop S. Kumar, Somnath Mazumdar
{"title":"Forecasting HPC Workload Using ARMA Models and SSA","authors":"Anoop S. Kumar, Somnath Mazumdar","doi":"10.1109/ICIT.2016.065","DOIUrl":"https://doi.org/10.1109/ICIT.2016.065","url":null,"abstract":"In high-performance computing (HPC) platform, resource usage pattern changes over time which makes the resource monitoring a challenge. Maintaining the performance goals within a good power range is very critical where servers suffer from under utilisation, failure or degraded hardware support. Better forecast of the workload can reduce the energy cost by predicting the future workload more accurately. Identifying the usage pattern is also vital for efficient capacity planning because prediction can also be augmented with an effective resource allocation strategy to manage resource distribution goals. However, a single prediction model does not fit for all. In this paper, we compare forecast performance of the state-of-the-art ARMA class (integrated ARMA (ARIMA), seasonal integrated ARMA (SARIMA) and fractionally integrated ARMA (ARFIMA)) with the singular spectrum analysis (SSA) method using CPU, RAM and Network traces collected from Wikimedia grid. We found that the most simple model of ARMA class (ARIMA) had outperformed other complex ARMA class models while forecasting the bursty pattern of Networks. ARIMA model provides the best forecast for the Network data while SSA is found to be the best method for CPU and RAM. We also show that with proper model fitting, we can achieve high forecasting precision as low as 0.00586% for RAM and maximum error around 5% for Network without having complete information about the underlying system hardware and the running applications type.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"28 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":"123589243","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}
引用次数: 21
Personalized Terms Derivative: Semi-supervised Word Root Finder 个性化术语衍生:半监督词根查找器
2016 International Conference on Information Technology (ICIT) Pub Date : 2016-12-01 DOI: 10.1109/ICIT.2016.059
N. Kumar, Abhishek Pradhan
{"title":"Personalized Terms Derivative: Semi-supervised Word Root Finder","authors":"N. Kumar, Abhishek Pradhan","doi":"10.1109/ICIT.2016.059","DOIUrl":"https://doi.org/10.1109/ICIT.2016.059","url":null,"abstract":"The ever increasing need to provide a suitable derivative of a term governed by context where derivative can either stemmed word or hypernym of a word has spurred a lot of research activities in information retrieval communities. In this paper, we are concerned with providing context centric derivatives of a term which can be useful in any search engine for obtaining better search results. Personalized Terms Derivative (PTD) provides derivative of terms based on the context surrounding the term. We also emphasize how the PTD (Personalized Terms Derivative) provides greater capabilities or enhance capabilities of an existing search engine like Solr and Elastic Search to perform boolean search effectively. This problem is a vital cog in the wheel of text analytics world. It can also be extended to improvise the result of keyword extraction, abstractive summarization, and POS parser tree.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"94 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":"132764105","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}
引用次数: 0
A Survey on Greedy Based Algorithms for Biclustering of Gene Expression Microarray Data 基于贪心的基因表达微阵列数据双聚类研究综述
2016 International Conference on Information Technology (ICIT) Pub Date : 2016-12-01 DOI: 10.1109/ICIT.2016.036
Bhawani Sankar Biswal, P. Mishra, A. Mohapatra, Swati Vipsita
{"title":"A Survey on Greedy Based Algorithms for Biclustering of Gene Expression Microarray Data","authors":"Bhawani Sankar Biswal, P. Mishra, A. Mohapatra, Swati Vipsita","doi":"10.1109/ICIT.2016.036","DOIUrl":"https://doi.org/10.1109/ICIT.2016.036","url":null,"abstract":"In the context of gene expression microarray data, biclustering is a technique to identify clusters of genes that are co-expressed under clusters of conditions. It usually has high computational complexity (NP-Hard). In computer science domain, combinatorial problems like biclustering, refer to the tasks associated with the discovery of grouping, ordering or assigning a discrete set of objects fulfilling some fixed constraints. Greedy Search approach is a popular method often used for solving combinatorial problems. It is adoptable in this context because of its variety aspects of search performance. Its variability caused by randomization and the robustness in parameter settings improves the search performance. This review article presents a brief survey of various greedy based biclustering algorithms that are being frequently applied on gene expression microarray data. These algorithms are further classified into iterative greedy approach and stochastic greedy approach based on their search criteria.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"28 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":"122859158","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}
引用次数: 2
Load Balancing among Wide-Area SDN Controllers 广域SDN控制器负载均衡
2016 International Conference on Information Technology (ICIT) Pub Date : 2016-12-01 DOI: 10.1109/ICIT.2016.032
Abhishek Singh, Mayank Tiwray, Raj Kumar, Rachita Misra
{"title":"Load Balancing among Wide-Area SDN Controllers","authors":"Abhishek Singh, Mayank Tiwray, Raj Kumar, Rachita Misra","doi":"10.1109/ICIT.2016.032","DOIUrl":"https://doi.org/10.1109/ICIT.2016.032","url":null,"abstract":"In Software Defined Network, the controller response time is the bottleneck for Quality of Service parameters for end users. This work aims at optimizing response time by a controller for an OpenFlow device (OFdevices) by selecting appropriate controller inWide Area Network environment. When the OFdevices select appropriate controller for minimization of the response time, they also stabilize the load on the physically distributed control plane. The proposed model checks for load imbalance in fixed time intervals for controllers and if a controller is overloaded then the proposed methods are called for migrating some of the OFdevices. The migration process affects QoS parameters for end user and therefore, this work focuses on improving end-users QoS while the OFdevice migrates. We evaluated our proposed work on Minimet and Floodlight controller. Simulation results shows that our proposed algorithms outperforms the existing works for load balancing.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","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":"121027132","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}
引用次数: 6
Brain Tumor Detection in Conventional MR Images Based on Statistical Texture and Morphological Features 基于统计纹理和形态学特征的常规MR图像脑肿瘤检测
2016 International Conference on Information Technology (ICIT) Pub Date : 2016-12-01 DOI: 10.1109/ICIT.2016.037
Manu Gupta, B. V. V. S. N. Rao, Venkateswaran Rajagopalan
{"title":"Brain Tumor Detection in Conventional MR Images Based on Statistical Texture and Morphological Features","authors":"Manu Gupta, B. V. V. S. N. Rao, Venkateswaran Rajagopalan","doi":"10.1109/ICIT.2016.037","DOIUrl":"https://doi.org/10.1109/ICIT.2016.037","url":null,"abstract":"This paper presents a novel framework for brain tumor diagnosis and its grade classification based on higher order statistical texture features namely kurtosis and skewness along with selected morphological features. These features were extracted from segmented tumorous T2-weighted brain MR images, in order to distinguish high grade (HG) tumor from low grade (LG) tumor. Tumor classification is carried out using Support vector machine (SVM) classifier with k-fold crossvalidation. This work also compares the performance of the SVM with linear discriminant analysis (LDA) and Naives Bayes classifiers. Our proposed feature set achieved sensitivity, specificity and accuracy of 100% with SVM (linear kernel) while classifying brain tumor MR images as LG/HG.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"2011 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":"127369725","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}
引用次数: 18
A Novel Approach for Concealing Image by Utilizing the Concept of Secret Sharing Scheme and Steganography 利用秘密共享方案和隐写术的概念实现图像隐藏的新方法
2016 International Conference on Information Technology (ICIT) Pub Date : 2016-12-01 DOI: 10.1109/ICIT.2016.023
M. Rajput, Maroti Deshmukh, N. Nain
{"title":"A Novel Approach for Concealing Image by Utilizing the Concept of Secret Sharing Scheme and Steganography","authors":"M. Rajput, Maroti Deshmukh, N. Nain","doi":"10.1109/ICIT.2016.023","DOIUrl":"https://doi.org/10.1109/ICIT.2016.023","url":null,"abstract":"Data hiding is a process of concealing recognizable digital data into indiscernible form i.e. imperceptible to the human eye. Secret sharing with steganography is a hot topic of discussion. In this paper, we proposed a secure image hiding scheme to deceive attacker using the concept of steganography and secret sharing. As to recover secret image, we have to apply decryption technique at two levels. Decryption at first level is done on the concept of secret sharing scheme. At first level, n+1 shared image are generated by using n cover images and a secret image. By performing operations on these n+1 shared images, we get n recovered images and one stego image, this process is homologousto classic secret sharing scheme. As the method is alike to secret sharing scheme, it deceives attacker and leads him to fall into our trap. He can consider that n recover images to be output and follow his lead, which will end in the wrong direction. But to recover the secret image, the output data from level one have to undergo through level two. In level two, we used the concept of steganography. The input to the second step is n recovered cover images and one stego image. The experimental result shows the proposed scheme is highly secured at both the levels, altering with any n shares will not reveal any partial information. For checking the effectiveness of proposed scheme, Correlation, MSE and PSNR techniques are used. The proposed scheme efficiently works for grayscale and coloured images.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"46 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":"126276543","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}
引用次数: 9
Redundant Data Minimization Using Minimal Mean Distant Scalar Leader Selection for Event Driven Camera Actuation 基于最小平均距离标量前导选择的事件驱动相机驱动冗余数据最小化
2016 International Conference on Information Technology (ICIT) Pub Date : 2016-12-01 DOI: 10.1109/ICIT.2016.040
S. Priyadarshini, S. Panigrahi
{"title":"Redundant Data Minimization Using Minimal Mean Distant Scalar Leader Selection for Event Driven Camera Actuation","authors":"S. Priyadarshini, S. Panigrahi","doi":"10.1109/ICIT.2016.040","DOIUrl":"https://doi.org/10.1109/ICIT.2016.040","url":null,"abstract":"This article reports a novel scheme called minimal mean distant scalar leader selection inspired by event driven camera actuation for redundant data minimization. The proposed algorithm aims at actuating minimum number of cameras while maximizing the event area coverage and reducing the resulting traffic overhead. This is accomplished by effective selection of scalar leaders in each sub-region of the monitored region and the chosen scalar leaders operate as informants for event information communication to their respective camera sensors. The less camera actuation with enhanced coverage ratio, minimized redundancy ratio and reduced energy expenditure obtained from the experimentation reveal the effectiveness of the proposed algorithm as compared to three other recent approaches.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"28 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":"131174891","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}
引用次数: 4
Link Changes with Change in Demand in Flow Distribution Networks 随着流量分配网络需求的变化而发生的联系变化
2016 International Conference on Information Technology (ICIT) Pub Date : 2016-12-01 DOI: 10.1109/ICIT.2016.031
Vishal Gupta
{"title":"Link Changes with Change in Demand in Flow Distribution Networks","authors":"Vishal Gupta","doi":"10.1109/ICIT.2016.031","DOIUrl":"https://doi.org/10.1109/ICIT.2016.031","url":null,"abstract":"Water Distribution Networks (WDNs) are the foundation and backbone of any city. There maintenance and energy costs demand a significant amount of planning. Judicious scheduling operations can prompt significant savings in energy and prevent disruptions in supply and damages. Water passes through a great deal of system hubs (like pumps, valves, tanks, and so on) while moving from source (reservoir) to individual customers. Such system turn into an uncommon instance of packet switched network, and can be modeled based on networking theory. Similar to bandwidth of each network link, every link in a WDN has a fixed and predefined capacity. Given a source and destination node, there can be a specific estimation of most extreme stream of water which is possible between them. In this paper, our aim is to study the link changes in WDN. Depending upon the change in demand at the destination node, the proposed algorithms recommend optimal modifications in the connecting links of the existing network to increase the maximum possible flow.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","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":"130771846","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}
引用次数: 0
Text Summarization Using Sentiment Analysis for DUC Data 基于情感分析的DUC数据文本摘要
2016 International Conference on Information Technology (ICIT) Pub Date : 2016-12-01 DOI: 10.1109/ICIT.2016.054
Nidhika Yadav, N. Chatterjee
{"title":"Text Summarization Using Sentiment Analysis for DUC Data","authors":"Nidhika Yadav, N. Chatterjee","doi":"10.1109/ICIT.2016.054","DOIUrl":"https://doi.org/10.1109/ICIT.2016.054","url":null,"abstract":"Text Summarization is a way of determining the key concepts that are covered in the given text under consideration. Various techniques have been presented in literature and many are used in commercially available systems. The primary aim of the present work is to find efficacy of using sentiments for text summarization. In this work we present a computationally efficient technique based on sentiments of key words in text for the purpose of summarization. Sentiment analysis is already being used in various domains for analysis of large scale text data interpretation and opinion mining. The present work shows that sentiment analysis can also be used efficiently for the purpose of text summarization. We have tested our results on the standard DUC2002 datasets, and compared our results with different summarization approaches, viz. Random indexing based, LSA based, Graph based and Weighted graph based methods for different percentages of summarization. The proposed scheme is found to be efficient, in particular for 50% summarization.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","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":"124456672","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}
引用次数: 28
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信