BACKGROUND Nasal douching is common practice in treatment of chronic sinusitis and after endoscopic sinus surgery. Current nasal delivery techniques show inconsistent sinus penetration. The aim of this study was to compare sinonasal penetration of nasal douching to an optimized nasal nebulizer in an operated cadaver model. METHODS Fourteen preserved cadavers were used receiving complete sphen...

In this paper, effects of critical parameters, namely initial gap, squeezing speed and applied current were statistically investigated on the mechanical behaviour of MR fluid in squeeze mode. A set of 17 experiments was designed using Design Expert 7 software to gather data from response surface methodology (RSM). The responses in terms of compression modulus were then calculated. An MRF132-DG ...

The mechanism for the diffusion of vinyl bromide (VB) through the nonporous van der Waals organic solid of p-tert-butylcalix[4]arene (tBC) is examined by molecular mechanics calculations. In a "squeeze" mechanism, a VB molecule passes through the interstitial space in the rim regions of tBC bowls, after the partial filling of nearby inclusion sites, and couples with the both the rotation of but...

We present a method for generating local orthogonal bases on arbitrary partitions of R from a given local orthogonal shift-invariant basis via what we call a squeeze map. We give necessary and suÆcient conditions for a squeeze map to generate a non-uniform basis that preserves any smoothness and/or accuracy (polynomial reproduction) of the shift-invariant basis. When the shift-invariant basis h...

The hexagonal bipyramid fractal is a fractal in three dimensional space, which has fractal dimension two and which has six square projections. We consider its 2nd level approximation model, which is composed of 81 hexagonal bipyramid pieces. When this object is looked at from each of the 12 directions with square appearances, the pieces form a 9× 9 grid of squares which is just the grid of the ...

Minimal acyclic deterministic finite automata (ADFAs) can be used as a compact representation of finite string sets with fast access time. Creating them with traditional algorithms of DFA minimization is a resource hog when a large collection of strings is involved. This paper aims to popularize an efficient but little known algorithm for creating minimal ADFAs recognizing a finite language, in...