2012 Third International Conference on Emerging Applications of Information Technology最新文献

筛选
英文 中文
Automated detection of apnea and hypopnea events 自动检测呼吸暂停和低呼吸事件
B. Koley, D. Dey
{"title":"Automated detection of apnea and hypopnea events","authors":"B. Koley, D. Dey","doi":"10.1109/EAIT.2012.6407868","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407868","url":null,"abstract":"This paper presents an automatic method for detection of apnea and hypopnea events occurred during sleep from the single channel recording of oronasal airflow signal. For the identification of events, three time domain measures were extracted from each of the overlapping short segment windows of respiration signal. The feature set includes area, upper 90th percentile and variance, which were used to characterize changes in the airflow signal during normal and abnormal breathing events (i.e., apnea, hypopnea). An ensemble of three binary Support Vector Machine (SVM) based classifiers arranged in one-against-all strategy, were used to classify the feature vector among three categories, according to its origin from some breathing events like normal, apnea and hypopnea. The consecutive decisions of classifier model on time sequenced consecutive overlapped windows were combined by some heuristic rules to identify abnormal breathing events from normal breathings. In this study, 14 polysomnography (PSG) recordings diagnosed as obstructive sleep apnea syndrome were analyzed. Independent test was performed on 6 recordings. The cross-validation and independent test accuracies of apneic event detection were found to be 93.3% and 92.8%, respectively. For hypopnea event these two accuracies were 90.1% and 89.6%. The proposed system can be used for home based monitoring of suspected apneic subject, and can count total number of apnea and hypopnea events occurred during sleep.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131177381","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}
引用次数: 17
Modified Roaming Optimization for multi-modal optima 多模态优化的改进漫游优化
C. Jada, H. Yenala, K. K. Rachavarapu, N. K. Chittipolu, S. Omkar
{"title":"Modified Roaming Optimization for multi-modal optima","authors":"C. Jada, H. Yenala, K. K. Rachavarapu, N. K. Chittipolu, S. Omkar","doi":"10.1109/EAIT.2012.6407861","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407861","url":null,"abstract":"This paper explains the algorithm of Modified Roaming Optimization (MRO) for capturing the multiple optima for multimodal functions. There are some similarities between the Roaming Optimization (RO) and MRO algorithms, but the MRO algorithm is created to overcome the problems facing while applying the RO to the problems possessing large number of solutions. The MRO mainly uses the concept of density to overcome the challenges posed by RO. The algorithm is tested with standard test functions and also discussions are made to improve the efficacy of the MRO algorithm. This paper also gives the results of MRO applied for solving Inverse Kinematics (IK) problem for SCARA and PUMA robots.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134079092","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
High-speed comparator architectures for fast binary comparison 用于快速二进制比较的高速比较器架构
S. Deb, S. Chaudhury
{"title":"High-speed comparator architectures for fast binary comparison","authors":"S. Deb, S. Chaudhury","doi":"10.1109/EAIT.2012.6408016","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6408016","url":null,"abstract":"This paper proposes the design of digital comparator with two different parallel architectures. These comparators are first realized in Verilog and simulated with Xilinx ISE 8.2i platform and then compared with the traditional design. Simulation results show that the first proposed architecture has 23.769 % less combinational delay (logic + interconnect) and the second proposed architecture is even much faster and has a combinational delay of 35.218 % less compared to the traditional design.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114056296","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
A formal approach to information security metrics 信息安全度量的正式方法
A. Chakraborty, A. Sengupta, C. Mazumdar
{"title":"A formal approach to information security metrics","authors":"A. Chakraborty, A. Sengupta, C. Mazumdar","doi":"10.1109/EAIT.2012.6408003","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6408003","url":null,"abstract":"Automation of Enterprise Information Systems has resulted in several information security issues. There is a need to devise ways of measuring information security. Existing techniques mostly concentrate on finding ways of measuring specific attributes of security devices. This paper is an initial step towards the development of a formal methodology for measuring enterprise information system security. The proposed technique may also be used to compare the relative security of information systems.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123573856","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
Mention detection and classification in bio-chemical domain using Conditional Random Field 提出了生化领域中条件随机场的检测与分类方法
Asif Ekbal, S. Saha, K. Ravi
{"title":"Mention detection and classification in bio-chemical domain using Conditional Random Field","authors":"Asif Ekbal, S. Saha, K. Ravi","doi":"10.1109/EAIT.2012.6407943","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407943","url":null,"abstract":"Finding mentions of chemical names in texts is of huge interest due to its importance in wide-spread application areas. The inherent complex structures of chemical names and the existence of several representations and nomenclatures (like SMILES, InChI, IUPAC) pose a big challenge to their automatic identification and classification. In this paper we present a supervised machine learning approach based on Conditional Random Fields (CRF) to find mentions of IUPAC and IUPAC-like names in scientific text. We identify and implement a very rich feature set for the task without using any domain specific knowledge and/or resources. Experiments are carried out on the benchmark MEDLINE datasets. Evaluation shows encouraging performance with the overall recall, precision and F-measure values of 90.96%, 91.52% and 91.23%, respectively. We also present the scope of comparison to the existing state-of-the-art system(s).","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123828019","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
An environment monitoring interface using GRASS GIS and Python 一个使用GRASS GIS和Python的环境监测界面
A. De Sarkar, N. Biyahut, S. Kritika, N. Singh
{"title":"An environment monitoring interface using GRASS GIS and Python","authors":"A. De Sarkar, N. Biyahut, S. Kritika, N. Singh","doi":"10.1109/EAIT.2012.6407912","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407912","url":null,"abstract":"The environment is an essential element of every living as well as non living thing. In order to save environment, monitoring is necessary at regular interval. Continuous monitored data of any specific region need to be analyzed for further reference. It would be constructive and helpful if visualization can be done through geographic information system (GIS) along with the map of the region. This paper proposes an interface of constant environment monitoring of a region using Python programming language in GRASS GIS. The major objective of this paper is to access GRASS map using Python script without starting GRASS from the outside. This interface is capable of displaying stored data from the database for each deployed sensor, as well as its neighboring sensors. Previously deployed sensors can be moved on the basis of coordinate (latitude and longitude) and this movement can be shown through this interface at runtime.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126442362","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
A new self-tuning fuzzy proportional-derivative controller for high-order systems 一种新的高阶系统自整定模糊比例导数控制器
R. Mudi, R. R. De (Maity)
{"title":"A new self-tuning fuzzy proportional-derivative controller for high-order systems","authors":"R. Mudi, R. R. De (Maity)","doi":"10.1109/EAIT.2012.6407853","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407853","url":null,"abstract":"This study presents a new self-tuning fuzzy proportional-derivative controller (NST-FPDC) with real-time adjustment of its output scaling factor (SF). Here, a simple heuristic rule is defined on the normalized change of error of the controlled variable in order to make continuous variation in the close-loop gain. The proposed NST-FPDC is tested on a number of non-linear, unstable, and integrating high-order systems under set-point change as well as load disturbance. Effectiveness of NST-FPDC is established through detailed performance comparison with a well known robust self-tuning FLC reported in the leading literature.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129296331","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
Study of inter-session variability of long term memory and complexity of EEG signals 长时记忆的会话间变异性与脑电信号复杂性研究
S. Chatterjee, S. Bhattacharyya, A. Khasnobish, A. Konar, D. Tibarewala, R. Janarthanan
{"title":"Study of inter-session variability of long term memory and complexity of EEG signals","authors":"S. Chatterjee, S. Bhattacharyya, A. Khasnobish, A. Konar, D. Tibarewala, R. Janarthanan","doi":"10.1109/EAIT.2012.6407873","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407873","url":null,"abstract":"Hurst exponent is used to evaluate the presence or absence of long-range dependence and its degree in a time series, and hence is known as the long term memory of the time series. Fractal Dimension on the other hand is a measure of data complexity. Hurst Exponent and Fractal Dimension were used as features for nonlinear classification by QDA and SVM with a polynomial kernel of order 3. Since both Hurst Exponent and Fractal Dimension has a large inter individual variability, we used these features of consecutive sessions to study the intersession variability of classification accuracy of the proposed classifiers. QDA provided better classification for the trials trained by motor execution, while SVM with the polynomial kernel differentiated better when the training was done by motor imagery data.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130172391","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
Materialized view construction using linear regression on attributes 在属性上使用线性回归的物化视图构造
P. Ghosh, S. Sen, N. Chaki
{"title":"Materialized view construction using linear regression on attributes","authors":"P. Ghosh, S. Sen, N. Chaki","doi":"10.1109/EAIT.2012.6407899","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407899","url":null,"abstract":"Materialized view creation is an important aspect for large data centric applications. Materialized views create an abstraction over the actual database tables to the users. Users are not aware about the existence of these materialized views. However, these help in faster execution of query. Materialized views should contain the data that users are currently accessing, and possibly those that would be accessed in near future. Availability of the user-requested data in a materialized view indicates the efficacy of the materialized view creation process. A review of the existing research work reveals a gap in analyzing the inter-attribute affinity while creating the materialized views. This paper proposes a new methodology for materialized view creation by quantifying the association among the independent data attributes. This is done based on the usage of different attributes in the recently executed set of queries. Statistical analysis on existing query set help to predict the attributes likely to be used for future queries. The materialized views are generated accordingly.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122264254","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
Region selection in handwritten character recognition using Artificial Bee Colony Optimization 基于人工蜂群优化的手写字符识别区域选择
A. Roy, N. Das, R. Sarkar, S. Basu, M. Kundu, M. Nasipuri
{"title":"Region selection in handwritten character recognition using Artificial Bee Colony Optimization","authors":"A. Roy, N. Das, R. Sarkar, S. Basu, M. Kundu, M. Nasipuri","doi":"10.1109/EAIT.2012.6407891","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407891","url":null,"abstract":"Detection of local regions with optimal discriminating information from a sample of handwritten character image is one of the most challenging tasks to the pattern recognition community. In order to identify such regions, the idea of Artificial Bee Colony Optimization has been utilized in the present work. The technique is evaluated to pin point the set of local regions offering optimal discriminating feature set for handwritten numeral and character recognition. Initially, 8 directional gradient features are extracted from every region of different levels of partitions created using a CG based Quad Tree partitioning approach. Then, using the present approach, at each level, sampling process is done based on support Vector Machine (SVM) in every single region. Applying the technique we have gained 33%, 14%, 9%, 19%interms of region reduction and 0.2%, 0.4%, 0%, 1.6% in terms of recognition for Arabic, Hindi, Telugu numerals and Bangla Basic character datasets respectively. Though the success rate has not improved significantly for all the datasets, sizable amount of reduction in regions has occurred for every dataset using the present technique. Thus the cost and time of feature extraction is reduced significantly without dropping the general recognition rate.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126949295","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}
引用次数: 20
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学术官方微信