行波型热声发动机的分布参数法热力分析

在现有热声网络模型的基础上 ,对行波型热声发动机采用分布参数法进行了详细地分析 ,得到了较为完整的分布参数法网络模型 ,并给出了该模型的定性关系式 ,所得结果与采用集总参数法的结果有很大差异。分析表明 ,分布参数法更适合于一般的系统情况 ,集总参数法仅仅在一定条件下才适用。文中对一个实际系统应用分布参数法进行了分析 ,得到一些结论 ,对于我们设计行波型热声发动机有非常重要的理论指导意义     

Using activity focus networks to pressure terrorist organizations

The predominant idea for using network concepts to fight terrorists centers on disabling key parts of their communication networks. Although this counternetwork strategy is clearly a sound approach, it is vulnerable to missing, incomplete, or erroneous information about the network. This paper describes a different and complementary application of network concepts to terrorist organizations. It is based on activity focus networks (AFNs), which represent the complex activity system of an organization. An activity focus is a conceptual or physical entity around which joint activity is organized. Any organization has a number of these, which are in some cases compatible and in some cases incompatible. The set of foci and their relations of compatibility and incompatibility define the AFN. A hypothetical AFN for a terrorist organization is specified and tested in a simulation called AQAS. It shows that certain activity foci, and in particular one combination, have high potential as pressure points for the activity system. The AFN approach complements the counternetwork approach by reducing the downside risk of incomplete information about the communication network, and enhancing the effectiveness of counternetwork approaches over time. Steven R. Corman is Professor in the Hugh Downs School of Human Communication at Arizona State University and Chair of the Organizational Communication Division of the International Communication Association. His research interests include communication networks and activity systems, high-resolution text and discourse analysis, and modeling and simulation of human communication systems.     

创业投资与金融体系关系的实证研究

本文实证研究了创业投资产业与金融体系的内在关系,并对目前我国以银行为中心的金融体系下发展创业投资产业提出了一些建议.     

我国封闭式投资基金业绩评价实证研究

随着我国基金行业超常发展,恰当的分析和评价基金业绩已越来越重要。本文根据CAPM的基本原理,利用国外先进的基金业绩评价方法对我国封闭式基金的综合业绩进行实证研究。研究结果表明:总体来看,基金获得的市场超额收益显著为负。基金经理不具有证券选择能力,但具有一定的市场择时能力,但这两种能力均不显著。同时,我们还发现不同投资风格的基金经理具有不同的证券选择能力和市场择时能力。     

Network externalities in a dynamic monopoly

We reconsider the role of network externalities in a dynamic spatial monopoly where the firm must invest in order to accumulate capacity, while consumers may have either linear or quadratic preferences. We (1) characterise saddle point equilibria, (2) prove that the extent of market coverage is increasing in the network effect and (3) unlike the existing static literature on the same problem, the monopolist may not make introductory price offers. Then, we briefly deal with the socially optimal solution, showing that, in general, a planner would serve more consumers than a profit-seeking monopolist.      

Compact, reliable asymmetric optical configuration for cost-effective fabrication of multiplex dot matrix hologram in anti-counterfeiting applications

This study presents a compact optical configuration that can generate a multiplex dot-matrix hologram with complex interlaced images for anti-counterfeiting applications on valuable paper. Varying the orientation of the interference plane can enable the multiplex hologram to be recorded without changing the interference angle of two laser beams. With its simple asymmetric optical setup, a multiplex hologram with many interlaced images can be efficiently fabricated, increasing the cost of imitation. Experimental details of the asymmetric optical setup are also described.     

关于组合最优化理论的多媒体教学实践

本文讨论和分析了开发组合最比化理论系列课程多媒体课件的基本认识、课件的主要特色和体会，并提出了使用多媒体课件中应注意的问题．     

证券价格按几何布朗运动变化的微观解释

金融市场研究中经常不加解释地假设证券价格按几何布朗运动变化 .本文通过假定投资者要求来自证券的期望收益率与证券价格无关 ,在理想市场的前提条件下 ,对证券价格运动将遵循有漂移率的几何布朗运动给予严格的证明 .     

Survivable network design under optimal and heuristic interdiction scenarios

We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular, we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first to construct a network and transmit an initial set of flows through the network. The enemy acts next to destroy a set of constructed arcs in the designer’s network, and the designer acts last to transmit a final set of flows in the network. Most studies of this nature assume that the enemy will act optimally; however, in real-world scenarios one cannot necessarily assume rationality on the part of the enemy. Hence, we prescribe optimal network design algorithms for three different profiles of enemy action: an enemy destroying arcs based on capacities, based on initial flows, or acting optimally to minimize our maximum profits obtained from transmitting flows.