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

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

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

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

SOAP: Efficient Feature Selection of Numeric Attributes

The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simpler and easy to understand. Depending on the method to apply: starting point, search organization, evaluation strategy, and the stopping criterion, there is an added cost to the classification algorithm that we are going to use, that normally will be compensated, in greater or smaller extent, by the attribute reduction in the classification model. The algorithm (SOAP: Selection of Attributes by Projection) has some interesting characteristics: lower computational cost (O(mn log n) m attributes and n examples in the data set) with respect to other typical algorithms due to the absence of distance and statistical calculations; with no need for transformation. The performance of SOAP is analysed in two ways: percentage of reduction and classification. SOAP has been compared to CFS [6] and ReliefF [11]. The results are generated by C4.5 and 1NN before and after the application of the algorithms

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

Events, Neural Systems and Time Series

Different types of events occurring in computer, neural, business, and environmental systems are discussed. Though events in these different domains do differ, there are also important commonalities. We discuss the issues arising from automating complex event handling systems

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