摘要：
Data fields in a form contain invaluable information so that field data extraction is important in form processing. Most conventional data extraction methods depend on the line frames. However there are many types of forms such as table-form and non table-from that are without line frames and popularly used in our daily lives as well. A new field locating method using priori knowledge is proposed. It is based on two-level regulated hit or miss transform features of form background. The feasibility of the method is proved theoretically. Experiments and application show that it is several dozen times faster than ordinary regulated hit or miss transform and the correct rate is satisfied with real applications.
摘要：
These days, Web services have emerged as a promising technology, and may be used in the field of collaborative design. In this paper, we examine Web services as both a XML-based approach and a service-driven approach to collaborative design. Since Web services are a Service-Oriented Architecture (SOA) more than a set of technologies, it could be used not only at the technology level, but also at the SOA level, which may be more appropriate recur to the concept of Peer-to-Peer. Correspondingly, two prototypes are illustrated for further demonstration, and a possible scenario of the latter one is provided as a reference. A preliminary attempt to add semantics to services is also presented to facilitate the interoperability of Web services-based collaborative design.
摘要：
The problem of tracking the distance between two convex polyhedra is finding applications in many areas of robotics, including intersection detection, collision detection, and path planning. An algorithm for computing the minimum distance between two convex polyhedra is presented. The algorithm applied to polyhedral objects that can be represented as convex hulls of its vertex value in three-dimensional space. Nonlinear programming techniques are then employed to compute the minimum distance between two convex polyhedra, and according to the minimum distance between two convex polyhedra, and according to the minimum distance, it can conclude whether or not the objects has collided at some time. The simulation results demonstrate the performance of this new method.
期刊：
International Conference on Communication Technology Proceedings, ICCT,2006年:324-+
通讯作者：
Wei, M.(Blueice987wmj@yahoo.com.cn)
作者机构：
[Xiao, Debao; Wei, Meijuan] Cent China Normal Univ, Inst Comp Network & Commun, Wuhan, Peoples R China.;[Guo, Jintao] Wuhan Univ Technol, Sch Transport, Wuhan 430070, Peoples R China.
通讯机构：
Institute of Computer Network and Communication, Central China Normal University, China
会议名称：
10th International Conference on Communication Technology (ICCT 2006)
会议时间：
NOV 27-30, 2006
会议地点：
Guilin, PEOPLES R CHINA
会议主办单位：
[Wei, Meijuan;Xiao, Debao] Cent China Normal Univ, Inst Comp Network & Commun, Wuhan, Peoples R China.^[Guo, Jintao] Wuhan Univ Technol, Sch Transport, Wuhan 430070, Peoples R China.
摘要：
As the network scale expands and the service provided by network becomes more complex, the NGI (Next Generation Internet) is coming to us. It is a difficult task to manage the NGI efficiently. XML is a new technology which can describe management information more compact and can easy the manage operations. Policy-based network management is a distributed network management model, which can make the network management more and more flexible, effective and reliable. According to the NGI's characteristics and the advantages of the XML technology and Policy-based network management model, we give a distributed network management model for NGI based on XML and policy, analyze the structure and the components of this model, and finally, a prototype that designed and implemented on above methods and technologies, named XPBNM, is introduced.
期刊：
ICICIC 2006: FIRST INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING, INFORMATION AND CONTROL, VOL 1, PROCEEDINGS,2006年:385-+
通讯作者：
Xu, Hui
作者机构：
[Xiao, Debao; Xu, Hui] Cent China Normal Univ, Dept Comp Sci & Technol, Wuhan 430079, Peoples R China.
通讯机构：
[Xu, Hui] C;Cent China Normal Univ, Dept Comp Sci & Technol, Wuhan 430079, Peoples R China.
摘要：
As the Internet continues to grow, the tasks of configuration management for IP network devices are becoming more and more difficult. Over the past few years, much effort has been given to improve the deficiency of SNMP in the configuration management scope, hut only few have succeeded to be standardized, the famous one of which is Netconf developed by the IETF. Even the Netconf is still far from its aim to implement, the automation of the network configuration. These days, ontology has become a promising technology and it seems that it may be used in the intelligent configuration management scope. This paper first discusses the application of ontology and three related languages (including OWL, SWRL and OWL-S) to intelligentize configuration management. A common ontology-based intelligent configuration management model for IP network devices is then presented in the paper. To check the feasibility of this model, the paper also provides a possible scenario.
会议论文集名称：
IEEE Conference on Industrial Electronics and Applications
摘要：
With the development of attacking technologies, the representations of security events become more and more complex, and the system security situation can't be detected or judged by some single security. In this paper, we put the theory and practical of neural network-based multi-sensor information fusion technology into security management for further study and put emphasis up on network security events fusion to optimize and improve the source events management and policy coordination in security management. We present a security management framework using neural network-based information fusion technology, and give an experimental environment to prove that the framework can provide believable security events and the output estimation for security management platform; it can serve as a reference for the response of network security events, so as to improve the response speed effectively.
摘要：
Task scheduling is a NP-hard problem and is an integral part of parallel and distributed computing. This paper combined with the advantages of genetic algorithm and simulated annealing, brings forward a parallel genetic simulated annealing algorithm and applied to solve task scheduling in grid computing. It first generates a new group of individuals through genetic operation such as reproduction, crossover, mutation, etc, and than simulated anneals independently all the generated individuals respectively. When the temperature in the process of cooling no longer falls, the result is the optimal solution on the whole. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing.
期刊：
Proceedings of the First International Symposium on Test Automation & Instrumentation, Vols 1 - 3,2006年:1696-1701
通讯作者：
Gao Li
作者机构：
[Gao Li; Dai ShangPing; Zheng Shijue] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Gao Li] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
关键词：
assembled quality control;measured
摘要：
The measurement process of engine assembly line. which guarantees the important link to assemble. is paid close attention in the car and engine manufacturing. Several kinds of new detection technology employed on the assembly line of engine, that is introduced in this paper, have played the positive role in improving the quality of assembling.
期刊：
FIRST INTERNATIONAL MULTI-SYMPOSIUMS ON COMPUTER AND COMPUTATIONAL SCIENCES (IMSCCS 2006), PROCEEDINGS, VOL 2,2006年2:662-665
通讯作者：
Liu, Yuhua
作者机构：
[Zhu, Haiyan; Xu, Kaihua; Teng, Wei; Liu, Yuhua] Cent China Normal Univ, Dept Comp Sci, Wuhan 43079, Peoples R China.
通讯机构：
[Liu, Yuhua] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 43079, Peoples R China.
会议名称：
1st International Multi Symposium on Computer and Computational Sciences
会议时间：
JUN 20-24, 2006
会议地点：
Hangzhou, PEOPLES R CHINA
会议主办单位：
[Liu, Yuhua;Zhu, Haiyan;Xu, Kaihua;Teng, Wei] Cent China Normal Univ, Dept Comp Sci, Wuhan 43079, Peoples R China.
摘要：
In wireless sensor networks, composed of a large number of mainly static nodes with highly constrained energy resources and special application environment, the design of routing protocol often encounters more difficulty. Though some efficient routing protocols have been proposed in the past time, there isn't ideal mechanism of the routing update exactly. On the basis of analyzing of some existing route repair methods, a new sensor network route repair approach has been proposed by utilizing the sequence of the sink node and information of old route. Also the implement and the performance evaluation of this algorithm compared to the existing routing protocols are presented.
期刊：
Dynamics of Continuous, Discrete and Impulsive Systems Series A: Mathematical Analysis,2006年13:945-949 ISSN：1201-3390
通讯作者：
Liu, Yuhua
作者机构：
[Liu, Yuhua] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;Cent China Normal Univ, Res Ctr Digital Space Technol, Wuhan 430079, Peoples R China.
通讯机构：
[Liu, Yuhua] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
In this paper, the scale-free network discovery is reviewed and the scale-free characteristic of complex networks is described, based on the strategies which are proposed against vulnerability of hubs in scale-free networks. The strategies show how hierarchy is formed by controlling hubs and how nodes generate super-cube consists of virtual nodes in detail. The hierarchy of nodes has better flexibility and fault tolerance; besides, the super-cube structure has fault reconfiguration compared with hubs. Both have higher robustness and steadiness shown by simulation.
期刊：
2006 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PTS 1 AND 2, PROCEEDINGS,2006年:1078-1083
通讯作者：
Zhao, Erdun
作者机构：
[Yao, Juan; Zhao, Erdun] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Zhao, Erdun] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
We consider scheduling and resource allocation for the downlink of an OFDM-based wireless network. During each time-slot the scheduling and resource allocation problem involves selecting a subset of users for transmission, determining the assignment of available sub-carriers to selected users, and for each sub-carrier determining the transmission power and the coding and modulation scheme used In this paper, we propose a heuristic genetic scheduling algorithm to maximize system throughput while providing a level of fairness among users for non-real-time data traffic in the downlink of a multi-user OFDM system. We first formulate the resource allocation problem for rate, power, and sub-carrier allocation as an integer program in the context of a utility-based scheduling. Next, we present a heuristic genetic algorithm for the problem. Through the simulation, we show that the proposed scheme performs better than other schemes in terms of both system throughput and fairness among users.
通讯机构：
[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
期刊：
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.
期刊：
Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms,2006年13E:599-603 ISSN：1492-8760
通讯作者：
Shu, Wanneng
作者机构：
[Shu, Wanneng] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;Wuhan Polytech Univ, Dept Elect Informat Engn, Wuhan 430023, Peoples R China.
通讯机构：
[Shu, Wanneng] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
The complex resources and tasks in grid computing environment make it very difficult to validate the method of task scheduling. This paper proposes a task scheduling model for grid computing, designs and realizes a target genetic algorithm based on task scheduling. From the analysis and experiment result, it is concluded that this algorithm is superior to traditional algorithm and standard genetic algorithm.
期刊：
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.
