小型文献资料检索系统

本文介绍的这种情报资料检索系统,采用了数据压缩存贮技术,并使用链表记录的存贮结构解决了变长信息的存贮问题,系统的功能以“菜单”和“快速”两种方式提供给用户,使用方便。     

Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals

In this paper we study a particular class of primal-dual path-following methods which try to follow a trajectory of interior feasible solutions in primal-dual space toward an optimal solution to the primal and dual problem. The methods investigated are so-called first-order methods: each iteration consists of a long step along the tangent of the trajectory, followed by explicit recentering steps to get close to the trajectory again. It is shown that the complexity of these methods, which can be measured by the number of points close to the trajectory which have to be computed in order to achieve a desired gain in accuracy, is bounded by an integral along the trajectory. The integrand is a suitably weighted measure of the second derivative of the trajectory with respect to a distinguished path parameter, so the integral may be loosely called a curvature integral.     

Generalizations of Slater's constraint qualification for infinite convex programs

In this paper we study constraint qualifications and duality results for infinite convex programs (P) = inf{f(x): g(x) – S, x C}, whereg = (g ₁,g ₂) andS = S ₁ ×S ₂,S _i are convex cones,i = 1, 2,C is a convex subset of a vector spaceX, andf andg _i are, respectively, convex andS _i -convex,i = 1, 2. In particular, we consider the special case whenS ₂ is in afinite dimensional space,g ₂ is affine andS ₂ is polyhedral. We show that a recently introduced simple constraint qualification, and the so-called quasi relative interior constraint qualification both extend to (P), from the special case thatg = g ₂ is affine andS = S ₂ is polyhedral in a finite dimensional space (the so-called partially finite program). This provides generalized Slater type conditions for (P) which are much weaker than the standard Slater condition. We exhibit the relationship between these two constraint qualifications and show how to replace the affine assumption ong ₂ and the finite dimensionality assumption onS ₂, by a local compactness assumption. We then introduce the notion of strong quasi relative interior to get parallel results for more general infinite dimensional programs without the local compactness assumption. Our basic tool reduces to guaranteeing the closure of the sum of two closed convex cones.     

Computation of efficient solutions of discretely distributed stochastic optimization problems

In engineering and economics often a certain vectorx of inputs or decisions must be chosen, subject to some constraints, such that the expected costs (or loss) arising from the deviation between the outputA() x of a stochastic linear systemxA()x and a desired stochastic target vectorb() are minimal. Hence, one has the following stochastic linear optimization problem minimizeF(x)=Eu(A()x b()) s.t.xD, (1) whereu is a convex loss function on ^m , (A(), b()) is a random (m,n + 1)-matrix, E denotes the expectation operator andD is a convex subset of ⁿ . Concrete problems of this type are e.g. stochastic linear programs with recourse, error minimization and optimal design problems, acid rain abatement methods, problems in scenario analysis and non-least square regression analysis.Solving (1), the loss functionu should be exactly known. However, in practice mostly there is some uncertainty in assigning appropriate penalty costs to the deviation between the outputA ()x and the targetb(). For finding in this situation solutions hedging against uncertainty a set of so-called efficient points of (1) is defined and a numerical procedure for determining these compromise solutions is derived. Several applications are discussed.     

Stability theorems for infinitely constrained mathematical programs

The primary concern of this paper is to investigate stability conditions for the mathematical program: findx E ⁿ that maximizesf(x):g ^j(x)0 for somej J, wheref is a real scalarvalued function and eachg is a real vector-valued function of possibly infinite dimension. It should be noted that we allow, possibly infinitely many, disjunctive forms. In an earlier work, Evans and Gould established stability theorems wheng is a continuous finite-dimensional real-vector function andJ=1. It is pointed out that the results of this paper reduce to the Evans-Gould results under their assumptions. Furthermore, since we use a slightly more general definition of lower and upper semicontinuous point-to-set mappings, we can dispense with the continuity ofg (except in a few instances where it is implied by convexity assumptions).     

波纹管膨胀节设计软件的模块化设计

本文利用软件模块化结构设计的优点，对波纹管元件强度和性能计算、各类型膨胀节的结构设计，典型管线的膨胀节补偿设计等提出了计算机设计软件的模块化设计方法，并对软件系统的结构、组成和功能进行了论述。     

Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs

In this article, we study the generalized Levitin-Polyak well-posedness of generalized semi-infinite programs. We first give the criteria and characterizations for two types of well-posedness. We then establish the convergence of a class of penalty methods under the assumption of generalized type I Levitin-Polyak well-posedness.     

OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS

Abstract

New insights are presented from a convex duality classification theory of over 25 years ago for recent computational complexity results developed for recognizing some of the asymptotic duality states that prevail for an arbitrary convex programming pair.     

Overview of software options for processing,analysis and interpretation of mass spectrometric proteomic data

Recently, the interests in proteomics have been intensively increased, and the proteomic methods have been widely applied to many problems in cell biology. If the age of 1990s is considered to be a decade of genomics, we can claim that the following years of the new century is a decade of proteomics. The rapid evolution of proteomics has continued through these years, with a series of innovations in separation techniques and the core technologies of two‐dimensional gel electrophoresis and MS. Both technologies are fueled by automation and high throughput computation for profiling of proteins from biological systems. As Patterson ever mentioned, ‘data analysis is the Achilles heel of proteomics and our ability to generate data now outstrips our ability to analyze it’. The development of automatic and high throughput technologies for rapid identification of proteins is essential for large‐scale proteome projects and automatic protein identification and characterization is essential for high throughput proteomics. This review provides a snap shot of the tools and applications that are available for mass spectrometric high throughput biocomputation. The review starts with a brief introduction of proteomics and MS. Computational tools that can be employed at various stages of analysis are presented, including that for data processing, identification, quantification, and the understanding of the biological functions of individual proteins and their dynamic interactions. The challenges of computation software development and its future trends in MS‐based proteomics have also been speculated. Copyright © 2014 John Wiley & Sons, Ltd.     

我院高等数学课程教学的研究

对数学教育中的数学类课程教学目标的定位是至关重要的,它直接影响教学的投入、教学质量的评价、学生知识结构的构建等重大问题.在经过多次调研,反复论证,深入研究数学教学指导委员会提出的指导意见和我院各专业不同的培养目标以及我院学生的实际学习能力的基础上,确定了我院高等数学课程的教学内容、教学目标,教学大纲、教学运行方案和教学质量考核方案等.