27085181
A new degree condition for graphs to have [a, b]-factor
Abstract Let t ( ⩾ 3 ) , a and b be integers with 0 ⩽ a b . A graph is called K 1 , t -free if it contains no K 1 , t as an induced subgraph. We prove that every K 1 , t -free G has an [ a , b ] -factor if its minimum degree is at least ( t - 1 ) ( a + 1 ) + b b b + a ( t - 1 ) 2 ( t - 1 ) - t - 1 b b + a ( t - 1 ) 2 ( t - 1 ) 2 - 1 . This degree condition is sharp.
27000668
On (g, f, n)-Critical Graphs
5901027
Cycles Containing Many Vertices of Subsets in 1-Tough Graphs with Large Degree Sums
14244916
DLB: a novel real-time QoS control mechanism for multimedia transmission
This paper presents a new QoS guarantee scheme called R-(m,k)-firm (Relaxed-(m,k)-firm) which provides the guarantee on transmission delay of at least m out of any k consecutive packets (m/spl les/k). It has several advantages: (1) during network congestion, packets are dropped according to the (m,k) model rather than uncontrollably as the case of TD and RED, avoiding thus undesirable long consecutive packet drops; (2) it allows to admit more real-time flows than the traditional over-provisioning approach. A new mechanism, called DLB (double leaks bucket) is also proposed for dropping a proportion of packets of a flow or of aggregated-flows in case of network congestion while still guaranteeing the R-(m,k)-firm constraint. The sufficient condition for this guarantee is given for configuring the DLB parameters. It is easy to implement DLB in the actual IntServ and Diffserv architectures (by simply replacing the actual leaky, bucket by DLB) for providing respectively per flow and per class (m,k) guarantee, or event per flow R-(m,k)-firm guarantee in Diffserv.
45162569
Bioinformatics Web Services
Web services is distributed computing technology that provides software services over the Web. The Cyberinfrastructure Group at the Virginia Bioinformatics Institute (VBI) has adopted the Web service architecture and wrapped a wide variety of bioinformatics applications and data resources using the technology. Users can browse various data resources and invoke analysis tools through the services deployed at VBI. We have also developed an integrated client environment, ToolBus, which is available from http://pathport.vbi.vt.edu/download. A use case is given to demonstrate the use of Web services through ToolBus. A complete list of Web services is included.
36212113
Independent triangles covering given vertices of a graph
Let G be a simple graph of order n, k a positive integer with n≥3k and X a set of any k vertices of G. We show that if the minimum degree G)≥(n + k)=2, then G contains k independent triangles covering all vertices of X ; and if the minimum degree (G)≥(n+2k)=2, then G contains k independent triangles such that each triangle contains exactly one vertex of X . The bounds on the minimum degree of G in above results are sharp. Some conjectures about independent triangles covering some given vertices are proposed.
1037852
Smart rebinning for the compression of concentric mosaic
The concentric mosaic offers a quick solution to construct a virtual copy of a real environment, and to navigate in that virtual environment. However, the huge amount of data associated with the concentric mosaic is a heavy burden for its application. A three-dimensional (3D) wavelet-based compressor has been proposed in a previous work to compress the concentric mosaic. In this paper, we greatly improve the compression efficiency of the 3D wavelet coder by a data rearrangement mechanism called "smart rebinning". The proposed scheme first aligns the concentric mosaic image shots along the horizontal direction and then rebins the shots into multiperspective panoramas. Smart rebinning effectively enhances the correlation in the 3D data volume, translating the data into a representation that is more suitable for 3D wavelet compression. Experimental results show that the performance of the 3D wavelet coder is improved by an average of 4.3 dB with the use of the smart rebinning. The proposed coder outperforms MPEG-2 coding of the concentric mosaic by an average of 3.7 dB.