Visible-light-sensitive photocatalytic reaction on chromium-containing mesoporous silica: selective partial oxidation of propane with molecular oxygen

The photocatalytic reactivities of chromium-containing mesoporous silica molecular sieves (Cr-HMS) under visible light irradiation have been investigated. Cr-HMS involves tetrahedral chromium oxide (Cr-oxide) moieties which are highly dispersed and incorporated in the framework of molecular sieve with two terminal Cr=O groups. In the presence of propane with molecular oxygen, a partial oxidation proceeded under visible light irradiation to produce acetone and acrolein, with high selectivity, while a complete oxidation proceeded under UV light irradiation mainly to produce CO₂. The charge-transfer excited state of the tetrahedral Cr-oxide moieties plays a significant role in the photocatalytic reactions.     

Addition–fragmentation chain transfer: Molecular weight distributions and retardation in the system methyl methacrylate/methyl α‐(bromomethyl)acrylate

A detailed investigation of addition–fragmentation chain transfer (AFCT) in the free‐radical polymerization of methyl methacrylate (MMA) in the presence of methyl α‐(bromomethyl)acrylate (MBMA) was carried out to elucidate mechanistic details with efficient macromonomer synthesis as an underlying goal. Advanced modeling techniques were used in connection with the experimental work. Curve fitting of simulated and experimental molecular weight distributions with respect to the rate coefficient for addition of propagating radicals to MBMA (k_add) over 60–120 °C resulted in E_add = 21.7 kJ mol^?1 and A_add = 2.18 × 10⁶ M^?1 s^?1 and a very weak temperature dependence of the chain‐transfer constant (E_add ≈ E_p). The rate coefficient for fragmentation of adduct radicals at 60 °C was estimated as k_f ≈ 39 s^?1 on the basis of experimental data of the MMA conversion and the concentration of 2‐carbomethoxy‐2‐propenyl end groups. The approach developed is generic and can be applied to any AFCT system in which copolymerization does not occur and in which the resulting unsaturated end groups do not undergo further reactions. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 2640–2650, 2004     

On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm

In this paper we focus on the problem of identifying the index sets P(x):=i|x_i>0, N(x):={i|F_i(x)>0 and C(x):=i|x_i=F_i(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10     

On Modular Forms Arising from a Differential Equation of Hypergeometric Type

Modular and quasimodular solutions of a specific second order differential equation in the upper-half plane, which originates from a study of supersingular j-invariants in the first author's work with Don Zagier, are given explicitly. Positivity of Fourier coefficients of some of the solutions as well as a characterization of the differential equation are also discussed.     

A globally convergent Newton method for solving strongly monotone variational inequalities

Variational inequality problems have been used to formulate and study equilibrium problems, which arise in many fields including economics, operations research and regional sciences. For solving variational inequality problems, various iterative methods such as projection methods and the nonlinear Jacobi method have been developed. These methods are convergent to a solution under certain conditions, but their rates of convergence are typically linear. In this paper we propose to modify the Newton method for variational inequality problems by using a certain differentiable merit function to determine a suitable step length. The purpose of introducing this merit function is to provide some measure of the discrepancy between the solution and the current iterate. It is then shown that, under the strong monotonicity assumption, the method is globally convergent and, under some additional assumptions, the rate of convergence is quadratic. Limited computational experience indicates the high efficiency of the proposed method.     

Application of Novel Focusing Mirrors in Gyrotron Transmission Lines

A novel focusing mirror based on the shifting of the beam phase according to the Gaussian beam optics enabled us to realize a focusing elements with different focal lengths in different directions and to convert the gyrotron output into a Gaussian-like beam. In this paper, we compare the quality of beams produced by the new system (which includes novel mirrors) and a conventional system consisting of a quasi-optical antenna, an ellipsoidal mirror and two parabolic cylinder mirrors.     

Reconstruction of the Point-Spread Function of the Human Eye Using a New Phase-Retrieval Algorithm

The double-pass method is thought to obtain the point spread function (PSF) in human eyes based on two techniques: the symmetric double-pass method using the same pupil size and the asymmetric double-pass method using a different pupil size. The symmetric double-pass method provides autocorrelation of the retinal PSF and, thus, the modulation transfer function. The asymmetric double-pass method provides low-frequency partial-phase information and the partial phase-retrieval algorithm is applied to obtain the complete-phase information, and to estimate the PSF. The partial phase-retrieval algorithm is based on the iteration method proposed by Fineup and Kowalczyk and requires a lengthy computation. In this study, we propose a new high-speed phase-retrieval algorithm based on the property that the real and imaginary parts of optical transfer functions (OTFs) continuously change in value.     

Measuring Light Field of Light Source with High Directional Resolution Using Mirrored Ball and Pinhole Camera

This paper presents a method of measuring a light field of a light source with high directional resolution using a mirrored ball and a pinhole camera. The light field describes a spatial and directional distribution of radiances from the light source. The directional distribution is expanded by a reflection on the mirrored ball, and the radiances are measured by a charge-coupled device (CCD) camera with a pinhole lens. The light source is laterally moved by a robot arm to measure the directionally expanded light field, and each pixel on a CCD can obtain the radiances from the light source through the pinhole lens with high directional resolution. The light field is estimated from the pixel value and the position of each pixel using a ray tracing technique. The light field of a krypton lamp was experimentally measured by the proposed method, and the accuracy of the measurement was evaluated against the irradiances measured by a spectro-radiometer at sample points.     

An optimal design of collateralized mortgage obligation with PAC-companion structure using dynamic cash reserve

This paper presents a model for optimally designing a collateralized mortgage obligation (CMO) with a planned amortization class (PAC)-companion structure using dynamic cash reserve. In this structure, the mortgage pool’s cash flow is allocated by rule to the two bond classes such that PAC bondholders receive substantial prepayment protection, that protection being provided by the companion bondholders. The structure we propose provides greater protection to the PAC bondholders than current structures during periods of rising interest rates when this class of bondholders faces greater extension risk. We do so by allowing a portion of the cash flow from the collateral to be reserved to meet the PAC’s scheduled cash flow in subsequent periods. The greater protection is provided by the companion bondholders exposure to interest loss. To tackle this problem, we transform the problem of designing the optimal PAC-companion structure into a standard stochastic linear programming problem which can be solved efficiently. Moreover, we present an extended model by considering the quality of the companion bond and by relaxing the PAC bondholder shortfall constraint. Based on numerical experiments through Monte Carlo simulation, we show the utility of the proposed model.     

Primal-dual proximal point algorithm for linearly constrained convex programming problems

A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs.