基于GSPN的实施延迟策略生产系统建模与性能分析

延迟策略是协调市场需求变化的绝对性和生产系统相对稳定性矛盾的一个重要战略手段。为分析实施延迟策略生产系统的性能,利用随机广义Petri-net(GSPN)的建模分析方法,并根据GSPN与马尔科夫链的同构关系,将GSPN模型转化成为等价的马尔科夫链模型。通过马尔科夫链及相关数学方法获得实施延迟策略生产系统的主要性能指标。该方法不仅可以分析实施延迟策略生产系统的整体性能,而且能够对系统的各个环节运作效率做出定量分析。最后,通过算例分析验证了该方法的科学性与有效性,丰富了延迟策略研究方面的方法理论。     

An improved cellular automaton model considering the effect of traffic lights and driving behaviour

This paper proposes an improved cellular automaton model to describe the urban traffic flow with the consideration of traffic light and driving behaviour effects. Based on the model,the characteristics of the urban traffic flow on a single-lane road are investigated under three different control strategies,i.e.,the synchronized,the green wave and the random strategies. The fundamental diagrams and time-space patterns of the traffic flows are provided for these strategies respectively. It finds that the dynamical transition to the congested flow appears when the vehicle density is higher than a critical level. The saturated flow is less dependent on the cycle time and the strategies of the traffic light control,while the critical vehicle density varies with the cycle time and the strategies. Simulated results indicate that the green wave strategy is proven to be the most effective one among the above three control strategies.     

广义阿基米德定律的理论推导和适用条件

给出了阿基米德(Archimedes)浮力定律的一个理论证明,进一步推广给出了广义阿基米德定律,进而研究了其局限性和成立条件．     

Optimality of the barrier strategy in de Finetti’s dividend problem for spectrally negative Lévy processes: An alternative approach

The optimal dividend problem proposed in de Finetti [1] is to find the dividend-payment strategy that maximizes the expected discounted value of dividends which are paid to the shareholders until the company is ruined. Avram et al. [9] studied the case when the risk process is modelled by a general spectrally negative Lévy process and Loeffen [10] gave sufficient conditions under which the optimal strategy is of the barrier type. Recently Kyprianou et al. [11] strengthened the result of Loeffen [10] which established a larger class of Lévy processes for which the barrier strategy is optimal among all admissible ones. In this paper we use an analytical argument to re-investigate the optimality of barrier dividend strategies considered in the three recent papers.     

Integration of business function models into an aggregate enterprise systems model

Introduced are methods that combine models of distinct business functions into an aggregate model of an enterprise system to assist management’s strategic decision making. Models of individual business functions are reviewed, and equations quantifying relationships presented. Using methods of system theory, including block diagrams, non-dimensionalization, and state equation methods, these business function sub-models were assembled into a composite enterprise systems model. The formulated aggregate model is illustrated with industry examples for tire companies; nonetheless the aggregate model can be used to assess other industries. Values of parameters for the system model were determined from data obtained from annual reports of publicly owned companies. Simulations closely matched the companies’ published performance over ensuing years. The developed aggregate enterprise model has significant predictive capabilities for modern corporations.     

基于可拓策略生成技术的商品搜索服务改进研究

购买者在使用商品搜索服务时所得搜索结果数量不符合其主观要求是一个典型而普遍的矛盾问题.在分析矛盾问题的基础上,提出以可拓策略生成技术改进商品搜索服务的方法.该方法通过对购买者提出的搜索要求进行发散分析及相关分析,以形成各种可能变换,并依据关联函数寻求问题的解变换,以及利用评价函数对解变换进行优选.给出了关于策略生成的基本算法,并实现于笔记本电脑导购网站平台上.实验及测试结果表明,系统能有效生成矛盾问题的解变换,从而改进了搜索服务的质量.     

一类二阶线性周期边值问题解的存在唯一性的构造性证明

本文利用初值问题方法给出了一类二阶线性周期边值问题解的存在唯一性的构造性证明,并利用数值延拓方法,给出了计算实例。因此提供了一种大范围求解这类方程周期解的方法。     

海关走私监管的演化博弈分析

利用演化博弈的方法对海关缉私部门和走私商之间相互作用时的策略,进行了分析。结果表明：当企业进行走私活动的收益大于不走私的收益、海关缉私部门对走私企业处罚力度过轻或对缉私检查的成本过高时,走私必然发生。要确保走私的发生率降低,就必须对进行走私的企业进行严惩,降低其的预期收益。同时,要加强缉私队伍建设。     

The polynomial bounds of proof complexity in Frege systems

The concept of a determinative set of variables for a propositional formula was introduced by one of the authors, which made it possible to distinguish the set of hard-determinable formulas. The proof complexity of a formula of this sort has exponential lower bounds in some proof systems of classical propositional calculus (cut-free sequent system, resolution system, analytic tableaux, cutting planes, and bounded Frege systems). In this paper we prove that the property of hard-determinability is insufficient for obtaining a superpolynomial lower bound of proof lines (sizes) in Frege systems: an example of a sequence of hard-determinable formulas is given whose proof complexities are polynomially bounded in every Frege system.     

Monotonicity and supermodularity results for the Erlang loss system

For the Erlang loss system with s servers and offered load a, we show that: (i) the load carried by the last server is strictly increasing in a; (ii) the carried load of the whole system is strictly supermodular on {(s,a)|s=0,1,… and a>0}.