نتایج جستجو برای: walnut hull

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

2002
V. S. Polito K. Pinney R. Buchner W. Olson

We investigated the basis for fruit drop in walnut (Juglans regia L.) following bloom period applications of streptomycin as a potential control treatment for walnut blight, a bacterial disease incited by Xanthomonas campestris pv. juglandis (Pierce) Dye. Experiments were conducted on streptomycin-treated field plots of ‘Vina’ walnut. Four streptomycin treatments were applied at different times...

A Alibabae H Tavakoli M Ashtiani M Khosravi M Sabermoghaddam

Opting an appropriate dietary regime has been and will be one of the simplest ways of providing health for and preventing disorders of human beings. Cardiovascular diseases-one of the most prevalent causes of morbidity and mortality worldwide-are in particular related to diet. Atherosclerosis, the most common pathogenic process of cardiovascular disease, is closely connected with food ingredien...

Journal: :حفاظت گیاهان 0
حشمت امیدی احسان شاکری مطلب حسین پور وحیده رفیعی

to study allelopathic effects of iranian walnut (juglans regia l.) on germination and initial growth of purslane (portulaca oleracea) and redroot pigweed (amaranthus retroflexus) an experiment was conducted in shahed university. the result showed that fresh leaf had negatively effected on radicle length. also, with increasing extract concentrations of persian walnut, the seed germination and se...

Journal: :Optimization Letters 2012
Jean-Baptiste Hiriart-Urruty Hai Yen Le

We provide an explicit description of the convex hull of the set of matrices of bounded rank, restricted to balls for the spectral norm. As applications, we deduce two relaxed forms of the rank function restricted to balls for the spectral norm: one is the quasiconvex hull of this rank function, another one is the convex hull of the rank function, thus retrieving Fazel's theorem (2002). Key-wor...

Journal: :Oper. Res. Lett. 2015
Robert Hildebrand Timm Oertel Robert Weismantel

We study the complexity of computing the mixed-integer hull conv(P ∩ Z ×R) of a polyhedron P . Given an inequality description, with one integer variable, the mixed-integer hull can have exponentially many vertices and facets in d. For n, d fixed, we give an algorithm to find the mixed integer hull in polynomial time. Given P = conv(V ) and n fixed, we compute a vertex description of the mixed-...

Journal: :Int. J. Comput. Geometry Appl. 2001
Hee-Kap Ahn Siu-Wing Cheng Otfried Cheong Jack Snoeyink

We propose a hull operator, the reflex-free hull, that allows us to define a 3D analogue to bays in polygons. The reflex-free hull allows a rich set of topological types, yet for polyhedral input with n edges, it remains a polyhedral set with O(n) edges. This is in contrast to other possible hull definitions that give non-planar surfaces and higher combinatorial complexity. The reflex-free hull...

Journal: :Journal of Heredity 1916

Journal: :تحقیقات دامپزشکی 0
سید داود شریفی عباس برین اکبر یعقوب فر فرید شریعتمداری

abstract: this study was conducted to investigate the effects of diets containing different levels of hull-less barley on caecal microflora of broiler chicks. two hundred and forty one-day old male broiler chicks (arbor acres strain) were used in a completely randomized design with 4 tratments, and 3 replicates were allocated to each treatment. different levels of hull-less barley in diets had ...

2014
David C. Schneider

This article gives an overview of the concept of the Visual Hull and what its advantages and disadvantages are. The Visual hull is a concept of a 3D reconstruction by a Shape-From-Silhouette (SFS) technique. This kind of 3D scene reconstruction first has been introduced by Baumgart in his PhD thesis in 1974 [1]. Since then there have been several different variations of the Shape-From-Silhouett...

Journal: :Computers & Mathematics with Applications 2010
José Cáceres M. Carmen Hernando Mercè Mora Ignacio M. Pelayo María Luz Puertas

A set S of vertices of a connected graph G is convex, if for any pair of vertices u, v ∈ S , every shortest path joining u and v is contained in S . The convex hull CH(S ) of a set of vertices S is defined as the smallest convex set in G containing S . The set S is geodetic, if every vertex of G lies on some shortest path joining two vertices in S, and it is said to be a hull set if its convex ...

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

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