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

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

FARHOOD SAREMI,

Biopsies of thoracic lesions guidance. 22 of the 1 12 lesions were mediastinal and 83 were pleuroparenchymal. A large-bore 14-gauge Tru-cut needle was used in all patients. Adequate specimens for histologic examination were obtained in 98%. The overall accuracy was 91 % with 9% false negative and no false positive diagnoses. Despite the large size of the needle, the total number of complic...

Journal: :CoRR 2014
Alexandr Andoni Robert Krauthgamer David P. Woodruff

We study the problem of sketching an input graph, so that, given the sketch, one can estimate the value (capacity) of any cut in the graph up to 1+ε approximation. Our results include both upper and lower bound on the sketch size, expressed in terms of the vertex-set size n and the accuracy ε. We design a randomized scheme which, given ε ∈ (0, 1) and an n-vertex graph G = (V,E) with edge capaci...

Journal: :Journal of dairy science 2013
M Krämer P Nørgaard P Lund M R Weisbjerg

Particle size alterations during neutral detergent fiber (NDF) determination and in situ rumen incubation were analyzed by dry sieving and image analysis to evaluate the in situ procedure for estimation of NDF degradation parameters and indigestible NDF concentration in terms of particle size. Early-cut and late-cut grass silages, corn silage, alfalfa silage, rapeseed meal, and dried distillers...

Journal: :SIAM J. Discrete Math. 2001
David Hartvigsen

Consider the ( n 2 ) (or O(n2)) min-cut problems on a graph with n nodes and nonnegative edge weights. Gomory and Hu [J. Soc. Indust. Appl. Math., 9 (1961), pp. 551–570] showed (essentially) that there are at most n−1 different min-cuts. They also described a compact structure (the flow equivalent tree) of size O(n) with the following property: for any pair of nodes, the value of a min-cut can ...

1997
Michael Perregaard

In a recent paper [4] Balas, Ceria and Cornuejoels provided computational results that their Lift-and-Project method [3] successfully solved a series of pure and mixed 0-1 benchmark programs and performed on the average better than several commercial general mixed integer optimization packages existing at the time. The Lift-and-Project approach uses a linear programming formulation derived by i...

Journal: :پژوهش های علوم و صنایع غذایی ایران 0
mohammad reza asghari raheleh jami alireza farokhzad

introduction: nowadays, due to mechanization of life, consumers need of food which they spent little time for preparation, so fresh cut industry is growing rapidly in the world. these products had strong growth since 1940, and in 2013, most sales of fresh cut fruit related to apples, against 21.8 percent. minimal processing operations include grading, washing, sorting, slicing, chopping and the...

Journal: :SIAM J. Scientific Computing 1997
Tony F. Chan Patrick Ciarlet W. K. Szeto

Recursive spectral bisection (RSB) is a heuristic technique for finding a minimum cut graph bisection. To use this method the second eigenvector of the Laplacian of the graph is computed and from it a bisection is obtained. The most common method is to use the median of the components of the second eigenvector to induce a bisection. We prove here that this median cut method is optimal in the se...

2017
Martin Riis

Particle size alterations during neutral detergent fiber (NDF) determination and in situ rumen incubation were analyzed by dry sieving and image analysis to evaluate the in situ procedure for estimation of NDF degradation parameters and indigestible NDF concentration in terms of particle size. Early-cut and late-cut grass silages, corn silage, alfalfa silage, rapeseed meal, and dried distillers...

Journal: :Journal of neurophysiology 2001
V K Haftel J F Prather C J Heckman T C Cope

This study provides the first test in vivo of the hypothesis that group Ia muscle-stretch afferents aid in preventing reversals in the orderly recruitment of motoneurons. This hypothesis was tested by studying recruitment of motoneurons deprived of homonymous afferent input. Recruitment order was measured in decerebrate, paralyzed cats from dual intra-axonal records obtained simultaneously from...

Journal: :Computer aided surgery : official journal of the International Society for Computer Aided Surgery 1999
J Oikarinen R Hietala L Jyrkinen

OBJECTIVE Seed filling in view lattice is a method for accelerating volume rendering. Our previously published results on using seed filling had the limitation that they did not support cut planes. Cut planes are one of the main advantages of using volume rendering over surface rendering. In this article we describe the seed-filling acceleration technique and propose two fast reseeding processe...

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

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