نتایج جستجو برای: taiyuan formation

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه اصفهان - دانشکده علوم 1390

در این پژوهش به منظور درک سن و محیط رسوبی سازند آسماری در برش کوه شجبیل، شمال غرب یاسوج به ضخامت 375 متر 171 نمونه برداشت گردیده است. سازند آسماری در برش مورد مطالعه با معیارهای سنگ شناختی به سه واحد مشخص تفکیک شده است. این واحد ها با داشتن شمای آهک های مسیو، ضخیم، متوسط و نازک لایه، آهک های نازک لایه ی مارنی و بعضاً مارن مشخص می گردد. در این برش تعداد 18 جنس و 29 گونه از فرامینیفرهای بنتیک شنا...

Journal: :Journal of Petroleum Exploration and Production Technology 2021

Abstract Pore structural characteristics and methane adsorption capacity are two significant aspects affecting shale gas potential, but the impact of deposition burial processes on these is not clear. Hence, samples Taiyuan Formation deposited continuously experienced multi-stage tectonic uplift in Fuyang-Bozhou area Southern North China Basin were collected this study. Based total organic carb...

2008
C. R. Liu Z. A. Munir

The bonding of glass wafers to aluminum foils in multi-layer assemblies was investigated by the fieldassisted diffusion bonding process. Bonding was effected at temperatures in the range 350–450 C and with an applied voltage in the range 400–700 V under a pressure of 0.05 MPa. The experimental parameters of voltage and temperature were the main factors in influencing the ionic current leading t...

Journal: :Urban Transportation & Construction 2017

Journal: :Journal of Architectural Research and Development 2021

Journal: :IOP Conference Series: Earth and Environmental Science 2020

Journal: :Graphs and Combinatorics 2014
Weihua Yang Hong-Jian Lai Hao Li Xiaofeng Guo

Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai (Combinatorics and Graph Theory, vol 95, World Scientific, Singapore, pp 53–69; Conjecture 8.6 of 1995) conjectured that every 3-edge connected and essentially 6-edge connected graph is collapsible. Denote D3(G) the set of vertices of degree 3 of graph G. For e = uv ∈ E(G), define d(e) = d(u)+ d(v)− 2 the edge ...

2016
Lianjie Zhou Nengcheng Chen Sai Yuan Zeqiang Chen

The efficient sharing of spatio-temporal trajectory data is important to understand traffic congestion in mass data. However, the data volumes of bus networks in urban cities are growing rapidly, reaching daily volumes of one hundred million datapoints. Accessing and retrieving mass spatio-temporal trajectory data in any field is hard and inefficient due to limited computational capabilities an...

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

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