Automata play a major role in compiler design and parsing. Turing machines are the most powerful computational machines. Turing machines are equivalent to algorithms, and are the theoretical basis for modern computers. Still it is a tedious task to create and maintain Turing Machines for all the problems. The Universal Turing Machine (UTM) or simply a universal machine is a solution to this problem. A UTM simulates any other TM, thus providing a single model and solution for all the computational problems. The creation of UTM is very tedious because of the underlying complexities. Also many of the existing tools do not support the creation of UTM which makes the task very difficult to accomplish. Hence a Universal Turing Machine is developed for the JFLAP platform. JFLAP is most successful and widely used tool for visualizing and simulating all types of automata.
{"title":"Implementation of Context Free Languages in Turing Machines","authors":"Sumitha Ch, Krupa Ophelia Geddam","doi":"10.1109/ICMLC.2010.55","DOIUrl":"https://doi.org/10.1109/ICMLC.2010.55","url":null,"abstract":"Automata play a major role in compiler design and parsing. Turing machines are the most powerful computational machines. Turing machines are equivalent to algorithms, and are the theoretical basis for modern computers. Still it is a tedious task to create and maintain Turing Machines for all the problems. The Universal Turing Machine (UTM) or simply a universal machine is a solution to this problem. A UTM simulates any other TM, thus providing a single model and solution for all the computational problems. The creation of UTM is very tedious because of the underlying complexities. Also many of the existing tools do not support the creation of UTM which makes the task very difficult to accomplish. Hence a Universal Turing Machine is developed for the JFLAP platform. JFLAP is most successful and widely used tool for visualizing and simulating all types of automata.","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123421134","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}
Radial basis function(RBF) is used to register source image with target image. Training the RBF network is done with inputs as X,Y co-ordinates of the characteristic points from source and target images. The target output in the output layer is taken as the amount and direction of horizontal shift, vertical shift, angle of rotation required to align source image with target image. This approach results in less alignment error.
{"title":"Image Registration Using Radial Basis Function","authors":"R. Rajeswari, A. Irudhayaraj","doi":"10.1109/ICMLC.2010.66","DOIUrl":"https://doi.org/10.1109/ICMLC.2010.66","url":null,"abstract":"Radial basis function(RBF) is used to register source image with target image. Training the RBF network is done with inputs as X,Y co-ordinates of the characteristic points from source and target images. The target output in the output layer is taken as the amount and direction of horizontal shift, vertical shift, angle of rotation required to align source image with target image. This approach results in less alignment error.","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"248 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122920523","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 propose Clustering method and Ant Colony Optimization (ACO) for mobile robot. This paper describes the analysis and design of a new class of mobile robots. These small robots are intended to be simple and inexpensive, and will all be physically identical, thus constituting a homogeneous team of robots. They derive their usefulness from their group actions, performing physical tasks and making cooperative decisions as a Coordinated Team. To improve the performance of clustering, the method based on heuristic concept is used to obtain global search. The main advantage of clustering algorithm lies in the fact that no additional information, such as an initial partitioning of the data or the number of clusters, is needed. Since the proposed method is very efficient, thus it can perform object finding using clustering very quickly. In the process of doing so, we first use ACO to obtain the shortest obstructed distance, which is an effective method for arbitrary shape obstacles
{"title":"An Approach Based on Clustering Method for Object Finding Mobile Robots Using ACO","authors":"V. Sahare, N. Sahare, N. Sahare","doi":"10.1109/ICMLC.2010.23","DOIUrl":"https://doi.org/10.1109/ICMLC.2010.23","url":null,"abstract":"In this paper, we propose Clustering method and Ant Colony Optimization (ACO) for mobile robot. This paper describes the analysis and design of a new class of mobile robots. These small robots are intended to be simple and inexpensive, and will all be physically identical, thus constituting a homogeneous team of robots. They derive their usefulness from their group actions, performing physical tasks and making cooperative decisions as a Coordinated Team. To improve the performance of clustering, the method based on heuristic concept is used to obtain global search. The main advantage of clustering algorithm lies in the fact that no additional information, such as an initial partitioning of the data or the number of clusters, is needed. Since the proposed method is very efficient, thus it can perform object finding using clustering very quickly. In the process of doing so, we first use ACO to obtain the shortest obstructed distance, which is an effective method for arbitrary shape obstacles","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114153077","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}
OpenCV is typically, an open source vision library suitable for computer vision programs. In this paper, we present some of our preliminary investigation experiences of developing Computer Vision programs using OpenCV for robotic telemedicine cluster system, within the practice based ICTD subject within the undergraduate Software Engineering Program at the Faculty of Engineering, University of Technology Sydney (UTS). Firstly, it discusses our shared experiences in designing and implementing Computer Vision subsystem and discusses successes, as well as common problems both experienced and anticipated in adaptation of OpenCV framework and then justifies its purpose building a robotic system for telemedicine. Finally, it attempts to bridge the gap between the theoretical knowledge of design and programming with the practical side of software reuse and modularization when designing and implementing a robotic system for medical applications.
{"title":"A Preliminary Investigation on Computer Vision for Telemedicine Systems Using OpenCV","authors":"Z. Chaczko, L. Yeoh, V. Mahadevan","doi":"10.1109/ICMLC.2010.70","DOIUrl":"https://doi.org/10.1109/ICMLC.2010.70","url":null,"abstract":"OpenCV is typically, an open source vision library suitable for computer vision programs. In this paper, we present some of our preliminary investigation experiences of developing Computer Vision programs using OpenCV for robotic telemedicine cluster system, within the practice based ICTD subject within the undergraduate Software Engineering Program at the Faculty of Engineering, University of Technology Sydney (UTS). Firstly, it discusses our shared experiences in designing and implementing Computer Vision subsystem and discusses successes, as well as common problems both experienced and anticipated in adaptation of OpenCV framework and then justifies its purpose building a robotic system for telemedicine. Finally, it attempts to bridge the gap between the theoretical knowledge of design and programming with the practical side of software reuse and modularization when designing and implementing a robotic system for medical applications.","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126853391","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 deals with the Implementation of high speed and high power Separately excited PMDC motor fed from Double boost converter. In many industries , the PMDC motor plays a vital role for variety of control applications. The speed and output power are the notable parameters in variety of low voltage applications. The PMDC motor Drives are usually meant for constant speed applications. Generally, in most of the power electronics application, the voltages fed to the converter at input was being wasted more in the form of switching losses. Hence the efficiency of the driving system was reduced considerably. The aim of this work is to improve the efficiency of the PMDC drive by implementing double boost converter by reducing the switching losses considerably. Simulation result proves the effectiveness of the proposed PMDC Drive fed by Double boost converter by improved speed response and output power compared with Bridgeless boost converter fed PMDC Drive.
{"title":"Soft Computing Technique for Double Boost Converter Fed PMDC Drive","authors":"R. Sankar, S. Ramareddy","doi":"10.1109/ICMLC.2010.76","DOIUrl":"https://doi.org/10.1109/ICMLC.2010.76","url":null,"abstract":"This paper deals with the Implementation of high speed and high power Separately excited PMDC motor fed from Double boost converter. In many industries , the PMDC motor plays a vital role for variety of control applications. The speed and output power are the notable parameters in variety of low voltage applications. The PMDC motor Drives are usually meant for constant speed applications. Generally, in most of the power electronics application, the voltages fed to the converter at input was being wasted more in the form of switching losses. Hence the efficiency of the driving system was reduced considerably. The aim of this work is to improve the efficiency of the PMDC drive by implementing double boost converter by reducing the switching losses considerably. Simulation result proves the effectiveness of the proposed PMDC Drive fed by Double boost converter by improved speed response and output power compared with Bridgeless boost converter fed PMDC Drive.","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121457044","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 describes the study of the verification of characteristic equation for the output current generated by a solar panel. The characteristic equation is simulated by using MATLAB/Simulink. Many factors that affect the performance of the solar energy tracking system need to be considered profoundly for the complete & effective utilization of the available energy. This work deals with the study of tracking the position of the sun and positioning the solar panel to operate at the maximum power point.
{"title":"Maximum Power Point Tracking for PV Systems Using MATALAB/SIMULINK","authors":"P. Revankar, A. G. Thosar, W. Gandhare","doi":"10.1109/ICMLC.2010.54","DOIUrl":"https://doi.org/10.1109/ICMLC.2010.54","url":null,"abstract":"This paper describes the study of the verification of characteristic equation for the output current generated by a solar panel. The characteristic equation is simulated by using MATLAB/Simulink. Many factors that affect the performance of the solar energy tracking system need to be considered profoundly for the complete & effective utilization of the available energy. This work deals with the study of tracking the position of the sun and positioning the solar panel to operate at the maximum power point.","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126370834","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-scale networked environments, such as the Internet, possess the characteristics of centralised data, centralised access and centralised control; this gives the user a powerful mechanism for building and integrating large repositories of centralised information from diverse resources set. However, a centralised network system with GSM Networks development for a hospital information systems or a health care information portal is still in its infancy. The shortcomings of the currently available tools have made the use of mobile devices more appealing. In mobile computing, the issues such as low bandwidth, high latency wireless Networks, loss or degradation of wireless connections, and network errors or failures need to be dealt with. Other issues to be addressed include system adaptability, reliability, robustness, extensibility, flexibility, and maintainability. GSM approach has emerged as the most viable approach for development of intelligent software applications for wireless mobile devices in a centralized environment, which gives higher band width of 900 MHz for transmission. The e-healthcare system that we have developed provides support for physicians, nurses, pharmacists and other healthcare professionals, as well as for patients and medical devices used to monitor patients. In this paper, we present the architecture and the demonstration prototype.
{"title":"Latency of Web Service in Health Care System Using GSM Networks","authors":"M. A., S. Murugan, A. Arun, A. Ramachandran","doi":"10.1109/ICMLC.2010.37","DOIUrl":"https://doi.org/10.1109/ICMLC.2010.37","url":null,"abstract":"Large-scale networked environments, such as the Internet, possess the characteristics of centralised data, centralised access and centralised control; this gives the user a powerful mechanism for building and integrating large repositories of centralised information from diverse resources set. However, a centralised network system with GSM Networks development for a hospital information systems or a health care information portal is still in its infancy. The shortcomings of the currently available tools have made the use of mobile devices more appealing. In mobile computing, the issues such as low bandwidth, high latency wireless Networks, loss or degradation of wireless connections, and network errors or failures need to be dealt with. Other issues to be addressed include system adaptability, reliability, robustness, extensibility, flexibility, and maintainability. GSM approach has emerged as the most viable approach for development of intelligent software applications for wireless mobile devices in a centralized environment, which gives higher band width of 900 MHz for transmission. The e-healthcare system that we have developed provides support for physicians, nurses, pharmacists and other healthcare professionals, as well as for patients and medical devices used to monitor patients. In this paper, we present the architecture and the demonstration prototype.","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115508234","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}
The general problem of multiprocessor scheduling can be stated as scheduling a task graph onto a multiprocessor system so that schedule length can be optimized. Task scheduling in multiprocessor system is a NP-complete problem. In literature, several heuristic methods have been developed that obtain suboptimal solutions in less than the polynomial time. Recently, Genetic algorithms have received much awareness as they are robust and guarantee for a good solution. In this paper, we have developed a genetic algorithm based on the principles of evolution found in nature for finding an optimal solution. Genetic algorithm is based on three operators: Natural Selection, Crossover and Mutation. To compare the performance of our algorithm, we have also implemented another scheduling algorithm HEFT which is a heuristic algorithm. Simulation results comprises of three parts: Quality of solutions, robustness of genetic algorithm, and effect of mutation probability on performance of genetic algorithm.
{"title":"Task Scheduling in Multiprocessor System Using Genetic Algorithm","authors":"Sachi Gupta, Vikas Kumar, Gaurav Agarwal","doi":"10.1109/ICMLC.2010.50","DOIUrl":"https://doi.org/10.1109/ICMLC.2010.50","url":null,"abstract":"The general problem of multiprocessor scheduling can be stated as scheduling a task graph onto a multiprocessor system so that schedule length can be optimized. Task scheduling in multiprocessor system is a NP-complete problem. In literature, several heuristic methods have been developed that obtain suboptimal solutions in less than the polynomial time. Recently, Genetic algorithms have received much awareness as they are robust and guarantee for a good solution. In this paper, we have developed a genetic algorithm based on the principles of evolution found in nature for finding an optimal solution. Genetic algorithm is based on three operators: Natural Selection, Crossover and Mutation. To compare the performance of our algorithm, we have also implemented another scheduling algorithm HEFT which is a heuristic algorithm. Simulation results comprises of three parts: Quality of solutions, robustness of genetic algorithm, and effect of mutation probability on performance of genetic algorithm.","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116902405","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}
Classification of organisms into different categories using their genomic sequences has found importance in study of evolutionary characteristics, specific identification of previously unknown organisms, study of mutual relationships between organisms and many other aspects in the study of living things. Chaos game representation (CGR) uniquely represents DNA sequences and reveals hidden patterns in it. Frequency-CGR (FCGR) derived from CGR, shows the frequency of sub-sequences present in the DNA sequence. In this paper, a novel method for classification of organisms based on a combination of FCGR and Artificial Neural network (ANN) is proposed. Eight categories from the taxonomical distribution of Eukaryotic organisms are taken and ANN is used for classification. Different configurations of ANN are tested and good accuracy is obtained. The way the fractal nature of DNA helps in classification, is also investigated.
{"title":"ANN Based Classification of Unknown Genome Fragments Using Chaos Game Representation","authors":"Vrinda V. Nair, K. Vijayan, D. Gopinath, A. Nair","doi":"10.1109/ICMLC.2010.56","DOIUrl":"https://doi.org/10.1109/ICMLC.2010.56","url":null,"abstract":"Classification of organisms into different categories using their genomic sequences has found importance in study of evolutionary characteristics, specific identification of previously unknown organisms, study of mutual relationships between organisms and many other aspects in the study of living things. Chaos game representation (CGR) uniquely represents DNA sequences and reveals hidden patterns in it. Frequency-CGR (FCGR) derived from CGR, shows the frequency of sub-sequences present in the DNA sequence. In this paper, a novel method for classification of organisms based on a combination of FCGR and Artificial Neural network (ANN) is proposed. Eight categories from the taxonomical distribution of Eukaryotic organisms are taken and ANN is used for classification. Different configurations of ANN are tested and good accuracy is obtained. The way the fractal nature of DNA helps in classification, is also investigated.","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125967386","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}
The steam turbine generator faults not only damage the generator itself, but also cause outages and loss of profits, for this reason, many researchers work on the fault diagnosis. But misdiagnosing may also lead to serious losses. In order to improve the diagnosis reliability and reduce the loss caused by misdiagnosis, in this paper, cost integrated multiclass SVM with reject option (CIMC-SVM) is proposed. Experimental results show that CIMC-SVM is able to improve the diagnosis reliability and minimize the average cost.
{"title":"SVM-Based Multiclass Cost-sensitive Classification with Reject Option for Fault Diagnosis of Steam Turbine Generator","authors":"Chao Zou, Enhui Zheng, Hong-wei Xu, Le Chen","doi":"10.1109/ICMLC.2010.26","DOIUrl":"https://doi.org/10.1109/ICMLC.2010.26","url":null,"abstract":"The steam turbine generator faults not only damage the generator itself, but also cause outages and loss of profits, for this reason, many researchers work on the fault diagnosis. But misdiagnosing may also lead to serious losses. In order to improve the diagnosis reliability and reduce the loss caused by misdiagnosis, in this paper, cost integrated multiclass SVM with reject option (CIMC-SVM) is proposed. Experimental results show that CIMC-SVM is able to improve the diagnosis reliability and minimize the average cost.","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127176756","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
扫码关注我们
求助内容：
应助结果提醒方式：