نتایج جستجو برای: enology in addition

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

2011
Oxana Skorniakova Kiwako Ito

This study investigates the effect of sub-phonemic variation in bilabial stop and sibilant fricative consonants on word identification. Recent research suggests that sub-phonemic variation in stop voicing contrasts influences lexical processing. The present study seeks further support for this view by examining listeners’ responses to synthetic speech varying along VOT and fricative place conti...

1998
EUGENE GARFIELD

For the past few years, Philadelphia has been experiencing a restaurant “boom’ ‘— a renaissance of creative dining establishments. 1.2In addition to exotic foods prepared in unusual or extravagant ways, a significant part of this gastronomic revolution has been the prominence of wine as a part of the meal and an accompanying increase in interest in types of wines and how they are served. One of...

Journal: :J. Global Optimization 2006
Diethard Pallaschke Joachim Rosenmüller

Within this paper we study the Minkowski sum of prisms (" Cephoids ") in a finite dimensional vector space. For a vector a ∈ R n with positive components we write ¯ a = (1 ¯ a 1 1 ¯ an) and denote by = ¯ a = {x ∈ R n || ¯ a, x 1 , x 0} the associated prism. We provide a representation of a finite sum of prisms in terms of inequalities.

2006
Valeriu Soltan

Let SH denote the homothety class generated by a convex set S ⊂ R: SH = {a + λS | a ∈ R, λ > 0}. We determine conditions for the Minkowski sum BH + CH or the Minkowski difference BH ∼ CH of homothety classes BH and CH generated by closed convex sets B,C ⊂ R to lie in a homothety class generated by a closed convex set (more generally, in the union of countably many homothety classes generated by...

Journal: :Electr. J. Comb. 2008
Christian Haase Benjamin Nill Andreas Paffenholz Francisco Santos

Fakhruddin has proved that for two lattice polygons P and Q any lattice point in their Minkowski sum can be written as a sum of a lattice point in P and one in Q, provided P is smooth and the normal fan of P is a subdivision of the normal fan of Q. We give a shorter combinatorial proof of this fact that does not need the smoothness assumption on P .

2003
RALPH HOWARD

Under the extra assumption that the boundary is of class C this was proven by S. Nakajima (= A. Matsumura) in 1926 Theorem 1 solves this problem. For convex bodies with C boundaries and positive curvature Nakajima’s result was generalized by Chakerian [?] in 1967 to “relative geometry” where the width and brightness are measured with with respect to some convex body K0 symmetric about the origi...

2015
María Gabriela Merín María Carolina Martín Kalliopi Rantsiou Luca Cocolin Vilma Inés Morata de Ambrosini

Pectinolytic enzymes are greatly important in winemaking due to their ability to degrade pectic polymers from grape, contributing to enhance process efficiency and wine quality. This study aimed to analyze the occurrence of pectinolytic yeasts during spontaneous fermentation of Argentine Bonarda grape, to select yeasts that produce extracellular pectinases and to characterize their pectinolytic...

Journal: :Journal of clinical pathology 1958
H H VERDENIUS L ALMA

Vacuum.-By creating a vacuum the process of decalcification can be characterized as follows: Insoluble calciurn-salts+acid o-soluble calciumsalts+CO2. The carbon dioxide, rapidly extracted, will disturb the balance of the chemical equilibrium, and, according to Le Chatelier, result in an acceleration of the reaction. Waerhaug (1949), however, points out that there will be a more intensive conta...

2006
Ron Wein

TheMinkowski sum of two setsA,B ∈ IR, denotedA⊕B, is defined as {a+ b | a ∈ A, b ∈ B}. We describe an efficient and robust implementation for the construction of Minkowski sums of polygons in IR using the convolution of the polygon boundaries. This method allows for faster computation of the sum of non-convex polygons in comparison to the widely-used methods for Minkowski-sum computation that d...

2004
GINO VAN DEN BERGEN

This paper presents a new algorithm for computing the hit point and normal of a ray and a general convex object. The algorithm is loosely based on the the Gilbert-Johnson-Keerthi algorithm for computing the distance between convex objects in the sense that it is applicable to the same family of convex objects and uses the same subalgorithm for computing the closest point of a simplex. Since thi...

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

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