A mixed directed-undirected data structure for a parallel implementation of a domain decomposition algorithm

The choice of data structures influences the parallelization, efficiency and the manageability of a mesh refinement program. We introduce a mixed directed-undirected graph that combines both communication and scheduling needs. An inverted index is maintained for the directed graph to improve code performance and readability.This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under contract No. W-7405-Eng-48.     

Evolution of the high power THz source program at Jefferson Lab

We report the evolution of the high power THz source program at Jefferson Lab. The source is based on coherent synchrotron radiation in which short bunches of relativistic electrons radiate when traversing a dipolar magnetic field. In our first accelerator we produced 20 W of broadband THz light. Our upgraded accelerator with higher current and improved THz extraction optics will considerably enhance the output power to >100 W. In this paper we describe the source in some detail and present theoretical calculations for the upgrade.     

Stationary Distributions of GI/M/c Queue with PH Type Vacations

We study a GI/M/c type queueing system with vacations in which all servers take vacations together when the system becomes empty. These servers keep taking synchronous vacations until they find waiting customers in the system at a vacation completion instant.The vacation time is a phase-type (PH) distributed random variable. Using embedded Markov chain modeling and the matrix geometric solution methods, we obtain explicit expressions for the stationary probability distributions of the queue length at arrivals and the waiting time. To compare the vacation model with the classical GI/M/c queue without vacations, we prove conditional stochastic decomposition properties for the queue length and the waiting time when all servers are busy. Our model is a generalization of several previous studies.     

Dispersion modeling by kinematic simulation: Cloud dispersion model

A new technique has been developed to compute mean and fluctuating concentrations in complex turbulent flows (tidal current near a coast and deep ocean). An initial distribution of material is discretized into any small clouds which are advected by a combination of the mean flow and large scale turbulence. The turbulence can be simulated either by kinematic simulation (KS) or direct numerical simulation. The clouds also diffuse relative to their centroids; the statistics for this are obtained from a separate calculation of the growth of individual clouds in small scale turbulence, generated by KS. The ensemble of discrete clouds is periodically re-discretized, to limit the size of the small clouds and prevent overlapping. The model is illustrated with simulations of dispersion in uniform flow, and the results are compared with analytic, steady state solutions. The aim of this study is to understand how pollutants disperses in a turbulent flow through a numerical simulation of fluid particle motion in a random flow field generated by Fourier modes. Although this homogeneous turbulent is rather a “simple” flow, it represents a building block toward understanding pollutant dispersion in more complex flow. The results presented here are preliminary in nature, but we expect that similar qualitative results should be observed in a genuine turbulent flow.     

Note on varying speed of light cosmologies

The various requirements on a consistent varying speed of light (‘VSL’) theory are surveyed, giving a short check-list that needs to be satisfied by such theories.     

Flat rank of automorphism groups of buildings

The flat rank of a totally disconnected locally compact group G, denoted flat-rk(G), is an invariant of the topological group structure of G. It is defined thanks to a natural distance on the space of compact open subgroups of G. For a topological Kac-Moody group G with Weyl group W, we derive the inequalities alg-rk(W) ≤ flat-rk(G) ≤ rk(|W|₀). Here, alg-rk(W) is the maximal Z-rank of abelian subgroups of W, and rk(|W|₀) is the maximal dimension of isometrically embedded flats in the CAT0-realization |W|₀. We can prove these inequalities under weaker assumptions. We also show that for any integer n ≥ 1 there is a simple, compactly generated, locally compact, totally disconnected group G, with flat-rk(G) = n and which is not linear.