A Generalized Markov Sampler

A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis–Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis.     

Analysis of a Multiserver Queue with Setup Times

This paper deals with the analysis of an M/M/c queueing system with setup times. This queueing model captures the major characteristics of phenomena occurring in production when the system consists in a set of machines monitored by a single operator. We carry out an extensive analysis of the system including limiting distribution of the system state, waiting time analysis, busy period and maximum queue length. AMS subject classification: 90B22, 60K25     

The solution of the neutron transport equation in a slab with anisotropic scattering

The neutron transport equation for a slab geometry with the extremely anisotropic scattering kernel is considered. The albedo and transmission factors are calculated using the variation method. The effect of the extremely anisotropic parameter on the variation of the slab albedo and transmission factor is calculated. The obtained results are compared with the published data.     

Time-Reversed Dynamical Entropy and Irreversibility in Markovian Random Processes

A concept of time-reversed entropy per unit time is introduced in analogy with the entropy per unit time by Shannon, Kolmogorov, and Sinai. This time-reversed entropy per unit time characterizes the dynamical randomness of a stochastic process backward in time, while the standard entropy per unit time characterizes the dynamical randomness forward in time. The difference between the time-reversed and standard entropies per unit time is shown to give the entropy production of Markovian processes in nonequilibrium steady states.     

Using the new in–in method for the synthesis of polyisoprene/polystyrene heteroarm star polymers

The basis of the two‐step in–in method is as follows: star polymers with poly(divinyl benzene) cores, synthesized by the arm‐first method, include many unreacted double bonds in their core, and these double bonds can be attacked by the carbanions of some monomers such as styrene and dienes. In this work, linear polyisoprene chains were used to attack the double bonds existing in the poly(divinyl benzene) cores of polystyrene star polymers, so that a heteroarm star polymer with polystyrene and polyisoprene arms was synthesized. It was later well characterized with size exclusion chromatography, light scattering, viscometry, UV spectroscopy, dynamic mechanical thermal analysis, and ¹H NMR. © 2002 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 135–142, 2003     

USING FINITE GEOMETRIES TO CONSTRUCT 3-PBIB(2) DESIGNS AND 3-DESIGNS

ＵＳＩＮＧＦＩＮＩＴＥＧＥＯＭＥＴＲＩＥＳＴＯＣＯＮＳＴＲＵＣＴ３－ＰＢＩＢ（２）ＤＥＳＩＧＮＳＡＮＤ３－ＤＥＳＩＧＮＳ￥ＹＡＮＧＢＥＮＦＵ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＣｈｅｎｇｄｕＴｅａｃｈｅｒｓＣｏｌｌｅｇｅ，Ｃｈｅｎｇｄｕ...     

Hopf Modules and Noncommutative Differential Geometry

We define a new algebra of noncommutative differential forms for any Hopf algebra with an invertible antipode. We prove that there is a one-to-one correspondence between anti-Yetter–Drinfeld modules, which serve as coefficients for the Hopf cyclic (co)homology, and modules which admit a flat connection with respect to our differential calculus. Thus, we show that these coefficient modules can be regarded as “flat bundles” in the sense of Connes’ noncommutative differential geometry.     

Constructing two-weight codes with prescribed groups of automorphisms

We construct new linear two-weight codes over the finite field with q elements. To do so we solve the equivalent problem of finding point sets in the projective geometry with certain intersection properties. These point sets are in bijection to solutions of a Diophantine linear system of equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetries.Two-weight codes can be used to define strongly regular graphs. We give tables of the two-weight codes and the corresponding strongly regular graphs. In some cases we find new distance-optimal two-weight codes and also new strongly regular graphs.     

Single-server queues with spatially distributed arrivals

Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The service times are independent, but arbitrarily distributed. The model generalizes the continuous cyclic polling system (the diffusion coefficient of the Brownian motion is zero in this case) and can be interpreted as a continuous version of a Markov polling system. Using Tweedie's lemma for positive recurrence of Markov chains with general state space, we show that the system is stable if and only if the traffic intensity is less than one. Moreover, we derive a stochastic decomposition result which leads to equilibrium equations for the stationary configuration of customers on the circle. Steady-state performance characteristics are determined, in particular the expected number of customers in the system as seen by a travelling server and at an arbitrary point in time.