A collocation method to fit geophysical survey data

A self adaptive collocation method has been applied to the quantitative interpretation of geophysical survey data. Examples of interpretation of vertical electrical soundings (VES) and magneto-telluric soundings (MTS) have been chosen for this work due to the high nonlinearity of the response functions and to the high degree of correlation of the parameters involved. In both cases horizontally isotropic multi-layered models have been adopted.For comparison two different computing algorithms have been considered. In the first, using a generalized inverse formulation a new different decomposition into characteristic values has been used. In the second the Marquardt procedure has been modified in an original way to give a faster convergence using a strategy based on the contemporary adjustment of the step length and the direction of the regression. The confidence limits of the results have been evaluated.Results are given for interpretation of both MTS and VES curves using the two different algorithms. Model data and field data have been considered for an effective comparison of speed of convergence and accuracy.     

Satellite navigation. Raw data processing for geophysical applications

Satellite navigation systems are widely used in geophysical applications for precise trajectory determination of a vehicle-carrier of geophysical equipment. In particular, in airborne gravimetry it is necessary to determine the velocity and acceleration of the vehicle in addition to the position determination. Mathematical models and algorithms for the solution of these problems are described. The source data consists of differential Doppler and carrier phase GPS observations. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 11, No. 7, pp. 181–196, 2005.     

On the probability distribution of data at points in real complete intersection varieties

We show several estimates on the probability distribution of some data at points in real complete intersection varieties: norms of real affine solutions, condition number of real solution of real systems of multi-variate polynomial equations and convergence radius of Newton's operator for under-determined system of multi-variate polynomial equations.     

On complete sequences

A sequence A of nonnegative integers is called complete if all sufficiently large integers can be represented as the sum of distinct terms taken form A. For a sequence \({S=\{s_{1}, s_{2}, \dots\}}\) of positive integers and a positive real number α, let S _α denote the sequence \({\{\lfloor\alpha s_{1}\rfloor, \lfloor\alpha s_{2}\rfloor, \dots\}}\), where \({\lfloor x \rfloor}\) denotes the greatest integer not greater than x. Let \({{U_S = \{\alpha \mid S_\alpha} \, is complete\}}\). Hegyvári [6] proved that if \({\lim_{n\to\infty} (s_{n+1}-s_{n})=+ \infty}\), \({s_{n+1} < \gamma s_{n}}\) for all integers \({n \geqq n_{0}}\), where \({1 < \gamma < 2}\), and \({U_{S}\ne\emptyset}\), then \({\mu(U_{S}) > 0}\), where \({\mu(U_{S})}\) is the Lebesgue measure of U _S . Yong-Gao Chen and the first author [4] proved that, if \({s_{n+1} < \gamma s_{n}}\) for all integers \({n \geqq n_{0}}\), where \({1 < \gamma \leqq 7/4=1.75}\), then \({\mu(U_{S}) > 0}\). In this paper, we prove that the conclusion holds for \({1 < \gamma \leqq \sqrt[4]{13}=1.898\dots\;}\).     

On complete Tchebycheff-systems

It is shown under what condition a Tchebycheff-space on a real set containing at most one end point, has a Tchebycheff subspace of codimension 1. It is also shown when a complete Tchebycheff-system on a real set M, is also a complete Tchebycheff-system on .     

On the least complete extension of complete subsemilattices

For a complete sublattice X of a complete lattice C, we consider the problem of the existence of the least complete meet subsemilattice of C having as least complete extension (i.e., the least complete sublattice of C containing it) X. We argue that this problem is not trivial, and we provide two results that, under certain conditions on C and X, give a positive answer to this problem. Received January 31, 1997; accepted in final form October 23, 1997.     

Interpolation of fuzzy data by complete splines

In this paper, we will consider the interpolation of fuzzy data by fuzzy-valued complete splines. Finally, we will give the numerical solutions of the illustrative examples.     

On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers

We revisit the different approaches used in the literature to estimate the data complexity of distinguishing attacks on stream ciphers and analyze their inter-relationships. In the process, we formally argue which approach is applicable (or not applicable) in what scenario. To our knowledge, this is the first kind of such an exposition. We also perform a rigorous statistical analysis of the message recovery attack that exploits a distinguisher and show that in practice there is a significant gap between the data complexities of a message recovery attack and the underlying distinguishing attack. This gap is not necessarily determined by a constant factor as a function of the false positive and negative rate, as one would expect. Rather this gap is also a function of the number of samples of the distinguishing attack. We perform a case study on RC4 stream cipher to demonstrate that the typical complexities for message recovery attack inferred in the literature are but under-estimates and the actual estimates are quite larger.     

On wind driven geophysical flows without bottom friction

The motion of a fluid in a thin domain subject to wind traction at the surface and to slipping at the bottom is investigated. An asymptotic model is derived from Navier-Stokes equations with Coriolis force as the aspect ratio δ=depth/width of the domain go to 0, for not too large Reynolds number.

---

Sunto In questo lavoro studiamo il moto di un fluido in un dominio sottile soggetto all’azione del vento in superficie ed a condizioni di slipping sul fondo. Viene derivato, dalle equazioni di Navier-Stokes in presenza della forza di Coriolis, un modello asintotico nel limite in cui il rapporto tra la profondità e la larghezza del dominio tende a zero, per numeri di Reynolds non troppo grandi.

     

On complete parabolic surfaces

Sufficient conditions are found for complete parabolic surfaces to be cylindrical in Euclidean space. A complete (l-2)-[resp. (l-3)]-parabolic surface is a cylinder with (l-3)-[resp. (l-4)]-dimensional generators if the order of flattening of the surface isl-2 [resp.l-3] and the strong zero-index is constant.Translated from Ukrainskií Geometricheskií Sbornik, Issue 28, 1985, pp. 8–19.     

On almost complete intersections

Let R be a local ring such that R=S/I where S is a regular local ring and I is a prime ideal of height r. In this paper it is shown that if I is minimally generated by r+1 elements, then there exists an R-homomorphism : K_RR^r+1 such that is an injection and R^r+1/(K_R)I/I² where K_R:=Ext _S ^r (R,S) the canonical module of R. Moreover, in case where S is a locality over a perfect field k, it is also shown that if R is Cohen-Macaulay and I² is a primary ideal, then the homological dimension of the differential module _R/k is infinite.The author wishes to thank his colleague Mr.Y.Aoyama for valuable discussions in connection with this subject.     

On decompositions of complete hypergraphs

We study the minimum number of complete r-partite r-uniform hypergraphs needed to partition the edges of the complete r-uniform hypergraph on n vertices and we improve previous results of Alon.     

On grid generation for numerical models of geophysical fluid dynamics

A simple geometric condition that defines the class of classical (stereographic, conic and cylindrical) conformal mappings from a sphere onto a plane is derived. The problem of optimization of computational grid for spherical domains is solved in an entire class of conformal mappings on spherical (geodesic) disk. The characteristics of computational grids of classical mappings are compared for different spherical radii of geodesic disk. For a rectangular computational domain, the optimization problem is solved in the class of classical mappings and respective area of the spherical domain is evaluated.