Pub Date : 2010-09-02DOI: 10.1109/ICEIE.2010.5559906
C. Pornpanomchai, Ponrath Sakunreraratsame, Rosita Wongsasirinart, Nuttakan Youngtavichavhart
The objective of this research is to build an automatic method for recognizing a Thai herb flower based on the Minimum Distance Method. The herb flower images, acquired from a digital camera, are taken in the real environment. We use the characteristics of herb flowers to design our classification algorithms, which consist of the average red, green and blue (RGB) colors, the herb flower size and the edge of petals feature. The experiments are conducted on more than 380 pictures from 16 species of herb flowers. The training data set is around 220 pictures. We test the system by using 110 pictures for a training data set and 50 pictures for an un-training data set. The precision rates of the recognition system are 98.18 percent and 94 percent, respectively. The average access time is 0.87 seconds per image.
{"title":"Herb flower recognition system (HFRS)","authors":"C. Pornpanomchai, Ponrath Sakunreraratsame, Rosita Wongsasirinart, Nuttakan Youngtavichavhart","doi":"10.1109/ICEIE.2010.5559906","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559906","url":null,"abstract":"The objective of this research is to build an automatic method for recognizing a Thai herb flower based on the Minimum Distance Method. The herb flower images, acquired from a digital camera, are taken in the real environment. We use the characteristics of herb flowers to design our classification algorithms, which consist of the average red, green and blue (RGB) colors, the herb flower size and the edge of petals feature. The experiments are conducted on more than 380 pictures from 16 species of herb flowers. The training data set is around 220 pictures. We test the system by using 110 pictures for a training data set and 50 pictures for an un-training data set. The precision rates of the recognition system are 98.18 percent and 94 percent, respectively. The average access time is 0.87 seconds per image.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130032991","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}
Pub Date : 2010-09-02DOI: 10.1109/ICEIE.2010.5559803
Ji Lu, Yaoxue Zhang, Yuezhi Zhou
With the sharp increase of computing demands, computations more and more rely on the distributed components. However, the relatively inferior quality of wide-area networks hampers such trend. This paper proposes an approach aiming at optimally organizing the distributed-component computing in the current Internet in which some nodes with large computational freedom and capability for the public to compute are emerging, such as the initially born data centers in the present Cloud computing environments. Both the user experience and the resource utilization are taken into the quantitative analysis and optimization. Facing the exponential growth of the problem's solution space, this paper develops an effective approach. Experimental simulations show that the approach generates the result significantly approximating the optimal solution, in the meantime with high efficiency.
{"title":"Optimally organizing distributed-component computing in the clouds: From both the user perspective and resource view","authors":"Ji Lu, Yaoxue Zhang, Yuezhi Zhou","doi":"10.1109/ICEIE.2010.5559803","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559803","url":null,"abstract":"With the sharp increase of computing demands, computations more and more rely on the distributed components. However, the relatively inferior quality of wide-area networks hampers such trend. This paper proposes an approach aiming at optimally organizing the distributed-component computing in the current Internet in which some nodes with large computational freedom and capability for the public to compute are emerging, such as the initially born data centers in the present Cloud computing environments. Both the user experience and the resource utilization are taken into the quantitative analysis and optimization. Facing the exponential growth of the problem's solution space, this paper develops an effective approach. Experimental simulations show that the approach generates the result significantly approximating the optimal solution, in the meantime with high efficiency.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130122598","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}
Pub Date : 2010-09-02DOI: 10.1109/ICEIE.2010.5559691
D. García, J. Entrialgo, Javier García, Manuel García
Today, scalable servers are key elements of most information systems. Their operational requirements, like good response time, low power consumption or high availability, are more and more strict. To fulfill these requirements continuously a proper management policy must be used. But the complexity of these servers prevents the application of manual policies and the own servers must manage themselves as much as possible. Therefore, there is a growing need of self-managing techniques and systems for this type of complex servers. This paper presents a self-managing technique for balancing response time and power consumption that can be integrated and configured in any server cluster very easily.
{"title":"A self-managing strategy for balancing response time and power consumption in heterogeneous server clusters","authors":"D. García, J. Entrialgo, Javier García, Manuel García","doi":"10.1109/ICEIE.2010.5559691","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559691","url":null,"abstract":"Today, scalable servers are key elements of most information systems. Their operational requirements, like good response time, low power consumption or high availability, are more and more strict. To fulfill these requirements continuously a proper management policy must be used. But the complexity of these servers prevents the application of manual policies and the own servers must manage themselves as much as possible. Therefore, there is a growing need of self-managing techniques and systems for this type of complex servers. This paper presents a self-managing technique for balancing response time and power consumption that can be integrated and configured in any server cluster very easily.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122378241","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}
Pub Date : 2010-09-02DOI: 10.1109/ICEIE.2010.5559779
M. Sharafi, A. Zare, S. Nikpoor
A Fuzzy approach to backward movement control for truck and trailer in a dynamic environment is presented in this paper. The approach is then extended and employed for conditions where obstacles are placed on the truck pathway. In the first case, obstacles are assumed to be fixed, while the second condition includes moving obstacles through which the truck should be directed toward the parking dock. The method is designed in a way to be used in conditions with infinite number of obstacles at arbitrary places. In any case, to find the parking dock, the truck movement must be adapted to that of obstacles. In the present paper, two separate fuzzy controllers are used for directing the truck and trailer: one for finding the target, and the other for avoiding the obstacles. While there is no obstacle around, the target finder controller is in use; and in the cases where the truck gets close to obstacles the obstacle avoider controller is activated. The proposed method is employed for parking a truck model through fixed and moving obstacles.
{"title":"Intelligent parking method for truck in presence of fixed and moving obstacles and trailer in presence of fixed obstacles: Advanced Fuzzy logic technologies in industrial applications","authors":"M. Sharafi, A. Zare, S. Nikpoor","doi":"10.1109/ICEIE.2010.5559779","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559779","url":null,"abstract":"A Fuzzy approach to backward movement control for truck and trailer in a dynamic environment is presented in this paper. The approach is then extended and employed for conditions where obstacles are placed on the truck pathway. In the first case, obstacles are assumed to be fixed, while the second condition includes moving obstacles through which the truck should be directed toward the parking dock. The method is designed in a way to be used in conditions with infinite number of obstacles at arbitrary places. In any case, to find the parking dock, the truck movement must be adapted to that of obstacles. In the present paper, two separate fuzzy controllers are used for directing the truck and trailer: one for finding the target, and the other for avoiding the obstacles. While there is no obstacle around, the target finder controller is in use; and in the cases where the truck gets close to obstacles the obstacle avoider controller is activated. The proposed method is employed for parking a truck model through fixed and moving obstacles.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130963964","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}
Pub Date : 2010-09-02DOI: 10.1109/ICEIE.2010.5559811
Muhammad Hameed Siddiqi, Muhammad Fahim, Sungyoung Lee, Young-Koo Lee
Efficiency and accuracy are the most important terms for human activity recognition. Most of the existing works have the problem of speed. This paper proposed an efficient algorithm to recognize the activities of the human. There are three stages of this paper, segmentation, feature extraction and recognition. In this paper our contribution is in segmentation stage (based on morphological dilation) and in feature extraction stage (using watershed transformation). The proposed algorithm has been tested on six different types of activities (containing 420 frames). The recognition performance of our method has been compared with the existing method using Principle Component Analysis (PCA) to derive activity features. The results of our proposed method are comparable with the existing work. But in-term of efficiency, our algorithm was much faster than the existing work. The average accuracy and efficiency of the proposed algorithm for recognition was 80.83 % and 302.2 ms respectively.
{"title":"Human activity recognition based on morphological dilation followed by watershed transformation method","authors":"Muhammad Hameed Siddiqi, Muhammad Fahim, Sungyoung Lee, Young-Koo Lee","doi":"10.1109/ICEIE.2010.5559811","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559811","url":null,"abstract":"Efficiency and accuracy are the most important terms for human activity recognition. Most of the existing works have the problem of speed. This paper proposed an efficient algorithm to recognize the activities of the human. There are three stages of this paper, segmentation, feature extraction and recognition. In this paper our contribution is in segmentation stage (based on morphological dilation) and in feature extraction stage (using watershed transformation). The proposed algorithm has been tested on six different types of activities (containing 420 frames). The recognition performance of our method has been compared with the existing method using Principle Component Analysis (PCA) to derive activity features. The results of our proposed method are comparable with the existing work. But in-term of efficiency, our algorithm was much faster than the existing work. The average accuracy and efficiency of the proposed algorithm for recognition was 80.83 % and 302.2 ms respectively.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128803601","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}
Pub Date : 2010-09-02DOI: 10.1109/ICEIE.2010.5559897
H. Kang, Min Woo Kwon, H. Bae
In this paper, we present a new third order particle swarm optimization. The original PSO has position and velocity vectors. However, the proposed algorithm has three vectors: i.e. a position vector, a velocity vector and an acceleration vector. From the proposed PSO, we obtain the third order difference equation and from the equation we obtain the convergence region for four parameters. By setting four appropriate parameters near the convergence region with the proposed PSO algorithm, we design PID coefficients for the automatic voltage regulators. We show that the proposed algorithm has better performance than the original PSO for the PID design of automatic voltage regulators
{"title":"PID coefficient designs for the automatic voltage regulator using a new third order particle swarm optimization","authors":"H. Kang, Min Woo Kwon, H. Bae","doi":"10.1109/ICEIE.2010.5559897","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559897","url":null,"abstract":"In this paper, we present a new third order particle swarm optimization. The original PSO has position and velocity vectors. However, the proposed algorithm has three vectors: i.e. a position vector, a velocity vector and an acceleration vector. From the proposed PSO, we obtain the third order difference equation and from the equation we obtain the convergence region for four parameters. By setting four appropriate parameters near the convergence region with the proposed PSO algorithm, we design PID coefficients for the automatic voltage regulators. We show that the proposed algorithm has better performance than the original PSO for the PID design of automatic voltage regulators","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121457987","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}
Pub Date : 2010-09-02DOI: 10.1109/ICEIE.2010.5559836
Chi Wu-Lee, Gwan-Hwan Hwang
This paper describes how to simultaneously support both dynamic policies and separation of concerns when developing an SOA application. We propose the DPSL (dynamic policy specification language) for managing and controlling the QoS according to the dynamic behavior of the workflow in SOA. The operation model is compatible with existing SOA standards, such as the WSDL, WS-Policy, WS-SecurityPolicy, and the BPEL. The implementation and experimental results demonstrate the feasibility of the proposed architecture.
{"title":"Dynamic policies for supporting quality of service in service-oriented architecture","authors":"Chi Wu-Lee, Gwan-Hwan Hwang","doi":"10.1109/ICEIE.2010.5559836","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559836","url":null,"abstract":"This paper describes how to simultaneously support both dynamic policies and separation of concerns when developing an SOA application. We propose the DPSL (dynamic policy specification language) for managing and controlling the QoS according to the dynamic behavior of the workflow in SOA. The operation model is compatible with existing SOA standards, such as the WSDL, WS-Policy, WS-SecurityPolicy, and the BPEL. The implementation and experimental results demonstrate the feasibility of the proposed architecture.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114096270","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}
Pub Date : 2010-09-02DOI: 10.1109/ICEIE.2010.5559874
Ling He, Jun Huang, Feng-Rui Yang
Wireless Mesh Network (WMN) is a new kind of broadband Wireless Network, mainly used for different application scenarios of wireless access. Hybrid Wireless Mesh Protocol (HWMP) is a default routing protocol provided for WMN by IEEE 802.11s. However, problems exist in this routing protocol, such as large overhead, low efficiency and so on. This paper propose a new routing mechanism, Source Node Compute Routing (SNCR) protocol for solving above problems, for the source node to quickly calculate the best-metric route to any destination of intra-mesh. The proposed protocol also combines proactive mode with on-demand mode to adapt to all traffic scenarios. The simulation results reveal that the SNCR protocol gets better improvement on performance such as packet delivery ratio, average end-to-end delay and routing overhead.
{"title":"A noval hybrid wireless routing protocol for WMNs","authors":"Ling He, Jun Huang, Feng-Rui Yang","doi":"10.1109/ICEIE.2010.5559874","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559874","url":null,"abstract":"Wireless Mesh Network (WMN) is a new kind of broadband Wireless Network, mainly used for different application scenarios of wireless access. Hybrid Wireless Mesh Protocol (HWMP) is a default routing protocol provided for WMN by IEEE 802.11s. However, problems exist in this routing protocol, such as large overhead, low efficiency and so on. This paper propose a new routing mechanism, Source Node Compute Routing (SNCR) protocol for solving above problems, for the source node to quickly calculate the best-metric route to any destination of intra-mesh. The proposed protocol also combines proactive mode with on-demand mode to adapt to all traffic scenarios. The simulation results reveal that the SNCR protocol gets better improvement on performance such as packet delivery ratio, average end-to-end delay and routing overhead.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124929494","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}
Pub Date : 2010-09-02DOI: 10.1109/ICEIE.2010.5559735
R. Prasath
Distributed processes with message passing strategy, communicate among themselves by exchanging pieces of information to perform exclusive access to achieve the tasks in a distributed fashion. In this paper, we consider sorting and prefix computation problems with n elements distributed over a number of communication processors in a distributed system. The proposed distributed sorting algorithm improves the performance of each processor without creating copies of elements at intermediate processors. Also all processors do not necessarily perform the disjoint comparison exchange operations and the proposed algorithm works with the identity of processors. The proposed algorithms are based on token based message passing strategy for distributed sorting and prefix computation problems on static ad hoc mobile networks. These algorithms could possibly be extended to dynamic ad hoc mobile networks.
{"title":"Algorithms for distributed sorting and prefix computation in static ad hoc mobile networks","authors":"R. Prasath","doi":"10.1109/ICEIE.2010.5559735","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559735","url":null,"abstract":"Distributed processes with message passing strategy, communicate among themselves by exchanging pieces of information to perform exclusive access to achieve the tasks in a distributed fashion. In this paper, we consider sorting and prefix computation problems with n elements distributed over a number of communication processors in a distributed system. The proposed distributed sorting algorithm improves the performance of each processor without creating copies of elements at intermediate processors. Also all processors do not necessarily perform the disjoint comparison exchange operations and the proposed algorithm works with the identity of processors. The proposed algorithms are based on token based message passing strategy for distributed sorting and prefix computation problems on static ad hoc mobile networks. These algorithms could possibly be extended to dynamic ad hoc mobile networks.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125240580","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}
Pub Date : 2010-09-02DOI: 10.1109/ICEIE.2010.5559786
Xu Yan, Wu Kening
China's arable land resource is scarce. To protect the arable land, China carries out a basic farmland protection system. Arable lands with best natural qualities, location conditions and larger areas are protected as basic land. It's specifically stipulated that the basic farmland should be determined in the general land use planning. A certain quality and quantity of basic farmland is not only a solid foundation for regional food security, but also an important guarantee for China's national economy and sustainable social development. However, there are few methods of appropriate adjustment of the basic farmland layout which is based on the premise that the original layout of the basic farmland should remain stable in order to satisfy the needs of the socio-economic development and the requirements of improving the quality of the basic farmland. The aim of this study is to attempt to find out a method of using Geographic Information System to finish the work of adjustment of the basic farmland layout based on the concept of basic farmland and the requirement on basic farmland adjustment in the new round of land use planning. Using the functions of information processing and spatial analysis of GIS in the adjustment process can provide a scientific result, and can increase the work efficiency. This paper takes the Gao'an city as an example with the purpose of confirming the structural operability of this method, and thereby, to establish a GIS-based technology for basic farmland adjustment and provide a scientific reference for Gao'an's new round of land use planning.
{"title":"Study of the layout adjustment of basic farmland based on Geographic Information System: A case study on Gao'an city","authors":"Xu Yan, Wu Kening","doi":"10.1109/ICEIE.2010.5559786","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559786","url":null,"abstract":"China's arable land resource is scarce. To protect the arable land, China carries out a basic farmland protection system. Arable lands with best natural qualities, location conditions and larger areas are protected as basic land. It's specifically stipulated that the basic farmland should be determined in the general land use planning. A certain quality and quantity of basic farmland is not only a solid foundation for regional food security, but also an important guarantee for China's national economy and sustainable social development. However, there are few methods of appropriate adjustment of the basic farmland layout which is based on the premise that the original layout of the basic farmland should remain stable in order to satisfy the needs of the socio-economic development and the requirements of improving the quality of the basic farmland. The aim of this study is to attempt to find out a method of using Geographic Information System to finish the work of adjustment of the basic farmland layout based on the concept of basic farmland and the requirement on basic farmland adjustment in the new round of land use planning. Using the functions of information processing and spatial analysis of GIS in the adjustment process can provide a scientific result, and can increase the work efficiency. This paper takes the Gao'an city as an example with the purpose of confirming the structural operability of this method, and thereby, to establish a GIS-based technology for basic farmland adjustment and provide a scientific reference for Gao'an's new round of land use planning.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131444401","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
扫码关注我们
求助内容：
应助结果提醒方式：