نتایج جستجو برای: filling arrangement

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

Journal: :journal of agricultural science and technology 2011
y. amanlou a. zomorodian

green fig, which is usually consumed as dry fruit, is one of the important non-oil export agricultural commodities of iran. in this study, some important physical properties of green figs including geometric mean diamter, sphericity, porosity, particle and bulk density and pressure drop across a thin bed were measured at constant moisture content of 6% (dry basis). air flow ranges used in this ...

Journal: :CoRR 2012
Ben D. Lund George B. Purdy Justin W. Smith

We demonstrate an infinite family of pseudoline arrangements, in which an arrangement of n pseudolines has no member incident to more than 4n/9 points of intersection. (This shows the “Strong Dirac” conjecture to be false for pseudolines.) We also prove non-trivial lower bounds on the maximum number of intersection points on any curve in an arrangement of curves in the plane, for various classe...

Journal: :Discrete & Computational Geometry 1993
Thomas H. Brylawski Günter M. Ziegler

Among the many ways to view oriented matroids as geometrical objects, we consider two that have special properties: • Bland’s analysis of complementary subspaces in IRn [2] has the special feature that it simultaneously and symmetrically represents a realizable oriented matroid and its dual; • Lawrence’s topological representation of oriented matroids by arrangements of pseudospheres [4] has th...

Journal: :Discrete & Computational Geometry 2010
Csaba Biró William T. Trotter

We study two kinds of segment orders, using definitions first proposed by Farhad Shahrokhi. Although the two kinds of segment orders appear to be quite different, we prove several results suggesting that the are very much the same. For example, we show that the following classes belong to both kinds of segment orders: (1) all posets having dimension at most 3; (2) interval orders; and for n ≥ 3...

Journal: :Discrete & Computational Geometry 2011
Julien Ferté Vincent Pilaud Michel Pocchiola

We describe an incremental algorithm to enumerate the isomorphism classes of double pseudoline arrangements. The correction of our algorithm is based on the connectedness under mutations of the spaces of one-extensions of double pseudoline arrangements, proved in this paper. Counting results derived from an implementation of our algorithm are also reported.

Journal: :Discrete Mathematics 2001
David Forge Jorge L. Ramírez Alfonsín

Let GH(S; H) be the bipartite graph with partition sets S and H , the set of simplices and hyperplanes of H, where simplex s∈ S is adjacent to hyperplane h∈H if one facet of s lies on h. In this paper, we give a complete characterization of GH(S; H) when H is a -arrangement. We also study GH(S; H) when H is a pseudoline arrangement. c © 2001 Elsevier Science B.V. All rights reserved.

پایان نامه :0 1371

the treatment of in completely formed pulpless teeth has presented considrable problems. these teeth have wide open apexes and the walls of the root canal diverge toward the apical tissues. mechanical preparation cannot be done in the normal manner beacause of the large initial size and the taper of apical part of the canal , a mechanical stop cannot be produced at the apex of the canal and , t...

Journal: :J. Comb. Theory, Ser. A 1980
Jacob E. Goodman Richard Pollack

Any finite set of lines in the real projective plane determines a cell complex; these complexes and their combinatorial properties have been a subject of study at least since 1826 [9]. More recently, Levi [6] considered a topological generalization of this notion, defined as follows: Consider a simple closed curve in RP2 which does not separate RP2; this is called a pseudoline. (It is clear tha...

Journal: :Inf. Process. Lett. 2013
Daniel Rotter Jens Vygen

We revisit the d-dimensional arrangement problem and analyze the performance ratios of previously proposed algorithms based on the linear arrangement problem with d-dimensional cost. The two problems are related via space-filling curves and recursive balanced bipartitioning. We prove that the worst-case ratio of the optimum solutions of these problems is Θ(log n), where n is the number of verti...

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

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