33646984
Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs
32008979
Isomorphic Path Decompositions of Crowns
42438893
Some Decomposition Invariants of Crowns
6644016
Multistar Decomposition of Complete Multigraphs
40521773
Cycle decompositions of crowns
Abstract For an integer n ⩾3, the crown S n 0 is defined to be the graph with vertex set { x 0 , x 1 ,…, x n −1 , y 0 , y 1 ,…, y n −1 } and edge set {x i y j : 0⩽i,j⩽n−1, i≠j} . In this paper we give some sufficient conditions for the edge decomposition of the crown into isomorphic cycles.
15011396
Adaptive resource management for mobile multimedia communications in asymmetric wireless network
In the multi-service wireless networks, the bandwidth asymmetry is the distinctive characteristic. To avoid wasting uplink and downlink bandwidth in asymmetric network, admissible region for the nonreal-time (NRT) calls has been proposed. But in that scheme the static guard capacity for RT and NRT calls cannot adapt to traffic variation. In addition, the differentiated QoS services to users are not considered. In this paper, we propose an adaptive guard channel reservation (AGCR) scheme, which has the following novelties: i) the guard capacity for each class is dynamically adjusted so as to adapt to dynamic traffic, ii) the blocking probabilities of classes with higher priority are kept below certain targets and iii) differentiated QoS services to users are provided by maintaining the blocking probability ratios over different classes at the predefined targets. Simulation results have demonstrated the proposed AGCR scheme can keep the blocking probabilities of classes with higher priority below certain targets, track the ratios close to the targets well while maintaining a high bandwidth utilization
37670445
Drawing Graphs with Nonuniform Nodes Using Potential Fields
A potential field approach, coupled with force-directed methods, is proposed in this paper for drawing graphs with nonuniform nodes in 2-D and 3-D. In our framework, nonuniform nodes are uniformly or nonuniformly charged, while edges are modelled by springs. Using certain techniques developed in the field of potential-based path planning, we are able to find analytically tractable procedures for computing the repulsive force and torque of a node in the potential field induced by the remaining nodes. Our experimental results suggest this new approach to be promising, as drawings of good quality for a variety of graphs in 2-D and 3-D can be produced efficiently.
3023468
Special Issue on Enabling Security Technologies for Digital Rights Management
14630306
Fuzzy neural network classification design using support vector machine
Fuzzy neural networks (FNNs) for pattern classification usually use the backpropagation or C-cluster type learning algorithms to learn the parameters of the fuzzy rules and membership functions from the training data. However, such kinds of learning algorithms usually cannot minimize the empirical risk (training error) and expected risk (testing error) simultaneously, and thus cannot reach a good classification performance in the testing phase. To tackle this drawback, a support-vector-based fuzzy neural network classification (SVFNNC) is proposed. The SVFNNC combines the superior classification power of support vector machine (SVM) in high reasoning of FNN in handling uncertainty information. The learning algorithm consists of two learning phases. In the phase 1, the fuzzy rules and membership functions are automatically determined by the clustering principle. In the phase 2, the parameters of FNN are calculated by the SVM with the proposed adaptive fuzzy kernel function. To investigate the effectiveness of the proposed SVFNNC, it is applied to the iris, vehicle and dna datasets. Experimental results show that the proposed SVFNNC can achieve good classification performance with drastically reduced number of fuzzy kernel functions.
11189498
On the spanning connectivity of graphs
Abstract A k-container C ( u , v ) of G between u and v is a set of k internally disjoint paths between u and v . A k -container C ( u , v ) of G is a k * - container if it contains all vertices of G . A graph G is k * - connected if there exists a k * -container between any two distinct vertices. The spanning connectivity of G , κ * ( G ) , is defined to be the largest integer k such that G is w * -connected for all 1 ⩽ w ⩽ k if G is a 1 * -connected graph. In this paper, we prove that κ * ( G ) ⩾ 2 δ ( G ) - n ( G ) + 2 if ( n ( G ) / 2 ) + 1 ⩽ δ ( G ) ⩽ n ( G ) - 2 . Furthermore, we prove that κ * ( G - T ) ⩾ 2 δ ( G ) - n ( G ) + 2 - | T | if T is a vertex subset with | T | ⩽ 2 δ ( G ) - n ( G ) - 1 .