A Novel Packet Marking Function for Real-Time Interactive MPEG-4 Video Applications in a Differentiated Services Network

The future convergence of voice, video and data applications on the Internet requires that next generation technology provides bandwidth and delay guarantees. Current technology trends are moving towards scalable aggregate-based systems where applications are grouped together and guarantees are provided at the aggregate level only. This solution alone is not enough for interactive video applications with sub-second delay bounds. This paper introduces a novel packet marking scheme that controls the end-to-end delay of an individual flow as it traverses a network enabled to supply aggregate- granularity Quality of Service (QoS). IPv6 Hop-by-Hop extension header fields are used to track the packet delay encountered at each network node and autonomous decisions are made on the best queuing strategy to employ. The results of network simulations are presented and it is shown that when the proposed mechanism is employed the requested delay bound is met with a 20% reduction in resource reservation and no packet loss in the network.

Miniaturization of electromagnetic band gap structures for mobile applications

It is well known that interference of the human body affects the performance of the antennas in mobile phone handsets. In this contribution, we investigate the use of miniaturized metallodielectric electromagnetic band gap (MEBG) structures embedded in the case of a mobile handset as a means of decoupling the antenna from the user's hand. The closely coupled MEBG concept is employed to achieve miniaturization of the order of 15:1. Full wave dispersion relations for planar closely coupled MEBG arrays are presented and are validated experimentally. The performance of a prototype handset with an embedded conformal MEBG is assessed experimentally and is compared to a similar prototype without the MEBG. Reduction in the detuning of the antenna because of the human hand by virtue of the MEBG is demonstrated. Moreover, the efficiency of the handset when loaded with a human hand model is shown to improve when the MEBG is in place. The improvements are attributed to the decoupling of the antenna from the user's hand, which is achieved by means of suppressing the fields in the locality of the hand.

Multimodal Biometric Human Recognition for Perceptual Human-Computer Interaction

In this paper, a novel video-based multimodal biometric verification scheme using the subspace-based low-level feature fusion of face and speech is developed for specific speaker recognition for perceptual human--computer interaction (HCI). In the proposed scheme, human face is tracked and face pose is estimated to weight the detected facelike regions in successive frames, where ill-posed faces and false-positive detections are assigned with lower credit to enhance the accuracy. In the audio modality, mel-frequency cepstral coefficients are extracted for voice-based biometric verification. In the fusion step, features from both modalities are projected into nonlinear Laplacian Eigenmap subspace for multimodal speaker recognition and combined at low level. The proposed approach is tested on the video database of ten human subjects, and the results show that the proposed scheme can attain better accuracy in comparison with the conventional multimodal fusion using latent semantic analysis as well as the single-modality verifications. The experiment on MATLAB shows the potential of the proposed scheme to attain the real-time performance for perceptual HCI applications.

Wrapping Legacy Applications into Grid Services: A Case Study of a Three Services Approach

In this paper, the support for legacy application, which is one of the important advantages of Grid computing, is presented. The ability to reuse existing codes/applications in combination with other Web/Internet technologies, such as Java, makes Grid computing a good choice for developers to wrap existing applications behind Intranet or the Internet. The approach developed can be used for migrating legacy applications into Grid Services, which speeds up the popularization of Grid technology. The approach is illustrated using a case study with detailed description of its implementation step by step. Globus Toolkit is utilized to develop the system.

Dartmouth Symposium on the Future of Computer Music Software: A Panel Discussion

Transcript of a Panel Discussion at the Dartmouth Symposium, chaired by Eric Lyon.

A web-based overview of semiconductor photochemistry-based current commercial applications

The major current commercial applications of semiconductor photochemistry promoted on the world wide web are reviewed. The basic principles behind the different applications are discussed, including the use of semiconductor photochemistry to: photo-mineralise organics, photo-sterilise and photo-demist. The range of companies, and their products, which utilise semiconductor photochemistry are examined and typical examples listed. An analysis of the geographical distribution of current commercial activity in this area is made. The results indicate that commercial activity in this area is growing world-wide, but is especially strong in Japan. The number and geographical distribution of patents in semiconductor photocatalysis are also commented on. The trends in the numbers of US and Japanese patents over the last 6 years are discussed. (C) 2002 Elsevier Science B.V. All rights reserved.

A Kernel Interleaved Scheduling Method for Streaming Applications on Soft-core Vector Processors

Massively parallel networks of highly efficient, high performance Single Instruction Multiple Data (SIMD) processors have been shown to enable FPGA-based implementation of real-time signal processing applications with performance and
cost comparable to dedicated hardware architectures. This is achieved by exploiting simple datapath units with deep processing pipelines. However, these architectures are highly susceptible to pipeline bubbles resulting from data and control hazards; the only way to mitigate against these is manual interleaving of
application tasks on each datapath, since no suitable automated interleaving approach exists. In this paper we describe a new automated integrated mapping/scheduling approach to map algorithm tasks to processors and a new low-complexity list scheduling technique to generate the interleaved schedules. When applied to a spatial Fixed-Complexity Sphere Decoding (FSD) detector
for next-generation Multiple-Input Multiple-Output (MIMO) systems, the resulting schedules achieve real-time performance for IEEE 802.11n systems on a network of 16-way SIMD processors on FPGA, enable better performance/complexity balance than current approaches and produce results comparable to handcrafted implementations.

Swarm scheduling approaches for work-flow applications with security constraints in distributed data-intensive computing environments

The scheduling problem in distributed data-intensive computing environments has become an active research topic due to the tremendous growth in grid and cloud computing environments. As an innovative distributed intelligent paradigm, swarm intelligence provides a novel approach to solving these potentially intractable problems. In this paper, we formulate the scheduling problem for work-flow applications with security constraints in distributed data-intensive computing environments and present a novel security constraint model. Several meta-heuristic adaptations to the particle swarm optimization algorithm are introduced to deal with the formulation of efficient schedules. A variable neighborhood particle swarm optimization algorithm is compared with a multi-start particle swarm optimization and multi-start genetic algorithm. Experimental results illustrate that population based meta-heuristics approaches usually provide a good balance between global exploration and local exploitation and their feasibility and effectiveness for scheduling work-flow applications. © 2010 Elsevier Inc. All rights reserved.