Low-Degree Spanning Trees of Small Weight

The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation algorithm (assuming the edge weights satisfy the triangle inequality). In 1984, Christos Papadimitriou and Umesh Vazirani posed the challenge of finding an algorithm with performance guarantee less than 2 for Euclidean graphs (points in R^n) and d > 2. This paper gives the first answer to that challenge, presenting an algorithm to compute a degree-3 spanning tree of cost at most 5/3 times the MST. For points in the plane, the ratio improves to 3/2 and the algorithm can also find a degree-4 spanning tree of cost at most 5/4 times the MST.Comment: conference version in Symposium on Theory of Computing (1994

Simulator evaluation of displays for a revised takeoff performance monitoring system

Cockpit displays for a Takeoff Performance Monitoring System (TOPMS) to provide pilots with graphic and alphanumeric information pertinent to their decision to continue or abort a takeoff are evaluated. Revised head-down and newly developed head-up displays were implemented on electronic screens in the real-time Transport Systems Research Vehicle (TSRV) Simulator for the Boeing 737 airplane at the Langley Research Center and evaluated by 17 NASA, U.S. Air Force, airline, and industry pilots. Both types of displays were in color, but they were not dependent upon it. The TOPMS head-down display is composed of a runway graphic overlaid with symbolic status and advisory information related to both the expected takeoff point and the predicted stop point (in the event an abort becomes necessary). In addition, an overall Situation Advisory Flag indicates a preferred course of action based on analysis of the various elements of airplane performance and system status. A simpler head-up display conveys most of this same information and relates it to the visual scene. The evaluation pilots found the displays to be credible, easy to monitor, and appropriate for the task. In particular, the pilots said the head-up display was monitored with very little effort and did not obstruct or distract them from monitoring the simulated out-the-window runway scene. This report augments NASA TP-2908, 1989

Designing Multi-Commodity Flow Trees

The traditional multi-commodity flow problem assumes a given flow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity flow network-design problem: given a set of multi-commodity flow demands, find a network subject to certain constraints such that the commodities can be maximally routed. This paper focuses on the case when the network is required to be a tree. The main result is an approximation algorithm for the case when the tree is required to be of constant degree. The algorithm reduces the problem to the minimum-weight balanced-separator problem; the performance guarantee of the algorithm is within a factor of 4 of the performance guarantee of the balanced-separator procedure. If Leighton and Rao's balanced-separator procedure is used, the performance guarantee is O(log n). This improves the O(log^2 n) approximation factor that is trivial to obtain by a direct application of the balanced-separator method.Comment: Conference version in WADS'9

The heat of atomization of sulfur trioxide, SO3_3 - a benchmark for computational thermochemistry

Calibration ab initio (direct coupled cluster) calculations including basis set extrapolation, relativistic effects, inner-shell correlation, and an anharmonic zero-point energy, predict the total atomization energy at 0 K of SO$_3$ to be 335.96 (observed 335.92$\pm$0.19) kcal/mol. Inner polarization functions make very large (40 kcal/mol with $spd$, 10 kcal/mol with $spdfg$ basis sets) contributions to the SCF part of the binding energy. The molecule presents an unusual hurdle for less computationally intensive theoretical thermochemistry methods and is proposed as a benchmark for them. A slight modification of Weizmann-1 (W1) theory is proposed that appears to significantly improve performance for second-row compounds.Comment: Chem. Phys. Lett., in pres

Optimal Randomized Algorithms for Multipacket and Wormhole Routing on the Mesh

In this paper, we present a randomized algorithm for the multipacket (i.e., k - k) routing problem on an n x n mesh. The algorithm competes with high probability in at most kn + O(k log n) parallel communication steps, with a constant queue size of O(k). The previous best known algorithm [4] takes [5/4] kn + O([kn/f(n)]) steps with a queue size of O(k f(n)) (for any 1 ≤ f (n) ≤ n). We will also present a randomized algorithm for the wormhole model permutation routing problem for the mesh that completes in at the most kn + O(k log n) steps, with a constant queue size of O(k), where k is the number of flits that each packet is divided into. The previous best result [6] was also randomized and had a time bound of kn + O ([kn/f(n)]) with a queue size of O(k f(n)) for any 1 ≤ f(n). The two algorithms that we will present are optimal with respect to queue size. The time bounds are within a factor of two of the only known lower bound

Optimisation of quantum Monte Carlo wave function: steepest descent method

We have employed the steepest descent method to optimise the variational ground state quantum Monte Carlo wave function for He, Li, Be, B and C atoms. We have used both the direct energy minimisation and the variance minimisation approaches. Our calculations show that in spite of receiving insufficient attention, the steepest descent method can successfully minimise the wave function. All the derivatives of the trial wave function respect to spatial coordinates and variational parameters have been computed analytically. Our ground state energies are in a very good agreement with those obtained with diffusion quantum Monte Carlo method (DMC) and the exact results.Comment: 13 pages, 3 eps figure

Seasonal variation in the Indian birth-rate

This article does not have an abstract

Landmarks in graphs

AbstractNavigation can be studied in a graph-structured framework in which the navigating agent (which we shall assume to be a point robot) moves from node to node of a “graph space”. The robot can locate itself by the presence of distinctively labeled “landmark” nodes in the graph space. For a robot navigating in Euclidean space, visual detection of a distinctive landmark provides information about the direction to the landmark, and allows the robot to determine its position by triangulation. On a graph, however, there is neither the concept of direction nor that of visibility. Instead, we shall assume that a robot navigating on a graph can sense the distances to a set of landmarks.Evidently, if the robot knows its distances to a sufficiently large set of landmarks, its position on the graph is uniquely determined. This suggests the following problem: given a graph, what are the fewest number of landmarks needed, and where should they be located, so that the distances to the landmarks uniquely determine the robot's position on the graph? This is actually a classical problem about metric spaces. A minimum set of landmarks which uniquely determine the robot's position is called a “metric basis”, and the minimum number of landmarks is called the “metric dimension” of the graph. In this paper we present some results about this problem. Our main new results are that the metric dimension of a graph with n nodes can be approximated in polynomial time within a factor of O(log n), and some properties of graphs with metric dimension two