0

heat transfer from a body of arbitrary shape in a uniform streaming flow at small but nonzero peclet numbers

advanced transport phenomena

advanced transport phenomena

Hóa học - Dầu khí

... D Uniform Flow past a Solid Sphere at Small, but Nonzero, Reynolds Number E Heat Transfer from a Body of Arbitrary Shape in a Uniform Streaming Flow at Small, but Nonzero, Peclet Numbers F Heat ... Convective Heat Transfer The Analogy with Single-Solute Mass Transfer B Heat Transfer by Conduction (Pe → 0) C Heat Transfer from a Solid Sphere in a Uniform Streaming Flow at Small, but Nonzero, Peclet ... Similarity Transformation F Start-Up of Simple Shear Flow G Solidification at a Planar Interface H Heat Transfer in Unidirectional Flows Steady-State Heat Transfer in Fully Developed Flow through a...
  • 934
  • 1,249
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "A GENERALIZATION OF THE OFFLINE PARSABLE GRAMMARS" doc

Báo cáo khoa học

... language and the derivation trees generated by a unification grammar are the ones generated by its ground grammar Thus one can consider a unification grammar as an abbreviation for a ground grammar ... The author conjectures that grammars whose acyclic backbone is depth-bounded in fact generate the same languages as the offline parsable grammars Conclusion The offline parsable grammars apparently ... Fernando, and Warren, David D (1983) Parsing as Deduction In Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics, Cambridge, Massachusetts Sato, Taisuke, and Tamaki,...
  • 6
  • 440
  • 0
Báo cáo toán học:

Báo cáo toán học: " Colored partitions and a generalization of the braid arrangemen" docx

Báo cáo khoa học

... Let A be an arrangement of a ne hyperplanes in Cn Assume G ≤ Gln (C) is a finite subgroup that leaves A invariant Let ˆ be an additional element that is larger than any element of LA Then, UA ... spaces can be used to approximate the space of monic polynomials of degree n that have no double and no integral root Basic Definitions An arrangement A of hyperplanes in Cn is a finite set of a ne ... (C) acts on Cn leaving MA invariant then G also acts on LA as a group of lattice automorphisms If V ∈ LA then the stabilizer StabG (V ) = {g ∈ G | V g = V } of V in G acts on the lower interval...
  • 12
  • 410
  • 0
Báo cáo toán học:

Báo cáo toán học: "DETERMINANT IDENTITIES AND A GENERALIZATION OF THE NUMBER OF TOTALLY SYMMETRIC SELF-COMPLEMENTARY PLANE PARTITIONS" pptx

Báo cáo khoa học

... nonintersecting lattice paths [6, Cor 2; 15, Theorem 1.2] (see Proposition A1 ) this determinant has an interpretation in terms of nonintersecting lattice paths By a lattice path we mean a lattice path in the ... the q-analogues of [9] have any combinatorial meaning Another interesting development is that Amdeberhan (private communication) observed that Dodgson’s determinant formula (see [18, 17]) can be ... give a short inductive proof of the determinant evaluation in Theorem 10 (and also of its q-analogue in [9]), and could also be used to give an inductive proof of the determinant evaluation in...
  • 62
  • 398
  • 0
Báo cáo toán học:

Báo cáo toán học: "RESTRICTED SET ADDITION IN GROUPS, II. ˝ A GENERALIZATION OF THE ERDOS-HEILBRONN CONJECTURE" pptx

Báo cáo khoa học

... subsets of a finite group G of order q = |G|, and let τ : A → B be an injective mapping from A to B Suppose that m + n ≥ q + Then τ √ |A + B| > q − q − In a certain (rather narrow) range of m, n and ... and in the particular case of R induced by an injective mapping, Theorem improves Theorem To deal with the generalization of the most important and most difficult case of Theorem — that of small ... correspond at least m + n − q pairs (a, b) (with a ∈ A, b ∈ B) such that a + b = s, and for any such pair we have (a, b) ∈ R Totally, we have at least |S|(m + n − q) pairs (a, b) ∈ R On the other hand,...
  • 10
  • 516
  • 0
báo cáo hóa học:

báo cáo hóa học: " A new generalization of the Riemann zeta function and its difference equation" docx

Hóa học - Dầu khí

... Fellowship Author details Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia 2Center for Advanced Mathematics and Physics, National ... it is desirable to have a generalization of the Riemann and Hurwitz zeta functions in the critical strip, which converges locally uniformly at least A special case of our new generalization converges ... University of Science and Technology H-12, Islamabad, Pakistan Authors’ contributions All authors contributed equally to the manuscript and read and approved the final draft Competing interests The authors...
  • 13
  • 438
  • 0
Báo cáo toán học:

Báo cáo toán học: "A Generalization of Gosper’s Algorithm to Bibasic" docx

Báo cáo khoa học

... journal of combinatorics (1996), #R19 16 [4] G Gasper and M Rahman, An indefinite bibasic summation formula and some quadratic, cubic, and quartic summation and transformation formulas, Canad J Math., ... derivation of a family of q-Lagrange inversion formulas Al-Salam and Verma [2] employed the fact that the n-th q-difference of a polynomial of degree less than n is equal to zero, to show that 1− a ... Natl Acad Sci U.S .A. , 75 (1978), 40–42 [8] P Paule, Greatest factorial factorization and symbolic summation, J Symbolic Computation, 20 (1995), 235–268 [9] P Paule and A Riese, A Mathematica...
  • 16
  • 340
  • 0
Báo cáo toán học:

Báo cáo toán học: "A generalization of Simion-Schmidt’s bijection for restricted permutations" doc

Báo cáo khoa học

... four and height at least one in Dyck paths of length 2n and permutations π ∈ Sn satisfying a3 (π) = Remark 11 Thomas [12] gives the following alternative combinatorial proof of Proposition 10 dealing ... component consisting of all diagram squares of rank zero.) It was shown in [10, Lemma 2.2] that the rank of a square (i, j) which belongs to the diagram of a permutation in Sn is at least i + j − ... at least m − In particular, π avoids all patterns of Am if and only if every diagram square is of rank at most m − the electronic journal of combinatorics 9(2) (2003), #R14 Proof It follows from...
  • 9
  • 342
  • 0
Báo cáo toán học:

Báo cáo toán học: "Chromatic number for a generalization of Cartesian product graphs" pot

Báo cáo khoa học

... probability that A is an independent set in G Again we think of an element z in [d] × [2k]d−1 as designating a line in [2k]d parallel to some axis Let A[ z] be the intersection of A with this line ... graphs in a family resulting from a more general graph operation Instead of placing copies of the same graph Gi on all the lines parallel to the i-th axis, we may place different graphs from a fixed ... existence of k d -chromatic graphs in G d probabilistically, but an explicit construction can then be obtained by building, for each n, a graph in G d that is “universal” in the sense that it contains...
  • 9
  • 263
  • 0
Báo cáo toán học:

Báo cáo toán học: "A generalization of generalized Paley graphs and new lower bounds for R(3, q)" pot

Báo cáo khoa học

... · · ≺ xt of length t in (Ai , ≺) is called an Ai -colored chain of length t starting at x0 The length of a maximal chain starting at x0 is denoted by ℓi (x0 ) If there is no chain of positive ... cyclic graph Gn (Ai ) For an arbitrary a ∈ Ai , let r = |a( k)| If r > 1, then the equivalence class a = {a, a, ka, −ka, , k s− 1a, −k s−1 a} contains 2r elements If r = then a = {a, a} In particular, ... Proof Assume that k, h ∈ P It follows from Lemma that kAi = Ai and hAi = Ai Thus khAi = Ai Hence kh ∈ P, which means that P is closed under multiplication Obvious ∈ P It remains to show that...
  • 10
  • 368
  • 0
Báo cáo toán học:

Báo cáo toán học: "A generalization of Combinatorial Nullstellensatz" pot

Báo cáo khoa học

... F, with |A| Then (b − a) −1 = a A b A\ {a} Proof Consider the polynomial f (x) = a A b A\ {a} (x − b) (a − b) Its degree is at most |A| − 1, and for all aA it takes value of Hence f ≡ and the ... 9, pp [4] M Michalek, A short proof of Combinatorial Nullstellensatz, Amer Math Monthly (to appear) [5] U Schauz, Algebraically solvable problems: describing polynomials as equivalent to explicit ... set A1 × × An , or there are at least two points for which f takes a non-zero value Applications In this section we give an example of possible application of Theorem In some sense it generalizes...
  • 6
  • 215
  • 0
Báo cáo toán học:

Báo cáo toán học: "A Hessenberg generalization of the Garsia-Procesi basis for the cohomology ring of Springer varieties" ppt

Báo cáo khoa học

... We may now place the bars into this tableau yielding a filling of µ Remark 3.2.10 Observe that travelling from a barless tableau at Level i − down to a barless tableau at Level i, Lemma 3.2.8 asserts ... Since A( µ) equals B(µ), Theorem 2.3.9 implies the cardinality of A( µ) equals the cardinality of the generating set of row-strict tableaux in M µ Also, Φ is a degree-preserving map so A( µ) and ... Since Ah (µ) equals Bh (µ) and the number of paths in the h-tableau-tree is exactly n βi = |M h,µ |, i=1 the cardinality of Ah (µ) equals the cardinality of the generating set of (h, µ)-fillings...
  • 29
  • 521
  • 0
Báo cáo toán học:

Báo cáo toán học: "On a Generalization of Meyniel’s Conjecture on the Cops and Robbers Game" potx

Báo cáo khoa học

... escaping paths Since there are c cops in the game, the cops control at most 3msds c escaping paths By controlling each escaping path, the cops can decrease the number of free escaping pairs by at ... y)-path is called an escaping path By definition, every escaping path can be written as u1 u2 u3 us+1 , where u1 ∈ X and u2 ∈ A / Claim Each cop controls at most 3msds escaping paths Proof We ... Remark It can be shown using a similar argument that every x ∈ X has at most m neighbors in A A By an escaping pair we mean a pair (x, y) of vertices with x ∈ X and y ∈ Ns (x) We call x the head...
  • 7
  • 380
  • 0
Báo cáo toán học:

Báo cáo toán học: "A generalization of some Huang–Johnson semifields" pot

Báo cáo khoa học

... weights of P and π in L(S) are and 5, respectively, and since L(S) has rank 6, we have that P is a point of the plane π The last part of the statement simply follows from the facts that any plane of ... family of their translation duals References [1] A. A Albert: On the collineation groups of certain non–Desarguesian planes, Portugaliae Mathematica, 18 (1959), 207–224 [2] I Cardinali, O Polverino, ... under addition, containing the zero matrix and whose non–zero elements are invertible In this case, we say that S is a semifield spread set of matrices associated with S and since every matrix of...
  • 17
  • 287
  • 0
Báo cáo toán học:

Báo cáo toán học: "A quasisymmetric function generalization of the chromatic symmetric function" pptx

Báo cáo khoa học

... orientation of a graph is precisely a realization of that graph as a Hasse diagram So, we consider the posets which have Hasse diagram isomorphic to Km,n No such poset can have a chain of length ... that an orientation is acyclic if and only if it is 1balanced Similarly, a graph is a Hasse graph if and only if it has a 2-balanced orientation Recall that the girth of a graph is the length of ... orientations are necessarily acyclic, but they have the additional property that every weak cycle has at least edges oriented both forward and backward, due to the fact that Hasse diagrams include...
  • 13
  • 250
  • 0
Báo cáo y học:

Báo cáo y học: "Stochasticity of flow through microcirculation as a regulator of oxygen delivery" doc

Báo cáo khoa học

... interruption/resuming for short period of time is negligible Main result (2. 8a) is the observation that about fold variation of the demand of oxygen can be satisfied without variation of blood flow by ... the range of and is from to Introduced stochastic characteristics of microcirculation determinate also the fraction of open microvessels, no Under a steady state condition, the fraction of microvessels ... reveals that both stochastic characteristics, b and μ, are included into the expression for oxygen consumption To estimate possible influence of b and μ we should have the ranges of the variation...
  • 5
  • 257
  • 0
A Generalization of Riemann Sums Omran Kouba

A Generalization of Riemann Sums Omran Kouba

Toán học

... 1−t 1+t to obtain Thus we only need to evaluate the integral I = to this is to make the change of variables x ← I= arctan = Hence, I = π π 1−t 1+t dt = 1+t (5) “easy” way dt π − arctan t 1+t dt ... n lim Mathematical Reflections (2010) f k=1 k n ϕ(k) = π2 xf (x) dx (4) Choosing f (x) = arctan x x(1+x) n lim n→∞ k=1 we conclude that arctan(k/n) ϕ(k) = k(n + k) π arctan x dx 1+x arctan x 1+x ... An Introduction to the Theory of Numbers (5th ed.), Oxford University Press (1980) Omran Kouba Department of Mathematics Higher Institute for Applied Sciences and Technology P.O Box 31983, Damascus,...
  • 5
  • 346
  • 0

Xem thêm