Grid computing is an emerging computing paradigm that will have significant impact on the next generation information infrastructure. Due to the largeness and complexity of grid system, its quality of service, performance and reliability are difficult to model, analyze and evaluate. In real time evaluation, various noises will influence the model and which in turn accounts for increase in packet loss and Bit Error Rate (BER). Therefore, a novel optimization model for maximizing the expected grid service profit is mandatory. This paper presents the novel tree structured model, is better than other existing models for grid computing performance and reliability analysis by not only considering data dependence and failure correlations, but also takes link failure, packet loss & BER real time parameters in account. Based on this model, an algorithm for evaluating the grid service time distribution and the service reliability indices are suggested. The algorithm based on the Graph theory and Probability theory.
{"title":"Performance Optimization of Tree Structured Grid Services Considering Influence of Error Rate","authors":"U. S. Abudhagir, S. Shanmugavel","doi":"10.1109/ICIME.2009.60","DOIUrl":"https://doi.org/10.1109/ICIME.2009.60","url":null,"abstract":"Grid computing is an emerging computing paradigm that will have significant impact on the next generation information infrastructure. Due to the largeness and complexity of grid system, its quality of service, performance and reliability are difficult to model, analyze and evaluate. In real time evaluation, various noises will influence the model and which in turn accounts for increase in packet loss and Bit Error Rate (BER). Therefore, a novel optimization model for maximizing the expected grid service profit is mandatory. This paper presents the novel tree structured model, is better than other existing models for grid computing performance and reliability analysis by not only considering data dependence and failure correlations, but also takes link failure, packet loss & BER real time parameters in account. Based on this model, an algorithm for evaluating the grid service time distribution and the service reliability indices are suggested. The algorithm based on the Graph theory and Probability theory.","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":"115726683","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}
Martuza Ahmed, R. Pal, M. Hossain, Md. Abu Naser Bikas, A. B. M. Ruhunnabi
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.
{"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}
This paper presents the detailed account on the control design of a buck converter driven dc motor. Linear Quadratic Regulator (LQR) and Proportional-Integral (PI) are the techniques proposed in this investigation to control the speed of a dc motor. The dynamic system composed from converter/motor is considered in this investigation and derived in the state-space and transfer function forms. Complete design and analyses of simulation results for LQR and PI technique are presented in frequency domain and time domain. Performances of the controller are examined in terms of angular velocity, duty cycle input energy and armature current. Finally, a comparative assessment of the impact of each controller on the system performance is presented and discussed.
{"title":"Speed Control of Buck-converter Driven Dc Motor Using LQR and PI: A Comparative Assessment","authors":"R. Ismail, M. Ahmad, M. S. Ramli","doi":"10.1109/ICIME.2009.8","DOIUrl":"https://doi.org/10.1109/ICIME.2009.8","url":null,"abstract":"This paper presents the detailed account on the control design of a buck converter driven dc motor. Linear Quadratic Regulator (LQR) and Proportional-Integral (PI) are the techniques proposed in this investigation to control the speed of a dc motor. The dynamic system composed from converter/motor is considered in this investigation and derived in the state-space and transfer function forms. Complete design and analyses of simulation results for LQR and PI technique are presented in frequency domain and time domain. Performances of the controller are examined in terms of angular velocity, duty cycle input energy and armature current. Finally, a comparative assessment of the impact of each controller on the system performance is presented and discussed.","PeriodicalId":445284,"journal":{"name":"2009 International Conference on Information Management and Engineering","volume":"7 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":"115760585","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}
In this paper, we study the alterations in skin molecular structures bond vibrations due to contact with chemical detergents. The main goal of this study was to investigate the damage a chemical detergent may have on skin structures and to determine the main vulnerable part of the skin. In our approach, we use micro Raman Spectroscopy on chicken skin samples in situ and benefit from the Principle Component Analysis to automatically discriminate the normal and the damaged skin in different spectral regions associated with different structures of skin. Results suggest that this method can be useful for detecting the damaged part of the skin in an animal model.
{"title":"Applying Principle Component Analysis for Detecting Skin Damage Caused by Using Detergents: A Raman Spectroscopy Study","authors":"Neda Baheri, M. Baygi, R. Malekfar","doi":"10.1109/ICIME.2009.42","DOIUrl":"https://doi.org/10.1109/ICIME.2009.42","url":null,"abstract":"In this paper, we study the alterations in skin molecular structures bond vibrations due to contact with chemical detergents. The main goal of this study was to investigate the damage a chemical detergent may have on skin structures and to determine the main vulnerable part of the skin. In our approach, we use micro Raman Spectroscopy on chicken skin samples in situ and benefit from the Principle Component Analysis to automatically discriminate the normal and the damaged skin in different spectral regions associated with different structures of skin. Results suggest that this method can be useful for detecting the damaged part of the skin in an animal model.","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":"115776957","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}
M. F. Misman, S. Deris, S. Hashim, R. Jumali, M. S. Mohamad
In this review, we have discussed about approaches in pathway based microarray analysis. Commonly, there are two approaches in pathway based analysis, Enrichment Score and Supervised Machine Learning. These pathway based approaches usually aim to statistically define significant pathways that related to phenotypes of interest. Firstly we discussed an overview of pathway based microarray analysis and its general flow processes in scoring the pathways, the methods applied in both approaches, advantages and limitations based on current researches, and pathways database used in pathway analysis. This review aim to provide better understanding about pathway based microarray analysis and its approaches.
{"title":"Pathway-Based Microarray Analysis for Defining Statistical Significant Phenotype-Related Pathways: A Review of Common Approaches","authors":"M. F. Misman, S. Deris, S. Hashim, R. Jumali, M. S. Mohamad","doi":"10.1109/ICIME.2009.103","DOIUrl":"https://doi.org/10.1109/ICIME.2009.103","url":null,"abstract":"In this review, we have discussed about approaches in pathway based microarray analysis. Commonly, there are two approaches in pathway based analysis, Enrichment Score and Supervised Machine Learning. These pathway based approaches usually aim to statistically define significant pathways that related to phenotypes of interest. Firstly we discussed an overview of pathway based microarray analysis and its general flow processes in scoring the pathways, the methods applied in both approaches, advantages and limitations based on current researches, and pathways database used in pathway analysis. This review aim to provide better understanding about pathway based microarray analysis and its approaches.","PeriodicalId":445284,"journal":{"name":"2009 International Conference on Information Management and Engineering","volume":"38 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":"121476654","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}
Xiaoguo Wang, Jun Liu, Ming Tian, Yong Huang, Tieyong Cao, Xiongwei Zhang
A novel face feature extraction method based on Bilateral Two-dimensional Principal Component Analysis (B2DPCA) and Kernel Discriminant Analysis (KDA) was presented in this paper. In this method, B2DPCA method directly extracts the proper features from image matrices at first, then the KDA was performed on the features to enhance discriminant power. As opposed to PCA, B2DPCA is based on 2D image matrices rather than 1D vector so the image matrix does not need to be transformed into a vector prior to feature extraction. Experiments on ORL and Yale face database are performed to test and evaluate the proposed algorithm. The results demonstrate the effectiveness of proposed algorithm
{"title":"A Novel Face Feature Extraction Method Based on Two-dimensional Principal Component Analysis and Kernel Discriminant Analysis","authors":"Xiaoguo Wang, Jun Liu, Ming Tian, Yong Huang, Tieyong Cao, Xiongwei Zhang","doi":"10.1109/ICIME.2009.130","DOIUrl":"https://doi.org/10.1109/ICIME.2009.130","url":null,"abstract":"A novel face feature extraction method based on Bilateral Two-dimensional Principal Component Analysis (B2DPCA) and Kernel Discriminant Analysis (KDA) was presented in this paper. In this method, B2DPCA method directly extracts the proper features from image matrices at first, then the KDA was performed on the features to enhance discriminant power. As opposed to PCA, B2DPCA is based on 2D image matrices rather than 1D vector so the image matrix does not need to be transformed into a vector prior to feature extraction. Experiments on ORL and Yale face database are performed to test and evaluate the proposed algorithm. The results demonstrate the effectiveness of proposed algorithm","PeriodicalId":445284,"journal":{"name":"2009 International Conference on Information Management and Engineering","volume":"21 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":"122848877","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}
Yue Zhang, Jun Wang, Huifang Lv, Fan Jiang, Gang Chen
3D equipment operation simulation training system (3D-EOSTS) for solving difficult training problem is presented. System building based on 3D modeling can greatly improve the efficiency for the troop’s daily training. According to the equipment training requirement, the system architecture and functions are put forward. The whole system includes six simulators such as network simulator, headquarters communication system simulator, integrated communication platform simulator, weapon platform communication simulator, soldiers communication system simulator and virtual 3D training scene simulator. Key technology involving 3D modeling for equipment and terrain are also detailed, which adopts Multigen creator modeling the equipment geometry and adopts Vega Prime simulating the equipment operation action. Finally, framework based on soft engineering and simulation examples for some integrated communication vehicle platform are introduced.
{"title":"Research on 3D Equipment Operation Simulation Training System","authors":"Yue Zhang, Jun Wang, Huifang Lv, Fan Jiang, Gang Chen","doi":"10.1109/ICIME.2009.110","DOIUrl":"https://doi.org/10.1109/ICIME.2009.110","url":null,"abstract":"3D equipment operation simulation training system (3D-EOSTS) for solving difficult training problem is presented. System building based on 3D modeling can greatly improve the efficiency for the troop’s daily training. According to the equipment training requirement, the system architecture and functions are put forward. The whole system includes six simulators such as network simulator, headquarters communication system simulator, integrated communication platform simulator, weapon platform communication simulator, soldiers communication system simulator and virtual 3D training scene simulator. Key technology involving 3D modeling for equipment and terrain are also detailed, which adopts Multigen creator modeling the equipment geometry and adopts Vega Prime simulating the equipment operation action. Finally, framework based on soft engineering and simulation examples for some integrated communication vehicle platform are introduced.","PeriodicalId":445284,"journal":{"name":"2009 International Conference on Information Management and Engineering","volume":"10 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":"122751837","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}
Large amount of gene expression data obtained from Microarray technologies should be analyzed and interpreted in appropriate manner for the benefit of researchers. Using microarray techniques one can monitor the expressions levels of thousands of genes simultaneously. One challenging problem in gene expression analysis is to define the number of clusters. This can be done by some efficient clustering techniques; the Model Based Modified k-means method introduced in this paper could find the exact number of clusters and overcome the problems in the existing k-means clustering technique. Our experimental results show the efficiency of our method by calculating and comparing the sum of squares with different k values.
{"title":"Model Based Modified K-Means Clustering for Microarray Data","authors":"R. Suresh, K. Dinakaran, P. Valarmathie","doi":"10.1109/ICIME.2009.53","DOIUrl":"https://doi.org/10.1109/ICIME.2009.53","url":null,"abstract":"Large amount of gene expression data obtained from Microarray technologies should be analyzed and interpreted in appropriate manner for the benefit of researchers. Using microarray techniques one can monitor the expressions levels of thousands of genes simultaneously. One challenging problem in gene expression analysis is to define the number of clusters. This can be done by some efficient clustering techniques; the Model Based Modified k-means method introduced in this paper could find the exact number of clusters and overcome the problems in the existing k-means clustering technique. Our experimental results show the efficiency of our method by calculating and comparing the sum of squares with different k values.","PeriodicalId":445284,"journal":{"name":"2009 International Conference on Information Management and Engineering","volume":"45 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":"127185685","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}
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.
{"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}
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：