نتایج جستجو برای: cut size

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

Journal: :Chemical communications 2011
Yasutaka Anraku Akihiro Kishimura Atsushi Kobayashi Makoto Oba Kazunori Kataoka

Selective disposition of nanocarriers into target tissue is an essential issue in drug delivery. Critical size of nanocarriers (∼150 nm) discriminating the permeability into normal and tumor tissues was determined by the use of size-tunable, polyion complex hollow vesicles (PICsome) as a ruler.

2014
Anna Scott Jannah M. Hardefeldt Karina C. Hall Wan-Xi Yang

Anemonefishes and their host sea anemones form an iconic symbiotic association in reef environments, and are highly sought after in the marine aquarium trade. This study examines asexual propagation as a method for culturing a geographically widespread and commonly traded species of host sea anemone, Entacmaea quadricolor. Two experiments were done: the first to establish whether size or colour...

2012
Bertrand Guenin Irene Pivotto

A graft is a representation of an even cut matroid M if the cycles of M correspond to the even cuts of the graft. Two, long standing, open questions regarding even cut matroids are the problem of finding an excluded minor characterization and the problem of efficiently recognizing this class of matroids. Progress on these problems has been hampered by the fact that even cut matroids can have an...

2006
Matthias Baaz Stefan Hetzl Alexander Leitsch Clemens Richter Hendrik Spohr

Cut-elimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cut-elimination method CERES (cut-elimination by resolution) works by constructing a set of clauses from a proof with cuts. Any resolution refutation of this set then serves as a skeleton ...

1998
Friedhelm Meyer auf der Heide Gabriel Terán Martinez

We examine diierent variants of minimum cut problems on undi-rected weighted graphs on the p-processor bulk synchronous parallel BSP model of Valiant. This model and the corresponding cost measure guide algorithm designers to develop work eecient algorithms that need only very little communication. Karger and Stein have presented a recursive contraction algorithm to solve minimum cut problems. ...

2017
Phillipp Brockmeyer Katharina Kramer Florian Böhrnsen Rudolf Matthias Gruber Sarah Batschkus Tina Rödig Wolfram Hahn

BACKGROUND The present study aimed to evaluate the force delivery of removable thermoplastic appliances (RTAs), modified by different sized incisal cuts, during tipping of a maxillary central incisor in palatal and vestibular direction. METHODS Forty-five RTAs from three different materials (Biolon®, Erkodur®, Ideal Clear®) of the same thickness (1 mm) were used. Analysis was performed on a s...

2006
J. R. GORNY R. A. CIFUENTES B. HESS - PIERCE A. A. KADER

Fresh-cut fruit slices prepared from partially ripened Bartlett pears had longer shelf life than those from Bosc, Anjou, and Red Anjou pears. Pear fruit ripeness, based on flesh firmness of 44 to 58 N, is optimal for fresh-cut pear slice processing. Pear slices derived from smaller size fruit (122 to 135 g) have greater cut surface discoloration and deteriorate more rapidly than slices derived ...

2004
Yingyi Chu Quanshi Xia

This paper proposes a method of generating valid integer Benders cuts for a general class of integer programming problems. A generic valid Benders cut in disjunctive form is presented rst, as a basis for the subsequent derivations of simple valid cuts. Under a qualiication condition, a simple valid Benders cut in linear form can be identiied. A cut generation problem is formulated to elicit it....

Journal: :Ann. Pure Appl. Logic 2012
Lutz Straßburger

In proof theory one distinguishes sequent proofs with cut and cut-free sequent proofs, while for proof complexity one distinguishes Frege-systems and extended Frege-systems. In this paper we show how deep inference can provide a uniform treatment for both classifications, such that we can define cut-free systems with extension, which is neither possible with Frege-systems, nor with the sequent ...

Alice Yalaoui Christian Prins Selma Khebbache

An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...

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

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