Pub Date : 2005-12-15DOI: 10.1109/CIMA.2005.1662340
K. Lin, Lin Lin, Un-Lin Young
Measurement of the cross-sectional (CS) contour of H-shaped steel using multiple stereo pairs is studied. Camera modeling and the calibration technique proposed by Zhang (1998) are implemented for such an application. An active approach of using laser light projection on the steel is used. It is advantageous to solve the image correspondence problem and improve the robustness of measurement accuracy. Experimental examples of measuring the CS contour of real H-shaped steel are presented for demonstration. The maximum error of measurement without considering the lens distortion is 2%, while the tolerance accepted by manufacturers is 3%. The results show that the proposed multiple stereo pairs are adequate for the measurement of the CS contour of H-shaped steel
{"title":"Measurement of the cross-sectional contour of H-shaped steel using multiple stereo pairs","authors":"K. Lin, Lin Lin, Un-Lin Young","doi":"10.1109/CIMA.2005.1662340","DOIUrl":"https://doi.org/10.1109/CIMA.2005.1662340","url":null,"abstract":"Measurement of the cross-sectional (CS) contour of H-shaped steel using multiple stereo pairs is studied. Camera modeling and the calibration technique proposed by Zhang (1998) are implemented for such an application. An active approach of using laser light projection on the steel is used. It is advantageous to solve the image correspondence problem and improve the robustness of measurement accuracy. Experimental examples of measuring the CS contour of real H-shaped steel are presented for demonstration. The maximum error of measurement without considering the lens distortion is 2%, while the tolerance accepted by manufacturers is 3%. The results show that the proposed multiple stereo pairs are adequate for the measurement of the CS contour of H-shaped steel","PeriodicalId":306045,"journal":{"name":"2005 ICSC Congress on Computational Intelligence Methods and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114065437","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 : 2005-12-15DOI: 10.1109/CIMA.2005.1662317
M. Hosseini, M. Mokhtari, M. Atyabi
Quadriplegics and blind other people are interested in life. We have designed an electrical system in order to make blind people able to ride bicycle alone without any others help that was not possible before. This system can be applied as a smart power assistance module for manual wheelchairs or quadriplegics wheelchair. Also with this system, we can make a new method in Paralympics, and design a new cycling sport for blind people. We design an auditory guidance system for the blind using ultrasonic to audio signal transformation. The system derives visual information using infrared and ultrasonic sensors, and transforms it to binaural auditory information. The user can recognize the position of obstacles and the surrounding environment. It is great! Today a blind person who was not able to run a bicycle alone, can be winner in Paralympics
{"title":"The intelligent electronic system especially for quadriplegics wheelchair and blinds bicycle (new method in Paralympics)","authors":"M. Hosseini, M. Mokhtari, M. Atyabi","doi":"10.1109/CIMA.2005.1662317","DOIUrl":"https://doi.org/10.1109/CIMA.2005.1662317","url":null,"abstract":"Quadriplegics and blind other people are interested in life. We have designed an electrical system in order to make blind people able to ride bicycle alone without any others help that was not possible before. This system can be applied as a smart power assistance module for manual wheelchairs or quadriplegics wheelchair. Also with this system, we can make a new method in Paralympics, and design a new cycling sport for blind people. We design an auditory guidance system for the blind using ultrasonic to audio signal transformation. The system derives visual information using infrared and ultrasonic sensors, and transforms it to binaural auditory information. The user can recognize the position of obstacles and the surrounding environment. It is great! Today a blind person who was not able to run a bicycle alone, can be winner in Paralympics","PeriodicalId":306045,"journal":{"name":"2005 ICSC Congress on Computational Intelligence Methods and Applications","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132127730","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 : 2005-12-15DOI: 10.1109/CIMA.2005.1662355
Yanyan Zhang, Lixin Tang
This paper investigates the problem of generating satisfactory production sequence of steel coils for color coating process in cold rolling plant. The characteristic of scheduling involves two parts of work. One is to optimally choose steel coils from available ones, the other is to generate a satisfactory processing plan so as to minimize production cost. To solve the problem, this paper transfers all the production requirements into the distance between any pair of coils, reduces the scheduling problem to prize-collecting traveling salesman problem (PCTSP) and develops pertinent Hopfield network algorithm, taking full advantage of the enlarged solving space of PCTSP. The performance of the proposed approach is verified by randomly generated problem instances. Computational results show that the proposed approach outperforms the existing heuristics with respect to solution quality
{"title":"Color coated coil scheduling in cold rolling plant using artificial neural network","authors":"Yanyan Zhang, Lixin Tang","doi":"10.1109/CIMA.2005.1662355","DOIUrl":"https://doi.org/10.1109/CIMA.2005.1662355","url":null,"abstract":"This paper investigates the problem of generating satisfactory production sequence of steel coils for color coating process in cold rolling plant. The characteristic of scheduling involves two parts of work. One is to optimally choose steel coils from available ones, the other is to generate a satisfactory processing plan so as to minimize production cost. To solve the problem, this paper transfers all the production requirements into the distance between any pair of coils, reduces the scheduling problem to prize-collecting traveling salesman problem (PCTSP) and develops pertinent Hopfield network algorithm, taking full advantage of the enlarged solving space of PCTSP. The performance of the proposed approach is verified by randomly generated problem instances. Computational results show that the proposed approach outperforms the existing heuristics with respect to solution quality","PeriodicalId":306045,"journal":{"name":"2005 ICSC Congress on Computational Intelligence Methods and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125386307","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 : 2005-12-15DOI: 10.1109/CIMA.2005.1662300
S. Banzi, E. Mainardi, A. Davalli
The paper presents the definition of a prosthetic protocol, specifing an application profile based on CAN bus standard. Aim of this definition is to realize an upper limb prosthesis control oriented bus, which grant an efficient sensors and actuators management, with the possibility both of centralized and distributed control, through the transmission and reception of high level commands and data. The enlarge possibility and reconfigurability of the system will be necessary aspects on following discussion
{"title":"A CAN-based distributed control system for upper limb myoelectric prosthesis","authors":"S. Banzi, E. Mainardi, A. Davalli","doi":"10.1109/CIMA.2005.1662300","DOIUrl":"https://doi.org/10.1109/CIMA.2005.1662300","url":null,"abstract":"The paper presents the definition of a prosthetic protocol, specifing an application profile based on CAN bus standard. Aim of this definition is to realize an upper limb prosthesis control oriented bus, which grant an efficient sensors and actuators management, with the possibility both of centralized and distributed control, through the transmission and reception of high level commands and data. The enlarge possibility and reconfigurability of the system will be necessary aspects on following discussion","PeriodicalId":306045,"journal":{"name":"2005 ICSC Congress on Computational Intelligence Methods and Applications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124182765","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 : 2005-12-15DOI: 10.1109/CIMA.2005.1662313
Xiaoxia Zhang, Lixin Tang
Ant colony optimization (ACO) is a meta-heuristic approach to tackle hard combinatorial optimization problems. The basic component of ACO is a solution construction mechanism, which simulates the decision-making processes of ant colonies as they forage for food and find the most efficient routes from their nests to food sources. Due to its constructive nature, we hybridize the solution construction mechanism of ACO with cyclic transfers (CT), which is a new class of neighborhood search algorithm. A CT-ACO algorithm, a hybrid search approach, is proposed to solve the vehicle routing problem. The method has both the advantages of ant colony optimization, the ability to find the higher performance solutions, and that of cyclic transfer algorithm, the ability to conduct fine-tuning in the quality of solutions and to find better solutions. The experimental results have shown that the method is very efficient and competitive to solve the vehicle routing problem compared with the best existing methods in terms of solution quality. Moreover, CT-ACO algorithm improves the best solutions known for some benchmark instances of the literature
{"title":"CT-ACO - hybridizing ant colony optimization with cyclic transfer search for the vehicle routing problem","authors":"Xiaoxia Zhang, Lixin Tang","doi":"10.1109/CIMA.2005.1662313","DOIUrl":"https://doi.org/10.1109/CIMA.2005.1662313","url":null,"abstract":"Ant colony optimization (ACO) is a meta-heuristic approach to tackle hard combinatorial optimization problems. The basic component of ACO is a solution construction mechanism, which simulates the decision-making processes of ant colonies as they forage for food and find the most efficient routes from their nests to food sources. Due to its constructive nature, we hybridize the solution construction mechanism of ACO with cyclic transfers (CT), which is a new class of neighborhood search algorithm. A CT-ACO algorithm, a hybrid search approach, is proposed to solve the vehicle routing problem. The method has both the advantages of ant colony optimization, the ability to find the higher performance solutions, and that of cyclic transfer algorithm, the ability to conduct fine-tuning in the quality of solutions and to find better solutions. The experimental results have shown that the method is very efficient and competitive to solve the vehicle routing problem compared with the best existing methods in terms of solution quality. Moreover, CT-ACO algorithm improves the best solutions known for some benchmark instances of the literature","PeriodicalId":306045,"journal":{"name":"2005 ICSC Congress on Computational Intelligence Methods and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129187006","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 : 2005-12-01DOI: 10.1109/CIMA.2005.1662304
F. Chiang, Robin Braun
This paper describes the design of a scalable biomimetic framework that addresses several key issues of autonomous agents in the management domain of complex ubiquitous service-oriented networks. We propose an autonomous network service management platform - SwarmingNet, which is motivated by observations of the swarm intelligence in biological systems (e.g., termite, ant/bees colonies, or locusts). In this SwarmingNet architecture, the required network service processes are implemented by a group of highly diverse and autonomic objects. These objects are called teleservice solons (TSSs) as elements of teleservice holons (TSHs), analogue to individual insects as particles of the whole colony. A single TSS is only able to pursue simple behaviors and interactions with local neighbors, however, a group of TSSs have the capabilities of fulfilling the complex tasks relating to service discovery and service activation. We simulate a service configuration process for multimedia messaging service, and a performance comparison between the bio-agents and normal agents is analyzed. Finally, we conclude that through bio-swarming intelligence behaviors, this infrastructure develops the enhanced self-x capabilities which give IP networks advantages of instinctive compatibility, efficiency and scalability
{"title":"A nature inspired multi-agent framework for autonomic service management in ubiquitous computing environments","authors":"F. Chiang, Robin Braun","doi":"10.1109/CIMA.2005.1662304","DOIUrl":"https://doi.org/10.1109/CIMA.2005.1662304","url":null,"abstract":"This paper describes the design of a scalable biomimetic framework that addresses several key issues of autonomous agents in the management domain of complex ubiquitous service-oriented networks. We propose an autonomous network service management platform - SwarmingNet, which is motivated by observations of the swarm intelligence in biological systems (e.g., termite, ant/bees colonies, or locusts). In this SwarmingNet architecture, the required network service processes are implemented by a group of highly diverse and autonomic objects. These objects are called teleservice solons (TSSs) as elements of teleservice holons (TSHs), analogue to individual insects as particles of the whole colony. A single TSS is only able to pursue simple behaviors and interactions with local neighbors, however, a group of TSSs have the capabilities of fulfilling the complex tasks relating to service discovery and service activation. We simulate a service configuration process for multimedia messaging service, and a performance comparison between the bio-agents and normal agents is analyzed. Finally, we conclude that through bio-swarming intelligence behaviors, this infrastructure develops the enhanced self-x capabilities which give IP networks advantages of instinctive compatibility, efficiency and scalability","PeriodicalId":306045,"journal":{"name":"2005 ICSC Congress on Computational Intelligence Methods and Applications","volume":"288 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114320275","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 : 1900-01-01DOI: 10.1109/CIMA.2005.1662356
G. Silaghi, V. Robu
This paper proposes a novel automated agent strategy for stock market trading, developed in the context of the Penn-Lehman automated trading (PLAT) simulation platform by Kearns, M., and Ortiz, L., (2003). We provide a comprehensive experimental validation of our strategy using historic order book data from the NASDAQ market
{"title":"An agent strategy for automated stock market trading combining price and order book information","authors":"G. Silaghi, V. Robu","doi":"10.1109/CIMA.2005.1662356","DOIUrl":"https://doi.org/10.1109/CIMA.2005.1662356","url":null,"abstract":"This paper proposes a novel automated agent strategy for stock market trading, developed in the context of the Penn-Lehman automated trading (PLAT) simulation platform by Kearns, M., and Ortiz, L., (2003). We provide a comprehensive experimental validation of our strategy using historic order book data from the NASDAQ market","PeriodicalId":306045,"journal":{"name":"2005 ICSC Congress on Computational Intelligence Methods and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126972106","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 : 1900-01-01DOI: 10.1109/CIMA.2005.1662332
A. Saboori, S. Zad
In this paper, we study the synthesis of fault recovery procedures using discrete-event models. It is assumed that a diagnosis system is available that detects and isolates the faults with a bounded delay. Thus, the combination of the plant and the diagnosis system, as the system to be controlled, will have three modes: normal, transient and recovery. Initially, the plant and thus the system to be controlled, are in the normal mode. Once a fault occurs in the plant, the system enters the transient mode. After the fault is diagnosed by the diagnosis system, the system enters the recovery mode. We study the design of a nonblocking supervisor to enforce the design specifications of the system in all three modes. The solution is obtained by first transforming the problem into an equivalent robust nonblocking supervisory control problem under partial observation, and then (using our previous results on robust control) solving the resulting robust control problem and thus the fault recovery problem. As a result, we obtain a set of necessary and sufficient conditions for the existence of a solution for the fault recovery problem
{"title":"Fault recovery in discrete event systems","authors":"A. Saboori, S. Zad","doi":"10.1109/CIMA.2005.1662332","DOIUrl":"https://doi.org/10.1109/CIMA.2005.1662332","url":null,"abstract":"In this paper, we study the synthesis of fault recovery procedures using discrete-event models. It is assumed that a diagnosis system is available that detects and isolates the faults with a bounded delay. Thus, the combination of the plant and the diagnosis system, as the system to be controlled, will have three modes: normal, transient and recovery. Initially, the plant and thus the system to be controlled, are in the normal mode. Once a fault occurs in the plant, the system enters the transient mode. After the fault is diagnosed by the diagnosis system, the system enters the recovery mode. We study the design of a nonblocking supervisor to enforce the design specifications of the system in all three modes. The solution is obtained by first transforming the problem into an equivalent robust nonblocking supervisory control problem under partial observation, and then (using our previous results on robust control) solving the resulting robust control problem and thus the fault recovery problem. As a result, we obtain a set of necessary and sufficient conditions for the existence of a solution for the fault recovery problem","PeriodicalId":306045,"journal":{"name":"2005 ICSC Congress on Computational Intelligence Methods and Applications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115827299","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 : 1900-01-01DOI: 10.1109/cacsd.2006.285485
H. Karimi, P. J. Maralani, B. Moshiri, B. Lohmann
Using Haar wavelets, a computational method is presented to determine the piecewise constant feedback controls for a finite-time linear optimal control problem of a time-varying state-delayed system. The method is simple and computationally advantageous. The approximated optimal trajectory and optimal control are calculated using Haar wavelet integral operational matrix, Haar wavelet product operational matrix and Haar wavelet delay operational matrix. An illustrative example is included to demonstrate the validity and applicability of the technique
{"title":"Haar wavelet-based optimal control of time-varying state-delayed systems: a computational method","authors":"H. Karimi, P. J. Maralani, B. Moshiri, B. Lohmann","doi":"10.1109/cacsd.2006.285485","DOIUrl":"https://doi.org/10.1109/cacsd.2006.285485","url":null,"abstract":"Using Haar wavelets, a computational method is presented to determine the piecewise constant feedback controls for a finite-time linear optimal control problem of a time-varying state-delayed system. The method is simple and computationally advantageous. The approximated optimal trajectory and optimal control are calculated using Haar wavelet integral operational matrix, Haar wavelet product operational matrix and Haar wavelet delay operational matrix. An illustrative example is included to demonstrate the validity and applicability of the technique","PeriodicalId":306045,"journal":{"name":"2005 ICSC Congress on Computational Intelligence Methods and Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121791792","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
扫码关注我们
求助内容：
应助结果提醒方式：