搜索资源列表
colorgrad
- This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm
failure
- This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm
constraint
- This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm
budget
- This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm
unreliable
- This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm
Improving
- Each arc of a binary-state network has good/bad states. The system reliability, the probability that source s communicates with sink t, can be computed in terms of minimal paths (MPs). An MP is an ordered sequence of arcs from s to t that has no
ahb_system_generator.tar
- An AHB system is made of masters slaves and interconnections. A general approach to include all possible \"muxed\" implementation of multi layered AHB systems and arbitrated AHB ones can be thought as an acyclic graph where every source node is a mas
020064010046FABCD35C2F000006E6E6971F22-C927-FA17-7
- 13th Israeli Symposium of AI, CV, and NN, Tel Aviv University, Tel Aviv, Israel, Feb. 2-4, 1997 D. Dori, D. Hubunk and Liu W, “Improving the Arc Detection
200422517313047453
- 组件式GIS与MapX开发 地理信息系统根据其内容可分为两大基本类型：一是应用型地理信息系统，以某一专业、领域或工作为主要内容，包括专题地理信息系统和区域综合地理信息系统；二是工具型地理信息系统，也就是GIS工具软件包，如ARC/INFO等，具有空间数据输入、存储、处理、分析和输出等GIS基本功能。随着地理信息系统应用领域的扩展，应用型GIS的开发工作日显重要。如何针对不同的应用目标，高效地开发出既合乎需要又具有方便美观丰富的界面形式的地理信息系统，是GIS开发者非常关心的问题。
ColorDisc
- 使用绘制圆弧的方法，输出一个统计图表“圆饼图”和一个“折扇”。 原始数据在数组Data中，这5个数据在圆饼图中为角度不同的扇形，各自角度的计算值分别为38、91、54、125、53，放在数组drgree中。第一个数据的扇形起始角start=0，用绿色画。第二个的起始角start=38，用蓝色画。最后一个的起始角start=308，用橙色画。 折扇的画法是：在左上角坐标（130，40），长150，宽80的椭圆区域内，从22度开始逆时针地画一个15度的扇性，再画一段15度的椭圆弧；然后交替地画扇形和
ARC
- 交叉耦合控制(cross-coupling control)對誤差的影響
ARC
- 逐点圆弧插补编程 用于数控中的 可实现在某一象限的圆弧插补
ttt
- 本人载网站开发gis,游自编的最短路径查询程序，速度特快，3万节点，35000条路全部遍历，只需1秒。现将最短路径的思路告诉大家，希望大家在优化，并用不同语言编制，我正在学delphi,准备用delphi做成库，本例以由拓扑关系的arc/info 文件为数据源。其中a1,b1,c1是以fnode排序生成的数组，a1对应fnode,b1对应tnode,c1对应length,同样a2,b2,c2,是以tnode 生成的数组。Indexa1是对应某一起点与其相连的终点的个数，indexb1时对应某一终
ARC_E00
- ESRI公司的ARC E00交换格式参考
mxd
- Arc GIS的文档文件*.mxd对外格式是不公开的，里面保存有当前各图层名称、符号、颜色、线性、字体等属性特征，通过ULTRAEDIT读取其二进制格式，编程实现获取点、线、面图层名称、存放路径，mxd文件图层个数等相关信息的读写功能
ArcGisEngine
- 一个小实例，用VB+ARC Engine 开发的。里面讲述了每一个细节，包括引用。
LBarc
- 1.用圆生成的B算法编程实现圆弧的绘制 2、圆弧的起始角、终止角及半径用交互方式输入 3、画弧程序的接口为 void Arc(float θ1, float θ2, float R) 4、程序检测的例子至少四组，须分别跨过四坐标轴
dephishortpath
- 利用arc/info数据和delphi实现最短路径分析
1c35
- 生成任意圆弧-generate arbitrary arc
直线、圆弧、椭圆弧生成
- 图形学的一个作业，通过对话框画直线、圆弧、椭圆弧-graphics of an operation, through dialog painting line, arc, ellipse