- portscan 一个简单的端口扫描程序: addstr = \"发现端口\" & Str(port) & \"打开\" & Space(5) Select Case port Case 7 plus = \"ECHO服务\" Case 21 plus = \"FTP服务★★★★★\" Case 25 plus = \"SMTP服务★★\" Case 43 plus = \"Whois服务\" Case 53 plus = \"DNS服务☆\" Case 80 plus = \"HTTP服务★★★★★\" Case 81 plus = \"HOSTS2名称服务\" Case 99 plus = \"NCX99后门★★★★★\" Case 110 plus = \"POP3服务★★★★★\" Case 111 plus = \"Sun RPC服务★★\" Case 135 plus = \"本地服务\" Case 137 plus = \"NETBIOS 名称服务/流影POP\" Case 138 plus = \"NETBIOS 数据存储服务\" Case 139 plus = \"NETBIOS 会议服务★★★\" Case 119 plus = \"NNTP虚拟服务\" Case 163 plus = \"SNMP服务\" Case 443 plus = \"https服务\" Case 512 plus = \"远程执行服务\" Case 513 plus = \"login
- thinning.cpp 一个对字符图像进行细化的算法
- fem2d_heat_50line 一个50行的Matlab有限元程序(二维传热问题)
- 00-Latihan-Delphi VCD for Rent Source Code of Delphi
- PS2_mouse 鼠标的驱动源代码 可以用于ps2的鼠标
- HDLC-protocol-RS485 Paper: in HDLC protocol RS485 bus controller of the FPGA implementation
文件名称:NPE
-
所属分类:
- 标签属性:
- 上传时间:2012-11-03
-
文件大小:2.3kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
本代码实现基于成对约束的半监督图嵌入算法-Following the intuition that the image variation of
faces can be effectively modeled by low dimensional
linear spaces, we propose a novel linear subspace
learning method for face analysis in the framework of
graph embedding model, called Semi-supervised
Graph Embedding (SGE). This algorithm builds an
adjacency graph which can best respect the geometry
structure inferred from the must-link pairwise
constraints, which specify a pair of instances belong to
the same class. The projections are obtained by
preserving such a graph structure. Using the notion of
graph Laplacian, SGE has a closed solution of an
eigen-problem of some specific Laplacian matrix and
therefore it is quite efficient. Experimental results on
Yale standard face database demonstrate the
effectiveness of our proposed algorithm.
faces can be effectively modeled by low dimensional
linear spaces, we propose a novel linear subspace
learning method for face analysis in the framework of
graph embedding model, called Semi-supervised
Graph Embedding (SGE). This algorithm builds an
adjacency graph which can best respect the geometry
structure inferred from the must-link pairwise
constraints, which specify a pair of instances belong to
the same class. The projections are obtained by
preserving such a graph structure. Using the notion of
graph Laplacian, SGE has a closed solution of an
eigen-problem of some specific Laplacian matrix and
therefore it is quite efficient. Experimental results on
Yale standard face database demonstrate the
effectiveness of our proposed algorithm.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
NPE.m
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。
