作者机构：
[Gongqiang Li] School of Computer and Information Engineering, Central South University of Forestry and Technology, Changsha 410004, China;Author to whom correspondence should be addressed.;[Zhigang Chen 0001] School of Software, Central South University, Changsha 410083, China;[Junshan Tan] School of Computer and Information Engineering, Central South University of Forestry and Technology, Changsha 410004, China<&wdkj&>Author to whom correspondence should be addressed.;[Zhufang Kuang] School of Computer and Information Engineering, Central South University of Forestry and Technology, Changsha 410004, China<&wdkj&>School of Software, Central South University, Changsha 410083, China
通讯机构：
[Junshan Tan] S;School of Computer and Information Engineering, Central South University of Forestry and Technology, Changsha 410004, China<&wdkj&>Author to whom correspondence should be addressed.
摘要：
The link failure due to the secondary users exiting the licensed channels when primary users reoccupy the licensed channels is very important in cognitive wireless mesh networks (CWMNs). A multipath routing and spectrum allocation algorithm based on channel interference and reusability with Quality of Service (QoS) constraints in CWMNs (MRIR) was proposed. Maximizing the throughput and the acceptance ratio of the wireless service is the objective of the MRIR. First, a primary path of resource conservation with QoS constraints was constructed, then, a resource conservation backup path based on channel interference and reusability with QoS constraints was constructed. The MRIR algorithm contains the primary path routing and spectrum allocation algorithm, and the backup path routing and spectrum allocation algorithm. The simulation results showed that the MRIR algorithm could achieve the expected goals and could achieve a higher throughput and acceptance ratio.
会议论文集名称：
International Conference on Graphic and Image Processing (ICGIP 2012)
关键词：
Data streams;data mining;frequent patterns;bloom filter
摘要：
A data streams synopses structure FPCBF, which is based on bloom filter, is proposed in this paper. Each unit of vector BF[e] in FPCBF is a two-tuples. The transactions insert operation (InsertTran) and 1-frequent patterns pregeneration operation (PreGenFP) is defined. Then, A data streams frequent patterns mining algorithm BFFPM which is based on FPCBF is proposed in this paper. The BFFPM algorithm contains two parts: 1-frequent patterns generation and r-frequent patterns generation. The problem of computing the 1-frequent patterns generation is transformed into the problem of computing the longest common sub-sequence α i LCS of k setting identifier sequence in BF[e] in FPCBF. In the same way, the problem of computing the r-frequent patterns generation is transformed into the problem of computing the longest common sub-sequence LCS r , which is the longest common sequence of the identifier sequence α i LCS ,…, i r LCS α + of r items. The IBM synthesizes data generation which output customers shopping a data are adopted as experiment data. The FPCBF algorithm not only has high precision for mining frequent patterns, but also has low memory requirement
期刊：
Lecture Notes in Electrical Engineering,2012年173 LNEE(VOL. 2):155-161 ISSN：1876-1100
通讯作者：
Kuang, Z.(Zfkuangcn@nudt.edu.cn)
作者机构：
[Tan, JunShan; Kuang, Zhufang] School of Computer and Information Engineering, Central South University of Forestry and Technology, Changsha, China;[Yang, Guogui] School of Computer, National University of Defense Technology, Changsha, China
会议名称：
2nd International Conference on Future Control and Automation, ICFCA 2012
会议时间：
1 July 2012 through 2 July 2012
会议地点：
Changsha
关键词：
Data generation;Data stream;equal weight clique;Experiment data;Frequent pattern mining;High precision;max frequent pattern;Processing time;Pruning strategy;Algorithms;Automation;Data communication systems;Data processing;Graph theory;Problem solving;Data mining
关键词：
Data mining;Data streams;Directed graph;Frequent patterns;Sliding window
摘要：
The design of synopses structure is an important issue of frequent patterns mining over data stream. A data stream synopses structure FPD-Graph which is based on directed graph is proposed in this paper. The FPD-Graph contains list head node FPDG-Head and list node FPDG-Node. The operations of FPD-Graph consist of insert operation and deletion operation. A frequent pattern mining algorithm DGFPM based on sliding window over data stream is proposed in this paper. The IBM synthesizes data generation which output customers shopping a data are adopted as experiment data. The DGFPM algorithm not only has high precision for mining frequent patterns, but also has low processing time.
期刊：
2012 IEEE FOURTH INTERNATIONAL SYMPOSIUM ON PLANT GROWTH MODELING, SIMULATION, VISUALIZATION AND APPLICATIONS (PMA),2012年:200-203
通讯作者：
Zhang Huaiqing
作者机构：
[Lu Kangning; Zhang Huaiqing; Jiang Xian; Kuang Yilong; ZhangNing] Chinese Acad Forestry, Res Inst Forest Resource Informat Tech, Beijing, Peoples R China.;[Tan Junshan; Kuang Yilong; ZhangNing] Cent South Univ Forestry & Technol, Comp & Informat Engn Sch, Changsha, Hunan, Peoples R China.
通讯机构：
[Zhang Huaiqing] C;Chinese Acad Forestry, Res Inst Forest Resource Informat Tech, Beijing, Peoples R China.
会议名称：
2012 IEEE 4th International Symposium on Plant Growth Modeling,Simulation,Visualization and Applications(PMA 2012)
会议时间：
2012-10-31
会议地点：
中国上海
关键词：
component;formatting;style;styling;insert
摘要：
Through the research of the stand simulation methods, there is a lack of common mechanism in the simulation rules. These methods do not use the stand structure as rules of the simulations and most of them depend on the qualitative simulation instead of the quantitative simulation. Mainly through manually setting and cannot simulated for mixed stand, these methods lack of rationality, authenticity, universality. This study presents a simulation method based on the spatial structure of the stand, quantifies forest structure indicators simulation stands for forestry research work and provides management of simulation data sources.
作者机构：
[黄华军; 谭骏珊] School of Computer and Information Engineering, Central and South University of Forestry and Technology, Changsha 410004, China;[孙星明] School of Computer and Communication, Hunan University, Changsha 410082, China
通讯机构：
[Huang, H.-J.] S;School of Computer and Information Engineering, , Changsha 410004, China
摘要：
Phishing is a form of online identity theft. Phishers use social engineering to steal victims' personal identity data and financial account credentials. Social engineering schemes use spoofed e-mails to lure unsuspecting victims into counterfeit Websites designed to trick recipients into divulging financial data such as credit card numbers, account usernames, passwords and social security numbers. This is called a deceptive phishing attack. In this paper, a thorough overview of a deceptive phishing attack and its countermeasure techniques, which is called anti-phishing, is presented. Firstly, technologies used by phishers and the definition, classification and future works of deceptive phishing attacks are discussed. Following with the existing browser-side anti-phishing techniques in literatures and research-stage technologies are shown, and a thorough analysis which includes the advantages and shortcomings of countermeasures is given.
