2011 International Conference on Recent Trends in Information Systems最新文献

筛选
英文 中文
Spectral analysis of DNA sequence using recursive weiner khinchine theorem: a comparative approach DNA序列的光谱分析使用递归weiner khinchine定理:比较方法
2011 International Conference on Recent Trends in Information Systems Pub Date : 2011-12-01 DOI: 10.1109/ReTIS.2011.6146888
M. Roy, S. Barman, S. Saha, A. Mandal
{"title":"Spectral analysis of DNA sequence using recursive weiner khinchine theorem: a comparative approach","authors":"M. Roy, S. Barman, S. Saha, A. Mandal","doi":"10.1109/ReTIS.2011.6146888","DOIUrl":"https://doi.org/10.1109/ReTIS.2011.6146888","url":null,"abstract":"Locating protein coding regions (exons) in Eukaryotes is one of the key problems of gene identification. The period-3 peaks observed in spectra of exons are often used as the landmark indicating existence of coding region in genes. Spectral Analysis by Discrete Fourier Transform (DFT) and filtering are popular methods adopted by various researchers from the field of Digital Signal Processing to accomplish this purpose. Many of the researchers have used Celegan gene as their sample database for exon prediction. Hence authors in this paper have identified F56F11.4a gene of Celegan Chromosome IE as their test database and have applied Recursive Weiner Khinchine Theorem (RWKT) for spectral analysis. On comparison it shows that results obtained by RWKT method gives better spectral resolution and clarity than DFT method.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116753290","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
A classification approach for myocardial infarction using voltage features extracted from four standard ECG leads 一种利用从四个标准心电图导联中提取的电压特征对心肌梗死进行分类的方法
2011 International Conference on Recent Trends in Information Systems Pub Date : 2011-12-01 DOI: 10.1109/ReTIS.2011.6146890
Swati Banerjee, M. Mitra
{"title":"A classification approach for myocardial infarction using voltage features extracted from four standard ECG leads","authors":"Swati Banerjee, M. Mitra","doi":"10.1109/ReTIS.2011.6146890","DOIUrl":"https://doi.org/10.1109/ReTIS.2011.6146890","url":null,"abstract":"This paper, deals with classification of Anteroseptal Myocardial Infarction and normal subjects. Multiresolution approach based extraction of diagnostic pathological features from V1–V4 chest leads is proposed. Mahalanobish distance based classification is used for classification and generation of discriminant function.The digitized ECG signals is subjected to DWT based denoising before applying feature extraction technique. A multiresolution approach along with an adaptive thresholding is used for the detection of R - peaks. Then Q, S peak, QRS onset and offset points are identified. Finally, the T wave is detected. By detecting the baseline of the ECG data, height of R, Q, S and T wave are calculated. Computed QRS vector and T wave amplitude are used for classification of the two classes. Mahalanobish distance based classification method is used for finding discrimant functions for leads V1–V4 and analysis is made accordingly. For R-peak detection, proposed algorithm yields sensitivity and positive predictivity of 99.8% and 99.7% respectively with MIT BIH Arrhythmia database, 99.84% and 99.98% respectively with PTB diagnostic ECG database. For time plane features, an average coefficient of variation of 3.21 is obtained over 150 leads tested from PTB data, each with 10000 samples. Classification accuracy for this method is 96.4%.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116218355","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}
引用次数: 10
An adaptive genetic key based neural encryption for online wireless communication (AGKNE) 基于自适应遗传密钥的在线无线通信神经加密
2011 International Conference on Recent Trends in Information Systems Pub Date : 2011-12-01 DOI: 10.1109/ReTIS.2011.6146841
J. K. Mandal, Arindam Sarkar
{"title":"An adaptive genetic key based neural encryption for online wireless communication (AGKNE)","authors":"J. K. Mandal, Arindam Sarkar","doi":"10.1109/ReTIS.2011.6146841","DOIUrl":"https://doi.org/10.1109/ReTIS.2011.6146841","url":null,"abstract":"In this paper, a genetic secret key based technique for neural encryption (AGKNE) has been proposed for online transmission of data/information in wireless communication. In this method both the communicating party receive the similar input vector, generate an output bit and are trained based on the output bit. Length of the key depends on the number of input and output neurons. Synchronized identical weight vectors are used to create chromosomes pool. Genetic secret key is generated on calculating the fitness function, which is the hamming distance between two chromosomes. GA operators like crossover and mutation are also used to add elitism of chromosomes. Plain stream passes through recursive modulo 2-substitution operation to generate intermediate cipher which is again encrypted using neuro genetic key to form the 2nd level cipher stream. Finally, chaining and cascaded xoring of neural key with the identical length intermediate cipher text is done to generate the cipher. Receiver will use identical neural weight secret key for performing deciphering process for generating the neuro genetic encrypted cipher text and secret key for decoding. Finally modulo-2 secret key uses to generate plain text. A session key based transmission has also been proposed using 161-bit key format of 14 different segments [7]. Parametric tests are done and results are compared in terms of Chi-Square test, response time in transmission with some existing classical techniques, which shows comparable results for the proposed system.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126335012","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
Efficient Algorithm on heterogeneous computing system 异构计算系统的高效算法
2011 International Conference on Recent Trends in Information Systems Pub Date : 2011-12-01 DOI: 10.1109/ReTIS.2011.6146840
S. Bansal, C. Hota
{"title":"Efficient Algorithm on heterogeneous computing system","authors":"S. Bansal, C. Hota","doi":"10.1109/ReTIS.2011.6146840","DOIUrl":"https://doi.org/10.1109/ReTIS.2011.6146840","url":null,"abstract":"Distributed task scheduling in a heterogeneous computing environment is one of the most challenging problems. The optimally mapping of independent tasks onto heterogeneous distributed computing systems is known to be NP-complete. The most common objective function of a distributed task scheduling problem is to reduce the make span and increase the load balancing across the machines. In this paper, we introduce a new scheduling algorithm called, Efficient Algorithm on Heterogeneous Computing System (EAHCS) which balances the load well across the machines and reduces the make span time. In our evaluation study, a number of experiments with various simulation settings have been conducted. The results obtained using the proposed heuristic improves over the existing approaches.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128159886","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}
引用次数: 7
A fuzzy multilayer perceptron network based detection and classification of lobar intra-cerebral hemorrhage from Computed Tomography images of brain 基于模糊多层感知器网络的脑ct图像中脑叶性脑出血的检测与分类
2011 International Conference on Recent Trends in Information Systems Pub Date : 2011-12-01 DOI: 10.1109/ReTIS.2011.6146878
A. Datta, Ashis Datta, Biswajit Biswas
{"title":"A fuzzy multilayer perceptron network based detection and classification of lobar intra-cerebral hemorrhage from Computed Tomography images of brain","authors":"A. Datta, Ashis Datta, Biswajit Biswas","doi":"10.1109/ReTIS.2011.6146878","DOIUrl":"https://doi.org/10.1109/ReTIS.2011.6146878","url":null,"abstract":"Medical imaging techniques and analysis tools like Computed Tomography (CT) enable the doctors and radiologists to identify as well as diagnose various disorders in internal structures. In this paper, fuzzy multilayer perceptron network based algorithm used for segmentation and region classification and region severance algorithm is used for detection and location of Intra-cerebral hemorrhage. According to location different types of lobar Intra-cerebral hemorrhages are classified. Experimental visualization results are presented which were computed on real intra-cerebral hemorrhage patient brain data. The objective of this paper is to propose a method to assist the radiologists in identifying the different type of lobar Intracerebral hemorrhage and to arrive at a decision faster and accurate.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121628677","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}
引用次数: 5
Swarm Intelligence based greedy routing protocol for Wireless Sensor Network 基于群智能的无线传感器网络贪婪路由协议
2011 International Conference on Recent Trends in Information Systems Pub Date : 2011-12-01 DOI: 10.1109/ReTIS.2011.6146856
Satish Pradhan, S. Maharana, M. Reza
{"title":"Swarm Intelligence based greedy routing protocol for Wireless Sensor Network","authors":"Satish Pradhan, S. Maharana, M. Reza","doi":"10.1109/ReTIS.2011.6146856","DOIUrl":"https://doi.org/10.1109/ReTIS.2011.6146856","url":null,"abstract":"Energy consumption is a very crucial aspect in Wireless Sensor Network. In recent years many techniques have been proposed and explored for optimization of energy in Wireless Sensor Network. But routing is a very crucial parameter for energy optimization. So in this paper we present a very simple energy aware routing protocol which can prolong the life time of the wireless sensor network, which can be used even for communication between cluster head and base station. This paper is inspired by the work in the field of Swarm Intelligence. The basic idea is taking less number of hops and hence saving the energy wastage of more number of nodes and choosing the best path taking into consideration the nodes which have more energy or less pheromone as next hop there by avoid premature exhausting of some nodes. The proposed idea is better than finding the shortest path algorithm or directed diffusion algorithm as the proposed idea also take less hops and increases the lifetime of network.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"514 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133159177","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
Online Mining of data to generate association rule mining in large databases 在线挖掘数据,在大型数据库中生成关联规则挖掘
2011 International Conference on Recent Trends in Information Systems Pub Date : 2011-12-01 DOI: 10.1109/ReTIS.2011.6146853
Archana Singh, Megha Chaudhary, A. Rana, Gaurav Dubey
{"title":"Online Mining of data to generate association rule mining in large databases","authors":"Archana Singh, Megha Chaudhary, A. Rana, Gaurav Dubey","doi":"10.1109/ReTIS.2011.6146853","DOIUrl":"https://doi.org/10.1109/ReTIS.2011.6146853","url":null,"abstract":"Data Mining is a Technology to explore data, analyze the data and finally discovering patterns from large data repository. In this paper, the problem of online mining of association rules in large databases is discussed. Online association rule mining can be applied which helps to remove redundant rules and helps in compact representation of rules for user. In this paper, a new and more optimized algorithm has been proposed for online rule generation. The advantage of this algorithm is that the graph generated in our algorithm has less edge as compared to the lattice used in the existing algorithm. The Proposed algorithm generates all the essential rules also and no rule is missing. The use of non redundant association rules help significantly in the reduction of irrelevant noise in the data mining process. This graph theoretic approach, called adjacency lattice is crucial for online mining of data. The adjacency lattice could be stored either in main memory or secondary memory. The idea of adjacency lattice is to pre store a number of large item sets in special format which reduces disc I/O required in performing the query.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116458551","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}
引用次数: 33
Intentional islanding of electric power systems in a grid computing framework: A graph-theoretic approach 网格计算框架中电力系统的有意孤岛:图论方法
2011 International Conference on Recent Trends in Information Systems Pub Date : 2011-12-01 DOI: 10.1109/ReTIS.2011.6146859
B. Pradhan, K. Reddy, D. S. Roy, D. Mohanta
{"title":"Intentional islanding of electric power systems in a grid computing framework: A graph-theoretic approach","authors":"B. Pradhan, K. Reddy, D. S. Roy, D. Mohanta","doi":"10.1109/ReTIS.2011.6146859","DOIUrl":"https://doi.org/10.1109/ReTIS.2011.6146859","url":null,"abstract":"Incorporation of deregulation and increase in renewable sources of generation has changed the nature of existing electric power systems to a more geographically distributed system. This had led to significant challenges towards on-line monitoring and control. Contingency set identification is an essential step in monitoring the power system security level since outage of a few among the combinatorially huge number of power distribution lines can lead to a catastrophe, even blackouts. Intentional islanding is a counter approach. The most critical criterion in intentional islanding is to minimize the real power imbalance within the islands to benefit subsequent restoration. Grid computing is being seen as a viable solution to cater to the changing needs of data-intensive computing, including monitoring and control of power systems. In this paper, a grid service for intentional islanding for power systems protection has been developed and demonstrated on a test bed using IEEE 30 bus test system as a case study. Grid gain 2.0 has been employed as middleware to setup the test bed.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122125188","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}
引用次数: 8
An improved fuzzy clustering method using modified Fukuyama-Sugeno cluster validity index 基于改进Fukuyama-Sugeno聚类效度指标的改进模糊聚类方法
2011 International Conference on Recent Trends in Information Systems Pub Date : 2011-12-01 DOI: 10.1109/ReTIS.2011.6146880
Sailik Sengupta, Soham De, A. Konar, R. Janarthanan
{"title":"An improved fuzzy clustering method using modified Fukuyama-Sugeno cluster validity index","authors":"Sailik Sengupta, Soham De, A. Konar, R. Janarthanan","doi":"10.1109/ReTIS.2011.6146880","DOIUrl":"https://doi.org/10.1109/ReTIS.2011.6146880","url":null,"abstract":"The objective of clustering algorithms is to group similar patterns in one class and dissimilar patterns in disjoint classes. This article proposes a novel algorithm for fuzzy partitional clustering with an aim to minimize a composite objective function, defined using the Fukuyama-Sugeno cluster validity index. The optimization of this objective function tries to minimize the separation between clusters of a data set and maximize the compactness of a certain cluster. But in certain cases, such as a data set having overlapping clusters, this approach leads to poor clustering results. Thus we introduce a new parameter in the objective function which enables us to yield more accurate clustering results. The algorithm has been validated with some artificial and real world datasets.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117248577","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}
引用次数: 7
Sensor node deployment using Bacterial Foraging Optimization 基于细菌觅食优化的传感器节点部署
2011 International Conference on Recent Trends in Information Systems Pub Date : 2011-12-01 DOI: 10.1109/ReTIS.2011.6146843
G. S. Gaba, Kanwaljit Singh, B. S. Dhaliwal
{"title":"Sensor node deployment using Bacterial Foraging Optimization","authors":"G. S. Gaba, Kanwaljit Singh, B. S. Dhaliwal","doi":"10.1109/ReTIS.2011.6146843","DOIUrl":"https://doi.org/10.1109/ReTIS.2011.6146843","url":null,"abstract":"The prime objective behind optimized sensor deployment is to reduce sensing range of a sensor node. Proper positioning of sensor nodes leads to increased lifetime, better coverage and more connectivity among nodes. In this paper, the sensor deployment problem has been considered as a clustered approach and the solution to the optimal co-ordinates of the sensor deployment has been obtained using Bacterial Foraging Optimization.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129473277","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
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学术文献互助群
群 号:604180095
Book学术官方微信