The extensional viscosity is an important rheological characteristic of polymer melts. It is however not as frequently reported on as the shear viscosity. The extensional viscosity is of special interest when considering polymeric materials for foaming and film blowing processes. Here, the extensional (and shear) viscosity along with the melt strength and the tensile properties of the correspon...

The rheological behaviour of polymer melts and dilute polymer solutions in elongational flow have been extensively examined through experiments and theoretical predictions. However, an experimental study to understand the extensional rheological properties of polymer solutions in the semi-dilute regime is currently lacking in terms of a systematic examination of the effects of concentration and...

In this paper we propose a data source integration approach capable of uniformly handling different source formats, ranging from databases to XML documents and other semi-structured data. The proposed approach consists of two components, performing intensional and extensional integration, respectively; these are strictly coupled, since they use related models for representing intensional and ex...

It is proved that there is no structure of left (right) cancelative semigroup on [L]-dimensional universal space for the class of separable compact spaces of extensional dimension ≤ [L]. Besides, we note that the homeomorphism group of [L]-dimensional space whose nonempty open sets are universal for the class of separable compact spaces of extensional dimension ≤ [L] is totally disconnected.

The notions of simplicity and extensionality for coalgebras are generalized beyond Set and a study of the internal dynamics of extensional coalgebras yields the notion of unitary coalgebras. In some cases, unitary coalgebras include extensional ones. Under some reasonable circumstances, both notions of simplicity and extensionality agree. Other extensions of simplicity and extensionality are ∗−...

A graph G is said to be a set graph if it admits an acyclic orientation that is also extensional, in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the digraph representation of a hereditarily finite set. In this paper, we continue the study of set graphs and related topics, focusing on computational complexity as...