Optimal multicommodity flow through the complete graph with random edge capacities

We consider a multicommodity flow problem on a complete graph whose edges have random, independent, and identically distributed capacities. We show that, as the number of nodes tends to infinity, the maximumutility, given by the average of a concave function of each commodity How, has an almost-sure limit. Furthermore, the asymptotically optimal flow uses only direct and two-hop paths, and can be obtained in a distributed manner.

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.

Giant planar Hall effect in pulsed laser deposited permalloy films

Ni80Fe20 thin films with high orientation were grown on Si(1 0 0) using pulsed laser ablation. The anisotropic magnetoresistance (AMR) and the planar Hall measurements show a 2.5% resistance anisotropy and a 45% planar Hall voltage change for magnetic field sweep of 10 Oe. The planar Hall sensitivity dR/dH was found to be 900 Omega T-1 compared with a previously reported maximum of 340 Omega T-1 in the same system.Also these films are found to withstand repeated thermal cycling up to 110 degrees C and the Hall sensitivity remains constant within this temperature range. This combination of properties makes the system highly suitable for low magnetic field sensors, particularly in geomagnetic and biosensor applications. To elucidate this, we have demonstrated that these sensors are sensitive to Earth's magnetic field. These results are compared with the sputter deposited films which have a very low AMR and planar Hall voltage change as compared with the films grown by PLD. The possible reasons for these contrasting characteristics are also discussed.

Electronic structure of square planar CuO46− clusters

The results of spin-polarized MSXagr calculations show that the ground state of the CuO 4 6– cluster is essentially non-magnetic in spite of odd number of electrons in the system for short Cu–O distances (1.90 Å) as found in the highT c superconductors. This arises due to the fact that the unpaired electron resides in a molecular orbital with primarily oxygen 3s character. The stability of this molecular orbital is found to be sensitive to the cluster geometry and thus, increase in Cu–O distance (as well as other changes affecting oxygen-oxygen distance) tend to favour a magnetic state. From these calculations we have also estimated the Coulomb correlation strength within the Cu 3d to be about 5.3 eV.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-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. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

Simulation and graph mining tools for improving gene mapping efficiency

Gene mapping is a systematic search for genes that affect observable characteristics of an organism. In this thesis we offer computational tools to improve the efficiency of (disease) gene-mapping efforts. In the first part of the thesis we propose an efficient simulation procedure for generating realistic genetical data from isolated populations. Simulated data is useful for evaluating hypothesised gene-mapping study designs and computational analysis tools. As an example of such evaluation, we demonstrate how a population-based study design can be a powerful alternative to traditional family-based designs in association-based gene-mapping projects. In the second part of the thesis we consider a prioritisation of a (typically large) set of putative disease-associated genes acquired from an initial gene-mapping analysis. Prioritisation is necessary to be able to focus on the most promising candidates. We show how to harness the current biomedical knowledge for the prioritisation task by integrating various publicly available biological databases into a weighted biological graph. We then demonstrate how to find and evaluate connections between entities, such as genes and diseases, from this unified schema by graph mining techniques. Finally, in the last part of the thesis, we define the concept of reliable subgraph and the corresponding subgraph extraction problem. Reliable subgraphs concisely describe strong and independent connections between two given vertices in a random graph, and hence they are especially useful for visualising such connections. We propose novel algorithms for extracting reliable subgraphs from large random graphs. The efficiency and scalability of the proposed graph mining methods are backed by extensive experiments on real data. While our application focus is in genetics, the concepts and algorithms can be applied to other domains as well. We demonstrate this generality by considering coauthor graphs in addition to biological graphs in the experiments.

On the uniformity of film thickness on rotating spherical substrates on a planar work holder

Curves for the uniformity in film thickness on spherical substrates are drawn for various geometries. The optimum source-to-substrate height for maximum uniformity of the film thickness is determined. These data are approximated to achieve uniform thickness on a large number of small planar substrates loaded on a large spherical substrate holder, the appropriate geometry being selected on the basis of the radius of curvature of the substrate holder.

Macroscopic model of city traffic using bond graph modelling

Modelling of city traffic involves capturing of all the dynamics that exist in real-time traffic. Probabilistic models and queuing theory have been used for mathematical representation of the traffic system. This paper proposes the concept of modelling the traffic system using bond graphs wherein traffic flow is based on energy conservation. The proposed modelling approach uses switched junctions to model complex traffic networks. This paper presents the modelling, simulation and experimental validation aspects.

Time-Dependent Dynamics of a Planar Galaxy Model

Time-dependent models of collisionless stellar systems with harmonic potentials allowing for an essentially exact analytic description have recently been described. These include oscillating spheres and spheroids. This paper extends the analysis to time-dependent elliptic discs. Although restricted to two space dimensions, the systems are richer in that their parameters form a 10-dimensional phase space (in contrast to six for the earlier models). Apart from total energy and angular momentum, two additional conserved quantities emerge naturally. These can be chosen as the areas of extremal sections of the ellipsoidal region of phase space occupied by the system (their product gives the conserved volume). The present paper describes the construction of these models. An application to a tidal encounter is given which allows one to go beyond the impulse approximation and demonstrates the effects of rotation of the perturbed system on energy and angular-momentum transfer. The angular-momentum transfer is shown to scale inversely as the cube of the encounter velocity for an initial configuration of the perturbed galaxy with zero quadrupole moment.

Padé approach to potential transients: Part 1. Electron transfer without and with coupling to first-order homogeneous reactions at planar electrodes

Potential transients are obtained by using “Padé approximants” (an accurate approximation procedure valid globally — not just perturbatively) for all amplitudes of concentration polarization and current densities. This is done for several mechanistic schemes under constant current conditions. We invert the non-linear current-potential relationship in the form (using the Lagrange or the Ramanujan method) of power series appropriate to the two extremes, namely near reversible and near irreversible. Transforming both into the Pad́e expressions, we construct the potential-time profile by retaining whichever is the more accurate of the two. The effectiveness of this method is demonstrated through illustrations which include couplings of homogeneous chemical reactions to the electron-transfer step.

Analysis of the evanescent field coupling between a fiber and a planar waveguide using the explicit finite difference method with a nonuniform mesh (Journal Paper)

We investigate an optical waveguide system consisting of an unclad fiber core suspended at a constant distance parallel to the surface of a planar waveguide. The coupling and propagation of light in the combined system is studied using the three-dimensional explicit finite difference beam propagation method with a nonuniform mesh configuration. The power loss in the fiber and the field distribution in the waveguide are studied as a function of various parameters, such as index changes, index profile, and propagation distance, for the combined system.