Neighbour transitivity on codes in Hamming graphs

We consider a \emph{code} to be a subset of the vertex set of a \emph{Hamming graph}. In this setting a \emph{neighbour} of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the \emph{set of neighbours} of the code. We call these codes \emph{neighbour transitive}. We obtain sufficient conditions for a neighbour transitive group to fix the code setwise. Moreover, we construct an infinite family of neighbour transitive codes, with \emph{minimum distance} $\delta=4$, where this is not the case. That is to say, knowledge of even the complete set of code neighbours does not determine the code

Proton Stripping to Stretched States in 26-Al, 52-Cr, and 60-Si

This research was sponsored by the National Science Foundation Grant NSF PHy 87-1440

Spectroscopy of A=12 at High Excitation

Supported by the National Science Foundation and Indiana Universit

Correlation Time-of-flight Spectrometry of Ultracold Neutrons

The fearures of the correlation method used in time-of-flight spectrometry of ultracold neutrons are analyzed. The time-of-flight spectrometer for the energy range of ultracold neutrons is described, and results of its testing by measuring spectra of neutrons passing through interference filters are presented.Comment: 16 pages, 5 figure

Queryll: Java Database Queries through Bytecode Rewriting

When interfacing Java with other systems such as databases, programmers must often program in special interface languages like SQL. Code written in these languages often needs to be embedded in strings where they cannot be error-checked at compile-time, or the Java compiler needs to be altered to directly recognize code written in these languages. We have taken a different approach to adding database query facilities to Java. Bytecode rewriting allows us to add query facilities to Java whose correctness can be checked at compile-time but which don't require any changes to the Java language, Java compilers, Java VMs, or IDEs. Like traditional object-relational mapping tools, we provide Java libraries for accessing individual database entries as objects and navigating among them. To express a query though, a programmer simply writes code that takes a Collection representing the entire contents of a database, iterates over each entry like they would with a normal Collection, and choose the entries of interest. The query is fully valid Java code that, if executed, will read through an entire database and copy entries into Java objects where they will be inspected. Executing queries in this way is obviously inefficient, but we have a special bytecode rewriting tool that can decompile Java class files, identify queries in the bytecode, and rewrite the code to use SQL instead. The rewritten bytecode can then be run using any standard Java VM. Since queries use standard Java set manipulation syntax, Java programmers do not need to learn any new syntax. Our system is able to handle complex queries that make use of all the basic relational operations and exhibits performance comparable to that of hand-written SQL

A perpetual switching system in pulmonary capillaries

Of the 300 billion capillaries in the human lung, a small fraction meet normal oxygen requirements at rest, with the remainder forming a large reserve. The maximum oxygen demands of the acute stress response require that the reserve capillaries are rapidly recruited. To remain primed for emergencies, the normal cardiac output must be parceled throughout the capillary bed to maintain low opening pressures. The flow-distributing system requires complex switching. Because the pulmonary microcirculation contains contractile machinery, one hypothesis posits an active switching system. The opposing hypothesis is based on passive switching that requires no regulation. Both hypotheses were tested ex vivo in canine lung lobes. The lobes were perfused first with autologous blood, and capillary switching patterns were recorded by videomicroscopy. Next, the vasculature of the lobes was saline flushed, fixed by glutaraldehyde perfusion, flushed again, and then reperfused with the original, unfixed blood. Flow patterns through the same capillaries were recorded again. The 16-min-long videos were divided into 4-s increments. Each capillary segment was recorded as being perfused if at least one red blood cell crossed the entire segment. Otherwise it was recorded as unperfused. These binary measurements were made manually for each segment during every 4 s throughout the 16-min recordings of the fresh and fixed capillaries (60,000 measurements). Unexpectedly, the switching patterns did not change after fixation. We conclude that the pulmonary capillaries can remain primed for emergencies without requiring regulation: no detectors, no feedback loops, and no effectors—a rare system in biology

Can forest management based on natural disturbances maintain ecological resilience?

Given the increasingly global stresses on forests, many ecologists argue that managers must maintain ecological resilience: the capacity of ecosystems to absorb disturbances without undergoing fundamental change. In this review we ask: Can the emerging paradigm of natural-disturbance-based management (NDBM) maintain ecological resilience in managed forests? Applying resilience theory requires careful articulation of the ecosystem state under consideration, the disturbances and stresses that affect the persistence of possible alternative states, and the spatial and temporal scales of management relevance. Implementing NDBM while maintaining resilience means recognizing that (i) biodiversity is important for long-term ecosystem persistence, (ii) natural disturbances play a critical role as a generator of structural and compositional heterogeneity at multiple scales, and (iii) traditional management tends to produce forests more homogeneous than those disturbed naturally and increases the likelihood of unexpected catastrophic change by constraining variation of key environmental processes. NDBM may maintain resilience if silvicultural strategies retain the structures and processes that perpetuate desired states while reducing those that enhance resilience of undesirable states. Such strategies require an understanding of harvesting impacts on slow ecosystem processes, such as seed-bank or nutrient dynamics, which in the long term can lead to ecological surprises by altering the forest's capacity to reorganize after disturbance

Combination of fast-ion diagnostics in velocity-space tomographies:Paper

Fast-ion Dα (FIDA) and collective Thomson scattering (CTS) diagnostics provide indirect measurements of fastion velocity distribution functions in magnetically confined plasmas. Here we present the first prescription for velocity-space tomographic inversion of CTS and FIDA measurements that can use CTS and FIDA measurements together and that takes uncertainties in such measurements into account. Our prescription is general and could be applied to other diagnostics. We demonstrate tomographic reconstructions of an ASDEX Upgrade beam ion velocity distribution function. First, we compute synthetic measurements from two CTS views and two FIDA views using a TRANSP/NUBEAM simulation, and then we compute joint tomographic inversions in velocity-space from these. The overall shape of the 2D velocity distribution function and the location of the maxima at full and half beam injection energy are well reproduced in velocity-space tomographic inversions, if the noise level in the measurements is below 10%. Our results suggest that 2D fast-ion velocity distribution functions can be directly inferred from fast-ion measurements and their uncertainties, even if the measurements are taken with different diagnostic methods