Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.

Faster algorithms for all-pairs small stretch distances in weighted graphs

Abstract. Let G = (V,E) be a weighted undirected graph, with non-negative edge weights. We consider the problem of efficiently computing approximate distances between all pairs of vertices in G. While many efficient algorithms are known for this problem in unweighted graphs, not many results are known for this problem in weighted graphs. Zwick [14] showed that for any fixed ε> 0, stretch 1 1 + ε distances between all pairs of vertices in a weighted directed graph on n vertices can be computed in Õ(n ω) time, where ω < 2.376 is the exponent of matrix multiplication and n is the number of vertices. It is known that finding distances of stretch less than 2 between all pairs of vertices in G is at least as hard as Boolean matrix multiplication of two n×n matrices. It is also known that all-pairs stretch 3 distances can be computed in Õ(n 2) time and all-pairs stretch 7/3 distances can be computed in Õ(n 7/3) time. Here we consider efficient algorithms for the problem of computing all-pairs stretch (2+ε) distances in G, for any 0 < ε < 1. We show that all pairs stretch (2 + ε) distances for any fixed ε> 0 in G can be computed in expected time O(n 9/4 logn). This algorithm uses a fast rectangular matrix multiplication subroutine. We also present a combinatorial algorithm (that is, it does not use fast matrix multiplication) with expected running time O(n 9/4) for computing all-pairs stretch 5/2 distances in G. 1

Constructing a wire-frame from views on arbitrary view planes for objects with conic sections inclined to all view planes

A new and efficient approach to construct a 3D wire-frame of an object from its orthographic projections is described. The input projections can be two or more and can include regular and complete auxiliary views. Each view may contain linear, circular and other conic sections. The output is a 3D wire-frame that is consistent with the input views. The approach can handle auxiliary views containing curved edges. This generality derives from a new technique to construct 3D vertices from the input 2D vertices (as opposed to matching coordinates that is prevalent in current art). 3D vertices are constructed by projecting the 2D vertices in a pair of views on the common line of the two views. The construction of 3D edges also does not require the addition of silhouette and tangential vertices and subsequently splitting edges in the views. The concepts of complete edges and n-tuples are introduced to obviate this need. Entities corresponding to the 3D edge in each view are first identified and the 3D edges are then constructed from the information available with the matching 2D edges. This allows the algorithm to handle conic sections that are not parallel to any of the viewing directions. The localization of effort in constructing 3D edges is the source of efficiency of the construction algorithm as it does not process all potential 3D edges. Working of the algorithm on typical drawings is illustrated. (C) 2011 Elsevier Ltd. All rights reserved.

Modern energy access to all in rural India: An integrated implementation strategy

Expanding energy access to the rural population of India presents a critical challenge for its government. The presence of 364 million people without access to electricity and 726 million who rely on biomass for cooking indicate both the failure of past policies and programs, and the need for a radical redesign of the current system. We propose an integrated implementation framework with recommendations for adopting business principles with innovative institutional, regulatory, financing and delivery mechanisms. The framework entails establishment of rural energy access authorities and energy access funds, both at the national and regional levels, to be empowered with enabling regulatory policies, capital resources and the support of multi-stakeholder partnership. These institutions are expected to design, lead, manage and monitor the rural energy interventions. At the other end, trained entrepreneurs would be expected to establish bioenergy-based micro-enterprises that will produce and distribute energy carriers to rural households at an affordable cost. The ESCOs will function as intermediaries between these enterprises and the international carbon market both in aggregating carbon credits and in trading them under CDM. If implemented, such a program could address the challenges of rural energy empowerment by creating access to modern energy carriers and climate change mitigation. (C) 2011 Elsevier Ltd. All rights reserved.

Application of kinetic schemes to all types of meshes

Kinetic schemes as pursued in CFD Centre are obtained by taking suitable moments of upwind schemes for Boltzmann equation without collision term. The primary ones among these are KFVS, LSKUM, KFMG and these have been applied successfully to a variety of flow problems using various meshes. These schemes have been found to be very robust.

Andaman Postseismic Deformation Observations: Still Slipping after All These Years?

More than six years after the great (M-w 9.2) Sumatra-Andaman earthquake, postevent processes responsible for relaxation of the coseismic stress change remain controversial. Modeling of Andaman Islands Global Positioning System (GPS) displacements indicated early near-field motions were dominated by slip down-dip of the rupture, but various researchers ascribe elements of relaxation to dominantly poroelastic, dominantly viscoelastic, and dominantly fault slip processes, depending primarily on their measurement sampling and modeling tools used. After subtracting a pre-2004 interseismic velocity, significant transient motion during the 2008.5-2010.5 epoch confirms that postseismic relaxation processes continue in Andaman. Modeling three-component velocities as viscoelastic flow yields a weighted root-mean-square (wrms) misfit that always exceeds the wrms of the measured signal (26.3 mm/yr). The best-fitting models are those that yield negligible deformation, indicating the model parameters have no real physical meaning. GPS velocities are well fit (wrms 4.0 mm/yr) by combining a viscoelastic flow model that best fits the horizontal velocities with similar to 50 cm/yr thrust slip down-dip of the coseismic rupture. Both deep slip and flow respond to stress changes, and each can significantly change stress in the realm of the other; it therefore is reasonable to expect that both transient deep slip and viscoelastic flow will influence surface deformation long after a great earthquake.

Dijet resonances, widths and all that

The search for heavy resonances in the dijet channel is part of the on-going physics programme, both at the Tevatron and at the LHC. Lower limits have been placed on the masses of dijet resonances predicted in a wide variety of models. However, across experiments, the search strategy assumes that the effect of the new particles is well-approximated by on-shell production and subsequent decay into a pair of jets. We examine the impact of off-shell effects on such searches, particularly for strongly interacting resonances.

Sliding-Mode Guidance and Control for All-Aspect Interceptors with Terminal Angle Constraints

In this paper, sliding-mode-control-based guidance laws to intercept stationary, constant-velocity, and maneuvering targets at a desired impact angle are proposed. The desired impact angle, which is defined in terms of a desired line-of-sight angle, is achieved in finite time by selecting the missile's lateral acceleration to enforce terminal sliding mode on a switching surface designed using nonlinear engagement dynamics. The conditions for capturability are also presented. In addition, by considering a three-degree-of-freedom linear-interceptor dynamic model and by following the procedure used to design a dynamic sliding-mode controller, the interceptor autopilot is designed as a simple static controller to track the lateral acceleration generated by the guidance law. Numerical simulation results are presented to validate the proposed guidance laws and the autopilot design for different initial engagement geometries and impact angles.

All flavours of El Nino have similar early subsurface origins

The El Nino/Southern Oscillation phenomenon, characterized by anomalous sea surface temperatures and winds in the tropical Pacific, affects climate across the globe(1). El Ninos occur every 2-7 years, whereas the El Nino/Southern Oscillation itself varies on decadal timescales in frequency and amplitude, with a different spatial pattern of surface anomalies(2) each time the tropical Pacific undergoes a regime shift. Recent work has shown that Bjerknes feedback(3,4) (coupling of the atmosphere and the ocean through changes in equatorial winds driven by changes in sea surface temperature owing to suppression of equatorial upwelling in the east Pacific) is not necessary(5) for the development of an El Nino. Thus it is unclear what remains constant through regimes and is crucial for producing the anomalies recognized as El Nino. Here we show that the subsurface process of discharging warm waters always begins in the boreal summer/autumn of the year before the event (up to 18 months before the peak) independent of regimes, identifying the discharge process as fundamental to the El Nino onset. It is therefore imperative that models capture this process accurately to further our theoretical understanding, improve forecasts and predict how the El Nino/Southern Oscillation may respond to climate change.

An algorithm to find all palindromic sequences in proteins

A palindrome is a set of characters that reads the same forwards and backwards. Since the discovery of palindromic peptide sequences two decades ago, little effort has been made to understand its structural, functional and evolutionary significance. Therefore, in view of this, an algorithm has been developed to identify all perfect palindromes (excluding the palindromic subset and tandem repeats) in a single protein sequence. The proposed algorithm does not impose any restriction on the number of residues to be given in the input sequence. This avant-garde algorithm will aid in the identification of palindromic peptide sequences of varying lengths in a single protein sequence.

P3F92-: An All-Pseudo-pi* 2 pi-Aromatic

A qualitative MO analysis suggests (PH3)(3)(2-) as a candidate for an all-pseudo-pi* 2 pi-aromatic; however computational studies rule out its existence. Fluorine substitution which increases the contribution of p orbitals on P in the pseudo-pi* MO makes (PF3)(3)(2-) a minimum and an aromatic. The 2 pi aromaticity arising from the bonding combination of the three pseudo-pi* fragment MOs is comparable to that in C3O32- and is another example for the analogy between CO and PF3. The dianion (PF3)(3)(2-) forms the first example of a three-membered ring with all the vertices constituted by pentacoordinate phosphorus. The ability of PF3 to form the all-pseudo-pi* 2 pi-aromatic system is not shared by the heavier analogues, AsF3 and SbF3.

Optimum steering input determination and path-tracking of all-wheel steer vehicles on uneven terrains based on constrained optimization

In this paper we propose a framework for optimum steering input determination of all-wheel steer vehicles (AWSV) on rough terrains. The framework computes the steering input which minimizes the tracking error for a given trajectory. Unlike previous methodologies of computing steering inputs of car-like vehicles, the proposed methodology depends explicitly on the vehicle dynamics and can be extended to vehicle having arbitrary number of steering inputs. A fully generic framework has been used to derive the vehicle dynamics and a non-linear programming based constrained optimization approach has been used to compute the steering input considering the instantaneous vehicle dynamics, no-slip and contact constraints of the vehicle. All Wheel steer Vehicles have a special parallel steering ability where the instantaneous centre of rotation (ICR) is at infinity. The proposed framework automatically enables the vehicle to choose between parallel steer and normal operation depending on the error with respect to the desired trajectory. The efficacy of the proposed framework is proved by extensive uneven terrain simulations, for trajectories with continuous or discontinuous velocity profile.

Time-Based All-Digital Technique for Analog Built-in Self-Test

A scheme for built-in self-test of analog signals with minimal area overhead for measuring on-chip voltages in an all-digital manner is presented. The method is well suited for a distributed architecture, where the routing of analog signals over long paths is minimized. A clock is routed serially to the sampling heads placed at the nodes of analog test voltages. This sampling head present at each test node, which consists of a pair of delay cells and a pair of flip-flops, locally converts the test voltage to a skew between a pair of subsampled signals, thus giving rise to as many subsampled signal pairs as the number of nodes. To measure a certain analog voltage, the corresponding subsampled signal pair is fed to a delay measurement unit to measure the skew between this pair. The concept is validated by designing a test chip in a UMC 130-nm CMOS process. Sub-millivolt accuracy for static signals is demonstrated for a measurement time of a few seconds, and an effective number of bits of 5.29 is demonstrated for low-bandwidth signals in the absence of sample-and-hold circuitry.