A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Followiag an Auerbach-Banach-Mazur-Ulam problem from the well-known Scottish Book, results of this kind are called potato-sack theorems. ... We consider on-line packing methods which work under the restriction that during the packing process we are given each succeeding "'potato'" only when the preceding one has been packed. ... From the corollary and the lemma we immediately obtain the following on-line potato-sack theorem. Theorem. ...doi:10.1007/bf02574670 fatcat:tkbjg7uz6rgkpbdaffv4pwovqe
Lassak, On-line potato-sack algorithm efficient for packing into small boxes (105- 110); C. ... Sachs [Ebene isotrope Geometrie, Vieweg, Braun- schweig, 1987; MR 88j:51036], one is given an invariant absolute point F on an invariant absolute line. ...
For example, one finds here discussions of the sack of potatoes theorem (Problem 10.1), the Riemann set of a series (Problem 28), the Eidelheit separation theorem (Problem 64), the ham sandwich theorem ... by II (p. 139, line 2), 2/3 by 2/e (p. 205, line 20), the first} by € (p. 228, line 13), and “tube” by “type” (p. 260, line 19). ...
The problem of an on-line covering by planar convex bodies reduces to the problem of an on-line covering by rectangles thanks to the Radziszewski's theorem (see  ) that every planar convex body P contains ... This kind of restriction has been introduced for packing by Lassak and Zhang  who considered the on-line version of the well known potato-sack problem of Auerbach, Banach, Mazur and Ulam  . ...doi:10.1515/dema-1996-0119 fatcat:nusedht7dzhwjjoeytzpi3ycfy
Blind (Stuttgart) 92¢:52029 52C17 Lassak, Marek (PL-AATB); Zhang, Jixian (1-GAIT) An on-line potato-sack theorem. Discrete Comput. Geom. 6 (1991), no. 1, 1-7. ... This volume is compared with that required by a known not-on- line method, which sheds light on the quality of the proposed on-line method. ...
Genotyping error of EBG, updog, polyRAD, and rrBLUP in an F1 mapping population of tetraploid potato with 238 progeny. ... Sacks a The rate of self-fertilization can be specified for self-compatible plant species. | L. V. Clark, A. E. Lipka, and E. J. Sacks ...doi:10.1534/g3.118.200913 pmid:30655271 pmcid:PMC6404598 fatcat:ujgomtmxrrgaxinf3he22zymrm
Perhaps it is an error to explain my hesitancy through a theorem copied from my junior school philosophy text. ... Reaching an open area a few meters from the back of the line, Jerkinoff stopped. ...doi:10.17077/0021-065x.4842 fatcat:2rfspcytbfaohbrkntubxbymbe
,s_n, s_i∈[0,1], one by one. Each real must be placed in an array A with γ n initially empty cells without knowing the subsequent reals. ... On the positive side, we present an algorithm with competitive ratio O(n^0.59) for online translational strip packing of convex polygons. ... “A proof of an Auerbach-Banach-Mazur-Ulam theorem on convex bodies”. In: 4 (1957), pp. 216–218. doi: 10.4064/cm-4-2-216-218.  Marek Lassak and Jixian Zhang. “An on-line potato-sack theorem”. ...arXiv:2112.03791v1 fatcat:y3z5eh6ih5bs7aqi2ke7vbsvxy
Journal of Education
Potatoes are sold by the ‘sack’ of 160 Ibs., or two bushels of 80 lbs. each,—sometimes the ‘ sack’ contains three, four, or five bushels,—and sometimes by the bag of 140 lbs., and by the measure of 84 ... Ans. “ “ by 6= t= =}. Ans. “ “ aby f= T= 4h Ane “ “ — 5 — 4} by 63 = ag 24. Ans. Here the child has but one pattern for dividing frac- tions. ...
In line with these general goals, the specific objectives of this study are: 1. ... Individual county yields or weighted average county yields (where more than one county is located in an area) were used for most crops." Prices were based on state series. ... Consequently, the variate difference method provides only an approximation to the random variance for gross income. The limit to nonresidents of California is 10 separate issues on a single order. ...doi:10.3733/hilg.v30n06p175 fatcat:q6jp2mzhynhxdptyn4j4unhqbm
Under this definition an orthogonal polygon which is 0-concave is convex, that is, it is a rectangle, and one that is 1-concave is orthoconvex in the usual sense, and vice versa. ... Then we consider the problem of computing an orthoconvex orthogonal polygon of maximal area contained in a simple orthogonal polygon. This is the orthogonal version of the potato peeling problem. ... Therefore, we conclude that the following theorem holds. Theorem 7.4. ...doi:10.1007/bf02187918 fatcat:hvb5tkvt5relfmrxtm2jpvbcze
The thick line corresponds to the normal theory density as given in Theorem 9.3.1 based on the true b h and V (label 3). ... distribution on (a, b) Figure 1 . 1 : 11 Potatoes versus net income. ...doi:10.5860/choice.29-0364 fatcat:trkgzvpk7jb57ebwdy5pmipvpm
The thick line corresponds to the normal theory density as given in Theorem 9.3.1 based on the true b h and V (label 3). ... distribution on (a, b) Figure 1 . 1 : 11 Potatoes versus net income. ...doi:10.2307/2533418 fatcat:3hafhlx22bbbbdrugyiwoqcpd4
The thick line corresponds to the normal theory density as given in Theorem 9.3.1 based on the true b h and V (label 3). ... distribution on (a, b) Figure 1 . 1 : 11 Potatoes versus net income. ...doi:10.2307/1269674 fatcat:o7l4v2yprnardlsjsrb5ubx6zq
Thus, important staple crops such as wheat, potato, 52 . ... population of tetraploid 304 potato with 238 progeny. ...doi:10.1101/380899 fatcat:oz5cfw6c6fffvetooj2643z2re
« Previous Showing results 1 — 15 out of 154 results