We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
A method is developed for estimating the response time distribution of an unobserved component in a two-component serial model, assuming the components are stochastically independent. The estimate of the component’s density function is constrained only to be unimodal and non-negative. Numerical examples suggest that the method can yield reasonably accurate estimates with sample sizes of 300 and, in some cases, with sample sizes as small as 100.
In loving memory of my beloved miniature dachshund Maddie (16 March 2002 – 16 March 2020). We consider nonlocal differential equations with convolution coefficients of the form
in the case in which $g$ can satisfy very generalized growth conditions; in addition, $M$ is allowed to be both sign-changing and vanishing. Existence of at least one positive solution to this equation equipped with boundary data is considered. We demonstrate that the nonlocal coefficient $M$ allows the forcing term $f$ to be free of almost all assumptions other than continuity.
Covers differentiation and integration, higher derivatives, partial derivatives, series expansion, integral transforms, convolution integrals, Laplace transforms, linear and time-invariant systems, linear ordinary differential equations, periodic functions, Fourier series and transforms, and matrix algebra.
This chapter examines discrete-time LTI systems in detail. It shows that the input–output behavior of an LTI system is characterized by the so-called impulse response. The output is shown to be the so-called convolution of the input with the impulse response. It is then shown that exponentials are eigenfunctions of LTI systems. This property leads to the ideas of transfer functions and frequency responses for LTI systems. It is argued that the frequency response gives a systematic meaning to the term “filtering.” Image filtering is demonstrated with examples. The discrete-time Fourier transform (DTFT) is introduced to describe the frequency domain behavior of LTI systems, and allows one to represent a signal as a superposition of single-frequency signals (the Fourier representation). DTFT is discussed in detail, with many examples. The z-transform, which is of great importance in the study of LTI systems, is also introduced and its connection to the Fourier transform explained. Attention is also given to real signals and real filters, because of their additional properties in the frequency domain. Homogeneous time-invariant (HTI) systems are also introduced. Continuous-time counterparts of these topics are explained. B-splines, which arise as examples in continuous-time convolution, are presented.
In this chapter all the basic notation and concepts are introduced.The notions of nilpotent, solvable, free, linear, finitely generated, and finitely presented groups are defined and examples are provided.Spaces of bounded and Lipschitz harmonic functions are defined, as well as harmonic functions of polynomial growths. Group actions are discussed and convolutions over abstract groups are defined.
Based on Chapter 6, in this chapter we expand the discussion of neural networks to include networks that have more than one hidden layer. Common structures such as the convolutional neural network (CNN) or the Long Short-Term Memory network (LSTM) are explained and used along with Matlab’s Deep Network Designer App as well as Matlab script to implement and train such networks. Issues such as the vanishing or exploding gradient, normalization, and training strategies are discussed. Concepts that address overfitting and the vanishing or exploding gradient are introduced, including dropout and regularization. Transfer learning is discussed and showcased using Matlab’s DND App.
The purpose of this chapter is twofold. We will first discuss basic aspect of signals and linear systems in the first part. As we will see in subsequent chapters that diffraction as well as optical imaging systems can be modelled as linear systems. In the second part, we introduce the basic properties of Fourier series, Fourier transform as well as the concept of convolution and correlation. Indeed, many modern optical imaging and processing systems can be modelled with the Fourier methods, and Fourier analysis is the main tool to analyze such optical systems. We shall study time signals in one dimension and signals in two dimensions will then be covered. Many of the concepts developed for one-dimensional (1-D) signals and systems apply to two-dimensional (2-D) systems. This chapter also serves to provide important and basic mathematical tools to be used in subsequent chapters.
For a fixed integer h, the standard orthogonality relations for Ramanujan sums $c_r(n)$ give an asymptotic formula for the shifted convolution $\sum _{n\le N} c_q(n)c_r(n+h)$. We prove a generalised formula for affine convolutions $\sum _{n\le N} c_q(n)c_r(kn+h)$. This allows us to study affine convolutions $\sum _{n\le N} f(n)g(kn+h)$ of arithmetical functions $f,g$ admitting a suitable Ramanujan–Fourier expansion. As an application, we give a heuristic justification of the Hardy–Littlewood conjectural asymptotic formula for counting Sophie Germain primes.
The objective of this chapter is to demonstrate the linkage between convolution and filtering and to discuss preliminary filtering with examples. The simplest low-pass filtering that allows low frequency to pass to the output is a “moving average,” which is essentially through a computation involving a rectangular window function (in this case, it is a filter), with a length determined by the cutoff frequency. The filtering action is accomplished by a convolution between the filter and the time series. However, moving average has its drawbacks because of the rectangular window effect or the side lobe effect. It is considered as a “poor man’s filter” because of the lack of sophistication in getting rid of the leakage from side lobes. One improvement over the moving average is using a non-rectangular window function in the convolution to reduce the sharp change at the edges. The basic ideas and examples presented here are useful in demonstrating how to do filtering with several MATLAB functions. When a low-pass filter is designed, a high-pass filter can be defined. With two or more low-pass filters, one can also design band-pass and band-stop filters. There are also other filters that can have various controls on the results.
Exact and approximate mathematical models for the effects of sample transparency on the powder diffraction intensity data are examined. Application of the formula based on the first-order approximation about the deviation angle is justified for realistic measurement and computing systems. The effects of sample transparency are expressed by double convolution formulas applying two different scale transforms, including three parameters, goniometer radius R, penetration depth μ−1, and thickness of the sample t. The deconvolutional treatment automatically recovers the lost intensity and corrects the peak shift and asymmetric deformation of peak profile caused by the sample transparency.
An iterated perturbed random walk is a sequence of point processes defined by the birth times of individuals in subsequent generations of a general branching process provided that the birth times of the first generation individuals are given by a perturbed random walk. We prove counterparts of the classical renewal-theoretic results (the elementary renewal theorem, Blackwell’s theorem, and the key renewal theorem) for the number of jth-generation individuals with birth times
$\leq t$
, when
$j,t\to\infty$
and
$j(t)={\textrm{o}}\big(t^{2/3}\big)$
. According to our terminology, such generations form a subset of the set of intermediate generations.
The aim of this paper is to present some results about the space $L^{\varPhi }(\nu ),$ where $\nu$ is a vector measure on a compact (not necessarily abelian) group and $\varPhi$ is a Young function. We show that under natural conditions, the space $L^{\varPhi }(\nu )$ becomes an $L^{1}(G)$-module with respect to the usual convolution of functions. We also define one more convolution structure on $L^{\varPhi }(\nu ).$
By developing a Green's function representation for the solution of the boundary value problem we study existence, uniqueness, and qualitative properties (e.g., positivity or monotonicity) of solutions to these problems. We apply our methods to fractional order differential equations. We also demonstrate an application of our methodology both to convolution equations with nonlocal boundary conditions as well as those with a nonlocal term in the convolution equation itself.
The study of the distributions of sums of dependent risks is a key topic in actuarial sciences, risk management, reliability and in many branches of applied and theoretical probability. However, there are few results where the distribution of the sum of dependent random variables is available in a closed form. In this paper, we obtain several analytical expressions for the distribution of the aggregated risks under dependence in terms of copulas. We provide several representations based on the underlying copula and the marginal distribution functions under general hypotheses and in any dimension. Then, we study stochastic comparisons between sums of dependent risks. Finally, we illustrate our theoretical results by studying some specific models obtained from Clayton, Ali-Mikhail-Haq and Farlie-Gumbel-Morgenstern copulas. Extensions to more general copulas are also included. Bounds and the limiting behavior of the hazard rate function for the aggregated distribution of some copulas are studied as well.
We cannot miss deep learning in a modern pattern recognition textbook, and we introduce CNN (convolutional neural networks) in this chapter. Although the mathematical derivation of CNN, especially the back-propagation process and gradient computation, is complex, we use a lot of useful tools to help readers understand what exactlyis going on in a CNN. Hence, this chapter focuses on accessibility rather than completeness. In its exercise problems, we introduce more relevant topics and methods.
For independent exponentially distributed random variables
$X_i$
,
$i\in {\mathcal{N}}$
, with distinct rates
${\lambda}_i$
we consider sums
$\sum_{i\in\mathcal{A}} X_i$
for
$\mathcal{A}\subseteq {\mathcal{N}}$
which follow generalized exponential mixture distributions. We provide novel explicit results on the conditional distribution of the total sum
$\sum_{i\in {\mathcal{N}}}X_i$
given that a subset sum
$\sum_{j\in \mathcal{A}}X_j$
exceeds a certain threshold value
$t>0$
, and vice versa. Moreover, we investigate the characteristic tail behavior of these conditional distributions for
$t\to\infty$
. Finally, we illustrate how our probabilistic results can be applied in practice by providing examples from both reliability theory and risk management.
A deconvolutional method for preprocessing powder diffraction data has been improved. The cumulants of instrumental aberration functions of Bragg-Brentano (Parrish) diffractometer calculated up to the fourth order are presented. The treatments of axial-divergence aberration and the effective spectroscopic profile of the source X-ray have been simplified from those used in previous methods. The current method has been applied to powder diffraction data collected with a Cu-target X-ray tube, used over 20 years, and a Ni-foil Kβ filter.
Chapter 2 starts by analysing free and forced oscillations in a simple mechanical system, and the method of complex representation of sinusoidal oscillation is introduced, including phasor diagram in the complex plane. Moreover, the concepts of active and reactive power for such a system are introduced. Then the method of state-space analysis is introduced and applied to a linear system. Further, the delta 'function' and other related distributions, as well as Fourier analysis, are introduced and applied to linear systems. Moreover, causal and noncausal systems are considered, as well as Kramers–Kronig relations and the Hilbert transform.
An upper bound for the hazard rate function of a convolution of not necessarily independent random lifetimes is provided, which generalizes a recent result established for independent random lifetimes. Similar results are considered for the reversed hazard rate function. Applications to parametric and semiparametric models are also given.