Advanced turboprop vibratory characteristics

The assembly of SR5 advanced turboprop blades to develop a structural dynamic data base for swept props is reported. Steady state blade deformation under centrifugal loading and vibratory characteristics of the rotor assembly were measured. Vibration was induced through a system of piezoelectric crystals attached to the blades. Data reduction procedures are used to provide deformation, mode shape, and frequencies of the assembly at predetermined speeds

Schur Q-functions and degeneracy locus formulas for morphisms with symmetries

We give closed-form formulas for the fundamental classes of degeneracy loci associated with vector bundle maps given locally by (not necessary square) matrices which are symmetric (resp. skew-symmetric) w.r.t. the main diagonal. Our description uses essentially Schur Q-polynomials of a bundle, and is based on a certain push-forward formula for these polynomials in a Grassmann bundle.Comment: 22 pages, AMSTEX, misprints corrected, exposition improved. to appear in the Proceedings of Intersection Theory Conference in Bologna, "Progress in Mathematics", Birkhause

Monomial transformations of the projective space

We prove that, over any field, the dimension of the indeterminacy locus of a rational transformation $f$ of $P^n$ which is defined by monomials of the same degree $d$ with no common factors is at least $(n-2)/2$, provided that the degree of $f$ as a map is not divisible by $d$. This implies upper bounds on the multidegree of $f$

Trends in life cycle greenhouse gas emissions of future light duty electric vehicles

The majority of previous studies examining life cycle greenhouse gas (LCGHG) emissions of battery electric vehicles (BEVs) have focused on efficiency-oriented vehicle designs with limited battery capacities. However, two dominant trends in the US BEV market make these studies increasingly obsolete: sales show significant increases in battery capacity and attendant range and are increasingly dominated by large luxury or high-performance vehicles. In addition, an era of new use and ownership models may mean significant changes to vehicle utilization, and the carbon intensity of electricity is expected to decrease. Thus, the question is whether these trends significantly alter our expectations of future BEV LCGHG emissions. To answer this question, three archetypal vehicle designs for the year 2025 along with scenarios for increased range and different use models are simulated in an LCGHG model: an efficiency-oriented compact vehicle; a high performance luxury sedan; and a luxury sport utility vehicle. While production emissions are less than 10% of LCGHG emissions for today's gasoline vehicles, they account for about 40% for a BEV, and as much as two-thirds of a future BEV operated on a primarily renewable grid. Larger battery systems and low utilization do not outweigh expected reductions in emissions from electricity used for vehicle charging. These trends could be exacerbated by increasing BEV market shares for larger vehicles. However, larger battery systems could reduce per-mile emissions of BEVs in high mileage applications, like on-demand ride sharing or shared vehicle fleets, meaning that trends in use patterns may countervail those in BEV design

RadVel: The Radial Velocity Modeling Toolkit

RadVel is an open source Python package for modeling Keplerian orbits in radial velocity (RV) time series. RadVel provides a convenient framework to fit RVs using maximum a posteriori optimization and to compute robust confidence intervals by sampling the posterior probability density via Markov Chain Monte Carlo (MCMC). RadVel allows users to float or fix parameters, impose priors, and perform Bayesian model comparison. We have implemented realtime MCMC convergence tests to ensure adequate sampling of the posterior. RadVel can output a number of publication-quality plots and tables. Users may interface with RadVel through a convenient command-line interface or directly from Python. The code is object-oriented and thus naturally extensible. We encourage contributions from the community. Documentation is available at http://radvel.readthedocs.io.Comment: prepared for resubmission to PAS

A hybrid 3d reconstruction/registration algorithm for correction of head motion in emission tomography

Even with head restraint, small head movements can occur during data acquisition for emission tomography, sufficiently large to result in detectable artifacts in the final reconstruction. Direct measurement of motion can be cumbersome and difficult to implement, whereas previous attempts to correct for motion based on measured projections have been limited to simple translation orthogonal to the projection. A fully 3D algorithm is proposed that estimates the patient orientation at any time based on the projection of motion-corrupted data, with incorporation of the measured motion within subsequent OSEM sub-iterations. Preliminary studies have been performed using a digital version of the Hoffman brain phantom. Movement was simulated by constructing a mixed set of projections in two discrete positions of the phantom. The algorithm determined the phantom orientation that best aligned each constructed projection with its corresponding, measured projection. In the case of simulated movement of 24 of 64 projections, all mis-positioned projections were correctly identified. The algorithm resulted in a reduction of mean square difference (MSD) between motion corrected and motion-free reconstructions compared to the MSD between uncorrected and motion-free reconstructions by a factor of 2.7

Simultaneous Arithmetic Progressions on Algebraic Curves

A simultaneous arithmetic progression (s.a.p.) of length k consists of k points (x_i, y_\sigma(i)), where x_i and y_i are arithmetic progressions and \sigma is a permutation. Garcia-Selfa and Tornero asked whether there is a bound on the length of an s.a.p. on an elliptic curve in Weierstrass form over Q. We show that 4319 is such a bound for curves over R. This is done by considering translates of the curve in a grid as a graph. A simple upper bound is found for the number of crossings and the 'crossing inequality' gives a lower bound. Together these bound the length of an s.a.p. on the curve. We then use a similar method to extend the result to arbitrary real algebraic curves. Instead of considering s.a.p.'s we consider k^2/3 points in a grid. The number of crossings is bounded by Bezout's Theorem. We then give another proof using a result of Jarnik bounding the number of grid points on a convex curve. This result applies as any real algebraic curve can be broken up into convex and concave parts, the number of which depend on the degree. Lastly, these results are extended to complex algebraic curves.Comment: 11 pages, 6 figures, order of email addresses corrected 12 pages, closing remarks, a reference and an acknowledgment adde

Character Formulae and Partition Functions in Higher Dimensional Conformal Field Theory

A discussion of character formulae for positive energy unitary irreducible representations of the the conformal group is given, employing Verma modules and Weyl group reflections. Product formulae for various conformal group representations are found. These include generalisations of those found by Flato and Fronsdal for SO(3,2). In even dimensions the products for free representations split into two types depending on whether the dimension is divisible by four or not.Comment: 43 pages, uses harvmac,version 2 2 references added, minor typos correcte

Uniform Substitution for Differential Game Logic

This paper presents a uniform substitution calculus for differential game logic (dGL). Church's uniform substitutions substitute a term or formula for a function or predicate symbol everywhere. After generalizing them to differential game logic and allowing for the substitution of hybrid games for game symbols, uniform substitutions make it possible to only use axioms instead of axiom schemata, thereby substantially simplifying implementations. Instead of subtle schema variables and soundness-critical side conditions on the occurrence patterns of logical variables to restrict infinitely many axiom schema instances to sound ones, the resulting axiomatization adopts only a finite number of ordinary dGL formulas as axioms, which uniform substitutions instantiate soundly. This paper proves soundness and completeness of uniform substitutions for the monotone modal logic dGL. The resulting axiomatization admits a straightforward modular implementation of dGL in theorem provers