南极假丝酵母在纳米聚苯乙烯上的共价固载及其在微波辅助酯化反应中的应用（英文）

Nanopolystyrene was used as a solid support for the covalent immobilization of Candida antarctica lipase B(Cal B) using the photoreactive reagent 1‐fluoro‐2‐nitro‐4‐azido benzene(FNAB) as a cou‐pling reagent. The obtained derivative was then used as a biocatalyst in a microwave assisted ester‐ification experiment. Factors such as contact time, pH, and enzyme concentration were investigated during immobilization. The hydrolytic activity, thermal, and operational stability of immobi‐lized‐Cal B were determined. The maximum immobilized yield(218 μg/mg support) obtained at pH 6.8 exhibited optimum hydrolytic activity(4.42 × 103 mU p‐nitrophenol/min). The thermal stability of Cal B improved significantly when it was immobilized at pH 10, however, the immobilized yield was very low(93.6 μg/mg support). The immobilized‐Cal B prepared at pH 6.8 and pH 10 retained 50% of its initial activity after incubation periods of 14 and 16 h, respectively, at 60 °C. The opera‐tional stability was investigated for the microwave assisted esterification of oleic acid with metha‐nol. Immobilized‐Cal B retained 50% of its initial activity after 15 batch cycles in the micro‐wave‐assisted esterification. The esterification time was notably reduced under microwave irradia‐tion. The combined use of a biocatalyst and microwave heating is thus an alternative total green synthesis process.     

A tight upper bound for the number of intersections between two rectangular paths

The problem of finding the number of intersections between two geometric figures in the plane has been studied extensively in literature. In this paper, the geometric figure comprising a continuous rectilinear path (called rectangular path) is considered, and a tight (least) upper bound onI(P, Q), the number of intersections between two rectangular pathsP andQ, is given.Editors' Note: One of our referees has reported that the main result of this paper has recently been given independently by a Chinese researcher at the University of Science and Technology, Hefei, P. R. of China. His paper is under publication in the Chinese Science Bulletin. However, since this journal may not be easily accessible to our readers, and further the two papers are obviously independent of each other, theBIT Editors have decided to accept the present paper.     

Some Geometrical Aspects of Efficient Points in Vector Optimization

We study efficient point sets in terms of extreme points, positive support points and strongly positive exposed points. In the case when the ordering cone has a bounded base, we prove that the efficient point set of a weakly compact convex set is contained in the closed convex hull of its strongly positive exposed points, thereby extending the Phelps theorem. We study also the density of positive proper efficient point sets. This research was supported by a Central Research Grant of Hong Kong Polytechnic University, Grant G-T 507. Research of the first author was also supported by the National Natural Science Foundation of P.R. China, Grant 10361008, and the Natural Science Foundation of Yunnan Province, China, Grant 2003A002M. Research of the second author was also supported by the Natural Science Foundation of Chongqing. Research of the third author was supported by a research grant from Australian Research Counsil.     

A computational method for a class of non-standard time optimal control problems involving multiple time horizons

In this paper, we consider a class of non-standard time optimal control problems involving a dynamical system consisting of multiple subsystems evolving over different time horizons. Different subsystems are required to reach their respective target sets at different termination times. The goal is to minimize the maximum of these termination times. By introducing a discrete variable to represent the system termination ordering, we reformulate this problem as a discrete optimization problem. A discrete filled function method is developed to solve this discrete optimization problem. For illustration, a numerical example is solved.     

A class of optimal state-delay control problems

We consider a general nonlinear time-delay system with state-delays as control variables. The problem of determining optimal values for the state-delays to minimize overall system cost is a non-standard optimal control problem–called an optimal state-delay control problem–that cannot be solved using existing optimal control techniques. We show that this optimal control problem can be formulated as a nonlinear programming problem in which the cost function is an implicit function of the decision variables. We then develop an efficient numerical method for determining the cost function’s gradient. This method, which involves integrating an auxiliary impulsive system backwards in time, can be combined with any standard gradient-based optimization method to solve the optimal state-delay control problem effectively. We conclude the paper by discussing applications of our approach to parameter identification and delayed feedback control.     

GENERAL INFORMATION

In this note, we obtain a sufficient and necessary condition for a point to be a local minimizer of a continuous optimization problem with maximin constraints via the local minimizers of its transformed standard nonlinear optimization problem.     

Liouville Action and Weil-Petersson Metric on Deformation Spaces, Global Kleinian Reciprocity and Holography

We rigorously define the Liouville action functional for the finitely generated, purely loxodromic quasi-Fuchsian group using homology and cohomology double complexes naturally associated with the group action. We prove that classical action – the critical value of the Liouville action functional, considered as a function on the quasi-Fuchsian deformation space, is an antiderivative of a 1-form given by the difference of Fuchsian and quasi-Fuchsian projective connections. This result can be considered as global quasi-Fuchsian reciprocity which implies McMullen's quasi-Fuchsian reciprocity. We prove that the classical action is a Kähler potential of the Weil-Petersson metric. We also prove that the Liouville action functional satisfies holography principle, i.e., it is a regularized limit of the hyperbolic volume of a 3-manifold associated with a quasi-Fuchsian group. We generalize these results to a large class of Kleinian groups including finitely generated, purely loxodromic Schottky and quasi-Fuchsian groups, and their free combinations.     

Persistence in discrete optimization under data uncertainty

An important question in discrete optimization under uncertainty is to understand the persistency of a decision variable, i.e., the probability that it is part of an optimal solution. For instance, in project management, when the task activity times are random, the challenge is to determine a set of critical activities that will potentially lie on the longest path. In the spanning tree and shortest path network problems, when the arc lengths are random, the challenge is to pre-process the network and determine a smaller set of arcs that will most probably be a part of the optimal solution under different realizations of the arc lengths. Building on a characterization of moment cones for single variate problems, and its associated semidefinite constraint representation, we develop a limited marginal moment model to compute the persistency of a decision variable. Under this model, we show that finding the persistency is tractable for zero-one optimization problems with a polynomial sized representation of the convex hull of the feasible region. Through extensive experiments, we show that the persistency computed under the limited marginal moment model is often close to the simulated persistency value under various distributions that satisfy the prescribed marginal moments and are generated independently.     

The 2-hamiltonian cubes of graphs

This paper deals with the problem of characterizing the pairs of vertices x,y in a connected graph G such that G³ - {x,y} is hamiltonian, where G³ is the cube of G. It is known that the cube G³ is 2-hamiltonian if G is 2-connected. In this paper, we first prove the stronger result that G³ - {x,y} is hamiltonian if either x or y is not a cut-vertex of G, and then proceed to characterize those cut-vertices x and y of G such that G³ -{x,y} is hamiltonian. As a simple consequence of these, we obtain Schaar's characterization of a connected graph G such that G³ is 2-hamiltonian.     

Approximate Augmented Lagrangian Functions and Nonlinear Semidefinite Programs

In this paper, an approximate augmented Lagrangian function for nonlinear semidefinite programs is introduced. Some basic properties of the approximate augmented Lagrange function such as monotonicity and convexity are discussed. Necessary and sufficient conditions for approximate strong duality results are derived. Conditions for an approximate exact penalty representation in the framework of augmented Lagrangian are given. Under certain conditions, it is shown that any limit point of a sequence of stationary points of approximate augmented Lagrangian problems is a KKT point of the original semidefinite program and that a sequence of optimal solutions to augmented Lagrangian problems converges to a solution of the original semidefinite program.