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.

Mean-field results of the multiple-band extended Hubbard model for the square-planar CuO2 lattice

We obtain metal-insulator phase diagrams at half-filling for the five-band extended Hubbard model of the square-planar CuO2 lattice treated within a Hartree-Fock mean-field approximation, allowing for spiral spin-density waves. We indicate the existence of an insulating phase (covalent insulator) characterized by strong covalency effects, not identified in the earlier Zaanen-Sawatzky-Allen phase diagram. While the insulating phase is always antiferromagnetic, we also obtain an antiferromagnetic metallic phase for a certain range of interaction parameters. Performing a nonperturbative calculation of J(eff), the in-plane antiferromagnetic interaction is presented as a function of the parameters in the model. We also calculate the band gap and magnetic moments at various sites and discuss critically the contrasting interpretation of the electronic structure of high-T(c) materials arising from photoemission and neutron-scattering experiments.

On the Nash-Williams′ Lemma in Graph Reconstruction Theory

A generalization of Nash-Williams′ lemma is proved for the Structure of m-uniform null (m − k)-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g., tournaments) is given. A type of Nash-Williams′ lemma is conjectured for the vertex reconstruction problem.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Study Of Acoustic Source Localization Algorithm For Planar Arrays

The source localization algorithms in the earlier works, mostly used non-planar arrays. If we consider scenarios like human-computer communication, or human-television communication where the microphones need to be placed on the computer monitor or television front panel, i.e we need to use the planar arrays. The algorithm proposed in 1], is a Linear Closed Form source localization algorithm (LCF algorithm) which is based on Time Difference of Arrivals (TDOAs) that are obtained from the data collected using the microphones. It assumes non-planar arrays. The LCF algorithm is applied to planar arrays in the current work. The relationship between the error in the source location estimate and the perturbation in the TDOAs is derived using first order perturbation analysis and validated using simulations. If the TDOAs are erroneous, both the coefficient matrix and the data matrix used for obtaining source location will be perturbed. So, the Total least squares solution for source localization is proposed in the current work. The sensitivity analysis of the source localization algorithm for planar arrays and non-planar arrays is done by introducing perturbation in the TDOAs and the microphone locations. It is shown that the error in the source location estimate is less when we use planar array instead of the particular non-planar array considered for same perturbation in the TDOAs or microphone location. The location of the reference microphone is proved to be important for getting an accurate source location estimate if we are using the LCF algorithm.

Exact N-Wave Solutions for the Non-Planar Burgers Equation

An exact representation of N-wave solutions for the non-planar Burgers equation u(t) + uu(x) + 1/2ju/t = 1/2deltau(xx), j = m/n, m < 2n, where m and n are positive integers with no common factors, is given. This solution is asymptotic to the inviscid solution for Absolute value of x < square-root (2Q0 t), where Q0 is a function of the initial lobe area, as lobe Reynolds number tends to infinity, and is also asymptotic to the old age linear solution, as t tends to infinity; the formulae for the lobe Reynolds numbers are shown to have the correct behaviour in these limits. The general results apply to all j = m/n, m < 2n, and are rather involved; explicit results are written out for j = 0, 1, 1/2, 1/3 and 1/4. The case of spherical symmetry j = 2 is found to be 'singular' and the general approach set forth here does not work; an alternative approach for this case gives the large time behaviour in two different time regimes. The results of this study are compared with those of Crighton & Scott (1979).

Planar triazinium cations from VO2+-assisted ring cyclizations: a remarkably efficient thiazole species for nuclear staining, PDT and anaerobic photocleavage of DNA

Planar triazinium cationic species, from VO2+-assisted cyclization of 1-(2-thiazolylazo)-2-naphthol, shows efficient DNA intercalative binding, visible light-induced anaerobic plasmid DNA photocleavage activity and photocytotoxicity in HeLa and MCF-7 cancer cells by an apoptotic pathway with selective localization of the compound in the nucleus as evidenced from the nuclear staining and confocal imaging.

Work fluctuations in an elastic dumbbell model of polymers in planar elongational flow

We use a path-integral approach to calculate the distribution P(w, t) of the fluctuations in the work W at time t of a polymer molecule (modeled as an elastic dumbbell in a viscous solvent) that is acted on by an elongational flow field having a flow rate (gamma) over dot. We find that P(w, t) is non-Gaussian and that, at long times, the ratio P(w, t)/ P (-w, t) is equal to expw/(k(B)T)], independent of (gamma) over dot. On the basis of this finding, we suggest that polymers in elongational flows satisfy a fluctuation theorem.

A polynomial bound on the number of light cycles in an undirected graph

Let G be an undirected graph with a positive real weight on each edge. It is shown that the number of minimum-weight cycles of G is bounded above by a polynomial in the number of edges of G. A similar bound holds if we wish to count the number of cycles with weight at most a constant multiple of the minimum weight of a cycle of G.

Synthesis of workspaces of planar manipulators with arbitrary topology using shape representation and simulated annealing

This paper presents a general methodology for the synthesis of the external boundary of the workspaces of a planar manipulator with arbitrary topology. Both the desired workspace and the manipulator workspaces are identified by their boundaries and are treated as simple closed polygons. The paper introduces the concept of best match configuration and shows that the corresponding transformation can be obtained by using the concept of shape normalization available in image processing literature. Introduction of the concept of shape in workspace synthesis allows highly accurate synthesis with fewer numbers of design variables. This paper uses a new global property based vector representation for the shape of the workspaces which is computationally efficient because six out of the seven elements of this vector are obtained as a by-product of the shape normalization procedure. The synthesis of workspaces is formulated as an optimization problem where the distance between the shape vector of the desired workspace and that of the workspace of the manipulator at hand are minimized by changing the dimensional parameters of the manipulator. In view of the irregular nature of the error manifold, the statistical optimization procedure of simulated annealing has been used. A number of worked-out examples illustrate the generality and efficiency of the present method. (C) 1998 Elsevier Science Ltd. All rights reserved.