Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.     

Maximum-entropy data analysis

The reconstruction of physical quantities from (computer-) experimental data is very often hampered by the presence of noise, insufficient information and above all by the ill-posed nature of the underlying inversion problem. It will be demonstrated that the maximum entropy concepts is particularly suited for this type of data-analysis problems. It is based on Bayesian statistics and provides a consistent probabilistic theory to obtain unbiased results, independent of any model assumptions. This is particularly desirable if there is no additional information to justify these hypotheses. If, on the other hand, additional prior knowledge is available, it can be effectively incorporated into the computation, leading to more stringent confidence intervals.     

Shape transition from InAs quantum dash to quantum dot on InP(3 1 1)A

We report on the shape transition from InAs quantum dashes to quantum dots (QDs) on lattice-matched GaInAsP on InP(3 1 1)A substrates. InAs quantum dashes develop during chemical-beam epitaxy of 3.2 monolayers InAs, which transform into round InAs QDs by introducing a growth interruption without arsenic flux after InAs deposition. The shape transition is solely attributed to surface properties, i.e., increase of the surface energy and symmetry under arsenic deficient conditions. The round QD shape is maintained during subsequent GaInAsP overgrowth because the reversed shape transition from dot to dash is kinetically hindered by the decreased ad-atom diffusion under arsenic flux.     

A Tin(IV) Porphyrin with Two Axial Organometallic NCN‐Pincer Platinum Units

A tin(IV) porphyrin was combined with two axial NCN‐pincer platinum(II) fragments by utilizing the oxophilicity of the apical positions on the tin atom and the acidic nature of the NCN‐pincer platinum derived benzoic acid. The solid‐state structure determined by X‐ray crystallography revealed some close contacts between the pincer complexes and the meso‐p‐tolyl subsitutents of the porphyrin. It was shown by ¹H NMR spectroscopy that these close contacts were not present in solution and that this compound can potentially act as a novel building block for supramolecular architectures.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

Writhing instabilities of twisted rods: from infinite to finite length

We use three different approaches to describe the static spatial configurations of a twisted rod as well as its stability during rigid loading experiments. The first approach considers the rod as infinite in length and predicts an instability causing a jump to self-contact at a certain point of the experiment. Semi-finite corrections, taken into account as a second approach, reveal some possible experiments in which the configuration of a very long rod will be stable through out. Finally, in a third approach, we consider a rod of real finite length and we show that another type of instability may occur, leading to possible hysteresis behavior. As we go from infinite to finite length, we compare the different information given by the three approaches on the possible equilibrium configurations of the rod and their stability. These finite size effects studied here in a 1D elasticity problem could help us guess what are the stability features of other more complicated (2D elastic shells for example) problems for which only the infinite length approach is understood.     

Isotone relations revisited

We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem.     

Stark's conjecture over complex cubic number fields

Systematic computation of Stark units over nontotally real base fields is carried out for the first time. Since the information provided by Stark's conjecture is significantly less in this situation than the information provided over totally real base fields, new techniques are required. Precomputing Stark units in relative quadratic extensions (where the conjecture is already known to hold) and coupling this information with the Fincke-Pohst algorithm applied to certain quadratic forms leads to a significant reduction in search time for finding Stark units in larger extensions (where the conjecture is still unproven). Stark's conjecture is verified in each case for these Stark units in larger extensions and explicit generating polynomials for abelian extensions over complex cubic base fields, including Hilbert class fields, are obtained from the minimal polynomials of these new Stark units.