Faulted geological contacts: constraining uncertainty of discontinuities orientation using triangulation and combinatorial algorithm

Author(s):  
Michał Michalak ◽  
Ryszard Kuzak ◽  
Paweł Gładki ◽  
Agnieszka Kulawik

<p>Subsurface information is usually a limited resource in geological modelling. This is not the case, however, for the Kraków-Silesian Homocline in central Poland. It was subject to rapid exploitation of ore-bearing clays in the second half of the 20<sup>th </sup>century. Exhaustive geological documentation remained after this activity had ceased and it contains thousands of borehole records. A small part of this resource has recently been incorporated to propose a new method for determining the dominant orientation of a selected geological contact. This new method regarded Delaunay triangles as source of local orientations that were then analyzed on stereonets. The geological contacts in this region are inclined gently towards NE, but they are also faulted and indicate some stratigraphic noise which makes the extraction of dominant orientation a challenging task.</p><p>It is still unknown, however, to which extent the proposed modelling approach is capable of detecting faults and calculating their orientation. This is particularly important for the introduction of a new method for the recognition of faults based on investigating spatial distribution of orientation patterns. This expert-guided methodology assumes to relate orientation trends with genetic trends and investigate them on 2D maps.</p><p>In this research, we built synthetic models of faulted contacts to observe the behaviour of triangles intersecting the fault surface. To observe the variability of the orientation at larger scale, and perhaps to constrain it at the same time, we applied a combinatorial algorithm for creating all three-element subsets from an n-element set. The employment of this combinatorial approach allowed to achieve a better clustering effect around the expected orientation. The limitation of the proposed approach can be attributed to some unexpected and unintuitive orientations. Compared to previous studies these singularities seem to be geometrical and not numerical in nature.</p>

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1785
Author(s):  
Xiaofei Liu ◽  
Peiyin Xing ◽  
Weidong Li

In this paper, we study the submodular load balancing problem with submodular penalties. The objective of this problem is to balance the load among sets, while some elements can be rejected by paying some penalties. Officially, given an element set V, we want to find a subset R of rejected elements, and assign other elements to one of m sets A1,A2,⋯,Am. The objective is to minimize the sum of the maximum load among A1,A2,⋯,Am and the rejection penalty of R, where the load and rejection penalty are determined by different submodular functions. We study the submodular load balancing problem with submodular penalties under two settings: heterogenous setting (load functions are not identical) and homogenous setting (load functions are identical). Moreover, we design a Lovász rounding algorithm achieving a worst-case guarantee of m+1 under the heterogenous setting and a min{m,⌈nm⌉+1}=O(n)-approximation combinatorial algorithm under the homogenous setting.


1995 ◽  
Vol 05 (01) ◽  
pp. 281-295 ◽  
Author(s):  
ZBIGNIEW GALIAS

In this paper we present a new method of controlling periodic orbits in chaotic systems. This method can be applied in situations when the chaotic system depends on one system parameter, which can be changed over a continuous interval or over a discrete, two-element set. We compare the new method to other ones, discuss its properties, and illustrate our approach with a numerical example.


2007 ◽  
Vol 17 (07) ◽  
pp. 1431-1463 ◽  
Author(s):  
G. MASHEVITZKY

We prove that the semigroup of all transformations of a 3-element set with rank at most 2 does not have a finite basis of identities. This gives a negative answer to a question of Shevrin and Volkov. It is worthwhile to notice that the semigroup of transformations with rank at most 2 of an n-element set, where n > 4, has a finite basis of identities. A new method of constructing finite non-finitely based semigroups is developed.


Author(s):  
C. C. Clawson ◽  
L. W. Anderson ◽  
R. A. Good

Investigations which require electron microscope examination of a few specific areas of non-homogeneous tissues make random sampling of small blocks an inefficient and unrewarding procedure. Therefore, several investigators have devised methods which allow obtaining sample blocks for electron microscopy from region of tissue previously identified by light microscopy of present here techniques which make possible: 1) sampling tissue for electron microscopy from selected areas previously identified by light microscopy of relatively large pieces of tissue; 2) dehydration and embedding large numbers of individually identified blocks while keeping each one separate; 3) a new method of maintaining specific orientation of blocks during embedding; 4) special light microscopic staining or fluorescent procedures and electron microscopy on immediately adjacent small areas of tissue.


1960 ◽  
Vol 23 ◽  
pp. 227-232 ◽  
Author(s):  
P WEST ◽  
G LYLES
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document