Network resource management for enterprise wide multimedia services

The support of broadband multimedia applications over an enterprise network poses a broad range of networking challenges for efficient resource management, intelligent switching, and access control for distributed information. We propose two server-based scheduling algorithms, with low computational complexity, to guarantee multimedia information synchronization at the destination, with minimum presentation delays and buffer requirements. We outline a communication framework, highlighting the issues and challenges faced by today's enterprise networks to support multimedia services. We describe the proposed connection establishment and resource allocation schemes in resource-constrained enterprise networks. The objective is to manage the limited resources of the network for maximum utilization. Towards this end we present a dynamic capacity allocation scheme to support connections for multiple users. Specifically, we show that the channel capacity allocation problem can be formulated as a quadratic programming problem. This allocation scheme is implemented at each intermediate switch to dynamically determine the capacity allocation. The effects of interswitch rate mismatch and network delay offset scheduling have also been incorporated in the management framework. In addition, we introduce the concept of route selection based on the requested network quality of service     

Macrophyllicin, a saponin from Primula macrophylla

A new triterpenoid saponin, macrophyllicin has been isolated from the methanolic extract of the whole plant of Primula macrophylla. On the basis of chemical and spectral evidence, the structure of macrophyllicin was determined as 3-O-[alpha-L-rhamnopyranosyl-(1-->2)-beta-D-glucopyranosyl- (1-->2)-beta-D-galactopyranosyl-(1-->2)-beta-D-glucuronopyranosyl] -6 beta,16 alpha,28-trihydroxy-olean-12-ene. The 2D NMR experiments were useful in providing complete information on the structure of macrophyllogenin, a new sapogenin.     

Halftoning via direct binary search using analytical and stochastic printer models

We incorporate models for printer dot interactions within the iterative direct binary search (DBS) halftoning algorithm. Monochrome electro-photographic printers are considered. Both analytical and stochastic models are studied. In the analytical model it is assumed that the printer can generate a circular spot with constant absorptance at each printer addressable location, whereas the stochastic model is based on microscopic absorptance and variance measurements. We also present an efficient strategy for evaluating the change in computational cost as the search progresses. With our scheme, updating the change in error only involves a few fetches from two look-up-tables and some scalar multiplications and additions. Experimental results are provided that show that DBS with an appropriate model for printer dot interactions yields enhanced detail rendition, and improved tonal gradation in shadow areas.     

Dynamic Resource Allocation for Multimedia Document Retrieval over High Speed LANs

The emergence of gigabit local area networks (G-LANs) has spurred a tremendous interest in supporting networked multimedia applications over a LAN. In this paper, we propose a mechanism for dynamically allocating network resources in asynchronous LANs. Presentation of multimedia objects with required play-out quality requires Quality of Service (QoS) guarantees by the underlying networking infrastructure. Existing asynchronous LANs, such as Ethernet, do not support the notion of QoS due to their asynchronous media access protocol. For such networks, we propose a dynamic bandwidth management scheme that uses the concept of Time Division Multiple Access (TDMA). Significant performance improvement is observed through experimental results. In particular, the transmission rates for multimedia hosts improve significantly with low jitter variations in media streams. We also propose a framework for graceful degradation of play-out quality of multimedia objects in case the LAN's total capacity is not sufficient to meet the overall demand.     

Digital color halftoning

Digital color halftoning is the process of transforming continuous-tone color images into images with a limited number of colors. The importance of this process arises from the fact that many color imaging systems use output devices such as color printers and low-bit depth displays that are bilevel or multilevel with a few levels. The goal is to create the perception of a continuous-tone color image using the limited spatiochromatic discrimination capability of the human visual system. In decreasing order of how locally algorithms transform a given image into a halftone and, therefore, in increasing order of computational complexity and halftone quality, monochrome digital halftoning algorithms can be placed in one of three categories: 1) point processes (screening or dithering), 2) neighborhood algorithms (error diffusion), and 3) iterative methods. All three of these algorithm classes can be generalized to digital color halftoning with some modifications. For an in-depth discussion of monochrome halftoning algorithms, the reader is directed to the July 2003 issue of IEEE Signal Processing Magazine. In the remainder of this article, we only address those aspects of halftoning that specifically have to do with color. For a good overview of digital color halftoning, the reader is directed to Haines et al. (2003). In addition, Agar et al. (2003) contains a more in-depth treatment of some of the material found in this work.     

A Novel Protocol with Patient and Node Identification for Optical WBAN with Inherent Security and Interference Rejection

Wireless Personal Communications - The wireless body area network (WBAN) has emerged as a new technology for e-healthcare that allows real time monitoring of patients using miniaturized wearable...     

Computer-aided design of clustered-dot color screens based on ahuman visual system model

We address the problem of optimal periodic clustered-dot color-screen design. In traditional clustered-dot color screening, the screen for each colorant is rotated to a different angle relative to the others. If the angles are not carefully chosen, visible moire and rosette artifacts may appear These artifacts primarily result from the interaction of the periodic structures associated with the halftone screens of different colorants. Registration errors can also introduce unwanted artifacts in the screened images. Using lattice theory and a model for the perceived rendered halftone, we present a systematic method for designing moire- and rosette-free clustered-dot color screens for discrete-raster color systems. We also investigate strategies for choosing the periodicities so that the resulting screen is robust to registration errors     

Wireless network resource management for Web-based multimedia document services

Advances in wireless technology and availability of portable devices with networking capabilities have enabled ubiquitous Web accessibility. This has created the need to provide advance Internet services to mobile users without causing service failures due to connection migration or handoffs. However, scarcity of wireless resources restricts the provision of multimedia services in wireless networks. We address the issue of managing wireless resources to support Web-based multimedia document services including MPEG-4-based applications, in wireless networks with a high degree of user mobility. In particular, we formulate the resource management problem in wireless networks as an optimization problem with an objective function comprising different quality of presentation parameters.     

Quality-based evaluation of multimedia synchronization protocolsfor distributed multimedia information systems

Distributed, networked multimedia information systems will be a critical component of technology-based information infrastructures in the future. We present an infrastructure for supporting multimedia applications. We discuss various characteristics of multimedia data and the effect of the network on the required quality of presentation for multimedia data. We present a suite of synchronization protocols to support the quality of presentation. The crux of these protocols is the scheduling of multimedia information for synchronized delivery, over broadband networks with limited resources, and is identified as an NP-hard problem. We introduce two parameters which can be used to measure the performance of end-to-end synchronization protocols in a network supporting distributed multimedia applications. We propose and implement several heuristic scheduling algorithms, and compare their performance. We deduce the appropriateness of these algorithms in different types of distributed multimedia environments