In this paper, Probabilistic Neural Network with image and data processing techniques was employed to implement an automated brain tumor classification. The conventional method for medical resonance brain images classification and tumors detection is by human inspection. Operator-assisted classification methods are impractical for large amounts of data and are also non-reproducible. Medical Resonance images contain a noise caused by operator performance which can lead to serious inaccuracies classification. The use of artificial intelligent techniques for instant, neural networks, and fuzzy logic shown great potential in this field. Hence, in this paper the Probabilistic Neural Network was applied for the purposes. Decision making was performed in two stages: feature extraction using the principal component analysis and the Probabilistic Neural Network (PNN). The performance of the PNN classifier was evaluated in terms of training performance and classification accuracies. Probabilistic Neural Network gives fast and accurate classification and is a promising tool for classification of the tumors.
{"title":"Probabilistic Neural Network for Brain Tumor Classification","authors":"M. Othman, M. Basri","doi":"10.1109/ISMS.2011.32","DOIUrl":"https://doi.org/10.1109/ISMS.2011.32","url":null,"abstract":"In this paper, Probabilistic Neural Network with image and data processing techniques was employed to implement an automated brain tumor classification. The conventional method for medical resonance brain images classification and tumors detection is by human inspection. Operator-assisted classification methods are impractical for large amounts of data and are also non-reproducible. Medical Resonance images contain a noise caused by operator performance which can lead to serious inaccuracies classification. The use of artificial intelligent techniques for instant, neural networks, and fuzzy logic shown great potential in this field. Hence, in this paper the Probabilistic Neural Network was applied for the purposes. Decision making was performed in two stages: feature extraction using the principal component analysis and the Probabilistic Neural Network (PNN). The performance of the PNN classifier was evaluated in terms of training performance and classification accuracies. Probabilistic Neural Network gives fast and accurate classification and is a promising tool for classification of the tumors.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128456693","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}
Latent finger print matching is one of the freshest areas in science. The current methods of latent finger print matching are manual and reliable on human experience. Unfortunately, a system, which can perform the latent fingerprint matching automatically, does not exist. The eye tracking technology is able to record the eye movement and could provide useful information about the user search strategy. In this paper, the experimental data obtained from an eye tracker is analyzed by clustering analysis and a neural network based system is designed to learn the search strategy of the experts. The results show that the system is able to predict the optimum search strategy based on expert’s experiences.
{"title":"GA-Neural Approach for Latent Finger Print Matching","authors":"Shahrzad Shapoori, N. Allinson","doi":"10.1109/ISMS.2011.19","DOIUrl":"https://doi.org/10.1109/ISMS.2011.19","url":null,"abstract":"Latent finger print matching is one of the freshest areas in science. The current methods of latent finger print matching are manual and reliable on human experience. Unfortunately, a system, which can perform the latent fingerprint matching automatically, does not exist. The eye tracking technology is able to record the eye movement and could provide useful information about the user search strategy. In this paper, the experimental data obtained from an eye tracker is analyzed by clustering analysis and a neural network based system is designed to learn the search strategy of the experts. The results show that the system is able to predict the optimum search strategy based on expert’s experiences.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129899409","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}
O. E. Oguike, M. Agu, D. Ebem, S. Echezona, H. Longe, O. Abass
In a heterogeneous distributed memory parallel computer system, each of the processors has its own memory. Describing the system using queuing network, each of the processors has its own ready queue. Since the system has many I/O queues and I/O processors, therefore, the various processors with their various ready queues and the various I/O processors and their various I/O queues form the queuing network of such a system. Using a round robin scheduling algorithm for the processor queues, we aim at evaluating the performance of the system from the time jobs arrive into the system to the time jobs depart from the system. This paper uses recursive models to evaluate the performance of the whole queuing network of a heterogeneous distributed memory parallel computer system.
{"title":"Evaluating the Performance of Heterogeneous Distributed Memory Parallel Computer System Using Recursive Models","authors":"O. E. Oguike, M. Agu, D. Ebem, S. Echezona, H. Longe, O. Abass","doi":"10.1109/ISMS.2011.65","DOIUrl":"https://doi.org/10.1109/ISMS.2011.65","url":null,"abstract":"In a heterogeneous distributed memory parallel computer system, each of the processors has its own memory. Describing the system using queuing network, each of the processors has its own ready queue. Since the system has many I/O queues and I/O processors, therefore, the various processors with their various ready queues and the various I/O processors and their various I/O queues form the queuing network of such a system. Using a round robin scheduling algorithm for the processor queues, we aim at evaluating the performance of the system from the time jobs arrive into the system to the time jobs depart from the system. This paper uses recursive models to evaluate the performance of the whole queuing network of a heterogeneous distributed memory parallel computer system.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132920327","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 recent years, we have witnessed a growing interest in optimizing the parallel and distributed computing solutions using scaled-out hardware designs and scalable parallel programming paradigms. This interest is driven by the fact that the microchip technology is gradually reaching its physical limitations in terms of heat dissipation and power consumption. Therefore and as an extension to Moore’s law, recent trends in high performance and grid computing have shown that future increases in performance can only be reached through increases in systems scale using a larger number of components, supported by scalable parallel programming models. In this paper, we evaluate the performance of two commonly used parallel compilers, Intel and Portland’s PGI, using a state-of-the-art Intel West mere-based HPC cluster. The performance evaluation is based on two sets of experiments, once evaluating the compilers’ performance using an MPI-based code, and another using OpenMP. Our results show that, for scientific applications that are matrices-dependant, the MPI and OpenMP features of the Intel compiler supersede PGI when using the defined HPC cluster.
{"title":"Performance Evaluation of Intel and Portland Compilers Using Intel Westmere Processor","authors":"M. Al-Mulhem, R. Al-Shaikh","doi":"10.1109/ISMS.2011.47","DOIUrl":"https://doi.org/10.1109/ISMS.2011.47","url":null,"abstract":"In recent years, we have witnessed a growing interest in optimizing the parallel and distributed computing solutions using scaled-out hardware designs and scalable parallel programming paradigms. This interest is driven by the fact that the microchip technology is gradually reaching its physical limitations in terms of heat dissipation and power consumption. Therefore and as an extension to Moore’s law, recent trends in high performance and grid computing have shown that future increases in performance can only be reached through increases in systems scale using a larger number of components, supported by scalable parallel programming models. In this paper, we evaluate the performance of two commonly used parallel compilers, Intel and Portland’s PGI, using a state-of-the-art Intel West mere-based HPC cluster. The performance evaluation is based on two sets of experiments, once evaluating the compilers’ performance using an MPI-based code, and another using OpenMP. Our results show that, for scientific applications that are matrices-dependant, the MPI and OpenMP features of the Intel compiler supersede PGI when using the defined HPC cluster.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134337797","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}
Self Similarity of network traffic has been an area of significant interest in the research on performance analysis of networks. It is widely known that a number of network traffic types display Self Similar behavior and its performance characteristics are significantly different from the typical Poisson or exponentially distributed traffic characteristics. In this paper we conduct an analysis of the impact of Pareto distributed traffic on the probability of blocking of wireless LANs. In particular we consider the impact of varying the coefficient of variance of the inter-arrival times and packet size distributions on the probability of blocking.
{"title":"Loss Probability in Networks with Pareto Distributed Traffic","authors":"S. Ghani, Faisal Iradat","doi":"10.1109/ISMS.2011.61","DOIUrl":"https://doi.org/10.1109/ISMS.2011.61","url":null,"abstract":"Self Similarity of network traffic has been an area of significant interest in the research on performance analysis of networks. It is widely known that a number of network traffic types display Self Similar behavior and its performance characteristics are significantly different from the typical Poisson or exponentially distributed traffic characteristics. In this paper we conduct an analysis of the impact of Pareto distributed traffic on the probability of blocking of wireless LANs. In particular we consider the impact of varying the coefficient of variance of the inter-arrival times and packet size distributions on the probability of blocking.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130853857","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}
Sherry Joy Alvionne V. Sebastian, A. Alvarez, Alvin Tang, J. Madamba
The advancement of modern computing machines today is seen in embedded systems by making the system do more functions faster and in real time. One technique is to use multiple processors executing in parallel. Also, because embedded systems have limited memory size, adding more functions in the system will limit the data that can be stored in the memory. This project is an implementation of a compiler for an ARM7TDMI-S microprocessor with dual-core capabilities. Aside from the 32-bit ARM7 instructions, the compiler also includes 16-bit thumb instructions and atomic instructions as its target output. Using thumb instructions compresses the size of the program in the memory to increase the number of data that can be stored in it. Code optimizations and memory optimizations were applied to further take advantage of the use of dual-core microprocessors. Result shows that the compiler gives a good distribution of instructions to the two cores.
{"title":"Implementation of the Phase II Compiler for the ARM7TDMI-S Dual-Core Microprocessor","authors":"Sherry Joy Alvionne V. Sebastian, A. Alvarez, Alvin Tang, J. Madamba","doi":"10.1109/ISMS.2011.46","DOIUrl":"https://doi.org/10.1109/ISMS.2011.46","url":null,"abstract":"The advancement of modern computing machines today is seen in embedded systems by making the system do more functions faster and in real time. One technique is to use multiple processors executing in parallel. Also, because embedded systems have limited memory size, adding more functions in the system will limit the data that can be stored in the memory. This project is an implementation of a compiler for an ARM7TDMI-S microprocessor with dual-core capabilities. Aside from the 32-bit ARM7 instructions, the compiler also includes 16-bit thumb instructions and atomic instructions as its target output. Using thumb instructions compresses the size of the program in the memory to increase the number of data that can be stored in it. Code optimizations and memory optimizations were applied to further take advantage of the use of dual-core microprocessors. Result shows that the compiler gives a good distribution of instructions to the two cores.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114359479","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}
Electricity bill charges usually dependents on the amount of electricity usage. The increment in the electricity usage will cause the users to pay more. This situation always happens when users are not aware about their growing usage. Hence, a system is needed where it can monitor and measure the electricity usage and update users on the increasing electricity utilization. This paper will discuss about EMD research methodology and process development of a device to monitoring real-time electricity utilization. This system will indirectly help the users to monitor the amount of electricity usage which will help them to control and overcome wastage of electric power.
{"title":"EMD: Electricity Monitoring Device for User Awareness","authors":"S. Ranjit, S. E. Loo, S. Zulkifli","doi":"10.1109/ISMS.2011.33","DOIUrl":"https://doi.org/10.1109/ISMS.2011.33","url":null,"abstract":"Electricity bill charges usually dependents on the amount of electricity usage. The increment in the electricity usage will cause the users to pay more. This situation always happens when users are not aware about their growing usage. Hence, a system is needed where it can monitor and measure the electricity usage and update users on the increasing electricity utilization. This paper will discuss about EMD research methodology and process development of a device to monitoring real-time electricity utilization. This system will indirectly help the users to monitor the amount of electricity usage which will help them to control and overcome wastage of electric power.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121234978","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}
Automated translation (MT) tools have become an urgent need in a multilingual environment. Although there are any available tools on the market, unfortunately, a robust MT tool is still a dream. This purpose of this paper is to discuss challenging issues in MT tool developments, the state of art of he MT tools and propose a framework for a semantic-based translation. The focus of this paper is English to Arabic translation MT.
{"title":"Automated Translation Machines: Challenges and a Proposed Solution","authors":"S. Jusoh, H. Alfawareh","doi":"10.1109/ISMS.2011.74","DOIUrl":"https://doi.org/10.1109/ISMS.2011.74","url":null,"abstract":"Automated translation (MT) tools have become an urgent need in a multilingual environment. Although there are any available tools on the market, unfortunately, a robust MT tool is still a dream. This purpose of this paper is to discuss challenging issues in MT tool developments, the state of art of he MT tools and propose a framework for a semantic-based translation. The focus of this paper is English to Arabic translation MT.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130291517","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 a compact and robust solution to use stereo vision to detect pedestrians as well as measure their instantaneous distances from the vehicle. This simplifies sensor requirements as the same video information (captured from two cameras) is used for detection of pedestrians as well as measurement of their corresponding distances. To apply stereo vision technique a novel approach has been made to locate identical points on human so that triangulation can be used for measuring distances. In addition to this, the paper also presents a novel technique used to make the pedestrian detection algorithm (based on well know Viola-Jones methodology) more robust by using tracking and assistive decision making (i.e. one camera helps other to eliminate noise). The proposed system is tested on standard x86 machine and gives good real time performance.
{"title":"Stereo Vision Based Pedestrians Detection and Distance Measurement for Automotive Application","authors":"B. Bhowmick, S. Bhadra, A. Sinharay","doi":"10.1109/ISMS.2011.14","DOIUrl":"https://doi.org/10.1109/ISMS.2011.14","url":null,"abstract":"This paper presents a compact and robust solution to use stereo vision to detect pedestrians as well as measure their instantaneous distances from the vehicle. This simplifies sensor requirements as the same video information (captured from two cameras) is used for detection of pedestrians as well as measurement of their corresponding distances. To apply stereo vision technique a novel approach has been made to locate identical points on human so that triangulation can be used for measuring distances. In addition to this, the paper also presents a novel technique used to make the pedestrian detection algorithm (based on well know Viola-Jones methodology) more robust by using tracking and assistive decision making (i.e. one camera helps other to eliminate noise). The proposed system is tested on standard x86 machine and gives good real time performance.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130557304","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 present a new formal Method for the Verification of a Multi agents Systems (MAS). We explain and applied a new method based on agents called Agents Petri Nets (APN). Our model describes each entity to model the system and verify the state of the agent and its behavior. This method use, mainly, the property of Petri Nets as deadline, state home, conflict, etc.. Therefore we use a formalism having a mathematical definition in order to verify some property of the interactive systems. To validate our contribution, we will deal with real example of a Multi agents System.
本文提出了一种新的多智能体系统(MAS)的形式化验证方法。我们解释并应用了一种基于agent的新方法——agent Petri Nets (APN)。我们的模型描述了每个实体来对系统建模，并验证代理的状态及其行为。该方法主要利用Petri网的属性作为截止日期、状态家园、冲突等。因此，为了验证交互系统的某些性质，我们采用了一种具有数学定义的形式。为了验证我们的贡献，我们将处理一个多智能体系统的实际例子。
{"title":"Method for Verification of a Multi Agents System","authors":"B. Marzougui, K. Hassine, Kamel Barkaoui","doi":"10.1109/ISMS.2011.21","DOIUrl":"https://doi.org/10.1109/ISMS.2011.21","url":null,"abstract":"In this paper, we present a new formal Method for the Verification of a Multi agents Systems (MAS). We explain and applied a new method based on agents called Agents Petri Nets (APN). Our model describes each entity to model the system and verify the state of the agent and its behavior. This method use, mainly, the property of Petri Nets as deadline, state home, conflict, etc.. Therefore we use a formalism having a mathematical definition in order to verify some property of the interactive systems. To validate our contribution, we will deal with real example of a Multi agents System.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130833471","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
扫码关注我们
求助内容：
应助结果提醒方式：