基于两层架构协调的应急物资分配与车辆调度集成优化方法

针对突发事件下的应急物资调运问题，考虑了多个地区同时受灾以及多个出救点需要对其进行救灾并且各出救点的运力有限的情况，以最小化总的车辆运输费用，最大化救灾效率、各受灾点的救灾满意度，以及各受灾点得到救助的公平性为目标，建立了该问题的多目标混合整数非线性规划模型，并提出了一个基于两层架构协调的迭代式遗传算法进行求解。基于仿真数据的实验结果证明了所提出的模型和算法的有效性。     

Multivariate Cox Hidden Markov models with an application to operational risk

ABSTRACT

Modeling multivariate time-series aggregate losses is an important actuarial topic that is very challenging due to the fact that losses can be serially dependent with heterogeneous dependence structures across loss types and business lines. In this paper, we investigate a flexible class of multivariate Cox Hidden Markov Models for the joint arrival process of loss events. Some of the nice properties possessed by this class of models, such as closed-form expressions, thinning properties and model versatility are discussed in details. We provide the expectation-maximization (EM) algorithm for efficient model calibration. Applying the proposed model to an operational risk dataset, we demonstrate that the model offers sufficient flexibility to capture most characteristics of the observed loss frequencies. By modeling the log-transformed loss severities through mixture of Erlang distributions, we can model the aggregate losses. Finally, out-of-sample testing shows that the proposed model is adequate to predict short-term future operational risk losses.     

公开密钥算法RSA策略及程序实现

随着通信的飞速发展，信息安全显得越来越重要，计算机密码体制的基本思想就是将要保护的信息变成伪装信息，在公开密钥算法提出之前，所有密码系统的解密密钥和加密密钥彼此有着直接的联系，这也是秘密密钥的缺陷所在。为此公开密钥算法RSA算法就顺应而生。这种叫加密算法可用VB程序编程实现。     

基于无交叉遗传算法的物流车辆路径问题研究

设计并实现了一种求解基本车辆路径问题的无交叉遗传算法,阐述了无交叉遗传算法求解物流车辆路径问题的关键技术,包括编码方案、初始种群生成方案、适应度函数、种群选择方案和变异操作等;并对比了使用目标函数倒数法和目标函数做差法构造适应度函数时的求解效果。实验结果表明,给出的无交叉遗传算法在求解车辆路径问题上具有良好的性能。     

Cournot Competition and Hit-and-Run Entry and Exit in a Teaching Experiment

Instructors can use a computerized experiment to introduce students to imperfect competition in courses on introductory economics, industrial organization, game theory, and strategy and management. In addition to introducing students to strategic thinking in general, the experiment serves to demonstrate that profits of a firm fall as the number of competitors is increased in a market and that firms enter profitable markets. The authors have used the experiment in undergraduate classes on strategy and management as well as in master of business administration courses with great success.     

论跨国破产的财产清偿问题

跨国公司在快速兴起的同时也面临着跨国破产问题.作为跨国破产问题的一部分,破产财产的清偿问题已成为业界关注的热点问题.本文首先阐述了跨国破产的定义、破产财产的范围及相关原则,随后以雷曼兄弟的破产案件为例,对跨国破产财产清偿原则作了进一步说明.     

《印度之行》解读:生态批评视角

福斯特在作品《印度之行》中反映了印度在自然生态、社会生态、精神生态等方面的危机,表达了他良好的生态愿望——人与自然、人与人之间友好相处,进而实现整个生态和谐。     

发动机测试数据采集与处理系统的设计及实现

文章探索的是有关发动机性能测试数据方面的技术。对发动机需要测量的数据有转速、扭矩、功率、耗油率、耗油量、机油压力、机油温度、冷却水温等参数。发动机测试数据采集与处理系统由上位机和下位杌组成。下位机主要采用AT89C52单片机，用汇编语言编写相应的程序，用模一数转换器ADC0809把模拟量转换为数字量；而上位机采用PC机，程序语言用VB，存储数据采用Access数据库，最终实现试验数据的显示、存贮与打印等功能。     

A monotonically converging algorithm for the severity of ruin in a discrete semi-markov risk model

This paper deals with the severity of ruin in a discrete semi-Markov risk model. It is shown that the work of Reinhard and Snoussi (Stochastic Models, 18) can be extended to cover the case where the premium is an integer value and no restriction on the annual result is imposed. In particular, it is shown that the severity of ruin without initial surplus is solution of a system of equations. It can be obtained by a monotonically converging algorithm when the claims are bounded.     

A hybrid parallel genetic algorithm for yard crane scheduling

This paper aims at postulating a novel strategy in terms of yard crane scheduling. In this study, a dynamic scheduling model using objective programming for yard cranes is initially developed based on rolling-horizon approach. To resolve the NP-complete problem regarding the yard crane scheduling, a hybrid algorithm, which employs heuristic rules and parallel genetic algorithm (PGA), is then employed. Then a simulation model is developed for evaluating this approach. Finally, numerical experiments on a specific container terminal yard are used for system illustration. Computational results suggest that the proposed method is able to solve the problem efficiently.