Abstract The number of satellites equipped with retroreflectors dedicated to Satellite Laser Ranging (SLR) increases simultaneously the development and invention spherical geodetic satellites, low Earth orbiters (LEOs), Galileo other components Global Navigational System (GNSS). SLR GNSS techniques onboard LEO create possibility widening use observations for deriving station coordinates, which ...

We present a new Monte Carlo technique, kinetic Monte Carlo reaction path following (kMCRPF), for the computer simulation of permeation and large-scale gating transitions in protein channels. It combines ideas from Metropolis Monte Carlo (MMC) and kinetic Monte Carlo (kMC) algorithms, and is particularly suitable when a reaction coordinate is well defined. Evolution of transition proceeds on th...

In this paper, the development and implementation of a three-dimensional, numerical pollutant transport model, which is based on an orthogonal curvilinear coordinate system in the horizontal direction and a sigma coordinate system in the vertical direction, is delineated. An efficient as well as simple open boundary condition is employed for pollutant transport in this mathematical model. It is...

We consider the rational linear relations between real numbers whose squared trigonometric functions have rational values, angles we call " geodetic ". We construct a convenient basis for the vector space over Q generated by these angles. Geodetic angles and rational linear combinations of geodetic angles appear naturally in Euclidean geometry; for illustration we apply our results to equidecom...

Geodetic sets in graphs are briefly surveyed. After an overview of earlier results, we concentrate on recent studies of the geodetic number and related invariants in graphs. Geodetic sets in Cartesian products of graphs and in median graphs are considered in more detail. Algorithmic issues and relations with several other concepts, arising from various convex and interval structures in graphs, ...

The geodetic problem was introduced by Harary et al. [17]. In order to model some social network problems, a similar problem is introduced in this paper and named the strong geodetic problem. The problem is solved for complete Apollonian networks. It is also proved that in general the strong geodetic problem is NP-complete.

An undirected graph G = (V;E) is said to be geodetic, if between any pair of vertices x; y 2 V there is a unique shortest path. Generalizations of geodetic graphs are introduced in this paper. K-geodetic graphs are de ned as graphs in which every pair of vertices has at most k paths of minimum length between them. Some properties and characterizations of k{geodetic graphs are studied.

A set of vertices S in a graph is called geodetic if every vertex of this graph lies on some shortest path between two vertices from S. In this paper, minimum geodetic sets in median graphs are studied with respect to the operation of peripheral expansion. Along the way geodetic sets of median prisms are considered and median graphs that possess a geodetic set of size two are characterized. © 2...

n-geocentric coordinate system known as the War Office -Wolf, Veis and Molodensky -parameter linear affine) transformation models for the study area by ers. In order to ascertain the precision of the in both WGS84 and War Office systems. The results -Badekas and Veis models parameters transform WGS84 coordinates to

A visualization of three-dimensional incompressible flows by divergence-free quasi-twodimensional projections of the velocity field onto three coordinate planes is revisited. An alternative and more general way to compute the projections is proposed. The approach is based on the Chorin projection combined with a SIMPLE-like iteration. Compared to the previous methodology based on divergence-fre...