In this quickly developed and shifting era of Internet, how to make use of webpage indexing structure or search engines which let information demanders fast and precisely search and extract out advantage information has become extremely important capability in users on the Web. This paper combined a data mining tool SPSS Clementine with the domain ontology to mine out usefully important information from huge datum, and then to employ Java to develop an information recommender for scholars--- Onto Recommender, in which can recommend suitably important information to scholars. The preliminary experiment outcomes proved the reliability and validation of the recommender achieving the regular-level outcomes of information recommendation, and accordingly proved the feasibility of the related techniques proposed in this paper.
{"title":"Ontology-Supported Web Recommender for Scholar Information","authors":"Sheng-Yuan Yang, Chun-Liang Hsu","doi":"10.1109/HIS.2009.61","DOIUrl":"https://doi.org/10.1109/HIS.2009.61","url":null,"abstract":"In this quickly developed and shifting era of Internet, how to make use of webpage indexing structure or search engines which let information demanders fast and precisely search and extract out advantage information has become extremely important capability in users on the Web. This paper combined a data mining tool SPSS Clementine with the domain ontology to mine out usefully important information from huge datum, and then to employ Java to develop an information recommender for scholars--- Onto Recommender, in which can recommend suitably important information to scholars. The preliminary experiment outcomes proved the reliability and validation of the recommender achieving the regular-level outcomes of information recommendation, and accordingly proved the feasibility of the related techniques proposed in this paper.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126626161","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 de-noise result of traditional wavelet is related to the wavelet basis function. In the process of ultrasonic testing, flaw echo signal exited the characteristics of electrical noise, scattering noise in ultrasonic testing, which was sometimes very difficult to eliminate. Considering the distinctness of distribution between defects signals and noises, the second generation wavelet transform (SGWT) de-noising ultrasonic testing signal processing was proposed. Wavelet basis function with some special characteristic can be obtained by means of designing prediction and updating coefficient. Study mathematics properties of flaw echo signals and analyze the composition of noises and their characters in ultrasonic echo signals. The processed detail coefficient and the approximate coefficient are used to construct the signal. Wavelet transform coefficients of noise were filtered by changing threshold on the different scale and reconstructed the detection echo in order to enhance signal-to-noise ratio. The Experiments result shows that the method can improve the signal noise ratio and the distinguish ability of signals of different defects classes, and suppress energy attenuation as well as signal distortion efficiently. And flaw location accuracy and longitudinal resolution are advanced too.
{"title":"Ultrasonic Testing Signal Processing of Weld Flaw Based on the Second Generation Wavelet","authors":"Gaohua Liao, Junmei Xi","doi":"10.1109/HIS.2009.111","DOIUrl":"https://doi.org/10.1109/HIS.2009.111","url":null,"abstract":"The de-noise result of traditional wavelet is related to the wavelet basis function. In the process of ultrasonic testing, flaw echo signal exited the characteristics of electrical noise, scattering noise in ultrasonic testing, which was sometimes very difficult to eliminate. Considering the distinctness of distribution between defects signals and noises, the second generation wavelet transform (SGWT) de-noising ultrasonic testing signal processing was proposed. Wavelet basis function with some special characteristic can be obtained by means of designing prediction and updating coefficient. Study mathematics properties of flaw echo signals and analyze the composition of noises and their characters in ultrasonic echo signals. The processed detail coefficient and the approximate coefficient are used to construct the signal. Wavelet transform coefficients of noise were filtered by changing threshold on the different scale and reconstructed the detection echo in order to enhance signal-to-noise ratio. The Experiments result shows that the method can improve the signal noise ratio and the distinguish ability of signals of different defects classes, and suppress energy attenuation as well as signal distortion efficiently. And flaw location accuracy and longitudinal resolution are advanced too.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126904423","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}
A THz Image edge detection approach based on wavelet and Neural Network is proposed in this paper. First, the source image is decomposed by wavelet, the edges in the low-frequency sub-image are detected using Neural Network method and the edges in the high-frequency sub-images are detected using wavelet transform method on the coarsest level of the wavelet decomposition, the two edge images are fused according to some fusion rules to obtain the edge image of this level, it then is projected to the next level. Afterwards the final edge image of L-1 level is got according to some fusion rule. This process is repeated until reaching the 0 level thus to get the final integrated and clear edge image. The experimental results show that our approach based on fusion technique is superior to Canny operator method and wavelet transform method alone.
{"title":"A THz Image Edge Detection Method Based on Wavelet and Neural Network","authors":"Rong Wang, Lihua Li, Weijun Hong, N. Yang","doi":"10.1109/HIS.2009.298","DOIUrl":"https://doi.org/10.1109/HIS.2009.298","url":null,"abstract":"A THz Image edge detection approach based on wavelet and Neural Network is proposed in this paper. First, the source image is decomposed by wavelet, the edges in the low-frequency sub-image are detected using Neural Network method and the edges in the high-frequency sub-images are detected using wavelet transform method on the coarsest level of the wavelet decomposition, the two edge images are fused according to some fusion rules to obtain the edge image of this level, it then is projected to the next level. Afterwards the final edge image of L-1 level is got according to some fusion rule. This process is repeated until reaching the 0 level thus to get the final integrated and clear edge image. The experimental results show that our approach based on fusion technique is superior to Canny operator method and wavelet transform method alone.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127894681","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}
A soybean image noise smoothing method using multi-scale morphology is presented in this paper. The method is based on manipulating the intensity of scale-specific features present in the noisy image. Features at various scales are extracted by means of morphological filtering. The proposed scheme has been implemented by using morphological towers to smooth noise in images. The algorithm has been tested on sample images corrupted with various kinds of noise. The results have been compared with those of other standard methods. It is found that the performance of the proposed method is satisfactory and superior to other methods referred in this paper.
{"title":"A Soybean Image Noise Smoothing Method Using Multi-scale Morphology","authors":"Yuhua Chai, Danting Zhao, Rong Wang","doi":"10.1109/HIS.2009.302","DOIUrl":"https://doi.org/10.1109/HIS.2009.302","url":null,"abstract":"A soybean image noise smoothing method using multi-scale morphology is presented in this paper. The method is based on manipulating the intensity of scale-specific features present in the noisy image. Features at various scales are extracted by means of morphological filtering. The proposed scheme has been implemented by using morphological towers to smooth noise in images. The algorithm has been tested on sample images corrupted with various kinds of noise. The results have been compared with those of other standard methods. It is found that the performance of the proposed method is satisfactory and superior to other methods referred in this paper.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130989557","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}
In order to users be able to find their own favorite resources quickly and accurately, this paper presents a personalized service which recommends resources for users at massive education resources net. On the basis of analyzing the characteristics of users and resources, this paper discusses the model of resource’s description and user’s interest, and the treatment of user’s interest drift, then designs and describes the personalized service model and implementation. The service is applied to Basic Education Resources Net of Liaoning Province. The effectiveness of such service is proved.
{"title":"Research on Personalized Services for Users of Education Resources Net","authors":"Yongjun Jing, Xin Li, S. Zhong","doi":"10.1109/HIS.2009.253","DOIUrl":"https://doi.org/10.1109/HIS.2009.253","url":null,"abstract":"In order to users be able to find their own favorite resources quickly and accurately, this paper presents a personalized service which recommends resources for users at massive education resources net. On the basis of analyzing the characteristics of users and resources, this paper discusses the model of resource’s description and user’s interest, and the treatment of user’s interest drift, then designs and describes the personalized service model and implementation. The service is applied to Basic Education Resources Net of Liaoning Province. The effectiveness of such service is proved.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131087519","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}
Ant Colony Optimization (ACO) is a popular-based, artificial agent, general-search technique for the solution of difficult combinatorial problems. This paper presents a solution to the Resource-Constraint Project Scheduling Problem based on ACO algorithm. The method considers the quantified duration and resource as the heuristic information to calculate the accurate state transition probability and finally reaches the scheduling optimization. The described ACO algorithm is tested on a sample case taken from the literature and the parameters in ACO are determined by tests. The computational results validate the effectiveness of the proposed algorithm.
{"title":"A Solution to Resource-Constrained Project Scheduling Problem: Based on Ant Colony Optimization Algorithm","authors":"Yongbo Yuan, Kai Wang, Le Ding","doi":"10.1109/HIS.2009.92","DOIUrl":"https://doi.org/10.1109/HIS.2009.92","url":null,"abstract":"Ant Colony Optimization (ACO) is a popular-based, artificial agent, general-search technique for the solution of difficult combinatorial problems. This paper presents a solution to the Resource-Constraint Project Scheduling Problem based on ACO algorithm. The method considers the quantified duration and resource as the heuristic information to calculate the accurate state transition probability and finally reaches the scheduling optimization. The described ACO algorithm is tested on a sample case taken from the literature and the parameters in ACO are determined by tests. The computational results validate the effectiveness of the proposed algorithm.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131449471","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 User-based Security Model and its replay protection principium are firstly introduced and then a replay protection scheme based on random number is proposed to avoid baleful replay attack because of the inefficacy of the USM. A random number is used as the authentication between manager and agent in this scheme, and the number is changed on each message exchange to ensure the agent can identify the response message. The scheme is tested in the simulation platform by using snmp4j and Jpcap. Test result shows that the performance of the network management system based on this scheme is affected a little under replay attack.
{"title":"A SNMPv3 Replay Protection Scheme Used in Space Network Based on Random Number","authors":"Yueqiu Jiang, Kun Sun, Wenbo Zhang, Daozhu Zhang","doi":"10.1109/HIS.2009.189","DOIUrl":"https://doi.org/10.1109/HIS.2009.189","url":null,"abstract":"The User-based Security Model and its replay protection principium are firstly introduced and then a replay protection scheme based on random number is proposed to avoid baleful replay attack because of the inefficacy of the USM. A random number is used as the authentication between manager and agent in this scheme, and the number is changed on each message exchange to ensure the agent can identify the response message. The scheme is tested in the simulation platform by using snmp4j and Jpcap. Test result shows that the performance of the network management system based on this scheme is affected a little under replay attack.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132503634","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 automatic testing tools of component security bring great effect on component-based software engineering, and they can effectively ensure the security of component-based software. A prototype tool named CSTS (component security testing system) is designed and implemented to test the security of the widely-used COTS (Commercial-off-the-Shelf) Microsoft COM (component object model) component. CSTS, a GUI (graphical user interface) software, adopts both static and dynamic testing based on fault injection and dynamic monitoring. Firstly, CSTS analyzes component type information and statically injects parameter faults into interface methods. Secondly, environment faults such as memory fault, file fault and process fault are injected into the tested component when the component is driven. Dynamic monitoring mechanism can monitor the running process of component and analyze the component security exceptions. Some commercial components were tested in the CSTS. The experimental results show that CSTS is effective and operable.
组件安全自动化测试工具对基于组件的软件工程产生了巨大的影响，它们可以有效地保证基于组件的软件的安全性。设计并实现了一个原型工具CSTS(组件安全性测试系统)，用于测试广泛使用的COTS (commercial -off- shelf) Microsoft COM(组件对象模型)组件的安全性。CSTS是一个GUI(图形用户界面)软件，采用基于故障注入和动态监控的静态和动态测试。CSTS首先对组件类型信息进行分析，并在接口方法中静态注入参数故障。其次，在驱动被测组件时，将内存故障、文件故障和进程故障等环境故障注入被测组件;动态监控机制可以监控组件的运行过程，分析组件的安全异常。一些商业部件在CSTS中进行了测试。实验结果表明，CSTS是有效的、可操作的。
{"title":"CSTS: A Prototype Tool for Testing COM Component Security","authors":"Jinfu Chen, Yansheng Lu, Xiaodong Xie","doi":"10.1109/HIS.2009.229","DOIUrl":"https://doi.org/10.1109/HIS.2009.229","url":null,"abstract":"The automatic testing tools of component security bring great effect on component-based software engineering, and they can effectively ensure the security of component-based software. A prototype tool named CSTS (component security testing system) is designed and implemented to test the security of the widely-used COTS (Commercial-off-the-Shelf) Microsoft COM (component object model) component. CSTS, a GUI (graphical user interface) software, adopts both static and dynamic testing based on fault injection and dynamic monitoring. Firstly, CSTS analyzes component type information and statically injects parameter faults into interface methods. Secondly, environment faults such as memory fault, file fault and process fault are injected into the tested component when the component is driven. Dynamic monitoring mechanism can monitor the running process of component and analyze the component security exceptions. Some commercial components were tested in the CSTS. The experimental results show that CSTS is effective and operable.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131731098","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}
A fast rerouting scheme is proposed to guarantee the QoS performance of rerouted path when handling link and node failures. The new scheme is based on deflection routing mechanism and improves on two aspects: first, it can promptly handle single node failure as well as single link failure, second, QoS metric is taken into accounted when calculating recovery routes. Simulation results show that the proposed scheme could achieve as optimal performance as constrained Bellman-Ford algorithm.
{"title":"Optimizing the QoS Performance of Fast Rerouting","authors":"X. Li, Zhen Qin, Tao Yu","doi":"10.1109/HIS.2009.277","DOIUrl":"https://doi.org/10.1109/HIS.2009.277","url":null,"abstract":"A fast rerouting scheme is proposed to guarantee the QoS performance of rerouted path when handling link and node failures. The new scheme is based on deflection routing mechanism and improves on two aspects: first, it can promptly handle single node failure as well as single link failure, second, QoS metric is taken into accounted when calculating recovery routes. Simulation results show that the proposed scheme could achieve as optimal performance as constrained Bellman-Ford algorithm.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129209202","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}
Based on the analysis of the EPC Binary-tree algorithm, an improved algorithm is proposed. Compared with EPC Binary-tree algorithm the proposed algorithm will get more efficiency, higher utilization, and much more precision with fewer slots.
{"title":"An Improved Anti-collision Algorithm in RFID System","authors":"Jia-lin Ma, Xu Wei","doi":"10.1109/HIS.2009.241","DOIUrl":"https://doi.org/10.1109/HIS.2009.241","url":null,"abstract":"Based on the analysis of the EPC Binary-tree algorithm, an improved algorithm is proposed. Compared with EPC Binary-tree algorithm the proposed algorithm will get more efficiency, higher utilization, and much more precision with fewer slots.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128543397","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
扫码关注我们
求助内容：
应助结果提醒方式：