نتایج جستجو برای: rheological characterization

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

A. Tohidi M. Shokrpour S. M. S. M. Hosseinalipour

The motivation for this work is to propose a first thorough review of dough rheological models used in numerical applications. Although many models have been developed to describe dough rheological characteristics, few of them are employed by researchers in numerical applications. This article reviews them in detail and attempts to provide new insight into the use of dough rheological models.

Journal: :The European respiratory journal 1998
M King

Respiratory tract mucus is a viscoelastic gel, the rheological properties of which are determined mainly by its content of mucous glycoproteins and water. The rheology and quantity of mucus, in concert with ciliary factors, are the major determinants of mucociliary clearance. A wide range of animal models for studying the secretion and clearance of mucus are available. Ex vivo models, such as t...

2016
Nader Nciri Jeonghyun Kim Namho Kim Namjun Cho

Over the last decade, unexpected and sudden pavement failures have occurred in several provinces in South Korea. Some of these failures remain unexplained, further illustrating the gaps in our knowledge about binder chemistry. To prevent premature pavement distress and enhance road performance, it is imperative to provide an adequate characterization of asphalt. For this purpose, the current re...

2010
Mariano Pracella Vera Alvarez

The article is focused on analyzing the effect of functionalization and reactive processing on the morphological, thermal, rheological and mechanical properties of composites of isotactic polypropylene (PP), polystyrene (PS), poly(ethylene-vinyl acetate) (EVA), with cellulose fibers, hemp or oat as natural fillers. Both polymers and fibers were modified with bi-functional monomers (glycidyl met...

2006
Petr Šimeček

The paper shows that there is no finite set of forbidden minors which characterizes classes of independence models that are representable by Gaussian, discrete and binary distributions, respectively. In addition, a way to prove the nonexistence of a finite characterization for any other class of independence models is suggested. MSC 2000: 60A99, 68T30, 94A15

2015
Matthieu Dubarry Arnaud Devie

The contents of this report reflect the views of the authors, who are responsible for the facts and the accuracy of the information presented herein. This document is disseminated under the sponsorship of Centers Program in the interest of information exchange. UCF and the U.S. Government assumes no liability for the contents or use thereof.

Journal: :Australasian J. Combinatorics 2010
Y. M. Borse

In this paper, we obtain a forbidden-minor characterization of the class of binary gammoids M such that, for every pair of elements x, y of M, both the splitting matroid Mx,y and the element splitting matroid M ′ x,y are binary gammoids.

Journal: :Discrete Mathematics 2015
Premysl Holub Zdenek Ryjácek Ingo Schiermeyer

A connected edge-colored graphG is said to be rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors, and the rainbow connection number rc(G) ofG is the minimum number of colors that can make G rainbow-connected. We consider families F of connected graphs for which there is a constant kF such that every connected F-free graph G with...

Journal: :Order 2013
Michael K. Kinyon Jonathan Leech

Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of forbidden subalgebras. We also consider the subclass of strictly categorical skew lattices.

2012
Van Bang Le Dieter Rautenbach

We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratic-time algorithm that decides if a given interval graph admits such an intersection representation.

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

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