Two force component measuring device Patent

Development of two force component measuring devic

Multi axes vibration fixtures

A simplified technique and apparatus are described for testing the effects of vibration on various material specimen. Particular attention was given to tests along the orthogonal vibrational planes in order to prove the strength of the item under extraordinary conditions to which it will be subjected

Drawings of Planar Graphs with Few Slopes and Segments

We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on $n$ vertices has a plane drawing with at most ${5/2}n$ segments and at most $2n$ slopes. We prove that every cubic 3-connected plane graph has a plane drawing with three slopes (and three bends on the outerface). In a companion paper, drawings of non-planar graphs with few slopes are also considered.Comment: This paper is submitted to a journal. A preliminary version appeared as "Really Straight Graph Drawings" in the Graph Drawing 2004 conference. See http://arxiv.org/math/0606446 for a companion pape

Composite antenna feed

A composite antenna feed subsystem concentrated in a small area at the prime focus of the parabola of a satellite parabolic reflector accomodates a plurality of frequency bands. The arrays comprising the subsystem are mounted on the top cover of a communication module. A multimode horn is arranged at the center of the subsystem axis which functions at X- And C-band frequencies, and a cross array consisting of individual elements form the S-band feed, with one arm of the S-band array containing an element mutually shared with the L-band array. Provision is also made for UHF frequencies, and a dipole arrangement for VHF frequencies is arranged around the S-band arms

Stabilization of gravity oriented satellites Patent

Stabilization system for gravity-oriented satellites using single damper ro

Counting Carambolas

We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of $n$ points in the plane. Configurations of interest include \emph{convex polygons}, \emph{star-shaped polygons} and \emph{monotone paths}. We also consider related problems for \emph{directed} planar straight-line graphs.Comment: update reflects journal version, to appear in Graphs and Combinatorics; 18 pages, 13 figure

Device for measuring light scattering wherein the measuring beam is successively reflected between a pair of parallel reflectors Patent

Coherent light beam device and method for measuring gas density in vacuum chamber

Apparatus for microbiological sampling

An automatic apparatus is described for microbiologically sampling surface using a cotton swab which eliminates human error. The apparatus includes a self-powered transport device, such as a motor-driven wheeled cart, which mounts a swabbing motor drive for a crank arm which supports a swab in the free end thereof. The swabbing motor is pivotably mounted and an actuator rod movable responsive to the cart traveling a predetermined distance provides lifting of the swab from the surface being sampled and reversal of the direction of travel of the cart

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

A greedily routable region (GRR) is a closed subset of $\mathbb R^2$, in which each destination point can be reached from each starting point by choosing the direction with maximum reduction of the distance to the destination in each point of the path. Recently, Tan and Kermarrec proposed a geographic routing protocol for dense wireless sensor networks based on decomposing the network area into a small number of interior-disjoint GRRs. They showed that minimum decomposition is NP-hard for polygons with holes. We consider minimum GRR decomposition for plane straight-line drawings of graphs. Here, GRRs coincide with self-approaching drawings of trees, a drawing style which has become a popular research topic in graph drawing. We show that minimum decomposition is still NP-hard for graphs with cycles, but can be solved optimally for trees in polynomial time. Additionally, we give a 2-approximation for simple polygons, if a given triangulation has to be respected.Comment: full version of a paper appearing in ISAAC 201