Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5688005
Lei Wang, Qilin Zhang, Bin Yang
With the aim of finding the optimum design that maximizes the stiffness of shell structures, an automated approach for shape optimization of free-form surface is presented. The approach is employed to calculate the differential of total structural strain energy corresponding to surface height parameters. The surface height is adjusted iteratively according to its sensitivity to total structural strain energy. The shape of the shell is modified in the course of the process. The method has been implemented into a computational model and the feasibility of the approach is demonstrated using an example.
{"title":"Free form design for single layer shell structures","authors":"Lei Wang, Qilin Zhang, Bin Yang","doi":"10.1109/PIC.2010.5688005","DOIUrl":"https://doi.org/10.1109/PIC.2010.5688005","url":null,"abstract":"With the aim of finding the optimum design that maximizes the stiffness of shell structures, an automated approach for shape optimization of free-form surface is presented. The approach is employed to calculate the differential of total structural strain energy corresponding to surface height parameters. The surface height is adjusted iteratively according to its sensitivity to total structural strain energy. The shape of the shell is modified in the course of the process. The method has been implemented into a computational model and the feasibility of the approach is demonstrated using an example.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126746162","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-12-01DOI: 10.1109/PIC.2010.5687908
Yuan Ping, Huina Li
The state-of-the-art algorithms of fingerprint segmentation, usually based on square block, are too dependent on the images of high quality and regular shape, so they have many deficiencies in dealing with low quality or irregular fingerprint images, such as high complexity, time-consuming and unsatisfactory segmentation results, etc. In order to adapt to different quality images, the proposed algorithm follows the natural characteristics of human fingers and implements an adaptive segmentation based on rectangle block. Firstly, the images are divided into non-overlapping rectangular blocks with rows and columns of the ratio of 4∶3. Then, the algorithm, according to the statistical analysis, will determine whether each block is the prospect or not and end with the removal of isolated blocks by a smoothing filter. Experimental results show that the proposed algorithm has the advantages of time-saving and self-adaptability in dealing with different quality and shape of fingerprint images in comparison with the baseline.
{"title":"Fingerprint image segmentation based on rectangular block","authors":"Yuan Ping, Huina Li","doi":"10.1109/PIC.2010.5687908","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687908","url":null,"abstract":"The state-of-the-art algorithms of fingerprint segmentation, usually based on square block, are too dependent on the images of high quality and regular shape, so they have many deficiencies in dealing with low quality or irregular fingerprint images, such as high complexity, time-consuming and unsatisfactory segmentation results, etc. In order to adapt to different quality images, the proposed algorithm follows the natural characteristics of human fingers and implements an adaptive segmentation based on rectangle block. Firstly, the images are divided into non-overlapping rectangular blocks with rows and columns of the ratio of 4∶3. Then, the algorithm, according to the statistical analysis, will determine whether each block is the prospect or not and end with the removal of isolated blocks by a smoothing filter. Experimental results show that the proposed algorithm has the advantages of time-saving and self-adaptability in dealing with different quality and shape of fingerprint images in comparison with the baseline.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121432213","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-12-01DOI: 10.1109/PIC.2010.5687451
Wei Wang, Rong Mo, Zhiyong Chang, Huibin Sun
In order to improving the designing efficiency and achieving automation of airfoil optimization designing, A method which combined the airfoil parametric modeling software, the CFD software with Isight platform was presented, it was used to optimize the airfoil to ameliorate its aerodynamic performance. During the process of optimization designing, first, we adopted the design of experiment (DOE) method to search the designing space, achieved the optimal initialization design. Then, we adopted Non-dominated Sorting Genetic Algorithm (NSGA-II) to optimize the airfoil, got the optimal airfoil aerodynamic solution. The optimized solution proved that the aerodynamic performance of the airfoil has been significantly improved, which shows the optimization designing method was reasonable and feasible.
{"title":"Aerodynamic optimization designing of airfoil based on Isight","authors":"Wei Wang, Rong Mo, Zhiyong Chang, Huibin Sun","doi":"10.1109/PIC.2010.5687451","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687451","url":null,"abstract":"In order to improving the designing efficiency and achieving automation of airfoil optimization designing, A method which combined the airfoil parametric modeling software, the CFD software with Isight platform was presented, it was used to optimize the airfoil to ameliorate its aerodynamic performance. During the process of optimization designing, first, we adopted the design of experiment (DOE) method to search the designing space, achieved the optimal initialization design. Then, we adopted Non-dominated Sorting Genetic Algorithm (NSGA-II) to optimize the airfoil, got the optimal airfoil aerodynamic solution. The optimized solution proved that the aerodynamic performance of the airfoil has been significantly improved, which shows the optimization designing method was reasonable and feasible.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114196296","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-12-01DOI: 10.1109/PIC.2010.5687424
Feng Wang, Dexian Zhang, Lichun Man
To address the parameter optimization problem of plate color recognition, two approaches based on IA (immune algorithm) and GA (genetic algorithm) are proposed respectively. Theoretical comparison of IA and GA is first made. Then experimental comparison of the two algorithms is given by using them to perform the parameter optimization task for color recognition of license plates. For plate color recognition algorithm, color features are extracted in the HSV (hue, saturation, and value) color space and weighted fusion of the fuzzy maps on three components is utilized to perform color recognition. To improve the adaptability of recognition algorithm, weights of color feature components and thresholds of classification functions are optimized by immune and genetic algorithms respectively. Comparison experiments were conducted on three data sets. And the experimental results show that the immune-based approach achieves higher accuracy and smaller mean square deviation. From the theoretical and experimental comparisons, it is shown that many immune mechanisms, such as clonal explosion, immune supplementation, concentration adjustment, etc. can be used to solve the parameter optimization problem effectively and efficiently.
{"title":"Comparison of immune and genetic algorithms for parameter optimization of plate color recognition","authors":"Feng Wang, Dexian Zhang, Lichun Man","doi":"10.1109/PIC.2010.5687424","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687424","url":null,"abstract":"To address the parameter optimization problem of plate color recognition, two approaches based on IA (immune algorithm) and GA (genetic algorithm) are proposed respectively. Theoretical comparison of IA and GA is first made. Then experimental comparison of the two algorithms is given by using them to perform the parameter optimization task for color recognition of license plates. For plate color recognition algorithm, color features are extracted in the HSV (hue, saturation, and value) color space and weighted fusion of the fuzzy maps on three components is utilized to perform color recognition. To improve the adaptability of recognition algorithm, weights of color feature components and thresholds of classification functions are optimized by immune and genetic algorithms respectively. Comparison experiments were conducted on three data sets. And the experimental results show that the immune-based approach achieves higher accuracy and smaller mean square deviation. From the theoretical and experimental comparisons, it is shown that many immune mechanisms, such as clonal explosion, immune supplementation, concentration adjustment, etc. can be used to solve the parameter optimization problem effectively and efficiently.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116101014","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-12-01DOI: 10.1109/PIC.2010.5688006
Zhiming Meng, Xiaoqiang Liu, Genxing Yang, Lizhi Cai, Zhenyu Liu
With the wide using of information system, software users are demanding higher quality software and the software developers are pursue the “best-in-class” practice in a specific domain. But till now it is difficult to get an evaluation result due to lack of benchmark method. This paper proposes a systematic, practical and simplified evaluation methodology for domain specific software benchmarking. In this methodology, an evaluation model with software test characteristics (elementary set) and domain characteristics (extended set) is described; in order to weaken the uncertainty of subjective and objective, the rough set theory is applied to gain the attributes weights, and the gray analysis method is introduced to remedy the incomplete and inadequate information. The method is useful to assess characteristics, sub-characteristics and attribute that influence the domain specific software product quality qualitative and quantitative. The evaluation and benchmarking results prove that the model is practical and effective.
{"title":"A comprehensive evaluation methodology for domain specific software benchmarking","authors":"Zhiming Meng, Xiaoqiang Liu, Genxing Yang, Lizhi Cai, Zhenyu Liu","doi":"10.1109/PIC.2010.5688006","DOIUrl":"https://doi.org/10.1109/PIC.2010.5688006","url":null,"abstract":"With the wide using of information system, software users are demanding higher quality software and the software developers are pursue the “best-in-class” practice in a specific domain. But till now it is difficult to get an evaluation result due to lack of benchmark method. This paper proposes a systematic, practical and simplified evaluation methodology for domain specific software benchmarking. In this methodology, an evaluation model with software test characteristics (elementary set) and domain characteristics (extended set) is described; in order to weaken the uncertainty of subjective and objective, the rough set theory is applied to gain the attributes weights, and the gray analysis method is introduced to remedy the incomplete and inadequate information. The method is useful to assess characteristics, sub-characteristics and attribute that influence the domain specific software product quality qualitative and quantitative. The evaluation and benchmarking results prove that the model is practical and effective.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116234231","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-12-01DOI: 10.1109/PIC.2010.5687437
Lei Pan, Shen Jiong, P. Luh
Without considering the membership feature of each sampling point, both the local fuzzy recursive least-squares (FRLS) and the global FRLS algorithm cannot get an ideal online estimation precision of a Takagi-Sugeno (TS) fuzzy model. This paper proposes a novel mixed FRLS (MFRLS) algorithm for solving the problem. It dynamically makes a multiobjective cost function by weighting the local estimation and global estimation on the membership feature of the sampling point at each updating instant. Then the mixed co-variance matrix of the local and global estimation is deduced by solving the multiobjective optimization problem. Based on the mixed co-variance matrix, a set of MFRLS formula is obtained by further analytical deduction. The simulation experiments on a time-varying nonlinear model have proved the advantages of MFRLS.
{"title":"A mixed fuzzy recursive least-squares estimation for online identification of Takagi-Sugeno models","authors":"Lei Pan, Shen Jiong, P. Luh","doi":"10.1109/PIC.2010.5687437","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687437","url":null,"abstract":"Without considering the membership feature of each sampling point, both the local fuzzy recursive least-squares (FRLS) and the global FRLS algorithm cannot get an ideal online estimation precision of a Takagi-Sugeno (TS) fuzzy model. This paper proposes a novel mixed FRLS (MFRLS) algorithm for solving the problem. It dynamically makes a multiobjective cost function by weighting the local estimation and global estimation on the membership feature of the sampling point at each updating instant. Then the mixed co-variance matrix of the local and global estimation is deduced by solving the multiobjective optimization problem. Based on the mixed co-variance matrix, a set of MFRLS formula is obtained by further analytical deduction. The simulation experiments on a time-varying nonlinear model have proved the advantages of MFRLS.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115859507","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-12-01DOI: 10.1109/PIC.2010.5687433
J. Zeng, Yaoru Sun
In this paper, a novel model of pedestrian tracking by using object-based attention and human knowledge is presented. The selective units in the system are the objects and groupings which are space-driven as well as feature-driven. The factors of speed, motion direction and spatial location are used to cluster and form the groupings. Hierarchical selectivity of attention for objects in a grouping is implemented under the guide of human model knowledge with the help of a head detector. The motion cues are utilized to tackle the multi-person tracking through hierarchical selection of attention. The experimental results from outdoor environments are reported.
{"title":"Real-time pedestrian tracking by visual attention and human knowledge learning","authors":"J. Zeng, Yaoru Sun","doi":"10.1109/PIC.2010.5687433","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687433","url":null,"abstract":"In this paper, a novel model of pedestrian tracking by using object-based attention and human knowledge is presented. The selective units in the system are the objects and groupings which are space-driven as well as feature-driven. The factors of speed, motion direction and spatial location are used to cluster and form the groupings. Hierarchical selectivity of attention for objects in a grouping is implemented under the guide of human model knowledge with the help of a head detector. The motion cues are utilized to tackle the multi-person tracking through hierarchical selection of attention. The experimental results from outdoor environments are reported.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115957415","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-12-01DOI: 10.1109/PIC.2010.5687571
Fuxia Xu, Y. Dong
In order to describe the dependence structure of the two relief factors of debris flow of main channel length and drainage height difference, this paper provides an ordinal sum of a class of Copulas, such that its concordance measures of Kendall's τ and Spearman's ρ being suitable for the data. The parameters in Copulas are calculated to get some specific Copulas, which can be better fitting to the dependence structure of the two relief factors.
{"title":"Concordance measures of an ordinal sum of a class of Copulas","authors":"Fuxia Xu, Y. Dong","doi":"10.1109/PIC.2010.5687571","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687571","url":null,"abstract":"In order to describe the dependence structure of the two relief factors of debris flow of main channel length and drainage height difference, this paper provides an ordinal sum of a class of Copulas, such that its concordance measures of Kendall's τ and Spearman's ρ being suitable for the data. The parameters in Copulas are calculated to get some specific Copulas, which can be better fitting to the dependence structure of the two relief factors.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121827932","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-12-01DOI: 10.1109/PIC.2010.5687443
Yu Wei, Hongda Fan
This paper researches the problem of information consensus in networked multi-agent Continuous-time systems in the presence of undirected connected graph and different time delays. The analysis showed the essential relationship between the information consensus of multi-agent systems and the stability of continuous-time systems. Based on the theories of generalized Nyquist stability criterion and eigenvalue, it derived a sufficient condition to ensure the consensus of multi-agent continuous-time systems in the presence of undirected connected graph and input time delay. The simulation results coincide with the theoretical analysis, with the condition of undirected connected graph, and when the input delays are less than or equal to the standard delays given by the sufficient condition, the multi-agent systems can achieve consensus asymptotically.
{"title":"Consensus problems in multi-agent Continuous-time systems with time-delays","authors":"Yu Wei, Hongda Fan","doi":"10.1109/PIC.2010.5687443","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687443","url":null,"abstract":"This paper researches the problem of information consensus in networked multi-agent Continuous-time systems in the presence of undirected connected graph and different time delays. The analysis showed the essential relationship between the information consensus of multi-agent systems and the stability of continuous-time systems. Based on the theories of generalized Nyquist stability criterion and eigenvalue, it derived a sufficient condition to ensure the consensus of multi-agent continuous-time systems in the presence of undirected connected graph and input time delay. The simulation results coincide with the theoretical analysis, with the condition of undirected connected graph, and when the input delays are less than or equal to the standard delays given by the sufficient condition, the multi-agent systems can achieve consensus asymptotically.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127564534","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-12-01DOI: 10.1109/PIC.2010.5687592
Jianwei Zhang, Yanfang Song
In laboratory the velocity signal of Impinging Stream Mixer (ISM) was measured with Laser Doppler Anemometer. The velocity signal contains a lot of complicated information. Multiscale entropy (MSE) algorithm, which provides a way to measure complexity over a range of scales, was first used to analysis the complexity of the velocity time series in ISM. According to the MSE theory, draw up Matlab procedures for scientific computing. It is obtained that the choice of parameter has a strong influence on MSE by comparing MSE under different embedding dimension m and tolerance r. It is shown that the axial flow is in state of being dominant by computing MSE under different sections. To distinguish the velocity signal, MSE under different rotating speed were computed. The results indicate that MSE increases with the augment of the rotating speed, and the complexity increases homogeneously.
{"title":"Multiscale entropy analysis of the velocity signal in Impinging Stream Mixer","authors":"Jianwei Zhang, Yanfang Song","doi":"10.1109/PIC.2010.5687592","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687592","url":null,"abstract":"In laboratory the velocity signal of Impinging Stream Mixer (ISM) was measured with Laser Doppler Anemometer. The velocity signal contains a lot of complicated information. Multiscale entropy (MSE) algorithm, which provides a way to measure complexity over a range of scales, was first used to analysis the complexity of the velocity time series in ISM. According to the MSE theory, draw up Matlab procedures for scientific computing. It is obtained that the choice of parameter has a strong influence on MSE by comparing MSE under different embedding dimension m and tolerance r. It is shown that the axial flow is in state of being dominant by computing MSE under different sections. To distinguish the velocity signal, MSE under different rotating speed were computed. The results indicate that MSE increases with the augment of the rotating speed, and the complexity increases homogeneously.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132945894","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
扫码关注我们
求助内容：
应助结果提醒方式：