一种新的大规模网络最短路径的近似算法

平均最短路径长度是复杂网络的一个重要特性,但是对于大规模网络的平均最短路径长度的计算是困难的.在最近的一次对中国教育网的研究中.建立了一个有2 354 934个网页和26 816 209个链接的网络.要想计算该网络的平均最短路径长度,无论是传统的Floyd、Dijkstra算法,还是基于MPI的并行算法,在现有的计算机资源下都难以实现.提出了二级网络的概念,并基于此给出了一种针对中国教育网的新算法,使得在可以接受的时间内完成平均最短路径的近似计算,经试算效果令人满意,说明这种方法对于计算大规模网络的平均最短路径是有效的.     

EWMA控制图在MSA稳定性分析中的应用

针对传统的 Shewhart 控制图使用当前观测数据进行测量系统分析(MSA)的稳定性分析,不易检测出过程均值中存在的小偏移,而指数加权滑动平均(EWMA)和累计和(CUSUM)控制图考虑了历史数据,可以克服Shewhart 控制图在小波动情况下检测能力不足的缺陷:首先通过 Montle-Carlo 模拟计算控制图性能评价指标ARL(average run length),分析了 EWMA 和 CUSUM 控制图的优越性;然后给出了 EWMA 控制图在 MSA 稳定性分析中的实施步骤.示例分析表明 EWMA 在小波动时比 CUSUM 和 Shewhart 控制图更为有效.     

Cluster Synchronization in a Complex Dynamical Network with Two Nonidentical Clusters

This paper further investigates cluster synchronization in a complex dynamical network with two-cluster. Each cluster contains a number of identical dynamical systems, however, the subsystems composing the two clusters can be different, i.e., the individual dynamical system in one cluster can differ from that in the other cluster. Complete synchronization within each cluster is possible only if each node from one cluster receives the same input from nodes in other cluster. In this case, the stability condition of one-cluster synchronization is known to contain two terms： the first accounts for the contribution of the inner-cluster coupling structure while the second is simply an extra linear term, which can be deduced by the ＂same-input＂ condition. Applying the connection graph stability method, the authors obtain an upper bound of input strength for one cluster if the first account is known, by which the synchronizability of cluster can be scaled. For different clusters, there are different upper bound of input strength by virtue of different dynamics and the corresponding cluster structure. Moreover, two illustrative examples are presented and the numerical simulations coincide with the theoretical analysis.     

操作风险整体评估方法:基于拓扑数据模型的影响图

考虑到一般操作风险数据模型的不足,提出了一种新的数据模型——操作风险拓扑数据模型.它能够包含风险事件发生过程中各种风险原因之间相互关系的信息,且能支持操作风险的影响图度量方法.随后采用基于拓扑数据模型的影响图方法对操作风险整体评估进行了研究.该方法能够辅助分析各个风险原因之间的相关性,并支持基于拓扑数据模型的操作风险数据的统计分析.最后以一家保险企业为例演示了该方法.基于拓扑数据模型的操作风险影像图度量方法针对操作风险特点,关注控制和流程的失败,更充分利用历史事件中蕴含的信息,简化了各风险原因之间的相关性分析.     

任务型CGF组织本体建模

针对作战模拟对人类行为表示的准确性要求,建立真实反映战场行为的组织模型是非常重要的。根据需求分析和已有研究的不足,提出了基于本体论的组织建模方法,阐述了该组织本体的构建原则,并从组织静态结构和动态行为两个方面定义了相关概念及概念间的关系。在此基础上采用一阶谓词逻辑描述了该组织本体的形式化过程。实验结果表明,该方法能够准确地建立起用于实体的组织模型,使得实体行为可以反映实际战场行为,且能够保证组织本体的通用性。     

Coordinating production and recycling decisions with stochastic demand and return

In this paper, the joint production and recycling problem is investigated for a hybrid manufacturing and remanufacturing system where brand-new products are produced in the manufacturing plant and recycled products are remanufactured into as-new products in the remanufacturing facility. Both the brand-new products and remanufactured products are used to satisfy customer demands. Returns of used products that are recycled from customers are assumed to be stochastic and nonlinearly price-dependent. A mathematical model is proposed to maximize the overall profit of the system through simultaneously optimizing the production and recycling decisions, subject to two capacity constraints — the manufacturing capacity and the remanufacturing capacity. Based on Lagrangian relaxation method, subgradient algorithm and heuristic algorithm, a solution approach is developed to solve the problem. A representative example is presented to illustrate the system, and managerial analysis indicates that the uncertainties in demand and return have much influence on the production and recycling policy. In addition, twenty randomly produced examples are solved, and computational results show that the solution approach can obtain very good solutions for all examples in reasonable time.     

Coordinating pricing and inventory decisions in a bounded production system with uncertain yield

Most inventory researches assume that production level can fluctuate arbitrarily. However, large fluctuation of the production level in many firms may be much costly. This paper addresses the coordinating pricing and inventory control problem in a bounded production system with uncertain yield, in which the production level is constrained between a maximum and minimum level in each period and the price can be adjusted dynamically. We show that the optimal policy is the interval base-stock-list-price policy. Also, we study the impact of the production bounds and uncertainty of the yield on the production system. Numerical experiments are also performed to study the impact of parameters on the system.     

The M/PH/1 queue with working vacations and vacation interruption

We study an M/PH/1 queue with phase type working vacation and vacation interruption where the vacation time follows a phase type distribution. The server serves the customers at a lower rate in a vacation period. The server comes back to the regular busy period at a service completion without completing the vacation. Such policy is called vacation interruption. In terms of quasi birth and death process and matrix-geometric solution method, we obtain the stationary queue length distribution. Moreover we obtain the conditional stochastic decomposition structures of queue length and waiting time when the service time distribution in the regular busy period is exponential.     

Two-scale finite element Green’s function approximations with applications to electrostatic potential computation

<正> In this paper,a two-scale finite element approach is proposed and analyzed for approximationsof Green's function in three-dimensions.This approach is based on a two-scale finite elementspace defined,respectively,on the whole domain with size H and on some subdomain containing singularpoints with size h (h H).It is shown that this two-scale discretization approach is very efficient.In particular,the two-scale discretization approach is applied to solve Poisson-Boltzmann equationssuccessfully.     

Removable ears of 1-extendable graphs

<正> Carvalho,Lucchesi and Murty proved that any 1-extendable graph G different from K_2and C_(2n)has at least Δ(G)edge-disjoint removable ears,and any brick G distinct from K_4 and■hasat least Δ(G)-2 removable edges,where Δ(G)denotes the maximum degree of G.In this paper,weimprove the lower bounds for numbers of removable ears and removable edges of 1-extendable graphs.It is proved that any 1-extendable graph G different from K_2 and C_(2n)has at least χ′(G)edge-disjointremovable ears,and any brick G distinct from K_4 and■has at least χ′(G)-2 removable edges,whereχ′(G)denotes the edge-chromatic number of G.