Potential acoustic benefits of circulation control rotors

The fundamental aeroacoustic mechanisms responsible for noise generation on a rotating blade are theoretically examined. Their contribution to the overall rotor sound pressure level is predicted. Results from a theory for airfoil trailing edge noise are presented. Modifications and extensions to other source theories are described where it is necessary to account for unique aspects of circulation control (CC) aerodynamics. The circulation control rotor (CCR), as embodied on an X-wing vertical takeoff and landing (VTOL) aircraft, is used as an example for computational purposes, although many of the theoretical results presented are generally applicable to other CC applications (such as low speed rotors, propellers, compressors, and fixed wing aircraft). Using the analytical models, it is shown that the utilization CC aerodynamics theoretically makes possible unprecedented advances in rotor noise reduction. For the X-wing VTOL these reductions appear to be feasible without incurring significant attendant performance and weight penalties

Digital predictions of complex cylinder packed columns

A digital computational approach has been developed to simulate realistic structures of packed beds. The underlying principle of the method is digitisation of the particles and packing space, enabling the generation of realistic structures. Previous publications [Caulkin, R., Fairweather, M., Jia, X., Gopinathan, N., & Williams, R.A. (2006). An investigation of packed columns using a digital packing algorithm. Computers & Chemical Engineering, 30, 1178–1188; Caulkin, R., Ahmad, A., Fairweather, M., Jia, X., & Williams, R. A. (2007). An investigation of sphere packed shell-side columns using a digital packing algorithm. Computers & Chemical Engineering, 31, 1715–1724] have demonstrated the ability of the code in predicting the packing of spheres. For cylindrical particles, however, the original, random walk-based code proved less effective at predicting bed structure. In response to this, the algorithm has been modified to make use of collisions to guide particle movement in a way which does not sacrifice the advantage of simulation speed. Results of both the original and modified code are presented, with bulk and local voidage values compared with data derived by experimental methods. The results demonstrate that collisions and their impact on packing structure cannot be disregarded if realistic packing structures are to be obtained

On the dynamical structure of the Trojan group of asteroids

Using a semi-analytical approach, domains of possible motion for Trojan asteroids were established. It is shown that stable librating motion is possible for both high inclination and high eccentricity. Frequency distributions were also produced for real Trojan asteroids, against differing libration amplitudes and libration periods

Beware the Non-uniqueness of Einstein Rings

We explain how an approximation to the rings formed by the host galaxies in lensed QSOs can be inferred from the QSO data alone. A simple ring image can be made from any lens model by a simple piece of computer graphics: just plot a contour map of the arrival-time surface with closely-spaced contours. We go on to explain that rings should be (a) sensitive to time-delay ratios between different pairs of images, but (b) very insensitive to H_0. We illustrate this for the well-known quads 1115+080 and 1608+656.Comment: To appear in AJ (circa Aug 2001

Finding the Minimum-Weight k-Path

Given a weighted $n$-vertex graph $G$ with integer edge-weights taken from a range $[-M,M]$, we show that the minimum-weight simple path visiting $k$ vertices can be found in time \tilde{O}(2^k \poly(k) M n^\omega) = O^*(2^k M). If the weights are reals in $[1,M]$, we provide a $(1+\varepsilon)$-approximation which has a running time of \tilde{O}(2^k \poly(k) n^\omega(\log\log M + 1/\varepsilon)). For the more general problem of $k$-tree, in which we wish to find a minimum-weight copy of a $k$-node tree $T$ in a given weighted graph $G$, under the same restrictions on edge weights respectively, we give an exact solution of running time \tilde{O}(2^k \poly(k) M n^3) and a $(1+\varepsilon)$-approximate solution of running time \tilde{O}(2^k \poly(k) n^3(\log\log M + 1/\varepsilon)). All of the above algorithms are randomized with a polynomially-small error probability.Comment: To appear at WADS 201

Fast Witness Extraction Using a Decision Oracle

The gist of many (NP-)hard combinatorial problems is to decide whether a universe of $n$ elements contains a witness consisting of $k$ elements that match some prescribed pattern. For some of these problems there are known advanced algebra-based FPT algorithms which solve the decision problem but do not return the witness. We investigate techniques for turning such a YES/NO-decision oracle into an algorithm for extracting a single witness, with an objective to obtain practical scalability for large values of $n$. By relying on techniques from combinatorial group testing, we demonstrate that a witness may be extracted with $O(k\log n)$ queries to either a deterministic or a randomized set inclusion oracle with one-sided probability of error. Furthermore, we demonstrate through implementation and experiments that the algebra-based FPT algorithms are practical, in particular in the setting of the $k$-path problem. Also discussed are engineering issues such as optimizing finite field arithmetic.Comment: Journal version, 16 pages. Extended abstract presented at ESA'1