Discrete-time stimulation of the oscillatory and excitable forms of a FitzHugh-Nagumo model applied to the pulsatile release of luteinizing hormone releasing hormone

A model for the pulsatile release of luteinizing hormone releasing hormone (LHRH) can be reduced to a FitzHugh-Nagumo model subject to regular and quasiregular (i.e., with slight random variation in the interstimulus interval), discrete-time stimulation. The relationship of output pulse frequency (OPF) to stimulus frequency is compared between the excitable and oscillatory forms of the model and discussed in the context of results from other pulse-driven model systems. Some examples of the changes in OPF caused by quasiregular and purely Poissonian stimuli are given for the excitable case. The unstimulated system frequently interacts with the stimulation in such a complex manner that the OPF bears little resemblance to the frequency of stimulation or of the unstimulated system. Furthermore, the inability of the oscillatory form of the model to allow complete suppression of output pulses for moderate stimulation frequencies suggests that the LHRH system can be more appropriately described by the excitable form of the model. (c) 1995 American Institute of Physics.     

Non-compact quantum groups associated with Abelian subgroups

LetG be a Lie group. For any Abelian subalgebra of the Lie algebra g ofG, and any , the difference of the left and right translates ofr gives a compatible Poisson bracket onG. We show how to construct the corresponding quantum group, in theC ^*-algebra setting. The main tool used is the general deformation quantization construction developed earlier by the author for actions of vector groups onC ^*-algebras.The research reported on here was supported in part by National Science Foundation grant DMS-9303386.     

Partial order complementation graphs

Two partial ordersP andQ on a setX arecomplementary (written asPQ) if they share no ordered pairs (except for loops) but the transitive closure of the union is all possible ordered pairs. For each positive integern we form a graph Pos _n consisting of all nonempty partial orders on {1, ,n} with edges denoting complementation. We investigate here properties of the graphs Pos _n . In particular, we show:

Massively time-parallel,approximate simulation of loss queueing systems

A time-parallel simulation obtains parallelism by partitioning the time domain of the simulation. An approximate time-parallel simulation algorithm named GG1K is developed for acyclic networks of loss FCFSG/G/1/K queues. The GG1K algorithm requires two phases. In the first phase, a similar system (i.e. aG/G/1/ queue) is simulated using the GLM algorithm. Then the resultant trajectory is transformed into an approximateG/G/1/K trajectory in the second phase. The closeness of the approximation is investigated theoretically and experimentally. Our results show that the approximation is highly accurate except whenK is very small (e.g. 5) in certain models. The algorithm exploits unbounded parallelism and can achieve near-linear speedup when the number of arrivals simulated is sufficiently large.