Ground-based testing of the dynamics of flexible space structures using band mechanisms

A suspension system based on a band mechanism is studied to provide the free-free conditions for ground based validation testing of flexible space structures. The band mechanism consists of a noncircular disk with a convex profile, preloaded by torsional springs at its center of rotation so that static equilibrium of the test structure is maintained at any vertical location; the gravitational force will be directly counteracted during dynamic testing of the space structure. This noncircular disk within the suspension system can be configured to remain unchanged for test articles with the different weights as long as the torsional spring is replaced to maintain the originally designed frequency ratio of W/k sub s. Simulations of test articles which are modeled as lumped parameter as well as continuous parameter systems, are also presented

Design of an autonomous Lunar construction utility vehicle

In order to prepare a site for a manned lunar base, an autonomously operated construction vehicle is necessary. A Lunar Construction Utility Vehicle (LCUV), which utilizes interchangeable construction implements, was designed conceptually. Some elements of the machine were studied in greater detail. Design of an elastic loop track system has advanced to the testing stage. A standard coupling device was designed to insure a proper connection between the different construction tools and the LCUV. Autonomous control of the track drive motors was simulated successfully through the use of a joystick and computer interface. A study of hydrogen-oxygen fuel cells has produced estimates of reactant and product size requirements and identified multi-layer insulation techniques. Research on a 100 kW heat rejection system has determined that it is necessary to house a radiator panel on a utility trailer. The impact of a 720 hr use cycle has produced a very large logistical support lien which requires further study

Impact of edge-removal on the centrality betweenness of the best spreaders

The control of epidemic spreading is essential to avoid potential fatal consequences and also, to lessen unforeseen socio-economic impact. The need for effective control is exemplified during the severe acute respiratory syndrome (SARS) in 2003, which has inflicted near to a thousand deaths as well as bankruptcies of airlines and related businesses. In this article, we examine the efficacy of control strategies on the propagation of infectious diseases based on removing connections within real world airline network with the associated economic and social costs taken into account through defining appropriate quantitative measures. We uncover the surprising results that removing less busy connections can be far more effective in hindering the spread of the disease than removing the more popular connections. Since disconnecting the less popular routes tend to incur less socio-economic cost, our finding suggests the possibility of trading minimal reduction in connectivity of an important hub with efficiencies in epidemic control. In particular, we demonstrate the performance of various local epidemic control strategies, and show how our approach can predict their cost effectiveness through the spreading control characteristics.Comment: 11 pages, 4 figure

Building Voronoi Diagrams for Convex Polygons in Linear Expected Time

Let P be a list of points in the plane such that the points of P taken in order form the vertices of a convex polygon. We introduce a simple, linear expected-time algorithm for finding the Voronoi diagram of the points in P. Unlike previous results on expected-time algorithms for Voronoi diagrams, this method does not require any assumptions about the distribution of points. With minor modifications, this method can be used to design fast algorithms for certain problems involving unrestricted sets of points. For example, fast expected-time algorithms can be designed to delete a point from a Voronoi diagram, to build an order k Voronoi diagram for an arbitrary set of points, and to determine the smallest enclosing circle for points at the vertices of a convex hull

There is a Planar Graph Almost as Good as the Complete Graph

Given a set S of points in the plane, there is a triangulation of S such that a path found within this triangulation has length bounded by a constant times the straight-line distance between the endpoints of the path. Specifically, for any two points a and b of S there is a path along edges of the triangulation with length less that sqrt(10) times [ab], where [ab] is the straight-line Euclidean distance between a and b. The triangulation that has this property is the L1 metric Delauney triangulation for the set S. This result can be applied to motion planning in the plane. Given a source, a destination, and a set of polygonal obstacles of size n, an O(n) size data structure can be used to find a reasonable approximation to the shortest path between the source and the destination in O (n log n) time

Planar Graphs and Sparse Graphs from Efficient Motion Planning in the Plane

Given a source, a destination, and a number of obstacles in the plane, the Motion Planning Program is to determine the best path to move an object (a robot) from the source to the destination without colliding with any of the obstacles. For us, motion is restricted to the plane, the robot is represented by a point, and the obstacles are represented by a set of polygons with a total of n vertices among all the polygonal obstacles

Term Reduction Using Directed Congruence Closure

Many problems in computer science can be described in terms of reduction rules that tell how to transform terms. Problems that can be handled in this way include interpreting programs, implementing abstract data types, and proving certain kinds of theorems. A terms is said to have a normal form if it can be transformed, using the reduction rules, into a term to which no further reduction rules apply. In this paper, we extend the Congruence Closure Algorithm, an algorithm for finding the consequences of a finite set of equations, to develop Directed Congruence Closure, a technique for finding the normal form of a term provided the reduction rules satisfy the conditions for a regular term rewriting system. This technique is particularly efficient because it inherits, from the Congruence Closure Algorithm, the ability to remember all objects that have already been proved equivalent

The scattering of a cylindrical invisibility cloak: reduced parameters and optimization

We investigate the scattering of 2D cylindrical invisibility cloaks with simplified constitutive parameters with the assistance of scattering coefficients. We show that the scattering of the cloaks originates not only from the boundary conditions but also from the spatial variation of the component of permittivity/permeability. According to our formulation, we propose some restrictions to the invisibility cloak in order to minimize its scattering after the simplification has taken place. With our theoretical analysis, it is possible to design a simplified cloak by using some peculiar composites like photonic crystals (PCs) which mimic an effective refractive index landscape rather than offering effective constitutives, meanwhile canceling the scattering from the inner and outer boundaries.Comment: Accepted for J. Phys.