نتایج جستجو برای: bulb cutting
تعداد نتایج: 53549 فیلتر نتایج به سال:
The stability behavior of low immersion helical end milling processes is investigated in this paper. Low radial immersion milling operations involve interrupted cutting which induces chatter vibration under certain cutting conditions. Time Finite Element Analysis (TFEA) is suggested for an approximate solution for delayed differential equations encountered during interrupted milling. An improve...
For decades researchers have struggled with the problem of envy-free cake cutting: how to divide a divisible good between multiple agents so that each agent likes his own allocation best. Although an envy-free cake cutting protocol was ultimately devised, it is unbounded, in the sense that the number of operations can be arbitrarily large, depending on the preferences of the agents. We ask whet...
I) Given a segment-cuttable polygon P drawn on a planar piece of material Q, we show how to cut P out of Q by a (short) segment saw with a total length of the cuts no more than 2.5 times the optimal. We revise the algorithm of Demaine et al. (2001) so as to achieve this ratio. (II) We prove that any collection R of n disjoint1 axis-parallel rectangles drawn on a planar piece of material Q is cu...
This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players must execute the protocol synchronously. Thus, the protocol cannot be executed on asynchronous networks such as the Internet. We show that the...
the aim of this study was to determine the optimal cutting cycle in an uneven-aged beech forest in the north of iran. first of all, a logistic growth model was determined for an uneven aged forest. then, the stumpage price was predicted via an autoregressive model. the average stumpage price of beech was derived from actual timber, round wood, fire and pulpwood prices at road side minus the var...
Olfactory sensory neurons extend their axons solely to the olfactory bulb, which is dedicated to odor information processing. The olfactory bulb is divided into multiple layers, with different types of neurons found in each of the layers. Therefore, neurons in the olfactory bulb have conventionally been categorized based on the layers in which their cell bodies are found; namely, juxtaglomerula...
The distribution of the different forms of synapsin in the rat olfactory bulb was investigated by biochemical and immunocytochemical methods. Western blots of tissue derived from microdissection of the surface and core regions of the olfactory bulb were performed using antibodies to synapsin I and synapsin II. The relative levels of the synapsins in the core region of the olfactory bulb were si...
We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n − 1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation—as these terms are used in the fair-division literature—one, divide-and-conquer (D&C), minimizes the maximum number of players that any ...
We extend the classic cake-cutting problem to a situation in which the ”cake” is divided among families. Each piece of cake is owned and used simultaneously by all members of the family. A typical example of such a cake is land. We examine three ways to assess the fairness of such a division, based on the classic no-envy criterion: (a) Average envy-freeness means that for each family, the avera...
Onion is a biennial plant that produces bulb. The larger the onion bulb, more valuable it becomes. Therefore, important to study bulb weight and size components affecting it. For this study, four New Mexico State Univ. breeding lines two commercial cultivars, ‘Rumba’ ‘Stockton Early Yellow’, were selected. These cultivars evaluated for height, leaf number sheath diameter, at five different date...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید