2009 International Conference on Information Management and Engineering最新文献_第9页

Performance Optimization of Tree Structured Grid Services Considering Influence of Error Rate 考虑错误率影响的树状网格服务性能优化

2009 International Conference on Information Management and Engineering Pub Date : 2009-04-03 DOI: 10.1109/ICIME.2009.60

U. S. Abudhagir, S. Shanmugavel

引用次数: 1

PIDS: A Packet Based Approach to Network Intrusion Detection and Prevention PIDS:一种基于分组的网络入侵检测和防御方法

2009 International Conference on Information Management and Engineering Pub Date : 2009-04-03 DOI: 10.1109/ICIME.2009.107

Martuza Ahmed, R. Pal, M. Hossain, Md. Abu Naser Bikas, A. B. M. Ruhunnabi

{"title":"PIDS: A Packet Based Approach to Network Intrusion Detection and Prevention","authors":"Martuza Ahmed, R. Pal, M. Hossain, Md. Abu Naser Bikas, A. B. M. Ruhunnabi","doi":"10.1109/ICIME.2009.107","DOIUrl":"https://doi.org/10.1109/ICIME.2009.107","url":null,"abstract":"Computer networks are one of those unique gifts of modern science which enriched human life with the blessing of global connectivity. But as the network advanced, intrusions and misuses followed. Consequently, network security has come into issue. Now-a-days intrusion detection systems have become a standard component in security infrastructures. Intrusions typically start with intruders infiltrating a network through a vulnerable host and after that approaching for further malicious attacks. The techniques used for intrusion detection have their particular limitations. Any of the Intrusion Detection Systems proposed so far is not completely flawless. And practically all of them require some kind of termination in network connections. So, the quest for betterment continues. In this progression, here we present PIDS: a complete intrusion detection system which reduces most of the problems contained by the previous systems and it doesn’t need to terminate any network connections to detect the intruder. This system generates quick responses against intrusions and stops the intruder to proceed for further attacks.","PeriodicalId":445284,"journal":{"name":"2009 International Conference on Information Management and Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115484426","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

Speed Control of Buck-converter Driven Dc Motor Using LQR and PI: A Comparative Assessment 基于LQR和PI的buck变换器驱动直流电动机速度控制的比较研究

2009 International Conference on Information Management and Engineering Pub Date : 2009-04-03 DOI: 10.1109/ICIME.2009.8

R. Ismail, M. Ahmad, M. S. Ramli

引用次数: 24

Applying Principle Component Analysis for Detecting Skin Damage Caused by Using Detergents: A Raman Spectroscopy Study 应用主成分分析检测洗涤剂引起的皮肤损伤:拉曼光谱研究

2009 International Conference on Information Management and Engineering Pub Date : 2009-04-03 DOI: 10.1109/ICIME.2009.42

Neda Baheri, M. Baygi, R. Malekfar

引用次数: 1

Pathway-Based Microarray Analysis for Defining Statistical Significant Phenotype-Related Pathways: A Review of Common Approaches 基于通路的微阵列分析用于定义统计学上显著的表型相关通路:对常用方法的回顾

2009 International Conference on Information Management and Engineering Pub Date : 2009-04-03 DOI: 10.1109/ICIME.2009.103

M. F. Misman, S. Deris, S. Hashim, R. Jumali, M. S. Mohamad

引用次数: 11

A Novel Face Feature Extraction Method Based on Two-dimensional Principal Component Analysis and Kernel Discriminant Analysis 基于二维主成分分析和核判别分析的人脸特征提取方法

2009 International Conference on Information Management and Engineering Pub Date : 2009-04-03 DOI: 10.1109/ICIME.2009.130

Xiaoguo Wang, Jun Liu, Ming Tian, Yong Huang, Tieyong Cao, Xiongwei Zhang

引用次数: 1

Research on 3D Equipment Operation Simulation Training System 三维装备操作模拟训练系统研究

2009 International Conference on Information Management and Engineering Pub Date : 2009-04-03 DOI: 10.1109/ICIME.2009.110

Yue Zhang, Jun Wang, Huifang Lv, Fan Jiang, Gang Chen

引用次数: 2

Model Based Modified K-Means Clustering for Microarray Data 基于改进k均值聚类模型的微阵列数据

2009 International Conference on Information Management and Engineering Pub Date : 2009-04-03 DOI: 10.1109/ICIME.2009.53

R. Suresh, K. Dinakaran, P. Valarmathie

引用次数: 23

Stable and Scalable Method Based on Application-Level for Improving Distributed Interactive Visual Applications' Performance 基于应用层的稳定可扩展分布式交互式可视化应用性能改进方法

2009 International Conference on Information Management and Engineering Pub Date : 2009-04-03 DOI: 10.1109/ICIME.2009.118

Genyuan Zhang, Zhao Lei

{"title":"Stable and Scalable Method Based on Application-Level for Improving Distributed Interactive Visual Applications' Performance","authors":"Genyuan Zhang, Zhao Lei","doi":"10.1109/ICIME.2009.118","DOIUrl":"https://doi.org/10.1109/ICIME.2009.118","url":null,"abstract":"virtual reality application such as second life and other multi-player game is a set of special Distributed Interactive Applications (DIAs), because a sender node forwards data to receivers due to their respective priorities. In general application level protocol is adopted to multicast: the significance-based directed minimum spanning tree was designed for these DIAs. In this paper we propose a novel application level algorithm: Quantificational Analysis and Prediction for Significance with directed minimum Spanning Tree (QAPSST), which can efficiently predict priorities for the receivers and quantize the predicted priorities to build a multicast distribution tree data structure. Furthermore, QAPSST can easily integrate the quantized significance into game environment and simplify significance deployment. Our significance-based directed minimum spanning tree has significance-efficient predict mechanism and the system consumes a tremendous amount of resource and still is stable and scalable when its size increases drastically. The experiment results show that QAPSST is able to efficiently make significance predict and keep system stable with huge amount of users.","PeriodicalId":445284,"journal":{"name":"2009 International Conference on Information Management and Engineering","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126210004","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

2009 International Conference on Information Management and Engineering Pub Date : 2009-04-03 DOI: 10.1109/ICIME.2009.12

F. Barbosa

{"title":"Similarity-based Retrieval in High Dimensional Data with Recursive Lists of Clusters: A Study Case with Natural Language Dictionaries","authors":"F. Barbosa","doi":"10.1109/ICIME.2009.12","DOIUrl":"https://doi.org/10.1109/ICIME.2009.12","url":null,"abstract":"An important issue in similarity-based retrieval in high dimensional data objects is the data representation. In order to use an indexing structure that can effectively handle large databases, it is essential to reduce the dimensionality of the data objects. The symbolic representation of the objects is a promising technique of dimension reduction, which allows researchers to avail from the area of text-retrieval algorithms and techniques. A similar searching engine consists in finding the objects similar to a given objects in some collection. Comparing the given object to every other object in a large database is prohibitively slow. If objects can be placed in a metric space, the search can be sped up by comparing the query object to a restricted number of objects, rather than the entire database. If the objects are strings (text) and a \"good\" metric to compare objects exists, we get a metric space. In order to have efficient similar searching in metric spaces, metric data structures are used. We evaluate the performance of range queries in the Recursive Lists of Clusters (RLC) metric data structure, when the metric spaces are Natural Language Dictionaries with the Extended Edit Distance (EED). The study compares RLC with Vp-Tree data structure in six different dictionaries, which are characterized according to the mean and the variance of the histograms of distances.The experimental results show that RLC has a good performance in all the tested cases and, in some of them it outperforms the Vp-tree data structure. In addition, RLC is the only data structure that always keeps its good performance, when the space dimension is lower or higher.","PeriodicalId":445284,"journal":{"name":"2009 International Conference on Information Management and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121538705","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