Characterisation and modelling of VBR video traffic

The impact of VBR video traffic characteristics on broadband network performance is analysed. In particular, the authors compare in a queue the behaviour of several models that adjust different statistical parameters of actual MPEG traces. It is proved that a good fit of the probability density function (PDF) is essential to approximate queuing behaviour while the effects of short range dependence (SRD) are of secondary importance and those of long range dependence (LRD) could be neglected for practical purposes if realistic scenarios, with strict QoS requirements, are considered     

Optical properties of Nd-doped Ca3(VO4)2 single crystal fiber

Optical absorption and photoluminescence of Ca₃(VO₄)₂ single crystal grown by a floating-zone technique and containing Nd³⁺ ions were investigated. High absorption coefficients and broadening of most absorption bands are present at 300 K, while substructures in some of the same bands can be evidenced at 12 K. Most features of measured spectra are characteristic of random occupation of more than a single Ca²⁺ site by the Nd³⁺ ion and of distortions provoked by different charge compensation mechanisms involving oxygen vacancies promotion in the crystal lattice. Nd³⁺ optical properties were studied by using the Judd-Ofelt theory to calculate the spectral parameters relevant for laser applications.     

Fast training procedure for Viola–Jones type object detectors using Laplacian clutter models

This paper presents a fast training strategy for the Viola–Jones (VJ) type object-detection systems. The VJ object- detection system, popular for its high accuracy at real-time testing speeds, has a drawback that it is slow to train. A face detector, for example, can take days to train. In content-based image retrieval (CBIR), where search needs to be performed instantaneously, VJ’s long training time is not affordable. Therefore, VJ’s method is hardly used for such applications. This paper proposes two modifications to the training algorithm of VJ-type object detection systems which reduces the training time to the order of seconds. Firstly, Laplacian clutter (non-object) models are used to train the weak classifier, thus eliminating the need to read and evaluate thousands of clutter images. Secondly, the training procedure is simplified by removing the time-consuming AdaBoost-based feature selection procedure. An object detector, trained with 500 images, approximately takes 2 s for training in a conventional 3 GHz machine. Our results show that the accuracy of the detector, built with the proposed approach, is inferior to that of VJ for difficult object class such as frontal faces. However, for objects with lesser degree of intra-class variations such as hearts, state-of-the-art accuracy can be obtained. Importantly, for CBIR applications, the fast testing speed of the VJ type object detector is maintained.     

An integrated tool for loop calculations: aITALC

aITALC, a new tool for automating loop calculations in high energy physics, is described. The package creates Fortran code for two-fermion scattering processes automatically, starting from the generation and analysis of the Feynman graphs. We describe the modules of the tool, the intercommunication between them and illustrate its use with three examples.

Program summary

Title of the program:aITALC version 1.2.1 (9 August 2005)Catalogue identifier:ADWOProgram summary URL:http://cpc.cs.qub.ac.uk/summaries/ADWOProgram obtainable from:CPC Program Library, Queen's University of Belfast, N. IrelandComputer:PC i386Operating system:GNU/Linux, tested on different distributions SuSE 8.2 to 9.3, Red Hat 7.2, Debian 3.0, Ubuntu 5.04. Also on SolarisProgramming language used:GNU Make, Diana, Form, Fortran77Additional programs/libraries used:Diana 2.35 (Qgraf 2.0), Form 3.1, LoopTools 2.1 (FF)Memory required to execute with typical data:Up to about 10 MBNo. of processors used:1No. of lines in distributed program, including test data, etc.:40 926No. of bytes in distributed program, including test data, etc.:371 424Distribution format:tar gzip fileHigh-speed storage required:from 1.5 to 30 MB, depending on modules present and unfolding of examplesNature of the physical problem:Calculation of differential cross sections for e⁺e⁻ annihilation in one-loop approximation.Method of solution:Generation and perturbative analysis of Feynman diagrams with later evaluation of matrix elements and form factors.Restriction of the complexity of the problem:The limit of application is, for the moment, the 2→2 particle reactions in the electro-weak standard model.Typical running time:Few minutes, being highly depending on the complexity of the process and the Fortran compiler.     

A framework for weighted fusion of multiple statistical models of shape and appearance

This paper presents a framework for weighted fusion of several active shape and active appearance models. The approach is based on the eigenspace fusion method proposed by Hall et al., which has been extended to fuse more than two weighted eigenspaces using unbiased mean and covariance matrix estimates. To evaluate the performance of fusion, a comparative assessment on segmentation precision as well as facial verification tests are performed using the AR, EQUINOX, and XM2VTS databases. Based on the results, it is concluded that the fusion is useful when the model needs to be updated online or when the original observations are absent     

An efficient model for studying the dynamics of frustrated systems

We present a model based on determinist cellular automata architecture for studying systems with frustrated interactions that present elemental excitations, such as magnetic monopoles. This model is especially designed to be applied for systems with components that have energy levels much higher than $kT$. This would imply that for these systems thermal fluctuations are negligible and they can be analyzed under the supposition that the dynamic is produced at zero temperature. This category includes artificial magnetic spin ice systems and donor and recipient electrical charge molecular systems. The dynamics of these systems can be simulated in real time with this model, with a minimum of computational requirements. It can be an excellent complement to Monte Carlo methods and in some cases can even replace them directly. In this report, we show the designed structure and some interesting results obtained in studying the dynamics of emergent magnetic monopoles in artificial spin ice systems and excitations in graphane molecular arrays.     

Stress recovery in geometrically nonlinear membranes by a Hu-Washizu finite element formulation

A class of mixed finite elements based on the Hu-Washizu functional is introduced as a strategy to reduce the spurious stress phenomena encountered with standard or displacement-based formulations for geometrically exact membranes. Selected examples compare the performance of this class of elements with that of the standard formulation and demonstrate that reduction of spurious stresses is obtained and that the stresses are more accurate than those optimally sampled in the standard formulation.     

Combined Petri net modelling and AI-based heuristic hybrid search for flexible manufacturing systems—part II. Heuristic hybrid search

This two-part paper presents modelling and scheduling approaches of flexible manufacturing systems using Petri nets (PNs) and artificial intelligence (AI)-based heuristic search methods. In Part I, PN-based modelling approaches and basic AI-based heuristic search algorithms were presented. In Part II, a new heuristic function that exploits PN information is proposed. Heuristic information obtained from the PN model is used to dramatically reduce the search space. This heuristic is derived from a new concept, the resource cost reachability matrix, which builds on the properties of B-nets proposed in Part I. Two hybrid search algorithms, (1) an approach to model dispatching rules using analysis information provided by the PN simulation and (2) an approach of the modified stage-search algorithm, are proposed to reduce the complexity of large systems. A random problem generator is developed to test the proposed methods. The experimental results show promising results.