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.     

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.     

From inequalities involving exponential functions and sums to logarithmically complete monotonicity of ratios of gamma functions

In this paper, the authors review origins, motivations, and generalizations of a series of inequalities involving finitely many exponential functions and sums. They establish three new inequalities involving finitely many exponential functions and sums by finding convexity of a function related to the generating function of the Bernoulli numbers. They also survey the history, backgrounds, generalizations, logarithmically complete monotonicity, and applications of a series of ratios of finitely many gamma functions, present complete monotonicity of a linear combination of finitely many trigamma functions, construct a new ratio of finitely many gamma functions, derive monotonicity, logarithmic convexity, concavity, complete monotonicity, and the Bernstein function property of the newly constructed ratio of finitely many gamma functions. Finally, they suggest two linear combinations of finitely many trigamma functions and two ratios of finitely many gamma functions to be investigated.     

城市老旧居住小区交通环境评价指标与评价方法

定量的评判城市老旧居住小区整体交通环境质量并进而科学有效的提出老旧小区交通环境更新与改善措施,对城市老旧居住小区交通环境进行了调查,明确了老旧居住小区存在的突出交通问题,并提出了城市老旧居住小区交通环境评价的指标体系,包括行人跨路出行指数、无人行道路段长度占比、停车泊位供需比、路内非法停车占比、平均停车步行距离、泊位数量户数比、人均步行空间、无障碍通道、盲道设置比例、非机动车泊位供需比、地面停放车辆数小区面积比、外部穿行交通周转量小区面积比等。并给出了具体指标的计算方法与获得办法。以长沙市四个典型老旧居住小区为例,对评价方法进行了论证,并得到城市老旧居住小区存在的一般问题,包括人车混杂、人车交织现象严重,停车泊位短缺、车辆乱停乱放,交通设施、特别是弱势群体交通设施缺乏。给出的评价指标、评价方法与结论可为城市老旧小区改造更新,特别是其中很重要的交通环境更新提供决策依据。     

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

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

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.     

Uniform random number generation

In typical stochastic simulations, randomness is produced by generating a sequence of independent uniform variates (usually real-valued between 0 and 1, or integer-valued in some interval) and transforming them in an appropriate way. In this paper, we examine practical ways of generating (deterministic approximations to) such uniform variates on a computer. We compare them in terms of ease of implementation, efficiency, theoretical support, and statistical robustness. We look in particular at several classes of generators, such as linear congruential, multiple recursive, digital multistep, Tausworthe, lagged-Fibonacci, generalized feedback shift register, matrix, linear congruential over fields of formal series, and combined generators, and show how all of them can be analyzed in terms of their lattice structure. We also mention other classes of generators, like non-linear generators, discuss other kinds of theoretical and empirical statistical tests, and give a bibliographic survey of recent papers on the subject.     

超大规模集成电路布局的优化模型与算法

布局确定集成电路单元在芯片中的具体位置,在单元互不重叠的基础上优化一些性能指标。该问题是NP困难的组合优化问题,是超大规模集成电路物理设计的核心问题之一,对集成电路的性能指标,如线网可布通性、时延、功耗、电路可靠性等有重大影响。在现代的集成电路设计中,布局问题通常包含数百万个集成电路单元,以及大小相异的异质性模块,和各种复杂的布局约束。目前的超大规模集成电路布局算法通常分解为总体布局、布局合法化和详细布局三个步骤。根据近年来集成电路布局算法的研究进展,综述并分析集成电路的总体布局、布局合法化和详细布局的相关优化模型和算法,并展望进一步的研究方向。     

Complex impure systems: Sheaves,freeways, and chains

Fundamental to the approach of Complex Impure Systems is the definition of the concept of an s‐impure set as a set of perceptual beliefs or denotative significances (relative beings) of material and/or energetic real objects (absolute beings). But any Subject not only the subject S perceives objects O as significances, and he perceives the existing relations between these significances or, alternatively, he infers them. The study of these relations, conceived not as a singular relation between singular objects, but as sheaves of relations in both directions and forming relational freeways, will be studied here. In this work, we approach the structure of the system, from a synchronous point of view, as a first approach to this class of systems. © 2016 Wiley Periodicals, Inc. Complexity 21: 387–400, 2016     

提高维吾尔文搜索质量的一些关键技术研究

维吾尔语和土耳其语、乌兹别克语、哈萨克语等同属于阿尔泰语系突厥语分支,是一种粘着型语言,具有丰富的构词合构形附加成分.主要分布于中国新疆维吾尔自治区,以及中西亚地区的维吾尔族使用.目前使用基于阿拉伯文字母的维吾尔文.当前用google,bing等搜索引擎搜索维吾尔文时搜索结果不包括该词语的构词合构形附加成分等其它形式.严重影响了搜索结果的准确性.通过词干提取和词缀附加生成词语组合的方法以解决提高维吾尔文搜索质量的问题.此问题解决,将在大幅度提高维吾尔文搜索的准确性,并针对提高其它突厥语族语言(土耳其语、乌兹别克语、哈萨克语等)的搜索质量、数据挖掘、数据分析、数据安全、自然语言理解等研究领域有一定的参考价值.     

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.     

Moment information for probability distributions,without solving the moment problem,II: Main-mass,tails and shape approximation

How much information does a small number of moments carry about the unknown distribution function? Is it possible to explicitly obtain from these moments some useful information, e.g., about the support, the modality, the general shape, or the tails of a distribution, without going into a detailed numerical solution of the moment problem? In this, previous and subsequent papers, clear and easy to implement answers will be given to some questions of this type. First, the question of how to distinguish between the main-mass interval and the tail regions, in the case we know only a number of moments of the target distribution function, will be addressed. The answer to this question is based on a version of the Chebyshev–Stieltjes–Markov inequality, which provides us with upper and lower, moment-based, bounds for the target distribution. Then, exploiting existing asymptotic results in the main-mass region, an explicit, moment-based approximation of the target probability density function is provided. Although the latter cannot be considered, in general, as a satisfactory solution, it can always serve as an initial approximation in any iterative scheme for the numerical solution of the moment problem. Numerical results illustrating all the theoretical statements are also presented.     

Utilization and maintenance in a model with scrapping

We consider a productive asset, called equipment or capital good, and we examine the properties of, as well as the interactions between, the operating policies, which are determined by its optimal utilization and maintenance, and the capital policy of scrapping, which defines the optimal time when the productive asset is retired from its current use. Starting with an abstract model and using the approach of optimal control, initially we characterize the various types of equipment by assigning to them a single total profit index, which indicates how the above policies affect the flow of operating revenues plus capital gains or losses. This index is a function of market-determined prices. So using it we then investigate how the operating and capital policies are influenced by the rate of discount, the price of new equipment, and the rise or fall of the price of new equipment relative to the value of its output. Among other interesting results, we find that the effects of these prices on the nature and interactions of optimal policies depend crucially on whether the equipment is of the usual profit making type, where output is the main source of revenue, or of the antique type, where the main source of revenue is capital gains.     

并行分批排序综述

并行分批排序起源于半导体芯片制造过程。在并行分批排序中,工件可成批加工,批加工机器最多可同时加工B个工件,批的加工时间为批中所有工件的最大工时。首先根据传统的机器环境和目标函数对并行分批排序已有成果进行分类介绍,主要为单机和平行机的机器环境,以及极小化最大完工时间、极小化总完工时间、极小化最大延迟、极小化误工工件数、极小化总延误和极小化最大延误的目标函数;然后梳理了由基本问题所衍生出来的具有新特点的16类新型并行分批排序,包括差异尺寸工件、多目标、工件加工时间或顺序存在限制、考虑费用和具有特殊机制等情况;最后展望未来的研究方向。     

The strength of Mac Lane set theory

Saunders Mac Lane has drawn attention many times, particularly in his book Mathematics: Form and Function, to the system of set theory of which the axioms are Extensionality, Null Set, Pairing, Union, Infinity, Power Set, Restricted Separation, Foundation, and Choice, to which system, afforced by the principle, , of Transitive Containment, we shall refer as . His system is naturally related to systems derived from topos-theoretic notions concerning the category of sets, and is, as Mac Lane emphasises, one that is adequate for much of mathematics. In this paper we show that the consistency strength of Mac Lane's system is not increased by adding the axioms of Kripke–Platek set theory and even the Axiom of Constructibility to Mac Lane's axioms; our method requires a close study of Axiom H, which was proposed by Mitchell; we digress to apply these methods to subsystems of Zermelo set theory , and obtain an apparently new proof that is not finitely axiomatisable; we study Friedman's strengthening of , and the Forster–Kaye subsystem of , and use forcing over ill-founded models and forcing to establish independence results concerning and ; we show, again using ill-founded models, that proves the consistency of ; turning to systems that are type-theoretic in spirit or in fact, we show by arguments of Coret and Boffa that proves a weak form of Stratified Collection, and that is a conservative extension of for stratified sentences, from which we deduce that proves a strong stratified version of ; we analyse the known equiconsistency of with the simple theory of types and give Lake's proof that an instance of Mathematical Induction is unprovable in Mac Lane's system; we study a simple set theoretic assertion—namely that there exists an infinite set of infinite sets, no two of which have the same cardinal—and use it to establish the failure of the full schema of Stratified Collection in ; and we determine the point of failure of various other schemata in . The paper closes with some philosophical remarks.     

New Approaches and New Applications for Computer Simulation of N-Body Problems

In this paper we study new computer models for turbulent flow in the small and in the large, for soliton collision, and for the fundamental problem of electrostatics. These are typical for models of microdrop collision, stress of a slotted copper plate, contact angle of adhesion, biological self reorganization, the bounce of an elastic ball, the motion of a top on a smooth surface, and elastic snap-through, which are only mentioned and referenced appropriately.     

On free products in varieties of associative algebras

Varieties of associative algebras over a field of characteristic zero are considered. Belov recently proved that, in any variety of this kind, the Hilbert series of a relatively free algebra of finite rank is rational. At the same time, for three important varieties, namely, those of algebras with zero multiplication, of commutative algebras, and of all associative algebras, a stronger assertion holds: for these varieties, formulas that rationally express the Hilbert series of the free product algebra via the Hilbert series of the factors are well known. In the paper, a system of counterexamples is presented which shows that there is no formula of this kind in any other variety, even in the case of two factors one of which is a free algebra. However, if we restrict ourselves to the class of graded PI-algebras generated by their components of degree one, then there exist infinitely many varieties for each of which a similar formula is valid. Translated fromMatematicheskie Zametki, Vol. 65, No. 5, pp. 693–702, May, 1999.     

Critical time of a long multilayer viscoelastic shell

The buckling in stability of a long multilayer linearly viscoelastic shell, composed of different materials and loaded with a uniformly distributed external pressure of given intensity, is investigated. By neglecting the influence of fastening of its end faces, the initial problem is reduced to an analysis of the loss of load-carrying capacity of a ring of unit width separated from the shell. The new problem is solved by using a mixed-type variational method, allowing for the geometric nonlinearity, together with the Rayleigh-Ritz method. The creep kernels are taken exponential with equal indices of creep. As an example, a three-layer ring with a structure symmetric about its midsurface is considered, and the effect of its physicomechanical and geometrical parameters, as well as of wave formation, on the critical time of buckling in stability of the ring is determined. It is found that, by selecting appropriate materials, more efficient multilayer shell-type structural members can be created. __________ Translated from Mekhanika Kompozitnykh Materialov, Vol. 43, No. 5, pp. 617–628, September–October, 2007.     

基于覆盖上近似算子的拟阵结构及其关系

Covering-based rough sets,as a technique of granular computing,can be a useful tool for dealing with inexact,uncertain or vague knowledge in information systems.Matroids generalize linear independence in vector spaces,graph theory and provide well established platforms for greedy algorithm design.In this paper,we construct three types of matroidal structures of covering-based rough sets.Moreover,through these three types of matroids,we study the relationships among these matroids induced by six types of covering-based upper approximation operators.First,we construct three families of sets by indiscernible neighborhoods,neighborhoods and close friends,respectively.Moreover,we prove that they satisfy independent set axioms of matroids.In this way,three types of matroidal structures of covering-based rough sets are constructed.Secondly,we study some characteristics of the three types of matroid,such as dependent sets,circuits,rank function and closure.Finally,by comparing independent sets,we study relationships among these matroids induced by six types of covering-based upper approximation operators.