不具有与具有卖空限制的证券选择理论(英文)

本文讨论不具有与具有卖空限制的证券选择理论．不具有卖空限制的证券选择问题作为规划问题用Lagrange数法求解．这个问题可以推广到具有卖空限制情形．用Kuhn－Tucker条件求解．     

广义齐次函数和二体问题

讨论了齐次函数概念的推广,并应用于求解二体问题．     

一类神经网络模型的稳定性

本文将一种求解凸规划问题的神经网络模型推广到求解一般的非凸非线性规划问题．理论分析表明;在适当的条件下,本文提出的求解非凸非线性规划问题的神经网络模型的平衡点是渐近稳定的,对应于非线性规划问题的局部最优解     

某类等式约束二次规划问题的一个共轭方向法

本文提出了一种求解某类等式约束二次规划问题的一个共轭方向迭代法，并给出了算法的有限终止性证明．同时我们把此算法推广到不等式约束二次规划问题中，从而得到了一种求解不等式约束二次规划问题的算法．     

Cn中多圆柱体的Riemann-Hilbert边值问题

本文研究了利用Poission核求解C^N（1≤n≤2）中单位多圆柱体上Riemann-Hilbert边值问题．同时，给出了其解的表达式和可解条件，并将原来求解空间从解析函数空间推广到亚纯函数空间．     

正交各向异性弹性力学正交关系的研究

新的正交关系被推广到正交各向异性三维弹性力学．将弹性力学新正交关系中构造对偶向量的思路推广到正交各向异性问题．将弹性力学求解辛体系的对偶向量重新排序后,提出了一种新的对偶向量．由混合变量求解法直接得到对偶微分方程．所导出的对偶微分矩阵具有主对角子矩阵为零矩阵的特点．由于对偶微分矩阵的这一特点,对于正交各向异性三维弹性力学发现了2个独立的、对称的正交关系．采用分离变量法求解对偶微分方程．从正交各向异性弹性力学求解体系的积分形式出发,利用一些恒等式证明了新的正交关系．新的正交关系不但包含原有的辛正交关系,而且比原有的关系简洁．新正交关系的物理意义是对偶方程的解关于z坐标的对称性的体现．辛正交关系是一个广义关系,但辛正交关系可以在一定的条件下以狭义的强形式出现．新的研究成果将为研究正交各向异性三维弹性力学的解析解和有限元解提供新的有效工具．     

带投资约束且p不确定的推广p-中位问题

p-中位问题是设施选址中的一个经典模型,在交通、物流等领域有着广泛应用．在经典p-中位问题的基础上提出一种p不确定的推广p-中位问题,并且加上总投资约束,使得此推广模型更加实用．针对此推广模型,提出三种启发式算法：简单启发式算法、变邻域搜索算法和改进的遗传算法．数值实验结果表明变邻域搜索算法和改进的遗传算法在求解此推广模型时是有效的．     

加权网络结构分析

网络研究已经成为机器学习领域中的热点问题之一,近年来发展起来的随机块模型是通过建模生成网络的一种方法．本文对随机块模型加以推广,建立加权的随机块模型,在求解过程中,采用一种可以广泛的用于求解混合模型的变分EM算法．最后通过数据模拟,证明了此方法的可行性．     

三维粘弹性分层介质中平稳随机波的传播

研究平稳随机波在粘弹性分层横观各向同性介质中的传播问题．将岩层考虑为分层介质,各层性质不同,岩层位于基岩上面,并且认为基岩比岩层刚很多,在基岩处给出随机激励．在频率和波数域中将控制方程化为常微分方程求解．对常微分方程,应用两点边值问题的精细积分法进行求解．因此,近年来发展的应用于结构随机振动的虚拟激励法可推广于当前分层岩层响应的计算．     

新的梯度算法求解单位球笛卡尔积约束优化问题北大核心CSCD

本文主要研究了单位球笛卡尔积作为约束的优化问题,给出了此类问题的最优性条件．同时将求解此问题的一些经典的梯度算法推广到了更加一般的形式,并证明了新算法的收敛性．随机二次规划问题和求解图像变分去噪模型的数值结果表明新算法并不弱于一些经典的算法,特别是在精度要求较高的情形下．     

New parameters of subsets in polynomial association schemes

We define new parameters, a zero interval and a dual zero interval, of subsets in P- or Q-polynomial association schemes. A zero interval of a subset in a P-polynomial association scheme is a successive interval index for which the inner distribution vanishes, and a dual zero interval of a subset in a Q-polynomial association scheme is a successive interval index for which the dual inner distribution vanishes. We derive bounds of the lengths of a zero interval and a dual zero interval using the degree and dual degree respectively, and show that a subset in a P-polynomial association scheme (resp. a Q-polynomial association scheme) having a large length of a zero interval (resp. a dual zero interval) induces a completely regular code (resp. a Q-polynomial association scheme). Moreover, we consider the spherical analogue of a dual zero interval.     

Staircase Parameterization in Dynamical Selection

This paper deals with a variant of a dynamical selection scheme introduced by Attouch and Cominetti for ill-posed convex minimization which combines approximation with the steepest descent method by mean of a suitable parameterization of the approximation parameter as a function of the time. This variant applies to a general inclusion with a maximal monotone operator by mean of a staircase parameterization. A discrete analogue is also considered. Applications to selecting a particular zero of a maximal monotone operator or a particular fixed point of a nonexpansive mapping via regularization techniques are presented. Finally, the alternative use of well-posedness by perturbations is discussed.     

On arithmetic Macaulayfication of Noetherian rings

The Rees algebra is the homogeneous coordinate ring of a blowing-up. The present paper gives a necessary and sufficient condition for a Noetherian local ring to have a Cohen-Macaulay Rees algebra: A Noetherian local ring has a Cohen-Macaulay Rees algebra if and only if it is unmixed and all the formal fibers of it are Cohen-Macaulay. As a consequence of it, we characterize a homomorphic image of a Cohen-Macaulay local ring. For non-local rings, this paper gives only a sufficient condition. By using it, however, we obtain the affirmative answer to Sharp's conjecture. That is, a Noetherian ring having a dualizing complex is a homomorphic image of a finite-dimensional Gorenstein ring.

     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

On fractional powers of a pair of matrices and a plate-beam problem

In this paper we consider the transversal deflections of a dynamically-coupled Von Kármán system consisting of a plate which has a beam attached to its one edge. The problem is considered in the form of a non-linear evolution problem in a product space. We show the existence of a unique local solution by following a fractional powers approach to first construct a “weak” solution in a larger space. Regularity properties for this solution yield a unique local strong solution for the original boundary-value problem. This approach entails the introduction of fractional powers of a pair of matrices.     

A conjecture on bipartite graphical regular representations

In this paper we are concerned with the classification of the finite groups admitting a bipartite DRR and a bipartite GRR.First, we find a natural obstruction that prevents a finite group from admitting a bipartite GRR. Then we give a complete classification of the finite groups satisfying this natural obstruction and hence not admitting a bipartite GRR. Based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite GRR.Next, we prove the existence of bipartite DRRs for most of the finite groups not admitting a bipartite GRR found in this paper. Actually, we prove a much stronger result: we give an asymptotic enumeration of the bipartite DRRs over these groups. Again, based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite DRR.     

Diagrams of divide links

Recently N. A'Campo suggested a construction of a link from a generic immersion of a curve into a 2-disk. It is tightly related to the singularity theory. In this paper, we give a simple procedure to draw a diagram of the link from a picture of the curve.

     

二次曲面和平面位置关系的判式

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面a11x2+a22y2+a33z2+2a12xy+2a13xz+2a23yz+2a14x+2a24y+2a34z+a44=0(1)和平面Ax+By+Cz+D=0(2)的相对位置的判别式Δ=a11a12a13a14Aa21a22a23a24Ba31a32a33a34Ca41a42a43a44DA B C D0(aij=aji).(3)并证明了:若Δ>0,则二次曲面(1)与平面(2)相交;若Δ=0,则(1)和(2)相切;若Δ<0,则(1)和(2)相离.     

The Socle and Semisimplicity of a Kumjian–Pask Algebra

The Kumjian–Pask algebra KP(Λ) is a graded algebra associated to a higher-rank graph Λ and is a generalization of the Leavitt path algebra of a directed graph. We analyze the minimal left ideals of KP(Λ), and identify its socle as a graded ideal by describing its generators in terms of a subset of vertices of the graph. We characterize when KP(Λ) is semisimple, and obtain a complete structure theorem for a semisimple Kumjian–Pask algebra. As a consequence of this structure theorem, every semisimple Kumjian–Pask algebra can be obtained as a Leavitt path algebra of a directed graph.     

An algorithm for constructing star-shaped drawings of plane graphs

A straight-line planar drawing of a plane graph is called a convex drawing if every facial cycle is drawn as a convex polygon. Convex drawings of graphs is a well-established aesthetic in graph drawing, however not all planar graphs admit a convex drawing. Tutte [W.T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10 (3) (1960) 304–320] showed that every triconnected plane graph admits a convex drawing for any given boundary drawn as a convex polygon. Thomassen [C. Thomassen, Plane representations of graphs, in: Progress in Graph Theory, Academic Press, 1984, pp. 43–69] gave a necessary and sufficient condition for a biconnected plane graph with a prescribed convex boundary to have a convex drawing.In this paper, we initiate a new notion of star-shaped drawing of a plane graph as a straight-line planar drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. A star-shaped drawing is a natural extension of a convex drawing, and a new aesthetic criteria for drawing planar graphs in a convex way as much as possible. We give a sufficient condition for a given set A of corners of a plane graph to admit a star-shaped drawing whose concave corners are given by the corners in A, and present a linear time algorithm for constructing such a star-shaped drawing.