Directed diffusion is a classic data-centric routing protocol in Wireless Sensor Networks (WSNs). In directed diffusion based WSNs, data generated by sensor nodes is named by attribute-value pairs. A sink requests data by sending interests. The data that match the interests are then "drawn" down towards the sink. Intermediate nodes cache or transform data, and direct the interests based on previously cached data. In general, energy resources are limited in WSNs, therefore, energy saving becomes the most important consideration in designing routing protocols. In the directed diffusion, the path reinforcement scheme is designed for minimum delay and maximum data received during a certain period of time. However, the communication cost and energy balance over the whole WSNs have not been paid enough attention. To address these issues, we propose a novel path reinforcement scheme. Our proposed protocol is simulated and compared with the directed diffusion. The simulation results show that the proposed protocol is outperform directed diffusion in energy efficiency, energy balance over WSNs, and network lifetime. Key Words Directed diffusion, Routing protocol, Energy efficient, Reinforcement
{"title":"An Energy Efficient Directed Diffusion Routing Protocol","authors":"Shousheng Zhao, Fengqi Yu, Bao-hua Zhao","doi":"10.1109/CIS.2007.70","DOIUrl":"https://doi.org/10.1109/CIS.2007.70","url":null,"abstract":"Directed diffusion is a classic data-centric routing protocol in Wireless Sensor Networks (WSNs). In directed diffusion based WSNs, data generated by sensor nodes is named by attribute-value pairs. A sink requests data by sending interests. The data that match the interests are then \"drawn\" down towards the sink. Intermediate nodes cache or transform data, and direct the interests based on previously cached data. In general, energy resources are limited in WSNs, therefore, energy saving becomes the most important consideration in designing routing protocols. In the directed diffusion, the path reinforcement scheme is designed for minimum delay and maximum data received during a certain period of time. However, the communication cost and energy balance over the whole WSNs have not been paid enough attention. To address these issues, we propose a novel path reinforcement scheme. Our proposed protocol is simulated and compared with the directed diffusion. The simulation results show that the proposed protocol is outperform directed diffusion in energy efficiency, energy balance over WSNs, and network lifetime. Key Words Directed diffusion, Routing protocol, Energy efficient, Reinforcement","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129970575","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}
Learning occurs when previous perceptions of reality are not in harmony with current experience, creating dissonance. To deepen understanding of the complexities of adult learning, this study presents the relationship within students' mode of study, the aims of learning and the motivation of choosing the course in further education. Associating rule mining will be used to explore the dataset, associate with these three factors and extract valuable rules. Several important adult learning theories will be reviewed and applied to examine the result. This research will provide valuable insight into how individual learning styles are shaped and developed in the further education.
{"title":"Exploring the Relationships between Personal Characteristics, Aims, and Reasons of Learning in Further Education by Associating Rule Mining","authors":"Sheng-Fei Hsu, Dong-Her Shih, Hui-Ling Yu","doi":"10.1109/CIS.2007.57","DOIUrl":"https://doi.org/10.1109/CIS.2007.57","url":null,"abstract":"Learning occurs when previous perceptions of reality are not in harmony with current experience, creating dissonance. To deepen understanding of the complexities of adult learning, this study presents the relationship within students' mode of study, the aims of learning and the motivation of choosing the course in further education. Associating rule mining will be used to explore the dataset, associate with these three factors and extract valuable rules. Several important adult learning theories will be reviewed and applied to examine the result. This research will provide valuable insight into how individual learning styles are shaped and developed in the further education.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130438900","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}
proved to be one of the best performing algorithms for NP-hard combinational optimization problems like TSP. Many researchers have been attracted in research for ACO but fewer tuning methodologies have been done on its parameters which influence the algorithm directly. The setting of ACO's parameters is studied in this paper. The Artificial Fish Swarm Algorithm (AFSA) is introduced to solve the parameter tuning problem, and an adaptive parameter setting strategy is proposed. It's proved to be effective by the experiment based on TSPLIB test. Keywords: Artificial Fish Swarm Algorithm, Ant Colony Optimization, parameters, TSP
被证明是求解像TSP这样的NP-hard组合优化问题的最佳算法之一。蚁群算法的研究吸引了众多研究者，但对其直接影响算法的参数进行调优的方法较少。本文研究了蚁群算法的参数设置问题。引入人工鱼群算法(Artificial Fish Swarm Algorithm, AFSA)来解决参数整定问题，提出了一种自适应参数整定策略。基于TSPLIB测试的实验证明了该方法的有效性。关键词:人工鱼群算法，蚁群优化，参数，TSP
{"title":"An Adaptive Parameter Control Strategy for Ant Colony Optimization","authors":"Weixin Ling, Huanping Luo","doi":"10.1109/CIS.2007.156","DOIUrl":"https://doi.org/10.1109/CIS.2007.156","url":null,"abstract":"proved to be one of the best performing algorithms for NP-hard combinational optimization problems like TSP. Many researchers have been attracted in research for ACO but fewer tuning methodologies have been done on its parameters which influence the algorithm directly. The setting of ACO's parameters is studied in this paper. The Artificial Fish Swarm Algorithm (AFSA) is introduced to solve the parameter tuning problem, and an adaptive parameter setting strategy is proposed. It's proved to be effective by the experiment based on TSPLIB test. Keywords: Artificial Fish Swarm Algorithm, Ant Colony Optimization, parameters, TSP","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120850776","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}
Conditional Access Systems are used in Pay-Tv Sys- tems to ensure conditional access to broadcasted data and charge subscribers a subscription fee. Smart cards are end- user security devices to store subscribers entitlements, re- quired to access data. On the other hand, pirates clone or modify smart cards to gain access to broadcasted data with- out paying any fees. This paper presents new countermea- sures, based on fingerprints, to avoid smart cards cloning or modifying in Conditional Access Systems for digital Tv broadcasting.
{"title":"Modified Original Smart Cards and Smart Card Clone Countermeasures","authors":"A. D. Santis, Claudio Soriente","doi":"10.1109/CIS.2007.187","DOIUrl":"https://doi.org/10.1109/CIS.2007.187","url":null,"abstract":"Conditional Access Systems are used in Pay-Tv Sys- tems to ensure conditional access to broadcasted data and charge subscribers a subscription fee. Smart cards are end- user security devices to store subscribers entitlements, re- quired to access data. On the other hand, pirates clone or modify smart cards to gain access to broadcasted data with- out paying any fees. This paper presents new countermea- sures, based on fingerprints, to avoid smart cards cloning or modifying in Conditional Access Systems for digital Tv broadcasting.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115627989","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 Development of effective content-based 3D model retrieval and classification is still an important research issue due to the growing amount of digital information, this paper present a novel 3D model retrieval and classification algorithm. In feature representation, a method combining distance histogram and moment invariants is proposed to improve the retrieval performance. A major advantage of the distance histogram is its invariance to the transforms of scaling, translation and rotation. Based on the premise that two similar images should have high mutual information, or equivalently, the querying image should convey high information about those similar to it, this paper proposed a mutual information distance measure to perform the similarity comparison. Multi-class support vector machine performs the classification for it has a very good generalization performance. This paper tested the algorithm with a 3D model retrieval and classification prototype, the experimental evaluation demonstrates the satisfactory retrieval results and good classification accuracy.
{"title":"An Effective Approach to Content-Based 3D Model Retrieval and Classification","authors":"K. Lu, Feng Zhao, Ning He","doi":"10.1109/CIS.2007.216","DOIUrl":"https://doi.org/10.1109/CIS.2007.216","url":null,"abstract":"The Development of effective content-based 3D model retrieval and classification is still an important research issue due to the growing amount of digital information, this paper present a novel 3D model retrieval and classification algorithm. In feature representation, a method combining distance histogram and moment invariants is proposed to improve the retrieval performance. A major advantage of the distance histogram is its invariance to the transforms of scaling, translation and rotation. Based on the premise that two similar images should have high mutual information, or equivalently, the querying image should convey high information about those similar to it, this paper proposed a mutual information distance measure to perform the similarity comparison. Multi-class support vector machine performs the classification for it has a very good generalization performance. This paper tested the algorithm with a 3D model retrieval and classification prototype, the experimental evaluation demonstrates the satisfactory retrieval results and good classification accuracy.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122968127","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 this paper, we present an ID-based signature scheme that is proved to be secure in the random oracle model under the hardness assumption of k-CAA problem. The proposed scheme upholds all desirable properties of previous IBS schemes, and requires general cryptographic hash functions instead of MapToPoint hash function that is inefficient and probabilistic. Furthermore, our scheme requires less computation cost and is significantly more efficient than all known IBS schemes, and the size of signatures generated by our scheme is approximate 160 bits, which is the shortest ID-based signatures so far.
{"title":"An Efficient Identity-Based Short Signature Scheme from Bilinear Pairings","authors":"Hongzhen Du, Q. Wen","doi":"10.1109/CIS.2007.168","DOIUrl":"https://doi.org/10.1109/CIS.2007.168","url":null,"abstract":"In this paper, we present an ID-based signature scheme that is proved to be secure in the random oracle model under the hardness assumption of k-CAA problem. The proposed scheme upholds all desirable properties of previous IBS schemes, and requires general cryptographic hash functions instead of MapToPoint hash function that is inefficient and probabilistic. Furthermore, our scheme requires less computation cost and is significantly more efficient than all known IBS schemes, and the size of signatures generated by our scheme is approximate 160 bits, which is the shortest ID-based signatures so far.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115060689","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}
Tianqi Zhang, Shao-sheng Dai, Liufei Yang, Xuesong Li
This paper proposes a modified Sanger's generalized Hebbian neural network method to estimate and track the pseudo noise sequence of weak direct sequence spread spectrum signals. The proposed method is based on eigen-analysis of received signals. The received signal is firstly sampled and divided into non-overlapping signal vectors according to a temporal window, which duration is a periods of PN sequence. Then an autocorrelation matrix is computed and accumulated by these signal vectors one by one. The pseudo noise sequence can be estimated and tracked by the principal eigenvector of the matrix in the end. Because the eigen-analysis method becomes inefficiency when the estimated pseudo noise sequence becomes longer or the estimated pseudo noise sequence becomes time varying, we use a modified Sanger's generalized Hebbian neural network to realize the pseudo noise sequence estimation and tracking from weak input signals adaptively and effectively.
{"title":"Estimate and Track the PN Sequence of Weak DS-SS Signals","authors":"Tianqi Zhang, Shao-sheng Dai, Liufei Yang, Xuesong Li","doi":"10.1109/CIS.2007.90","DOIUrl":"https://doi.org/10.1109/CIS.2007.90","url":null,"abstract":"This paper proposes a modified Sanger's generalized Hebbian neural network method to estimate and track the pseudo noise sequence of weak direct sequence spread spectrum signals. The proposed method is based on eigen-analysis of received signals. The received signal is firstly sampled and divided into non-overlapping signal vectors according to a temporal window, which duration is a periods of PN sequence. Then an autocorrelation matrix is computed and accumulated by these signal vectors one by one. The pseudo noise sequence can be estimated and tracked by the principal eigenvector of the matrix in the end. Because the eigen-analysis method becomes inefficiency when the estimated pseudo noise sequence becomes longer or the estimated pseudo noise sequence becomes time varying, we use a modified Sanger's generalized Hebbian neural network to realize the pseudo noise sequence estimation and tracking from weak input signals adaptively and effectively.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122882686","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 manufacturing system change from hierarchy to parallel structure, from concentration to distribution based on notion of Holonic Manufacturing System. In this paper, the problem of how to demarcate the unit of the manufacturing system, management style of the unit, control structure and the corresponding control method are settled. The model on order settlement in system reconfiguration model based on time Petri-net is put forward, order intelligent operation series is guided by particle swarm optimization, Simulation results show that the proposed model and algorithm are effective to order evaluation and implementation .
{"title":"Order Holon Modeling Method Based on Time Petri-Nets and its Solution with Particle Swarm Optimization","authors":"Fuqing Zhao, Qiuyu Zhang, Aihong Zhu","doi":"10.1109/CIS.2007.161","DOIUrl":"https://doi.org/10.1109/CIS.2007.161","url":null,"abstract":"The manufacturing system change from hierarchy to parallel structure, from concentration to distribution based on notion of Holonic Manufacturing System. In this paper, the problem of how to demarcate the unit of the manufacturing system, management style of the unit, control structure and the corresponding control method are settled. The model on order settlement in system reconfiguration model based on time Petri-net is put forward, order intelligent operation series is guided by particle swarm optimization, Simulation results show that the proposed model and algorithm are effective to order evaluation and implementation .","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123314394","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 multi-focus image fusion algorithm with Dual-Tree Complex Wavelet Transform (DT-CWT) is proposed in the paper. There are some disadvantages in Discrete Wavelet Transform (DWT), such as shift variance and lack of directional selectivity. Therefore, to have better representation of the images, they are processed with DT-CWT. The low frequency coefficients and high frequency coefficients are fused separately with different methods because of their different characteristics. To the low frequency coefficients, neighborhood gradient maximum selectivity (NGMS) scheme is used, the ones having maximal neighborhood gradient are selected. To the high frequency coefficients, the absolute value maximum selectivity (AVMS) is used, the ones having maximal absolute values are selected. Experiment results show that the algorithm proposed in this paper not only solves the problems such as low contrast and blocking effects caused by fusion algorithms in space domain, but also avoids the artifacts and ringing artifacts exhibited by conventional wavelet based fusion algorithms. Keywords: DT-CWT, image fusion, multi-focus, NGMS, AVMS
{"title":"A Multi-Focus Image Fusion Algorithm with DT-CWT","authors":"Sun Wei, Wang Ke","doi":"10.1109/CIS.2007.46","DOIUrl":"https://doi.org/10.1109/CIS.2007.46","url":null,"abstract":"A multi-focus image fusion algorithm with Dual-Tree Complex Wavelet Transform (DT-CWT) is proposed in the paper. There are some disadvantages in Discrete Wavelet Transform (DWT), such as shift variance and lack of directional selectivity. Therefore, to have better representation of the images, they are processed with DT-CWT. The low frequency coefficients and high frequency coefficients are fused separately with different methods because of their different characteristics. To the low frequency coefficients, neighborhood gradient maximum selectivity (NGMS) scheme is used, the ones having maximal neighborhood gradient are selected. To the high frequency coefficients, the absolute value maximum selectivity (AVMS) is used, the ones having maximal absolute values are selected. Experiment results show that the algorithm proposed in this paper not only solves the problems such as low contrast and blocking effects caused by fusion algorithms in space domain, but also avoids the artifacts and ringing artifacts exhibited by conventional wavelet based fusion algorithms. Keywords: DT-CWT, image fusion, multi-focus, NGMS, AVMS","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123316279","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}
Ji-Li Yin, Y. Liu, Jinyan Wang, W. Gu, Yin-Ping Zhang
Based on classical plan graph and goal graph, complete goal graph (CGG) is constructed against the characteristics of adversarial domain. The complete goal graph makes the action relate with its goal directly, which is more efficient to recognize adversarial goals. The conception of complete degree of goals will be put forward to distinguish adversarial high level goals. Then, a deep research is done on adversarial plan recognition algorithm based on CGG, which not only can predict adversarial next step action, but also can recognize adversarial goals in different levels with complete degrees. The research is of great significance for the plan recognition problem of uncontrollable and nondeterministic domain such as contest robot, information security, business strategy, game role design and etc.
{"title":"A Recognition Approach for Adversarial Planning Based on Complete Goal Graph","authors":"Ji-Li Yin, Y. Liu, Jinyan Wang, W. Gu, Yin-Ping Zhang","doi":"10.1109/CIS.2007.91","DOIUrl":"https://doi.org/10.1109/CIS.2007.91","url":null,"abstract":"Based on classical plan graph and goal graph, complete goal graph (CGG) is constructed against the characteristics of adversarial domain. The complete goal graph makes the action relate with its goal directly, which is more efficient to recognize adversarial goals. The conception of complete degree of goals will be put forward to distinguish adversarial high level goals. Then, a deep research is done on adversarial plan recognition algorithm based on CGG, which not only can predict adversarial next step action, but also can recognize adversarial goals in different levels with complete degrees. The research is of great significance for the plan recognition problem of uncontrollable and nondeterministic domain such as contest robot, information security, business strategy, game role design and etc.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130977816","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
扫码关注我们
求助内容：
应助结果提醒方式：