167 resultados para CIRCULAR CYLINDER
Resumo:
The influence of an eccentrically inserted catheter on the peristaltic pumping in a tube is investigated under long wavelength, low Reynolds number assumptions. The radially asymmetric deformation of the wall arising through an eccentrically inserted catheter is taken into consideration by choosing an appropriate bipolar coordinate system. The effect of the position and size of the catheter on pumping characteristics is studied. The best performance of pumping is noticed at a certain position of the catheter. The size of the catheter, when placed eccentrically, alters the pressure signature significantly inside the bolus, unlike the concentric case discussed by Lykoudis and Roos (1971). Further, the maximum pressure rise in one period of the peristaltic wave is observed to decrease with an increase in the eccentricity.
Resumo:
Peristaltic motion of two immiscible viscous incompressible fluids in a circular tube is studied in pumping and copumping ranges under long-wavelength and low-Reynolds-number assumptions. The effect of the peripheral-layer viscosity on the time-averaged flux and the mechanical efficiency is studied. The formation and growth of the trapping zone in the core and the peripheral layer are explained. It is observed that the bolus volume in the peripheral layer increases with an increase in the viscosity ratio. The limits of the time-averaged flux (Q) over bar for trapping in the core are obtained. The trapping observed in the peripheral layer decreases in size with an increase in (Q) over bar but never disappears. The development of the complete trapping of the core fluid by the peripheral-layer fluid with an increase in the time-averaged flux is demonstrated. The effect of peripheral-layer viscosity on the reflux layer is investigated. It is also observed that the reflux occurs in the entire pumping range for all viscosity ratios and it is absent in the entire range of copumping.
Resumo:
A 48 d.o.f., four-noded quadrilateral laminated composite shell finite element is particularised to a sector finite element and is used for the large deformation analysis of circular composite laminated plates. The strain-displacement relationships for the sector element are obtained by reducing those of the quadrilateral shell finite element by substituting proper values for the geometric parameters. Subsequently, the linear and tangent stiffness matrices are formulated using conventional methods. The Newton-Raphson method is employed as the nonlinear solution technique. The computer code developed is validated by solving an isotropic case for which results are available in the literature. The method is then applied to solve problems of cylindrically orthotropic circular plates. Some of the results of cylindrically orthotropic case are compared with those available in the literature. Subsequently, application is made to the case of laminated composite circular plates having different lay-up schemes. The computer code can handle symmetric/unsymmetric lay-up schemes. The large displacement analysis is useful in estimating the damage in composite plates caused by low-velocity impact.
Resumo:
A circular array of Piezoelectric Wafer Active Sensor (PWAS) has been employed to detect surface damages like corrosion using lamb waves. The array consists of a number of small PWASs of 10 mm diameter and 1 mm thickness. The advantage of a circular array is its compact arrangement and large area of coverage for monitoring with small area of physical access. Growth of corrosion is monitored in a laboratory-scale set-up using the PWAS array and the nature of reflected and transmitted Lamb wave patterns due to corrosion is investigated. The wavelet time-frequency maps of the sensor signals are employed and a damage index is plotted against the damage parameters and varying frequency of the actuation signal (a windowed sine signal). The variation of wavelet coefficient for different growth of corrosion is studied. Wavelet coefficient as function of time gives an insight into the effect of corrosion in time-frequency scale. We present here a method to eliminate the time scale effect which helps in identifying easily the signature of damage in the measured signals. The proposed method becomes useful in determining the approximate location of the corrosion with respect to the location of three neighboring sensors in the circular array. A cumulative damage index is computed for varying damage sizes and the results appear promising.
Resumo:
In this paper we propose a concept and report experimental results based on a circular array of Piezoelectric Wafer Active Sensors (PWASs) for rapid localization and parametric identification of corrosion type damage in metallic plates. Implementation of this circular array of PWASs combines the use of ultrasonic Lamb wave propagation technique and an algorithm based on symmetry breaking in the signal pattern to locate and monitor the growth of a corrosion pit on a metallic plate. Wavelet time-frequency maps of the sensor signals are employed to obtain an insight regarding the effect of corrosion growth on the Lamb wave transmission in time-frequency scale. We present here a method to eliminate the time scale, which helps in identifying easily the signature of damage in the measured signals. The proposed method becomes useful in determining the approximate location of the damage with respect to the location of three neighboring sensors in the circular array. A cumulative damage index is computed from the wavelet coefficients for varying damage sizes and the results appear promising. Damage index is plotted against the damage parameters for frequency sweep of the excitation signal (a windowed sine signal). Results of corrosion damage are compared with circular holes of various sizes to demonstrate the applicability of present method to different types of damage. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
We propose a new abstract domain for static analysis of executable code. Concrete states are abstracted using circular linear progressions (CLPs). CLPs model computations using a finite word length as is seen in any real life processor. The finite abstraction allows handling overflow scenarios in a natural and straight-forward manner. Abstract transfer functions have been defined for a wide range of operations which makes this domain easily applicable for analyzing code for a wide range of ISAs. CLPs combine the scalability of interval domains with the discreteness of linear congruence domains. We also present a novel, lightweight method to track linear equality relations between static objects that is used by the analysis to improve precision. The analysis is efficient, the total space and time overhead being quadratic in the number of static objects being tracked.
Resumo:
A k-dimensional box is a Cartesian product R(1)x...xR(k) where each R(i) is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. That is, two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a graph that can be represented as the intersection graph of arcs on a circle. We show that if G is a circular arc graph which admits a circular arc representation in which no arc has length at least pi(alpha-1/alpha) for some alpha is an element of N(>= 2), then box(G) <= alpha (Here the arcs are considered with respect to a unit circle). From this result we show that if G has maximum degree Delta < [n(alpha-1)/2 alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. We also demonstrate a graph having box(G) > alpha but with Delta = n (alpha-1)/2 alpha + n/2 alpha(alpha+1) + (alpha+2). For a proper circular arc graph G, we show that if Delta < [n(alpha-1)/alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. Let r be the cardinality of the minimum overlap set, i.e. the minimum number of arcs passing through any point on the circle, with respect to some circular arc representation of G. We show that for any circular arc graph G, box(G) <= r + 1 and this bound is tight. We show that if G admits a circular arc representation in which no family of k <= 3 arcs covers the circle, then box(G) <= 3 and if G admits a circular arc representation in which no family of k <= 4 arcs covers the circle, then box(G) <= 2. We also show that both these bounds are tight.