نتایج جستجو برای: free cake

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

2014
Eiji Inoue Yasuharu Shimizu Ryo Masui Tomomi Usui Keiichi Sudoh

OBJECTIVES This study was conducted to clarify the analgesic effect of toad cake and toad-cake-containing herbal drugs. METHODS We counted the writhing response of mice after the intraperitoneal administration of acetic acid as a nociceptive pain model and the withdrawal response after the plantar surface stimulation of the hind paw induced by partial sciatic nerve ligation of the mice as a n...

Journal: :Math. Program. 1998
Hans Reijnierse Jos A. M. Potters

This paper describes an algorithm to find an (a-)envy-free Pareto-optimal division in the case of a finite number of homogeneous infinitely divisible goods and linear utility functions. It is used to find an allocation in the classical cake division problem that is almost Pareto-op timat and o-envy-free. 9 1998 The Mathematical Pregraming, Society, Inc. Published by Elsevier Science B.V_

2005
Barry A. Perlmutter

INTRODUCTION In many chemical and pharmaceutical processes, solid-liquid separation, cake washing and drying steps directly impact the effectiveness of the production operation. Process engineers devote much of their time to analyzing these steps. The solid-liquid separation step can be by pressure, vacuum or centrifugation as well as in a batch or continuous mode. In this separation step, ther...

2015
Simina Brânzei

Fair division is a fundamental problem in economic theory and one of the oldest questions faced through the history of human society. The high level scenario is that of several participants having to divide a collection of resources such that everyone is satisfied with their allocation – e.g. two heirs dividing a car, house, and piece of land inherited. The literature on fair division was devel...

1996
Steven J. Brams Alan D. Taylor

Fair Division, unlike most research on fairness in the social sciences and mathematics, is devoted solely to the analysis of constructive procedures for actually dividing things up and resolving disputes, including...

2018
Fr'ed'eric Meunier Shira Zerbib

Consider n players having preferences over the connected pieces of a cake, identified with the interval [0, 1]. A classical theorem due to Stromquist ensures under mild conditions that it is possible to divide the cake into n connected pieces and assign these pieces to the players in an envy-free manner, i.e, no player strictly prefers a piece that has not been assigned to her. One of these con...

2009
Michele Conforti Frantisek Kardos

9:30 10:30 Michele Conforti 10:30 11:00 Coffee Break 11:00 11:30 Bernard Ries, “Some properties of edge intersection graphs of single bend paths on a grid” 11:30 12:00 Pierre Charbit,“Linear Time Split-Decomposition of undirected graphs” 12:00 3:30 Lunch and discussion 3:30 4:00 Nicholas Trotingnon, “The k-in-a-tree problem for graphs of girth at least k” 4:00 4:30 Maria Chudnovsky, “A splitter...

2001
M. R. MACKLEY

An experimental investigation of the cake filtration behaviour of 125-180 pm polyethylene particles, suspended in a neutrally buoyant Newtonian fluid, has been carried out. Static cake filtration measurements of both filtrate volume out-flow and cake thickness kinetics show the familiar t”” time dependence. In addition, the hydraulic resistance of the cake was found to be pressure independent, ...

Journal: :Revista de saude publica 1994
M L Pereira L S do Carmo E J dos Santos M S Bergdoll

Twelve people became ill with vomiting and diarrhoea approximately four hours after eating cake with a cream filling at a birthday party and on the day following. The cake had been prepared by a food handler who had long experience in preparing foods for such functions. Staphylococcus aureus that produced enterotoxin A was isolated from the nose, the fingernails, and a healed infection on the n...

Journal: :Journal of Fixed Point Theory and Applications 2022

Following a novel approach, where the emphasis is on configuration spaces and equivariant topology, we prove several results addressing envy-free division problem in presence of an unpredictable (secretive, non-cooperative) player, called dragon. There are two basic scenarios. (1) $$r-1$$ players Once “cake” divided into r parts, dragon makes his choice grabs one pieces. After that, should be a...

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

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