Results 1  10
of
578
Writing Positive/NegativeConditional Equations Conveniently
, 1994
"... Abstract: We present a convenient notation for positive/negativeconditional equations. The idea is to merge rules specifying the same function by using case, if, match, and letexpressions. Based on the presented macroruleconstruct, positive/negativeconditional equational specifications can b ..."
Abstract
 Add to MetaCart
Abstract: We present a convenient notation for positive/negativeconditional equations. The idea is to merge rules specifying the same function by using case, if, match, and letexpressions. Based on the presented macroruleconstruct, positive/negativeconditional equational specifications can
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
separated pixel values for the originally superimposed positions. By repeating this procedure for each pixel in the reduced FOV a nonaliased fullFOV image is obtained. Unfolding is possible as long as the inversions in Eq. [2] can be performed. In particular, the number of pixels to be separated, n P
Landau Equation
, 1992
"... On threephase boundary motion and the singular limit of a vectorvalued GinzburgLandau equation ..."
Abstract
 Add to MetaCart
On threephase boundary motion and the singular limit of a vectorvalued GinzburgLandau equation
Remarks to Maurice Fréchet’s article “Sur la définition axiomatique d’une classe d’espaces distanciés vectoriellement applicable sur l’espace de Hilbert”. Annals of Mathematics 36(3
, 1935
"... 1. Frechet's developments in the last section of his article suggest an elegant solution of the follo\ving problem. Let (i ¢ k; i, k = 0, 1,. ·.,n) be!n(n + 1) given positive quantities. What are the necessary and sufficient conditions that they be the lengths of.the edges of ansimplex AoAl... ..."
Abstract

Cited by 100 (0 self)
 Add to MetaCart
1. Frechet's developments in the last section of his article suggest an elegant solution of the follo\ving problem. Let (i ¢ k; i, k = 0, 1,. ·.,n) be!n(n + 1) given positive quantities. What are the necessary and sufficient conditions that they be the lengths of.the edges of ansimplex Ao
NEURON  A Program for Simulation of Nerve Equations
, 1993
"... This article describes a program, NEURON, developed in collaboration with John W. Moore, written in C, and with source code freely available to any interested person. With NEURON, nerve properties are specified, the simulation controlled, and the results graphed by writing procedural statements to a ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
parameters are conveniently represented as piecewise linear functions of position within each section. Two special classes of problems for which it is well suited are those in which it is important to calculate ionic concentrations and those where one needs to compute the extracellular potential just next
On the validity of the Boltzmann equation for short range potentials
"... ABSTRACT. We consider a classical system of point particles interacting by means of a short range potential. We prove that, in the low–density (Boltzmann–Grad) limit, the system behaves, for short times, as predicted by the associated Boltzmann equation. This is a revisitation and an extension of th ..."
Abstract
 Add to MetaCart
ABSTRACT. We consider a classical system of point particles interacting by means of a short range potential. We prove that, in the low–density (Boltzmann–Grad) limit, the system behaves, for short times, as predicted by the associated Boltzmann equation. This is a revisitation and an extension
PRIMES OF THE FORM x 2 + ny 2 AND THE GEOMETRY OF (CONVENIENT) NUMBERS
"... In a 1640 letter to Mersenne, Fermat first stated his theorem that an odd prime p can be written in the form x 2 + y 2 precisely when p ≡ 1 mod 4. During the next two decades he discovered similar statements for when a prime p could be written in the forms x 2 + 2y 2 and x 2 + 3y 2. Namely: p = x2 + ..."
Abstract
 Add to MetaCart
). For any positive integer n, it is natural to ask whether there are congruence conditions that precisely describe the set of primes p such that p = x 2 + ny 2, for some x, y ∈ Z (with a finite number of exceptions). We call n a convenient number, 1 or numerus idoneus in Latin, if there is a finite set
Results 1  10
of
578