IC-Colorings and IC-Indices of graphs
Given a coloring f:V(G)->N of graph G and any subgraph H@?G we define f"s(H)=@?"v"@?"V"("H")f(v). In particular, we denote f"s(G) by S(f). The coloring f is called an IC-coloring if for any integer k@?[1,S(f)] there is a connected subgraph H@?G such that f"s(H)=k. Also, we define the IC-index of G to beM(G)=max{S(f):f is an IC-coloring of G}.In this paper we examine some well-known classes of graphs and determine their IC-indices. In addition, several conjectures are proposed.

title: On Magic Strength of Graph

title: On skolem graceful graphs
abstract: A Skolem graceful labelling of graphs is introduced. It is shown that a tree is Skolem graceful iff it is graceful. The Skolem deficiency of a graph is defined and Skolem deficiencies of some well-known graphs are calculated. The class of Skolem graceful graphs is shown to be finite universal.

title: Merging Back-propagation and Hebbian Learning Rules for Robust Classifications
abstract: By imposing saturation requirements on hidden-layer neural activations, a new learning algorithm is developed to improve robustness on classification performance of a multi-layer Perceptron. Derivatives of the sigmoid functions at hidden-layers are added to the standard output error with relative significance factors, and the total error is minimized by the steepest-descent method. The additional gradient-descent terms become Hebbian, and this new algorithm merges two popular learning algorithms, i.e., error back-propagation and Hebbian learning rules. Only slight modifications are needed for the standard back-propagation algorithm, and additional computational requirements are negligible. This saturation requirement effectively reduces output sensitivity to the input, which results in improved robustness and better generalization for classifier networks. Also distributed representations at hidden-layers are successfully suppressed to accomplish efficient utilization of hidden neurons. Computer simulations demonstrates much faster learning convergence as well as improved robustness for classifications and hetero-associations of binary patterns.

title: Scale-Space Derived From B-Splines
abstract: This paper proposes a scale-space theory based on B-spline kernels. Our aim is twofold: 1) present a general framework, and show how B-splines provide a flexible tool to design various scale-space representations. In particular, we focus on the design of continuous scale-space and dyadic scale-space frame representations. A general algorithm is presented for fast implementation of continuous scale-space at rational scales. In the dyadic case, efficient frame algorithms are derived using B-spline techniques to analyze the geometry of an image. The relationship between several scale-space approaches is explored. The behavior of edge models, the properties of completeness, causality, and other properties in such a scale-space representation are examined in the framework of B-splines. It is shown that, besides the good properties inherited from the Gaussian kernel, the B-spline derived scale-space exhibits many advantages for modeling visual mechanism including the efficiency, compactness, orientation feature and parallel structure.

title: INSIGNIA: An IP-Based Quality of Service Framework for Mobile ad Hoc Networks
abstract: We present the design, implementation, and evaluation of INSIGNIA, an IP-based quality of service framework that supports adaptive services in mobile ad hoc networks. The framework is based on an in-band signaling and soft-state resource management approach that is well suited to supporting mobility and end-to-end quality of service in highly dynamic environments where the network topology, node connectivity, and end-to-end quality of service are time varying. Architecturally INSIGNIA is designed to support fast reservation, restoration, and end-to-end adaptation based on the inherent flexibility and robustness and scalability found in IP networks. We evaluate the framework, paying particular attention to the performance of the in-band signaling system, which helps counter time-varying network dynamics in support of the delivery of adaptive services. Our results show the benefit of our framework under diverse mobility, traffic, and channel conditions.

title: Transitive Mesh Space of a Progressive Mesh
abstract: The paper investigates the set of all selectively refined meshes that can be obtained from a progressive mesh. We call the set the transitive mesh space of a progressive mesh and present a theoretical analysis of the space. We define selective edge collapse and vertex split transformations, which we use to traverse all selectively refined meshes in the transitive mesh space. We propose a complete selective refinement scheme for a progressive mesh based on the transformations and compare the scheme with previous selective refinement schemes in both theoretical and experimental ways. In our comparison, we show that the complete scheme always generates selectively refined meshes with smaller numbers of vertices and faces than previous schemes for a given refinement criterion. The concept of dual pieces of the vertices in the vertex hierarchy plays a central role in the analysis of the transitive mesh space and the design of selective edge collapse and vertex split transformations.

title: FGS-based video streaming test-bed for MPEG 21 universal multimedia access with digital item adaptation
abstract: It is a challenging problem to stream real-time video over heterogeneous networks with time-varying channel conditions and devices with different capabilities. In this paper, we present an FGS-based unicast video streaming test bed, which is now being considered by the MPEG-4/21 committee as a reference test bed. The proposed system supports resource adaptation delivery of the MPEG-21 DIA scheme which leads to a more strict evaluation methodology according to the MPEG committee specified common test conditions for scalable video coding. It provides easy control of media delivery with duplicable network conditions. To provide the best quality of service for each client, we propose relevant rate control, error protection, and transmission approaches in the content server, network interface, and clients, respectively.