A simplified rotor system mathematical model for piloted flight dynamics simulation

The model was developed for real-time pilot-in-the-loop investigation of helicopter flying qualities. The mathematical model included the tip-path plane dynamics and several primary rotor design parameters, such as flapping hinge restraint, flapping hinge offset, blade Lock number, and pitch-flap coupling. The model was used in several exploratory studies of the flying qualities of helicopters with a variety of rotor systems. The basic assumptions used and the major steps involved in the development of the set of equations listed are described. The equations consisted of the tip-path plane dynamic equation, the equations for the main rotor forces and moments, and the equation for control phasing required to achieve decoupling in pitch and roll due to cyclic inputs

Unified results of several analytical and experimental studies of helicopter handling qualities in visual terrain flight

The studies were undertaken to investigate the effects of rotor design parameters, interaxis coupling, and various levels of stability and control augmentation on the flying qualities of helicopters performing low-level, terrain-flying tasks in visual meteorological conditions. Some unified results are presented, and the validity and limitations of the flying-qualities data obtained are interpreted. Selected results, related to various design parameters, provide guidelines for the preliminary design of rotor systems and aircraft augmentation systems

Improved Approximation Algorithms for Stochastic Matching

In this paper we consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. We are given an undirected graph in which every edge is assigned a probability of existence and a positive profit, and each node is assigned a positive integer called timeout. We know whether an edge exists or not only after probing it. On this random graph we are executing a process, which one-by-one probes the edges and gradually constructs a matching. The process is constrained in two ways: once an edge is taken it cannot be removed from the matching, and the timeout of node $v$ upper-bounds the number of edges incident to $v$ that can be probed. The goal is to maximize the expected profit of the constructed matching. For this problem Bansal et al. (Algorithmica 2012) provided a $3$-approximation algorithm for bipartite graphs, and a $4$-approximation for general graphs. In this work we improve the approximation factors to $2.845$ and $3.709$, respectively. We also consider an online version of the bipartite case, where one side of the partition arrives node by node, and each time a node $b$ arrives we have to decide which edges incident to $b$ we want to probe, and in which order. Here we present a $4.07$-approximation, improving on the $7.92$-approximation of Bansal et al. The main technical ingredient in our result is a novel way of probing edges according to a random but non-uniform permutation. Patching this method with an algorithm that works best for large probability edges (plus some additional ideas) leads to our improved approximation factors

Mathematical and computational studies of equilibrium capillary free surfaces

The results of several independent studies are presented. The general question is considered of whether a wetting liquid always rises higher in a small capillary tube than in a larger one, when both are dipped vertically into an infinite reservoir. An analytical investigation is initiated to determine the qualitative behavior of the family of solutions of the equilibrium capillary free-surface equation that correspond to rotationally symmetric pendent liquid drops and the relationship of these solutions to the singular solution, which corresponds to an infinite spike of liquid extending downward to infinity. The block successive overrelaxation-Newton method and the generalized conjugate gradient method are investigated for solving the capillary equation on a uniform square mesh in a square domain, including the case for which the solution is unbounded at the corners. Capillary surfaces are calculated on the ellipse, on a circle with reentrant notches, and on other irregularly shaped domains using JASON, a general purpose program for solving nonlinear elliptic equations on a nonuniform quadrilaterial mesh. Analytical estimates for the nonexistence of solutions of the equilibrium capillary free-surface equation on the ellipse in zero gravity are evaluated

Kinematic properties of the helicopter in coordinated turns

A study on the kinematic relationship of the variables of helicopter motion in steady, coordinated turns involving inherent sideslip is described. A set of exact kinematic equations which govern a steady coordinated helical turn about an Earth referenced vertical axis is developed. A precise definition for the load factor parameter that best characterizes a coordinated turn is proposed. Formulas are developed which relate the aircraft angular rates and pitch and roll attitudes to the turn parameters, angle of attack, and inherent sideslip. A steep, coordinated helical turn at extreme angles of attack with inherent sideslip is of primary interest. The bank angle of the aircraft can differ markedly from the tilt angle of the normal load factor. The normal load factor can also differ substantially from the accelerometer reading along the vertical body axis of the aircraft. Sideslip has a strong influence on the pitch attitude and roll rate of the helicopter. Pitch rate is independent of angle of attack in a coordinated turn and in the absence of sideslip, angular rates about the stability axes are independent of the aerodynamic characteristics of the aircraft

Double-discharge copper-vapor laser

Power supply for discharge pulses consists of two capacitors that are made to discharge synchronously with adjustable time intervals. First pulse is switched with hydrogen thyratron, and second by spark gap. Lasing action peaks for appropriate combination of these two parameters

Analytical and flight investigation of the influence of rotor and other high-order dynamics on helicopter flight-control system bandwidth

The increasing use of highly augmented digital flight-control systems in modern military helicopters prompted an examination of the influence of rotor dynamics and other high-order dynamics on control-system performance. A study was conducted at NASA Ames Research Center to correlate theoretical predictions of feedback gain limits in the roll axis with experimental test data obtained from a variable-stability research helicopter. Feedback gains, the break frequency of the presampling sensor filter, and the computational frame time of the flight computer were systematically varied. The results, which showed excellent theoretical and experimental correlation, indicate that the rotor-dynamics, sensor-filter, and digital-data processing delays can severely limit the usable values of the roll-rate and roll-attitude feedback gains

Size versus truthfulness in the house allocation problem

We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects. We focus on truthful mechanisms without monetary transfers for finding large Pareto optimal matchings. It is straightforward to show that no deterministic truthful mechanism can approximate a maximum cardinality Pareto optimal matching with ratio better than 2. We thus consider randomized mechanisms. We give a natural and explicit extension of the classical Random Serial Dictatorship Mechanism (RSDM) specifically for the House Allocation problem where preference lists can include ties. We thus obtain a universally truthful randomized mechanism for finding a Pareto optimal matching and show that it achieves an approximation ratio of eovere-1. The same bound holds even when agents have priorities (weights) and our goal is to find a maximum weight (as opposed to maximum cardinality) Pareto optimal matching. On the other hand we give a lower bound of 18 over 13 on the approximation ratio of any universally truthful Pareto optimal mechanism in settings with strict preferences. In the case that the mechanism must additionally be non-bossy, an improved lower bound of eovere-1 holds. This lower bound is tight given that RSDM for strict preference lists is non-bossy. We moreover interpret our problem in terms of the classical secretary problem and prove that our mechanism provides the best randomized strategy of the administrator who interviews the applicants