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.

Possible use of self-calibration to reduce systematic uncertainties in determining distance-redshift relation via gravitational radiation from merging binaries

By observing mergers of compact objects, future gravity wave experiments would measure the luminosity distance to a large number of sources to a high precision but not their redshifts. Given the directional sensitivity of an experiment, a fraction of such sources (gold plated) can be identified optically as single objects in the direction of the source. We show that if an approximate distance-redshift relation is known then it is possible to statistically resolve those sources that have multiple galaxies in the beam. We study the feasibility of using gold plated sources to iteratively resolve the unresolved sources, obtain the self-calibrated best possible distance-redshift relation and provide an analytical expression for the accuracy achievable. We derive the lower limit on the total number of sources that is needed to achieve this accuracy through self-calibration. We show that this limit depends exponentially on the beam width and give estimates for various experimental parameters representative of future gravitational wave experiments DECIGO and BBO.

Comparison of Multiclass SVM Classification Methods to Use in a Supportive System for Distance Relay Coordination

This paper aims at evaluating the methods of multiclass support vector machines (SVMs) for effective use in distance relay coordination. Also, it describes a strategy of supportive systems to aid the conventional protection philosophy in combating situations where protection systems have maloperated and/or information is missing and provide selective and secure coordinations. SVMs have considerable potential as zone classifiers of distance relay coordination. This typically requires a multiclass SVM classifier to effectively analyze/build the underlying concept between reach of different zones and the apparent impedance trajectory during fault. Several methods have been proposed for multiclass classification where typically several binary SVM classifiers are combined together. Some authors have extended binary SVM classification to one-step single optimization operation considering all classes at once. In this paper, one-step multiclass classification, one-against-all, and one-against-one multiclass methods are compared for their performance with respect to accuracy, number of iterations, number of support vectors, training, and testing time. The performance analysis of these three methods is presented on three data sets belonging to training and testing patterns of three supportive systems for a region and part of a network, which is an equivalent 526-bus system of the practical Indian Western grid.

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.

Comparative study of filter-bank mean-energy distance for automated segmentation of speech signals

This paper describes a method of automated segmentation of speech assuming the signal is continuously time varying rather than the traditional short time stationary model. It has been shown that this representation gives comparable if not marginally better results than the other techniques for automated segmentation. A formulation of the 'Bach' (music semitonal) frequency scale filter-bank is proposed. A comparative study has been made of the performances using Mel, Bark and Bach scale filter banks considering this model. The preliminary results show up to 80 % matches within 20 ms of the manually segmented data, without any information of the content of the text and without any language dependence. 'Bach' filters are seen to marginally outperform the other filters.

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.

A homozygous mutation in LTBP2 causes isolated microspherophakia

Microspherophakia is an autosomal-recessive congenital disorder characterized by small spherical lens. It may be isolated or occur as part of a hereditary systemic disorder, such as Marfan syndrome, autosomal dominant and recessive forms of Weill-Marchesani syndrome, autosomal dominant glaucoma–lens ectopia–microspherophakia–stiVness– shortness syndrome, autosomal dominant microspherophakia with hernia, and microspherophakia-metaphyseal dysplasia. The purpose of this study was to map and identify the gene for isolated microspherophakia in two consanguineous Indian families. Using a whole-genome linkage scan in one family, we identiWed a likely locus for microspherophakia (MSP1) on chromosome 14q24.1–q32.12 between markers D14S588 and D14S1050 in a physical distance of 22.76 Mb. The maximum multi-point lod score was 2.91 between markers D14S1020 and D14S606. The MSP1 candidate region harbors 110 reference genes. DNA sequence analysis of one of the genes, LTBP2, detected a homozygous duplication (insertion) mutation, c.5446dupC, in the last exon (exon 36) in aVected family members. This homozygous mutation is predicted to elongate the LTBP2 protein by replacing the last 6 amino acids with 27 novel amino acids. Microspherophakia in the second family did not map to this locus, suggesting genetic heterogeneity. The present study suggests a role for LTBP2 in the structural stability of ciliary zonules, and growth and development of lens.

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.

A homozygous mutation in LTBP2 causes isolated microspherophakia

Microspherophakia is an autosomal-recessive congenital disorder characterized by small spherical lens. It may be isolated or occur as part of a hereditary systemic disorder, such as Marfan syndrome, autosomal dominant and recessive forms of Weill-Marchesani syndrome, autosomal dominant glaucoma-lens ectopia-microspherophakia-stiffness-shortness syndrome, autosomal dominant microspherophakia with hernia, and microspherophakia-metaphyseal dysplasia. The purpose of this study was to map and identify the gene for isolated microspherophakia in two consanguineous Indian families. Using a whole-genome linkage scan in one family, we identified a likely locus for microspherophakia (MSP1) on chromosome 14q24.1-q32.12 between markers D14S588 and D14S1050 in a physical distance of 22.76 Mb. The maximum multi-point lod score was 2.91 between markers D14S1020 and D14S606. The MSP1 candidate region harbors 110 reference genes. DNA sequence analysis of one of the genes, LTBP2, detected a homozygous duplication (insertion) mutation, c.5446dupC, in the last exon (exon 36) in affected family members. This homozygous mutation is predicted to elongate the LTBP2 protein by replacing the last 6 amino acids with 27 novel amino acids. Microspherophakia in the second family did not map to this locus, suggesting genetic heterogeneity. The present study suggests a role for LTBP2 in the structural stability of ciliary zonules, and growth and development of lens.

Correlations between frequency of infra-red active vibrational modes and copper-oxygen distance in copper oxides. Application to superconductors

The infra-red spectra of a large number of ternary Cu(II) oxides with at least a quasi square-planar coordination of oxygen around the copper ions have been studied. The frequency of the bands with the highest frequency,v max, is found to correlate extremely well with the shortest Cu–O distance.v max increases at an impressive rate of sim20 cm–1 per 0.01 Å when the Cu–O distance becomes less than 1.97 Å, which is the Cu2+–O2– distance in square-planar CuO4 complexes as obtained from empirical ionic radii considerations. The marked sensitivity may be used as a ldquotitrationrdquo procedure not only to assign bands but also to obtain diagnostic information about local coordination in compounds derived, for example, from the YBa2Cu3O7–d structure such as LaCaBaCu3O7–d . The only example where this correlation fails is in the two-layer non-superconducting oxides derived from La2(Ca, Sr)Cu2O6. The significance of this result is discussed. The marked dependence of frequency on the bond-distance is qualitatively examined in terms of an increased electron-phonon coupling to account for the observed tendency of the superconducting transition temperature to go through a maximum as the average basal plane Cu–O distance is decreased.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

Metabolome based reaction graphs of M.tuberculosis and M.leprae: A comparative network analysis

Background. Several types of networks, such as transcriptional, metabolic or protein-protein interaction networks of various organisms have been constructed, that have provided a variety of insights into metabolism and regulation. Here, we seek to exploit the reaction-based networks of three organisms for comparative genomics. We use concepts from spectral graph theory to systematically determine how differences in basic metabolism of organisms are reflected at the systems level and in the overall topological structures of their metabolic networks. Methodology/Principal Findings. Metabolome-based reaction networks of Mycobacterium tuberculosis, Mycobacterium leprae and Escherichia coli have been constructed based on the KEGG LIGAND database, followed by graph spectral analysis of the network to identify hubs as well as the sub-clustering of reactions. The shortest and alternate paths in the reaction networks have also been examined. Sub-cluster profiling demonstrates that reactions of the mycolic acid pathway in mycobacteria form a tightly connected sub-cluster. Identification of hubs reveals reactions involving glutamate to be central to mycobacterial metabolism, and pyruvate to be at the centre of the E. coli metabolome. The analysis of shortest paths between reactions has revealed several paths that are shorter than well established pathways. Conclusions. We conclude that severe downsizing of the leprae genome has not significantly altered the global structure of its reaction network but has reduced the total number of alternate paths between its reactions while keeping the shortest paths between them intact. The hubs in the mycobacterial networks that are absent in the human metabolome can be explored as potential drug targets. This work demonstrates the usefulness of constructing metabolome based networks of organisms and the feasibility of their analyses through graph spectral methods. The insights obtained from such studies provide a broad overview of the similarities and differences between organisms, taking comparative genomics studies to a higher dimension.