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.     

A characterization of network representable polymatroids

Meggido [1974] showed that the maximum flow through sets of sources in a multiple sink flow network is a polymatroidal function. Recently, Federgruen and Groenevelt [1985], [1986] have considered polymatroids that can be represented by a multiple source flow network and have improved the runnung time of an important scheduling application.We give a characterization of network representability and relate representable polymatroids to the theory of gammoids.

---

Zusammenfassung Meggido [1974] hat gezeigt, daß ein maximaler Fluß durch ein Netzwerk mit mehrfachen Senken eine polymatroidale Funktion beschreibt. Federgruen und Groenvelt [1985], [1986] haben kürzlich solche Polymatroide betrachtet, die durch Flüsse in derartigen Netzwerken repräsentiert werden können und haben so die Laufzeit einer wichtigen Schedulinganwendung verbessern können.Wir geben eine Charakterisierung von Funktionen, die durch derartige Netzflußnetzwerke realisierbar sind. Dabei stellen wir eine Verbindung her zwischen Repräsentierbarkeit und Gammoidtheorie.

     

12-Ring Network Coordination Polymer——{[Cu(C_4N_2H_(10))_4]_2·H_4V_4O_(14)}_n Formed by Linking cyclo-[H_4V_4O_(14)]~(4-) with Cu(C_4N_2H_(10))~(2+)_4 Cation Clusters

IntroductionThe interest in polyoxometalates that are widelyused in medical chemistry, catalyst reactions, and ma-terial sciences stems from their complicated aggregatesformed by means of corner-, edge- and face-sha-ring[1—4]. The exploitation of new str…     

宽带城域网络及其业务接入解决方案

本结合宽带城域网的建设，对宽带城域网的网络体系结构、用户信息安全、网络管理作了描述，并以中兴宽带系列产品ZXB10为侧，对具体的业务给出相应的接入模式。     

产生图的全部哈密顿回路

本文对完全图和非完全图分别给出了一个产生图中全部Hamilton回路的算法。与已有算法比较,本文提出的算法具有速度快、内存小的优点。该算法用于判别一个图是否Hamilton图效果良好。     

视频信息监控与处理--ATM视频监控系统下

针对银行ATM管理上的缺陷，提出了ATM视频监控系统，并就系统的功能及其信息处理与安全方面的特点作了论述。     

基于网络环境下的高校图书馆用户教育

通过对当前我国高校图书馆用户教育存在问题的分析，找出其中的原因，并提出了网络环境下的高校图书馆如何发展新型的用户教育体系．     

CJ925终端和ATM的故障处理

计算机技术在银行已得到普遍应用,计算机的处理能力对银行业发展有着很大的促进作用.本文对某家银行的储蓄所终端国光CJ925与ATM的故障及处理方法给出了详细的解释.     

SPAR: stochastic programming with adversarial recourse

We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We introduce SPAR, which utilizes mixed-integer programming for the design decision and a Markov decision process (MDP) for the modeling of our adversarial phase.     

10 kV真空断路器常见故障分析及处理

就目前长治电网中真空断路器在变电站使用中比较常见的故障进行了分析，并结合实际情况提出了处理办法。