Formation of Supramolecular Nanostructures through in Situ Self-Assembly and Post-Assembly Modification of a Biocatalytically Constructed Dipeptide Hydrazide**

Aqueous self-assembly of short peptides has attracted growing attention for the construction of supramolecular materials for various bioapplications. Herein, we describe how the thermolysin-assisted biocatalytic construction of a dipeptide hydrazide from an N-protected amino acid and an amino acid hydrazide leads to the formation of thermally stable supramolecular hydrogels. In addition, we demonstrate the post-assembly modification of the supramolecular architectures constructed in situ tethering hydrazide groups as a chemical handle by means of fluorescence imaging.     

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     

RSOS Models and Jantzen–Seitz Representations of Hecke Algebras at Roots of Unity

A special family of partitions occurs in two apparently unrelated contexts: the evaluation of one-dimensional configuration sums of certain RSOS models, and the modular representation theory of symmetric groups or their Hecke algebras H_m. We provide an explanation of this coincidence by showing how the irreducible H_m-modules which remain irreducible under restriction to H_{m_1} (Jantzen–Seitz modules) can be determined from the decomposition of a tensor product of representations sl_n.     

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.     

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.     

Validation of a method for predicting the precision, limit of detection and range of quantitation in competitive ELISA.

The mathematical model for predicting the precision, limit of detection (LOD) and range of quantitation (ROQ) in a competitive enzyme-linked immunosorbent assay (ELISA) proposed by Hayashi et al. (Anal. Chem., 2004, 76, 1295) was validated. The model describes the relative standard deviation (RSD) of concentration estimates by the RSDs of pipetting volumes of analyte, enzyme-conjugated antigen, antibody and substrate solutions, and the standard deviation (SD) of inherent absorbances between the wells in an ELISA plate. For 6 kinds of direct competitive ELISA kits, the LOD and ROQ predicted by the model agreed well with those obtained by experiments with real samples. It was also confirmed that the model is applicable to the prediction of uncertainty that depends on the pipetting error of the viscous antiserum solution. The model was demonstrated to be useful for estimating the LOD and ROQ of competitive ELISA.     

Stable marker-particle method for the Voronoi diagram in a flow field

The Voronoi diagram in a flow field is a tessellation of water surface into regions according to the nearest island in the sense of a “boat-sail distance”, which is a mathematical model of the shortest time for a boat to move from one point to another against the flow of water. The computation of the diagram is not easy, because the equi-distance curves have singularities. To overcome the difficulty, this paper derives a new system of equations that describes the motion of a particle along the shortest path starting at a given point on the boundary of an island, and thus gives a new variant of the marker-particle method. In the proposed method, each particle can be traced independently, and hence the computation can be done stably even though the equi-distance curves have singular points.     

Preparation and condensation reactions of a new light-fluorous Mukaiyama reagent: reliable purification with fluorous solid phase extraction for esters and amides

A modified light-fluorous Mukaiyama reagent bearing a C₈F₁₇ tag was prepared and examined in ester and amide forming condensation reactions. Following the reactions, the desired product was effectively separated from the fluorous pyridone by-product using a simple fluorous solid phase extraction.