作者机构：
[Zukerman, M] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.;Univ Melbourne, Australian Res Council Special Res, CUBIN, EEE Dept,Natl ICT Australia, Parkville, Vic 3052, Australia.
通讯机构：
[Zukerman, M] C;Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
关键词：
Congestion control;Diffserv;FAST TCP;Priority queuing;Round-trip time (RTT)
期刊：
Lecture Notes in Computer Science,2005年3399:991-1002 ISSN：0302-9743
通讯作者：
Xiong, NX
作者机构：
[Xiong, NX] Wuhan Univ, Comp Sch, Wuhan 430079, Peoples R China.;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China.;City Univ Hong Kong, SMIEEE, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China.
期刊：
Journal of Global Optimization,2004年28(1):115-119 ISSN：0925-5001
通讯作者：
Du, HW
作者机构：
[Du, HW] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.;City Univ Hong Kong, Dept Comp Sci, Kowloon Tong, Hong Kong, Peoples R China.;Univ Texas, Dept Comp Sci, Richardson, TX 75083 USA.
通讯机构：
[Du, HW] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
关键词：
Color;Real Function;Double Disk
摘要：
We study the problem of minimizing the number of colors for vertex-coloring of double disk graphs and in this note, show a polynomial-time 31-approximation for the problem, which improves an existing result.
会议名称：
Computational and Information Science, First International Symposium, CIS 2004, Shanghai, China, December 16-18, 2004, Proceedings
摘要：
The problem of the capacity expansion of a network by means of expanding the capacity of its arcs is elaborated in this paper. By using the theory and algorithm of the maximum flow, the minimum cut-set and the bottleneck of the network can be found, then the expansible arcs are sought according to whether there exists any augmenting path in the minimum cut-set. If the expansible arcs exist, the capacity of the network can be expanded by means of expanding the capacity of those arcs to increase the maximum flow. In order to fulfill the goal, the algorithms of the expansible arc and the optimal expansion arc are presented and the complexity analyses of those algorithms are given as well.
期刊：
Lecture Notes in Computer Science,2004年3358:875-887 ISSN：0302-9743
通讯作者：
He, YX
作者机构：
[He, YX] Wuhan Univ, Comp Sch, State Key Lab Software Engn, Wuhan 430072, Peoples R China.;Cent China Normal Univ, Dept Comp Sci, Hubei Wuhan 430079, Peoples R China.
通讯机构：
[He, YX] W;Wuhan Univ, Comp Sch, State Key Lab Software Engn, Wuhan 430072, Peoples R China.
摘要：
The main difficulty arising in designing an efficient congestion control scheme lies in the large propagation delay in data transfer which usually leads to a mismatch between the network resources and the amount of admitted traffic. To attack this problem. this paper describes a novel congestion control scheme that is based on a Back Propagation (BP) neural network technique. We consider a general computer communication model with multiple sources and one destination node. The dynamic buffer occupancy of the bottleneck node is predicted and controlled by using a BP neural network. The controlled best-effort traffic of the sources uses the bandwidth, which is left over by the guaranteed traffic. This control mechanism is shown to be able to avoid network congestion efficiently and to optimize the transfer performance both by the theoretic analyzing procedures and by the simulation studies.
期刊：
Lecture Notes in Computer Science,2004年3332:197-204 ISSN：0302-9743
通讯作者：
Liu, HY
作者机构：
[Liu, HY] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.;Wuhan Univ, Dept Finance, Sch Business, Wuhan 430072, Hubei, Peoples R China.
通讯机构：
[Liu, HY] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.
摘要：
An advanced content-based news video browsing and retrieval system, NewsBR, is proposed in this work. The system is built on high-accuracy news story segmentation and topic caption text extraction. Its main features include category-based news story browsing, key-frame-based video abstract and keyword-based news story retrieval. In the paper, news story segmentation and topic caption text extraction, as well as content-based video browsing and retrieval, are addressed in detail. The system is helpful and effective for the overall understanding of the news video content.
作者机构：
[Liu, YH] Huazhong Univ Sci & Technol, Coll Comp Sci & Technol, Wuhan 430074, Peoples R China.;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;Cent China Normal Univ, Dept Math, Wuhan 430079, Peoples R China.;Cent China Normal Univ, Educ Informat Res Ctr, Wuhan 430079, Peoples R China.
关键词：
maximum flow;minimum cutset;capacity-expanded network;optimization algorithm.
摘要：
The paper points out the relationship between the bottleneck and the minimum cutset of the network, and presents a capacity expansion algorithm of network optimization to solve the network bottleneck problem. The complexity of the algorithm is also analyzed. As required by the algorithm, some virtual sources are imported through the whole positive direction subsection in the network, in which a certain capacity value is given. Simultaneously, a corresponding capacity-expanded network is constructed to search all minimum cutsets. For a given maximum flow value of the network, the authors found an adjustment value of each minimum cutset arc's group with gradually reverse calculation and marked out the feasible flow on the capacity-extended networks again with the adjustment value increasing. All this has been done repeatedly until the original topology structure is resumed. So the algorithm can increase the capacity of networks effectively and solve the bottleneck problem of networks.
作者机构：
[Tan, LS; Pugh, AC] Department of Computer Science, Central China Normal University, Wuhan 430079, China
通讯机构：
[Tan, LS ] ;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
The non-standard H<inf>∞</inf> control problem is the case where the direct feedthroughs from the input to the error and from the exogenous signal to the output are not necessarily of full rank. In this paper, this problem is reformulated based on the generalized chain-scattering representation (GCSR). The GCSR approach leads naturally to a generalization of the homographic transformation. The state-space realization for this generalized homographic transformation and a number of fundamental cascade structures of the H<inf>∞</inf> control systems are further studied in a unified framework of GCSR. Certain sufficient conditions for the solvability of the non-standard H<inf>∞</inf> control problem are therefore established via a (J,J′)-lossless factorization of GCSR. These results present extensions to Kimura's results on the chain-scattering representation (CSR) approach to the H<inf>∞</inf> control in the standard case.
关键词：
safety interlock system;symbolic model checking;safety verification;industrial processes
摘要：
The safety interlock system (SIS) is one of the most important protective measurements in industrial processes that provide automatic actions to correct an abnormal plant event. This paper considers the use of formal techniques based on symbolic model checking and computation tree logic (CTL) in the specification to automatically verify the SIS for industrial processes. It addresses the problem of modelling industrial processes and presenting the SIS in CTL. It shows how symbolic model checking can be used efficiently in the verification of a SIS. A transferring system for a penicillin process is used as a case study. (C) 2001 Elsevier Science Ltd. All rights reserved.
作者机构：
[Wang, ZJ; Wang, ZY; Chen, L] CENT CHINA NORMAL UNIV,DEPT COMP SCI,WUHAN 430070,PEOPLES R CHINA.;[Wang, ZY] WUHAN DIGITAL ENGN INST,WUHAN 430074,PEOPLES R CHINA.
通讯机构：
[Wang, ZY] W;WUHAN DIGITAL ENGN INST,WUHAN 430074,PEOPLES R CHINA.
关键词：
Ada program complexity;concurrent program;rendezvous;successive relation;nesting relation
摘要：
Concurrency of a multi-task program is presented by its communicating and synchronizing behavior between tasks. In Ada, this behavior is expressed as rendezvous relations between them. Difficulties in understanding a program lie in understanding their rendezvouses and relations between them. Rendezvous successive and nesting relations are introduced. Successive graph and nesting tree are used for modeling these relations. Finally, it is proposed that concurrent complexity CC(P) of an Ada program P is a weighted sum of successive complexity SC(P) and nesting complexity NC(P), and SC(P) is the sum of edge numbers of rendezvous successive graphs and NC(P) is the sum of weighted node numbers on rendezvous nesting trees constructed from rendezvous relations which can be identified statically in Ada program text.
