Calculating current densities and fields produced by shielded magnetic resonance imaging probes

A method is presented for computing the fields produced by radio frequency probes of the type used in magnetic resonance imaging. The effects of surrounding the probe with a shielding coil, intended to eliminate stray fields produced outside the probe, are included. An essential feature of these devices is the fact that the conducting rungs of the probe are of finite width relative to the coil radius, and it is therefore necessary to find the distribution of current within the conductors as part of the solution process. This is done here using a numerical method based on the inverse finite Hilbert transform, applied iteratively to the entire structure including its shielding coils. It is observed that the fields are influenced substantially by the width of the conducting rungs of the probe, since induced eddy currents within the rungs become more pronounced as their width is increased. The shield is also shown to have a significant effect on both the primary current density and the resultant fields. Quality factors are computed for these probes and compared with values measured experimentally.

Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.

Scale-free network of a dengue epidemic

In this work we show that the dengue epidemic in the city of Singapore organized itself into a scale-free network of transmission as the 2000-2005 outbreaks progressed. This scale-free network of cluster comprised geographical breeding places for the aedes mosquitoes, acting as super-spreaders nodes in a network of transmission. The geographical organization of the network was analysed by the corresponding distribution of weekly number of new cases. Therefore, our hypothesis is that the distribution of dengue cases reflects the geographical organization of a transmission network, which evolved towards a power law as the epidemic intensity progressed until 2005. (c) 2007 Elsevier Inc. All rights reserved.

An optimization model for antibiotic use

There is a positive correlation between the intensity of use of a given antibiotic and the prevalence of resistant strains. The more you treat, more patients infected with resistant strains appears and, as a consequence, the higher the mortality due to the infection and the longer the hospitalization time. In contrast, the less you treat, the higher the mortality rates and the longer the hospitalization time of patients infected with sensitive strains that could be successfully treated. The hypothesis proposed in this paper is an attempt to solve such a conflict: there must be an optimum treatment intensity that minimizes both the additional mortality and hospitalization time due to the infection by both sensitive and resistant bacteria strains. In order to test this hypothesis we applied a simple mathematical model that allowed us to estimate the optimum proportion of patients to be treated in order to minimize the total number of deaths and hospitalization time due to the infection in a hospital setting. (C) 2007 Elsevier Inc. All rights reserved.

Some results on holomorphic generalized functions

In this note, we present three independent results within generalized complex analysis (in the Colombeau sense). The first of them deals with non-removable singularities; we construct a generalized function u on an open subset Omega of C(n), which is not a holomorphic generalized function on Omega but it is a holomorphic generalized function on Omega\S, where S is a hypersurface contained in Omega. The second result shows the existence of a holomorphic generalized function with prescribed values in the zero-set of a classical holomorphic function. The last result states the existence of a compactly supported solution to the (partial derivative) over bar operator.

On a theorem of Cooper

In this paper we study some purely mathematical considerations that arise in a paper of Cooper on the foundations of thermodynamics that was published in this journal. Connections with mathematical utility theory are studied and some errors in Cooper's paper are rectified. (C) 2001 Academic Press.

Determining when the absolute state complexity of a Hermitian code achieves its DLP bound

Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity.

The number of rational points of a class of Artin-Schreier curves

We determine the number of F-q-rational points of a class of Artin-Schreier curves by using recent results concerning evaluations of some exponential sums. In particular, we determine infinitely many new examples of maximal and minimal plane curves in the context of the Hasse-Weil bound. (C) 2002 Elsevier Science (USA).

On the permutation behaviour of Dickson polynomials of the second kind

The known permutation behaviour of the Dickson polynomials of the second kind in characteristic 3 is expanded and simplified. (C) 2002 Elsevier Science (USA).

Fixed point theorems of upper semicontinuous multivalued mappings with applications in hyperconvex metric spaces

In the present paper, we establish two fixed point theorems for upper semicontinuous multivalued mappings in hyperconvex metric spaces and apply these to study coincidence point problems and minimax problems. (C) 2002 Elsevier Science (USA). All rights reserved.

Predictor-corrector methods of Runge-Kutta type for stochastic differential equations

In this paper we construct predictor-corrector (PC) methods based on the trivial predictor and stochastic implicit Runge-Kutta (RK) correctors for solving stochastic differential equations. Using the colored rooted tree theory and stochastic B-series, the order condition theorem is derived for constructing stochastic RK methods based on PC implementations. We also present detailed order conditions of the PC methods using stochastic implicit RK correctors with strong global order 1.0 and 1.5. A two-stage implicit RK method with strong global order 1.0 and a four-stage implicit RK method with strong global order 1.5 used as the correctors are constructed in this paper. The mean-square stability properties and numerical results of the PC methods based on these two implicit RK correctors are reported.

A variable stepsize implementation for stochastic differential equations

Stochastic differential equations (SDEs) arise from physical systems where the parameters describing the system can only be estimated or are subject to noise. Much work has been done recently on developing higher order Runge-Kutta methods for solving SDEs numerically. Fixed stepsize implementations of numerical methods have limitations when, for example, the SDE being solved is stiff as this forces the stepsize to be very small. This paper presents a completely general variable stepsize implementation of an embedded Runge Kutta pair for solving SDEs numerically; in this implementation, there is no restriction on the value used for the stepsize, and it is demonstrated that the integration remains on the correct Brownian path.

Existence of multiple solutions for finite difference approximations to second-order boundary value problems

Error condition detected We consider discrete two-point boundary value problems of the form D-2 y(k+1) = f (kh, y(k), D y(k)), for k = 1,...,n - 1, (0,0) = G((y(0),y(n));(Dy-1,Dy-n)), where Dy-k = (y(k) - Yk-I)/h and h = 1/n. This arises as a finite difference approximation to y" = f(x,y,y'), x is an element of [0,1], (0,0) = G((y(0),y(1));(y'(0),y'(1))). We assume that f and G = (g(0), g(1)) are continuous and fully nonlinear, that there exist pairs of strict lower and strict upper solutions for the continuous problem, and that f and G satisfy additional assumptions that are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. Under these assumptions we show that there are at least three distinct solutions of the discrete approximation which approximate solutions to the continuous problem as the grid size, h, goes to 0. (C) 2003 Elsevier Science Ltd. All rights reserved.

Contrasts in the basins of attraction of structurally identical iterative root finding methods

A numerical comparison is performed between three methods of third order with the same structure, namely BSC, Halley’s and Euler–Chebyshev’s methods. As the behavior of an iterative method applied to a nonlinear equation can be highly sensitive to the starting points, the numerical comparison is carried out, allowing for complex starting points and for complex roots, on the basins of attraction in the complex plane. Several examples of algebraic and transcendental equations are presented.