نتایج جستجو برای: pieces of cut
تعداد نتایج: 21168465 فیلتر نتایج به سال:
AIM We describe the development of a highly-invasive, triple-negative breast cancer (TNBC) variant using serial orthotopic implantation of MDA-MB-231 human breast cancer in nude mice. MATERIALS AND METHODS MDA-MB-231 cells expressing red fluorescent protein (RFP) (1×10(7) cells/site) were initially injected subcutaneously in the flank of nude mice. After the subcutaneous tumors grew, they wer...
Many ant species have morphologically distinct worker sub-castes. This presumably increases colony efficiency and is thought to be optimized by natural selection. Optimality arguments are, however, often lacking in detail. In ants, the benefits of having workers in a range of sizes have rarely been explained mechanistically. In Atta leafcutter ants, large workers specialize in defence and also ...
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into general blocks in two stages, with another two or more stages being required to cut the blocks into pieces. Firstly vertical cuts divide the stock sheet into segments, and then horizontal cuts divide the segments into ...
Hydrogen peroxide (2.5%) alone or hydrogen peroxide (1%) in combination with nisin (25 microg/ml), sodium lactate (1%), and citric acid (0.5%) (HPLNC) were investigated as potential sanitizers for reducing Escherichia coli O157:H7 or Listeria monocytogenes populations on whole cantaloupe and honeydew melons. Whole cantaloupes inoculated with E. coli O157:H7 and L. monocytogenes at 5.27 and 4.07...
In this work a solution using evolutionary algorithms with penalty function for the non-guillotine cutting problem is presented. In this particular problem, the rectangular pieces have to be cut from an unique large object, being the goal to maximize the total value of cut pieces. Some chromosomes can hold pieces to be cut, but some pieces cannot be arranged into the object, generating infeasib...
Let us consider a great number of convex discs not "too different" from one another about which, apart from their total area, no further data are known. What can be said about the area of the largest square (or any other domain of given shape) which can be covered with the aid of these discs if we are allowed to cut each of them into a given number of suitable pieces? Analogously, we can raise ...
Objective(s): The aim of this study was to evaluate the final outcome of nerve regeneration across the eggsell membrane (ESM) tube conduit in comparison with autograft. Materials and Methods: Thirty adult male rats (250-300 g) were randomized into (1) ESM conduit, (2) autograft, and (3) sham surgery groups. The eggs submerged in 5% acetic acid. The decalcifying membranes were cut into four pie...
Last time we covered the s-t MinCut problem and the Multiway Cut problem, for which we gave a 2(1− 1 k )-approximation via an LP relaxation and showed that the integrality gap was 2(1− 1 k ). Today we will cover the MultiCut problem, and approximation algorithms for the problem using a techniques called low-diameter random decomposition (LDRD) and region growing. The MultiCut problem is related...
objective(s): the aim of this study was to evaluate the final outcome of nerve regeneration across the eggsell membrane (esm) tube conduit in comparison with autograft. materials and methods: thirty adult male rats (250-300 g) were randomized into (1) esm conduit, (2) autograft, and (3) sham surgery groups. the eggs submerged in 5% acetic acid. the decalcifying membranes were cut into four pie...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید