作者机构：
[Liu, Yu-Hua; Tao, Shao-Hua; Cao, Ji-Wei] Department of Computer Science, Huazhong Normal University, Wuhan 430079, China;[Xu, Kai-Hua] Research Center of Education Information, Huazhong Normal University, Wuhan 430079, China
通讯机构：
Department of Computer Science, Huazhong Normal University, China
摘要：
Various kinds of network models which exist in the real world and the differences between them have been described. Especially the small network model and free-scale network model and their characteristic have been presented. The self-similarity characteristic of the complex networks has been proposed based on fractal method, self-similarity capacity dimension has been given, self-similarity performance estimate and simulation steps of complex networks have been carried out. At last, we discuss the future work for farther study.
期刊：
International Journal of Wireless and Mobile Computing,2006年1(2):156-162 ISSN：1741-1084
通讯作者：
Li, J.(lijie@cs.tsukuba.ac.jp)
作者机构：
[Tan, Liansheng] Research School of Information Sciences and Engineering, Australian National University, Canberra ACT 0200, Australia;[Li, Jie] Department of Computer Science, Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba Science City, Japan;[Zhan, Xiaoli; Zhao, Fuzhe] Department of Computer Science, Central China Normal University, Wuhan 430079, China
通讯机构：
Department of Computer Science, Graduate School of Systems and Information Engineering, University of Tsukuba, Japan
关键词：
wireless ad hoc networks;broadcasting redundancy;reachability;sensor networks;wireless networks;broadcast scheduling;simulation.
通讯机构：
[He, Tingting] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.
摘要：
How to improve the rankings of the relevant documents plays a key role in information retrieval. In this paper, a re-ranking approach based on topic words pair is proposed to improve precision while recall is preserved. The topic word pairs contain two correlated words, one of which is the original query word and the other come from the documents. The selection is based on Probabilistic Latent Semantic Indexing (PLSI). Then,the distribution of the Word pairs is used to re-rank documents. Results show a 53.6% and 56.8% improvement compare to the initial retrieval without any re-ranking, or query expansion on NTCIR-5 document collection for SLIR. http://aclweb.org/anthology/Y06-1031
作者机构：
[Tan, LS] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.;Univ Melbourne, ARC Special Res CUBIN, Dept Elect & Elect Engn, Natl ICT Australia, Melbourne, Vic, Australia.;City Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong, Peoples R China.
通讯机构：
[Tan, LS] C;Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
摘要：
The interaction between links in wireless multihop networks introduces extra constraints on the combinations of achievable flow rates. Algorithms have been proposed to achieve max-min fairness under these additional constraints. This letter provides a simple price-based max-min fair rate allocation scheme, building on a utility maximization scheme recently proposed for such networks.
期刊：
Proceedings - ISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications,2006年2:856-860
通讯作者：
Liu, Rong
作者机构：
[Liu, Ming; Zhou, Jianzhong; Liu, Rong] Huazhong Univ Sci & Technol, Digital Engn Res Ctr, Wuhan 430074, Hubei, Peoples R China.;[Liu, Ming] Cent China Normal Univ, Dept Comp Sci, Wuhan, Hubei, Peoples R China.
通讯机构：
[Liu, Rong] H;Huazhong Univ Sci & Technol, Digital Engn Res Ctr, Wuhan 430074, Hubei, Peoples R China.
关键词：
semi-supervised learning;graph;web page classification;link information
摘要：
Many application domains such as web page classification suffer from not having enough labeled training examples for learning. However, unlabeled training examples are readily available but labeled ones are fairly expensive to obtain. As a result, there has been a great deal of work in resent years on semi-supervised learning. This paper proposes a graph-based semi-supervised learning algorithm that is applied to the web page classification. Our algorithm uses a similarity measure between web pages to construct a K-Nearest Neighbor graph. Labeled and unlabeled web pages are represented as nodes in the weighted graph, with edge weights encoding the similarity between the web pages. In order to use unlabeled data to help classification and get higher accuracy, edge weights of the graph are computed through combining weighting schemes and link information of web pages. The learning problem is then formulated in terms of label propagation in the graph. By using probabilistic matrix methods and belief propagation, the labeled nodes push out labels through unlabeled nodes. Our preliminary experiments on the WebKB dataset show that the algorithm in this paper can effectively exploit unlabeled data in addition to labeled ones to get higher accuracy of web page classification.
期刊：
PACLIC 20 - Proceedings of the 20th Pacific Asia Conference on Language, Information and Computation,2006年:42-48
通讯作者：
He, T.(tthe@mail.ccnu.edu.cn)
作者机构：
[He, Tingting; Li, Jing; Zhao, Junzhe] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
关键词：
named entities pair;community;betweenness
摘要：
This paper proposes a networked data mining method for relations discovery from large corpus. The key idea is representing the named entities pairs and their contexts as the network structure and detecting the communities from the network. Then each community relates to a relation the named entities pairs in the same community have the same relation. Finally, we labeled the relations. Our experiment using the corpus of People's Daily reveals not only that the relations among named entities could be detected with high precision, but also that appropriate labels could be automatically provided for the relations.
作者机构：
[Zhu, Hai-Yan; Liu, Yu-Hua; Zhu, Chang-Wu] Department of Computer Science, Huazhong Normal University, Wuhan 430079, China;[Xu, Kai-Hua] Research Center of Education Information, Huazhong Normal University, Wuhan 430079, China
通讯机构：
Department of Computer Science, Huazhong Normal University, China
关键词：
Old route path;Route update;Sink;Wireless sensor network
摘要：
Characteristic of wireless sensor network and difference with Ad Hoc network are briefly introduced firstly. On the basis of analyzing of some existed route update methods, a new sensor network route update approach has been proposed by utilize the sequence of the sink node. Also the material implements and the performance evaluation of this algorithm are presented.
期刊：
Information Technology Journal,2006年5(2):358-363 ISSN：1812-5638
通讯作者：
Jin, C.
作者机构：
[Jin Cong; Peng Jiaxiong] Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology, Wuhan 430074, China;[Jin Cong] Department of Computer Science, Central China Normal University, Wuhan 430079, China
通讯机构：
[Jin, C.] I;Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology, China
作者机构：
[金聪] Lab. of Image Proc., Huazhong Univ. of Sci. and Technol., Wuhan 430074, China;[金聪] Lab. of Info. Security, Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China;[金聪; 彭嘉雄] Dept. of Comp. Sci., Central China Normal Univ., Wuhan 430079, China
通讯机构：
Lab. of Image Proc., Huazhong Univ. of Sci. and Technol., China
作者机构：
[Tan, LS] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.;Australian Res Council, Special Res Ctr Ultra Broadband Informat Networks, Melbourne, Vic, Australia.
通讯机构：
[Tan, LS] C;Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
关键词：
Active queue management;Congestion control;Random early detection (RED);Stability
摘要：
Based on control theory, this letter provides guidelines for the selection of the control gain for dynamic-RED to stabilize a congested queue at a target and hence to improve network performance. Simulations demonstrate that indeed satisfactory performance can be achieved if the control gain is selected based on the guidelines.
期刊：
Proceedings of SPIE - The International Society for Optical Engineering,2005年5626(PART 1):695-702 ISSN：0277-786X
通讯作者：
Li, Y
作者机构：
[Hu, JZ; Li, Y] Cent China Normal Univ, Dept Comp Sci, Wuhan 430070, Peoples R China.
通讯机构：
[Li, Y] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430070, Peoples R China.
会议名称：
Network Architectures,Management,and Applications II pt.1
会议时间：
2004-01-01
会议地点：
Beijing,China
会议论文集名称：
Network Architectures,Management,and Applications II pt.1
关键词：
wavelength routing optical networks(WRON);dynamic wavelength assignment algorithm;optical link release mechanism;optical networks blocking probability;optical path setup time
摘要：
This paper presents a novel optimized distributed dynamic wavelength assignment algorithm for the wavelength routing optical network(WRON) based on the revised result of reference[5,6]: Fast Distributed Dynamic Lightpath Setup Algorithm(FDDLSA). By adopting two kinds of new optical link release mechanisms (ahead and timeout release) in the process of networks nodes setting up a link, the new algorithm can reduce the blocking probability significantly and release the burden of a router. The effectiveness of the algorithms was verified through the simulation on NSF net (Nature and Science Foundation) of USA: it can reduce the blocking probability 8% less than reference [5]'s algorithm, at the same time it can reduce the optical path setup time greatly.
