Solutions of Boundary Layer Equations Governing Free Convective and Magnetohydrodynamic Flows through Parametric Differentiation

In der vorliegenden Arbeit wird die Methode der parametrischen Differentiation angewendet, um ein System nichtlinearer Gleichungen zu lösen, das zwei- und dreidimensionale freie, konvektive Grenzschichströmungen bzw. eine zweidimensionale magnetohydrodynamische Grenzschichtströmung beherrscht. Der Hauptvorteil dieser Methode besteht darin, daß die nichlinearen Gleichungen auf lineare reduziert werden und die Nichtlinearität auf ein System von Gleichungen erster Ordnung beschränkt wird, das, verglichen mit den ursprünglichen Nichtlinearen Gleichungen, viel leichter gelöst werden kann. Ein anderer Vorzug der Methode ist, daß sie es ermöglicht, die Lösung von einer bekannten, zu einem bestimmten Parameterwert gehörigen Lösung aus durch schrittweises Vorgehen die Lösung für den gesamten Parameterbereich zu erhalten. Die mit dieser Methode gewonnenen Ergebnisse stimmen gut mit den entsprechenden, mit anderen numerischen Verfahren erzielten überein.

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

A unit cube in k dimensions (k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), a(i) + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of C can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes. An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step. We give an O(bw . n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Delta) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Delta) bandwidth. Thus we have: 1. cub(G) <= 3 Delta - 1, if G is an AT-free graph. 2. cub(G) <= 2 Delta + 1, if G is a circular-arc graph. 3. cub(G) <= 2 Delta, if G is a cocomparability graph. Also for these graph classes, there axe constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Delta) width. We can thus generate the cube representation of such graphs in O(Delta) dimensions in polynomial time.

Free vibration and wave propagation analysis of uniform and tapered rotating beams using spectrally formulated finite elements

This paper presents a formulation of an approximate spectral element for uniform and tapered rotating Euler-Bernoulli beams. The formulation takes into account the varying centrifugal force, mass and bending stiffness. The dynamic stiffness matrix is constructed using the weak form of the governing differential equation in the frequency domain, where two different interpolating functions for the transverse displacement are used for the element formulation. Both free vibration and wave propagation analysis is performed using the formulated elements. The studies show that the formulated element predicts results, that compare well with the solution available in the literature, at a fraction of the computational effort. In addition, for wave propagation analysis, the element shows superior convergence. (C) 2007 Elsevier Ltd. All rights reserved.

Synergistic effects of UdgB and Ung in mutation prevention and protection against commonly encountered DNA damaging agents in Mycobacterium smegmatis

The incorporation of dUMP during replication or the deamination of cytosine in DNA results in the occurrence of uracils in genomes. To maintain genomic integrity, uracil DNA glycosylases (UDGs) excise uracil from DNA and initiate the base-excision repair pathway. Here, we cloned, purified and biochemically characterized a family 5 UDG, UdgB, from Mycobacterium smegmatis to allow us to use it as a model organism to investigate the physiological significance of the novel enzyme. Studies with knockout strains showed that compared with the wild-type parent, the mutation rate of the udgB(-) strain was approximately twofold higher, whereas the mutation rate of a strain deficient in the family 1 UDG (ung(-)) was found to be similar to 8.4-fold higher. Interestingly, the mutation rate of the double-knockout (ung(-)ludgB(-)) strain was remarkably high, at similar to 19.6-fold. While CG to TA mutations predominated in the ung(-) and ung(-)/udgb(-) strains, AT to GC mutations were enhanced in the udgB(-) strain. The ung(-)/udgB(-) strain was notably more sensitive to acidified nitrite and hydrogen peroxide stresses compared with the single knockouts (ung(-) or udgB(-)). These observations reveal a synergistic effect of UdgB and Ung in DNA repair, and could have implications for the generation of attenuated strains of Mycobacterium tuberculosis.

Nonaxisymmetric unsteady motion over a rotating disk in the presence of free convection and magnetic field

The nonaxisymmetric unsteady motion produced by a buoyancy-induced cross-flow of an electrically conducting fluid over an infinite rotating disk in a vertical plane and in the presence of an applied magnetic field normal to the disk has been studied. Both constant wall and constant heat flux conditions have been considered. It has been found that if the angular velocity of the disk and the applied magnetic field squared vary inversely as a linear function of time (i.e. as (1??t*)?1, the governing Navier-Stokes equation and the energy equation admit a locally self-similar solution. The resulting set of ordinary differential equations has been solved using a shooting method with a generalized Newton's correction procedure for guessed boundary conditions. It is observed that in a certain region near the disk the buoyancy induced cross-flow dominates the primary von Karman flow. The shear stresses induced by the cross-flow are found to be more than these of the primary flow and they increase with magnetic parameter or the parameter ? characterizing the unsteadiness. The velocity profiles in the x- and y-directions for the primary flow at any two values of the unsteady parameter ? cross each other towards the edge of the boundary layer. The heat transfer increases with the Prandtl number but reduces with the magnetic parameter.

Role of free valences and spin densities on the migrating atom in location of saddle points in radical-exchange reactions

The principle of the conservation of bond orders during radical-exchange reactions is examined using Mayer's definition of bond orders. This simple intuitive approximation is not valid in a quantitative sense. Ab initio results reveal that free valences (or spin densities) develop on the migrating atom during reactions. For several examples of hydrogen-transfer reactions, the sum of the reaction coordinate bond orders in the transition state was found to be 0.92 +/- 0.04 instead of the theoretical 1.00 because free valences (or spin densities) develop on the migrating atom during reactions. It is shown that free valence is almost equal to the square of the spin density on the migrating hydrogen atom and the maxima in the free valence (or spin density) profiles coincide (or nearly coincide) with the saddle points in the corresponding energy profiles.

Some results on the reconstruction problems. p-claw-free, chordal, and p4-reducible graphs

A claw is an induced subgraph isomorphic to K-1,K-3. The claw-point is the point of degree 3 in a claw. A graph is called p-claw-free when no p-cycle has a claw-point on it. It is proved that for p greater than or equal to 4, p-claw-free graphs containing at least one chordless p-cycle are edge reconstructible. It is also proved that chordal graphs are edge reconstructible. These two results together imply the edge reconstructibility of claw-free graphs. A simple proof of vertex reconstructibility of P-4-reducible graphs is also presented. (C) 1995 John Wiley and Sons, Inc.

Digital Dead Time Logic and Protection Circuitry for PWM Voltage Source Converters

Power semiconductor devices have finite turn on and turn off delays that may not be perfectly matched. In a leg of a voltage source converter, the simultaneous turn on of one device and the turn off of the complementary device will cause a DC bus shoot through, if the turn off delay is larger than the turn on delay time. To avoid this situation it is common practice to blank the two complementary devices in a leg for a small duration of time while switching, which is called dead time. This paper proposes a logic circuit for digital implementation required to control the complementary devices of a leg independently and at the same time preventing cross conduction of devices in a leg, and while providing accurate and stable dead time. This implementation is based on the concept of finite state machines. This circuit can also block improper PWM pulses to semiconductor switches and filters small pulses notches below a threshold time width as the narrow pulses do not provide any significant contribution to average pole voltage, but leads to increased switching loss. This proposed dead time logic has been implemented in a CPLD and is implemented in a protection and delay card for 3- power converters.

Path-integral formulation for Levy flights: Evaluation of the propagator for free, linear, and harmonic potentials in the over- and underdamped limits

Levy flights can be described using a Fokker-Planck equation, which involves a fractional derivative operator in the position coordinate. Such an operator has its natural expression in the Fourier domain. Starting with this, we show that the solution of the equation can be written as a Hamiltonian path integral. Though this has been realized in the literature, the method has not found applications as the path integral appears difficult to evaluate. We show that a method in which one integrates over the position coordinates first, after which integration is performed over the momentum coordinates, can be used to evaluate several path integrals that are of interest. Using this, we evaluate the propagators for (a) free particle, (b) particle subjected to a linear potential, and (c) harmonic potential. In all the three cases, we have obtained results for both overdamped and underdamped cases. DOI: 10.1103/PhysRevE.86.061105

The relationship between classification of multi-domain proteins using an alignment-free approach and their functions: a case study with immunoglobulins

Establishing functional relationships between multi-domain protein sequences is a non-trivial task. Traditionally, delineating functional assignment and relationships of proteins requires domain assignments as a prerequisite. This process is sensitive to alignment quality and domain definitions. In multi-domain proteins due to multiple reasons, the quality of alignments is poor. We report the correspondence between the classification of proteins represented as full-length gene products and their functions. Our approach differs fundamentally from traditional methods in not performing the classification at the level of domains. Our method is based on an alignment free local matching scores (LMS) computation at the amino-acid sequence level followed by hierarchical clustering. As there are no gold standards for full-length protein sequence classification, we resorted to Gene Ontology and domain-architecture based similarity measures to assess our classification. The final clusters obtained using LMS show high functional and domain architectural similarities. Comparison of the current method with alignment based approaches at both domain and full-length protein showed superiority of the LMS scores. Using this method we have recreated objective relationships among different protein kinase sub-families and also classified immunoglobulin containing proteins where sub-family definitions do not exist currently. This method can be applied to any set of protein sequences and hence will be instrumental in analysis of large numbers of full-length protein sequences.