Cell versus message level performances in ATM networks

The goal of this paper is to provide some insight into the relations that exist between cell level and message level performance guarantees in the context of ATM networks. Cell level guarantees are typically what the network is capable of providing, while message level guarantees are the ones of interest to users. It is, therefore, important to understand how the two are related, and which factors influence this relation. There are many different performance measures that are of importance, and in this paper we try to touch on the (three) most relevant ones. This includes comparing cell and message loss probabilities, average cell and message delays, and cell and message jitter. Specifically, we show that cell and message loss probabilities can exhibit significant differences, which strongly depend on traffic characteristics such as peak rate and burst size, i.e., for a fixed cell loss probability, the message loss probability can greatly vary when peak rate and burst size change. One reason for this sensitivity, is that message loss depends on what happen to all the cells in a message. For delay and jitter, we also find that peak rate and burst size play a role in determining the relation between cell and message performance. However, this sensitivity is not as acute as with losses since message delay and jitter are typically determined by the performance seen by only one cell, the last cell in a message. In the paper, we provide quantitative examples that illustrate the range of behaviors and identify the impact of different parameters.

Role of spacer chain length in dimeric micellar organization. Small angle neutron scattering and fluorescence studies

Micelles of different dimeric amphiphiles Br-, n-C(16)H(33)NMe(2)(+) -(CH)(m)-N(+)Me(2)-n-C16H33, Br- (where m = 3, 4, 5, 6, 8, 10, and 12) adapt different morphologies and internal packing arrangements in aqueous media depending on their spacer chain length (m). Detailed measurements of small angle neutron scattering (SANS) cross sections from different bis-cationic, dimeric surfactant micelles in aqueous media (D2O) are reported. The data have been analyzed using the Hayter and Penfold model for macro ion solution to compute the interparticle structure factor S(Q) taking into account the screened Coulomb interactions between the dimeric micelles. The SANS analysis clearly indicated that the extent of aggregate growth and the variations of shapes of the dimeric micelles depend primarily on the spacer chain length. With spacer chain length, m less than or equal to 4, the propensity of micellar growth was particularly pronounced. The effects of the variation of the concentration of dimeric surfactants with m = 5 and 10 on the SANS spectra and the effects of the temperature variation for the micellar system with m = 10 were also examined. The critical micelle concentrations (cmc) and their microenvironmental feature, namely, the microviscosities that the dimeric micellar aggregates offer to a solubilized, extrinsic fluorescence probe, 1,6-diphenyl-1,3,5-hexatriene, were also determined. The changes of cmcs and microviscosities as a function of spacer chain length have been explained in terms of conformational variations and progressive looping of the spacer in micellar core upon increasing m values.

Chordal Bipartite Graphs with High Boxicity

The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater than 4. It was conjectured by Otachi, Okamoto and Yamazaki that chordal bipartite graphs have boxicity at most 2. We disprove this conjecture by exhibiting an infinite family of chordal bipartite graphs that have unbounded boxicity.

Optimal control of arrivals to queues with delayed queue length information

We consider discrete-time versions of two classical problems in the optimal control of admission to a queueing system: i) optimal routing of arrivals to two parallel queues and ii) optimal acceptance/rejection of arrivals to a single queue. We extend the formulation of these problems to permit a k step delay in the observation of the queue lengths by the controller. For geometric inter-arrival times and geometric service times the problems are formulated as controlled Markov chains with expected total discounted cost as the minimization objective. For problem i) we show that when k = 1, the optimal policy is to allocate an arrival to the queue with the smaller expected queue length (JSEQ: Join the Shortest Expected Queue). We also show that for this problem, for k greater than or equal to 2, JSEQ is not optimal. For problem ii) we show that when k = 1, the optimal policy is a threshold policy. There are, however, two thresholds m(0) greater than or equal to m(1) > 0, such that mo is used when the previous action was to reject, and mi is used when the previous action was to accept.

Synthesis of new transition metal nitrides, MWN2 (Mtriple bond; length as m-dashMn, Co, Ni)

We report the synthesis of ternary transition metal nitrides of the formula MWN(2) for M=Mn, Co, Ni by reaction of the corresponding MWO(4) with NH3 gas at 600-700 degrees C. MnWN2 is isostructural with the already-known FeWN2, crystallizing in a hexagonal structure (a=2.901(2), b=16.48(5) Angstrom) related to LiMoN2. CoWN2 and NiWN2 (which are isostructural amongst themselves) adopt a different hexagonal structure with a smaller c parameter. While the Mn and Fe nitrides are semiconducting, the Co and Ni nitrides are semimetallic.

Interfacial Regions Governing Internal Cavities of Dendrimers. Studies of Poly(alkyl aryl ether) Dendrimers Constituted with Linkers of Varying Alkyl Chain Length

This report deals with a study of the properties of internal cavities of dendritic macromolecules that are capable Of encapsulating and mediating photoreactions of guest molecules. The internal cavity structures of dendrimers are determined by the interfacial regions between the aqueous exterior and hydrocarbon like interior constituted by the linkers that connect symmetrically sited branch points constituting the dendrimer and head groups that cap the dendrimers. Phloroglucinol-based poly(alkyl aryl ether) dendrimers constituted with a homologous series of alkyl linkers were undertaken for the current study. Twelve dendrimers within first, second, and third generations, having ethyl, n-propyl, n-butyl, and n-pentyl groups as the linkers and hydroxyl groups at peripheries in each generation, were synthesized. Encapsulation of pyrene and coumarins by aqueous basic solutions of dendrimers were monitored-by UV-vis and fluorescence spectroscopies, which showed that a lower generation dendrimer with an optimal alkyl linker presented better encapsulation abilities than a higher generation dendrimer. Norrish type I photoreaction of dibenzyl ketone was carried out within the above: series of dendrimers to probe their abilities to hold guests and reactive inthermediate radical pairs within themselves. The extent of cage effect from the series of third generation dendrimers was observed to be higher with dendrimers having an n-pentyl group as the linker.

Stochastic dynamics modeling of the protein sequence length distribution in genomes: implications for microbial evolution

In this paper, we report an analysis of the protein sequence length distribution for 13 bacteria, four archaea and one eukaryote whose genomes have been completely sequenced, The frequency distribution of protein sequence length for all the 18 organisms are remarkably similar, independent of genome size and can be described in terms of a lognormal probability distribution function. A simple stochastic model based on multiplicative processes has been proposed to explain the sequence length distribution. The stochastic model supports the random-origin hypothesis of protein sequences in genomes. Distributions of large proteins deviate from the overall lognormal behavior. Their cumulative distribution follows a power-law analogous to Pareto's law used to describe the income distribution of the wealthy. The protein sequence length distribution in genomes of organisms has important implications for microbial evolution and applications. (C) 1999 Elsevier Science B.V. All rights reserved.

Analysing Message Sequence Graph Specifications

We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is well-known in the literature and forms the basis for the solution to several analysis and verification problems concerning MSG specifications, the constructions given in the literature are either not amenable to implementation, or imprecise, or simply incorrect. In contrast we give a detailed construction along with a proof of its correctness. Our transition system is amenable to implementation, and can also be used for a bounded analysis of general (not necessarily com-connected) MSG specifications.

Role of length scales on microwave thawing dynamics in 2D cylinders

Microwave (MW) thawing of 2D frozen cylinders exposed to uniform plane waves from one face, is modeled using the effective heat capacity formulation with the MW power obtained from the electric field equations. Computations are illustrated for tylose (23% methyl cellulose gel) which melts over a range of temperatures giving rise to a mushy zone. Within the mushy region the dielectric properties are functions of the liquid volume fraction. The resulting coupled, time dependent non-linear equations are solved using the Galerkin finite element method with a fixed mesh. Our method efficiently captures the multiple connected thawed domains that arise due to the penetration of MWs in the sample. For a cylinder of diameter D, the two length scales that control the thawing dynamics are D/D-p and D/lambda(m), where D-p and lambda(m) are the penetration depth and wavelength of radiation in the sample respectively. For D/D-p, D/lambda(m) much less than 1 power absorption is uniform and thawing occurs almost simultaneously across the sample (Regime I). For D/D-p much greater than 1 thawing is seen to occur from the incident face, since the power decays exponentially into the sample (Regime III). At intermediate values, 0.2 < D/D-p, D/lambda(m) < 2.0 (Regime II) thawing occurs from the unexposed face at smaller diameters, from both faces at intermediate diameters and from the exposed and central regions at larger diameters. Average power absorption during thawing indicates a monotonic rise in Regime I and a monotonic decrease in Regime III. Local maxima in the average power observed for samples in Regime II are due to internal resonances within the sample. Thawing time increases monotonically with sample diameter and temperature gradients in the sample generally increase from Regime I to Regime III. (C) 2002 Elsevier Science Ltd. All rights reserved.

An adaptive cascade compensator for a wide class of stable minimum or nonminimum phase plants through time moment estimation

Model Reference Adaptive Control (MRAC) of a wide repertoire of stable Linear Time Invariant (LTI) systems is addressed here. Even an upper bound on the order of the finite-dimensional system is unavailable. Further, the unknown plant is permitted to have both minimum phase and nonminimum phase zeros. Model following with reference to a completely specified reference model excited by a class of piecewise continuous bounded signals is the goal. The problem is approached by taking recourse to the time moments representation of an LTI system. The treatment here is confined to Single-Input Single-Output (SISO) systems. The adaptive controller is built upon an on-line scheme for time moment estimation of a system given no more than its input and output. As a first step, a cascade compensator is devised. The primary contribution lies in developing a unified framework to eventually address with more finesse the problem of adaptive control of a large family of plants allowed to be minimum or nonminimum phase. Thus, the scheme presented in this paper is confined to lay the basis for more refined compensators-cascade, feedback and both-initially for SISO systems and progressively for Multi-Input Multi-Output (MIMO) systems. Simulations are presented.

Optimal local polynomial regression of noisy time varying signals

We address the problem of local-polynomial modeling of smooth time-varying signals with unknown functional form, in the presence of additive noise. The problem formulation is in the time domain and the polynomial coefficients are estimated in the pointwise minimum mean square error (PMMSE) sense. The choice of the window length for local modeling introduces a bias-variance tradeoff, which we solve optimally by using the intersection-of-confidence-intervals (ICI) technique. The combination of the local polynomial model and the ICI technique gives rise to an adaptive signal model equipped with a time-varying PMMSE-optimal window length whose performance is superior to that obtained by using a fixed window length. We also evaluate the sensitivity of the ICI technique with respect to the confidence interval width. Simulation results on electrocardiogram (ECG) signals show that at 0dB signal-to-noise ratio (SNR), one can achieve about 12dB improvement in SNR. Monte-Carlo performance analysis shows that the performance is comparable to the basic wavelet techniques. For 0 dB SNR, the adaptive window technique yields about 2-3dB higher SNR than wavelet regression techniques and for SNRs greater than 12dB, the wavelet techniques yield about 2dB higher SNR.

Realizing a flexible constraint length Viterbi decoder for software radio on a de Bruijn interconnection network

Building flexible constraint length Viterbi decoders requires us to be able to realize de Bruijn networks of various sizes on the physically provided interconnection network. This paper considers the case when the physical network is itself a de Bruijn network and presents a scalable technique for realizing any n-node de Bruijn network on an N-node de Bruijn network, where n < N. The technique ensures that the length of the longest path realized on the network is minimized and that each physical connection is utilized to send only one data item, both of which are desirable in order to reduce the hardware complexity of the network and to obtain the best possible performance.