摘要：
This paper proposes an energy efficient clustering formation algorithm for wireless sensor network, which is called ACE-CILP algorithm according to considering the energy consumption as an optimization parameter. The algorithm can divide a sensor network into a few clusters and select a cluster head base on weight value that leads to more uniform energy dissipation evenly among all sensor nodes. The simulation results show that ACE-CILP algorithm achieves its intention of consuming less energy, equalizing the energy consumption of all the nodes, as well as extending the network lifetime perfectly.
期刊：
2008 INTERNATIONAL MULTISYMPOSIUMS ON COMPUTER AND COMPUTATIONAL SCIENCES (IMSCCS),2008年:106-+
通讯作者：
Liu, Yuhua
作者机构：
[Yang, Chun; Huang, Hao; Liu, Yuhua] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[Xu, Kaihua] Huazhong Normal Univ, Res Ctr Digital Space Technol, Wuhan 430079, Peoples R China.
通讯机构：
[Liu, Yuhua] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
In wired networks, congestion is the main reason for most of the packet losses and the original TCP is the best option to implement. However, in wireless networks, these losses will arise for reasons other than congestion. TCPW has been proved to work better in performance and bandwidth utilization than Reno and New Reno in wireless networks. Our research mainly focuses on the slow-start phase of TCPW and develops an algorithm to divide the phase into two parts. In this paper, we propose a simple refinement of slow-start algorithm of TCP Westwood (TCPW), which is a TCP variant focused on to achieve higher performance in wireless and wired networks. We show by results that the new theme could reduce possibility of packet loss in wireless networks. In the first half of slow-start, we use the exponential increase just like the original slow-start. Moreover, we grow the congestion window gradually to decrease packet burstiness in the second half of slow-start.
摘要：
Viruses that attack intelligent mobile phones are emerging as a new front in the fight against various computer viruses. In order to reveal the spreading rule of mobile phone virus, thus providing theory basis for preventing mobile phone virus from wide spreading, we consider the characteristics of mobile phone communication network, and then focus mainly on the short message network. Based on this specific network, we proposed an epidemic model of mobile phone virus based on the efficiency of immunization. In this epidemic model, we listed three basic statuses of mobile phone nodes, as well as the transition rules betweens these statuses. Through analyzing the epidemic model and the simulation experiment, we found that the epidemic model can forecast the development tendency Of the node status. We discussed the influence of the efficiency of immunization, and then made a conclusion that mobile phone virus can not be removed completely. According to this model, we can take some measures to control the spreading of mobile phone virus.
作者机构：
[夏雪; 肖德宝; 顾婷] Institute of Computer Network and Communication, Huazhong Normal University, Wuhan 430079, China
通讯机构：
[Xia, X.] I;Institute of Computer Network and Communication, Huazhong Normal University, China
关键词：
Alert verification;Context classification;Event correlation;Intrusion detection system(IDS);Ontology language
摘要：
Intrusion Detection System (IDS) nowadays are known for producing a huge amount of alerts that are either not related to true alerts or not represented successful attacks due to lack of information to verify and to correlate IDS events. Alert verification, in the process of event correlation, is a method that we use to determine whether an alert from IDS is a false positive and to identify the success of an attack through context information of protected environment in two aspects. That is victim host context information and network context information. This paper presents alert analysis architecture in the event correlation process and then focuses on alert verification method using ontology-based context classification approach to achieve the goal of high efficiency of verification. An implementation shows in the end for the sake of validating the feasibility of the approach.
期刊：
Conference on Local Computer Networks. Proceedings,2008年:549-550 ISSN：0742-1303
通讯作者：
Yao, Huaxiong
作者机构：
[Yang, Zongkai; Yang, Yan; Yao, Huaxiong] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Yao, Huaxiong] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议名称：
33rd Annual IEEE Conference on Local Computer Networks
会议时间：
OCT 14-17, 2008
会议地点：
Montreal, CANADA
会议主办单位：
[Yao, Huaxiong;Yang, Yan;Yang, Zongkai] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议论文集名称：
Conference on Local Computer Networks
摘要：
This paper addresses dynamic restoration to the scenario of single link failure for survivable traffic grooming in WDM mesh networks. Two restoration schemes are proposed, dynamic restoration at connection granularity (DRAC) and dynamic restoration at lightpath granularity (DRAL). DRAC routes a failed connection to a new multihop path, while DRAL routes a failed lightpath to a new lightpath or other available lightpath. Then we compare the two restoration schemes with other schemes for survivable traffic grooming.
作者机构：
[Yinglong Wang; Jingzhu Hu] Department of Computer Science, Huazhong Normal University, Wuhan, China
通讯机构：
[Jingzhu Hu] D;Department of Computer Science, Huazhong Normal University, Wuhan, China
关键词：
trust management;policy;reputation;proof of compliance;P2P Grid computing
摘要：
In P2P Grid computing systems, the authorization decision is often tackled by two different trust management meth- ods: policy-based approach, where authorization are built on logi- cal rules and verifiable properties encoded in signed credentials, and reputation-based approach, based on collecting, aggregating and disseminating reputation among the peers. However, the overhead caused by proof of compliance on authorization and the absence of certifying authorities may negate the strong and objec- tive security advantages of policy-based approach, whilst vague- ness, complexity and inaccurate characterization caused by reputa- tion evolution may eliminate the quantitative and flexible advan- tages of reputation-based approach. We propose an adaptive trust management framework, which combines the merit of policy proof and reputation evolution such that authorization is aware of not only the strong and objective security traits, but also the cal- culability and the availability security traits. Finally, the frame- work of system is proposed.
作者机构：
[He, Tingting] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[He, Tingting] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
Network media monitor corpus (NMMC) is a network media language recourses collection, which reflect language phenomenon in real network life. Based on it, a few application technologies are delivered, including network hot events detection, network pop words tracking, network new words identifying, and Language Situation in China.
期刊：
2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31,2008年:12218-+
通讯作者：
Hu, Jinzhu
作者机构：
[Hu, Jinzhu; Zhang, Cong; Zhao, Dongmeng; Fang, Chun; Zhang, Yi] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[Liu, Yong] Wuhan Univ, Dept Phys, Wuhan 430072, Peoples R China.
通讯机构：
[Hu, Jinzhu] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
关键词：
data storage;workflow;string processing;web-based
摘要：
This paper proposes an innovative data storage mechanism for forms of web-based workflow systems in which various forms communicate with each other quite frequently to carry out workflow handling. To realise this approach, several methods mainly about string theory as well as string variable processing are provided. Moreover, it can deal with forms both in static and dynamic kinds. The key distinction of this approach is that we would care nothing about the contents of every forms in workflow systems. This can significantly simplify the table structure and data storage of the database.
作者机构：
Engineering & Research Center for Information Technology on Education,Huazhong Normal University,Wuh;Department of Computer Science,Huazhong Normal University,Wuhan,China,430079;Network Media Branch,Na
会议名称：
The 2008 IEEE International Conference on Natural Language Processing and Knowledge Engineering(IEEE NLP-KE 2008)(2008IEEE自然语言处理与知识工程国际会议)
会议时间：
2008-10-19
会议地点：
北京
会议论文集名称：
The 2008 IEEE International Conference on Natural Language Processing and Knowledge Engineering(IEEE NLP-KE 2008)(2008IEEE自然语言处理与知识工程国际会议)论文集
摘要：
Several automated metrics have been adopted by Document Understanding Conference (DUC) in recent years as they offered great advantages in the area of summarization. However, there’re still no evaluation metrics which can be directly used to generate Summaries, mainly because that human reference summaries are indispensable for these metrics. Here we report that our group first discovered and developed RCSUM, a summarization system that can generate summaries with evaluation metrics. RCSUM was developed from ROUGE-C, a new fully automated evaluation metrics recently developed in our group, which can use ROUGE in an absolutely manual-independent way, and reserved capabilities of distinguishing good or bad summaries. Experiments conducted on the 2001 to 2005 DUC data showed that, evaluated by ROUGE-2 as well as ROUGE-SU4, our system performed very well.
作者：
Ye, Junmin*;Zhan, Zemei;Zhang, Zhenfang;Dong, Wei;Qi, Zhichang
作者机构：
[Ye, Junmin; Zhang, Zhenfang; Zhan, Zemei] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[Zhan, Zemei] Yangtze Univ, Coll Comp Sci, Jingzhou 434023, Peoples R China.;[Ye, Junmin; Qi, Zhichang; Dong, Wei] Natl Univ Def Technol, Sch Comp, Changsha 410073, Hunan, Peoples R China.
会议名称：
The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)
会议时间：
2008-11-18
会议地点：
安徽黄山
会议主办单位：
[Ye, Junmin;Zhan, Zemei;Zhang, Zhenfang] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.^[Zhan, Zemei] Yangtze Univ, Coll Comp Sci, Jingzhou 434023, Peoples R China.^[Ye, Junmin;Dong, Wei;Qi, Zhichang] Natl Univ Def Technol, Sch Comp, Changsha 410073, Hunan, Peoples R China.
会议论文集名称：
The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)论文集
关键词：
Immune Operator;Software Test;Test Case Generation
摘要：
Artificial immune operators play an important role in the application of immunity, how to design immune operators to support the test case generation method based on the principle of immunity deserves our investigation. Therefore, on the basis of artificial immunity principle, some immune operators that can be used in software test case generation are proposed in this paper. By comparing experiments using artificial immune algorithm and experiments based on genetic algorithms, the efficiency of the immune operators applied in test case Generation Method is verified in this paper.
期刊：
2008 PROCEEDINGS OF INFORMATION TECHNOLOGY AND ENVIRONMENTAL SYSTEM SCIENCES: ITESS 2008, VOL 2,2008年:771-775
通讯作者：
Xiao, ShiSong
作者机构：
[Li, XiaoXu; Liu, XueJiao; Xiao, ShiSong] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Xiao, ShiSong] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
关键词：
network security;Intrusion Detection System;clustering algorithm;k-means;K-w means
摘要：
The purpose of Intrusion Detection System is to detect activities contrary to the security rules of system or threat to system security. Traditional Intrusion Detection Systems are largely based on the use of expert systems or statistical methods. These detection models depend on empirical data, lacking of accuracy and the capability to detect new offensives. In this paper, the improved k-means clustering algorithm is applied into Intrusion Detection System, and this system can detect the type of data automatically, without experience, without guidance. Experiments show the effectiveness of the algorithm. The article also gives the comparison between k-means algorithm and weighted k-means algorithm.
作者机构：
Center for Language& Language Education,Central China Normal University,Wuhan,Hubei 430079,P.R.China;Department of Computer Science,Central China Normal University,Wuhan,Hubei 430079,P.R.China
会议名称：
2008年国际电子商务、工程及科学领域的分布式计算和应用学术研讨会(2008 International Symposium on Distributed Computing and Applications for Business Engineering and Science)
会议时间：
2008-07-27
会议地点：
大连
会议论文集名称：
2008年国际电子商务、工程及科学领域的分布式计算和应用学术研讨会(2008 International Symposium on Distributed Computing and Applications for Business Engineering and Science)论文集
摘要：
E-learning is becoming one of the most important educational means.As more and more organizations and institutions are moving towards the e-learning strategy,self-learning model becomes a big challenge.Background knowledge and learning objectives of various groups of students on the network are very different.Self-learning system,which uses different learning programs for different students,can enhance the efficiency of learning process.In a self-learning system,the algorithm dealing with uncertainty factors of Self-learning model is very important.Bayesian network artifice is a very effective one within various methods dealing with uncertainty.In this paper,we applied Bayesian network method to self-learning model;designed Bayesian network structure in a self-learning model;assigned the local probability distribution and discussed the way to acquire and propagate related evidences.The practice has proven Bayesian network approach for self-learning model is a very effective method.
期刊：
2008 NEXT GENERATION INTERNET NETWORKS AND 4TH EURONGI CONFERENCE ON NEXT GENERATION INTERNET NETWORKS, PROCEEDINGS,2008年:9-+
通讯作者：
Yao, Huaxiong
作者机构：
[Yang, Yan; Yao, Huaxiong] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[Tan, Xiansi] Air Force Radar Acad, Wuhan 430019, Peoples R China.
通讯机构：
[Yao, Huaxiong] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
This paper addresses the traffic grooming problem in wavelength-division multiplexing (WDM) mesh networks. We first introduce a transceiver saving auxiliary graph model, in which various grooming policies can easily be achieved by assigning weight values for various edges. Then we propose resource efficient grooming policy (REGP) based on the graph model, which take into account the wavelength constraint and transceiver constraint simultaneously according to the correlation between them while other policies consider only one between them. The REGP policy can apply to dynamic traffic and static traffic. In dynamic traffic scenario, REGP utilizes network resources efficiently according to the ratio of the available number of two resources. In static traffic scenario, REGP chooses the most economical routing path according to the cost ratio between the two resources. Simulation results validate that REGP reduces the blocking probability for dynamic traffic and saves the total network cost for static traffic. Results also show that REGP always has a better performance titan other policies in various conditions, static traffic, dynamic traffic and various resource deployments.
