Operating envelope charts for the Langley 0.3-meter transonic cryogenic wind tunnel

To take full advantage of the unique Reynolds number capabilities of the 0.3-meter Transonic Cryogenic Tunnel (0.3-m TCT) at the NASA Langley Research Center, it was designed to accommodate test sections other than the original, octagonal, three-dimensional test section. A 20- by 60-cm two-dimensional test section was installed in 1976 and was extensively used, primarily for airfoil testing, through the fall of 1984. The tunnel was inactive during 1985 so that a new test section and improved high speed diffuser could be installed in the tunnel circuit. The new test section has solid adaptive top and bottom walls to reduce or eliminate wall interference for two-dimensional testing. The test section is 33- by 33-cm in cross section at the entrance and is 142 cm long. In the planning and running of past airfoil tests in the 0.3-m TCT, the use of operating envelope charts have proven very useful. These charts give the variation of total temperature and pressure with Mach number and Reynolds number. The operating total temperature range of the 0.3-m TCT is from about 78 K to 327 K with total pressures ranging from about 17.5 psia to 88 psia. This report presents the operating envelope charts for the 0.3-m TCT with the adaptive wall tes t section installed. They were all generated based on a 1-foot chord model. The Mach numbers vary from 0.1 to 0.95

Les Pavages d'Anges et de Diables

On utilise la méthode des symboles de Delaney pour classifier à l’aide de I’ordinateur, à homéomorphisme équivariant près, tous les pavages périodiques du plan dont les pavés peuvent être colories de noir et de blanc de telle manière que les pavés se partageant une arête soient de couleurs différentes, que le groupe de symétrie agisse de faGon transitive sur les pavés noirs, que tout pavé possède au moins trois arêtes et que de chaque sommet soient issues au moins trois arêtes.The method of Delaney symbols is used to classify by a computer program all periodic tilings of the Euclidean plane up to equivariant homeomorphisms for which the tiles can be coloured by black and white such that tiles sharing an edge have different colours, the symmetry group acts transitively on the black tiles, every tile has at least three edges and from every vertex at least three edges originate.Peer Reviewe

High Reynolds number tests of a Douglas DLBA 032 airfoil in the Langley 0.3-meter transonic cryogenic tunnel

A wind-tunnel investigation of a Douglas advanced-technology airfoil was conducted in the Langley 0.3-Meter Transonic Cryogenic Tunnel (0.3-m TCT). The temperature was varied from 227 K (409 R) to 100 K (180 R) at pressures ranging from about 159 kPa (1.57 atm) to about 514 kPa (5.07 atm). Mach number was varied from 0.50 to 0.78. These variables provided a Reynolds number range (based on airfoil chord) from 6.0 to 30.0 x 10 to the 6th power. This investigation was specifically designed to: (1) test a Douglas airfoil from moderately low to flight-equivalent Reynolds numbers, and (2) evaluate sidewall-boundary-layer effects on transonic airfoil performance characteristics by a systematic variation of Mach number, Reynolds number, and sidewall-boundary-layer removal. Data are included which demonstrate the effects of fixing transition, Mach number, Reynolds number, and sidewall-boundary-layer removal on the aerodynamic characteristics of the airfoil. Also included are remarks on model design and model structural integrity

1/fα1/f^\alpha spectra in elementary cellular automata and fractal signals

We systematically compute the power spectra of the one-dimensional elementary cellular automata introduced by Wolfram. On the one hand our analysis reveals that one automaton displays $1/f$ spectra though considered as trivial, and on the other hand that various automata classified as chaotic/complex display no $1/f$ spectra. We model the results generalizing the recently investigated Sierpinski signal to a class of fractal signals that are tailored to produce $1/f^{\alpha}$ spectra. From the widespread occurrence of (elementary) cellular automata patterns in chemistry, physics and computer sciences, there are various candidates to show spectra similar to our results.Comment: 4 pages (3 figs included

Lassoing and corraling rooted phylogenetic trees

The construction of a dendogram on a set of individuals is a key component of a genomewide association study. However even with modern sequencing technologies the distances on the individuals required for the construction of such a structure may not always be reliable making it tempting to exclude them from an analysis. This, in turn, results in an input set for dendogram construction that consists of only partial distance information which raises the following fundamental question. For what subset of its leaf set can we reconstruct uniquely the dendogram from the distances that it induces on that subset. By formalizing a dendogram in terms of an edge-weighted, rooted phylogenetic tree on a pre-given finite set X with |X|>2 whose edge-weighting is equidistant and a set of partial distances on X in terms of a set L of 2-subsets of X, we investigate this problem in terms of when such a tree is lassoed, that is, uniquely determined by the elements in L. For this we consider four different formalizations of the idea of "uniquely determining" giving rise to four distinct types of lassos. We present characterizations for all of them in terms of the child-edge graphs of the interior vertices of such a tree. Our characterizations imply in particular that in case the tree in question is binary then all four types of lasso must coincide

Cluster counting: The Hoshen-Kopelman algorithm vs. spanning tree approaches

Two basic approaches to the cluster counting task in the percolation and related models are discussed. The Hoshen-Kopelman multiple labeling technique for cluster statistics is redescribed. Modifications for random and aperiodic lattices are sketched as well as some parallelised versions of the algorithm are mentioned. The graph-theoretical basis for the spanning tree approaches is given by describing the "breadth-first search" and "depth-first search" procedures. Examples are given for extracting the elastic and geometric "backbone" of a percolation cluster. An implementation of the "pebble game" algorithm using a depth-first search method is also described.Comment: LaTeX, uses ijmpc1.sty(included), 18 pages, 3 figures, submitted to Intern. J. of Modern Physics

Recognizing Treelike k-Dissimilarities

A k-dissimilarity D on a finite set X, |X| >= k, is a map from the set of size k subsets of X to the real numbers. Such maps naturally arise from edge-weighted trees T with leaf-set X: Given a subset Y of X of size k, D(Y) is defined to be the total length of the smallest subtree of T with leaf-set Y . In case k = 2, it is well-known that 2-dissimilarities arising in this way can be characterized by the so-called "4-point condition". However, in case k > 2 Pachter and Speyer recently posed the following question: Given an arbitrary k-dissimilarity, how do we test whether this map comes from a tree? In this paper, we provide an answer to this question, showing that for k >= 3 a k-dissimilarity on a set X arises from a tree if and only if its restriction to every 2k-element subset of X arises from some tree, and that 2k is the least possible subset size to ensure that this is the case. As a corollary, we show that there exists a polynomial-time algorithm to determine when a k-dissimilarity arises from a tree. We also give a 6-point condition for determining when a 3-dissimilarity arises from a tree, that is similar to the aforementioned 4-point condition.Comment: 18 pages, 4 figure

Sierpinski signal generates 1/fα1/f^\alpha spectra

We investigate the row sum of the binary pattern generated by the Sierpinski automaton: Interpreted as a time series we calculate the power spectrum of this Sierpinski signal analytically and obtain a unique rugged fine structure with underlying power law decay with an exponent of approximately 1.15. Despite the simplicity of the model, it can serve as a model for $1/f^\alpha$ spectra in a certain class of experimental and natural systems like catalytic reactions and mollusc patterns.Comment: 4 pages (4 figs included). Accepted for publication in Physical Review

Extending canonical Monte Carlo methods II

Previously, we have presented a methodology to extend canonical Monte Carlo methods inspired on a suitable extension of the canonical fluctuation relation $C=\beta^{2}$ compatible with negative heat capacities $C<0$. Now, we improve this methodology by introducing a better treatment of finite size effects affecting the precision of a direct determination of the microcanonical caloric curve $\beta (E) =\partial S(E) /\partial E$, as well as a better implementation of MC schemes. We shall show that despite the modifications considered, the extended canonical MC methods possibility an impressive overcome of the so-called \textit{super-critical slowing down} observed close to the region of a temperature driven first-order phase transition. In this case, the dependence of the decorrelation time $\tau$ with the system size $N$ is reduced from an exponential growth to a weak power-law behavior $\tau(N)\propto N^{\alpha}$, which is shown in the particular case of the 2D seven-state Potts model where the exponent $\alpha=0.14-0.18$.Comment: Version submitted to JSTA