Bayesian Prediction and Adaptive Sampling Algorithms for Mobile Sensor Networks: Online Environmental Field Reconstruction in Space and Time 1st Edition Yunfei Xu download pdf
Bayesian Prediction and Adaptive Sampling Algorithms for Mobile Sensor Networks: Online Environmental Field Reconstruction in Space and Time 1st Edition Yunfei Xu download pdf
com
https://textbookfull.com/product/finn-noel-the-bloodwood-
academy-3-5-1st-edition-rae-foxx-foxx-rae/
textbookfull.com
Urban Practices from Delicacy Management to Governance in
Contemporary China The Case of Xuhui District Shanghai
Gaohong Chen
https://textbookfull.com/product/urban-practices-from-delicacy-
management-to-governance-in-contemporary-china-the-case-of-xuhui-
district-shanghai-gaohong-chen/
textbookfull.com
https://textbookfull.com/product/the-routledge-international-handbook-
of-clinical-hypnosis-1st-edition-julie-h-linden/
textbookfull.com
https://textbookfull.com/product/formal-problems-in-semitic-phonology-
and-morphology-2nd-edition-john-j-mccarthy/
textbookfull.com
https://textbookfull.com/product/the-victorian-ghost-story-and-
theology-from-le-fanu-to-james-1st-edition-zoe-lehmann-imfeld-auth/
textbookfull.com
https://textbookfull.com/product/fast-facts-for-the-er-nurse-
emergency-department-orientation-in-a-nutshell-jennifer-r-buettner/
textbookfull.com
Photocatalysis applications Dionysios D Dionysiou
https://textbookfull.com/product/photocatalysis-applications-
dionysios-d-dionysiou/
textbookfull.com
SPRINGER BRIEFS IN ELEC TRIC AL AND COMPUTER
ENGINEERING CONTROL, AUTOMATION AND ROBOTICS
Yunfei Xu
Jongeun Choi
Sarat Dass
Tapabrata Maiti
Bayesian Prediction
and Adaptive Sampling
Algorithms for Mobile
Sensor Networks
Online Environmental
Field Reconstruction in
Space and Time
123
SpringerBriefs in Electrical and Computer
Engineering
Series editors
Tamer Başar
Antonio Bicchi
Miroslav Krstic
More information about this series at http://www.springer.com/series/10198
Yunfei Xu Jongeun Choi Sarat Dass
• •
Tapabrata Maiti
Bayesian Prediction
and Adaptive Sampling
Algorithms for Mobile
Sensor Networks
Online Environmental Field Reconstruction
in Space and Time
123
Yunfei Xu Sarat Dass
Michigan State University Department of Statistics
East Lansing, MI Michigan State University
USA East Lansing, MI
USA
Jongeun Choi
Michigan State University Tapabrata Maiti
East Lansing, MI Department of Statistics
USA Michigan State University
East Lansing, MI
USA
vii
viii Preface
a rather simple empirical Bayes approach (Chap. 3), as we move through further
chapters, we discuss recent efforts with a fully Bayesian perspective to maximize
the flexibility of the models under various uncertainties while minimizing the
computational complexity (Chaps. 5 and 7). A fully Bayesian framework is adopted
here as it offers several advantages when inferring parameters and processes from
highly complex models (Chaps. 5 and 7). The Bayesian approach requires prior
distributions to be elicited for model parameters that are of interest. Once the priors
are elicited, the Bayesian framework is flexible and effective in incorporating all
uncertainties as well as information (limited or otherwise from data) into a single
entity, namely, the posterior. The fully Bayesian approach thus allows additional
sources and extent of uncertainties to be integrated into the inferential framework,
with the posterior distribution effectively capturing all aspects of uncertainties
involved. Subsequently, the practitioner needs only to focus on different compo-
nents of the posterior to obtain inference separately for the parameters of interest,
nuisance parameters, and hyperparameters. The fully Bayesian approach also
allows data to select the most appropriate values for nuisance parameters and
hyperparameters automatically and achieve optimal inference and prediction for the
scalar field. In this book, a fully Bayesian approach for spatio-temporal Gaussian
process regression will be formulated for resource-constrained robotic sensors to
fuse multifactorial effects of observations, measurement noise, and prior distribu-
tions for obtaining the predictive distribution of a scalar environmental field of
interest. Traditional Markov Chain Monte Carlo (MCMC) methods cannot be
implemented on resource-constrained mobile sensor networks due to high com-
putational complexity. To deal with complexity, the Bayesian spatio-temporal
models will be carefully tailored (Chap. 5). For example, we will approximate a
Gaussian process with a GMRF for computational efficiency (Chaps. 6 and 7).
A new spatial model is proposed via a GMRF (Chap. 6). In addition, ways to
improve computational efficiency will be proposed in form of empirical Bayes and
approximate Bayes instead of MCMC-based computation. For some special cases,
the developed centralized algorithms will be further refined in a distributed manner
such that mobile robots can implement distributed algorithms only using local
information available from neighboring robots over a proximity communication
graph (Chaps. 4–6).
We note that although regression problems for sensor networks under location
uncertainty have practical importance, they are not considered in this book. The
interested reader is referred to [6, 7] (centralized scheme) and [8] (distributed
scheme) for further information on this topic.
Organization
Gaussian process and its usage in nonparametric regression problems. The notations
for mobile sensor networks are also introduced in Chap. 2. In Chap. 3, we deal with
the case where hyperparameters in the covariance function is deterministic but
unknown. We design an optimal sampling strategy to improve the maximum
likelihood estimation of these hyperparameters. In Chap. 4, we assume the
hyperparameters in the covariance function are given; they can be obtained using
the approach proposed in Chap. 3. We then analyze the error bounds of prediction
error using Gaussian process regression with truncated observations. Inspired by the
error analysis, we propose both centralized and distributed navigation strategies for
mobile sensor networks to move in order to reduce prediction error variances at
points of interest. In Chap. 5, we consider a fully Bayesian approach for Gaussian
process regression in which the hyperparameters are treated as random variables.
Using discrete prior probabilities and compactly supported kernels, we provide a
way to design sequential Bayesian prediction algorithms that can be computed in
constant time as the number of observations increases. To cope with the compu-
tational complexity brought by using standard Gaussian processes with covariance
functions, in Chap. 6, we exploit the sparsity of the precision matrix by using
Gaussian Markov random fields (GMRFs). We first introduce a new class of
Gaussian processes with built-in GMRF and show its capability of representing a
wide range of nonstationary physical processes. We then derive the formulas for
x Preface
predictive statistics and design sequential prediction algorithms with fixed com-
plexity. In Chap. 7, we consider a discretized spatial field that is modeled by a
GMRF with unknown hyperparameters. From a Bayesian perspective, we design a
sequential prediction algorithm to exactly compute the predictive inference of the
random field. An adaptive sampling strategy is also designed for mobile sensing
agents to find the most informative locations in taking future measurements in order
to minimize the prediction error and the uncertainty in the estimated hyperpara-
meters simultaneously.
Keywords for chapters are summarized in Fig. 1. While each chapter is
self-contained and so can be read independently, arrows in Fig. 1 recommend
possible reading sequences for readers.
Acknowledgments
1 Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Contents in Chapters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
2 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2.1 Mathematical Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2.2 Physical Process Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
2.2.1 Gaussian Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
2.2.2 Spatiotemporal Gaussian Process . . . . . . . . . . . . . . . . . . 13
2.2.3 Gaussian Markov Random Field . . . . . . . . . . . . . . . . . . 14
2.3 Mobile Sensor Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
2.4 Gaussian Processes for Regression . . . . . . . . . . . . . . . . . . . . . . 17
3 Learning Covariance Functions . . . . . . . . . . . . . . . . . . . . . . . . . . 19
3.1 Selection of Gaussian Process Prior . . . . . . . . . . . . . . . . . . . . . 19
3.2 Learning the Hyperparameters . . . . . . . . . . . . . . . . . . . . . . . . . 21
3.3 Optimal Sampling Strategy . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
3.4 Simulation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
4 Memory Efficient Prediction With Truncated Observations . . . . . . 27
4.1 GPR with Truncated Observations . . . . . . . . . . . . . . . . . . . . . . 28
4.1.1 Error Bounds Using Truncated Observations . . . . . . . . . . 28
4.1.2 Selecting Temporal Truncation Size . . . . . . . . . . . . . . . . 34
4.2 Optimal Sampling Strategies . . . . . . . . . . . . . . . . . . . . . . . . . . 37
4.2.1 Centralized Navigation Strategy . . . . . . . . . . . . . . . . . . . 37
4.2.2 Distributed Navigation Strategy . . . . . . . . . . . . . . . . . . . 39
4.3 Simulation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
4.3.1 Centralized Sampling Scheme . . . . . . . . . . . . . . . . . . . . 46
4.3.2 Distributed Sampling Scheme . . . . . . . . . . . . . . . . . . . . 48
xi
xii Contents
References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
Chapter 1
Introduction
1.1 Background
(a) (b)
(c)
Fig. 1.1 a Wireless microsensor mote (MICA2DOT) from Crossbow Technology, Inc., CA, USA,
(www.xbow.com). b Distributed mobile sensor network with a (R-disk) proximity communication
graph for environmental monitoring (credit: Justin Mrkva). c Swarming Micro Air Vehicle Network
(SmavNet) developed in the Laboratory of Intelligent Systems at the Swiss Federal Institute of
Technology for search and rescue operation (Photo courtesy of Laboratory of Intelligent Systems
at EPFL, http://lis.epfl.ch)
wildlife monitoring. For example, one of the pressing societal concerns about water
quality is the proliferation of harmful algal blooms in ponds, lakes, rivers, and coastal
ocean worldwide. A satellite image of a 2011 significant harmful algal bloom in
western Lake Erie is shown in Fig. 1.3. The excessive growth of cyanobacteria leads
to a decaying biomass and oxygen depletion, which are detrimental to fish and other
aquatic life as well as to land animals and humans consequently (due to the produced
1.1 Background 3
Fig. 1.2 Personal drone (IRIS+) manufactured by 3D Robotics Inc., Berkeley, USA (credit: 3D
Robotics, http://3drobotics.com)
Fig. 1.3 Satellite image of 2011 significant harmful algal bloom in western Lake Erie in
Michigan, which impacted over half of the lake shore (credit: MERIS/ESA, processed by
NOAA/NOS/NCCOS, http://www.noaanews.noaa.gov)
toxins that deteriorate water quality) [17–19]. Deploying mobile sensor networks
can be a viable way to reconstruct and monitor such harmful algal blooms [20, 21].
Indeed, we have seen the increasing exploration of robotic technologies in aquatic
sensing [20, 22–25]. A robotic boat was used in concert with stationary buoys to form
an aquatic microbial system [20]; spatiotemporal aquatic field reconstruction was
implemented using inexpensive, low-power, robotic fish in [21] (see also Fig. 1.5a
for gliding robotic fish [26]); and low-cost, self-sustained mobile surface vehicles
have been designed for environmental monitoring as part of the citizen science project
Brooklyn Atlantis [23] (see Fig. 1.4). A robotic boat equipped with a depth sensor, as
4 1 Introduction
(a)
(b)
Fig. 1.4 Robots developed by NYU Polytechnic School of Engineering for image and water quality
data collection as part of the citizen science project Brooklyn Atlantis (http://www.brooklynatlantis.
poly.edu) [23] (credit: Jeffrey W Laut)
shown in Fig. 1.5b, can sample the depth of a lake for its estimation [27]. Autonomous
underwater vehicles (AUVs) are being developed as an important tool in oceanog-
raphy, marine biology, and other maritime applications [28–30]. Autonomous sea
gliders are another noteworthy example. These battery-powered, buoyancy-driven
vehicles can travel thousands of miles horizontally, for many months, without chang-
ing or recharging batteries [31–34]. With the networks of gliders as shown in Fig. 1.6,
adaptive sampling has been demonstrated in Monterey Bay, California [35–37].
1.1 Background 5
(a)
(b)
Fig. 1.5 a Gliding robotic fish “Grace” sampling harmful algae in the Wintergreen Lake, Michigan
[26] (credit: Xiaobo Tan). b Robotic boat sampling depth near Hawk Island, Lansing, Michigan
(credit: Jongeun Choi)
Fig. 1.6 Gliders used for adaptive sampling [35–37] (credit: Derek A. Paley)
environmental models, extremum seeking control has been proven to be very effective
for finding a source of a signal (chemical, electromagnetic, etc.) [38, 39]. Distributed
algorithms for stochastic source seeking with mobile robot networks have been devel-
oped for both cases with and without the mutual information model between their
expected measurements and the expected source location [43]. A unifying frame-
work of distributed stochastic gradient algorithms that can deal with coverage control,
spatial partitioning, and dynamic vehicle routing problems in the absence of a priori
knowledge of the event location distribution has been presented in [40].
A drawback of the spatial model free approach is that it limits its task to finding
the maximum (or minimum) point of the environmental field. To tackle a variety
of useful tasks such as the exploration, estimation, prediction, and maximum seek-
ing of a scalar field, it is essential for robots to have a spatial (and temporal) field
model [2–4, 36, 41, 42, 44–50]. Although control algorithms for mobile robots have
been developed based on computationally demanding, physics-based field models
[51], for resource-constrained mobile robots, recently, phenomenological and statis-
tical modeling techniques such as kriging, Gaussian process regression, and kernel
regression have gained much attention. Among phenomenological spatial models,
adaptive control of multiple robotic sensors based on a parametric approach needs
a persistent excitation (PE) condition for convergence of parameters [42, 50], while
control strategies based on Bayesian spatial models do not require such conditions
(e.g., by utilizing priori distributions as in Kalman filtering [41] or Gaussian process
regression [2]). Hence, control engineers have become more aware of the useful-
ness of nonparametric Bayesian approaches such as Gaussian processes (defined by
1.1 Background 7
mean and covariance functions) [52, 53] to statistically model physical phenomena
for the navigation of mobile sensor networks, e.g., [2–4, 36, 44–47]. Other more
data-driven approaches have also developed (without statistical structure used in
Gaussian processes) such as using kernel regression [48] and in reproducing kernel
Hilbert spaces [49]. However, without a statistical structure in a random field, such
an approach (as in [48, 49]) usually requires a great number of observations than the
one with a statistical structure for a decent prediction quality.
In a mobile sensor network, the resource-limited sensing agents are required to
collaborate in order to achieve a specific objective. The cooperative control becomes
essential. The most popular applications are in networks of autonomous ground
vehicles [54, 55], underwater and surface vehicles [23, 36, 56–58], or aerial vehicles
[59–61]. Emerging technologies have been reported on the coordination of mobile
sensing agents [41, 62–70].
The mobility of mobile agents can be designed in order to perform the optimal
sampling of the field of interest. Optimal sampling design is the process of choosing
where to take samples in order to maximize the information gained. Recently, in
[36], Leonard et al. developed mobile sensor networks that optimize ocean sampling
performance defined in terms of uncertainty in a model estimate of a sampled field.
A typical sensor placement technique [71] that puts sensors at the locations where
the entropy is high tends to place sensors along the borders of the area of interest
[44]. In [44], Krause et al. showed that seeking sensor placements that are most
informative about unsensed locations is NP-hard, and they presented a polynomial
time approximation algorithm by exploiting the submodularity of mutual information
[72]. In a similar approach, in [73], Singh et al. presented an efficient planning of
informative paths for multiple robots that maximize the mutual information.
To find these locations that predict the phenomenon best, one needs a model
of the spatiotemporal phenomenon. To this end, we use Gaussian processes (and
Gaussian random fields) to model fields undergoing transport phenomena. Nonpara-
metric Gaussian process regression (or Kriging in geostatistics) has been widely used
as a nonlinear regression technique to estimate and predict geostatistical data [52, 53,
74, 75]. A Gaussian process is a natural generalization of the Gaussian probability
distribution. It generalizes a Gaussian distribution with a finite number of random
variables to a Gaussian process with an infinite number of random variables in the
surveillance region [53]. Gaussian process modeling enables us to efficiently pre-
dict physical values, such as temperature, salinity, pH, or biomass of harmful algal
blooms, at any point with a predicted uncertainty level. For instance, near-optimal
static sensor placements with a mutual information criterion in Gaussian processes
were proposed in [44, 76]. A distributed Kriged Kalman filter for spatial estimation
based on mobile sensor networks was developed in [45]. Multiagent systems that are
versatile for various tasks by exploiting predictive posterior statistics of Gaussian
processes were developed in [77, 78].
Gaussian process regression, based on the standard mean and covariance func-
tions, requires an inversion of a covariance matrix whose size grows as the number
of observations increases. The significant computational complexity in Gaussian
8 1 Introduction
process regression due to the growing number of observations (and hence the size of
covariance matrix) has been tackled in different ways [2, 79–83].
Unknown hyperparameters in the covariance function can be estimated by a max-
imum likelihood (ML) estimator or a maximum a posteriori (MAP) estimator and
then be used in the prediction as the true hyperparameters [1]. However, the point
estimate (ML or MAP estimate) itself needs to be identified using a sufficient amount
of measurements and it fails to incorporate the uncertainty in the estimated hyper-
parameters into the prediction in a Bayesian perspective. The advantage of a fully
Bayesian approach is that the uncertainty in the model parameters is incorporated in
the prediction [84]. In [85], Gaudard et al. presented a Bayesian method that uses
importance sampling for analyzing spatial data sampled from a Gaussian random
field whose covariance function was unknown. However, the solution often requires
Markov Chain Monte Carlo (MCMC) methods, which greatly increases the com-
putational complexity. In [46], an iterative prediction algorithm without resorting
to MCMC methods has been developed based on analytical closed-form solutions
from results in [85], by assuming that the covariance function of the spatiotemporal
Gaussian random field is known up to a constant.
There have been growing efforts to fit a computationally efficient Gaussian
Markov random field (GMRF) on a discrete lattice to a Gaussian random field on a
continuum space [4, 86–88]. It has been demonstrated that GMRFs with small neigh-
borhoods can approximate Gaussian fields surprisingly well [86]. This approximated
GMRF and its regression are very attractive for the resource-constrained mobile sen-
sor networks due to its computational efficiency and scalability [89] as compared to
the standard Gaussian process and its regression. Fast kriging of large datasets using
a GMRF as an approximation of a Gaussian field has been proposed in [88].
prediction based on all cumulative data under certain conditions. The error bounds to
use truncated observations are analyzed for prediction at a single point of interest. A
way to select the temporal truncation size for spatiotemporal Gaussian processes is
also introduced. Inspired by the analysis, we then propose both centralized and dis-
tributed navigation strategies for mobile sensor networks to move in order to reduce
prediction error variances at points of interest. In particular, we demonstrate that
the distributed navigation strategy produces an emergent, swarming-like, collective
behavior to maintain communication connectivity among mobile sensing agents.
In Chap. 5, we formulate a fully Bayesian approach for spatiotemporal Gaussian
process regression under practical conditions such as measurement noise and
unknown hyperparameters (particularly, the bandwidths). Thus, multifactorial effects
of observations, measurement noise, and prior distributions of hyperparameters are
all correctly incorporated in the computed posterior predictive distribution. Using
discrete prior probabilities and compactly supported kernels, we provide a way to
design sequential Bayesian prediction algorithms that can be computed (without
using the Gibbs sampler) in constant time (i.e., O(1)) as the number of observations
increases. An adaptive sampling strategy for mobile sensors, using the maximum
a posteriori (MAP) estimation, has been proposed to minimize the prediction error
variances.
In Chap. 6, we propose a new class of Gaussian processes for resource-constrained
mobile sensor networks that build on a Gaussian Markov random field (GMRF) with
respect to a proximity graph over the surveillance region. The main advantages of
using this class of Gaussian processes over standard Gaussian processes defined by
mean and covariance functions are its numerical efficiency and scalability due to
its built-in GMRF and its capability of representing a wide range of nonstationary
physical processes. The formulas for predictive statistics are derived and a sequential
field prediction algorithm is provided for sequentially sampled observations. For a
special case using compactly supported weighting functions, we propose a distributed
algorithm to implement field prediction by correctly fusing all observations.
In Chap. 7, we consider a discretized spatial field that is modeled by a GMRF with
unknown hyperparameters. From a Bayesian perspective, we design a sequential pre-
diction algorithm to exactly compute the predictive inference of the random field.
The main advantages of the proposed algorithm are (1) the computational efficiency
due to the sparse structure of the precision matrix, and (2) the scalability as the num-
ber of measurements increases. Thus, the prediction algorithm correctly takes into
account the uncertainty in hyperparameters in a Bayesian way and also is scalable to
be usable for the mobile sensor networks with limited resources. An adaptive sam-
pling strategy is also designed for mobile sensing agents to find the most informative
locations in taking future measurements in order to minimize the prediction error
and the uncertainty in the estimated hyperparameters simultaneously.
Chapter 2
Preliminaries
Standard notation is used throughout this book. Let R, R≥0 , R>0 , Z, Z≥0 , Z>0 denote
the sets of real numbers, nonnegative real numbers, positive real numbers, integers,
nonnegative integers, and positive integers, respectively.
Let E, Var, Corr, Cov denote the expectation, variance, correlation, and the covari-
ance operators, respectively.
Let AT ∈ R M×N be the transpose of a matrix A ∈ R N ×M . Let tr(A) and det(A)
denote the trace and the determinant of a matrix A ∈ R N ×N , respectively. Let
rowi (A) ∈ R M and col j (A) ∈ R N denote the ith row and the jth column of a matrix
A ∈ R N ×M , respectively.
The positive definiteness and the positive semi-definiteness of a square matrix A
are denoted by A 0 and A 0, respectively.
Let |x| denote the absolute value of a scalar x. Let x denote the standard
Euclidean norm (2-norm) of a vector x. The induced 2-norm of a matrix A is denoted
by A. Let x∞ denote the infinity norm of a vector x.
Let 1 denote the vector with all elements equal to one and I denote the identity
matrix with an appropriate size. Let ei be the standard basis vector of appropriate
size with 1 as its ith element and 0 on all other elements.
The symbol ⊗ denotes the Kronecker product. The symbol ◦ denotes the
Hadamard product (also known as the entry-wise product and the Schur product).
A random vector x, which is distributed by a normal distribution of mean μ and
covariance matrix C, is denoted by x ∼ N(μ, C). The corresponding probability
density function is denoted by N(x; μ, C).
The relative complement of a set A in a set B is denoted by B \ A := B ∩ Ac ,
where Ac is the complement of A. For a set A ∈ I, we define z A = {z i | i ∈ A}.
Let −A denote the set I \ A.
In this section, we review important notions for the Gaussian process which will be
used to model the physical phenomenon. In particular, we introduce a class of spa-
tiotemporal Gaussian process model with anisotropic covariance functions. The prop-
erties of Gaussian Markov random fields (GMRF) are also briefly reviewed.
is completely specified by its mean function μ(x) and covariance function C(x, x ; θ )
which are defined as
μ(x) = E [z(x)] ,
C(x, x ; θ ) = E (z(x) − μ(x)) (z(x ) − μ(x ))|θ .
Although not needed to be done, we take the mean function to be zero for notational
simplicity,2 i.e., μ(x) = 0. If the covariance function C(x, x ; θ ) is invariant with
respect to translations in the input space, i.e., C(x, x ; θ ) = C(x − x ; θ ), we call it
stationary. Furthermore, if the covariance functionis a function of only the distance
between the inputs, i.e., C(x, x ; θ ) = C(x − x ; θ ), then it is called isotropic.
1 Itis also known as the marginalization property. It means simply that the random variables obey
the usual rules of marginalization, etc.
2 This is not a drastic limitation since the mean of the posterior process is not confined to zero [53].
2.2 Physical Process Model 13
where x is the th element of x ∈ R D . From (2.2), it can be easily seen that the
correlation between two inputs decreases as the distance between them increases.
This decreasing rate depends on the choice of the length scales {σ }. A very large
length scale means that the predictions would have little bearing on the correspond-
ing input which is then said to be insignificant. σ 2f gives the overall vertical scale
relative to the mean of the Gaussian process in the output space. These parame-
ters play the role of hyperparameters since they correspond to the hyperparame-
ters in neural networks and in the standard parametric model. Therefore, we define
θ = (σ 2f , σ1 , · · · , σ D )T ∈ R D+1 as the hyperparameter vector. A realization of a
Gaussian process that is numerically generated is shown in Fig. 2.1.
D
(s − s )2 (t − t )2
C(x, x ; θ ) = σ 2f exp − exp − , (2.3)
=1
2σ2 2σt2
|Q|1/2 1
π(z) = /2
exp − (z − μ)T Q(z − μ) ,
(2π ) N 2
Random documents with unrelated
content Scribd suggests to you:
Treatment. The first consideration is to remove the causes of local
irritation and infection, give a clean sweet stall, with dry floor, and
allow no contact with putrid liquids, mud, cold water, melting snow
or other irritant. If exercise is needful to obviate stocking of the legs
give it on dry clean ground.
If inflammation runs high with fever and costiveness a laxative will
be valuable and it may be well to follow this in some cases with
cooling diuretics. When the animal has been on a heavy grain ration
this should be largely cut down in keeping with enforced idleness, or
restricted work. If on the other hand condition is low, and the
discharge profuse a more generous ration may be desirable.
Local treatment is essentially soothing and antiphlogistic, and in
view of the infection should be antiseptic. White lotion (acetate of
lead and sulphate of zinc of each ½ oz., water 1 quart) has been long
used with fair success, for although lead sulphate is thrown down, it
is in part freed again through contact with the exudate. It will be
materially improved by the addition of 1 dr. carbolic acid, creolin,
lysol or chloro-naphtholeum or by some other antiseptic. Lead
acetate alone with an antiseptic is an excellent substitute. In mild
cases the surface may be wet with the lotion several times a day:
while in severe ones the lotion may be applied on a bandage kept
constantly wet. When secretion is well established it may be better to
use dry applications, as calomel; salicyclic acid 10 parts, with iodine
10 parts; calomel and lamp black; carbolated oxide of zinc or burned
alum, salol, etc. After washing and drying the skin, dust this freely
even into the deepest wrinkles and cover with cotton and bandage.
Dress twice daily. For very fœtid cases, Robertson recommends zinc
chloride 1 oz. in 1 qt. water with the addition of glycerine and phenol,
and again a saturated solution of copper sulphate with carbolized
glycerine. For profuse secretion after the subsidence of active
inflammation Renal highly recommends wood tar with 5 to 10 drops
of sulphuric acid to the ounce. Under these circumstances a powder
of gloss starch 5 ozs. with iodine ½ oz. may be employed twice daily.
Or again, 1 oz. each of carbolic acid, tincture of iodine and glycerine
may be employed. When one agent seems to be losing effect, it is well
to change for another and never to neglect the regular dressing, until
full recovery has been secured.
In case of grapes the actual cautery is the most efficient measure.
Heat a blacksmith’s fire shovel to a bright red and use this to cut
through the pedicles, a cool shovel being kept constantly beneath it
and in contact with the pedicles, so as to protect the adjacent skin
from injury by the radiated heat. The lower shovel must be dipped in
cold water at very frequent intervals to cool it and prevent
cauterization of the skin between the pedicles. This not only removes
the diseased and infected masses, but leaves the stumps of the
pedicles aseptic. Another method is to cut off the “grapes” and
staunch the blood with the actual cautery at a dull red heat. Still
another is to tie the pedicle of each excrescence separately so as to
cut off circulation and secure sloughing. This is, however, a long,
tiresome process, and entails prolonged contact with much infecting
dead tissue. After either method the parts must be dressed with
antiseptics, and dealt with generally like cases in which the
excrescences had not formed.
CUTANEOUS HEMORRHAGE: BLOODY SWEAT:
HÆMATIDROSIS. HÆMATOPEDESIS.
Chronic thickening of skin and lymph plexuses, horse hind limb after eczema,
grease, glanders, ox neck and head, knees, shoulder. Calcification. Treatment:
laxatives, diuretics, exercise, elastic bandage, friction, astringents, iodine.
Cases of this kind have been met with in foals and calves, which
were born entirely bald or with only a few thin delicate hairs
scattered over the surface. In a calf observed by the author, and
which lived for several months, the body was almost absolutely bald,
and the mouth remained edentulous, a coincidence which has been
observed in other cases. The teeth belong to the same class of
embryonic tissues as the epidermis, and a failure in the development
of the one is likely to entail a corresponding failure of the other.
Schneidemühl observed that the few hairs present in such cases were
especially delicate and brittle.
ALOPECIA. POST PARTEM. ALOPECIA AREATA.
Debility, ringworm, nodular hair. Hair bursts with brush like end. Cases in horse
like singed hair. Causes: infection probable, disturbed innervation, dry air,
impaired nutrition. Treatment: shave, oil, vaseline, petroleum, cantharides,
sulphur, tar, favor shedding coat.
Definition. Past views. Causes: heredity, age, cold, damp, cold climates, seasons,
exposure, buildings, cellars, night chills, weather vicissitudes, valleys, wading,
checked perspiration, lactic acid, metabolic products, acid phosphate of soda,
vegetable acids, neuropathic causation, infection, microbes, injuries, overwork.
Lesions: in joints, synovia, serosa, articular cartilage, fibro-cartilage, articular
lamella, bone, eburnation, ligaments, joints affected in horse and ox, blood
changes, albumen, fibrine, blood globules, pericardium, endocarditis, valvular
disease, myocarditis, embolisms in lungs, pleura, nervous lesions, digestive
system.
Chill, hyperthermia, lameness in fetlock, hock, knee, shoulder, stifle, hip, elbow,
tendons, sheaths, bursæ, bilateral, shifting, swelling, heat, tenderness, decubitus,
joint semi-flexed, pain on extension or flexion, signs of cardiac disease. Course:
rapid to recovery, improvements and relapses, metastasis, debility.