Nonparametric Estimation of Regression Functions in Point Process Models

We prove that the empirical L ²-risk minimizing estimator over some general type of sieve classes is universally, strongly consistent for the regression function in a class of point process models of Poissonian type (random sampling processes). The universal consistency result needs weak assumptions on the underlying distributions and regression functions. It applies in particular to neural net classes and to radial basis function nets. For the estimation of the intensity functions of a Poisson process a similar technique yields consistency of the sieved maximum likelihood estimator for some general sieve classes. This revised version was published online in August 2006 with corrections to the Cover Date.     

Compactly Supported Tight Affine Frames with Integer Dilations and Maximum Vanishing Moments

When a cardinal B-spline of order greater than 1 is used as the scaling function to generate a multiresolution approximation of L ²=L ²(R) with dilation integer factor M2, the standard matrix extension approach for constructing compactly supported tight frames has the limitation that at least one of the tight frame generators does not annihilate any polynomial except the constant. The notion of vanishing moment recovery (VMR) was introduced in our earlier work (and independently by Daubechies et al.) for dilation M=2 to increase the order of vanishing moments. This present paper extends the tight frame results in the above mentioned papers from dilation M=2 to arbitrary integer M2 for any compactly supported M-dilation scaling functions. It is shown, in particular, that M compactly supported tight frame generators suffice, but not M–1 in general. A complete characterization of the M-dilation polynomial symbol is derived for the existence of M–1 such frame generators. Linear spline examples are given for M=3,4 to demonstrate our constructive approach.     

A complexity measure for families of binary sequences

In earlier papers finite pseudorandom binary sequences were studied, quantitative measures of pseudorandomness of them were introduced and studied, and large families of “good” pseudorandom sequences were constructed. In certain applications (cryptography) it is not enough to know that a family of “good” pseudorandom binary sequences is large, it is a more important property if it has a “rich”, “complex” structure. Correspondingly, the notion of “f-complexity” of a family of binary sequences is introduced. It is shown that the family of “good” pseudorandom binary sequences constructed earlier is also of high f-complexity. Finally, the cardinality of the smallest family achieving a prescibed f-complexity and multiplicity is estimated. This revised version was published online in August 2006 with corrections to the Cover Date.     

Permeability of Clustered Fiber Networks: Modeling of the Unit Cell

The paper is focused on estimating the permeability of a clustered fiber network by variational methods. First, a laminar flow in ducts is considered by using polynomial trial functions. Then, a longitudinal flow through a square array is described by expanding the flow-rate field in trigonometric and Laurent series. Finally, a formal scheme for estimating the longitudinal permeability in a cluster with an irregular distribution of fibers is given. The irregular distribution is modeled by setting an individual effective radius for each fiber and then letting this fiber reach its minimum gravitational energy. The results obtained here form a basis for future predictions of the permeability of fibrous reinforcements.     

Passive Runge–Kutta Methods—Properties, Parametric Representation, and Order Conditions

In this paper, a new class of Runge–Kutta methods is introduced. Some basic properties of this subgroup of algebraically stable methods are presented and a complete parametric representation is given. Necessary and sufficient order conditions for lower order methods as well as sufficient order conditions for higher order methods are derived yielding a significantly reduced number of conditions when compared with general Runge–Kutta methods. Design examples conclude this paper.     

Capacity Constrained Transit Assignment with Common Lines

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example. This revised version was published online in July 2006 with corrections to the Cover Date.     

Growth and melting behaviour of thin in films on Ge(100)

Growth and melting behaviour of thin indium films on Ge(100) have been investigated by Auger-electron spectroscopy (AES), atomic force microscopy (AFM) and perturbed angular correlation (PAC) spectroscopy, respectively. At room temperature inidium is found to grow in three-dimensional islands even at submonolayer coverages. A very rough film surface is observed for thicknesses up to 230 ML. The melting behaviour of such films has been studied by PAC. A reduction of the melting temperature T _m as well as a strong supercooling of the films is observed. The electric field gradient for ¹¹¹In(¹¹¹Cd) in the indium islands is determined as a function of temperature and is used to monitor the local crystalline order of the films up to temperatures just below the melting point.     

Quasiparticle and Cooper pair tenneling in small capacitance Josephson junctions

The tunneling of single electrons in small capacitance tunnel junctions is influenced by charging effects and by the fluctuations of the elecromagnetic environment. We study the effect of an external circuit with arbitrary impedance on the tunneling of quasiparticles and Cooper pairs in voltage driven Josephson junctions. We present results at finite temperatures and also consider an acdriven system.     

Presentations of the first homotopy groups of the unitary groups

We describe explicit presentations of all stable and the first nonstable homotopy groups of the unitary groups. In particular, for each n 2 we supply n homotopic maps that each represent the (n - 1)!-th power of a suitable generator of _2n SU(n) _n!. The product of these n commuting maps is the constant map to the identity matrix.