An optimal sequential procedure for a buying-selling problem with independent observations

We consider a buying-selling problem when two stops of a sequence of independent random variables are required. An optimal stopping rule and the value of a game are obtained.

Quantitative analysis and characterization of biofunctionalized fluorescent silica particles

A strategy for the production and subsequent characterization of biofunctionalized silica particles is presented. The particles were engineered to produce a bifunctional material capable of both (a) the attachment of fluorescent dyes for particle encoding and (b) the sequential modification of the surface of the particles to couple oligonucleotide probes. A combination of microscopic and analytical methods is implemented to demonstrate that modification of the particles with 3-aminopropyl trimethoxysilane results in an even distribution of amine groups across the particle surface. Evidence is provided to indicate that there are negligible interactions between the bound fluorescent dyes and the attached biomolecules. A unique approach was adopted to provide direct quantification of the oligonucleotide probe loading on the particle surface through X-ray photoelectron spectroscopy, a technique which may have a major impact for current researchers and users of bead-based technologies. A simple hybridization assay showing high sequence specificity is included to demonstrate the applicability of these particles to DNA screening.

Programs as paths: An approach to timing constraint analysis

A program can be decomposed into a set of possible execution paths. These can be described in terms of primitives such as assignments, assumptions and coercions, and composition operators such as sequential composition and nondeterministic choice as well as finitely or infinitely iterated sequential composition. Some of these paths cannot possibly be followed (they are dead or infeasible), and they may or may not terminate. Decomposing programs into paths provides a foundation for analyzing properties of programs. Our motivation is timing constraint analysis of real-time programs, but the same techniques can be applied in other areas such as program testing. In general the set of execution paths for a program is infinite. For timing analysis we would like to decompose a program into a finite set of subpaths that covers all possible execution paths, in the sense that we only have to analyze the subpaths in order to determine suitable timing constraints that cover all execution paths.