The Electromagnetic Field around a Subsurface Flaw in a Metal

This work is a theoretical investigation into the detectionand measurement in metals of flaws that do not break the surface,with the use of AC electric fields. The flaw is modelled bya semi-infinite slot, which is perpendicular to the surfaceand whose top edge is at a finite distance below the surface.The electromagnetic field is governed by Maxwell's equationsand the skin depth of the field is assumed to be large comparedto the ligament remaining between the top edge of the crackand the metal surface. Matched asymptotic expansions are usedto describe the field mathematically and numerical results arepresented, illustrating the variation of the potential differenceon the surface of a number of metals with different-size ligamentsin them. Good agreement is obtained from comparisons with someresults using a Fourier-series technique. It is found that themaximum centreline voltage signal is obtained if measurementsof the potential difference are made at a phase of approximately– compared to the upstream signal.     

Filtering,Smoothing and M-ary Detection with Discrete Time Poisson Observations

Abstract

In this article, we solve a class of estimation problems, namely, filtering smoothing and detection for a discrete time dynamical system with integer-valued observations. The observation processes we consider are Poisson random variables observed at discrete times. Here, the distribution parameter for each Poisson observation is determined by the state of a Markov chain. By appealing to a duality between forward (in time) filter and its corresponding backward processes, we compute dynamics satisfied by the unnormalized form of the smoother probability. These dynamics can be applied to construct algorithms typically referred to as fixed point smoothers, fixed lag smoothers, and fixed interval smoothers. M-ary detection filters are computed for two scenarios: one for the standard model parameter detection problem and the other for a jump Markov system.     

Detection of Singularities by Discrete Multiscale Directional Representations

One of the most remarkable properties of the continuous curvelet and shearlet transforms is their sensitivity to the directional regularity of functions and distributions. As a consequence of this property, these transforms can be used to characterize the geometry of edge singularities of functions and distributions by their asymptotic decay at fine scales. This ability is a major extension of the conventional continuous wavelet transform which can only describe pointwise regularity properties. However, while in the case of wavelets it is relatively easy to relate the asymptotic properties of the continuous transform to properties of discrete wavelet coefficients, this problem is surprisingly challenging in the case of discrete curvelets and shearlets where one wants to handle also the geometry of the singularity. No result for the discrete case was known so far. In this paper, we derive non-asymptotic estimates showing that discrete shearlet coefficients can detect, in a precise sense, the location and orientation of curvilinear edges. We discuss connections and implications of this result to sparse approximations and other applications.     

Bubbles with prescribed mean curvature: The variational approach

Let H:R³→R be a C¹ mapping such that H(p)→H_∞>0 as ∣p∣→∞. We show that when H satisfies some global conditions then there exists an H-bubble, namely a sphere S in R³ such that the mean curvature of S at any regular point p∈S equals H(p).     

Numerical Modeling of Laser-Induced Cavitation Bubbles with a Finite Volume Method

We report on the numerical modeling of laser-induced cavitation bubbles with the finite volume method using the open source software package OpenFOAM. The numerical model is validated by comparison to experimental data for the two cases of a bubble collapsing under normal ambient conditions in an unbounded liquid as well as close to a solid wall. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Filtering with Discrete State Observations

The problem of estimating a finite state Markov chain observed via a process on the same state space is discussed. Optimal solutions are given for both the ``weak' and ``strong' formulations of the problem. The ``weak' formulation proceeds using a reference probability and a measure change for the Markov chain. The ``strong' formulation considers an observation process related to perturbations of the counting processes associated with the Markov chain. In this case the ``small noise' convergence is investigated. Accepted 7 April 1998     

Discrete fragmentation with mass loss

We examine an infinite system of ordinary differential equations that models a discrete fragmentation process in which mass loss can occur. The problem is treated as an abstract Cauchy problem, posed in an appropriate Banach space. Perturbation techniques from the theory of semigroups of operators are used to establish the existence and uniqueness of physically meaningful solutions under minimal restrictions on the fragmentation rates. In one particular case, an explicit formula for the associated semigroup is obtained and this enables additional properties, such as compactness of the resolvent and analyticity of the semigroup, to be deduced. Another explicit solution of this particular fragmentation problem, in which mass is apparently created from a zero-mass initial state, is also investigated, and the theory of Sobolev towers is used to prove that the solution actually emanates from an initial infinite cluster of unit mass.     

Riemannian Submersions with Discrete Spectrum

We prove some estimates on the spectrum of the Laplacian of the total space of a Riemannian submersion in terms of the spectrum of the Laplacian of the base and the geometry of the fibers. When the fibers of the submersions are compact and minimal, we prove that the spectrum of the Laplacian of the total space is discrete if and only if the spectrum of the Laplacian of the base is discrete. When the fibers are not minimal, we prove a discreteness criterion for the total space in terms of the relative growth of the mean curvature of the fibers and the mean curvature of the geodesic spheres in the base. We discuss in particular the case of warped products.     

Using Wavelets for the Detection of Discrete Events in Time Series of Hybrid Systems

This contribution deals with the use of wavelets for the analysis of time series of systems which are hybrid in the sense that they contain discrete and continuous dynamics. We focus on the detection of discrete events which is an important step in the identification of hybrid systems. A brief overview of the characteristics of the wavelet transform is given, which shows that the wavelet transform is an appropriate method for the analysis of time series of hybrid systems. By the combination of two wavelet-based analysis techniques, a two-step procedure is obtained which allows the detection of switching points in the presence of weak noise. In this context, emphasis is given to the problems which arise when the theoretical results are used to detect discrete events in real time series. The procedure is demonstrated for a time series obtained from the simulation of a nonlinear laboratory plant.     

网络股泡沫大小测度研究

网络股泡沫是最能反映网络泡沫本质的表现形式，本文利用理性预期理论，构建了网络股泡沫大小的测度模型，说明网络股泡沫的存在，在此基础上确定了网络股泡沫大小的测度指标，并以雅虎公司股票为例对泡沫的大小进行了测度，结果符合网络泡沫的实际情况。     

Controllability of Nonlinear Discrete Systems with Degeneracy

This paper concerns the controllability of autonomous and nonautonomous nonlinear discrete systems, in which linear parts might admit certain degeneracy. By introducing Fredholm operators and coincidence degree theory, sufficient conditions for nonlinear discrete systems to be controllable are presented. In addition,applications are given to illustrate main results.     

Numerical Simulation of Bubbles in Shear Flow

To gain a basic understanding of foam flow, as it can be found e.g. in transport of aerated food, simulation tools can help to provide better insight. Shearing of the bubbles appears in different flow geometries and is for a bubble assembly not captured analytically. Also experimentally, those flow fields are hard to observe so that simulations are the method of choice. Our method to simulate foams uses a volume of fluid approach that is based on the free surface algorithm by Körner et al. [1]. Different from classical multiphase methods, only the liquid phase is simulated and special boundary conditions at the liquid-gas interface account for the gas phase. With this approach high density ratios, e.g. in water-air systems, are easier to realize than in other methods. High density ratios are even necessary to physically justify the model, where the dynamics of the lighter phase are partially neglected. This method is integrated in the Lattice Boltzmann software framework waLBerla [3] (widely applicable Lattice Boltzmann solver from Erlangen†) that can be used on massively parallel computers and thus allows to simulate even large bubble assemblies. As first validation, single bubbles are sheared with different capillary numbers and the simulation results are compared to literature [2] and show good agreement. The next step is shearing a bubble assembly which is arranged like a dense sphere packing. In order to investigate the geometrical configuration of the assembly and its impact on the behavior during a shear deformation, the bubble assembly is rotated with different angles with respect to the shear direction. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Chaotic Attractors with Discrete Planar Symmetries

Chaotic behavior is known to be compatible with symmetry and illustrations are constructed using functions equivariant with respect to the desired symmetries. Earlier investigations determined families of equivariant functions for a few of the discrete symmetry groups in the plane; those results are extended to all the discrete symmetry groups of the plane. This includes consideration of the all the frieze and two-dimensional crystallographic groups. © 1998 Elsevier Science Ltd. All rights reserved.     

Discrete time queues with delayed information

We study the behavior of a single-server discrete-time queue with batch arrivals, where the information on the queue length and possibly on service completions is delayed. Such a model describes situations arising in high speed telecommunication systems, where information arrives in messages, each comprising a variable number of fixed-length packets, and it takes one unit of time (a slot) to transmit a packet. Since it is not desirable to attempt service when the system may be empty, we study a model where we assume that service is attempted only if, given the information available to the server, it is certain that there are messages in the queue. We characterize the probability distribution of the number of messages in the queue under some general stationarity assumptions on the arrival process, when information on the queue size is delayedK slots, and derive explicit expressions of the PGF of the queue length for the case of i.i.d. batch arrivals and general independent service times. We further derive the PGF of the queue size when information onboth the queue length and service completion is delayedK=1 units of time. Finally, we extend the results to priority queues and show that when all messages are of unit length, thec rule remains optimal even in the case of delayed information.     

Discrete optimization problems with interval parameters

Optimization problems on graphs with interval parameters are considered, and exponential and polynomial bounds for their computational complexity are obtained. For a certain subclass of polynomially solvable problems, two algorithms are proposed—one of them for finding an optimal solution and the other one for finding a suboptimal solution. Sufficient conditions for the statistical efficiency of the algorithm for finding a suboptimal solution are obtained.