Multiobjective Analysis of Irrigation Planning in River Basin Development

A river basin that is extensively developed in the downstream reaches and that has a high potential for development in the upper reaches is considered for irrigation planning. A four-reservoir system is modeled on a monthly basis by using a mathematical programing (LP) formulation to find optimum cropping patterns, subject to land, water, and downstream release constraints. The model is applied to a fiver basin in India. Two objectives, maximizing net economic benefits and maximizing irrigated cropped area, considered in the model are analyzed in the context of multiobjective planning, and the tradeoffs are discussed.

Specificity for the Exchange of Phospholipids Through Polymyxin B Mediated Intermembrane Molecular Contacts

Structural specificity for the direct vesicle−vesicle exchange of phospholipids through stable molecular contacts formed by the antibiotic polymyxin B (PxB) is characterized by kinetic and spectroscopic methods. As shown elsewhere [Cajal, Y., Rogers, J., Berg, O. G., & Jain, M. K. (1996) Biochemistry 35, 299−308], intermembrane molecular contacts between anionic vesicles are formed by a small number of PxB molecules, which suggests that a stoichiometric complex may be responsible for the exchange of phospholipids. Larger clusters containing several vesicles are formed where each vesicle can make multiple contacts if sterically allowed. In this paper we show that the overall process can be dissected into three functional steps: binding of PxB to vesicles, formation of stable vesicle−vesicle contacts, and exchange of phospholipids. Polycationic PxB binds to anionic vesicles. Formation of molecular contacts and exchange of monoanionic phospholipids through PxB contacts does not depend on the chain length of the phospholipid. Only monoanionic phospholipids (with methanol, serine, glycol, butanol, or phosphatidylglycerol as the second phosphodiester substituent in the head group) exchange through these contacts, whereas dianionic phosphatidic acid does not. Selectivity for the exchange was also determined with covesicles of phosphatidylmethanol and other phospholipids. PxB does not bind to vesicles of zwitterionic phosphatidylcholine, and its exchange in covesicles is not mediated by PxB. Vesicles of dianionic phospholipids, like phosphatidic acid, bind PxB; however, this phospholipid does not exchange. The structural features of the contacts are characterized by the spectroscopic and chemical properties of PxB at the interface. PxB in intermembrane contacts is readily accessible from the aqueous phase to quenchers and reagents that modify amino groups. Results show that PxB at the interface can exist in two forms depending on the lipid/PxB ratio. Additional studies show that stable PxB-mediated vesicle−vesicle contacts may be structurally and functionally distinct from “stalks”, the putative transient intermediate for membrane fusion. The phenomenon of selective exchange of phospholipids through peptide-mediated contacts could serve as a prototype for intermembrane targeting and sorting of phospholipids during their biosynthesis and trafficking in different compartments of a cell. The protocols and results described here also extend the syllogistic foundations of interfacial equilibria and catalysis.

Heteroepitaxial Yba2cu3o7-X-Prba2cu3o7-X-Yba2cu3o7-X Weak Links Grown By Laser Deposition

Summary form only given. The authors have developed a controllable HTSC (high-temperature superconductor) weak-link fabrication process for producing weak links from the high-temperature superconductor YBa2Cu3O7-x (YBCO), using PrBa2Cu3O7-x (PBCO) as a lattice-matched semiconducting barrier layer. The devices obtained show current-voltage characteristics similar to those observed for low-temperature superconductor/normal-metal/superconductor (SNS) devices. The authors found good scaling of the critical currents Ic with area, A, and scaling of the resistances Rj with 1/A; the typical values of the IcRj product of 3.5 mV are consistent with traditional SNS behavior. The authors observed Shapiro steps in response to 100-GHz millimeter-wave radiation and oscillation of the DC supercurrent in a transverse magnetic field, thus demonstrating that both the AC and DC Josephson effects occur in these devices.

Reduction in magnetic field induced broadening of the resistive transition in laser‐deposited YBa2Cu3O7−x thin films on MgO

The magnetic field induced broadening of the normal to superconducting resistive transition of YBa2Cu3O7−x thin films laser deposited on (100) MgO substrates for field oriented parallel to the c axis is found to be significantly reduced in comparison with that found previously in single crystals and in films deposited on SrTiO3. This reduction in broadening is associated with a high density of defects which, while causing a slight decrease in Tc and an increase in the zero‐field transition width, seems to provide strong vortex pinning centers that reduce flux creep

Non-contractible non-edges in 2-connected graphs

Any pair of non-adjacent vertices forms a non-edge in a graph. Contraction of a non-edge merges two non-adjacent vertices into a single vertex such that the edges incident on the non-adjacent vertices are now incident on the merged vertex. In this paper, we consider simple connected graphs, hence parallel edges are removed after contraction. The minimum number of nodes whose removal disconnects the graph is the connectivity of the graph. We say a graph is k-connected, if its connectivity is k. A non-edge in a k-connected graph is contractible if its contraction does not result in a graph of lower connectivity. Otherwise the non-edge is non-contractible. We focus our study on non-contractible non-edges in 2-connected graphs. We show that cycles are the only 2-connected graphs in which every non-edge is non-contractible. (C) 2010 Elsevier B.V. All rights reserved.

Boxicity of Leaf Powers

The boxicity of a graph G, denoted as boxi(G), is defined as the minimum integer t such that G is an intersection graph of axis-parallel t-dimensional boxes. A graph G is a k-leaf power if there exists a tree T such that the leaves of the tree correspond to the vertices of G and two vertices in G are adjacent if and only if their corresponding leaves in T are at a distance of at most k. Leaf powers are used in the construction of phylogenetic trees in evolutionary biology and have been studied in many recent papers. We show that for a k-leaf power G, boxi(G) a parts per thousand currency sign k-1. We also show the tightness of this bound by constructing a k-leaf power with boxicity equal to k-1. This result implies that there exist strongly chordal graphs with arbitrarily high boxicity which is somewhat counterintuitive.

A Study on the Success Potential of Multiple Mobile Payment Technologies

Payment systems all over the world have grown into a complicated web of solutions. This is more challenging in the case of mobile based payment systems. Mobile based payment systems are many and consist of different technologies providing different services. The diffusion of these various technologies in a market is uncertain. Diffusion theorists, for example Rogers, and Davis suggest how innovation is accepted in markets. In the case of electronic payment systems, the tale of Mondex vs Octopus throws interesting insights on diffusion. Our paper attempts to understand the success potential of various mobile payment technologies. We illustrate what we describe as technology breadth in mobile payment systems using data from payment systems all over the world (n=62). Our data shows an unexpected superiority of SMS technology, over other technologies like NFC, WAP and others. We also used a Delphi based survey (n=5) with experts to address the possibility that SMS will gain superiority in market diffusion. The economic conditions of a country, particularly in developing countries, the services availed and characteristics of the user (for example number of un-banked users in large populated countries) may put SMS in the forefront. This may be true more for micro payments using the mobile.

Chordal Bipartite Graphs with High Boxicity

The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater than 4. It was conjectured by Otachi, Okamoto and Yamazaki that chordal bipartite graphs have boxicity at most 2. We disprove this conjecture by exhibiting an infinite family of chordal bipartite graphs that have unbounded boxicity.

Fabrication of Yy‐Pr1‐y ‐Ba‐Cu‐O Thin Films and Superlattices of ‐Ba‐Cu‐O/Yy‐Pr1‐y ‐Ba‐Cu‐O

We have prepared epitaxial thin films of Yy‐Pr1‐y‐Ba‐Cu‐O (y= 1 to 0) and superlattices of Y‐Ba‐Cu‐O/Yy‐Pr1‐y ‐Ba‐Cu‐O using pulsed laser deposition technique. The zero resistance transition temperatures of Yy‐Pr1‐y‐Ba‐Cu‐O bulk samples are reproduced in the films. The composition oscillations in the superlattices are observed by SIMS. The films and superlattices are found to have c‐axis orientations and good crystallinity.

Boxicity of Line Graphs

The boxicity of a graph H, denoted by View the MathML source, is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in View the MathML source. In this paper we show that for a line graph G of a multigraph, View the MathML source, where Δ(G) denotes the maximum degree of G. Since G is a line graph, Δ(G)≤2(χ(G)−1), where χ(G) denotes the chromatic number of G, and therefore, View the MathML source. For the d-dimensional hypercube Qd, we prove that View the MathML source. The question of finding a nontrivial lower bound for View the MathML source was left open by Chandran and Sivadasan in [L. Sunil Chandran, Naveen Sivadasan, The cubicity of Hypercube Graphs. Discrete Mathematics 308 (23) (2008) 5795–5800]. The above results are consequences of bounds that we obtain for the boxicity of a fully subdivided graph (a graph that can be obtained by subdividing every edge of a graph exactly once).

Finding a Box Representation for a Graph in $O(n^2\Delta^2\ln n)$ time

An axis-parallel box in $b$-dimensional space is a Cartesian product $R_1 \times R_2 \times \cdots \times R_b$ where $R_i$ (for $1 \leq i \leq b$) is a closed interval of the form $[a_i, b_i]$ on the real line. For a graph $G$, its boxicity is the minimum dimension $b$, such that $G$ is representable as the intersection graph of (axis-parallel) boxes in $b$-dimensional space. The concept of boxicity finds application in various areas of research like ecology, operation research etc. Chandran, Francis and Sivadasan gave an $O(\Delta n^2 \ln^2 n)$ randomized algorithm to construct a box representation for any graph $G$ on $n$ vertices in $\lceil (\Delta + 2)\ln n \rceil$ dimensions, where $\Delta$ is the maximum degree of the graph. They also came up with a deterministic algorithm that runs in $O(n^4 \Delta )$ time. Here, we present an $O(n^2 \Delta^2 \ln n)$ deterministic algorithm that constructs the box representation for any graph in $\lceil (\Delta + 2)\ln n \rceil$ dimensions.

Faster Algorithms for Incremental Topological Ordering.Robert Tarjan

We present two online algorithms for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm takes O(m 1/2) amortized time per arc and our second algorithm takes O(n 2.5/m) amortized time per arc, where n is the number of vertices and m is the total number of arcs. For sparse graphs, our O(m 1/2) bound improves the best previous bound by a factor of logn and is tight to within a constant factor for a natural class of algorithms that includes all the existing ones. Our main insight is that the two-way search method of previous algorithms does not require an ordered search, but can be more general, allowing us to avoid the use of heaps (priority queues). Instead, the deterministic version of our algorithm uses (approximate) median-finding; the randomized version of our algorithm uses uniform random sampling. For dense graphs, our O(n 2.5/m) bound improves the best previously published bound by a factor of n 1/4 and a recent bound obtained independently of our work by a factor of logn. Our main insight is that graph search is wasteful when the graph is dense and can be avoided by searching the topological order space instead. Our algorithms extend to the maintenance of strong components, in the same asymptotic time bounds.

Boxicity of line graphs

The boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R(k). In this paper we show that for a line graph G of a multigraph, box(G) <= 2 Delta (G)(inverted right perpendicularlog(2) log(2) Delta(G)inverted left perpendicular + 3) + 1, where Delta(G) denotes the maximum degree of G. Since G is a line graph, Delta(G) <= 2(chi (G) - 1), where chi (G) denotes the chromatic number of G, and therefore, box(G) = 0(chi (G) log(2) log(2) (chi (G))). For the d-dimensional hypercube Q(d), we prove that box(Q(d)) >= 1/2 (inverted right perpendicularlog(2) log(2) dinverted left perpendicular + 1). The question of finding a nontrivial lower bound for box(Q(d)) was left open by Chandran and Sivadasan in [L. Sunil Chandran, Naveen Sivadasan, The cubicity of Hypercube Graphs. Discrete Mathematics 308 (23) (2008) 5795-5800]. The above results are consequences of bounds that we obtain for the boxicity of a fully subdivided graph (a graph that can be obtained by subdividing every edge of a graph exactly once). (C) 2011 Elsevier B.V. All rights reserved.

Rainbow Connection Number and Connectivity

The rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. Our main result is that rc(G) <= inverted right perpendicularn/2inverted left perpendicular for any 2-connected graph with at least three vertices. We conjecture that rc(G) <= n/kappa + C for a kappa-connected graph G of order n, where C is a constant, and prove the conjecture for certain classes of graphs. We also prove that rc(G) < (2 + epsilon)n/kappa + 23/epsilon(2) for any epsilon > 0.

Seed dispersal in changing landscapes

A growing understanding of the ecology of seed dispersal has so far had little influence on conservation practice, while the needs of conservation practice have had little influence on seed dispersal research. Yet seed dispersal interacts decisively with the major drivers of biodiversity change in the 21st century: habitat fragmentation, overharvesting, biological invasions, and climate change. We synthesize current knowledge of the effects these drivers have on seed dispersal to identify research gaps and to show how this information can be used to improve conservation management. The drivers, either individually, or in combination, have changed the quantity, species composition, and spatial pattern of dispersed seeds in the majority of ecosystems worldwide, with inevitable consequences for species survival in a rapidly changing world. The natural history of seed dispersal is now well-understood in a range of landscapes worldwide. Only a few generalizations that have emerged are directly applicable to conservation management, however, because they are frequently confounded by site-specific and species-specific variation. Potentially synergistic interactions between disturbances are likely to exacerbate the negative impacts, but these are rarely investigated. We recommend that the conservation status of functionally unique dispersers be revised and that the conservation target for key seed dispersers should be a population size that maintains their ecological function, rather than merely the minimum viable population. Based on our analysis of conservation needs, seed dispersal research should be carried out at larger spatial scales in heterogenous landscapes, examining the simultaneous impacts of multiple drivers on community-wide seed dispersal networks. (C) 2011 Elsevier Ltd. All rights reserved.