Spelling suggestions: "subject:"geophysical surveying"" "subject:"eophysical surveying""
1 |
The stochastic inversion of magnetics and resistivity data using the simulated annealing algorithmDittmer, Jonathan Keith January 1993 (has links)
No description available.
|
2 |
A multichannel borehole radar for three dimensional imagingHargreaves, Jonathan January 1995 (has links)
No description available.
|
3 |
Geophysical Survey TechniquesErnenwein, Eileen G. 01 May 2023 (has links)
Book summary:
In the newly revised Second Edition of the Handbook of Archaeological Sciences, a team of more than 100 researchers delivers a comprehensive and accessible overview of modern methods used in the archaeological sciences. The book covers all relevant approaches to obtaining and analyzing archaeological data, including dating methods, quaternary paleoenvironments, human bioarchaeology, biomolecular archaeology and archaeogenetics, resource exploitation, archaeological prospection, and assessing the decay and conservation of specimens [...]
|
4 |
The construction of optimal drape surfaces with constrained first and second derivativesFossati, Reiner Justin 31 January 2003 (has links)
The need to construct optimal drape surfaces arises in airborne geophysical surveys
where it is necessary to fly a safe distance above the ground and within the performance
limits of the aircraft used, but as close as possible to the surface. The problem is
formulated as an LP with constraints at every point of a grid covering the area concerned,
yielding a very large problem. The objective of the LP is to create as "good" a surface as
possible. This formulation is new, as previous methods did not aim to minimise an
objective function.
If the desired surface has only slope limitations, the resulting drape surface must be
constrained in the first derivative. Such a drape surface is readily constructed using the
Lifting Algoritlun. It is shown that the Litling Algorithm is both exact and has great
speed advantages. Some numerical results confinning exacmcss and speed are presented,
as is the algorithm's analogy to a flow network method. An enhanced lifting method with
a better order of complexity is also proposed and tested numerically.
In most practical situations a drape surface is required which has both first and second
derivatives constrained. If only a cut through such a surface is considered, the problem
can be solved with relative ease by exploiting its nctwork~Jike structure. This method
fonns the basis of one of the preferred heuristics developed later. It was not possible to
generalise this method to a full two~dimensional drape surface. A commercially available
LP package fares better in finding the optimal solution.
Several heuristic methods were examined. first a general heuristic method based on a
lifting approach was developed. This was followed by a method using repeated
application of the method used for sections (the Alternating One-dimensional Dual
Algorithm ["AODA"]). Three heuristics based on thimbles were also designed. Thimbles
are caps whose first and second derivatives are acceptable and which are placed over
local infeasibilities in the topography
The work ends with a chapter comparing the efficiency of various heuristics and
comparing the results obtained using a number of test datasets. It was fOLmd that heuristic
methods provide acceptable drape surfaces and that the choice lies between speed and
accuracy, with a previously designed smoothing method being the fastesl and the AODA
the most accurate and quick enough. / Operations Research / D.Phil.
|
5 |
The construction of optimal drape surfaces with constrained first and second derivativesFossati, Reiner Justin 31 January 2003 (has links)
The need to construct optimal drape surfaces arises in airborne geophysical surveys
where it is necessary to fly a safe distance above the ground and within the performance
limits of the aircraft used, but as close as possible to the surface. The problem is
formulated as an LP with constraints at every point of a grid covering the area concerned,
yielding a very large problem. The objective of the LP is to create as "good" a surface as
possible. This formulation is new, as previous methods did not aim to minimise an
objective function.
If the desired surface has only slope limitations, the resulting drape surface must be
constrained in the first derivative. Such a drape surface is readily constructed using the
Lifting Algoritlun. It is shown that the Litling Algorithm is both exact and has great
speed advantages. Some numerical results confinning exacmcss and speed are presented,
as is the algorithm's analogy to a flow network method. An enhanced lifting method with
a better order of complexity is also proposed and tested numerically.
In most practical situations a drape surface is required which has both first and second
derivatives constrained. If only a cut through such a surface is considered, the problem
can be solved with relative ease by exploiting its nctwork~Jike structure. This method
fonns the basis of one of the preferred heuristics developed later. It was not possible to
generalise this method to a full two~dimensional drape surface. A commercially available
LP package fares better in finding the optimal solution.
Several heuristic methods were examined. first a general heuristic method based on a
lifting approach was developed. This was followed by a method using repeated
application of the method used for sections (the Alternating One-dimensional Dual
Algorithm ["AODA"]). Three heuristics based on thimbles were also designed. Thimbles
are caps whose first and second derivatives are acceptable and which are placed over
local infeasibilities in the topography
The work ends with a chapter comparing the efficiency of various heuristics and
comparing the results obtained using a number of test datasets. It was fOLmd that heuristic
methods provide acceptable drape surfaces and that the choice lies between speed and
accuracy, with a previously designed smoothing method being the fastesl and the AODA
the most accurate and quick enough. / Operations Research / D.Phil.
|
6 |
Spatial association in archaeology : development of statistical methodologies and computer techniques for spatial association of surface, lattice and point processes, applied to prehistoric evidence in North Yorkshire and to the Heslerton Romano-British siteKelly, Michael Anthony January 1986 (has links)
The thesis investigates the concepts of archaeological spatial association within the context of both site and regional data sets. The techniques of geophysical surveying, surface distribution collection and aerial photography are described and discussed. Several new developments of technique are presented as well as a detailed discussion of the problems of data presentation and analysis. The quantitative relationships between these data sets are explored by modelling them as operands and describing association in terms of operators. Both local and global measures of association are considered with a discussion as to their relative merits. Methods for the spatial association of regional lattice and point processes are developed. A detailed discussion of distance based spatial analysis techniques is presented.
|
7 |
Spatial association in archaeology. Development of statistical methodologies and computer techniques for spatial association of surface, lattice and point processes, applied to prehistoric evidence in North Yorkshire and to the Heslerton Romano-British site.Kelly, Michael A. January 1986 (has links)
The thesis investigates the concepts of archaeological spatial
association within the context of both site and regional data sets.
The techniques of geophysical surveying, surface distribution
collection and aerial photography are described and discussed.
Several new developments of technique are presented as well as a
detailed discussion of the problems of data presentation and
analysis.
The quantitative relationships between these data sets are
explored by modelling them as operands and describing association in
terms of operators. Both local and global measures of association
are considered with a discussion as to their relative merits.
Methods for the spatial association of regional lattice and point
processes are developed. A detailed discussion of distance based
spatial analysis techniques is presented.
|
Page generated in 0.0999 seconds