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

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

2011
María Arévalo-Villena Mercedes Fernández Jesús López Ana Briones

Pectinases are used in Enology for some different utilities. Enzymatic preparations from moulds are a mixed of different enzymes with strong and unspecific activities. Some Saccharomyces cerevisiae produce pectinases which can be used instead of commercial preparations. The objectives of this work were to study the enzyme secretion by one Saccharomyces cerevisiae (CECT 11783) for growing on gra...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد شاهرود - دانشکده پزشکی 1390

nitric oxide (no) is a small molecule synthesized by most of mammalian cells with diverse biological activities including vasodilatation, host defense and wound healing. impaired wound healing is a common occurrence among diabetics and patients receiving glucocorticoid therapy. on the other hand the application of laser in biomedical area have been increased. thus, the current studies were desi...

Journal: :Glasnik zaštite bilja 2022

Wine sensory testing is carried out by assessors who are usually selected and prepared depending on the test type, their skills may vary various factors. Expert wine should have superior evaluation abilities, an expert grape knowledge level but even more assessment competence. The aim of this research was to competencies certified Croatian using a less-familiar descriptive methodology with no p...

2002
Petra Hansson

In this paper, results from a perception experiment on perceived prosodic boundary strength in spontaneous speech are presented. The analysis of the listeners’ responses reveals a good agreement in rating the strength of prosodic phrase boundaries on a visual analogue scale (VAS), and a strong correlation between perceived boundary strength and pause duration.

2015
Yan Yan Gregory S. Chirikjian

This paper makes three original contributions: (1) Explicit closed-form parametric formulas for the boundary of the Minkowski sum and difference of two arbitrarily oriented solid ellipsoids in n-dimensional Euclidean space are presented; (2) Based on this, new closed-form lower and upper bounds for the volume contained in these Minkowski sums and differences are derived in the 2D and 3D cases a...

2013
Yoshinori Aono

We investigate a lattice construction method for the Coppersmith technique for finding small solutions of a modular equation. We consider its variant for simultaneous equations and propose a method to construct a lattice by combining lattices for solving single equations. As applications, we consider a new RSA cryptanalyses. Our algorithm can factor an RSA modulus from l ≥ 2 pairs of RSA public...

Journal: :Discrete & Computational Geometry 2007
Komei Fukuda Christophe Weibel

The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes called perfectly centered and the combinatorial properties of the Minkowski sum with their own dual. In particular, we have a characterization of faces of the sum in terms of the face lattice of a given perfectly centered polytope. Exact face coun...

2017
Michael Trimmel Karin Trimmel

Objective: A direct comparison of different kinds of scale formats of ratings of comfort and of mood states as well as their relation to the cardiovascular response was the objective. It was expected that activation-related scales are associated with physiological measures and that comfort scales and ratings of mood states would give complementary information on the impact of environmental cond...

2015
Ranko Lazic Sylvain Schmitz

Rackoff’s small witness property for the coverability problem is the standard means to prove tight upper bounds in vector addition systems (VAS) and many extensions. We show how to derive the same bounds directly on the computations of the VAS instantiation of the generic backward coverability algorithm. This relies on a dual view of the algorithm using ideal decompositions of downwards-closed ...

2010
Evan Behar Jyh-Ming Lien

We propose a new method for computing the 2-d Minkowski sum of non-convex polygons. Our method is convolution based. The main idea is to use the reduced convolution and filter the boundary by using the topological properties of the Minkowski sum. The main benefit of this proposed approach is from the fact that, in most cases, the complexity of the complete convolution is much higher than the co...

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

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