登录
首页 » 电子书 » Cisco E

Cisco E

于 2023-03-11 发布 文件大小:130.58 kB
0 184
下载积分: 2 下载次数: 1

代码说明:

Cisco E-DI supports perl scripting through the CLI. This feature automates many of the server and network administration tasks. This section explains how to enable and disable the perl scripting service, and how to use Cisco E-DI Perl API for daily tasks. When a perl script is implemented by an administrator or a user, the script automatically inherits the user s security privileges and the user s operational context (either server or network). Each invocation of a

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 介绍Qt4设计
    Introduce qt4 design
    2023-01-24 01:30:04下载
    积分:1
  • 一本C++的英汉对照版的,感觉不错,与大家分享
    一本C++的英汉对照版的书,感觉不错,与大家分享-1 C++ English-Chinese version of the book, I feel good, to share with you
    2022-03-20 09:49:19下载
    积分:1
  • 00ic开发板(s3c44b0x)的rtc测试源代码
    00ic开发板(s3c44b0x)的rtc测试源代码-00ic development board (s3c44b0x) the rtc test source code
    2022-06-28 10:09:57下载
    积分:1
  • Linux系统管理员手册,学习linux系统的重要参考手册
    Linux系统管理员手册,学习linux系统的重要参考手册-Linux system administrator manual, learning the importance of Linux reference manual
    2022-03-09 17:06:29下载
    积分:1
  • 图论中最小生成树Kruskal算法 及画图程序 M
    图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W):n为图顶点数,W为图的带权邻接矩阵,不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]
    2022-01-30 21:32:39下载
    积分:1
  • 路分析答案,很齐全的哦,供考研的同学用,真的不错
    电路分析答案,很齐全的哦,供考研的同学用,真的不错-answer
    2022-01-26 16:29:49下载
    积分:1
  • 一个简单的ASP留言板
    一个简单的ASP留言板-a simple message board ASP
    2022-06-27 02:54:38下载
    积分:1
  • 讲解一些算法的研究,动态规划,回溯,分支限界等。
    讲解一些算法的研究,动态规划,回溯,分支限界等。-Who explained some algorithm, dynamic programming, backtracking, branch and bound and so on.
    2022-07-19 08:57:17下载
    积分:1
  • J2EE学习笔记_中文学习J2EE的
    j2ee学习笔记_中文 J2ee学习宝典-j2ee study notes _ Chinese J2ee book learning
    2022-05-17 00:37:35下载
    积分:1
  • useful information on the IC card
    很有用的IC卡资料-useful information on the IC card
    2022-06-14 15:02:34下载
    积分:1
  • 696516资源总数
  • 106459会员总数
  • 0今日下载