43618975
The relation of matching with inverse degree of a graph
In this paper, we give out a counterexample of the Graffiti's conjecture (583), and get the best bounds of I(T)+@a^'(T), where T denotes a tree, I(T) denotes the inverse degree of T and @a^'(T) matching of T.
38207892
On the Relations Between Arboricity and Independent Number Or Covering Number
In this paper, the following results are obtained: a(G) + β(G) ⩽ p + 1, ⌈p2⌉ ⩽ a(G)β(G), ⌈p2⌉ ⩽ a′(G) + gb′(G) ⩽ pa′(G) + α′(G) ⩽ 2⌈p2⌉ (δ ⩽ 1) and all bounds are sharp, where p = ¦V(G)¦, ⌈x⌉ denotes the smallest integer greater than or equal to x, a(G) is the vertex arboricity, a′(G) is the edge arboricity, α′(G) is the edge covering number, β(G) is the vertex independent number, β′(G) is the edge independent number, and δ is the minimum degree of G.
43476378
Partial converse for a relay channel
A special case of the general discrete memoryless relay channel is studied. This channel consists of an input x, a relay output z, a channel output y, and a noiseless channel of capacity C/sub r/ allowing the relay sender to send additional information to the decoder. The channel is described by a collection of distributions (p(y, z mod x)). The decoder uses the channel output y and a function f(z) of the relay output at a rate no greater than C/sub r/ to recover the message. Some results on the capacity of the channel are obtained. >
18861911
Service Identification and Packaging in Service Oriented Reengineering
With the adoption to Web service technologies, more and more existing non-service-oriented software systems turn to be legacy systems. They require a service-oriented reengineering process in order to survive in serviceoriented computing environment. In this paper, we present an architecture-based service-oriented approach to support service-oriented reengineering. It integrates and reuses software components as services over Internet by wrapping underlying computing models with XML. Service identification and service packaging processes are described in details, which are the keys to serviceoriented reengineering. Target services are defined according to service identification, which is based on a comparison of analyses in both problem domain and legacy systems. Clustering techniques are applied in service identification process to analyse recovered architectural information and to identify related modules. Service packaging is benefit from architecture-based development and reuse.
37643061
Adjacent strong edge coloring of graphs
Abstract For a graph G ( V , E ), if a proper k -edge coloring ƒ is satisfied with C ( u ) ≠ C ( v ) for uv ∈ E ( G ), where C(u) = {ƒ(uv) | uv ∈ E} , then ƒ is called k-adjacent strong edge coloring of G , is abbreviated k-ASEC , and χ ′ as ( G ) = min { k | k - ASEC of G } is called the adjacent strong edge chromatic number of G . In this paper, we discuss some properties of χ′ as ( G ), and obtain the χ′ as ( G ) of some special graphs and present a conjecture: if G are graphs whose order of each component is at least six, then χ ′ as ( G ) ≤ Δ ( G ) + 2, where Δ( G ) is the maximum degree of G .
15502339
Optimal parallel scheduling algorithm for WDM optical interconnects with recirculating buffering
We study scheduling algorithms in WDM optical interconnects with recirculating buffering. The interconnect we consider has wavelength conversion capabilities. We focus on limited range wavelength conversion while considering full range wavelength conversion as a special case. We formalize the problem of maximizing throughput and minimizing packet delay in such an interconnect as a matching problem in a bipartite graph and give an optimal parallel algorithm that runs in O(Bk/sup 2/), as compared to O((N+B)/sup 3/k/sup 3/) time if directly applying other existing matching algorithms, where N is the number of input/output fibers, B is the number of fiber delay lines and k is the number of wavelengths per fiber.
1937169
Camera calibration with one-dimensional objects
Camera calibration has been studied extensively in computer vision and photogrammetry and the proposed techniques in the literature include those using 3D apparatus (two or three planes orthogonal to each other or a plane undergoing a pure translation, etc.), 2D objects (planar patterns undergoing unknown motions), and 0D features (self-calibration using unknown scene points). Yet, the paper proposes a new calibration technique using 1D objects (points aligned on a line), thus filling the missing dimension in calibration. In particular, we show that camera calibration is not possible with free-moving 1D objects, but can be solved if one point is fixed. A closed-form solution is developed if six or more observations of such a 1D object are made. For higher accuracy, a nonlinear technique based on the maximum likelihood criterion is then used to refine the estimate. Singularities have also been studied. Besides the theoretical aspect, the proposed technique is also important in practice especially when calibrating multiple cameras mounted apart from each other, where the calibration objects are required to be visible simultaneously.