The probability of the existence of a feasible flow in a stochastic transportation network

Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016     

采用SHLPN分析特种车载总线网络可靠性

针对特种车载总线网络可靠性难以评估的问题,提出采用随机高级Petri网(Stochastic High-level Petri Net,SHLPN)分析特种车载总线网络可靠性。深入分析特种车载总线网络故障模式的基础上,将其等效为冗余总线控制器模块、远程终端模块和冗余链路模块的串联,分别建立各个模块的SHLPN模型,得到了各个模块的稳态可用度计算式,进而综合得到特种车载总线网络的稳态可用度计算式。最后,实例分析验证了所提方法的有效性。     

Generation and storage dispatch in electricity networks with generator disruptions

We present methods for optimizing generation and storage decisions in an electricity network with multiple unreliable generators, each colocated with one energy storage unit (e.g., battery), and multiple loads under power flow constraints. Our model chooses the amount of energy produced by each generator and the amount of energy stored in each battery in every time period in order to minimize power generation and storage costs when each generator faces stochastic Markovian supply disruptions. This problem cannot be optimized easily using stochastic programming and/or dynamic programming approaches. Therefore, in this study, we present several heuristic methods to find an approximate optimal solution for this system. Each heuristic involves decomposing the network into several single‐generator, single‐battery, multiload systems and solving them optimally using dynamic programming, then obtaining a solution for the original problem by recombining. We discuss the computational performance of the proposed heuristics as well as insights gained from the models. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 493–511, 2015     

ATM交换网络的连接技术

介绍了异步传输模式交换网络(ATM)的概念、组成及特点,并着重论述了ATM的连接技术,包括分层结构、连接过程和连接建立。其中提出了ATM层是其连接技术的核心,连接过程的实质是利用了虚连接的概念及连接建立的4个基本步骤。最后指出了ATM网络在未来通信中的应用及发展前景。     

基于反向验证的RSC码编码参数盲识别

针对Turbo码编码中应用的RSC编码器盲识别问题,提出一种反向验证的方法,对其参数进行识别分析。通过对RSC编码器参数进行遍历估计,重新输入码字序列,将得到的码字序列与原来的输出序列进行对比,找出最优的参数组合,完成对RSC编码参数的识别。仿真实验表明,该方法能够有效完成对RSC编码器的参数识别,特别在误码率为0.3时,依然能够达到识别效果,具有较好的容错性能。     

基于复杂网络的机群作战建模与仿真

机群作战已成为战争中的主要作战形式之一。而传统的作战模型,已经不适应其多任务驱动、多机种协作的机群作战特性。为此,以复杂网络为基础,提出了一种构造不同类型的节点连接的动态生成算法,构建了反映真实作战场景的网络描述模型,较好地呈现出了机群作战中的涌现性、模糊性等诸多性质。并提出了描述机群作战网络的统计特征量,通过破击仿真实验,得出了与战争事实相符合的结论,为未来研究机群作战体系效能评估打下了基础。     

战术移动自组织网络路由方法

战术移动自组织网络(Mobile Ad Hoc Network,MANET)作为网络中心战的重要组成,有望解决未来战场上传统作战力量与新型无人作战平台之间高效组网通信问题。战术MANET作为MANET在战场环境下的应用,可在基础设施缺乏或遭破坏的地域快速展开,具有节点自由出入、移动性高、抗毁伤性强等特点。综述了战术MANET路由协议和仿真方法,对研究方法和面临的挑战作了简要评述。     

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

Performance analysis of the cultural and creative industry: a network‐based approach

The cultural and creative industries (CCIs) in Taiwan have gradually contributed to the national economy under the impetus of government policies. We employ a two‐stage data envelopment analysis model with an additive efficiency decomposition approach to measure the profitability and marketability of 22 Taiwanese cultural and creative companies. Furthermore, we employ the network‐based ranking approach to identify benchmark inputs/outputs, and the strengths and weakness of each company. Our empirical results show that the profitability of the cultural and creative companies is better than their marketability. Companies in the industries of publishing, creative life, popular music, and cultural content averagely perform better than those in the other three types of CCIs in terms of profitability. Companies in the creative life industry are on average more efficient than those in the other five types of CCIs in terms of marketability. The profitability/marketability matrix of cultural and creative companies is also presented.     

基于PIC16F877及RTL8019AS构成的PIC网络组件及应用

介绍了基于PIC16F877及RTL8019AS构成的PIC网络组件.使用该组件,可以通过PC或其它设备(如手机等)经网络对某些电器实行远程控制及监测.