Search - topology

Search - topology - List

【Other resource】 99LINESTOPOLOGYOPTIMIZATION DL : 0: 一个牛人写的99行的优化程序的文章 A 99 LINE TOPOLOGY OPTIMIZATION CODE BY OLE SIGMUND-a cattle written by the 99 articles optimization program LINE A 99 TOPOLOGY OPTI MIZATION CODE BY OLE SIGMUND
Update : 2008-10-13 Size : 129953 Publisher : 栖木
【Communication】 OMNeT++ DL : 1: wsn（无线传感器网络）仿真源码简单拓扑发现算法利用OMNET++实现的-wsn (wireless sensor networks) simulation FOSS simple topology discovery algorithm to achieve the OMNET
Update : 2008-10-13 Size : 75262 Publisher : 尹浩
【Other resource】 waxtop DL : 0: WAXTOP Simulate and plot a random network topology by the method-WAXTOP Simulate and plot a random network t opology by the method
Update : 2008-10-13 Size : 1579 Publisher : luona
【Other resource】 Net-Map DL : 0: 此原代码是用VC++6.0编译实现基于SNMP的网络拓扑查看的参考代码,编译可通过,只可做为参考哦-this is the original code with VC 6.0 compiler based SNMP network topology View reference code, compiler can only be used as reference oh
Update : 2008-10-13 Size : 136081 Publisher : tianshi
【Mathimatics-Numerical algorithms】 PSO_PROGRAM DL : 0: 拓扑结构-topology
Update : 2008-10-13 Size : 20487 Publisher : chuchu
【Other】 200512620049279 DL : 0: 描述了三色算法的形成过程,及拓扑形成后系统可能出现的状况介绍了簇的维护.还有部分源代码.-description of the three color algorithm formation process, After the formation of topology and system possible situation on the cluster of maintenance. Some of the source code.
Update : 2008-10-13 Size : 210539 Publisher : 郝英英
【Special Effects】 acontour DL : 0: This toolbox provides some functions for manipulating planar, closed splines to implement image or video segmentation by means of deformable (or active) contours. Contour topology is managed in a way that should allow changes similar to what can be observed with level sets (merging and splitting but no hole creation). Several objects can be segmented simultaneously in several frames. -This toolbox provides some functions for m anipulating planar. closed spline to implement image or video segm entation by means of deformable (or active) con tours. Contour topology is managed in a way that should allow changes similar to what can be obse rved with level sets (merging and splitting but no hole creation). Several objects can be segme nted simultaneously in several frames.
Update : 2008-10-13 Size : 163346 Publisher : zhuboy
【Other】 SimTopDic DL : 0: 拓扑查找算法的omnet仿真实现，内附文档。-topology search algorithm omnet Simulation, enclosing document.
Update : 2008-10-13 Size : 777990 Publisher : 吕磊
【CSharp】 xiaoliang1tuopu DL : 0: t拓扑排序输入顶点数边数..... 进行拓扑排序-not topological sorting input vertices edge topology ranking
Update : 2008-10-13 Size : 1753 Publisher : 湖可
【OS program】 BRITE_CPP.tar DL : 0: 网络拓扑生成代码,是从http://www.cs.bu.edu/brite/download.html下载的，可以参考一下 brite c -network topology generated code from http : / / www.cs.bu.edu / brite / download.html downloaded, can reference brite c
Update : 2008-10-13 Size : 245050 Publisher : haojunrui
【Special Effects】 code_multiphase DL : 0: This toolbox provides some functions for manipulating planar, closed splines to implement image or video segmentation by means of deformable (or active) contours. Contour topology is managed in a way that should allow changes similar to what can be observed with level sets (merging and splitting but no hole creation). Several objects can be segmented simultaneously in several frames.
Update : 2008-10-13 Size : 73512 Publisher : yangcc
【Software Engineering】 A.spur-free.fractional-N.pll DL : 1: A new PLL topology and a new simplified linear model are presented. The new fractional-N synthesizer presents no reference spurs and lowers the overall phase noise, thanks to the presence of a SampleJHold block. With a new simulation methodology it is possible to perform very accurate simulations, whose results match closely those obtained with the linear PLL model developed.
Update : 2008-10-13 Size : 236523 Publisher : 谢振
【Other resource】 1 DL : 0: 2005 Wiley)Topology Control in Wireless Ad-Hoc and Sensor Networks.pdf
Update : 2008-10-13 Size : 1498088 Publisher : 孙韵
【Software Engineering】 DSPSolutionsforBLDCMotors DL : 0: 这篇英文论文主要介绍了基于TI公司TMS320C24x的直流无刷电机控制。A complete solution proposal is presented below: control structures, power hardware topology, shaft position sensors, control hardware and remarks on energy conversion efficiency can be found in this document.
Update : 2008-10-13 Size : 57352 Publisher : lff
【ActiveX/DCOM/ATL】 TopologyDiscoveryforLarge DL : 0: We propose an efficient algorithm not only to find available computers/hosts but also to find appropriate timeouts and delays in the network. The experimental results validate our approach, demonstrating that our algorithm discovers accurate physical topology.
Update : 2008-10-13 Size : 183495 Publisher : show
【WEB Code】 php-weathermap-0.95b DL : 0: Network Weathermap4RRD is a php or perl script that generates picture network links utilization. Data used to create graph are acquired from RRDTool databases or MRTG HTML files and are displayed as two ways colored arrows on a map representing the logical topology of the network.
Update : 2008-10-13 Size : 2789220 Publisher : dontcry2008
【Other resource】关键路径 DL : 0: (1)输入E条弧<j,k>,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1<=i<=n-1).如果得到的拓朴有序序列中顶点个数小于网中顶点数n,则说明网中存在环,不能求关键路径,算法终止否则执行步骤(3)(3)从汇点v出发,令vl[n-1]=ve[n-1],按逆拓朴排序求其余各顶点的最迟发生时间vl[i](n-2>=i>=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE - network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time of l (s). If any meet the conditions of the arc e (s) = l (s), was critical activities.
Update : 2008-10-13 Size : 1972 Publisher : 叶兆源
【Other resource】自组织系统Kohonen网络模型源程序 DL : 0: 自组织系统Kohonen网络模型。对于Kohonen神经网络，竞争是这样进行的：对于“赢”的那个神经元c，在其周围Nc的区域内神经元在不同程度上得到兴奋，而在Nc以外的神经元都被抑制。网络的学习过程就是网络的连接权根据训练样本进行自适应、自组织的过程，经过一定次数的训练以后，网络能够把拓扑意义下相似的输入样本映射到相近的输出节点上。网络能够实现从输入到输出的非线性降维映射结构：它是受视网膜皮层的生物功能的启发而提出的。~..~-Kohonen network model. For Kohonen neural network, competition is this : For the "winner" of neurons c, in its switching around the region neurons in varying degrees, to be excited, and the switching outside the neurons were inhibited. Network learning is a process in the network connecting the right under the training samples for adaptive, self-organizing process, after a certain number of training, network topology can sense similar to the mapping of the input samples similar to the output nodes. Network can be achieved from input to output of nonlinear reduced-dimensional mapping structure : it is subject to retinal cortex of the biological function inspired by. ~ ~ ..
Update : 2008-10-13 Size : 34625 Publisher : 张洁
【GUI Develop】 toposort DL : 0: 求一个有向图的拓扑序列，输出拓扑序列的顶点。-to seek a topological map of sequence, the sequence of output topology vertex.
Update : 2008-10-13 Size : 31437 Publisher : gaoyan
【Documents】图像向量化相关文献 DL : 0: Patch-based image vectorization with automatic curvilinear, Automatic and topology-preserving gradient mesh generation for image vetorization, Diffusion curves: a vector representation for smooth-shaded images.
Update : 2011-04-07 Size : 24894002 Publisher : jiaojiaobinxx

« 1 2 ... 7 8 9 10 11 1213 14 15 16 17 ... 50 »