Design of neutral, mono- or di-cationic water-soluble trihydrazidophosphoradamantanes

The versatile behavior of a trihydrazidophosphoradamantane allowing the synthesis of a variety of neutral, mono- or di-cationic water-soluble molecules of potential interest for biphasic catalysis is reported.     

Germanium growth on Br-terminated Si(1 0 0)

The consequences of Ge deposition on Br-terminated Si(1 0 0) were studied with scanning tunneling microscopy at ambient temperature after annealing at 650 K. One monolayer of Br was sufficient to prevent the formation of Ge huts beyond the critical thickness of 3 ML. This is possible because Br acts as a surfactant whose presence lowered the diffusivity of Ge adatoms. Hindered mobility was manifest at low coverage through the formation of short Ge chains. Further deposition resulted in the extension and connection of the Ge chains and gave rise to the buildup of incomplete layers. The deposition of 7 ML of Ge resulted in a rough surface characterized by irregularly shaped clusters. A short 800 K anneal desorbed the Br and allowed Ge atoms to reorganize into the more energetically favorable “hut” structures produced by conventional Ge overlayer growth on Si(1 0 0).     

Sequential Importance Sampling Algorithms for Dynamic Stochastic Programming

This paper gives a comprehensive treatment of EVPI-based sequential importance sampling algorithms for dynamic (multistage) stochastic programming problems. Both theory and computational algorithms are discussed. Under general assumptions it is shown that both an expected value of perfect information (EVPI) process and the corresponding marginal EVPI process (the supremum norm of the conditional expectation of its generalized derivative) are nonanticipative nonnegative supermartingales. These processes are used as importance criteria in the class of sampling algorithms treated in the paper. When their values are negligible at a node of the current sample problem scenario tree, scenarios descending from the node are replaced by a single scenario at the next iteration. On the other hand, high values lead to increasing the number of scenarios descending from the node. Both the small sample and asymptotic properties of the sample problem estimates arising from the algorithms are established, and the former are evaluated numerically in the context of a financial planning problem. Finally, current and future research is described. Bibliography: 49 titles. __________ Published in Zapiski Nauchnykh Seminarov POMI, Vol. 312, 2004, pp. 94–129.     

Randomized greedy matching

We consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm (RGA) usually only obtains a matching close in size to that guaranteed by worst-case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that the RGA performs significantly better than the worst-case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is tight.     

Estimating a reduced rank regression model for non-normal variables

A method using third order moments for estimating the regression coefficients as well as the latent state scores of the reduced-rank regression model when the latent variable(s) are non-normally distributed is presented in this paper. It is shown that the factor analysis type indeterminacy of the regression coefficient matrices is eliminated. A real life example of the proposed method is presented. Differences of this solution with the reduced-rank regression eigen solution are discussed.     

Stationary turbulent closure via the Hopf functional equation

Exact closed-form solutions are exhibited for the Hopf equation for stationary incompressible 3D Navier-Stokes flow, for the cases of homogeneous forced flow (including a solution with depleted nonlinearity) and inhomogeneous flow with arbitrary boundary conditions. This provides an exact method for computing two- and higher-point moments, given the mean flow.     

Study of the reaction238U (α, α′f) atE α=480 MeV

The excitation function of the fission probability P _E E _x) for²³⁸U has been measured in the reaction²³⁸U(α, α′ f) at 480 MeV bombarding energy. The reaction mechanism of this reaction is discussed for excitation energies belowB _nf , the threshold for second chance fission, and aboveB _nf up toE _x =37 MeV. In comparing with results from fission induced by photons and by particle transfer reactions the (α, α′f) reaction gives too low values for the fission probabilityP _f at excitation energies well aboveB _nE . The role of the quasi-elastic knock-out process in this reaction is discussed.     

IFS attractors and Cantor sets

We build a metric space which is homeomorphic to a Cantor set but cannot be realized as the attractor of an iterated function system. We give also an example of a Cantor set K in R³ such that every homeomorphism f of R³ which preserves K coincides with the identity on K.     

τ-CHEBYSHEV AND τ-COCHEBYSHEV SUBPSACES OF BANACH SPACES

The concepts of quasi-Chebyshev and weakly-Chebyshev and σ-Chebyshev were defined [3 - 7], andas a counterpart to best approximation in normed linear spaces, best coapprozimation was introduced by Franchetti and Furi^[1]. In this research, we shall define τ-Chebyshev subspaces and τ-cochebyshev subspaces of a Banach space, in which the property τ is compact or weakly-compact, respectively. A set of necessary and sufficient theorems under which a subspace is τ-Chebyshev is defined.