Wavelet Collocation Methods for a First Kind Boundary Integral Equation in Acoustic Scattering

In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively.     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.     

A dual graph-norm refinement indicator for finite volume approximations of the Euler equations

Summary. We generalise and apply a refinement indicator of the type originally designed by Mackenzie, Süli and Warnecke in [15] and [16] for linear Friedrichs systems to the Euler equations of inviscid, compressible fluid flow. The Euler equations are symmetrized by means of entropy variables and locally linearized about a constant state to obtain a symmetric hyperbolic system to which an a posteriori error analysis of the type introduced in [15] can be applied. We discuss the details of the implementation of the refinement indicator into the DLR--Code which is based on a finite volume method of box type on an unstructured grid and present numerical results. Received May 15, 1995 / Revised version received April 17, 1996     

Aziridinylketones and their cyclic anils. 12

We have measured the PMR spectra of 5, 7-diaryl-1, 4-diazabicyclo[4. ].O]hept-4-enes. We have studied the structure of the 5-(4-nitrophenyl)-7-phenyl derivative by x-ray diffraction. We show that the six-membered heterocycle has the half-chair form. The 6-H and 7-H protons of the aziridine ring are trans, while the 7-aryl is exo relative to the six-membered ring. Introduction of substituents into the aromatic ring has practically no effect on the geometry of the bicycle.Translated from Khimiya Geterotsiklicheskikh Soedinenii, No. 8, pp. 1117–1124, August, 1994.For Communication 11, see [1].     

Methylphosphonothionates of N-(β-hydroxypropyl)anabasine — Synthesis,structure, and sensitivity of cholinesterases to them

The synthesis has been effected of alkyl anabasinoprop-2-yl and alkyl piperidinoprop-2-yl methylphosphonothionates. It has been shown by¹H,¹³C and³¹P NMR spectroscopies that the anabasine derivatives exist in solution as four diastereomeric forms. The kinetics of the interaction of the compounds synthesized with two types of cholinesterases has been studied.A. S. Sadykov Institute of Bioorganic Chemistry, Academy of Sciences of the Republic of Uzbekistan, Tashkent, Fax 627071. Translated from Khimiya Prirodnykh Soedinenii, No. 1, pp. 70–74, January–February, 1994.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

Study of the charge-exchange reactions\pi ^ - p \to (\pi ^0 ,\eta ,\eta \prime )n at 63 GeV

Muon electron pairs were detected in an Al multiplate spark chamber, exposed to a neutrino beam from the CERN PS. The leptons were not accompanied by other particles, except occasionally by protons. The background came mainly from muon associated π⁰ production, with one decay gamma lost. It was determined empirically, together with the small contribution from υ _e reactions. For electron energies above 2 GeV the background is 5.7±1.5 events, whereas 18 (μe)-candidates have been observed. Hence the effect is established, with a rate of about 10^?4 as compared to the muonic reactions above 3 GeV. Charm creation as the origin of this (μe)-production process is excluded; heavy neutral lepton production does not fit the kinematics observed. Instead the events are compatible with the two-body decay of an object with variable invariant mass of order 1 GeV, possibly resulting from axion interactions.     

Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.