نتایج جستجو برای: geodetic networks

تعداد نتایج: 431663  

2008
G. E. Hilley K. M. Johnson M. Wang Z. - K. Shen R. Bürgmann

Fault slip rate estimates along the Altyn Tagh and Kunlun strike-slip faults in northern Tibet vary considerably between short-term geodetic and long-term geologic studies. Here we reanalyze and model all global positioning system (GPS) data from northern Tibet to determine if these differences might be explained by previously unmodeled transient processes associated with the earthquake cycle, ...

2015
Eduardo Del Rio Leonardo Oliveira

The Helmert-blocking technique is a common approach to adjust large geodetic networks like Europeans and Brazilians. The technique is based upon a division of the network into partial networks called blocks. This way, the global network adjustment can be done by manipulating these blocks. Here we show alternatives to solve the block system that arises from the application of the technique. We s...

Journal: :Remote Sensing 2021

The Po River Delta (PRD, Northern Italy) has been historically affected by land subsidence due to natural processes and human activities, with strong impacts on the stability of ecosystems significant socio-economic consequences. This paper is aimed highlight spatial temporal evolution in PRD area analyzing geodetic observations acquired last decade. analysis performed using a moving window app...

Journal: :Journal of Surveying Engineering-asce 2023

In classical two-dimensional (2D) geodetic networks, reducing slope distances to horizontal ones is an important task for engineers. These along with directions are used in 2D adjustment. The common practice this reduction the use of vertical angles reduce using trigonometric rules. However, one faces systematic effects when angles. mainly due refraction, deflection (DOV), and geometric effect ...

Journal: :TransNav, the International Journal on Marine Navigation and Safety of Sea Transportation 2018

Journal: :Discrete Mathematics 2008
Linda Eroh Ortrud R. Oellermann

Let G be a connected graph and S ⊆ V (G). Then the Steiner distance of S, denoted by dG(S), is the smallest number of edges in a connected subgraph of G containing S. Such a subgraph is necessarily a tree called a Steiner tree for S. The Steiner interval for a set S of vertices in a graph, denoted by I (S) is the union of all vertices that belong to some Steiner tree for S. If S = {u, v}, then ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید