Application of the 19F NMR technique to observe binding of the general anesthetic halothane to human serum albumin.

19F NMR techniques were employed to characterize the binding property of the widely used general anesthetic halothane with human serum albumin (HSA). It was found that 19F(1H) NOE and 2D 1H-19F HOESY experiments detected intermolecular NOEs between halothane 19F and HSA protons. Measurements of the diffusion coefficients for halothane were also carried out by 1H and 19F NMR, indicating the interaction of halothane with HSA. The present results indicate that these techniques are very suitable to identify a fluorine-containing ligand binding with a protein receptor in the drug-discovery process.     

Ion-exchange selectivity of anion exchange resin modified with polystyrenesulfonic acid.

In order to change the ion-exchange selectivity of anion-exchange resin, the surface of a gel-type anion exchange resin was modified with anionic polyelectrolyte, polystyrenesulfonic acid. Using this modified resin, the ion-exchange rate of nitrate was little decreased, but that of sulfate was evidently decreased. It is considered that the ion-exchange reaction of the multivalent anion is suppressed by the greater electrostatic repulsive force against the modification layer than that against the monovalent anion. Thus, this modified resin may be suitable for the selective separation of monovalent anions. The influence of the modified condition on the ion-exchange rate was examined. Furthermore, this modified resin was used to separate nitrate ions from sulfate ions in the aqueous solution.     

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     

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.     

Multimode optical fiber demultiplexer-star coupler using a single gradient-index-rod lens and a multi-facet grating

An optical fiber multi-function device consisting of a single gradient-index-rod lens and a multi-facet blazed reflection grating is proposed to simultaneously realize functions of wavelength demultiplexing and optical signal distribution in a multimode optical fiber transmission system. We analyzed the demultiplexing characteristics and the tolerance of optical components using the ray trace method. This device can realize not only low loss optical signal distribution but also offers improved demultiplexing characteristics in comparison with the previously proposed demultiplexer-multiposition switch. The following characteristics are expected from the design using commercially available optical components: a working band of 0.64–0.88 μm, channel separation of 34–36 nm, 3 dB bandwidth of 27–28 nm, channel cross-talk of less than - 40 dB and minimum excess insertion loss of 0.9–2.1 dB.     

High-Speed Optical Local Access Network System Using Bi-Directional Polarization Multiplexing

A high-speed and economical optical local access network system is proposed where bi-directional polarization multiplexing is applied to a bi-directional transmission. Experimental results using a prototype system confirmlow optical loss and environmental stabilities.     

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.     

Photochemical deprotection of nitro-substituted benzenesulfenates via photoinduced electron transfer

The photochemical deprotection of alkyl 2,4-dinitrobenzenesulfenate or alkyl 2-nitrobenzenesulfenate was successfully achieved by addition of triethylamine, while it was unsuccessful without triethylamine. The sulfur-oxygen bond cleavage is thought to occur heterolytically in the sulfenate anion radical produced by photoinduced electron transfer with triethylamine.