A fundamental characteristic of computer networks is their topological structure. The question of the description of the structural characteristics of computer networks represents a problem that is not completely solved. Search methods for structures of computer networks, for which the values of the selected parameters of their operation quality are extreme, have not been completely developed. ...

[1] We infer rates of crustal deformation in the northern Walker Lane (NWL) and western Basin and Range using data from the Mobile Array of GPS for Nevada transtension, and other continuous GPS networks including the EarthScope Plate Boundary Observatory. We present 224 new GPS velocities, correct them for the effects of viscoelastic postseismic relaxation, and use them to constrain a block mod...

the basic National horizontal and vertical networks of geodetic control and provides governmentwide leadership in the improvement of geodetic surveying methods and instrumentation, coordinates operations to ass ure network development, and provides specifications and criteria for survey operations by Federal, State, and other agencies. NGS engages in research and development for the improvement...

A set S of vertices of a connected graph G is convex, if for any pair of vertices u, v ∈ S , every shortest path joining u and v is contained in S . The convex hull CH(S ) of a set of vertices S is defined as the smallest convex set in G containing S . The set S is geodetic, if every vertex of G lies on some shortest path joining two vertices in S, and it is said to be a hull set if its convex ...

The Geodetic Observatory TIGO in Chile is one of the few VLBI network stations in the southern hemisphere. Concerning the growing eVLBI community TIGO, due to its remote location, has access to a very limited bandwidth of the transcontinental communication networks. Recent data transmission speed tests have been executed between TIGO and some correlator locations showing a maximum speed of 5 Mb...

W e 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 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 equidecompos...

Geodetic numbers of graphs and digraphs have been investigated in the literature recently. The main purpose of this paper is to study the geodetic spectrum of a graph. For any two vertices u and v in an oriented graph D, a u–v geodesic is a shortest directed path from u to v. Let I (u, v) denote the set of all vertices lying on a u–v geodesic. For a vertex subset A, let I (A) denote the union o...