Unified Model for Generation Complex Networks with Utility Preferential Attachment

In this paper, based on the utility preferential attachment, we propose a new unified model to generate different network topologies such as scale-free, small-world and random networks. Moreover, a new network structure named super scale network is found, which has monopoly characteristic in our simulation experiments. Finally, the characteristics ofthis new network are given.     

Index Heuristics for Multiclass M/G/1 Systems with Nonpreemptive Service and Convex Holding Costs

We consider the optimal service control of a multiclass M/G/1 queueing system in which customers are served nonpreemptively and the system cost rate is additive across classes and increasing convex in the numbers present in each class. Following Whittle's approach to a class of restless bandit problems, we develop a Langrangian relaxation of the service control problem which serves to motivate the development of a class of index heuristics. The index for a particular customer class is characterised as a fair charge for service of that class. The paper develops these indices and reports an extensive numerical investigation which exhibits strong performance of the index heuristics for both discounted and average costs.     

Control Policy for a Manufacturing System with Random Yield and Rework

We develop a production policy that controls work-in-process (WIP) levels and satisfies demand in a multistage manufacturing system with significant uncertainty in yield, rework, and demand. The problem addressed in this paper is more general than those in the literature in three aspects: (i) multiple products are processed at multiple workstations, and the capacity of each workstation is limited and shared by multiple operations; (ii) the behavior of a production policy is investigated over an infinite-time horizon, and thus the system stability can be evaluated; (iii) the representation of yield and rework uncertainty is generalized. Generalizing both the system structure and the nature of uncertainty requires a new mathematical development in the theory of infinite-horizon stochastic dynamic programming. The theoretical contributions of this paper are the existence proofs of the optimal stationary control for a stochastic dynamic programming problem and the finite covariances of WIP and production levels under the general expression of uncertainty. We develop a simple and explicit sufficient condition that guarantees the existence of both the optimal stationary control and the system stability. We describe how a production policy can be constructed for the manufacturing system based on the propositions derived.     

审讯过程的数学模型

本文从经济学的观点出发，利用对策论方法建立了审讯过程的数学模型，并由此研究了讯问人三种主要策略对审讯成功的效度。     

多目标多阶段决策问题最优化方法及应用

本文提出了可行状态点,可行边和可行策略等概念,建立了一种新的解决多目标多阶段决策问题的方法,介绍了这一方法的应用实例:     

试论新南非语言政策的演变及其对教育的影响

文章以语言政策最近的发展为背景,讨论了与语言使用现实和执行相关的问题;以全南非语言委员会(PANSALB)遭遇的一些问题、公共场所语言使用情况、家庭使用语的分类以及学校里的教学指导语为案例进行阐释。这些案例表明了在执行语言政策和形成包容性的民族认同方面,南非依然困难重重。     

中外低保管理面面观

目前我国城市居民最低生活保障制度的执行情况进展良好。低保政策的执行在保障下岗和失业人员基本生活及促进就业和再就业等方面发挥了明显的作用。但贫困问题是一个世界性问题 ,我们应借鉴各国在缓解贫困方面的作法 ,促进我国城市扶贫工作的顺利进行     

从会计核算的角度探讨我国增值税的征管与转型

本文从应交增值税的核算角度探讨增值税的征收管理 ,认为应该把销项税额与进项税额的核算基础由现行的权责发生制改为收付实现制 ,从而有效控制偷、逃税现象 ,同时促进增值税税收征管的改革 ,使增值税征收管理的方式、手段更趋严密、科学。又从购进固定资产所支付的进项税额的核算角度探讨增值税制由生产型增值税转为消费型增值税 ,认为这种转型有利于提高企业产品的市场竞争力及西部大开发战略的实施等     

原木随机存贮策略的最优化问题

本主要介绍原木经销商在周期内原木变价销售情况下的最佳期初贮存量的决策方法，在建立期望机会成本的数学模型基础上，探讨原木随机存贮策略的最优化问题。     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.