This paper deals with the stochastic stability problem for Markovian jumping Hopfield neural networks (MJHNNs) with time-varying delays and Wiener process. Our attention is focused on developing sufficient conditions on stochastic stability, even if the system contains Wiener process. All the obtained results are presented in terms of linear matrix inequality. The efficiency of the proposed results is demonstrated via two numerical examples
{"title":"LMI Approach for Stochastic Stability of Markovian Jumping Hopfield Neural Networks with Wiener Process","authors":"X. Lou, B. Cui","doi":"10.1109/ISDA.2006.187","DOIUrl":"https://doi.org/10.1109/ISDA.2006.187","url":null,"abstract":"This paper deals with the stochastic stability problem for Markovian jumping Hopfield neural networks (MJHNNs) with time-varying delays and Wiener process. Our attention is focused on developing sufficient conditions on stochastic stability, even if the system contains Wiener process. All the obtained results are presented in terms of linear matrix inequality. The efficiency of the proposed results is demonstrated via two numerical examples","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131661188","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-10-16DOI: 10.1109/ISDA.2006.253878
Jiguo Zeng, Yan F. Zhang, Shouyi Zhan
Due to their geometric complexity, reconstructing 3D tree models is a challenging problem. In this paper, we propose an approach to reconstruct 3D tree models using only a single image of trees without leaves, which is segmented from the background. This reconstruction process requires less user interaction. Firstly, the undirected graph topology of the plant is extracted from the given tree image. This is performed after image thinning, pixels classification, fake-branches deleting, line-segments fitting and width estimation. Secondly, the tree topology of the plant is obtained in terms of the plant growth regularity by determining the direction, the parent, and the first child of each edge in the undirected graph. Finally, the 3D tree models are reconstructed by rotating the branch and creating the 3D geometry of each branch based on the tree topology of the plant
{"title":"3D Tree Models Reconstruction from a Single Image","authors":"Jiguo Zeng, Yan F. Zhang, Shouyi Zhan","doi":"10.1109/ISDA.2006.253878","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253878","url":null,"abstract":"Due to their geometric complexity, reconstructing 3D tree models is a challenging problem. In this paper, we propose an approach to reconstruct 3D tree models using only a single image of trees without leaves, which is segmented from the background. This reconstruction process requires less user interaction. Firstly, the undirected graph topology of the plant is extracted from the given tree image. This is performed after image thinning, pixels classification, fake-branches deleting, line-segments fitting and width estimation. Secondly, the tree topology of the plant is obtained in terms of the plant growth regularity by determining the direction, the parent, and the first child of each edge in the undirected graph. Finally, the 3D tree models are reconstructed by rotating the branch and creating the 3D geometry of each branch based on the tree topology of the plant","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124363118","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-10-16DOI: 10.1109/ISDA.2006.253896
M. Jiang, Qin Chen
TCP combined with active queue management algorithm is the primary solution of the congestion control problem of IP network. Red and blue are the famous AQM algorithms but neither of them performs well when traffic load is heavy and when the traffic load changes. This paper proposes a new traffic load adaptive AQM algorithm named TLA. The objective of TLA is to stabilize the queue size m a wide variety of traffic scenarios. TLA considers not only the queue size but also the traffic load as the congestion indicator. So its drop probability can adapt to the changes of the traffic load and the congestion notification can be sent to sufficient TCP sources to mitigate the congestion level. Simulation results indicate that TLA can effectively stabilize the queue occupation independent of the number of active TCP connections thus resulting in a more predictable packet delay in the network
{"title":"TLA: A Traffic Load Adaptive Congestion Control Algorithm for TCP/AQM Networks","authors":"M. Jiang, Qin Chen","doi":"10.1109/ISDA.2006.253896","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253896","url":null,"abstract":"TCP combined with active queue management algorithm is the primary solution of the congestion control problem of IP network. Red and blue are the famous AQM algorithms but neither of them performs well when traffic load is heavy and when the traffic load changes. This paper proposes a new traffic load adaptive AQM algorithm named TLA. The objective of TLA is to stabilize the queue size m a wide variety of traffic scenarios. TLA considers not only the queue size but also the traffic load as the congestion indicator. So its drop probability can adapt to the changes of the traffic load and the congestion notification can be sent to sufficient TCP sources to mitigate the congestion level. Simulation results indicate that TLA can effectively stabilize the queue occupation independent of the number of active TCP connections thus resulting in a more predictable packet delay in the network","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114346472","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}
Shihai Zhang, Shu-jun Liu, Dong Wang, J. Ou, Guang-yuan Wang
First, evaluation indexes of association rule are provided; meaning of them is analyzed; the Apriori arithmetic about knowledge discovery is introduced and its defects are analyzed. Next, a knowledge discovery method of improved Apriori-based high-rise intelligent form selection is established. Finally, examples of this method are presented. This method provides a new approach to mining knowledge information in engineering cases, guiding structural form selection design and to improving quality, efficiency and intelligence level of structural design
{"title":"Knowledge Discovery of Improved Apriori-Based High-Rise Structure Intelligent Form Selection","authors":"Shihai Zhang, Shu-jun Liu, Dong Wang, J. Ou, Guang-yuan Wang","doi":"10.1109/ISDA.2006.179","DOIUrl":"https://doi.org/10.1109/ISDA.2006.179","url":null,"abstract":"First, evaluation indexes of association rule are provided; meaning of them is analyzed; the Apriori arithmetic about knowledge discovery is introduced and its defects are analyzed. Next, a knowledge discovery method of improved Apriori-based high-rise intelligent form selection is established. Finally, examples of this method are presented. This method provides a new approach to mining knowledge information in engineering cases, guiding structural form selection design and to improving quality, efficiency and intelligence level of structural design","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114591461","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-10-16DOI: 10.1109/ISDA.2006.253730
Xue Wang, Sheng Wang, Aiguo Jiang
Energy consumption is critical and the processing ability and memory of sensor nodes are limited in wireless sensor networks. Mobile agent technology can decrease energy consumption and boost network performance. Inadequate deployment of mobile agents might lead to network failure due to constraint bandwidth. In this paper, a deployment strategy of mobile agents in wireless sensor networks, which integrates the creation sequence, priority and energy consumption of mobile agents, is proposed. Genetic algorithm is engaged to optimize the strategy. Then the energy consumption and time delay of mobile agent model are compared with client/server model. The simulation results indicate that the optimized deployment strategy of mobile agents can efficiently decrease the energy consumption and time delay in wireless sensor network, and improve the real-time ability. Thus, the network lifetime is prolonged and the real-time ability is boosted. Finally, the performance of optimized deployment strategy of mobile agents has been validated in quality inspection on manufacturing
{"title":"Optimized Deployment Strategy of Mobile Agents in Wireless Sensor Networks","authors":"Xue Wang, Sheng Wang, Aiguo Jiang","doi":"10.1109/ISDA.2006.253730","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253730","url":null,"abstract":"Energy consumption is critical and the processing ability and memory of sensor nodes are limited in wireless sensor networks. Mobile agent technology can decrease energy consumption and boost network performance. Inadequate deployment of mobile agents might lead to network failure due to constraint bandwidth. In this paper, a deployment strategy of mobile agents in wireless sensor networks, which integrates the creation sequence, priority and energy consumption of mobile agents, is proposed. Genetic algorithm is engaged to optimize the strategy. Then the energy consumption and time delay of mobile agent model are compared with client/server model. The simulation results indicate that the optimized deployment strategy of mobile agents can efficiently decrease the energy consumption and time delay in wireless sensor network, and improve the real-time ability. Thus, the network lifetime is prolonged and the real-time ability is boosted. Finally, the performance of optimized deployment strategy of mobile agents has been validated in quality inspection on manufacturing","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114726189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The real time adaptive control of urban traffic, as a complex large system, usually needs to know the traffic of every intersection in advance. So traffic flow forecasting is a key problem in the real time adaptive control of urban traffic. This paper's research object is two typical adjacent intersections of city road. A double RBF NN model with classifying coefficient is presented. The space of high dimensional input samples is divided into two lower dimensional subspaces by the model. Then the nonlinear degree of the space samples is reduced greatly. Particle swarm optimization (PSO) algorithm is used to determine the parameters of two RBF NN respectively. The method not only simplifies the structure of RBF NN, but also enhances training speed and mapping accurate. The simulation results show the effectiveness of the model
{"title":"Urban Traffic Flow Forecasting Model of Double RBF Neural Network Based on PSO","authors":"Jianyu Zhao, L. Jia, Yuehui Chen, Xudong Wang","doi":"10.1109/ISDA.2006.277","DOIUrl":"https://doi.org/10.1109/ISDA.2006.277","url":null,"abstract":"The real time adaptive control of urban traffic, as a complex large system, usually needs to know the traffic of every intersection in advance. So traffic flow forecasting is a key problem in the real time adaptive control of urban traffic. This paper's research object is two typical adjacent intersections of city road. A double RBF NN model with classifying coefficient is presented. The space of high dimensional input samples is divided into two lower dimensional subspaces by the model. Then the nonlinear degree of the space samples is reduced greatly. Particle swarm optimization (PSO) algorithm is used to determine the parameters of two RBF NN respectively. The method not only simplifies the structure of RBF NN, but also enhances training speed and mapping accurate. The simulation results show the effectiveness of the model","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123480699","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-10-16DOI: 10.1109/ISDA.2006.253813
Yu Zhang, L. Zhang, Tiejun Zhao
In order to independently undertake complex missions in unstructured and unknown undersea environment, artificial intelligence techniques are needed to provide underwater glider with ability of active autonomy. Based on the RW (Ramadge & Wonham) supervisory control theory of discrete event dynamic system (DEDS), a three-level intelligence control architecture for underwater glider is brought forth. The DEDS formalism models of underwater glider in term of finite state automata (FSA) are built in detail, and the realization of decentralized supervisory control (DSC) system is presented in detail. The simulation experiment results show that the three-level supervisory control system not only coordinates properly sensing, planning and action, but also allows underwater glider to be both efficient and flexible in the face of change
{"title":"Discrete Decentralized Supervisory Control for Underwater Glider","authors":"Yu Zhang, L. Zhang, Tiejun Zhao","doi":"10.1109/ISDA.2006.253813","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253813","url":null,"abstract":"In order to independently undertake complex missions in unstructured and unknown undersea environment, artificial intelligence techniques are needed to provide underwater glider with ability of active autonomy. Based on the RW (Ramadge & Wonham) supervisory control theory of discrete event dynamic system (DEDS), a three-level intelligence control architecture for underwater glider is brought forth. The DEDS formalism models of underwater glider in term of finite state automata (FSA) are built in detail, and the realization of decentralized supervisory control (DSC) system is presented in detail. The simulation experiment results show that the three-level supervisory control system not only coordinates properly sensing, planning and action, but also allows underwater glider to be both efficient and flexible in the face of change","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123481754","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-10-16DOI: 10.1109/ISDA.2006.253879
M. Choraś, R. Choras
In the article we present discrete geometrical algorithms of open contours representation, feature extraction and recognition. The proposed algorithms were developed for ear biometrics, but they can be also applied in other contour image processing applications. Firstly we present mathematical and algorithmic foundations of our geometrical feature extraction methods. We also discuss their application and the achieved results for ear contour image analysis and recognition
{"title":"Geometrical Algorithms of Ear Contour Shape Representation and Feature Extraction","authors":"M. Choraś, R. Choras","doi":"10.1109/ISDA.2006.253879","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253879","url":null,"abstract":"In the article we present discrete geometrical algorithms of open contours representation, feature extraction and recognition. The proposed algorithms were developed for ear biometrics, but they can be also applied in other contour image processing applications. Firstly we present mathematical and algorithmic foundations of our geometrical feature extraction methods. We also discuss their application and the achieved results for ear contour image analysis and recognition","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123710977","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-10-16DOI: 10.1109/ISDA.2006.253872
G. Zhou, Yongzhao Zhan, Jianming Zhang
As one of the key techniques for futuristic human computer interaction, facial expression recognition has received much attention in recent years. A method of facial expression recognition based on selective feature extraction is presented in this paper. In this method we classify expressions roughly into three kinds according to the deformation of mouth firstly. Then we select some expression feature areas which contribute much to each kind expression according to the rough classification results and extract features for them. Lastly we classify expressions finely using method based on rule. Experiments show that facial expression recognition based on selective feature extraction can get high recognition rate and has strong robustness
{"title":"Facial Expression Recognition Based on Selective Feature Extraction","authors":"G. Zhou, Yongzhao Zhan, Jianming Zhang","doi":"10.1109/ISDA.2006.253872","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253872","url":null,"abstract":"As one of the key techniques for futuristic human computer interaction, facial expression recognition has received much attention in recent years. A method of facial expression recognition based on selective feature extraction is presented in this paper. In this method we classify expressions roughly into three kinds according to the deformation of mouth firstly. Then we select some expression feature areas which contribute much to each kind expression according to the rough classification results and extract features for them. Lastly we classify expressions finely using method based on rule. Experiments show that facial expression recognition based on selective feature extraction can get high recognition rate and has strong robustness","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121984736","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-10-16DOI: 10.1109/ISDA.2006.253774
Yongchao Gao, Qiqiang Li, Ran Ding, Jinsong Zhang
A new extremal optimization algorithm is proposed based on evolving networks. The algorithm makes use of extremal processes in natural, and eliminates the elements with the least fitness like in an evolving network. Each variable acts as a species with a defined fitness according to the optimization problem and N candidate solutions form the species population. The corresponding object of a solution is defined as its fitness. The quality of solutions is improved by mutations of unfit variables. In the species population, addition and removal of solutions is permitted according to their contribution to the objective, which means the solution with the best objective function value gives birth to a new candidate solution and the solution with the worst objective value disappears. The new solution will inherit the relations of its "mother" with others. Because of the availability of local information of variables and the power law probability of the selection of variables to mutate, the algorithm has both good local and global searching properties. The simple structure makes the algorithm direct available in combinatorial optimizations
{"title":"Extremal Optimization Algorithm on Evolving Networks","authors":"Yongchao Gao, Qiqiang Li, Ran Ding, Jinsong Zhang","doi":"10.1109/ISDA.2006.253774","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253774","url":null,"abstract":"A new extremal optimization algorithm is proposed based on evolving networks. The algorithm makes use of extremal processes in natural, and eliminates the elements with the least fitness like in an evolving network. Each variable acts as a species with a defined fitness according to the optimization problem and N candidate solutions form the species population. The corresponding object of a solution is defined as its fitness. The quality of solutions is improved by mutations of unfit variables. In the species population, addition and removal of solutions is permitted according to their contribution to the objective, which means the solution with the best objective function value gives birth to a new candidate solution and the solution with the worst objective value disappears. The new solution will inherit the relations of its \"mother\" with others. Because of the availability of local information of variables and the power law probability of the selection of variables to mutate, the algorithm has both good local and global searching properties. The simple structure makes the algorithm direct available in combinatorial optimizations","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124732286","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
扫码关注我们
求助内容：
应助结果提醒方式：