2013 International Conference on Machine Intelligence and Research Advancement最新文献

Phrase Ranking and Wikipedia Based Cluster Labeling 短语排序和基于维基百科的聚类标注

2013 International Conference on Machine Intelligence and Research Advancement Pub Date : 2013-12-01 DOI: 10.1109/ICMIRA.2013.44

Pradyumna Reddy Chinthala

引用次数: 0

Review of Routing Metrics for Wireless Mesh Networks 无线网状网络路由度量研究综述

2013 International Conference on Machine Intelligence and Research Advancement Pub Date : 2013-12-01 DOI: 10.1109/ICMIRA.2013.16

D. Karia, Anuradha Jadiya, Ritesh Kapuskar

引用次数: 4

Selecting Classifiers for Medical Data Analysis 为医疗数据分析选择分类器

2013 International Conference on Machine Intelligence and Research Advancement Pub Date : 2013-12-01 DOI: 10.1109/ICMIRA.2013.60

Deepa Abin, M. Potey

引用次数: 0

Adaptive Handoff Technique for Next-Generation Wireless System 下一代无线系统的自适应切换技术

2013 International Conference on Machine Intelligence and Research Advancement Pub Date : 2013-12-01 DOI: 10.1109/ICMIRA.2013.104

M. Mohanty, L. Patnaik

引用次数: 0

Distinguishing DDoS Attack from Flash Event Using Real-World Datasets with Entropy as an Evaluation Metric 用熵作为评价指标的真实世界数据集区分DDoS攻击和Flash事件

2013 International Conference on Machine Intelligence and Research Advancement Pub Date : 2013-12-01 DOI: 10.1109/ICMIRA.2013.24

D. Mahajan, M. Sachdeva

引用次数: 2

Sequential Sequence Mining Technique in Large Database 大型数据库中的顺序序列挖掘技术

2013 International Conference on Machine Intelligence and Research Advancement Pub Date : 2013-12-01 DOI: 10.1109/ICMIRA.2013.61

Kiran R. Amin, J. S. Shah

引用次数: 0

Novel High Gain Low Noise CMOS Instrumentation Amplifier for Biomedical Applications 生物医学用新型高增益低噪声CMOS仪器放大器

2013 International Conference on Machine Intelligence and Research Advancement Pub Date : 2013-12-01 DOI: 10.1109/ICMIRA.2013.83

Akshay Goel, Gurmohan Singh

{"title":"Novel High Gain Low Noise CMOS Instrumentation Amplifier for Biomedical Applications","authors":"Akshay Goel, Gurmohan Singh","doi":"10.1109/ICMIRA.2013.83","DOIUrl":"https://doi.org/10.1109/ICMIRA.2013.83","url":null,"abstract":"This work describes a novel technique of designing a high gain low noise CMOS instrumentation amplifier for biomedical applications like ECG signal processing. A three opamp instrumentation amplifier have been designed by using two simple op-amps at the two input stages and a folded cascode opamp at the output stage. Both op-amps at the input and output are 2-stage. Most of the previous or earlier designed op-amp in literature uses same type of op-amp at the input and output stages of instrumentation amplifier. By using folded cascode op-amp at the output, we had achieved significant improvement in gain and CMRR. Transistors sizing plays a major role in achieving high gain and CMRR. To achieve a desirable common mode rejection ratio (CMRR), Gain and other performance metrics, selection of most appropriable op-amp circuit topologies & optimum transistor sizing was the main criteria for designing of instrumentation amplifier for biomedical applications. The complete instrumentation amplifier design is simulated using Cadence Spectre tool and layout is designed and simulated in Cadence Layout editor at 0.18μm CMOS technology. Each of the input two stage op-amp provides a gain and CMRR of 45dB and 72dB respectively. The output two stage folded cascode amplifier provides a CMRR of 92dB and a gain of 82dB. The design achieves an overall CMRR and gain of 92dB and 67db respectively. The overall power consumed by instrumentation amplifier is 263μW which is suitable for biomedical signal processing applications.","PeriodicalId":185493,"journal":{"name":"2013 International Conference on Machine Intelligence and Research Advancement","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124138717","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

A New and Efficient Approach Based on Binary Decision Diagram to Evaluate the K-terminal Reliability of Distributed Networks 基于二元决策图的分布式网络k端可靠性评估新方法

2013 International Conference on Machine Intelligence and Research Advancement Pub Date : 2013-12-01 DOI: 10.1109/ICMIRA.2013.120

D. Panda, R. Dash

{"title":"A New and Efficient Approach Based on Binary Decision Diagram to Evaluate the K-terminal Reliability of Distributed Networks","authors":"D. Panda, R. Dash","doi":"10.1109/ICMIRA.2013.120","DOIUrl":"https://doi.org/10.1109/ICMIRA.2013.120","url":null,"abstract":"This paper presents a new and efficient method based on binary decision diagram(BDD) to evaluate the K-terminal reliability of the distributed networks. Here the distributed network is modeled as a probabilistic graph G(V, E), where V is vertex set and E is the edge set. Two basic operation viz. contraction and deletion are used to make partitions the initial graph into the sub graphs. An efficient algorithm is proposed to make such partitions. Each partition is labeled by a partition string. Each of such partition string is inserted into a hash table in order to avoid duplicity. As the size of Binary Decision Diagram (BDD) is largely dependent on its ordering an efficient variable ordering is proposed. The Binary Decision Diagram(BDD) is constructed from the different partitions of the initial graph/sub graphs. In the algorithm only those partition of the graph/ sub graph are used for constructing the BDD that have no duplicity by using this variable ordering which is assured by searching the hash table. As in a BDD all the paths from the root to the leaves are disjoints, the probability of K-terminal connectivity is computed by traversing the BDD using Breadth first Search (BFS) method. For this computation of K-terminal reliability another algorithm is proposed which recursively compute the k-terminal reliability of the graph. The proposed method is well illustrated by taking a suitable example. The reliability of some important distributed networks such as Hypercube(HC), Twisted Hypercube(THC), Crossed cube(CC), Mesh, Torus are evaluated by the proposed method.","PeriodicalId":185493,"journal":{"name":"2013 International Conference on Machine Intelligence and Research Advancement","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127665029","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 Efficient Prediction Based on Web User Simulation Approach Using Modified Ant Optimization Model and Hierarchical Clustering 基于改进蚁群优化模型和层次聚类的Web用户仿真高效预测方法

2013 International Conference on Machine Intelligence and Research Advancement Pub Date : 2013-12-01 DOI: 10.1109/ICMIRA.2013.43

Shailendra Srivastava, Abhishek Mathur

{"title":"An Efficient Prediction Based on Web User Simulation Approach Using Modified Ant Optimization Model and Hierarchical Clustering","authors":"Shailendra Srivastava, Abhishek Mathur","doi":"10.1109/ICMIRA.2013.43","DOIUrl":"https://doi.org/10.1109/ICMIRA.2013.43","url":null,"abstract":"Ant colony algorithms (ACA) are to solve difficult optimization problems, such as the traveling salesman, and have since been extended to solve many discrete optimization problems. ACA are derived from the process by which ant colonies find the shortest route. Here an ant colony optimization based algorithm to predict web usage patterns is presented. Our methodology incorporates content, structure as well as web usage data. Ants learn from the clustered real Web user data subsequently, trained ants are released onto a new web graph and the new artificial sessions are compared with real sessions, previously captured via web log processing. The main results of this work are related to an effective prediction of the aggregated patterns of real usage, which reaching near about 87%. Moreover, this approach obtains a quantitative representation of the keywords from the content data that influence the sessions. The proposed work and innovative research is on the basis of the improved next node election, through which we get an improvement in basis ant learning behavior algorithm. This modified ant behavior learning algorithm predicts a larger matching sequence size of real website user sessions along with increased learning rate of the software agents that means most of the ants reach to the uppermost threshold most of the time which directly turns into increased prediction correct rate.","PeriodicalId":185493,"journal":{"name":"2013 International Conference on Machine Intelligence and Research Advancement","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126374434","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

Adaptive & Discrete Real Bat Algorithms for Route Search Optimization of Graph Based Road Network 自适应,基于图的道路网络路径搜索优化的离散Real Bat算法

2013 International Conference on Machine Intelligence and Research Advancement Pub Date : 2013-12-01 DOI: 10.1109/ICMIRA.2013.30

C. Sur, A. Shukla

{"title":"Adaptive & Discrete Real Bat Algorithms for Route Search Optimization of Graph Based Road Network","authors":"C. Sur, A. Shukla","doi":"10.1109/ICMIRA.2013.30","DOIUrl":"https://doi.org/10.1109/ICMIRA.2013.30","url":null,"abstract":"Bat Algorithm (BA) has recently emerged as an efficient nature inspired meta-heuristics due to its added parameters and searching features. In this paper modified versions of discrete bat algorithm is being proposed for the first time which will suit the discrete domain problems. Here the BA has utilized the famous three variable dependent Weibull Cumulative Distribution Function as Weibull Coded Binary Bat Algorithm (WCBBA), another as Real Bat Algorithm (RBA) and the third as the hybrid of the two, for search process with its modeling according to a road network management system where it is being tried to optimize the travel route and produce a vehicle load balancing structure of the network through optimized path establishment. In bat algorithm apart from the search criteria where the virtual bats move, they also utilize their Echolocation property for further investigation of the search space for prey. This makes the heuristic more probabilistic, dynamic and adaptive and the bats can reach a better solution through continuous analysis and exploration. Here the bat algorithm is modeled to handle a multi-objective optimization model where each bat tries to optimize its own route criteria or rather tries to find its liking prey. The enhanced search criteria of bats helps in reducing the number of bats for the search process, but as the Echolocation process spreads out it increases the complexity of the search process that is parallelism is traded off with complexity. The results show that the algorithm has potential for better results and has been compared with the converging rate of Ant Colony Optimization (ACO) & Intelligent Water Drops (IWD) algorithms.","PeriodicalId":185493,"journal":{"name":"2013 International Conference on Machine Intelligence and Research Advancement","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122261792","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