Pub Date : 2006-12-01DOI: 10.1109/ICARCV.2006.345152
Qifeng Zhou, Cheng-de Lin
Credit risk assessment plays an important role in banks credit risk management. The objective of credit assessment is to decide credit ranks, which denote the capacity of enterprises to meet their financial commitments. Traditional "one-versus-one" approach has been commonly used in the multi-classification method based on support vector machine (SVM). Since SVM for pattern recognition is based on binary classification, there will be unclassifiable regions when extended to multi-classification problems. Focus on this problem, a new credit risk assessment model based on fuzzy SVM is introduced in this paper that can give a reasonable classification for unclassifiable examples. Experiment results show that the fuzzy SVM method provides a better performance in generalization ability and assessment accuracy than conventional one-versus-one multi-classification approach
{"title":"Credit Risk Assessment in Commercial Banks Based on Fuzzy Support Vector Machines","authors":"Qifeng Zhou, Cheng-de Lin","doi":"10.1109/ICARCV.2006.345152","DOIUrl":"https://doi.org/10.1109/ICARCV.2006.345152","url":null,"abstract":"Credit risk assessment plays an important role in banks credit risk management. The objective of credit assessment is to decide credit ranks, which denote the capacity of enterprises to meet their financial commitments. Traditional \"one-versus-one\" approach has been commonly used in the multi-classification method based on support vector machine (SVM). Since SVM for pattern recognition is based on binary classification, there will be unclassifiable regions when extended to multi-classification problems. Focus on this problem, a new credit risk assessment model based on fuzzy SVM is introduced in this paper that can give a reasonable classification for unclassifiable examples. Experiment results show that the fuzzy SVM method provides a better performance in generalization ability and assessment accuracy than conventional one-versus-one multi-classification approach","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130815710","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 : 2006-12-01DOI: 10.1109/ICARCV.2006.345452
G. Fusco, M. Russo
The application of the generalized minimum variance approach to the design of an implicit self-tuning with pole-assignment nodal voltage regulator in electrical power systems is presented. The regulator embeds a difference filter to counteract the effects of a constant disturbance term present in the proposed power system model. The difference filter and the disturbance term generate equivalent terms in the generalized pseudo-output which must be accounted for into the estimation algorithm. Implementation aspect and simulation results are finally discussed and reported
{"title":"Generalized Minimum Variance Implicit Self-tuning Nodal Voltage Regulation in Power Systems with Pole-assignment Technique","authors":"G. Fusco, M. Russo","doi":"10.1109/ICARCV.2006.345452","DOIUrl":"https://doi.org/10.1109/ICARCV.2006.345452","url":null,"abstract":"The application of the generalized minimum variance approach to the design of an implicit self-tuning with pole-assignment nodal voltage regulator in electrical power systems is presented. The regulator embeds a difference filter to counteract the effects of a constant disturbance term present in the proposed power system model. The difference filter and the disturbance term generate equivalent terms in the generalized pseudo-output which must be accounted for into the estimation algorithm. Implementation aspect and simulation results are finally discussed and reported","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130899703","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 : 2006-12-01DOI: 10.1109/ICARCV.2006.345263
K. Shuang, C. H. Chen, Ning Xiao, D. Z. Yu
The paper studies a digital electronic governor with TMS320F2812 for a gas engine. The governor employed chopped current angular subdivision to realize feeding oil control. Modifying PID parameters automatically by fuzzy control rules, a fuzzy adaptive PID control was achieved. Fuzzy self-adjusted PID control improves dynamic response while the load change, and keeps the governor performing well in a wide operating range
{"title":"A New Digital Electronic Governor Based on 32 bits DSP for a Gas Engine","authors":"K. Shuang, C. H. Chen, Ning Xiao, D. Z. Yu","doi":"10.1109/ICARCV.2006.345263","DOIUrl":"https://doi.org/10.1109/ICARCV.2006.345263","url":null,"abstract":"The paper studies a digital electronic governor with TMS320F2812 for a gas engine. The governor employed chopped current angular subdivision to realize feeding oil control. Modifying PID parameters automatically by fuzzy control rules, a fuzzy adaptive PID control was achieved. Fuzzy self-adjusted PID control improves dynamic response while the load change, and keeps the governor performing well in a wide operating range","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128814743","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 : 2006-12-01DOI: 10.1109/ICARCV.2006.345082
Xiaonan Wang, Huan-yan Qian
The existing designs for providing Anycast services are either to confine each Anycast group to a preconfigured topological region or to globally distribute routes to individual Anycast groups which causes the routing tables to grow proportionally to the number of all global Anycast groups in the entire Internet, both of which restrict and hinder the application and development of Anycast services. A new kind of Anycast communication model is proposed on the basis of Anycast tree in this paper. Since this model achieves dynamic Anycast group and allows Anycast members to freely leave and join Anycast group it radically solves the existing scalability problem. In addition, this model accomplishes the distributed maintenance and transaction of Anycast nodes so it accomplishes the load balance. This paper deeply analyzes and discusses the feasibility and validity of this communication model, and argues that it supports the large-scale Anycast group.
{"title":"An Anycast Communication Model on Solving Scalability in IPv6","authors":"Xiaonan Wang, Huan-yan Qian","doi":"10.1109/ICARCV.2006.345082","DOIUrl":"https://doi.org/10.1109/ICARCV.2006.345082","url":null,"abstract":"The existing designs for providing Anycast services are either to confine each Anycast group to a preconfigured topological region or to globally distribute routes to individual Anycast groups which causes the routing tables to grow proportionally to the number of all global Anycast groups in the entire Internet, both of which restrict and hinder the application and development of Anycast services. A new kind of Anycast communication model is proposed on the basis of Anycast tree in this paper. Since this model achieves dynamic Anycast group and allows Anycast members to freely leave and join Anycast group it radically solves the existing scalability problem. In addition, this model accomplishes the distributed maintenance and transaction of Anycast nodes so it accomplishes the load balance. This paper deeply analyzes and discusses the feasibility and validity of this communication model, and argues that it supports the large-scale Anycast group.","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126888663","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 : 2006-12-01DOI: 10.1109/ICARCV.2006.345421
M. Tabatabaei-Pour, M. Gholami, H. Shaker, B. Moshiri
In this paper we propose a procedure for recursive identification of discrete time piecewise affine (PWA) hybrid systems. The PWA identification problem involves the estimation of both the parameters of affine submodels and the partition of the PWA map from data. In this paper the submodel parameters estimation problem is solved via recursive k-plane clustering algorithm and the problem of region estimation is performed by incremental proximal support vector machine. Also, the effect of mode switching on the estimated parameters convergence is investigated
{"title":"Recursive Identification of Piecewise Affine Hybrid Systems","authors":"M. Tabatabaei-Pour, M. Gholami, H. Shaker, B. Moshiri","doi":"10.1109/ICARCV.2006.345421","DOIUrl":"https://doi.org/10.1109/ICARCV.2006.345421","url":null,"abstract":"In this paper we propose a procedure for recursive identification of discrete time piecewise affine (PWA) hybrid systems. The PWA identification problem involves the estimation of both the parameters of affine submodels and the partition of the PWA map from data. In this paper the submodel parameters estimation problem is solved via recursive k-plane clustering algorithm and the problem of region estimation is performed by incremental proximal support vector machine. Also, the effect of mode switching on the estimated parameters convergence is investigated","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"376 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123387949","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 : 2006-12-01DOI: 10.1109/ICARCV.2006.345071
Pichai Amnuaykanjanasin, S. Aramvith, T. Chalidabhongse
This paper proposes a method for real-time face detection and identification using two cooperative pan-tilt-zoom (PTZ) cameras. For each camera, the human face is detected and segmented using motion and skin color cues. The face segment is then analyzed by considering the relative position of the facial color blob to determine the pose. After facial pose is estimated, the identification is performed using a face matching method based on color-distribution. Identification results with confidence values from both cameras are weighted combined to conclude the final result. Our experimental results demonstrate successful face detection and tracking in uncontrolled background, and the system is capable for real-time face identification. The experiments also confirm the collaboration between cameras improves the identification performance
{"title":"Real-Time Face Identification Using Two Cooperative Active Cameras","authors":"Pichai Amnuaykanjanasin, S. Aramvith, T. Chalidabhongse","doi":"10.1109/ICARCV.2006.345071","DOIUrl":"https://doi.org/10.1109/ICARCV.2006.345071","url":null,"abstract":"This paper proposes a method for real-time face detection and identification using two cooperative pan-tilt-zoom (PTZ) cameras. For each camera, the human face is detected and segmented using motion and skin color cues. The face segment is then analyzed by considering the relative position of the facial color blob to determine the pose. After facial pose is estimated, the identification is performed using a face matching method based on color-distribution. Identification results with confidence values from both cameras are weighted combined to conclude the final result. Our experimental results demonstrate successful face detection and tracking in uncontrolled background, and the system is capable for real-time face identification. The experiments also confirm the collaboration between cameras improves the identification performance","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126492731","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 : 2006-12-01DOI: 10.1109/ICARCV.2006.345117
Jinyu Wang, Jun Liu, Dan-juan Bi
The concepts of viability and invariance about complex stochastic system are introduced, theorems of viability and invariance are proposed and proved to characterize rational decision. The concepts of mean square contingent cones, viability domain, invariance domain are also given. According to these definitions the conclusions we obtained are identical with those appeared in the reference literature. The work laid the theoretical foundation of the further study on quality viability attainability decision of complex stochastic system
{"title":"Viability Decision of Complex Stochastic System","authors":"Jinyu Wang, Jun Liu, Dan-juan Bi","doi":"10.1109/ICARCV.2006.345117","DOIUrl":"https://doi.org/10.1109/ICARCV.2006.345117","url":null,"abstract":"The concepts of viability and invariance about complex stochastic system are introduced, theorems of viability and invariance are proposed and proved to characterize rational decision. The concepts of mean square contingent cones, viability domain, invariance domain are also given. According to these definitions the conclusions we obtained are identical with those appeared in the reference literature. The work laid the theoretical foundation of the further study on quality viability attainability decision of complex stochastic system","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"27 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126063068","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 : 2006-12-01DOI: 10.1109/ICARCV.2006.345303
Fan Yang, D. Xiao
As the scale of systems increases, traditional models and fault diagnosis methods are not applicable. Qualitative signed directed graphs (QSDG) are used to model the variables and relationships among them in large-scale complex systems. However, they have distinct limitations of resulting spurious solutions due to the lack of utilization of knowledge or information. This article proposes a kind of probabilistic SDG (PSDG) model to describe the propagation of faults among variables. The fault diagnosis method is also investigated, where Bayesian network has been employed. Finally, examples are given and the future topics are listed
{"title":"Model and Fault Inference with the Framework of Probabilistic SDG","authors":"Fan Yang, D. Xiao","doi":"10.1109/ICARCV.2006.345303","DOIUrl":"https://doi.org/10.1109/ICARCV.2006.345303","url":null,"abstract":"As the scale of systems increases, traditional models and fault diagnosis methods are not applicable. Qualitative signed directed graphs (QSDG) are used to model the variables and relationships among them in large-scale complex systems. However, they have distinct limitations of resulting spurious solutions due to the lack of utilization of knowledge or information. This article proposes a kind of probabilistic SDG (PSDG) model to describe the propagation of faults among variables. The fault diagnosis method is also investigated, where Bayesian network has been employed. Finally, examples are given and the future topics are listed","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"209 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115972983","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 : 2006-12-01DOI: 10.1109/ICARCV.2006.345183
Fang Xu, Jiaoliao Chen, Libin Zhang, Hongwu Zhan
The greenhouse temperature model is built based on the balance of the energy. A new real-coded genetic algorithm (GA) for self-tuning fuzzy logic control (FLC) of greenhouse temperature is proposed, in which, an arithmetical crossover operator, a ranking-based reproduction operator and a non-uniform mutation operator are adopted. The Gaussian input membership functions for the error and the change-in-error of the temperature of FLC is optimized by GA in terms of the root-mean-square error (RMSE) with setpoint and input energy. Compared with the basic fuzzy control, the tuned FLC gives better performance in terms of improving control precision and saving energy
{"title":"Self-tuning Fuzzy Logic Control of Greenhouse Temperature using Real-coded Genetic Algorithm","authors":"Fang Xu, Jiaoliao Chen, Libin Zhang, Hongwu Zhan","doi":"10.1109/ICARCV.2006.345183","DOIUrl":"https://doi.org/10.1109/ICARCV.2006.345183","url":null,"abstract":"The greenhouse temperature model is built based on the balance of the energy. A new real-coded genetic algorithm (GA) for self-tuning fuzzy logic control (FLC) of greenhouse temperature is proposed, in which, an arithmetical crossover operator, a ranking-based reproduction operator and a non-uniform mutation operator are adopted. The Gaussian input membership functions for the error and the change-in-error of the temperature of FLC is optimized by GA in terms of the root-mean-square error (RMSE) with setpoint and input energy. Compared with the basic fuzzy control, the tuned FLC gives better performance in terms of improving control precision and saving energy","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121696041","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 : 2006-12-01DOI: 10.1109/ICARCV.2006.345367
T. Murata, Kuniko Saito
Analyzing users' Web log data and extracting their interests of Web-watching behaviors are important and challenging research topics of Web usage mining. Users visit their favorite sites and sometimes search new sites by performing keyword search on search engines. Users' Web-watching behaviors can be regarded as a graph since visited Web sites and entered search keywords are connected with each other in a time sequence. We call this graph as a site-keyword graph. This paper describes a method for clarifying users' interests based on an analysis of the site-keyword graph. The method is for extracting subgraphs representing users' routine visit from a site-keyword graph which is generated from augmented Web audience measurement data (Web log data). Experimental result shows that our new method succeeds in finding subgraphs which contain most of users' interested sites
{"title":"Extracting Keywords of Web Users' Interests and Visualizing their Routine Visits","authors":"T. Murata, Kuniko Saito","doi":"10.1109/ICARCV.2006.345367","DOIUrl":"https://doi.org/10.1109/ICARCV.2006.345367","url":null,"abstract":"Analyzing users' Web log data and extracting their interests of Web-watching behaviors are important and challenging research topics of Web usage mining. Users visit their favorite sites and sometimes search new sites by performing keyword search on search engines. Users' Web-watching behaviors can be regarded as a graph since visited Web sites and entered search keywords are connected with each other in a time sequence. We call this graph as a site-keyword graph. This paper describes a method for clarifying users' interests based on an analysis of the site-keyword graph. The method is for extracting subgraphs representing users' routine visit from a site-keyword graph which is generated from augmented Web audience measurement data (Web log data). Experimental result shows that our new method succeeds in finding subgraphs which contain most of users' interested sites","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127560541","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
扫码关注我们
求助内容：
应助结果提醒方式：