The flow and conduction characteristic of fluid in radiator after step change of flux is analyzed. The "level-move" presumption of temperature distribution curve in radiator during transient is put forward. On the basis of the presumption, the function relationship of heat quantity of radiator and time during transient is deduced, and the validity of the function relationship is proved through experimentation. These conclusions offered the valuable reference for the moving characteristic research of the new heating measurement and control system.
{"title":"Study on Dynamic Heat Measurement Method afterStep Change of System's Flux","authors":"L. Xiaoting, Fang Lide","doi":"10.1109/ISDA.2006.49","DOIUrl":"https://doi.org/10.1109/ISDA.2006.49","url":null,"abstract":"The flow and conduction characteristic of fluid in radiator after step change of flux is analyzed. The \"level-move\" presumption of temperature distribution curve in radiator during transient is put forward. On the basis of the presumption, the function relationship of heat quantity of radiator and time during transient is deduced, and the validity of the function relationship is proved through experimentation. These conclusions offered the valuable reference for the moving characteristic research of the new heating measurement and control system.","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"67 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":"124140747","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}
For improving intellectualized management level of holiday tourism and making a contribution to the healthy, orderly and safely development of holiday tourism, we built the tourism requirement forecasting model on the basis of RBF neural network, realized the classification, analysed and forecasted the tourism status and realized the intellectualized management of holiday tourism. It was used to generate RBF net to perform function approximation. Random cluster and linear program are brought in to design and train this "mixed" RBF net
{"title":"Forecasting Model of Holiday Tourism Requirement on the Basis of RBF Neural Network","authors":"Guo Wensheng, Du Junping, Wan Ruijie","doi":"10.1109/ISDA.2006.153","DOIUrl":"https://doi.org/10.1109/ISDA.2006.153","url":null,"abstract":"For improving intellectualized management level of holiday tourism and making a contribution to the healthy, orderly and safely development of holiday tourism, we built the tourism requirement forecasting model on the basis of RBF neural network, realized the classification, analysed and forecasted the tourism status and realized the intellectualized management of holiday tourism. It was used to generate RBF net to perform function approximation. Random cluster and linear program are brought in to design and train this \"mixed\" RBF net","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"21 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":"125695914","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.253920
Xiaohong Kong, Jun Sun, Wenbo Xu
A distributed heterogeneous system consists of a suite of processors or machines with different processing capacities. It can be performance-to-cost efficient to meet the diverse computation requirements if properly deployed. Task scheduling is a crucial issue to improve the efficiency of this architecture. In this paper, we incorporate an efficient population-based search technique, particle swarm optimization (PSO), with list scheduling and propose a hybrid PSO algorithm for tasks scheduling. We also compare a few assigning rules to select target machine with different processing speeds for different tasks. The experiment results show that the proposed algorithm outperforms other algorithms in these aspects of performance and scalability
{"title":"Particle Swarm Algorithm for Tasks Scheduling in Distributed Heterogeneous System","authors":"Xiaohong Kong, Jun Sun, Wenbo Xu","doi":"10.1109/ISDA.2006.253920","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253920","url":null,"abstract":"A distributed heterogeneous system consists of a suite of processors or machines with different processing capacities. It can be performance-to-cost efficient to meet the diverse computation requirements if properly deployed. Task scheduling is a crucial issue to improve the efficiency of this architecture. In this paper, we incorporate an efficient population-based search technique, particle swarm optimization (PSO), with list scheduling and propose a hybrid PSO algorithm for tasks scheduling. We also compare a few assigning rules to select target machine with different processing speeds for different tasks. The experiment results show that the proposed algorithm outperforms other algorithms in these aspects of performance and scalability","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"19 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":"121771435","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.253758
Shu Zhan, T. Kurihara, S. Ando
3D facial orientation and eye-gaze detection is one hot area in human-machine interaction and application, it is also a challenging field in computer vision, pattern recognition and image sensing. We designed a real-time 3D facial orientation and eye-gaze detection system based on 3D real-time facial imaging system by using three-phase correlation image sensor. Based on the normal vector map and intensity image obtained by our imaging system simultaneously, the differential geometry theory is employed to find the key points of face image, according to these key points and curvature feature of face, the important eye area could be segmented from the face image. The optical flow algorithm originally presented by Bruce D. Lucas and Takeo Kanade is implemented to get the detection result. The experiments show that the performance for our test is satisfying
三维人脸定位与人眼注视检测是人机交互与应用的一个热点领域，也是计算机视觉、模式识别和图像感知领域的一个具有挑战性的领域。在三维实时人脸成像系统的基础上，利用三相相关图像传感器设计了一种实时三维人脸方位与视线检测系统。基于成像系统同时获得的法向量图和强度图像，利用微分几何理论找到人脸图像的关键点，根据关键点和人脸的曲率特征，从人脸图像中分割出重要的眼睛区域。实现了Bruce D. Lucas和Takeo Kanade最初提出的光流算法来获得检测结果。实验表明，我们的测试结果令人满意
{"title":"Facial Orientation and Eye-Gaze Detection Based on Real-Time 3D Facial Imaging By Using Correlation Image Sensor","authors":"Shu Zhan, T. Kurihara, S. Ando","doi":"10.1109/ISDA.2006.253758","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253758","url":null,"abstract":"3D facial orientation and eye-gaze detection is one hot area in human-machine interaction and application, it is also a challenging field in computer vision, pattern recognition and image sensing. We designed a real-time 3D facial orientation and eye-gaze detection system based on 3D real-time facial imaging system by using three-phase correlation image sensor. Based on the normal vector map and intensity image obtained by our imaging system simultaneously, the differential geometry theory is employed to find the key points of face image, according to these key points and curvature feature of face, the important eye area could be segmented from the face image. The optical flow algorithm originally presented by Bruce D. Lucas and Takeo Kanade is implemented to get the detection result. The experiments show that the performance for our test is satisfying","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"35 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":"115946823","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}
Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation part. In this paper, an efficient tradeoff multiplier implementation between full parallel and full serial multiplier is proposed based on optimal normal basis of type II and shifted canonical basis. Experiments show that the multiplier is suitable to realize in FPGA device
{"title":"Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis","authors":"Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu","doi":"10.1109/ISDA.2006.138","DOIUrl":"https://doi.org/10.1109/ISDA.2006.138","url":null,"abstract":"Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation part. In this paper, an efficient tradeoff multiplier implementation between full parallel and full serial multiplier is proposed based on optimal normal basis of type II and shifted canonical basis. Experiments show that the multiplier is suitable to realize in FPGA device","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"2 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131457152","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.253712
Yue Liu, Mingjun Liu
The automatic recognition algorithm of quick response code is discussed in this paper. An image processing system based on embedded system is described to be able to binarization, location, segment, and decoding the QR code. In order to adapting various sizes, various gray-level values, and under various lighting conditions of real bar code image, a high-speed, high-accuracy binarization method is developed, which can locate the finder pattern accurately and integrate the local thresholding method with global thresholding. Experiments have shown that over 99% barcode can be optimally recognized with the proposed algorithm. It can achieve higher recognition rate of high density bar code, and is applicable to real world scene image
{"title":"Automatic Recognition Algorithm of Quick Response Code Based on Embedded System","authors":"Yue Liu, Mingjun Liu","doi":"10.1109/ISDA.2006.253712","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253712","url":null,"abstract":"The automatic recognition algorithm of quick response code is discussed in this paper. An image processing system based on embedded system is described to be able to binarization, location, segment, and decoding the QR code. In order to adapting various sizes, various gray-level values, and under various lighting conditions of real bar code image, a high-speed, high-accuracy binarization method is developed, which can locate the finder pattern accurately and integrate the local thresholding method with global thresholding. Experiments have shown that over 99% barcode can be optimally recognized with the proposed algorithm. It can achieve higher recognition rate of high density bar code, and is applicable to real world scene image","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":"132328983","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.253857
Chong Fan, Jianjun Zhu, J. Gong, Cuilin Kuang
This paper introduces the keren sub-pixel registration method and point out its disadvantage. Moreover, this paper put forward a new improvement approach about keren method and its iterative method. The improvement approach takes the four parameters affine transformation model instead of the rigid body transformation model. This change avoids the error that is brought on by the tailor series expansion of angle and improves the precise of image registration greatly. The experiment shows that the improvement approach makes less absolute error of angle than keren method and its iterative algorithm. The improvement approach makes the absolute error of translation parameters under 0.1 pixels in the case of the rotation angel of 15 degree and under 0.01 pixels in the case of the small rotation angle using our pictures. At last, the projection onto convex set (POCS) method is used to reconstruct high-resolution image from several low-resolution image sequences. As a result, we find that the reconstruction algorithm based on our improvement registration approach has better effect than the reconstruction algorithm based on keren iterative registration method
{"title":"POCS Super-Resolution Sequence Image Reconstruction Based on Improvement Approach of Keren Registration Method","authors":"Chong Fan, Jianjun Zhu, J. Gong, Cuilin Kuang","doi":"10.1109/ISDA.2006.253857","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253857","url":null,"abstract":"This paper introduces the keren sub-pixel registration method and point out its disadvantage. Moreover, this paper put forward a new improvement approach about keren method and its iterative method. The improvement approach takes the four parameters affine transformation model instead of the rigid body transformation model. This change avoids the error that is brought on by the tailor series expansion of angle and improves the precise of image registration greatly. The experiment shows that the improvement approach makes less absolute error of angle than keren method and its iterative algorithm. The improvement approach makes the absolute error of translation parameters under 0.1 pixels in the case of the rotation angel of 15 degree and under 0.01 pixels in the case of the small rotation angle using our pictures. At last, the projection onto convex set (POCS) method is used to reconstruct high-resolution image from several low-resolution image sequences. As a result, we find that the reconstruction algorithm based on our improvement registration approach has better effect than the reconstruction algorithm based on keren iterative registration method","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"107 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":"132456634","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.253770
Thitaree Noothong, D. Sutivong
The Bayesian networks support resource allocation in software project and also help in analyzing trade-offs among resources. The model predicts the probability distribution of every variable given incomplete data. Even though the Bayesian networks conveniently facilitate scenario-based analysis, they do not support finding an optimal solution in multi-criteria decision making. This paper proposes extending the Bayesian networks into the decision networks to optimize an organizational target and to handle the multi-criteria environment of software project management. Specifically, the decision networks are used to find an optimal set of software activities under constraints of software cost and quality. The preliminary results demonstrate that the Bayesian networks can be easily extended into the decision networks, which then allow for optimization. The proposed methodology provides a flexible process for utilizing the encoded knowledge within the Bayesian networks to facilitate decision making, which could be applicable in other domains of problems
{"title":"Software Project Management Using Decision Networks","authors":"Thitaree Noothong, D. Sutivong","doi":"10.1109/ISDA.2006.253770","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253770","url":null,"abstract":"The Bayesian networks support resource allocation in software project and also help in analyzing trade-offs among resources. The model predicts the probability distribution of every variable given incomplete data. Even though the Bayesian networks conveniently facilitate scenario-based analysis, they do not support finding an optimal solution in multi-criteria decision making. This paper proposes extending the Bayesian networks into the decision networks to optimize an organizational target and to handle the multi-criteria environment of software project management. Specifically, the decision networks are used to find an optimal set of software activities under constraints of software cost and quality. The preliminary results demonstrate that the Bayesian networks can be easily extended into the decision networks, which then allow for optimization. The proposed methodology provides a flexible process for utilizing the encoded knowledge within the Bayesian networks to facilitate decision making, which could be applicable in other domains of problems","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":"130081956","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}
Dry point of aviation kerosene in the atmospheric distillation column is a very important process value for quality controlling. But unfortunately few on-line hardware sensors are available to this value or such sensors are difficult to maintain. This paper adopts a novel method based on least squares support vector machine (LS-SVM) regression to implement on-line estimation of aviation kerosene dry point. Compared to traditional radial basis function (RBF) neural network and squares support vector machine (SVM) regression methods, using the same sample data, the simulation results show that the soft sensing based on LS-SVM regression has better abilities of model generalization and real-time character
{"title":"Soft Sensing Based on LS-SVM and Its Application to a Distillation Column","authors":"Yafen Li, Qi Li, Huijuan Wang, Ning‐Tao Ma","doi":"10.1109/ISDA.2006.246","DOIUrl":"https://doi.org/10.1109/ISDA.2006.246","url":null,"abstract":"Dry point of aviation kerosene in the atmospheric distillation column is a very important process value for quality controlling. But unfortunately few on-line hardware sensors are available to this value or such sensors are difficult to maintain. This paper adopts a novel method based on least squares support vector machine (LS-SVM) regression to implement on-line estimation of aviation kerosene dry point. Compared to traditional radial basis function (RBF) neural network and squares support vector machine (SVM) regression methods, using the same sample data, the simulation results show that the soft sensing based on LS-SVM regression has better abilities of model generalization and real-time character","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"13 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":"130087329","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.253738
Danming Sun, Shuping Yao, Mingqian Sun
As the application of the large scale information network, the mount of the content in the network is increased sharply. This brings the challenge to the technology of searching and monitoring information content. In this article, it is introduced an information locating strategy, which is based on multi-agent and can be distributed and work parallel. The concept of search-degree and search-rewards are introduced for the agents in the overall system can work simultaneously. The object of work is to search the numerous information nodes or Websites at a very fast speed and not needing occupying too much of network resources. At the same time, some most important information can be monitored for content management. The description and algorithm of the multi-agent information searching system structure and the strategy is given in this paper
{"title":"A Multi-Agent Based Information Locating Strategy with Rewards Evaluation","authors":"Danming Sun, Shuping Yao, Mingqian Sun","doi":"10.1109/ISDA.2006.253738","DOIUrl":"https://doi.org/10.1109/ISDA.2006.253738","url":null,"abstract":"As the application of the large scale information network, the mount of the content in the network is increased sharply. This brings the challenge to the technology of searching and monitoring information content. In this article, it is introduced an information locating strategy, which is based on multi-agent and can be distributed and work parallel. The concept of search-degree and search-rewards are introduced for the agents in the overall system can work simultaneously. The object of work is to search the numerous information nodes or Websites at a very fast speed and not needing occupying too much of network resources. At the same time, some most important information can be monitored for content management. The description and algorithm of the multi-agent information searching system structure and the strategy is given in this paper","PeriodicalId":116729,"journal":{"name":"Sixth International Conference on Intelligent Systems Design and Applications","volume":"38 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":"130141653","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
扫码关注我们
求助内容：
应助结果提醒方式：