IR Dust Bubbles: Probing the Detailed Structure and Young Massive Stellar Populations of Galactic HII Regions

We present an analysis of wind-blown, parsec-sized, mid-infrared bubbles and associated star-formation using GLIMPSE/IRAC, MIPSGAL/MIPS and MAGPIS/VLA surveys. Three bubbles from the Churchwell et al. (2006) catalog were selected. The relative distribution of the ionized gas (based on 20 cm emission), PAH emission (based on 8 um, 5.8 um and lack of 4.5 um emission) and hot dust (24 um emission) are compared. At the center of each bubble there is a region containing ionized gas and hot dust, surrounded by PAHs. We identify the likely source(s) of the stellar wind and ionizing flux producing each bubble based upon SED fitting to numerical hot stellar photosphere models. Candidate YSOs are also identified using SED fitting, including several sites of possible triggered star formation.Comment: 37 pages, 17 figure

A discrete geometric model of concurrent program execution

A trace of the execution of a concurrent object-oriented program can be displayed in two-dimensions as a diagram of a non-metric finite geometry. The actions of a programs are represented by points, its objects and threads by vertical lines, its transactions by horizontal lines, its communications and resource sharing by sloping arrows, and its partial traces by rectangular figures. We prove informally that the geometry satisfies the laws of Concurrent Kleene Algebra (CKA); these describe and justify the interleaved implementation of multithreaded programs on computer systems with a lesser number of concurrent processors. More familiar forms of semantics (e.g., verification-oriented and operational) can be derived from CKA. Programs are represented as sets of all their possible traces of execution, and non-determinism is introduced as union of these sets. The geometry is extended to multiple levels of abstraction and granularity; a method call at a higher level can be modelled by a specification of the method body, which is implemented at a lower level. The final section describes how the axioms and definitions of the geometry have been encoded in the interactive proof tool Isabelle, and reports on progress towards automatic checking of the proofs in the paper

Formal Proof of SCHUR Conjugate Function

The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie groups and symmetric functions. The core of the computations relies on enumeration and manipulation of combinatorial structures. As a first "proof of concept", we present a formal proof of the conjugate function, written in C. This function computes the conjugate of an integer partition. To formally prove this program, we use the Frama-C software. It allows us to annotate C functions and to generate proof obligations, which are proved using several automated theorem provers. In this paper, we also draw on methodology, discussing on how to formally prove this kind of program.Comment: To appear in CALCULEMUS 201

Dynamics of Line-Driven Winds from Disks in Cataclysmic Variables. II. Mass Loss Rates and Velocity Laws

We analyze the dynamics of 2D stationary line-driven winds from accretion disks in cataclysmic variables (CVs), by generalizing the Castor, Abbott and Klein theory. In paper 1, we have solved the wind Euler equation, derived its two eigenvalues, and addressed the solution topology and wind geometry. Here, we focus on mass loss and velocity laws. We find that disk winds, even in luminous novalike variables, have low optical depth, even in the strongest driving lines. This suggests that thick-to-thin transitions in these lines occur. For disks with a realistic radial temperature, the mass loss is dominated by gas emanating from the inner decade in r. The total mass loss rate associated with a luminosity 10 Lsun is 10^{-12} Msun/yr, or 10^{-4} of the mass accretion rate. This is one order of magnitude below the lower limit obtained from P Cygni lines, when the ionizing flux shortwards of the Lyman edge is supressed. The difficulties with such small mass loss rates in CVs are principal, and confirm our previous work. We conjecture that this issue may be resolved by detailed nonLTE calculations of the line force within the context of CV disk winds, and/or better accounting for the disk energy distribution and wind ionization structure. We find that the wind velocity profile is well approximated by the empirical law used in kinematical modeling. The acceleration length scale is given by the footpoint radius of the wind streamline in the disk. This suggests an upper limit of 10 Rwd to the acceleration scale, which is smaller by factors of a few as compared to values derived from line fitting.Comment: 14 pages, 3 Postscript figures, also from http://www.pa.uky.edu/~shlosman/publ.html. Astrophysical Journal, submitte

Recovering Grammar Relationships for the Java Language Specification

Grammar convergence is a method that helps discovering relationships between different grammars of the same language or different language versions. The key element of the method is the operational, transformation-based representation of those relationships. Given input grammars for convergence, they are transformed until they are structurally equal. The transformations are composed from primitive operators; properties of these operators and the composed chains provide quantitative and qualitative insight into the relationships between the grammars at hand. We describe a refined method for grammar convergence, and we use it in a major study, where we recover the relationships between all the grammars that occur in the different versions of the Java Language Specification (JLS). The relationships are represented as grammar transformation chains that capture all accidental or intended differences between the JLS grammars. This method is mechanized and driven by nominal and structural differences between pairs of grammars that are subject to asymmetric, binary convergence steps. We present the underlying operator suite for grammar transformation in detail, and we illustrate the suite with many examples of transformations on the JLS grammars. We also describe the extraction effort, which was needed to make the JLS grammars amenable to automated processing. We include substantial metadata about the convergence process for the JLS so that the effort becomes reproducible and transparent

Fluent temporal logic for discrete-time event-based models

Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-based and state-based formalisms is defined through fluents which are state predicates whose value are determined by the occurrences of initiating and terminating events that make the fluents values become true or false, respectively. The existing fluent temporal logic is convenient for reasoning about untimed event-based models but difficult to use for timed models. The paper extends fluent temporal logic with temporal operators for modelling timed properties of discrete-time event-based models. It presents two approaches that differ on whether the properties model the system state after the occurrence of each event or at a fixed time rate. Model checking of timed properties is made possible by translating them into the existing untimed framework. Copyright 2005 ACM

The RMS Survey: 6 cm continuum VLA observations towards candidate massive YSOs in the northern hemisphere

(Abridged) Context: The Red MSX Source (RMS) survey is an ongoing multi-wavelength observational programme designed to return a large, well-selected sample of massive young stellar objects (MYSOs). We have identified $\sim$2000 MYSO candidates located throughout the Galaxy by comparing the colours of MSX and 2MASS point sources to those of known MYSOs. Aims: To identify the populations of UCHII regions and PNe within the sample and examine their Galactic distribution. Method: We have conducted high resolution radio continuum observations at 6 cm towards 659 MYSO candidates in the northern hemisphere (10\degr< l < 250\degr) using the VLA. In addition to these targeted observations we present archival data towards a further 315 RMS sources extracted from a previous VLA survey of the inner Galaxy. Results: We find radio emission towards 272 ($\sim$27% of the observed sample). Using results from other parts of our multi-wavelength survey we separate these RMS-radio associations into two distinct types of objects, classifying 51 as PNe and a further 208 as either compact or UC HII regions. Using this well selected sample of HII regions we estimate their Galactic scale height to be 0.6\degr. Conclusions: Using radio continuum and archival data we have identified 79 PNe and 391 HII regions within the northern RMS catalogue. We estimate the total fraction of contamination by PNe in the RMS sample is of order 10%. The sample of HII regions is probably the best representation to date of the Galactic population of HII regions as a whole.Comment: Accepted for publication in Astronomy and Astrophysics. 15 pages, 9 figures and 5 tables. Full versions of Tables 3, 4 and 5 and Figs. 2, 4 and 7 will only be available via CDS or the RMS website at http:/www.ast.leeds.ac.uk/cgi-bin/RMS/RMS_VLA_IMAGES.cg

On the operating unit size of load/store architectures

We introduce a strict version of the concept of a load/store instruction set architecture in the setting of Maurer machines. We take the view that transformations on the states of a Maurer machine are achieved by applying threads as considered in thread algebra to the Maurer machine. We study how the transformations on the states of the main memory of a strict load/store instruction set architecture that can be achieved by applying threads depend on the operating unit size, the cardinality of the instruction set, and the maximal number of states of the threads.Comment: 23 pages; minor errors corrected, explanations added, references replace

Extending Hybrid CSP with Probability and Stochasticity

Probabilistic and stochastic behavior are omnipresent in computer controlled systems, in particular, so-called safety-critical hybrid systems, because of fundamental properties of nature, uncertain environments, or simplifications to overcome complexity. Tightly intertwining discrete, continuous and stochastic dynamics complicates modelling, analysis and verification of stochastic hybrid systems (SHSs). In the literature, this issue has been extensively investigated, but unfortunately it still remains challenging as no promising general solutions are available yet. In this paper, we give our effort by proposing a general compositional approach for modelling and verification of SHSs. First, we extend Hybrid CSP (HCSP), a very expressive and process algebra-like formal modeling language for hybrid systems, by introducing probability and stochasticity to model SHSs, which is called stochastic HCSP (SHCSP). To this end, ordinary differential equations (ODEs) are generalized by stochastic differential equations (SDEs) and non-deterministic choice is replaced by probabilistic choice. Then, we extend Hybrid Hoare Logic (HHL) to specify and reason about SHCSP processes. We demonstrate our approach by an example from real-world.Comment: The conference version of this paper is accepted by SETTA 201

Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms

We describe a global optimization technique using `basin-hopping' in which the potential energy surface is transformed into a collection of interpenetrating staircases. This method has been designed to exploit the features which recent work suggests must be present in an energy landscape for efficient relaxation to the global minimum. The transformation associates any point in configuration space with the local minimum obtained by a geometry optimization started from that point, effectively removing transition state regions from the problem. However, unlike other methods based upon hypersurface deformation, this transformation does not change the global minimum. The lowest known structures are located for all Lennard-Jones clusters up to 110 atoms, including a number that have never been found before in unbiased searches.Comment: 8 pages, 3 figures, revte