نتایج جستجو برای: ordering cone
تعداد نتایج: 76536 فیلتر نتایج به سال:
In this paper, we introduce a concept of a generalized $c$-distance in ordered cone $b$-metric spaces and, by using the concept, we prove some fixed point theorems in ordered cone $b$-metric spaces. Our results generalize the corresponding results obtained by Y. J. Cho, R. Saadati, Shenghua Wang (Y. J. Cho, R. Saadati, Shenghua Wang, Common fixed point heorems on generalized distance in ordere...
Background: Paranasal sinus disease is one of the most common problems of patients that refer to ENT centers. Adding to clinical examination imaging plays an important role in diagnosis and treatment. Also the imaging of paranasal sinuses is necessary before surgery. Although computed tomography is the modality of choice for these areas, it has some disadvantages which the most important one is...
the produced electric and magnetic fields due to lightning strikes to mountainous ground are determined in this paper. for the sake of simplicity a cone-shaped ground with finite conductivity is assumed to represent a natural nonflat ground. by this assumption, we deal with an axillary symmetrical structure so we use the cylindrical 2d-fdtd to save the simulation memory and time, dramatically. ...
Frequency histograms are ubiquitous, being practically used in any field of science. In this paper, we present a partial order for frequency and, to our knowledge, no kind has been yet defined. This is based on the stochastic discrete probability distributions and it invariance properties that make unique. First, model histogram as sequence bins associated with (or relative frequency) distribut...
Ultimate limits of an open pit, which define its size and shape at the end of the mine’s life, is the pit with the highest profit value. A number of algorithms such as floating or moving cone method, floating cone method II and the corrected forms of this method, the Korobov algorithm and the corrected form of this method, dynamic programming and the Lerchs and Grossmann algorithm based on grap...
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید