Canonical desingularization in characteristic zero by blowing up the maximum strata of a local invariant

Summary. This article contains an elementary constructive proof of resolution of singularities in characteristic zero. Our proof applies in particular to schemes of finite type and to analytic spaces (so we recover the great theorems of Hironaka). We introduce a discrete local invariant whose maximum locus determines a smooth centre of blowing up, leading to desingularization. To define , we need only to work with a category of local-ringed spaces satisfying certain natural conditions. If , then depends only on . More generally, is defined inductively after any sequence of blowings-up whose centres have only normal crossings with respect to the exceptional divisors and lie in the constant loci of . The paper is self-contained and includes detailed examples. One of our goals is that the reader understand the desingularization theorem, rather than simply “know” it is true. Oblatum 27-VII-1995 & 30-V-1996     

Detailed nuclear structure studies far from stability

State-of-the-art spectroscopy of nuclei far from stability has achieved an extraordinary level of sophistication and detail in the last ten years. In principle, if a state can be populated, it can be characterized by its energy, spin, parity, and major decay paths. Sometimes its lifetime can be measured. In practice, one is confronted with enormous complexity. To convert raw spectroscopic data into nuclear structure data involves a complex process of disentangling gamma rays and conversion electrons into decay schemes. Specifically, coincidence techniques, especially coincidence intensities, play a crucial role in this process. Recent examples and methods from work done at UNISOR are presented.     

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms

This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems (MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented. An erratum to this article is available at .     

Butyltins in california river and lake marina waters

Butyltins were analyzed in waters from California river and lake marinas and were detected at the part per trillion (ppt) level in most locations. The tributyltin:dibutyltin (TBT/DBT) ratios in the fresh waters were similar to those in their saline counterparts indicating like rates of degradation in the two salinity regimes.     

Asymptotic properties of computationally efficient alternative estimators for a class of multivariate normal models

Parameters of Gaussian multivariate models are often estimated using the maximum likelihood approach. In spite of its merits, this methodology is not practical when the sample size is very large, as, for example, in the case of massive georeferenced data sets. In this paper, we study the asymptotic properties of the estimators that minimize three alternatives to the likelihood function, designed to increase the computational efficiency. This is achieved by applying the information sandwich technique to expansions of the pseudo-likelihood functions as quadratic forms of independent normal random variables. Theoretical calculations are given for a first-order autoregressive time series and then extended to a two-dimensional autoregressive process on a lattice. We compare the efficiency of the three estimators to that of the maximum likelihood estimator as well as among themselves, using numerical calculations of the theoretical results and simulations.     

Pentopyranosyl Oligonucleotide Systems. 9th Communication

Pyranosyl‐RNA (‘p‐RNA’ ) is an oligonucleotide system isomeric to natural RNA and composed of the very same building blocks as RNA. Its generational, chemical, and informational properties are deemed to be those of an alternative nucleic acid system that could have been a candidate in Nature's evolutionary choice of the molecular basis of genetic function. We consider the study of the chemistry of p‐RNA as etiologically relevant in the sense that knowledge of its structural, chemical, and informational properties on the chemical level offers both a perspective and reference points for the recognition of specific structural assets of the RNA structure that made it the (supposedly) superior system among possible alternatives and, therefore, the system that became part of biology as we know it today. The paper describes the chemical synthesis of β‐d‐ (and L )‐ribopyranosyl‐(4′→2′)‐oligonucleotide sequences, presents a resume of their structural and chemical properties, and cautiously discusses what we may and may not have learned from the pyranosyl isomer of RNA with respect to the conundrum of RNA's origin.