有限部分保序变换半群POn的具有某种性质的极大子半群

本文研究了有限链上的部分保序变换半群Pon.通过对其幂等元的分析,获得TPOn的极大正则子半群和极大幂等元生成子半群的结构与分类.     

左消半群M与幂单半群N的Schüzenberger积

本文讨论了每个元都有幂等元作为右单位元的左消半群与幂单半群N的Schuzenberger积M◇N的ρ类,证明了这种半群M与N的Schuzenberger积M◇N的ρ类是右E-半适合半群和弱E-headged半群.     

П正则半群的幂等元同余类

本文分别给出П正则半群的幂等元同余类和Пｏｒｔｈｏｄｏｘ半群［１］的幂等元同余类的П正则性刻画．其次，证明П逆半群或完全П正则半群Ｓ的幂等元同余类是Ｓ的П正则子半群．最后讨论ｏｒｔｈｏｄｏｘ半群的幂等元同合类的正则性．     

Ⅱ正则半群的幂等元同余类

本文分别给出Ⅱ正则半群的幂等元同余类和Ⅱｏｒｔｈｏｄｏｘ半群的幂等元同余类的Ⅱ正则性刻画，其次，证明Ⅱ逆半群或完全Ⅱ逆半群或完全Ⅱ正则半群Ｓ的幂等元同余类是Ｓ的Ⅱ正则子半群。最后讨论ｏｒｈｔｏｄｏｘ半群的幂等元同余类的正则性。     

0-恰当半群

引入了0-恰当半群的概念,它是一种特殊的逆半群.给出了0-恰当半群的等价刻划.讨论具有幂等半格的右0-恰当半群上含于(够)0的最大同余关系μL和具有幂等半格的0-恰当半群上含于(形)0的最大同余关系μ.证明如果S是一个具有幂等半格E的右0-A型半群,则S/μL≌E当且仅当S是一个S0左逆的左消含幺半群的强半格.进一步证明了,如果S是一个具有幂等半格E的0-恰当半群,则S/μ≌E当且仅当S是一个S0逆的消去含幺半群的强半格.     

具有弱正规幂等元的富足半群的结构

本文研究含弱正规幂等元的富足半群.在给出这类半群的若干特征后,建立了具有弱正规幂等元的富足半群的结构．作为应用,给出具有正规幂等元的富足半群和具有（弱）正规幂等元的拟适当半群的结构．     

幂等元生成子半群为完全正则半群的拟完全正则半群

论文主要刻画了幂等元生成子半群为完全正则半群的拟完全正则半群. 并讨论了满足该类半群的一些子类.     

幂等元位于中心的半群的局部化和最小幂幺半群同余

局部化是交换代数的重要工具[1],证明幂等元位于中心的半群在其幂等元半格上的局部化存在且唯一,并给出此类半群的最小幂幺半群同余.另外,给出了若干半群的重要同余的刻划.     

含有中间幂等元满足同余条件的◇-富足半群

本文引入了--格林关系和--富足半群,研究了满足同余条件含有中间幂等元的--富足半群.利用具有中间幂等元的由幂等元生成的正则半群和◇-拟恰当半群建立了满足同余条件含有中间幂等元的◇-富足半群的结构.     

左消半群M与幂单半群B的Schǔzenberger积

本文讨论了每个元都有幂等元作为右单位元的左消半群与幂单半群N的Schuzenberger积M◇N的ρ类，证明了这种半群M与N的Schuzenberger积M◇N的ρ类是右E一半适合半群和弱E-headged半群．     

半群PO_(n,r)的秩

设POn为Xn上的保序部分变换半群.对任意的2≤r≤n一1,考虑半群PO_(n,r)={α∈PO_n:Im(α)■[r]}([r]={1,2,…,r}),证明了PO_(n,r)的秩为Σn-1k=r(nk)((k-1)(r-1))+r-1.     

基于模糊FNN-ELECTRE法的国有商业银行竞争力评价

随着金融业全方位开放,国有商业银行已成为国家经济命脉的核心,其竞争力强弱关系着国家经济的繁荣与衰退。本文基于模糊FNN-ELECTRE方法建立国有商业银行竞争力评价模型,以因素神经网络理论(FNN)与ELECTRE融合方法为基础,以现有商业银行竞争力评价指标为着眼,把国有商业银行竞争力的评价体系从现实竞争力和潜在竞争力两个因素抽取为一级指标,以规模、质量、业务结构、效率、成长性五个因素设为二级指标。从实证的角度对银行A、银行B、银行C、银行D、银行E五大国有银行进行分析验证,对其属性值进行和谐性与非和谐性检验得出,银行B竞争能力最强,银行E竞争能力最弱,五大国有银行均有改进空间。     

Wave parameter identification problem for ocean test structure data,part 2, discrete formulation

This paper deals with the solution of the wave parameter identification problem for ocean test structure data. A discrete formulation is assumed. An ocean test structure is considered, and wave elevation and velocities are assumed to be measured with a number of sensors. Within the frame of linear wave theory, a Fourier series model is chosen for the wave elevation and velocities. Then, the following problem is posed: Find the amplitudes of the various wave components of specified frequency and direction, so that the assumed model of wave elevation and velocities provides the best fit to the measured data. Here, the term best fit is employed in the least-square sense over a given time interval.At each time instant, the wave representation involves four indexes (frequency, direction, instrument, time); hence, four-dimensional arrays are required. This formal difficulty can be avoided by switching to an alternative representation involving only two indexes (frequency-direction, instrument-time); hence, standard vector-matrix notation can be used. Within this frame, optimality conditions are derived for the amplitudes of the assumed wave model.A characteristic of the wave parameter identification problem is that the condition number of the system matrix can be large. Therefore, the numerical solution is not an easy task and special procedures must be employed. Specifically, Gaussian elimination is avoided and advantageous use is made of the Householder transformation, in the light of the least-square nature of the problem and the discretized approach to the problem.Numerical results are presented. The effect of various system parameters (number of frequencies, number of directions, sampling time, number of sensors, and location of sensors) is investigated in connection with global or strong accuracy, local or weak accuracy, integral accuracy, and condition number of the system matrix.From the numerical experiments, it appears that the wave parameter identification problem has a unique solution if the number of directions is smaller than or equal to the number of sensors; it has an infinite number of solutions otherwise. In the case where a unique solution exists, the condition number of the system matrix increases as the size of the system increases, and this has a detrimental effect on the accuracy. However, the accuracy can be improved by proper selection of the sampling time and by proper choice of the number and location of the sensors.Generally speaking, the computations done for the discrete case exhibit better accuracy than the computations done for the continuous case (Ref. 5). This improved accuracy is a direct consequence of having used advantageously the Householder transformation and is obtained at the expense of increased memory requirements and increased CPU time.This work was supported by Exxon Production Research Company, Houston, Texas. This paper is based partly on Refs. 1–4.     

Formulation of linear problems and solution by a universal machine

Using the predicate language for ordered fields a class of problems referred to aslinear problems is defined. This class contains, for example, all systems of linear equations and inequalities, all linear programming problems, all integer programming problems with bounded variables, all linear complementarity problems, the testing of whether sets that are defined by linear inequalities are semilattices, all satisfiability problems in sentenial logic, the rank-computation of matrices, the computation of row-reduced echelon forms of matrices, and all quadratic programming problems with bounded variables. A single, one, algorithm, to which we refer as theUniversal Linear Machine, is described. It solves any instance of any linear problem. The Universal Linear Machine runs in two phases. Given a linear problem, in the first phase a Compiler running on a Turing Machine generates alinear algorithm for the problem. Then, given an instance of the linear problem, in the second phase the linear algorithm solves the particular instance of the linear problem. The linear algorithm is finite, deterministic, loopless and executes only the five ordered field operations — additions, multiplications, subtractions, divisions and comparisons. Conversely, we show that for each linear algorithm there is a linear problem which the linear algorithm solves uniquely. Finally, it is shown that with a linear algorithm for a linear problem, one can solve certain parametric instances of the linear problem.Research was supported in part by the National Science Foundation Grant DMS 92-07409, by the Department of Energy Grant DE-FG03-87-ER-25028, by the United States—Israel Binational Science Foundation Grant 90-00434 and by ONR Grant N00014-92-J1142.Corresponding author.     

A double-stage piecewise recursive filter for real-time applications

This paper examines the basic problem of estimating the state of a system described by a set of dynamical equations. The state estimation is performed by means of optimal filtering techniques in which the state observation is given by a set of nonlinear equations.The basic issue encountered in most engineering problems is the availability of more observable information than the processor can effectively process in real-time, while performing full optimal filtering on all available observable data. To alleviate this deficiency, an algorithm is developed in which the rate of information processing is kept at a high value, while the system statistics are evaluated at a much slower rate.The method utilizes a combination of fast and slow filtering loops, in which the observable data are processed at a high rate during the fast loop, while the system error covariance, gain computations, and all other system statistics are processed at a lower rate in the slow loop. Methods are provided to resolve any incompatibility in the system statistics resulting from this fast-loop/slow-loop processing combination.Applications describing problems pertaining to aircraft navigation are presented. Specifically, applications to aircraft navigation through a satellite network are studied. Appropriate simulation results from the above studies are shown.This work was performed under contract with the Department of the Air Force, Space and Missile Organization (SAMSO), Los Angeles, California, Contract No. F04-701-75-C-0180.The authors are indebted to Dr. C. Johnson, GPS System Engineer, Mr. G. Consolver, GPS Software Manager, and Mr. W. Riley, Communications/Navigation Department, Texas Instruments for their continuous encouragement in the course of this work. Also, they are indebted to Major M. Birnbaum, SAMSO, for his constructive criticism on the conceptual design of this work, and to Mr. A. Bierman, Aerospace Corporation, for kindly providing simulation data of aircraft trajectories. Finally, the authors would like to express their gratitude to Dr. N. Carlson, Intermetrics, for valuable consultation during the progress of this work.Portions of this paper were presented by the senior author at the GSP Conference, Plan 76, IEEE Position, Location, and Navigation Symposium, San Diego, California, 1976.     

考虑成本、等待时间和安全水平的分类安检模式研究

近年来,随着民航机场旅客吞吐量快速增加,机场安检部门的工作压力正不断加大,旅客等待时间也正在逐渐增加。针对该问题,引入了分类安检模式。然而,分类安检模式通常需要额外的投资成本,可能会产生较大的财务负担。因此,以成本为目标,综合考虑旅客等待时间和安全水平的要求,研究了分类安检模式和传统安检模式的比较以及最优决策性质等相关问题。首先,考虑安全水平和旅客等待时间的约束,分别为传统安检模式和分类安检模式建立了模型,并分析了其最优运营决策性质。其次,从成本的角度,对两种安检模式做了比较研究。研究结果表明,当旅客数量多、安检犯错容忍度较高或旅客等待敏感时,分类安检模式比传统安检模式表现更优;反之,传统安检模式更优。此外,在分类安检模式中,分配到高风险安检通道的旅客比例存在一个最优值,并且其通常在20%到30%之间取到。最后,通过数值分析验证了分类安检模式的最优服务配置。     

Representation of the solution to a model problem in semiconductor physics

We study a mixed type problem for the Poisson equation arising in the modeling of charge transport in semiconductor devices [V. Romano, 2D simulation of a silicon MESFET with a non-parabolic hydrodynamical model based on the maximum entropy principle, J. Comput. Phys. 176 (2002) 70-92; A.M. Blokhin, R.S. Bushmanov, A.S. Rudometova, V. Romano, Linear asymptotic stability of the equilibrium state for the 2D MEP hydrodynamical model of charge transport in semiconductors, Nonlinear Anal. 65 (2006) 1018-1038]. Unlike well-studied elliptic boundary-value problems in domains with smooth boundaries (see, for example, [O.A. Ladyzhenskaya, N.N. Uralceva, Linear and Quasilinear Elliptic Equations, Nauka, Moscow, 1973; D. Gilbarg, N.S. Trudinger, Elliptic Partial Differential Equations of Second Order, Springer-Verlag, Berlin, 1983]), our problem has two significant features: firstly, the boundary is not a smooth curve and, secondly, the type of boundary conditions is mixed (the Dirichlet condition is satisfied on the one part of the boundary whereas the Neumann condition on the other part). The well-posedness of the problem in Hölder and Sobolev spaces is proved. The representation of the solution to the problem is obtained in an explicit form.     

公众参与视角下的央地环境规制博弈分析

本文首先构建环境规制中中央政府和地方政府的两方演化博弈模型,并在此基础上将公众作为第三方参与主体,构建中央政府、地方政府和公众三方演化博弈模型,详细比较两方和三方博弈模型的区别,探究各个主体策略行为的影响因素。研究发现:(1)未有公众参与下,地方政府策略选择主要受地方政府积极执行成本、环境收益、经济损失,消极执行的环境政绩损失,中央政府监管力度、治理补贴和对地方政府的处罚等因素影响;中央政府的监管策略主要受到严格监管的成本以及对地方政府的治理补贴和处罚等因素影响。引入公众参与后,在央地两方博弈的基础上,地方政府环境规制执行策略的影响因素还增加了地方政府被举报后所受到的追加处罚,中央政府监管策略的影响因素还增加了中央政府监管力度、对地方政府的追加处罚以及中央政府的公信力损失。(2)未有公众参与下,中央政府严格监管的概率随地方政府积极执行概率的增大而减小。引入公众参与后,中央政府严格监管率随地方政府积极执行概率的增大而增大。说明在公众参与下,地方政府积极执行环境规制对中央政府严格监管产生的抑制作用转变成了促进作用。(3)地方政府积极执行的概率、中央政府严格监管的概率都随公众举报概率的增大而增大。说明公众参与不仅对地方政府承担环保责任具有促进作用,而且有利于促使中央政府落实环境治理政策。     

The generalized hierarchical product of graphs

A generalization of both the hierarchical product and the Cartesian product of graphs is introduced and some of its properties are studied. We call it the generalized hierarchical product. In fact, the obtained graphs turn out to be subgraphs of the Cartesian product of the corresponding factors. Thus, some well-known properties of this product, such as a good connectivity, reduced mean distance, radius and diameter, simple routing algorithms and some optimal communication protocols, are inherited by the generalized hierarchical product. Besides some of these properties, in this paper we study the spectrum, the existence of Hamiltonian cycles, the chromatic number and index, and the connectivity of the generalized hierarchical product.     

Personae at play. ‘Men of Mathematics’ in commentary

Mathematical writers, above all, Euclid, tend to present their theorems as decontextualized, abstract propositions, which has become the standard modus of textual presentation in theoretical mathematics. Mathematical commentators, however, provide their readers with personal names and historical facts in order to elucidate problems, provide contexts of discovery, or construct doxographies, among other things. Modern readers have used such information for the construction of histories of science. When we look at these passages, however, we see that personal names and information about mathematicians of the past can serve quite a range of different objectives, such as the strategic self-positioning of the commentator vis-à-vis the past or present of mathematics, the education of the reader, mathematical or moral, the construction of the history of the field, etc. Not only does the commentator present a persona of himself to the reader, he can also turn colleagues and predecessors into personae. This paper attempts to elucidate the practice, by offering four examples of such plays of and with personae, in Pappus, Eutocius, al-Nayrīzī, and Proclus.