A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.     

Parametric and Non Homogeneous Semi-Markov Process for HIV Control

In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed. A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct times and follow-up has an impact on the evolution of patients.      

An implicit method for linear ill‐posed problems with perturbed operators

An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd.     

OPTIMAL HARVESTING POLICY FOR INSHORE-OFFSHORE FISHERY MODEL WITH IMPULSIVE DIFFUSION

This article studies the inshore-offshore fishery model with impulsive diffusion. The existence and global asymptotic stability of both the trivial periodic solution and the positive periodic solution are obtained. The complexity of this system is also analyzed. Moreover, the optimal harvesting policy are given for the inshore subpopulation, which includes the maximum sustainable yield and the corresponding harvesting effort.     

Optimally Stable Multivariate Bases

We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel.     

Interior point cutting plane method for optimal power flow

In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective.     

关于任意随机变量序列泛函的强极限定理

本文在k是固定的正整数，{fn}是R^k 1上的Borel可测函数列时，得到了任意随机变量序列{Xrn≥0}的泛函{fn(Xn-k,…,Xn)}的强极限定理，它是Chung的关于独立随机变量序列的强大数律的推广，作为推论，得到了k重非齐次马尔科夫链的一类强极限定理．     

Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation

Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points.     

Variational Formulation of the Schrödinger Field

The variational formulation of the Schrödinger field was investigated and the applicability of the chain method was analyzed. Using Batalin-Fradkin-Tyutin formalism a gauge invariant theory was constructed.     

Synthesis of β-phenyl-δ,ε-unsaturated amino acids and stereoselective introduction of side chain groups into [4,3,0]-bicyclic β-turn dipeptides

(2S,3S)- and (2R,3R)-2-amino-3-phenyl-5-hexenoic acids have been synthesized in large scale by using Ni(II)-complexes as a template. The amino acids were used in the synthesis of [4,3,0]-bicyclic β-turn mimetics by a convergent methodology. The unique advantage of this strategy is the convenience of introducing side chain groups with predetermined chiralities on both the five- and six-membered heterocyclic rings.