The traditional FTU controller based on single chip microcomputer has the lack of real-time, slow speed, simple function. According to these characteristics, the paper presents a new design method of FTU based on DSP, gives the detailed hardware design, focuses on the telemetry algorithm and algorithm of fault location selection, and the software design uses real-time multi-task operating system uC/OS -II as the software platform. In the end, field test datas proved that the device is of high precision, good stability and more real-time, it better meets the demands of Distribution Network Automation.
{"title":"The Design and Realization of New-Style Feeder Terminal Unit (FTU) Based on DSP","authors":"Na Wu, Yong-qin Wei, A-ying Wei, Xue-Hua Li","doi":"10.1109/ISCID.2012.160","DOIUrl":"https://doi.org/10.1109/ISCID.2012.160","url":null,"abstract":"The traditional FTU controller based on single chip microcomputer has the lack of real-time, slow speed, simple function. According to these characteristics, the paper presents a new design method of FTU based on DSP, gives the detailed hardware design, focuses on the telemetry algorithm and algorithm of fault location selection, and the software design uses real-time multi-task operating system uC/OS -II as the software platform. In the end, field test datas proved that the device is of high precision, good stability and more real-time, it better meets the demands of Distribution Network Automation.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114680735","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}
Decline curve is widely used in long term oil production forecast and recoverable reserves calculation. Oil field production decline analysis research is an important parts of oil field dynamic analysis. This paper analyzed and solved the production decline model, based on the high efficiency and high-speed of particle swarm algorithm, and combining the actual production of oil field, taking practical production time correction, computer automatic regression, and other means to making the calculation process more convenient, calculation results more realistic. Contrast experiment shows that the algorithm in this paper have high precision, small error, reliable result, can effectively applied to the production prediction in declining stage.
{"title":"The Study of Production Decline Curve Based on Particle Swarm Optimization","authors":"Qunhui Zhang, Jiawei Tang","doi":"10.1109/ISCID.2012.26","DOIUrl":"https://doi.org/10.1109/ISCID.2012.26","url":null,"abstract":"Decline curve is widely used in long term oil production forecast and recoverable reserves calculation. Oil field production decline analysis research is an important parts of oil field dynamic analysis. This paper analyzed and solved the production decline model, based on the high efficiency and high-speed of particle swarm algorithm, and combining the actual production of oil field, taking practical production time correction, computer automatic regression, and other means to making the calculation process more convenient, calculation results more realistic. Contrast experiment shows that the algorithm in this paper have high precision, small error, reliable result, can effectively applied to the production prediction in declining stage.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"136 1-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120928582","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}
Target kill probability is one of the most important tactical and technical index. Its calculation result is attended while the air-to-air missile is finalized the design. This paper is based of engineering such as development, experimentation and campaign. AHP was adopted to calculate air-to-air missile kill probability, by make use of various experiment data in development of air-to-air missile. Correlative math model was built. the air-to-air missile kill probability was evaluated synthetically by example.
{"title":"A Calculation Method of Kill Probability for Air-to-Air Missile","authors":"H. Lei, Zhaohui Hu","doi":"10.1109/ISCID.2012.70","DOIUrl":"https://doi.org/10.1109/ISCID.2012.70","url":null,"abstract":"Target kill probability is one of the most important tactical and technical index. Its calculation result is attended while the air-to-air missile is finalized the design. This paper is based of engineering such as development, experimentation and campaign. AHP was adopted to calculate air-to-air missile kill probability, by make use of various experiment data in development of air-to-air missile. Correlative math model was built. the air-to-air missile kill probability was evaluated synthetically by example.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127131369","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}
Considering the insufficient information used in interest model on mobile platform, we proposed a novel Interest Model (IM) with contextual information. Composite analysis is giving to the contextual information on mobile platform. Continually, an algorithm for contextual information matching based on Case-Based Reasoning (CBR) was raised. Presented hierarchical interest ontology with semantic relationship based on Open Dictionary Project (ODP). Meanwhile, proposed a method to model updating based on Spreading Activation Theory. The experiment showed that the IM could significantly improve the user experience.
{"title":"A Novel Interest Model with Contextual Information on Mobile Platform","authors":"Huijuan Zhang, Xin Xia, Shunwei Hou","doi":"10.1109/ISCID.2012.115","DOIUrl":"https://doi.org/10.1109/ISCID.2012.115","url":null,"abstract":"Considering the insufficient information used in interest model on mobile platform, we proposed a novel Interest Model (IM) with contextual information. Composite analysis is giving to the contextual information on mobile platform. Continually, an algorithm for contextual information matching based on Case-Based Reasoning (CBR) was raised. Presented hierarchical interest ontology with semantic relationship based on Open Dictionary Project (ODP). Meanwhile, proposed a method to model updating based on Spreading Activation Theory. The experiment showed that the IM could significantly improve the user experience.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125913281","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}
Earth magnetic field environment is divided into the main magnetic field and variable magnetic field. IGRF (International Geomagnetic Reference Field) is the internationally recognized model of main magnetic field nowadays. as for the variable magnetosphere model, Tsyganenko models are most widely used. Making use of the mapping of latitude and longitude to spatial location, we combine the two model's magnetic field vector linearly in GSM coordinates, and get the magnetic field lines and corresponding strength. Finally, the WebGL based on HTML5 standards is introduced to visualize a panoramic view of the geomagnetic magnetic field lines and its strength.
地球磁场环境分为主磁场和变磁场。IGRF (International Geomagnetic Reference Field)是目前国际上公认的主磁场模型。对于变磁层模型，Tsyganenko模型应用最为广泛。利用经纬度对空间位置的映射，将两个模型的磁场矢量在GSM坐标系下线性组合，得到磁场线和相应的磁场强度。最后，介绍了基于HTML5标准的WebGL可视化地磁磁力线及其强度全景图。
{"title":"Visualization of Geomagnetic Environment Based on WebGL","authors":"Li Xue, Qing Yangming, Liu Lei","doi":"10.1109/ISCID.2012.220","DOIUrl":"https://doi.org/10.1109/ISCID.2012.220","url":null,"abstract":"Earth magnetic field environment is divided into the main magnetic field and variable magnetic field. IGRF (International Geomagnetic Reference Field) is the internationally recognized model of main magnetic field nowadays. as for the variable magnetosphere model, Tsyganenko models are most widely used. Making use of the mapping of latitude and longitude to spatial location, we combine the two model's magnetic field vector linearly in GSM coordinates, and get the magnetic field lines and corresponding strength. Finally, the WebGL based on HTML5 standards is introduced to visualize a panoramic view of the geomagnetic magnetic field lines and its strength.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125370775","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}
Combining the static feature and the dynamic path in consecutive image array of small targets, this paper proposes a detecting method for small targets in sonar image: Improving the selection of (SRG) seeded region growing method, and defining the size of searching sub window, this paper realizes the selection of suspected targets in single image that have certain SRR (signal-to-reverberation ratio), to enhance the detection probability, we build the relative moving modal of vessel and targets, considering the shaking of vessel, obtain the searching limits and moving path of suspected targets in consecutive image array, and raise the principle of targets determination utilizing the IVF (intensity variation function). Experiment results show the validity of the algorithm.
{"title":"A Small Targets Tracking Method for Water Mine Sonar Image Array","authors":"Chao Wang, Keyu Jiang","doi":"10.1109/ISCID.2012.186","DOIUrl":"https://doi.org/10.1109/ISCID.2012.186","url":null,"abstract":"Combining the static feature and the dynamic path in consecutive image array of small targets, this paper proposes a detecting method for small targets in sonar image: Improving the selection of (SRG) seeded region growing method, and defining the size of searching sub window, this paper realizes the selection of suspected targets in single image that have certain SRR (signal-to-reverberation ratio), to enhance the detection probability, we build the relative moving modal of vessel and targets, considering the shaking of vessel, obtain the searching limits and moving path of suspected targets in consecutive image array, and raise the principle of targets determination utilizing the IVF (intensity variation function). Experiment results show the validity of the algorithm.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115181541","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}
As human action is uncertain and illegible, a human action recognition method basing on fuzzy support vector machine is presented. Fuzzy support vector machine employs the membership function to solve the unclassifiable areas which happens the traditional SVMs' two-class problems extend to the multi-class problems. the method is evaluated on the Weizmann action dataset and received comparative high correct recognition rate. the experimental results show that our approach has efficient recognition performance.
{"title":"Human Action Recognition Based on Fuzzy Support Vector Machines","authors":"Kan Li","doi":"10.1109/ISCID.2012.20","DOIUrl":"https://doi.org/10.1109/ISCID.2012.20","url":null,"abstract":"As human action is uncertain and illegible, a human action recognition method basing on fuzzy support vector machine is presented. Fuzzy support vector machine employs the membership function to solve the unclassifiable areas which happens the traditional SVMs' two-class problems extend to the multi-class problems. the method is evaluated on the Weizmann action dataset and received comparative high correct recognition rate. the experimental results show that our approach has efficient recognition performance.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122556869","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}
As a good artificial intelligent method, BP neural network has been applied in many engineering research questions. However, because of some inherent shortages, especially chaotic behaviors in the network learning, it is very difficult or impossible to apply the artificial neural network into complicated engineering tasks. to solve this problem, many methods had been proposed in the past time. One of the typical approaches is Master-Slave Neural Network (MSNN), whose master network is two Hop field networks, and the other slave network is a BP network, respectively. Although this new kind of method has more advantages than the BP network, such as a quick asymptotic convergence rate and the smallest network system errors, we can further enhance its performance. in this paper, based on the non-local property of fractional operator which is more approximate reality than traditional calculus, we extend the two Hop field networks in MSNN to the fractional net in which fractional equations describe its dynamical structure. after introducing the structure of Fractional Master-Slave Neural Network (FMSNN) and the concept of fractional calculus, we take a simulation for the FMSNN, MSNN and BP neural network respectively. the result shows this new kind of neural network has a quicker asymptotic convergence rate and a smaller network system error, which improves the performance of MSNN.
{"title":"Study on Characteristic of Fractional Master-Slave Neural Network","authors":"Yongming Jing, Huaying Dong, Guishu Liang","doi":"10.1109/ISCID.2012.279","DOIUrl":"https://doi.org/10.1109/ISCID.2012.279","url":null,"abstract":"As a good artificial intelligent method, BP neural network has been applied in many engineering research questions. However, because of some inherent shortages, especially chaotic behaviors in the network learning, it is very difficult or impossible to apply the artificial neural network into complicated engineering tasks. to solve this problem, many methods had been proposed in the past time. One of the typical approaches is Master-Slave Neural Network (MSNN), whose master network is two Hop field networks, and the other slave network is a BP network, respectively. Although this new kind of method has more advantages than the BP network, such as a quick asymptotic convergence rate and the smallest network system errors, we can further enhance its performance. in this paper, based on the non-local property of fractional operator which is more approximate reality than traditional calculus, we extend the two Hop field networks in MSNN to the fractional net in which fractional equations describe its dynamical structure. after introducing the structure of Fractional Master-Slave Neural Network (FMSNN) and the concept of fractional calculus, we take a simulation for the FMSNN, MSNN and BP neural network respectively. the result shows this new kind of neural network has a quicker asymptotic convergence rate and a smaller network system error, which improves the performance of MSNN.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114424536","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}
Nowadays, many researchers focus on developing learning systems with personalized learning mechanisms to adaptively provide learning paths in order to promote the learning performance of individual learner. Meanwhile, finding a suitable learning path has become a crucial issue for learners who want to learn new things quickly and effectively. We propose a personalized learning path recommender in this paper, which can recommend learning materials of every step in the learning process of a learner. as we all known, the performance of a recommender system depends on the accuracy of the user profiles used to represent the characteristics of the users. We firstly make advantage of social tags to construct user profiles. We consider that the knowledge units in the learning path have precedence relationship. then we make use of Bayes formula to predict the probability of the next learning materials within mostly similar learners. the Experiments show that our method is practical and effective.
{"title":"Personalized Learning Path Recommender Based on User Profile Using Social Tags","authors":"Dihua Xu, Zhijian Wang, Ke-Jia Chen, Weidong Huang","doi":"10.1109/ISCID.2012.133","DOIUrl":"https://doi.org/10.1109/ISCID.2012.133","url":null,"abstract":"Nowadays, many researchers focus on developing learning systems with personalized learning mechanisms to adaptively provide learning paths in order to promote the learning performance of individual learner. Meanwhile, finding a suitable learning path has become a crucial issue for learners who want to learn new things quickly and effectively. We propose a personalized learning path recommender in this paper, which can recommend learning materials of every step in the learning process of a learner. as we all known, the performance of a recommender system depends on the accuracy of the user profiles used to represent the characteristics of the users. We firstly make advantage of social tags to construct user profiles. We consider that the knowledge units in the learning path have precedence relationship. then we make use of Bayes formula to predict the probability of the next learning materials within mostly similar learners. the Experiments show that our method is practical and effective.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128569790","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}
Xiaohong Li, Keke Hu, Guofu Zhang, Jianguo Jiang, Zhaopin Su
Secret image sharing is introduced into the scheme of watermark generation in this paper, secret image sharing can reduce the amount of information bits substantially that embedded into video cover while guaranteeing the watermarking authentication. Base on this scheme a blind video watermarking algorithm for copyright protection is proposed, the value of the selected coefficient is modified adaptively according to the energy value of neighboring coefficients and the binary watermark bits. Experimental data show that the proposed algorithm improves the watermarking robustness against some common signal processing attacks liking salt-pepper noise and re-compression while maintaining the high video quality.
{"title":"An Adaptive Video Watermarking Based on Secret Image Sharing","authors":"Xiaohong Li, Keke Hu, Guofu Zhang, Jianguo Jiang, Zhaopin Su","doi":"10.1109/ISCID.2012.241","DOIUrl":"https://doi.org/10.1109/ISCID.2012.241","url":null,"abstract":"Secret image sharing is introduced into the scheme of watermark generation in this paper, secret image sharing can reduce the amount of information bits substantially that embedded into video cover while guaranteeing the watermarking authentication. Base on this scheme a blind video watermarking algorithm for copyright protection is proposed, the value of the selected coefficient is modified adaptively according to the energy value of neighboring coefficients and the binary watermark bits. Experimental data show that the proposed algorithm improves the watermarking robustness against some common signal processing attacks liking salt-pepper noise and re-compression while maintaining the high video quality.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124640949","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
扫码关注我们
求助内容：
应助结果提醒方式：