On the existence and the stability of solutions for higher-order semilinear Dirichlet problems

We investigate the existence and stability of solutions for higher-order two-point boundary value problems in case the differential operator is not necessarily positive definite, i.e. with superlinear nonlinearities. We write an abstract realization of the Dirichlet problem and provide abstract existence and stability results which are further applied to concrete problems.     

日本青少年心理问题初探

青少年心理问题是社会高度现代化后带来的副产品。日本是亚洲第一个高度现代化的国家,青少年心理问题尤为突出。该文从日本青少年心理问题引发的社会现象入手,剖析其原因,找出解决途径。当前,我国正处于现代化的初级阶段,青少年心理问题层出不穷,有必要学习日本的经验,采取一些防治措施,以达到未雨绸缪之功效。     

网络课件中动态题库的研究

网络课件以其良好的交互性和多媒体功能倍受学习者青睐。近几年来网络课件数量剧增,但对试题库的研究与开发相对简单,给用户提供的试卷或者习题不论是动态或者静态的,均不能很好地考虑网络上不同用户的需求。为此,文章着重从不同用户的需求和提高组卷效率出发,智能地、高效地生成不同需求的试卷或者习题以满足不同用户,同时为提高组卷效率而提出了多种策略相结合的组题方式。     

弹性梁静态方程的可解性

给出滑动支撑的弹性梁静态方程可解的一组两参数非共振条件.     

基于线性元的电阻抗成像的数学模型和算法

本文讨论了电阻抗成像的数学模型，先利用有限元方法将其离散化，再把它转化为非线性优化问题，并给出了利用牛顿法求解这一问题的具体算法．最后进行了一系列数值仿真对比实验，证实了这一算法的有效性，指出了其中存在的问题．     

管理系统的最经济控制问题

依据最经济控制问题的概念及其对无确定性数学模型系统分析存在的局限性，对现代管理系统最经济控制问题，提出了在满足系统基本要求前提下。实现控制功能及品质与控制成本比最佳或最划算的模型定义，并对管理系统的可靠性、ABC管理法、WSR方法论等方面的可靠性成本、运行成本和最佳收益等最经济控制问题进行了研究．     

互补问题中Gauss-Newton方法全局收敛性的推广(英文)

研究了由Subramamian为求解互补问题提出的阻尼Gauss-Newton方法的收敛性质，在较弱的条件下，给出了一个全局收敛效果，这个结果是Subramanian PK (1993)和（1997）中相应结果的一个推广。     

随机Benjamin-Ono 方程初值问题及对河口区域生物分布的应用

该文对具梯度耦合噪声的随机Benjamin-Ono 方程（以下简记为B-O方程）的初值问题导出了解得积分表达式，并将它应用于河口区域生物分布问题，得到了一维空间的分布表达式。     

An optimization algorithm for a penalized knapsack problem

We study a variation of the knapsack problem in which each item has a profit, a weight and a penalty; the sum of profits of the selected items minus the largest penalty associated with the selected items must be maximized. We present an ILP formulation and an exact optimization algorithm.     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.