Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713148
Zhong Chen, Mingchang Zhao
In this paper, an adaptive spectral doppler estimation based on recursive least squares (RLS) algorithm is proposed for blood velocity distribution estimation. The purpose is to (i) minimize the observation window needed to estimate the spectral distribution and get better temporal resolution, (ii) adaptive estimate the spectral distribution using the current data. An optimization problem is built and solved by matrix gradient method and Matrix Inversion Lemma to get the optimal weighting coefficients and adaptive realization. Simulation results illustrate that the proposed scheme can significantly realize the purpose.
{"title":"Adaptive spectral doppler estimation based on RLS algorithm","authors":"Zhong Chen, Mingchang Zhao","doi":"10.1109/YCICT.2010.5713148","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713148","url":null,"abstract":"In this paper, an adaptive spectral doppler estimation based on recursive least squares (RLS) algorithm is proposed for blood velocity distribution estimation. The purpose is to (i) minimize the observation window needed to estimate the spectral distribution and get better temporal resolution, (ii) adaptive estimate the spectral distribution using the current data. An optimization problem is built and solved by matrix gradient method and Matrix Inversion Lemma to get the optimal weighting coefficients and adaptive realization. Simulation results illustrate that the proposed scheme can significantly realize the purpose.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128248468","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-11-01DOI: 10.1109/YCICT.2010.5713101
Fanliang Bu, Jianghua Wan
During any extreme event, especially the evacuation in crowded places. The keys to saving lives are orderly and efficient evacuations. We have improved the traditional particle swarm optimization. It can simulate non-adaptive crowd behavior in the crowd facilities during the emergency evacuation. We introduce the concept of the leader (trained staff) and the parameter of influence, and analyzed the influence of the leader on the evacuation process, especially the factors of the leader's distribution, number and influence. It will provide theoretical support for the evacuation of High-density facilities.
{"title":"The application and research on particle swam optimization in emergency evacuation","authors":"Fanliang Bu, Jianghua Wan","doi":"10.1109/YCICT.2010.5713101","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713101","url":null,"abstract":"During any extreme event, especially the evacuation in crowded places. The keys to saving lives are orderly and efficient evacuations. We have improved the traditional particle swarm optimization. It can simulate non-adaptive crowd behavior in the crowd facilities during the emergency evacuation. We introduce the concept of the leader (trained staff) and the parameter of influence, and analyzed the influence of the leader on the evacuation process, especially the factors of the leader's distribution, number and influence. It will provide theoretical support for the evacuation of High-density facilities.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132256029","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-11-01DOI: 10.1109/YCICT.2010.5713097
Xiaoming Zhang, Bingyu Sun, Tao Mei, Rujing Wang
In China, More than 458 cities and more than 50% of the population are distributed in natural disaster-prone areas. It is important to establish a complete post-disaster reconstruction and rehabilitation system to respond to sudden natural disasters. In order to get post-disaster restoration items scheduling, we invited experts to give the fuzzy preference relation coefficients on the restoration items. Then an optimization model was proposed based on the fuzzy preference relation. Inspired by the transmission mode of beans, a novel evolutionary algorithm namely Bean Optimization Algorithm (BOA) is proposed to solve the model and obtain ranking values of the items. The experimental result gives priority to the restoration of basic livelihood of the people and public service facilities. It is people-oriented in line with the principle of earthquake recovery and reconstruction planning of China.
{"title":"Post-disaster restoration based on fuzzy preference relation and Bean Optimization Algorithm","authors":"Xiaoming Zhang, Bingyu Sun, Tao Mei, Rujing Wang","doi":"10.1109/YCICT.2010.5713097","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713097","url":null,"abstract":"In China, More than 458 cities and more than 50% of the population are distributed in natural disaster-prone areas. It is important to establish a complete post-disaster reconstruction and rehabilitation system to respond to sudden natural disasters. In order to get post-disaster restoration items scheduling, we invited experts to give the fuzzy preference relation coefficients on the restoration items. Then an optimization model was proposed based on the fuzzy preference relation. Inspired by the transmission mode of beans, a novel evolutionary algorithm namely Bean Optimization Algorithm (BOA) is proposed to solve the model and obtain ranking values of the items. The experimental result gives priority to the restoration of basic livelihood of the people and public service facilities. It is people-oriented in line with the principle of earthquake recovery and reconstruction planning of China.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132297744","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-11-01DOI: 10.1109/YCICT.2010.5713136
Feng Liu, Xin Li, Bing-qi Zhang
Aim to avoid the deficiency of huge computation load and resource use in conventional fixed-point loop control method, base on the study of signal tracking method and accuracy of navigation receiver, an improved one is proposed, along with theoretical analysis and actual verification of the accuracy loss of signal tracking compared to the floating-point loop control method from the following two aspects respectively: quantization error of phase discriminator, approximation of filter coefficients, as well as the discipline when choosing appropriate filter coefficients. The results demonstrate that the accuracy loss of signal tracking in the improved method is very small with appropriate filter coefficients, which can be accepted.
{"title":"Analysis of an improved fixed-point loop for satellite navigation receiver","authors":"Feng Liu, Xin Li, Bing-qi Zhang","doi":"10.1109/YCICT.2010.5713136","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713136","url":null,"abstract":"Aim to avoid the deficiency of huge computation load and resource use in conventional fixed-point loop control method, base on the study of signal tracking method and accuracy of navigation receiver, an improved one is proposed, along with theoretical analysis and actual verification of the accuracy loss of signal tracking compared to the floating-point loop control method from the following two aspects respectively: quantization error of phase discriminator, approximation of filter coefficients, as well as the discipline when choosing appropriate filter coefficients. The results demonstrate that the accuracy loss of signal tracking in the improved method is very small with appropriate filter coefficients, which can be accepted.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128221528","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}
Content-based music information retrieval (CBMIR) has rapidly become a research focus for the areas of computer science, information retrieval, signal processing, audio processing and pattern recognition. Feature selection, representation and matching mechanism play the crucial roles in CBMIR. A new mechanism of similarity comparison has been proposed in this paper. Melody feature is represented in pitch interval based on physics and perception characteristic of music, which averts the effect by gross differences in key or tempo. The Longest matched subsequences (LMS) algorithm is proposed to obtain the most matched portions from two music pieces, according to local similarity between elements. A compound criterion of similarity evaluation is established, with both matched proportion and distance of matched subsequences being considered. The feasibility and validity of the model is verified by the experiment with a music feature database containing hundreds of songs.
{"title":"A new mechanism of similarity evaluation for content-based music information retrieval","authors":"Zhuoran Chen, Xingce Wang, Guoxing Zhao, Mingquan Zhou","doi":"10.1109/YCICT.2010.5713089","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713089","url":null,"abstract":"Content-based music information retrieval (CBMIR) has rapidly become a research focus for the areas of computer science, information retrieval, signal processing, audio processing and pattern recognition. Feature selection, representation and matching mechanism play the crucial roles in CBMIR. A new mechanism of similarity comparison has been proposed in this paper. Melody feature is represented in pitch interval based on physics and perception characteristic of music, which averts the effect by gross differences in key or tempo. The Longest matched subsequences (LMS) algorithm is proposed to obtain the most matched portions from two music pieces, according to local similarity between elements. A compound criterion of similarity evaluation is established, with both matched proportion and distance of matched subsequences being considered. The feasibility and validity of the model is verified by the experiment with a music feature database containing hundreds of songs.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133593926","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-11-01DOI: 10.1109/YCICT.2010.5713104
Zhao Yan
In order to make out the competitive landscape by identifying analysis information of business competitor, an improved CURE algorithm is used in this paper. By assigning weight value to identify element , the method overcomes the limits of representative point lack of represent. And the dynamic adjust of the weight value increases the flexibility of clustering. For the initial clustering results, further small class merged. It overcomes the unreasonable result by the shortest distance replaced with the similarity of two classes in this process. Finally, the result displayed by visual means. Theory analysis and experiment result show that it is a validate method to dynamic identifying analysis of competitor for enterprise.
{"title":"Research of an improved cure algorithm used in enterprise competitive intelligence to dynamic identify analysis","authors":"Zhao Yan","doi":"10.1109/YCICT.2010.5713104","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713104","url":null,"abstract":"In order to make out the competitive landscape by identifying analysis information of business competitor, an improved CURE algorithm is used in this paper. By assigning weight value to identify element , the method overcomes the limits of representative point lack of represent. And the dynamic adjust of the weight value increases the flexibility of clustering. For the initial clustering results, further small class merged. It overcomes the unreasonable result by the shortest distance replaced with the similarity of two classes in this process. Finally, the result displayed by visual means. Theory analysis and experiment result show that it is a validate method to dynamic identifying analysis of competitor for enterprise.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116601092","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-11-01DOI: 10.1109/YCICT.2010.5713066
Kui Han, Yongjie Yuan
A piezoelectric transducer such as the quartz crystal microbalance (QCM) oscillating at resonance was used to shake the bound particles free from the surface. A novel approach of generating multi-sinusoidal waves was proposed for measurement of QCM resonant frequency, in order to drive QCM at resonance for bond-rupture biosensing applications. It reveals MULTISIM simulation processing can much effectively determine QCM resonant frequency by an impedance-frequency profile.
{"title":"MULTISIM- simulation process for the resonant frequency measurement of quartz crystal microbalance","authors":"Kui Han, Yongjie Yuan","doi":"10.1109/YCICT.2010.5713066","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713066","url":null,"abstract":"A piezoelectric transducer such as the quartz crystal microbalance (QCM) oscillating at resonance was used to shake the bound particles free from the surface. A novel approach of generating multi-sinusoidal waves was proposed for measurement of QCM resonant frequency, in order to drive QCM at resonance for bond-rupture biosensing applications. It reveals MULTISIM simulation processing can much effectively determine QCM resonant frequency by an impedance-frequency profile.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125745306","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-11-01DOI: 10.1109/YCICT.2010.5713145
Yongan Xue, Yonghui Ge, Jinling Zhao
A practical data structure and algorithm was proposed in this paper. It is mainly used in drawing and editing polyline graphics in topographical maps. In this structure, the point sequence of graphic data is stored by the class (structure) arrays with two member variables. During drawing and editing graphics, reference points were setup to facilitate the graphics editing, such as moving points and sides, round angling and salient angling, etc. Using this algorithm, other operations, such as moving, rotating and zooming of whole graphics, can be derived. This method has such characteristics of high efficiency, strict theory support and clear geometric relationship. It must be efficient and flexible for drawing and editing polyline graphics of buildings, residential areas, pipelines, etc. of topographic map.
{"title":"A practical data structure and algorithm research on drawing and editing vector graphics","authors":"Yongan Xue, Yonghui Ge, Jinling Zhao","doi":"10.1109/YCICT.2010.5713145","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713145","url":null,"abstract":"A practical data structure and algorithm was proposed in this paper. It is mainly used in drawing and editing polyline graphics in topographical maps. In this structure, the point sequence of graphic data is stored by the class (structure) arrays with two member variables. During drawing and editing graphics, reference points were setup to facilitate the graphics editing, such as moving points and sides, round angling and salient angling, etc. Using this algorithm, other operations, such as moving, rotating and zooming of whole graphics, can be derived. This method has such characteristics of high efficiency, strict theory support and clear geometric relationship. It must be efficient and flexible for drawing and editing polyline graphics of buildings, residential areas, pipelines, etc. of topographic map.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126176238","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-11-01DOI: 10.1109/YCICT.2010.5713142
Zhiqiang Wang, Zhuangzhi Yan, Y. Qian, George Chen
To overcome the inefficiency of the traditional numerical methods that implement the anisotropic diffusion model for image denoising, a novel lattice Boltzmann model of anisotropic diffusion is presented in this paper. In the model, the diffusion rate is adapted to the image itself and independently set for each direction of diffusion. The mass accumulation is calculated through a weighted summation of the particle distribution functions. Our method is stable with large iteration steps thus reducing the iteration steps greatly. The experiment results showed that compared to others, our approach performs better in terms of the resulting images as well as computing efficiency. In addition, our approach is easy for parallel implementation.
{"title":"Lattice Boltzmann model of anisotropic diffusion for image denoising","authors":"Zhiqiang Wang, Zhuangzhi Yan, Y. Qian, George Chen","doi":"10.1109/YCICT.2010.5713142","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713142","url":null,"abstract":"To overcome the inefficiency of the traditional numerical methods that implement the anisotropic diffusion model for image denoising, a novel lattice Boltzmann model of anisotropic diffusion is presented in this paper. In the model, the diffusion rate is adapted to the image itself and independently set for each direction of diffusion. The mass accumulation is calculated through a weighted summation of the particle distribution functions. Our method is stable with large iteration steps thus reducing the iteration steps greatly. The experiment results showed that compared to others, our approach performs better in terms of the resulting images as well as computing efficiency. In addition, our approach is easy for parallel implementation.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130337866","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-11-01DOI: 10.1109/YCICT.2010.5713081
Jun Guo, Ying Ju, Yunsheng Wang, Xianli Li, Bin Zhang
Owing to the limitation of traditional software aging trend prediction method that based on time and based on measurement in dealing with sudden large scale concurrent questions, this paper proposes a new software aging trend prediction method which is based on user intention. This method predicts the trend of software aging according to the quantity of user requests for each components during the moment of system operation, and the software aging damage with each component is requested once.The experiment indicates, compared with the measurement method, this method has highter accuracy in dealing with sudden large scale concurrent questions.
{"title":"The prediction of software aging trend based on user intention","authors":"Jun Guo, Ying Ju, Yunsheng Wang, Xianli Li, Bin Zhang","doi":"10.1109/YCICT.2010.5713081","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713081","url":null,"abstract":"Owing to the limitation of traditional software aging trend prediction method that based on time and based on measurement in dealing with sudden large scale concurrent questions, this paper proposes a new software aging trend prediction method which is based on user intention. This method predicts the trend of software aging according to the quantity of user requests for each components during the moment of system operation, and the software aging damage with each component is requested once.The experiment indicates, compared with the measurement method, this method has highter accuracy in dealing with sudden large scale concurrent questions.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127303867","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
扫码关注我们
求助内容：
应助结果提醒方式：