نتایج جستجو برای: concentrationnumber c n fractal model

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

2012
T. Gangopadhyay

Popcorn fractals are instances of Integrated Fractal Systems involving trigonometric functions. In this paper, we study the effect of spherical, swirl and pseudo-horseshoe functions on popcorn fractals to produce talismanic and tantric designs. General Terms Fractal, Algorithm, Turbo C++, Program.

Journal: :Bio Systems 2010
D. Waxman N. Stoletzki

In this paper we investigate some of the mathematical properties of meiotic recombination. Working within the framework of a genetic model with n loci, where alpha alleles are possible at each locus, we find that the proportion of all possible diploid parental genotypes that can produce a particular haploid gamete is exp[-n log(alpha(2)/[2alpha-1])]. We show that this proportion connects recomb...

2006
Oded Schramm Scott Sheffield David B. Wilson

The conformal loop ensembles CLEκ, defined for 8/3 ≤ κ ≤ 8, are random collections of loops in a planar domain which are conjectured scaling limits of the O(n) loop models. We calculate the distribution of the conformal radii of the nested loops surrounding a deterministic point. Our results agree with predictions made by Cardy and Ziff and by Kenyon and Wilson for the O(n) model. We also compu...

ببرنژاد زیارت, هانیه, ذوالفقاری, علی اصغر, هاشمی, علی اصغر, کیانیان, محمدکیا, یزدانی, محمدرضا,

The objective of current study was to invstigate the accuracy of Tyler and Wheatcraft, Bird et al. and Kravchenko and Zhang fractal models in describing particle size distribution (PSD) of sediment in 14 successive check dams for two depths of 0-15 and 15-30 cm. Sediment PSD were determined in 28 samples using hydrometer method . The referred fractal models were fitted on sediments PSD data. Re...

Journal: :iranian journal of mathematical chemistry 2010
o. ori f. cataldo d. vukičević a graovac

this note introduces a new general conjecture correlating the dimensionality dt of an infinitelattice with n nodes to the asymptotic value of its wiener index w(n). in the limit of large nthe general asymptotic behavior w(n)≈ns is proposed, where the exponent s and dt are relatedby the conjectured formula s=2+1/dt allowing a new definition of dimensionality dw=(s-2)-1.being related to the topol...

1999
A. Scotti C. Meneveau R. Temam

A new class of subgrid closures for large eddy simulation (LES) of turbulence is developed, based on the construction of synthetic, fractal subgrid-scale fields. The relevant mathematical tool, fractal interpolation, allows to interpolate the resolved velocity with fields that have fluctuations down to much smaller scales and to compute the required stresses explicitly. In one dimension, the ap...

2013
Huiyan Jiang Tianjiao Feng Di Zhao Benqiang Yang Libo Zhang Yenwei Chen

A new method is proposed to establish the statistical fractal model for liver diseases classification. Firstly, the fractal theory is used to construct the high-order tensor, and then Generalized N-dimensional Principal Component Analysis (GND-PCA) is used to establish the statistical fractal model and select the feature from the region of liver; at the same time different features have differe...

Journal: :CoRR 2014
Richard Herrmann

The dark silicon problem, which limits the power-growth of future computer generations, is interpreted as a heat energy transport problem when increasing the energy emitting surface area within a given volume. A comparison of two 3D-configuration models, namely a standard slicing and a fractal surface generation within the Menger sponge geometry is presented. It is shown, that for iteration ord...

1995
I. K. Kostov

We construct a string field Hamiltonian describing the dynamics of open and closed strings with effective target-space dimension c ≤ 1. In order to do so, we first derive the Dyson-Schwinger equations for the underlying large N vector+matrix model and formulate them as a set of constraints satisfying decoupled Virasoro and U(1) current algebras. The Hamiltonian consists of a bulk and a boundary...

Journal: :Int. J. Approx. Reasoning 2016
Aritz Pérez Martínez Iñaki Inza José Antonio Lozano

During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models. Some of these algorithms can be used to search for a maximum likelihood decomposable model with a given maximum clique size, k. Unfortunately, the problem of learning a maximum likelihood decomposable model given a maximum clique size is NP-hard for k > 2. In t...

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

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