A Cosmo-simula program for a simple air-pollution model

With a programmed example, the article introduces Cosmo-Simula, a language designed for the programming of continuous simulation. The language uses the Algol part of Simula for the programming of the algorithmic part and an extension of Cosmo for the programming of the administrative part of the problem. The translator is programmed using the Algol part of Simula and makes the extended Cosmo available for computers with an Algol-compiler.     

Storage administration in a virtual memory Simula system

The run time storage administration of a planned Simula system for PDP-10 is described with emphasis on record formats, record relationships and optimizations for the virtual memory organization. A parametrized garbage collector for variable size records in virtual memory is outlined.     

Optimal memory management in a system with garbage collection

This paper discusses the problem of determining cost-saving policies for obtaining memory in systems with garbage collection, in particular the run time system of DEC-10 Simula. A mathematical model of the problem is defined and a policy is obtained from the model and a certain amount of heuristic reasoning. The implementation and validation of the policy is also described.     

Part-compilation in high-level languages

Many programming languages include the ability to divide large programs into smaller segments, which are compiled separately. When a small modification is made to a large program, then the affected segment only has to be re-compiled.This paper discusses how high-level languages like Algol 68, Algol W or Simula 67 can incorporate part-compilation in a usable, secure and efficient way.     

Access mechanisms in block structured environments

Statistics from dynamic analysis of programs are used to compare the efficiency of different methods to access global variables. The method where static links are used for access is shown to be at least as efficient as the display method. The use of the linked list method also leads to a simpler runtime system and allows separately compiled modules to execute at any level in the resulting program. The results of the dynamic analysis are presented in a form which allows comparison of the access methods in language implementations on specific computers. Experience with using two different access methods in an implementation of Simula67 concludes the paper.     

Real-time bus rollover prediction algorithm with road bank angle estimation

The bus rollover warning has achieved many progresses for researcher endeavors in the past decades. But these researches have not taken account for dynamic road bank. To fill up the gap, this paper presents a real-time rollover trend prediction to indicate bus rollover risk with road bank estimation. The prediction algorithm consists of a dynamic roll stability analysis, which is based on a suspended roll plane model, and a real-time warning velocity calculation. An estimator for the dynamic road bank and vehicle sideslip angle estimation using the dynamic simplex algorithm (DSA) is designed to take into account the influence of road bank on rollover trend. By comparing maximum stable lateral acceleration to the affordable lateral acceleration depending on the tire/road friction limit, a warning velocity is determined using the measurement of lateral acceleration and the estimate of instantaneous vehicle turning radius. The proposed rollover trend prediction algorithm is evaluated by TruckSim software. Simulation results show that the proposed warning velocity can represent the vehicle potential to resist rollover and give appropriate prediction of vehicle rollover crashes in typical scenarios.     

Coroutine sequencing in a block structured environment

A certain primitive sequencing operation is defined, applicable as an extension to Algol-like languages. The operation serves the double purpose of intermediate exit from or reentry into procedure-like block instances. A second primitive, which corresponds to a fully symmetric coroutine linkage, is derived from the former. An abstract notation is introduced for the concepts of textual and dynamic enclosure of block instances. The effects of the sequencing primitives are explored in terms of this notation, and certain results are proved. Finally applications are given within the language framework of Simula 67.     

PPP项目多维信息招投标中的直接机制研究

基于显示原理以及机制设计的思想,运用广义质量生产函数模型,针对PPP项目招标建立了关于PPP项目特许经营权期与广义质量的二维信息招标直接机制模型,在保证投标人真实显示自己综合管理能力的条件下最大化参与双方的福利。通过模型求解,得到了该招标机制的最优分配以及最低质量的设定条件,并得出在该机制下能实现社会福利最优。并鉴于机制设计的复杂性,给出了该机制的实施规则。最后通过算例,证明了该直接机制的有效性,对PPP项目招标提供了理论上的指导。     

Colorings and interpretations: a connection between graphs and grammar forms

A mechanism for constructing families of “similar” graphs is introduced. This mechanism is essentially identical to the one considered in the theory of grammar forms and, at the same time, generalizes the notion of coloring of graphs. The mechanism applies to both directed and undirected graphs. The paper investigate hierarchies of families of graphs obtained by this mechanism, both in the directed and undirected case.     

城市再生水BOT项目特许经营权竞标机制设计

本文研究了城市再生水BOT项目特许经营权竞标机制设计问题.运用激励机制设计思想建立了满足个体理性和激励相容约束的拍卖模型,并通过求解此模型得到了最优的拍卖机制.最优拍卖机制不仅能诱导企业真实地披露自己的成本类型,还能提高政府对社会资源的配置效率.     

Controlling chaos based on an adaptive adjustment mechanism

In this paper, we extend the ideas and techniques developed by Huang [Huang W. Stabilizing nonlinear dynamical systems by an adaptive adjustment mechanism. Phys Rev E 2000;61:R1012–5] for controlling discrete-time chaotic system using adaptive adjustment mechanism to continuous-time chaotic system. Two control approaches, namely adaptive adjustment mechanism (AAM) and modified adaptive adjustment mechanism (MAAM), are investigated. In both case sufficient conditions for the stabilization of chaotic systems are given analytically. The simulation results on Chen chaotic system have verified the effectiveness of the proposed techniques.     

Controlling chaos based on an adaptive adjustment mechanism

In this paper, we extend the ideas and techniques developed by Huang [Huang W. Stabilizing nonlinear dynamical systems by an adaptive adjustment mechanism. Phys Rev E 2000;61:R1012–5] for controlling discrete-time chaotic system using adaptive adjustment mechanism to continuous-time chaotic system. Two control approaches, namely adaptive adjustment mechanism (AAM) and modified adaptive adjustment mechanism (MAAM), are investigated. In both case sufficient conditions for the stabilization of chaotic systems are given analytically. The simulation results on Chen chaotic system have verified the effectiveness of the proposed techniques.     

Penalty mechanism design

Penalty is a crucial approach to maintain society in order in both the legal and the political philosophies. How to establish a rational and efficient penalty mechanism is exceedingly important in practice in economics and politics and this paper explores the optimal mechanism design of penalty. A penalty under monopoly mechanism design theory is established and developed in this piece of work. By establishing the penalty mechanism design model, this paper finds that stricter punishment can efficiently deter violation of the regulations but can decrease the profits of the monopoly firm at the same time. Furthermore, penalty increases the concavity of the monopoly firm’s profit function, which makes it easier for the firm to make decisions and which means strict penalty results in optimal decisions. We also show that punishment is in general costly, which is highly consistent with the phenomena in practice.     

我国上市公司组合治理机制的实证研究

本文以沪市上市公司为样本,采用数据挖掘技术的判定树归纳法对样本企业的治理机制进行了系统研究,得到公司治理机制不同组合和EPA(单位资产实现EVA)之间的对应关系;然后根据可信度和支持度相结合原则从中遴选出有效规则,为优化公司治理机制、提升绩效和创造新财富提供借鉴。     

一种嵌入思维进化的新的进化算法

对于运筹学问题学中的函数优化问题,本文提出一种嵌入思维进化的新的进化算法,将思维进化计算(Mind Evolutionary Computation,MEC)的"趋同"和"异化"操作加入到进化算法中,充分利用其特有记忆机制、定向机制和探测与开采功能之间的协调机制的好性能,并加入K-meams聚类算法,保证群体多样性。最后,数值模拟验证了新算法的有效性。     

Coordination and profit sharing between a manufacturer and a buyer with target profit under credit option

Several studies have focused on buyer vendor coordination through quantity discount/credit option mechanism but few quantitative models and investigations are available that have explored the mechanism for transfer of surplus generated due to coordination. In this paper, we develop a coordination mechanism through credit option such that both the parties can divide the surplus equitably after satisfying their own profit targets. Two situations are explored here; in the first situation; both the parties have no individual profit target from the business whereas in the second situation, there are individual profit target for both the parties. The proposed mechanism for division of surplus is studied through a numerical study and the impact of different parameter values on the results are examined.     

Truthful mechanism design via correlated tree rounding

A powerful algorithmic technique for truthful mechanism design is the maximal-in-distributional-range (MIDR) paradigm. Unfortunately, many such algorithms use heavy algorithmic machinery, e.g., the ellipsoid method and (approximate) solution of convex programs. In this paper, we present a correlated rounding technique for designing mechanisms that are truthful in expectation. It is elementary and can be implemented quickly. The main property we rely on is that the domain offers fractional optimum solutions with a tree structure. In auctions based on the generalized assignment problem, each bidder has a publicly known knapsack constraint that captures the subsets of items that are of value to him. He has a private valuation for each item and strives to maximize the value of assigned items minus payment. For this domain we design a truthful 2-approximate MIDR mechanism for social welfare maximization. It avoids using the ellipsoid method or convex programming. In contrast to some previous work, our mechanism achieves exact truthfulness. In restricted-related scheduling with selfish machines, each job comes with a public weight, and it must be assigned to a machine from a public job-specific subset. Each machine has a private speed and strives to maximize payments minus workload of jobs assigned to it. Here we design a mechanism for makespan minimization. This is a single-parameter domain, but the approximation status of the optimization problem is similar to unrelated machine scheduling: The best known algorithm obtains a (non-truthful) 2-approximation for unrelated machines, and there is 1.5-hardness. Our mechanism matches this bound with a truthful 2-approximation.     

激励机制下服务供应链的收益分享契约协调性研究

随着第四方物流、一揽子金融服务专家等综合服务提供商运作模式的兴起,服务供应链的运作优化问题备受关注.本文基于收益分享契约的交易环境,构建了一个纯服务的两级供应链结构,分析了服务供应链的激励机制和协调机制.分析得出,服务供应链为了实现效益最优化,需要综合服务提供商向专业服务供应商实施努力激励;收益分享契约下含有激励机制的服务供应链能够实现协调,而且拥有良好的利润分配柔性.     

集装箱翻箱问题的蚁群算法改进

翻箱问题属于NP难问题,基本蚁群算法在求解该问题上收敛困难且寻优能力低。因此,本文提出了一种适合于翻箱模型的改进型蚁群算法,在概率决策机制、解的重构、信息素更新机制三个方面对基本蚁群算法进行改进。最后通过与其他算法的分析比较,验证了该改进算法的可行性与有效性。     

Analysis of NMAR missing data without specifying missing-data mechanisms in a linear latent variate model

It is natural to assume that a missing-data mechanism depends on latent variables in the analysis of incomplete data in latent variate modeling because latent variables are error-free and represent key notions investigated by applied researchers. Unfortunately, the missing-data mechanism is then not missing at random (NMAR). In this article, a new estimation method is proposed, which leads to consistent and asymptotically normal estimators for all parameters in a linear latent variate model, where the missing mechanism depends on the latent variables and no concrete functional form for the missing-data mechanism is used in estimation. The method to be proposed is a type of multi-sample analysis with or without mean structures, and hence, it is easy to implement. Complete-case analysis is shown to produce consistent estimators for some important parameters in the model.