نتایج جستجو برای: dimension of time

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه سیستان و بلوچستان - دانشکده مهندسی عمران 1391

today, scouring is one of the important topics in the river and coastal engineering so that the most destruction in the bridges is occurred due to this phenomenon. whereas the bridges are assumed as the most important connecting structures in the communications roads in the country and their importance is doubled while floodwater, thus exact design and maintenance thereof is very crucial. f...

Journal: :International Journal of Modern Physics A 2017

Journal: :Mathematical Research Letters 2005

Journal: :IEEE Transactions on Neural Networks 2005

Journal: :Theor. Comput. Sci. 2008
Xiaoyang Gu Jack H. Lutz

Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet Σ that satisfy some given condition P on the asymptotic frequencies with which various symbols from Σ appear in S. Solutions to this problem are known in cases where (i) the fractal dimension is classical (Hausdorff or packing dimension), or (ii) the fractal dimensi...

2001
Klaus Ambos-Spies Wolfgang Merkle Jan Reimann Frank Stephan

In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in linear exponential time. We determine the dimension of various classes related to fundamental structural properties including different types of autoreducibility and immunity. By a new general invariance theorem for resour...

ژورنال: علوم آب و خاک 2019

River discharge is among the influential factors on the operation of water resources systems and the design of hydraulic structures, such as dams; so the study of it is of great importance. Several effective factors on this non-linear phenomenon have caused the discharge to be assumed as being accidental. According to the basics the chaos theory, the seemingly random and chaotic systems have re...

A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....

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

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