On compressible boundary layer on a flat plate with uniform suction

A quartic profile in terms of the normal distance from the wall has been taken and coefficients are evaluated by satisfying one more boundary condition on the wall than the usual one. By doing so, the limitations about the Reynolds number of the quartic profile adopted by Lew (1949) has been removed. The Kármán (1921) Momentum Integral Equation has been used to evaluate the various characteristics of the flow. A comparative study of Lew's quartic profile and exponential profile together with the quartic profile of the present paper has been undertaken and the graphs for the various characteristics of the flow for a number of Mach numbers and suction coefficients have been drawn. At the end, certain conclusions of general nature about the velocity profiles have been recorded.

Approximation of solutions to fractional integral equation

In this paper we shall study a fractional integral equation in an arbitrary Banach space X. We used the analytic semigroups theory of linear operators and the fixed point method to establish the existence and uniqueness of solutions of the given problem. We also prove the existence of global solution. The existence and convergence of the Faedo–Galerkin solution to the given problem is also proved in a separable Hilbert space with some additional assumptions on the operator A. Finally we give an example to illustrate the applications of the abstract results.

Anti-windup Schemes for Proportional Integral and Proportional Resonant Controller

Problems like windup or rollover arise in a PI controller working under saturation. Hence anti-windup schemes are necessary to minimize performance degradation.Similar situation may occur in a Proportional Resonant(PR)controller in the presence of a sustained error input.Several methods can be employed based on existing knowledge on PI controller to counter this problem.In this paper few such schemes are proposed and implemented in FPGA and MATLAB and from the obtained results their possible use and limitations have been studied.

A new class of separators and planarity of chordal graphs

We introduce a new class of clique separators, called base sets, for chordal graphs. Base sets of a chordal graph closely reflect its structure. We show that the notion of base sets leads to structural characterizations of planar k-trees and planar chordal graphs. Using these characterizations, we develop linear time algorithms for recognizing planar k-trees and planar chordal graphs. These algorithms are extensions of the Lexicographic_Breadth_First_Search algorithm for recognizing chordal graphs and are much simpler than the general planarity checking algorithm. Further, we use the notion of base sets to prove the equivalence of hamiltonian 2-trees and maximal outerplanar graphs.

On the complexity of finding stopping set size in Tanner Graphs

The problem of determining whether a Tanner graph for a linear block code has a stopping set of a given size is shown to be NT-complete.

Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs

Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using iterative decoding on the Tanner graph T when data is transmitted across a binary erasure channel using the code C. We show that the problem of finding the stopping distance of a Tanner graph is hard to approximate within any positive constant approximation ratio in polynomial time unless P = NP. It is also shown as a consequence that there can be no approximation algorithm for the problem achieving an approximation ratio of 2(log n)(1-epsilon) for any epsilon > 0 unless NP subset of DTIME(n(poly(log n))).

Computing complete test graphs for hierarchical systems

Conformance testing focuses on checking whether an implementation. under test (IUT) behaves according to its specification. Typically, testers are interested it? performing targeted tests that exercise certain features of the IUT This intention is formalized as a test purpose. The tester needs a "strategy" to reach the goal specified by the test purpose. Also, for a particular test case, the strategy should tell the tester whether the IUT has passed, failed. or deviated front the test purpose. In [8] Jeron and Morel show how to compute, for a given finite state machine specification and a test purpose automaton, a complete test graph (CTG) which represents all test strategies. In this paper; we consider the case when the specification is a hierarchical state machine and show how to compute a hierarchical CTG which preserves the hierarchical structure of the specification. We also propose an algorithm for an online test oracle which avoids a space overhead associated with the CTG.

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Let G - (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate (delta) over cap (u, v) of the actual distance d( u, v) between u, v is an element of V is said to be of stretch t if and only if delta(u, v) <= (delta) over cap (u, v) <= t . delta(u, v). Computing all-pairs small stretch distances efficiently ( both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel, and generic scheme for all-pairs approximate shortest paths. Using this scheme and some new ideas and tools, we design faster algorithms for all-pairs t-stretch distances for a whole range of stretch t, and we also answer an open question posed by Thorup and Zwick in their seminal paper [J. ACM, 52 (2005), pp. 1-24].

Constructing Reeb Graphs using Cylinder Maps

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Arcs in the Reeb graph are computed in the second step using a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The algorithm is also able to handle non-manifold domains.

Algorithms for Colouring Random k-colourable Graphs

The k-colouring problem is to colour a given k-colourable graph with k colours. This problem is known to be NP-hard even for fixed k greater than or equal to 3. The best known polynomial time approximation algorithms require n(delta) (for a positive constant delta depending on k) colours to colour an arbitrary k-colourable n-vertex graph. The situation is entirely different if we look at the average performance of an algorithm rather than its worst-case performance. It is well known that a k-colourable graph drawn from certain classes of distributions can be ii-coloured almost surely in polynomial time. In this paper, we present further results in this direction. We consider k-colourable graphs drawn from the random model in which each allowed edge is chosen independently with probability p(n) after initially partitioning the vertex set into ii colour classes. We present polynomial time algorithms of two different types. The first type of algorithm always runs in polynomial time and succeeds almost surely. Algorithms of this type have been proposed before, but our algorithms have provably exponentially small failure probabilities. The second type of algorithm always succeeds and has polynomial running time on average. Such algorithms are more useful and more difficult to obtain than the first type of algorithms. Our algorithms work as long as p(n) greater than or equal to n(-1+is an element of) where is an element of is a constant greater than 1/4.

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.

Studies of cryotreatment on the performance of integral diaphragm pressure transducers for space application

The integral diaphragm pressure transducers machined out of precipitation hardened martensite stainless steel (APX4) are widely used for propellant pressure measurements in space applications. These transducers are expected to exhibit dimensional stability and linearity for their entire useful life. These vital factors are very critical for the reliable performance and dependability of the pressure transducers. However, these transducers invariably develop internal stresses during various stages of machining. These stresses have an adverse effect on the performance of the transducers causing deviation from linearity. In order to eliminate these possibilities, it was planned to cryotreat the machined transducers to improve both the long-term linearity and dimensional stability. To study these effects, an experimental cryotreatment unit was designed and developed based on the concept of indirect cooling using the concept of cold nitrogen gas forced closed loop convection currents. The system has the capability of cryotreating large number of samples for varied rates of cooling, soaking and warm-up. After obtaining the initial levels of residual stress and retained austenite using X-ray diffraction techniques, the pressure transducers were cryotreated at 98 K for 36 h. Immediately after cryotreatment, the transducers were tempered at 510 degrees C for 3 h in vacuum furnace. Results after cryo treatment clearly indicated significant reduction in residual stress levels and conversion of retained austenite to martensite. These changes have brought in improvements in long term zero drift and dimensional stability. The cryotreated pressure transducers have been incorporated for actual space applications. (c) 2010 Published by Elsevier Ltd.