Approximations for Markovian multi-class queues with preemptive priorities

We discuss the approximation of performance measures in multi-class M/M/k queues with preemptive priorities for large problem instances (many classes and servers) using class aggregation and server reduction. We compared our approximations to exact and simulation results and found that our approach yields small-to-moderate approximation errors.     

Piecewise Deterministic Markov Control Processes with Feedback Controls and Unbounded Costs

The control of piecewise-deterministic processes is studied where only local boundedness of the data is assumed. Moreover the discount rate may be zero. The value function is shown to be solution to the Bellman equation in a weak sense; however the solution concept is strong enough to generate optimal policies. Continuity and compactness conditions are given for the existence of nonrelaxed optimal feedback controls.     

Synthesis of paramagnetic BODIPY dyes as new double (spin and fluorescence) sensors

Paramagnetic pyrroline and 1,2,3,6-tetrahydropyridine derivatives of BODIPY and their diamagnetic analogs have been synthesized and characterized as novel redox double sensor and cation sensitive reagents.     

Fischer--Tropsch, hydrotreating and superClaus catalysts

In modern society the application of catalysts, and hence, research in the field of catalysis, is becoming more and more important. In the strongly increasing chemical industry most reaction processes are performed with the aid of catalysts. Knowledge about the structure of the active sites present at the surface of catalysts will facilitate the design of new catalysts with better performances. Such knowledge can be obtained by Mössbauer spectroscopy, which is an excellent in-situ characterization technique due to the high penetrating power of the γ-radiation used and the sensitivity of the spectral parameters for the chemical state and local environment of the Mössbauer atoms.     

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.     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

Determination of platinum and biologically important trace elements in structure-activity relationship studies on platinum-containing anti-cancer drugs. Special procedures for removing32P as well as for the estimation of99 Mo and199Au

As part of an examination of the cytostatic effects of 1,2-diarylethylenediamine-platinum(II)-complexes the contents of platinum and biologically essential trace elements of tumour tissue and different organs were determined. The activation analysis procedure — separation of³²P, isolation of¹⁹⁹Au and⁹⁹Mo — is described. In the course of a pharmakokinetical experiment with tumourbearing rats (DMBA induced hormone-dependent tumours) the desired enrichment of the administered drug in the tumour tissue was found. Changes of the trace element level of tumour tissue were found for hormone-dependent MXT-mammary tumours on mice.