检索结果-内蒙古大学图书馆

1st International Conference on Decision and Game Theory for Security

作者： Gueye, Assane Walrand, Jean C. Anantharam, Venkat Univ Calif Berkeley Dept EECS Berkeley CA 94720 USA

ISBN: (纸本)9783642171963

We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, and an attacker who is capable of attacking a link in the network. We model. their interaction as a zero-sum game and discuss a particular set of Nash equilibria. More specifically, we show that there always exists a Nash equilibrium under which the attacker targets a critical set of links. A set of links is called critical if it has maximum vulnerability, and the vulnerability of a set of links is defined as the minimum fraction of links the set has in common with a spanning tree. Using simple examples, we discuss the importance of critical subsets in the design of networks that are aimed to be robust against attackers. Finally, an algorithm is provided, to compute a critical subset of a given graph.

关键词： network Topology Connectivity Graph Vulnerability Spanning Trees Minimum Cut Set Game Theory Nash Equilibrium Linear Programming Blocking pairs of polyhedra Polymatroid network flow algorithm

来源：评论

学校读者我要写书评

暂无评论

Energy conservation algorithms for maintaining coverage and connectivity in wireless sensor networks

引用

IET COMMUNICATIONS 2010年第7期4卷 786-800页

作者： Liu, L. Hu, B. Li, L. Lanzhou Univ Sch Informat Sci & Engn Lanzhou 730000 Gansu Peoples R China Birmingham City Univ Dept Comp Birmingham B42 2SU W Midlands England Hefei Univ Technol Sch Comp & Informat Hefei 230009 Anhui Peoples R China

Energy conservation, coverage and connectivity are three critical application requirements in wireless sensor networks, especially in sensor networks for vehicular applications. Related researches have either concerned coverage, connectivity and energy conservation separately or required sensing/transmission range restrictions. In this study, the authors aim to maximise the network lifetime by redundant sensor nodes, while maintaining coverage and connectivity simultaneously, without any sensing or transmission range restriction. We propose maximum disjoint sets for maintaining coverage and connectivity (MDS-MCC) problem and the authors prove it is NP-complete. We also present two algorithms to solve MDS-MCC, Heuristic algorithm and network flow algorithm. We analyse and compare the performance of these two algorithms through simulations. According to several metrics, the authors give some suggestions of designing a sensor network. Furthermore, we study MDS-MCC problem under some special conditions, and an important theoretical result is obtained while designing a sensor network. As well as aiming to design an energy conservation sensor network, the present work can also be applied in applications requiring fault tolerance by redundancy.

关键词： telecommunication power supplies fault tolerance energy connectivity energy coverage Telecommunication power supplies Reliability heuristic algorithm energy conservation algorithms Wireless sensor networks network flow algorithm network lifetime vehicular applications wireless sensor networks telecommunication network reliability

来源：评论

学校读者我要写书评

暂无评论

Design of network topology in an adversarial environment 10

Design of network topology in an adversarial environment

引用

Proceedings of the First international conference on Decision and game theory for security

作者： Assane Gueye Jean C. Walrand Venkat Anantharam University of California at Berkeley EECS Department Berkeley CA

ISBN: (纸本)9783642171963

We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, and an attacker who is capable of attacking a link in the network. We model their interaction as a zero-sum game and discuss a particular set of Nash equilibria. More specifically, we show that there always exists a Nash equilibrium under which the attacker targets a critical set of links. A set of links is called critical if it has maximum vulnerability, and the vulnerability of a set of links is defined as the minimum fraction of links the set has in common with a spanning tree. Using simple examples, we discuss the importance of critical subsets in the design of networks that are aimed to be robust against attackers. Finally, an algorithm is provided, to compute a critical subset of a given graph.

关键词： network flow algorithm blocking pairs of polyhedra graph vulnerability spanning trees minimum cut set Nash equilibrium game theory polymatroid linear programming connectivity network topology

来源：评论

学校读者我要写书评

暂无评论

An optimal network-flow-based simultaneous diode and jumper insertion algorithm for antenna fixing

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2008年第6期27卷 1055-1065页

作者： Jiang, Zhe-Wei Chang, Yao-Wen Natl Taiwan Univ Grad Inst Elect Engn Taipei 106 Taiwan Natl Taiwan Univ Dept Elect Engn Taipei 106 Taiwan Waseda Univ Kitakyushu Fukuoka 8080135 Japan

As technology enters the nanometer territory, the antenna effect plays an important role in determining the yield and reliability of a VLSI circuit. Diode and jumper insertions are the most effective techniques to fix the antenna effect. However, due to the increasing design complexity and the limited routing resource, applying diode or jumper insertion alone cannot achieve a high antenna fixing rate. In this paper, we give a polynomial-time antenna violation detection/fixing algorithm by simultaneous diode and jumper insertion with minimum cost, which is based on a minimum-cost network-flow formulation. Experimental. results show that our algorithm consistently achieves much higher antenna fixing rates than the state-of-the-art jumper and diode insertion algorithms alone.

关键词： design for manufacturability interconnect network flow algorithm physical design

来源：评论

学校读者我要写书评

暂无评论

network flow based algorithm on Dynamic Optimal Dispatch

Network flow based algorithm on Dynamic Optimal Dispatch

引用

International Conference on Power System Technology (POWERCON 2000)

作者： Li, ZY He, GY Chen, XQ Tsing Hua Univ Dept Elect Engn Beijing 100084 Peoples R China

ISBN: (纸本)0780363388

Dynamic Optimal Dispatch (DOD) has long been recognized as an important issue in power system operation and should be considered in competitive electricity markets. This paper proposes a novel network flow model of DOD and applies nonlinear network flow method to its solution. Case studies show that the proposed model and algorithm have such merits as simplicity, generality, and rapidity.

关键词： dynamic optimal dispatch ramp constraints network flow algorithm

来源：评论

学校读者我要写书评

暂无评论

Robust performance optimization using padding nodes and separator sets

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2001年第11期E84A卷 2739-2745页

作者： Tamiya, Y Fujitsu Labs Ltd Kawasaki Kanagawa 2118588 Japan

In this paper we present two contributions for a set of local transformations (a selection set) to improve a performance of a very large circuit. The first contribution is an idea of "padding node" and "multi-separator-set." We have proven that combination of padding node and multi-separator-set provides the optimum selection set. The second contribution is our heuristic method to find a semi-optimum multi-separator-set, which uses a network flow algorithm. Our method is robust for very large circuits, because its memory usage and calculation time are linear and polynomial order with the size of the circuit. We have compared our method with Singh's selection function method, which provides the optimum selection set and is the best method in literature to date. Our method has successfully optimized delays of all circuits, while Singh's selection function method has aborted with three large circuits because of memory overflow. The results also has shown our method has a comparable capability in delay optimization to Singh's method, although our method is heuristic.

关键词： timing optimization separator set network flow algorithm

来源：评论

学校读者我要写书评

暂无评论

A network flow algorithm for hydrothermal scheduling

A network flow algorithm for hydrothermal scheduling

引用

1998 International Conference on Power System Technology (POWERCON 98)

作者： He, GY Yang, Q Chen, XQ Tsing Hua Univ Dept Elect Engn Beijing Peoples R China

ISBN: (纸本)0780347544

This paper presents a new primal-dual algorithm, which is capable of solving nonlinear network flow problem with convex separable cost. One of the main characteristics of the algorithm is that it can begin with any circulation, feasible or not, provided that node conservation conditions are satisfied. Furthermore, this paper introduces how to apply the algorithm to solve hydrothermal scheduling problems. Tests on the thermal subsystem with fixed energy plants have been performed. Results have demonstrated the high efficiency of the code.

关键词： network flow algorithm nonlinear optimization primal-dual algorithm hydrothermal scheduling

来源：评论

学校读者我要写书评

暂无评论

Scheduling hydro power systems with restricted operating zones and discharge ramping constraints

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 1999年第1期14卷 126-131页

作者： Guan, XH Svoboda, A Li, CA Xi An Jiao Tong Univ Syst Engn Inst Xian 710049 Peoples R China Pacific Gas & Elect Co B18E San Francisco CA 94177 USA

An optimization-based algorithm is presented for scheduling hydro power systems with restricted operating zones and discharge ramping constraints. Hydro watershed scheduling problems are difficult to solve because many constraints, continuous and discrete, including hydraulic coupling of cascaded reservoirs have to be considered. Restricted or forbidden operating zones as well as minimum generation limits of hydro units result in discontinuous preferred operating regions, and hinder direct applications of efficient continuous optimization methods such as network now algorithms. Discharge ramping constraints due to navigational, environmental and recreational requirements in a hydro system add another dimension of difficulty since they couple generation or water discharge across time horizon. Integrated consideration of the above constraints is very challenging. The key idea of this paper is to use additional sets of multipliers to relax discontinuous operating region and discharge ramping constraints on individual hydro units so that a two-level optimization structure is formed. The low level consists of a continuous discharge scheduling subproblem determining the generation levels of all units in the entire watershed, and a number of pure integer scheduling subproblems determining the hydro operating states, one for each unit. The discharge subproblem is solved by a network flow algorithm, and the integer scheduling problems are solved by dynamic programming with a small number of states and well-structured transitions. The two sets of subproblems are coordinated through multipliers updated at the high level by using a modified subgradient algorithm. After the dual problem converges, a feasible hydro schedule is obtained by using the same network flow algorithm with the operating states obtained, and operating ranges modified to guarantee satisfaction of ramping constraints. Numerical testing based on the data sets of the PG&E power system shows that this method is

关键词： power generation scheduling hydrothermal scheduling restricted operating zones mixed-integer programming network flow algorithm

来源：评论

学校读者我要写书评

暂无评论

A 2ND-ORDER network flow algorithm FOR HYDROTHERMAL SCHEDULING

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 1995年第3期10卷 1635-1641页

作者： OLIVEIRA, GG SOARES, S UNIV CAMPINAS FAC ELECT ENGNDEPT SYST ENGNBR-13081970 CAMPINASSPBRAZIL

This paper presents a second-order network flow algorithm specially designed for hydrothermal scheduling problems. The algorithm is based on the Truncated Newton method and takes advantage of the particular layout of the hydro scheduling network. The three-diagonal structure of the Hessian matrix is also exploited. Heuristic strategies for variable partition into basic-superbasic-nonbasic sets are suggested to improve the algorithm's efficiency. Tests with systems of dimensions up to 27 hydro plants in cascade have been performed in order to evaluate the algorithm's performance and compare some variable partition strategies. Results have demonstrated the high efficiency of the code.

关键词： HYDROTHERMAL SCHEDULING network flow algorithm 2ND-ORDER METHOD NONLINEAR OPTIMIZATION

来源：评论

学校读者我要写书评

暂无评论

Design and evaluation of data allocation algorithms for distributed multimedia database systems

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1996年第7期14卷 1332-1348页

作者： Kwok, YK Karlapalem, K Ahmad, I Pun, NM Department of Computer Science Hang Kong University of Science and Technology Kowloon Hong Kong China

A major cost in retrieving multimedia data from multiple sites is the cost incurred in transferring multimedia data objects (MDO's) from different sites to the site where the query is initiated. The objective of a data allocation algorithm is to locate the MDO's at different sites so as to minimize the total data transfer cost incurred in executing a given set of queries, There is a mutual dependency between data allocation and query execution strategies in that the optimal allocation of MDO's depends on the query execution strategy employed by a distributed multimedia system while the query execution strategy optimizes a query based on this allocation, In this paper, we flu the query execution strategy and develop a site-independent MDO dependency graph representation to model the dependencies among the MDO's accessed by a query, Given the MDO dependency graphs as well as the set of multimedia database sites, data transfer costs between the sites, the allocation limit on the number of MDO's that can be allocated at a site, and the query execution frequencies from the sites, an allocation scheme is generated, We formulate the data allocation problem as an optimization problem, We solve this problem with a number of techniques that broadly belong to three classes: max-flow min-cut, state-space search, and graph partitioning heuristics. The max-flow min-cut technique formulates the data allocation problem as a network-flow problem, and uses a hill-climbing approach to try to find the optimal solution, For the state-space search approach, the problem is solved using a best-first search algorithm, The graph partitioning approach uses two clustering heuristics, the agglomerative clustering and divisive clustering, We evaluate and compare these approaches, and assess their cost-performance trade-offs, All algorithms are also compared with optimal solutions obtained through exhaustive search, Conclusions are also made on the suitability of these approaches to different sce

关键词： data allocation distributed database systems multimedia database systems query processing hill-climbing heuristics optimal allocation max-flow min-cut problem network flow algorithm clustering best-first search algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：