期刊:
2008 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1 AND 2: VOL 1: COMMUNICATION THEORY AND SYSTEM,2008年:553-556
通讯作者:
Chen Yi
作者机构:
[Yang Qing; Chen Yi; Ruan Yunxing] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.;[Gao Ge] Wuhan Univ, Natl Engn Res Ctr Multimedia Software, Wuhan, Peoples R China.
通讯机构:
[Chen Yi] C;Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
会议名称:
International Conference on Communications, Circuits and Systems
会议时间:
MAY 25-27, 2008
会议地点:
Xiamen Univ, Xiamen, PEOPLES R CHINA
会议主办单位:
[Chen Yi;Yang Qing;Ruan Yunxing] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.^[Gao Ge] Wuhan Univ, Natl Engn Res Ctr Multimedia Software, Wuhan, Peoples R China.
会议论文集名称:
International Conference on Communications Circuits and Systems
摘要:
In order to minimize the total load cost of neighboring exchange information, we focus on the problem of beacon information update rate. It is vital to determine the quality of service (QoS) performance of wireless sensor networks through proactive network monitoring and reconfiguration. The rate of beacon exchange and its contents delineate the time and nature of the proactive action. It is important to optimize these parameters to development the functional response of the self-configuration networks. This paper presents a novel beacon exchange selection model based on load-adaptive optimization of beacon exchange rate. Simulation results show this algorithm improves the Quality-of-Service (QoS) of the networks by improving the exchange rate for monitoring and proactively reconfiguring the network.
期刊:
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.
作者:
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.
作者机构:
[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.
摘要:
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.
摘要:
Efficient and exact collision detection is very important to improving reality and enhancing immersion in virtual environment. A fast algorithm for computing the minimum distance between two convex polyhedra is presented. Any polyhedral objects can be represented as convex hulls of its vertex value in three-dimensional space. The vertex representation of the convex polyhedral is used to calculate the distance between two static convex objects. The algorithm transform the collision detection problem into non-linear programming problem of computing the minimum distance between two objects, and then detect collision by the value of minimum distance. The simulation results demonstrate the performance of the new method.
作者机构:
[Yan Huifang; Qi Mei; Guo Yajun] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
会议名称:
International Symposium on Advances in Computer and Sensor Networks and Systems
会议时间:
APR 07-JUL 11, 2008
会议地点:
Zhengzhou, PEOPLES R CHINA
会议主办单位:
[Qi Mei;Guo Yajun;Yan Huifang] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
摘要:
File pollution has become a very serious problem in peer-to-peer file sharing systems,because which greatly reduces the effectiveness of systems. There are two representatives reputation based anti-pollution mechanisms,peer reputation systems and object reputation systems respectively. This paper proposes an anti-pollution mechanism combined with peer reputation and object reputation, in which the reputation of sharing files are weighted by the reputation of voting peers. Severe penalty strategy and voting incentive mechanism are introduced in calculating peer reputation, which not only isolate the polluters effectively, but also stimulate user awareness of file pollution,preventing its further spread. The simulation results show that, compared to object reputation system, our reputation mechanism convergence faster, has better anti-pollution performance.
期刊:
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.
期刊:
Lecture Notes in Computer Science,2008年5174:222-233 ISSN:0302-9743
通讯作者:
Liu, Yuhua
作者机构:
[Yang, Chun; Chen, Hongcai; Liu, Yuhua] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[Xu, Kaihua] Hua Zhong 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.
关键词:
peer-to-peer;free-riding;utility function;Analytic Hierarchy Process
作者:
Zhang, Yugang*;Mao, Shisong;Zhuang, Xin;Peng, Xi
期刊:
PROCEEDINGS OF THE 2008 INTERNATIONAL CONFERENCE ON CYBERWORLDS,2008年:471-476
通讯作者:
Zhang, Yugang
作者机构:
[Zhuang, Xin; Mao, Shisong; Zhang, Yugang; Peng, Xi] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构:
[Zhang, Yugang] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要:
Nowadays, it becomes more and more important to construct high-level attack scenarios from low-level intrusion alerts reported by intrusion detection systems (IDSs). Some methods have been presented to resolve this problem. These methods have different strengths. However, they also have different limitations. In order to build complicated attack processes accurately, this paper uses cluster and correlation techniques to construct high-level attack scenarios. Fuzzy cluster algorithm based on the similarity of attack attributes is proposed to classify alerts generated by IDSs. And then in every alert class, alert correlation method based on prerequisites and consequences of attacks is used to construct attack scenarios. Finally, to get whole attack graphs, this paper hypothesizes and reasons about attacks possibly missed based on the equality constrain and casual relation between intrusion alerts. The experimental results on LLS DDOS2.0 prove that the method is useful and effective.
作者机构:
[Yinglong Wang; Jingzhu Hu] Department of Computer Science, Huazhong Normal University, Wuhan, China
通讯机构:
Department of Computer Science, Huazhong Normal University, 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.
期刊:
Proceedings of the 27th Chinese Control Conference, CCC,2008年:194-197
通讯作者:
Changlin, Ma
作者机构:
[Changlin, Ma] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.;[Huajing, Fang] Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.
通讯机构:
[Changlin, Ma] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.
会议名称:
27th Chinese Control Conference, CCC
会议时间:
July 16, 2008 - July 18, 2008
会议地点:
Kunming, Yunnan, China
关键词:
Networked control systems;Time-division algorithm;Markov chain;Mean square exponentially stable
摘要:
A new control mode is proposed for networked control systems whose network-induced delay is longer than a sampling period. The proposed control mode can make full use of control information and improve the performance of the system. A time-division algorithm is presented to implement the control mode and mathematical modeling. Markov characteristic of the transfer delay in the system is discussed. Based on Markov chain theory, the stochastic optimal controller is designed, which is shown to render corresponding system mean square exponentially stable.
期刊:
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.
作者机构:
[夏雪; 肖德宝; 顾婷] 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.