A unified approach to known and unknown cases of Berge's conjecture

Berge's elegant dipath partition conjecture from 1982 states that in a dipath partition P of the vertex set of a digraph minimizing , there exists a collection Ck of k disjoint independent sets, where each dipath P?P meets exactly min{|P|, k} of the independent sets in C. This conjecture extends Linial's conjecture, the GreeneKleitman Theorem and Dilworth's Theorem for all digraphs. The conjecture is known to be true for acyclic digraphs. For general digraphs, it is known for k=1 by the GallaiMilgram Theorem, for k?? (where ?is the number of vertices in the longest dipath in the graph), by the GallaiRoy Theorem, and when the optimal path partition P contains only dipaths P with |P|?k. Recently, it was proved (Eur J Combin (2007)) for k=2. There was no proof that covers all the known cases of Berge's conjecture. In this article, we give an algorithmic proof of a stronger version of the conjecture for acyclic digraphs, using network flows, which covers all the known cases, except the case k=2, and the new, unknown case, of k=?-1 for all digraphs. So far, there has been no proof that unified all these cases. This proof gives hope for finding a proof for all k.

The partition of unity finite element method for elastic wave propagation in Reissner-Mindlin plates

This paper reports a numerical method for modelling the elastic wave propagation in plates. The method is based on the partition of unity approach, in which the approximate spectral properties of the infinite dimensional system are embedded within the space of a conventional finite element method through a consistent technique of waveform enrichment. The technique is general, such that it can be applied to the Lagrangian family of finite elements with specific waveform enrichment schemes, depending on the dominant modes of wave propagation in the physical system. A four-noded element for the Reissner-indlin plate is derived in this paper, which is free of shear locking. Such a locking-free property is achieved by removing the transverse displacement degrees of freedom from the element nodal variables and by recovering the same through a line integral and a weak constraint in the frequency domain. As a result, the frequency-dependent stiffness matrix and the mass matrix are obtained, which capture the higher frequency response with even coarse meshes, accurately. The steps involved in the numerical implementation of such element are discussed in details. Numerical studies on the performance of the proposed element are reported by considering a number of cases, which show very good accuracy and low computational cost. Copyright (C)006 John Wiley & Sons, Ltd.

Automatic Road Extraction using High Resolution Satellite Image Based on Texture Progressive Analysis and Normalized Cut Method

In this paper the approach for automatic road extraction for an urban region using structural, spectral and geometric characteristics of roads has been presented. Roads have been extracted based on two levels: Pre-processing and road extraction methods. Initially, the image is pre-processed to improve the tolerance by reducing the clutter (that mostly represents the buildings, parking lots, vegetation regions and other open spaces). The road segments are then extracted using Texture Progressive Analysis (TPA) and Normalized cut algorithm. The TPA technique uses binary segmentation based on three levels of texture statistical evaluation to extract road segments where as, Normalizedcut method for road extraction is a graph based method that generates optimal partition of road segments. The performance evaluation (quality measures) for road extraction using TPA and normalized cut method is compared. Thus the experimental result show that normalized cut method is efficient in extracting road segments in urban region from high resolution satellite image.

Optimal pulse spacing for dynamical decoupling in the presence of a purely dephasing spin bath

Maintaining quantum coherence is a crucial requirement for quantum computation; hence protecting quantum systems against their irreversible corruption due to environmental noise is an important open problem. Dynamical decoupling (DD) is an effective method for reducing decoherence with a low control overhead. It also plays an important role in quantum metrology, where, for instance, it is employed in multiparameter estimation. While a sequence of equidistant control pulses the Carr-Purcell-Meiboom-Gill (CPMG) sequence] has been ubiquitously used for decoupling, Uhrig recently proposed that a nonequidistant pulse sequence the Uhrig dynamic decoupling (UDD) sequence] may enhance DD performance, especially for systems where the spectral density of the environment has a sharp frequency cutoff. On the other hand, equidistant sequences outperform UDD for soft cutoffs. The relative advantage provided by UDD for intermediate regimes is not clear. In this paper, we analyze the relative DD performance in this regime experimentally, using solid-state nuclear magnetic resonance. Our system qubits are C-13 nuclear spins and the environment consists of a H-1 nuclear spin bath whose spectral density is close to a normal (Gaussian) distribution. We find that in the presence of such a bath, the CPMG sequence outperforms the UDD sequence. An analogy between dynamical decoupling and interference effects in optics provides an intuitive explanation as to why the CPMG sequence performs better than any nonequidistant DD sequence in the presence of this kind of environmental noise.

Critical earthquake input power spectral density function models for engineering structures

The problem of determining optimal power spectral density models for earthquake excitation which satisfy constraints on total average power, zero crossing rate and which produce the highest response variance in a given linear system is considered. The solution to this problem is obtained using linear programming methods. The resulting solutions are shown to display a highly deterministic structure and, therefore, fail to capture the stochastic nature of the input. A modification to the definition of critical excitation is proposed which takes into account the entropy rate as a measure of uncertainty in the earthquake loads. The resulting problem is solved using calculus of variations and also within linear programming framework. Illustrative examples on specifying seismic inputs for a nuclear power plant and a tall earth dam are considered and the resulting solutions are shown to be realistic.

Heterogeneous locational optimisation using a generalised Voronoi partition

In this paper a generalisation of the Voronoi partition is used for locational optimisation of facilities having different service capabilities and limited range or reach. The facilities can be stationary, such as base stations in a cellular network, hospitals, schools, etc., or mobile units, such as multiple unmanned aerial vehicles, automated guided vehicles, etc., carrying sensors, or mobile units carrying relief personnel and materials. An objective function for optimal deployment of the facilities is formulated, and its critical points are determined. The locally optimal deployment is shown to be a generalised centroidal Voronoi configuration in which the facilities are located at the centroids of the corresponding generalised Voronoi cells. The problem is formulated for more general mobile facilities, and formal results on the stability, convergence and spatial distribution of the proposed control laws responsible for the motion of the agents carrying facilities, under some constraints on the agents' speed and limit on the sensor range, are provided. The theoretical results are supported with illustrative simulation results.

Maximizing transported data in a wireless sensor network: how much can the network transport before partition?

We consider a scenario where the communication nodes in a sensor network have limited energy, and the objective is to maximize the aggregate bits transported from sources to respective destinations before network partition due to node deaths. This performance metric is novel, and captures the useful information that a network can provide over its lifetime. The optimization problem that results from our approach is nonlinear; however, we show that it can be converted to a Multicommodity Flow (MCF) problem that yields the optimal value of the metric. Subsequently, we compare the performance of a practical routing strategy, based on Node Disjoint Paths (NDPs), with the ideal corresponding to the MCF formulation. Our results indicate that the performance of NDP-based routing is within 7.5% of the optimal.

Optimal input cross-power spectra in shake table testing of asymmetric structures

The study considers earthquake shake table testing of bending-torsion coupled structures under multi-component stationary random earthquake excitations. An experimental procedure to arrive at the optimal excitation cross-power spectral density (psd) functions which maximize/minimize the steady state variance of a chosen response variable is proposed. These optimal functions are shown to be derivable in terms of a set of system frequency response functions which could be measured experimentally without necessitating an idealized mathematical model to be postulated for the structure under study. The relationship between these optimized cross-psd functions to the most favourable/least favourable angle of incidence of seismic waves on the structure is noted. The optimal functions are also shown to be system dependent, mathematically the sharpest, and correspond to neither fully correlated motions nor independent motions. The proposed experimental procedure is demonstrated through shake table studies on two laboratory scale building frame models.

Constrained Linear Spectral Unmixing Technique for Regional Land Cover Mapping Using MODIS Data

Over the last few decades, there has been a significant land cover (LC) change across the globe due to the increasing demand of the burgeoning population and urban sprawl. In order to take account of the change, there is a need for accurate and up-to-date LC maps. Mapping and monitoring of LC in India is being carried out at national level using multi-temporal IRS AWiFS data. Multispectral data such as IKONOS, Landsat-TM/ETM+, IRS-ICID LISS-III/IV, AWiFS and SPOT-5, etc. have adequate spatial resolution (similar to 1m to 56m) for LC mapping to generate 1:50,000 maps. However, for developing countries and those with large geographical extent, seasonal LC mapping is prohibitive with data from commercial sensors of limited spatial coverage. Superspectral data from the MODIS sensor are freely available, have better temporal (8 day composites) and spectral information. MODIS pixels typically contain a mixture of various LC types (due to coarse spatial resolution of 250, 500 and 1000 in), especially in more fragmented landscapes. In this context, linear spectral unmixing would be useful for mapping patchy land covers, such as those that characterise much of the Indian subcontinent. This work evaluates the existing unmixing technique for LC mapping using MODIS data, using end-members that are extracted through Pixel Purity Index (PPI), Scatter plot and N-dimensional visualisation. The abundance maps were generated for agriculture, built up, forest, plantations, waste land/others and water bodies. The assessment of the results using ground truth and a LISS-III classified map shows 86% overall accuracy, suggesting the potential for broad-scale applicability of the technique with superspectral data for natural resource planning and inventory applications. Index Terms-Remote sensing, digital

1H and 13C NMR spectra of some unsymmetric N,N-dipyridyl ureas: spectral assignments and molecular conformation

Abstract: The H-1 NMR spectra of N-(2-pyridyl), N'-(3-pyridyl)ureas and N-(2-pyridyl), N'-(4-pyridyl)ureas in CDCl3 and (CD3)(2)CO have been assigned with the aid of COSY and NOE experiments and chemical shift and coupling constant correlations, The C-13 NMR spectra in CDCl3 were analysed utilizing the HETCOR and proton coupled spectra, The H-1 NMR spectra, NOE effects and MINDO/3 calculations have been utilized to show that the molecular conformation of these compounds has the 2-pyridyl ring coplanar with the urea plane with the N-H group hydrogen bonded to the nitrogen of the 2-pyridyl group on the other urea nitrogen while the 3/4-pyridyl group rotates rapidly about the N-C-3/N-C-4 bond.

Measurement of Partition Coefficients of Substituted Benzoic Acids between Two Immiscible Solvents by Hyper-Rayleigh Scattering

We demonstrate that the hyper-Rayleigh scattering technique can be employed to measure the partition coefficient (k(p)) of a solute in a mixture of two immiscible solvents. Specifically, partition coefficients of six substituted benzoic acids in water/toluene (1:1 v/v) and water/chloroform (1:1 v/v) systems have been measured. Our values compare well with the k(p) values measured earlier by other techniques, The advantages offered by this technique are also discussed.

Optimal barrier subdivision for Kramers' escape rate

We examine the effect of subdividing the potential barrier along the reaction coordinate on Kramers' escape rate for a model potential. Using the known supersymmetric potential approach, we show the existence of an optimal number of subdivisions that maximizes the rate.

Optimal scheduling of hydro-thermal power systems under shortage

The problem of optimal scheduling of the generation of a hydro-thermal power system that is faced with a shortage of energy is studied. The deterministic version of the problem is first analyzed, and the results are then extended to cases where the loads and the hydro inflows are random variables.

Optimal hydrothermal load flow: Formulation and a successive approximation solution for fixed head systems

This paper deals with the optimal load flow problem in a fixed-head hydrothermal electric power system. Equality constraints on the volume of water available for active power generation at the hydro plants as well as inequality constraints on the reactive power generation at the voltage controlled buses are imposed. Conditions for optimal load flow are derived and a successive approximation algorithm for solving the optimal generation schedule is developed. Computer implementation of the algorithm is discussed, and the results obtained from the computer solution of test systems are presented.

A hierarchical system of learning automata that can learn die globally optimal path

Systems of learning automata have been studied by various researchers to evolve useful strategies for decision making under uncertainity. Considered in this paper are a class of hierarchical systems of learning automata where the system gets responses from its environment at each level of the hierarchy. A classification of such sequential learning tasks based on the complexity of the learning problem is presented. It is shown that none of the existing algorithms can perform in the most general type of hierarchical problem. An algorithm for learning the globally optimal path in this general setting is presented, and its convergence is established. This algorithm needs information transfer from the lower levels to the higher levels. Using the methodology of estimator algorithms, this model can be generalized to accommodate other kinds of hierarchical learning tasks.