Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many paths use the same links. This toolbox answers the question how different paths with different loads influence on each other and what is the blocking on each of the defined path. Toolbox is capable of computing blocking for three different WDM network types: with no wavelength conversion, with full wavelength conversion and with limited range wavelength conversion. It is worth noting that case for full conversion can be usefull for any circuit switched network without additional constraints (i.e. wavelength continuity constraint in WDM), for example telephone network. Toolbox contains also scripts for defining network structures (random networks, user defined networks) and traffic matrixes. Three graph algorithms for shortest path computation are also in this toolbox (they are used for traffic matrix creation).
标签： networks blocking switched Because
上传时间： 2017-07-28
上传用户：zhangzhenyu
The PCI Special Interest Group disclaims all warranties and liability for the use of this document and the information contained herein and assumes no responsibility for any errors that may appear in this document, nor does the PCI Special Interest Group make a commitment to update the information contained herein.
标签： warranties disclaims liability Interest
上传时间： 2013-12-26
上传用户：leixinzhuo
After decades of war one company, who had gained powerful supplying both sides with weaponary, steps forwards and crushes both warring factions in one swift movement. Using far superior weaponary and AI craft, the company was completely unstoppable and now no one can stand in their way. Thousands began to perish under the iron fist of the company. The people cried out for a saviour, for someone to light this dark hour... and someone did.
标签： supplying weaponary powerful decades
上传时间： 2013-12-02
上传用户：cx111111
base implementaion of the protein (starting from the amino acid sequence) feature extractor used in "L. Nanni and A. Lumini, An ensemble of Support Vector Machines for predicting virulent proteins, Expert Systems With Applications, vol.36, no.4, pp.7458-7462, May 2009. "
标签： implementaion extractor the starting
上传时间： 2017-08-02
上传用户：wqxstar
the program code converts the given 8085 opcode into mnemonics of assembly level programming... initially give the no. of opcodes to be entered
标签： programming the mnemonics assembly
上传时间： 2013-12-16
上传用户：钓鳌牧马
Some time ago, I stated in another article that I d take the idea of location broadcasting and develop a mobile solution as a follow-up. The problem back then was I had no means to get location data off of a cell phone, or a way to make it useful. My, how times have changed since then! In this article, I ll demonstrate how to get your phone s GPS coordinates…
标签： broadcasting location another article
上传时间： 2013-12-25
上传用户：李梦晗
including Python, C, Java, GNU/Linux, Windows XP, Symbian Series 60, and Mac OS X... ------------------------------------ Bluetooth Essentials for Programmers Author: Albert S. Huang, Larry Rudolph Publisher: Cambridge University Press Number Of Pages: 208 Publication Date: 2007-09-03 ISBN-10/ASIN: 0521703751 ISBN-13/EAN: 9780521703758 Binding: Paperback This book provides an introduction to Bluetooth programming, with a specific focus on developing real code. The authors discuss the major concepts and techniques involved in Bluetooth programming, with special emphasis on how they relate to other networking technologies. They provide specific descriptions and examples for creating applications in a number of programming languages and environments including Python, C, Java, GNU/Linux, Windows XP, Symbian Series 60, and Mac OS X. No previous experience with Bluetooth is assumed, and the material is suitable for anyone with some programming background. The autho……
标签： including Windows Symbian Python
上传时间： 2013-12-21
上传用户：caozhizhi
Calculates if the brackets in a sentence are correctly close. Input consists, one per line, sentences with brackets, and output say YES if its correctly close, or NO int if its not saying where is the error. Input: ()[]<>(**) (*) (ASA Output: YES NO 2 NO 4
标签： Calculates correctly brackets consists
上传时间： 2013-12-13
上传用户：aig85
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
标签： Implementation calculates algorithm Edmonds
上传时间： 2014-01-04
上传用户：kiklkook
(1)自选存储结构，输入含n个顶点（用字符表示顶点名称）和e条边的图G； (2)指定任意顶点x为初始顶点，对图G作DFS遍历，输出DFS（深度优先）顶点序列(提示:使用栈实现DFS)； (3)指定任意顶点x为初始顶点，对图G作BFS（广度遍历），输出BFS顶点序列(提示:使用队列实现BFS)； (5)输入顶点x，查找图G:若存在含x的顶点，则删除该结点及与之相关连的边，并作DFS遍历(执行操作3)；否则输出信息“不存在x”； (6)判断图G是否是连通图，输出信息“YES”/“NO”； (7)如果选用的存储结构是邻接矩阵，则用邻接矩阵的信息生成图G的邻接表
标签： 存储结构
上传时间： 2017-08-29
上传用户：ecooo
