关于强Clean一般环 (英)

本文介绍了强clean—般环的概念并将一些基本的结果推广到这个更广的环类．证明了强clean一般环的角落环和强π-正则一般环都是强clean的,还讨论了强clean一般环的扩张并且证明了满足条件J(I)=Q(I)的交换clean一般环的上三角矩阵环是强clean的．     

基于总承包商的水电工程EPC项目利益相关方协调度测评研究

在水电工程EPC项目大规模发展的背景下提出提高总承包商协调管理能力的问题,识别水利水电工程EPC项目管理协调度的影响因素,构建协调度评价指标体系并基于欧氏距离构建协调度模型,通过四川JL水电站建设项目研究总承包商与各利益相关方之间的协调发展度.结果表明,总承包商与上游相关方(业主、咨询单位、监理单位)为优质协调;与项目实施主体(设计方、供应商、分包方)为较好协调;与政治相关方(政府、当地居民)的协调程度最差,与政府为一般协调,与当地居民为轻度失调.据此,从总承包商的视角提出同各利益相关方的协调发展策略,能更好地促进总承包商协调管理能力的提升以及提高水利水电EPC工程项目的完成质量.     

General interpolation on the lattice h{\Bbb Z}^s: Compactly supported fundamental solutions

Summary. In this paper we combine an earlier method developed with K. Jetter on general cardinal interpolation with constructions of compactly supported solutions for cardinal interpolation to gain compactly supported fundamental solutions for the general interpolation problem. The general interpolation problem admits the interpolation of the functional and derivative values under very weak restrictions on the derivatives to be interpolated. In the univariate case, some known general constructions of compactly supported fundamental solutions for cardinal interpolation are discussed together with algorithms for their construction that make use of MAPLE. Another construction based on finite decomposition and reconstruction for spline spaces is also provided. Ideas used in the latter construction are lifted to provide a general construction of compactly supported fundamental solutions for cardinal interpolation in the multivariate case. Examples are provided, several in the context of some general interpolation problem to illustrate how easy is the transition from cardinal interpolation to general interpolation. Received May 11, 1993 / Revised version received August 16, 1994     

Robust nonlinear optimization with conic representable uncertainty set

The robust optimization methodology is known as a popular method dealing with optimization problems with uncertain data and hard constraints. This methodology has been applied so far to various convex conic optimization problems where only their inequality constraints are subject to uncertainty. In this paper, the robust optimization methodology is applied to the general nonlinear programming (NLP) problem involving both uncertain inequality and equality constraints. The uncertainty set is defined by conic representable sets, the proposed uncertainty set is general enough to include many uncertainty sets, which have been used in literature, as special cases. The robust counterpart (RC) of the general NLP problem is approximated under this uncertainty set. It is shown that the resulting approximate RC of the general NLP problem is valid in a small neighborhood of the nominal value. Furthermore a rather general class of programming problems is posed that the robust counterparts of its problems can be derived exactly under the proposed uncertainty set. Our results show the applicability of robust optimization to a wider area of real applications and theoretical problems with more general uncertainty sets than those considered so far. The resulting robust counterparts which are traditional optimization problems make it possible to use existing algorithms of mathematical optimization to solve more complicated and general robust optimization problems.     

广义基插值的正交多尺度函数和多小波

给出一类具有广义插值的正交多尺度函数的构造方法, 并给出对应多小波的显示构造公式. 证明了该文构造的多小波拥有与多尺度函数相同的广义基插值性.从而建立了多小波子空间上的采样定理. 最后基于该文提供的算法构造出若干具有广义基插值的正交多尺度函数和多小波.     

极小化总加权完工时间的Dial-a-Ride问题的在线随机算法

讨论一般度量空间上带单服务器的极小化总加权完工时间在线Dial-a-Ride问题.通过应用贪婪区间的技巧,提出了一个一般在线随机算法.根据这个算法,对于容量为1或者任意容量的一般度量空间上的在线Dial-a-Ride问题能得到一个竞争比为(2+√2)/ln(1+√2)的在线随机算法,这个算法不仅具有当前最好的竞争比,而且也改进了Krumke等人的结果.     

强Ockham代数与剩余格

首先讨论了Ockham代数与剩余格的关系,引入了强Ockham代数的概念,并讨论了它的基本性质．然后,将著名的风蕴涵和风算子推广到Ockham代数上,证明了添加广义R0蕴涵和广义风算子后的Ockham代数L成为剩余格的充要条件是L为强Ockham代数．最后给出若干重要例子,以此来说明强Ockham代数的条件是独立的．     

Optimum shape of columns with general conservative end loading

In this paper, the optimal shape of a column with the most general conservative state of loading is determined. The boundary conditions of a column contain, in general, 16 parameters; it is shown that the boundary values of a column with general conservative loading may, at most, depend on nine constants. The influence of these parameters on the optimal shape and corresponding buckling load is also obtained.     

Linear stability of general linear methods for systems of neutral delay differential equations

This paper is concerned with the numerical solution of delay differential equations (DDEs). We focus on the stability of general linear methods for systems of neutral DDEs with multiple delays. A type of interpolation procedure is considered for general linear methods. Linear stability properties of general linear methods with this interpolation procedure are investigated. Many extant results are unified.     

On a comparison principle for delay coupled systems with nonlocal and nonlinear boundary conditions

This paper is concerned with delay coupled systems of parabolic equations with nonlocal and nonlinear boundary conditions. For them, a new and general comparison principle is established, which is more general and useful than the existing results.     

Analytical solution for general nonlinear continuous systems in a complex form

In this paper, the method of multiple scales is used to study free vibrations and primary resonances of geometrically nonlinear spatial continuous systems with general quadratic and cubic nonlinear operators in a complex form. It is found that in the free vibrations of general continuous systems in a complex form, both forward and backward modes are excited. This situation is in contrast to the primary resonances in which only forward modes are excited. Consequently, one may determine the form of solution before applying the multiple scales method to the equation. This analysis is applicable to general continuous systems with gyroscopic and Coriolis effects and includes many nonlinear problems as a special case. As an example of application of this general solution, free vibrations and primary resonances of a simply supported rotating shaft with stretching nonlinearity are considered.     

Stochastic integral equations applied to telecommunications traffic without delay

Modern telecommunication techniques case the problem of traffic handling in the framework of fairly general networks, as applied to traffic without delay but with virtually arbitrary service-time distributions. In this paper we use stochastic integral equations to deal with the case involving the most general input process and lost calls. For this purpose, Fortet's equation, unsolved so far in the general case, is solved to analyze the single trunk group model. The stationary case is then treated as a special case. Finally we study networks which satisfy a certain assumption of symmetry. The same general stochastic assumptions are maintained throughout the paper.     

Iterative algorithms for a new class of extended general nonconvex set-valued variational inequalities

Some new classes of extended general nonconvex set-valued variational inequalities and the extended general Wiener-Hopf inclusions are introduced. By the projection technique, equivalence between the extended general nonconvex set-valued variational inequalities and the fixed point problems as well as the extended general nonconvex Wiener-Hopf inclusions is proved. Then by using this equivalent formulation, we discuss the existence of solutions of the extended general nonconvex set-valued variational inequalities and construct some new perturbed finite step projection iterative algorithms with mixed errors for approximating the solutions of the extended general nonconvex set-valued variational inequalities. We also verify that the approximate solutions obtained by our algorithms converge to the solutions of the extended general nonconvex set-valued variational inequalities. The results presented in this paper extend and improve some known results from the literature.     

Clean一般环的几个结果

证明了一般环I是Clean一般环当且仅当I上的形式幂级数一般环I[[x]]是Clean一般环;一般环I上的多项式环I[x]是Clean一般环当且仅当I是诣零的.引入了强Clean一般环的概念,它是强Clean环的推广.并证明了强π-正则的一般环是强Clean一般环.     

一个特殊可重复排列数的算法

研究一类特殊的可重复排列性质,建立了一般情形下求这类排列数的递推公式,导出了一些特殊情形下的具体计算公式.     

矩阵环中的一类极大的广义的Armendariz子环

An associative ring with identity R is called Armendariz if, whenever （∑^m i=0^aix^i）（∑^n j=0^bjx^j）=0 in R[x],aibj=0 for all i and j. An associative ring with identity is called reduced if it has no non-zero nilpotent elements. In this paper, we define a general reduced ring （with or without identity） and a general Armendariz ring （with or without identity）, and identify a class of maximal general Armendariz subrings of matrix rings over general reduced rings.     

Function spaces and product topologies on powers of spaces

A study is made of two classes of product topologies on powers of spaces: the general box product topologies, and the general uniform product topologies. Some examples are given and some results are shown about the properties of these general product spaces. This is applied to show that certain spaces of continuous functions with the fine topology are homeomorphic to box product spaces, and certain spaces of continuous functions with the uniform topology are homeomorphic to uniform product spaces.     

Inventory models with ramp type demand rate,partial backlogging and Weibull deterioration rate

In this paper, an inventory model with general ramp type demand rate, time dependent (Weibull) deterioration rate and partial backlogging of unsatisfied demand is considered. The model is studied under the following different replenishment policies: (a) starting with no shortages and (b) starting with shortages. The model is fairly general as the demand rate, up to the time point of its stabilization, is a general function of time. The backlogging rate is any non-increasing function of the waiting time up to the next replenishment. The optimal replenishment policy for the model is derived for both the above mentioned policies.     

Equistable graphs, general partition graphs, triangle graphs, and graph products

In this paper we examine the connections between equistable graphs, general partition graphs and triangle graphs. While every general partition graph is equistable and every equistable graph is a triangle graph, not every triangle graph is equistable, and a conjecture due to Jim Orlin states that every equistable graph is a general partition graph. The conjecture holds within the class of chordal graphs; if true in general, it would provide a combinatorial characterization of equistable graphs.Exploiting the combinatorial features of triangle graphs and general partition graphs, we verify Orlin’s conjecture for several graph classes, including AT-free graphs and various product graphs. More specifically, we obtain a complete characterization of the equistable graphs that are non-prime with respect to the Cartesian or the tensor product, and provide some necessary and sufficient conditions for the equistability of strong, lexicographic and deleted lexicographic products. We also show that the general partition graphs are not closed under the strong product, answering a question by McAvaney et al.     

Population uncertainty and Poisson games

A general class of models is developed for analyzing games with population uncertainty. Within this general class, a special class of Poisson games is defined. It is shown that Poisson games are uniquely characterized by properties of independent actions and environmental equivalence. The general definition of equilibrium for games with population uncertainty is formulated, and it is shown that the equilibria of Poisson games are invariant under payoff-irrelevant type splitting. An example of a large voting game is discussed, to illustrate the advantages of using a Poisson game model for large games. Received December 1995/Revised version July 1997