The construction of infinite families of any κ-tight optimal and singular κ-tight optimal directed double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems. Given the number n of nodes, how to construct a DLN which has minimum diameter? This problem has attracted great attention. A related and longtime unsolved problem is: for any given non-negative integer k, is there an infinite family of k-tight optimal DLN? In this paper, two main results are obtained: (1) for any k ≥ 0, the infinite families of k-tight optimal DLN can be constructed, where the number n(k,e,c) of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c. (2) for any k ≥ 0,an infinite family of singular k-tight optimal DLN can be constructed.     

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.     

8族新的2-紧优的有向双环网络无限族

给出了8族新的2-紧优的有向双环网络无限族.     

The construction of infinite families of any κ-tight optimal and singular κ-tight optimal directed double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems. Given the number n of nodes, how to construct a DLN which has minimum diameter? This problem has attracted great attention. A related and longtime unsolved problem is for any given non-negative integer k, is there an infinite family of k-tight optimal DLN? In this paper, two main results are obtained (1) for any k ≥ 0, the infinite families of k-tight optimal DLN can be constructed, where the number n(k,e,c) of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c. (2) for any k ≥ 0,an infinite family of singular k-tight optimal DLN can be constructed.     

关于k紧优双环网络的无限族

在李乔等人的L形瓦理论的基础上,使用中国剩余定理等数论理论,证明任给整数k＞2,可以构造k紧优双环网络的无限族,其结点数N(k,e)可以为e的4次多项式,也可以为e的2次多项式且系数含有参数.     

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 n _k (t, a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.     

An infinite family of 4-tight optimal double loop networks

An infinite family of 4-tight optimal double loop networks is given in this paper.     

k-紧优有向双环网络无限族的构建

本文给出了一种方法用于构造k-紧优双环网络无限族(k≥1),并用此方法构造出了4族3-紧优无限族,3族新的4-紧比无限族,3族5-紧优无限族及2族6-紧优无限族．     

Enumeration of 2-regular circulant graphs and directed double networks

We present a formula to enumerate non-isomorphic circulant digraphs of order n with connection sets of cardinality 2. This formula simplifies to C(n,2)=3×2^a−1−4 in the case when n=2^a(a≥3), and when n=p^a(where p is an odd prime and a≥1). The number of non-isomorphic directed double networks are also enumerated.     

k紧优双环网的无限族的构造

双环网是计算机互连网络和通讯系统的一类重要拓扑结构,已广泛应用于计算机互连网络拓扑结构的设计中.利用L形瓦理论,结合中国剩余定理和二次同余方程的性质,给出了不同于参考文献中的任意k紧优双环网的无限族的构造方法,证明了对任意正整数k,若n(t)=3t2 At B,A=1,3,5,对于一定的B＞(k 1)2,均存在正整数t,使得{G(n(t);s(t))}是k紧优双环网的无限族,而且这样的无限族有无穷多类.作为定理的应用,给出了多类新的k紧优双环网的无限族.     

无向双环网的特征分析

本文给出了无向双环网直径的上界 ,并且找到了从任意节点到四个其它节点的四条内部不交的路 ,从而证明了无向双环网的连通度为 4     

On singular stochastic control and optimal stopping of spectrally negative jump diffusions

We consider a broad class of singular stochastic control problems of spectrally negative jump diffusions in the presence of potentially nonlinear state-dependent exercise payoffs. We analyse these problems by relying on associated variational inequalities and state a set of sufficient conditions under which the value of the considered problems can be explicitly derived in terms of the increasing minimal r-harmonic map. We also present a set of inequalities bounding the value of the optimal policy and prove that increased policy flexibility increases both the value of the optimal strategy as well as the rate at which this value grows.     

3族新的不含紧优与几乎紧优的有向双环网络无限族

给出了3族新的不含紧优与几乎紧优的有向双环网络.     

Maximum principle for optimal control of distributed-parameter systems with singular mass matrix

A maximum principle for the open-loop optimal control of a vibrating system relative to a given convex index of performance is investigated. Though maximum principles have been studied by many people (see, e.g., Refs. 1–5), the principle derived in this paper is of particular use for control problems involving mechanical structures. The state variable satisfies general initial conditions as well as a self-adjoint system of partial differential equations together with a homogeneous system of boundary conditions. The mass matrix is diagonal, constant, and singular, and the viscous damping matrix is diagonal. The maximum principle relates the optimal control with the solution of the homogeneous adjoint equation in which terminal conditions are prescribed in terms of the terminal values of the optimal state variable. An application of this theory to a structural vibrating system is given in a companion paper (Ref. 6).     

The abundance of strange attractor in the families of nearby singular diffeomorphism

In this paper, we consider the families of nearby singular diffeomorphism and the measure of a set in the parameter space, such that for each point of the set the corresponding diffeomorphism possesses strange attractor. For some families of one-dimensional mapping satisfying certain transversality condition, we prove that there is a positive measure set in the parameter space, such that the system in the corresponding families of nearly singular diffeomorphism has strange attractor. Furthermore, we study the dynamics of this type of strange attractor. Project Supported by Fund of National Science of China     

The double deflating technique for irreducible singular M-matrix algebraic Riccati equations in the critical case

As is known, Alternating-Directional Doubling Algorithm (ADDA) is quadratically convergent for computing the minimal nonnegative solution of an irreducible singular M-matrix algebraic Riccati equation (MARE) in the noncritical case or a nonsingular MARE, but ADDA is only linearly convergent in the critical case. The drawback can be overcome by deflating techniques for an irreducible singular MARE so that the speed of quadratic convergence is still preserved in the critical case and accelerated in the noncritical case. In this paper, we proposed an improved deflating technique to accelerate further the convergence speed – the double deflating technique for an irreducible singular MARE in the critical case. We proved that ADDA is quadratically convergent instead of linearly when it is applied to the deflated algebraic Riccati equation (ARE) obtained by a double deflating technique. We also showed that the double deflating technique is better than the deflating technique from the perspective of dimension of the deflated ARE. Numerical experiments are provided to illustrate that our double deflating technique is effective.     

关于紧优双环网络的无限族

双环网络是计算机互连网络和通讯系统的一类重要拓扑结构．1993年,李乔等人提出一个系统的构造方法,构造出69类0紧优和33类1紧优双环网络的无限族,并提出研究下述问题:求k(k>1)紧优双环网络的无限族．2003年,徐俊明等人给出一个4紧优双环网络的无限族．本文首先证明从每一个具体的0紧优双环网络出发,都可以构造若干0紧优双环网络无限族;结合同余方程组理论和数论中的素数理论,给出若干求一般k(k≥0)紧优双环网络无限族(包括非单位步长双环网络无限族)的方法．     

The structure of optimal solutions for harvesting a renewable resource

We consider the problem of optimal harvesting of a renewable resource whose dynamics are governed by logistic growth and whose payoff is proportional to the harvest. We consider both the case of a finite and an infinite time horizon and analyse the structure of the optimal solutions and their dependence on the parameters of the model. We show that the optimal policy can only have one of three structures: (1) maximal harvesting effort until the resource is depleted, (2) zero harvesting during an initial time interval followed by a subsequent switch to maximal harvesting effort, or (3) a singular solution, which corresponds to an intermediate level of harvesting, accompanied by the most rapid approach path. All three scenarios emerge, with minor variations, with finite and infinite time horizons, depending on the particular combination of parameters of the system. We characterize the conditions under which the singular solution is optimal and present suggestions for designing an optimal and sustainable harvesting strategy. Recommendations for Resource Managers :

• We have rigorously explored a standard optimal harvesting model and its steady states.
• We show that three different types of solutions may emerge: (i) maximal harvesting eventually leading to a complete depletion of the stock; (ii) maximal harvesting with a potential period of idleness leading to a positive stock; (iii) an initial phase of either no or full harvesting followed by a period of intermediate harvesting intensity leading to a positive stock (singular solution).
• With some modifications, similar results hold for a finite planning horizon.
• Which of these three scenarios emerges in the finite horizon case depends not only on the parameter values but also on the length of the planning horizon.

     

Asymptotic behavior of the optimal cost functional for a rapidly stabilizing indirect control in the singular case

The optimal control problem for a linear system with fast and slow variables in the form of indirect control with a convex terminal cost functional and a smooth geometric constraint on the control is studied. An asymptotic expansion of the cost functional up to any power of a small parameter is constructed.     

Lagrange multiplier and singular limit of double obstacle problems for the Allen–Cahn equation with constraint

We study the properties of the Lagrange multiplier for an Allen–Cahn equation with a double obstacle potential. Here, the dynamic boundary condition, including the Laplace–Beltrami operator on the boundary, is investigated. We then establish the singular limit of our system and clarify the limit of the solution and the Lagrange multiplier of our problem. We present remarks on a trace problem as well as on the Neumann boundary condition. Moreover, we describe a numerical experiment for a problem with Neumann boundary condition using the Lagrange multiplier. Copyright © 2016 John Wiley & Sons, Ltd.