thermal boundary layer theory for solid bodies of nonspherical shape in uniform streaming flow
advanced transport phenomena
Ngày tải lên :
02/04/2014, 16:45
... Boundary- Layer Equation I Thermal Boundary- Layer Theory for Solid Bodies of Nonspherical Shape in Uniform Streaming Flow Two-Dimensional Bodies Axisymmetric Bodies Problems with Closed Streamlines (or Stream ... An Introduction H Heat Transfer from a Solid Sphere in Uniform Flow for Re and Pe 1 Governing Equations and Rescaling in the Thermal Boundary- Layer Region Solution of the Thermal Boundary- Layer ... Rotating Sphere in a Quiescent Fluid Uniform Flow past a Sphere B A Sphere in a General Linear Flow C Deformation of a Drop in a General Linear Flow D Fundamental Solutions of the Creeping-Flow...
- 934
- 1.2K
- 0
Tài liệu Báo cáo khoa học: "A GENERALIZATION OF THE OFFLINE PARSABLE GRAMMARS" doc
Ngày tải lên :
21/02/2014, 20:20
... set of ground instances of lists in D n is the set of chain derivations of length n in the ground grammar for G ' Once again, the proof is from basic properties of unification The lists in D ... ComplexFeature-Based Formalisms In Proceedings of the 23rd Annual Meeting of the Association for Computational Linguistics, 145-152 University of Chicago, Chicago, Illinois Shieber, Stuart (1986) An Introduction ... properties of offline parsable grammars, and it includes x-bar grammars that are not offline parsable For this purpose we augment our grammar formalism with a sort system, as defined in (GaUier...
- 6
- 440
- 0
Báo cáo toán học: " Colored partitions and a generalization of the braid arrangemen" docx
Ngày tải lên :
07/08/2014, 06:20
... wedge according to the action of G on L In the formulation of the lemma we denote by “inf” the in mum operation in L and by “sup” the supremum operation in L We write “ ” for the wedge of topological ... Πn+1 n Proof We map a colored partition of [n] to the partition of [n + 1] that is defined by adjoining n+1 to the colored block, in case there is one; or adjoining the singleton |n+ 1| in case ... journal of combinatorics (1997), #R4 11 Proof In order to determine the rational cohomology of the quotient it suffices to determine the multiplicity of the trivial representation of Sn in the cohomology...
- 12
- 410
- 0
Báo cáo toán học: "DETERMINANT IDENTITIES AND A GENERALIZATION OF THE NUMBER OF TOTALLY SYMMETRIC SELF-COMPLEMENTARY PLANE PARTITIONS" pptx
Ngày tải lên :
07/08/2014, 06:20
... [1] by transforming the sum of minors into a single determinant (using a result of Stembridge [15, Theorem 3.1, Theorem 8.3]) and evaluating the determinant Since Zeilberger shows in [16, Lemma ... is possible for this second family of determinants In Theorem 8, we succeed in evaluating the determinants (4.1) for independent x and y, taking advantage of all previous results in Section There ... translation of the constant term in (1.1) into a sum of minors of some matrix works for generic x, and since Stembridge’s result [15, Theorem 3.1] still applies to obtain a single determinant (see...
- 62
- 398
- 0
Báo cáo toán học: "RESTRICTED SET ADDITION IN GROUPS, II. ˝ A GENERALIZATION OF THE ERDOS-HEILBRONN CONJECTURE" pptx
Ngày tải lên :
07/08/2014, 06:20
... 1–4 are mostly combinatorial, with a somewhat surprising interference of graph theory in the proof of Theorem — see also Section 4, the Conclusion Proofs Proof of Theorem For i = 1, 2, we ... journal of combinatorics (2000), #R4 The coefficient − δ in Theorem can be slightly improved using the methods of [6]; √ in particular, for B = A it can be increased to ( + 1)/4 ≈ 0.80 The proofs of ... terms of ε) small compared to m + n Acknowledgment The (core of the) present form of Theorem and an idea incorporated in the proof of Theorem are due to Noga Alon, whom we are greatly indebted for...
- 10
- 516
- 0
báo cáo hóa học: " A new generalization of the Riemann zeta function and its difference equation" docx
Ngày tải lên :
21/06/2014, 02:20
... function of the discrete variable can be thought of as the parts of the sheet lying over the grid lines of the integer values of n The sequence where the curve intersects the grid lines gives ... that the RHS in (3.7) remains well defined for < s
- 13
- 438
- 0
Báo cáo toán học: "A Generalization of Gosper’s Algorithm to Bibasic" docx
Ngày tải lên :
07/08/2014, 06:20
... set of all integers, and the set of all non-negative integers Let p, q, x, and y be fixed indeterminates Assume K = L(κ1 , , κn ) to be the field of rational functions in a fixed number of indeterminates ... different representations in terms of falling bibasic factorials From all possibilities, we shall consider only the one taking care of maximal chains, which informally can be obtained as follows One ... products in K(p), power products in K(q), specific integers (i.e., integers free of any parameters), integer parameters free of k, or ±∞ if ar (resp ts , ar , ts ) = 0, specific integers, integer...
- 16
- 340
- 0
Báo cáo toán học: "A generalization of Simion-Schmidt’s bijection for restricted permutations" doc
Ngày tải lên :
07/08/2014, 07:21
... discussed in the proof of Proposition 2, the equality of the diagram squares of rank at most m − for π and σ = Φm (π) means that σi = πi for all i for which there exist at most m − integers j ... journal of combinatorics 9(2) (2003), #R14 Final remarks The number of elements of Sn (Bm ) (or, equivalently, Sn (Am )) was determined in [2] Recently, research into the enumeration of permutations ... of the diagram squares of π having rank at least 3.) The construction of σ’s array is completed as described in the proof of Proposition With the notations introduced in Remark 3, we have r =...
- 9
- 342
- 0
Báo cáo toán học: "Chromatic number for a generalization of Cartesian product graphs" pot
Ngày tải lên :
07/08/2014, 21:21
... the largest independent set, since such a bound may be of independent interest We prove the result in the more general setting of k-colorable graphs the electronic journal of combinatorics 16 ... has no independent set of size at least (2k)d /k Consider a set A in V (G) with size (2k)d /k; we bound the probability that A is an independent set in G Again we think of an element z in [d] ... designating a line in [2k]d parallel to some axis Let A[z] be the intersection of A with this line By the construction of G, the probability that no two vertices in A[z] are adjacent in G is...
- 9
- 263
- 0
Báo cáo toán học: "A generalization of generalized Paley graphs and new lower bounds for R(3, q)" pot
Ngày tải lên :
08/08/2014, 11:20
... 1-cliques in Gn [Ai ] These cliques form chains of length t in (Ai , ≺) Among all these chains of length t choose x0 ≺ · · · ≺ xt whose starting vertex x0 precedes the starting vertices of all other ... clique number of the automorphism cyclic graph Gn(Ai ) In the following discussion we will mainly restrict ourselves to the case of subgroup (k) in P For instance, we restrict to the case of one subgroup ... choice of a special element of highest order among the different expressions of S1 has the advantage of enhancing the computing efficiency of the clique number of Gn (Ai ) The computation of the...
- 10
- 368
- 0
Báo cáo toán học: "A generalization of Combinatorial Nullstellensatz" pot
Ngày tải lên :
08/08/2014, 11:20
... sum of labels over the the electronic journal of combinatorics 17 (2010), #N32 set N(u) of all neighbors of u in G The function c is called a lucky labeling of G if S(u) = S(w) for every pair of ... orientation of G where outgoing degree is bounded by k For each edge uw ∈ E(G) oriented u → w choose the leading monomial in fu (xu ) from the factor corresponding to this edge in h The product of these ... take a product of monomials from factors of h resulting in the monomial M, the sign of M is the same (because G is bipartite and leading coefficients of fv are positive) So the copies of M cannot...
- 6
- 215
- 0
Báo cáo toán học: "A Hessenberg generalization of the Garsia-Procesi basis for the cohomology ring of Springer varieties" ppt
Ngày tải lên :
08/08/2014, 12:23
... Hessenberg setting The main results of this paper are the following: • In Section 2, we complete the three legs of the triangle in the Springer setting In this setting, the (h, µ)-fillings are simply ... to reflect the method of how to build the (h, µ)-fillings in this Springer setting by inserting the numbers thru n in descending order However in the regular nilpotent setting of the current section, ... µ)-fillings as the basis of R/Jh 4.3 Forthcoming work In current joint work [9] with Tymoczko, we provide a generalization Ih of the Tanisaki ideal from the Springer setting into the new setting of...
- 29
- 521
- 0
Báo cáo toán học: "On a Generalization of Meyniel’s Conjecture on the Cops and Robbers Game" potx
Ngày tải lên :
08/08/2014, 12:23
... the set of columns of H It is known that every set of 2s + columns of H is linearly independent over Z2 (c.f., e.g., [1]), hence, in particular, every (2s + 2)-subset of S is linearly independent ... Ω(n s+1 ) for s = 2, [10] In this note we show that this lower bound holds for all s The main result Let k be a positive integer For a vertex u of a graph G, Nk (u) denotes the set of vertices ... escaping paths By controlling each escaping path, the cops can decrease the number of free escaping pairs by at most (as each path has two endpoints), hence the number of non-free escaping pairs...
- 7
- 380
- 0
Báo cáo toán học: "A generalization of some Huang–Johnson semifields" pot
Ngày tải lên :
08/08/2014, 12:23
... ) = L(S Θ ) = L(S)I , for some collineation I of G Remark 2.2 If Ψ is an invertible semilinear map of V inducing a collineation in P G(V, Fqn ) interchanging the reguli of the quadric Q, then ... Fq –linear set L(S) of P = P G(V, Fq3 ) of rank having a unique point P of weight (and hence a unique plane π of P of weight 5) and each other point of weight Moreover, if one of the following ... 2.2 S2 = S1 , where Ψ is an invertible semilinear map of V fixing the invertible elements of V Now, noting that an invertible semilinear map of V preserves the dimension of the Fq –vector subspaces,...
- 17
- 287
- 0
Báo cáo toán học: "A quasisymmetric function generalization of the chromatic symmetric function" pptx
Ngày tải lên :
08/08/2014, 12:23
... ) in increasing order, then the elements of f −1 (i2 ) in increasing order, and so on Proposition 2.2 (Lemma 4.5.3 in [6]) Let P be a natural partial order on [n], and let LP ⊆ Sn be the set of ... coloring of G which induces O That is to say, f is a k-balanced coloring of ′ G Thus, any PO -partition is a k-balanced coloring of G ′ Conversely, any k-balanced coloring κ is a POκ -partition for ... respectively to obtain such a coloring Thus, c11 < n! Since G possesses a k-balanced coloring, it possesses a k-balanced coloring with distinct colors–a natural relabelling of the induced orientation...
- 13
- 250
- 0
Báo cáo y học: "Stochasticity of flow through microcirculation as a regulator of oxygen delivery" doc
Ngày tải lên :
13/08/2014, 16:20
... The no could be increased if intensity of interruption of flow (b) is down, and also the no could be increased by increase of intensity to resume the flow (μ), thus the recruitment of microvessels ... spent in the interruptions of flow To find the t let assume that a probability of flow to stop does not depend on the time of uninterrupted flow Given assumption leads to a Poisson distribution of ... number of interruptions during sec Let also assume that the probability to resume the flow does not depend on the time for the flow being interrupted; meaning that the time τ to resume the flow...
- 5
- 257
- 0
A Generalization of Riemann Sums Omran Kouba
Ngày tải lên :
15/08/2014, 16:55
... that |In (P ) − J(P )| < for every n > n Therefore, for n > n , we have |In (f ) − J(f )| ≤ |In (f ) − In (P )| + |In (P ) − J(P )| + |J(P ) − J(f )| < This ends the proof of Theorem Applications ... k=1 Using fact and fact we conclude that lim n→∞ nα+p+1 n k p+1 ak = k=1 αL α+p 1− α+p+1 = αL α+p+1 This ends the proof of (2) For a continuous function f on the interval [0, 1] we define In (f ... (2) is equivalent to the fact that limn→∞ In (X p ) = J(X p ), for every nonnegative integer p Using linearity, we conclude that limn→∞ In (P ) = J(P ) for every polynomial function P n On the...
- 5
- 346
- 0