Description: LVQ学习矢量化算法源程序
This directory contains code implementing the Learning vector quantization
network. Source code may be found in LVQ.CPP. Sample training data is found
in LVQ1.PAT. Sample test data is found in LVQTEST1.TST and LVQTEST2.TST. The
LVQ program accepts input consisting of vectors and calculates the LVQ
network weights. If a test set is specified, the winning neuron (class) for
each neuron is identified and the Euclidean distance between the pattern and
each neuron is reported. Output is directed to the screen.-LVQ learning vector algorithm This directory contains source co de implementing the Learning vector quantizat ion network. Source code may be found in LVQ.CPP . Sample training data is found in LVQ1.PAT. Sam ple test data is found in LVQTEST1.TST and LVQTE ST2.TST. The program accepts input LVQ consist ing of vectors and calculates the network we LVQ ights. If a test set is specified, the winning Neurology (class) for each of Neurology is id entified and the Euclidean distance between th e pattern and each of Neurology is reported. Output is directed to the screen. Platform: |
Size: 38398 |
Author:张伟华 |
Hits:
Description: LVQ学习矢量化算法源程序
This directory contains code implementing the Learning vector quantization
network. Source code may be found in LVQ.CPP. Sample training data is found
in LVQ1.PAT. Sample test data is found in LVQTEST1.TST and LVQTEST2.TST. The
LVQ program accepts input consisting of vectors and calculates the LVQ
network weights. If a test set is specified, the winning neuron (class) for
each neuron is identified and the Euclidean distance between the pattern and
each neuron is reported. Output is directed to the screen.-LVQ learning vector algorithm This directory contains source co de implementing the Learning vector quantizat ion network. Source code may be found in LVQ.CPP . Sample training data is found in LVQ1.PAT. Sam ple test data is found in LVQTEST1.TST and LVQTE ST2.TST. The program accepts input LVQ consist ing of vectors and calculates the network we LVQ ights. If a test set is specified, the winning Neurology (class) for each of Neurology is id entified and the Euclidean distance between th e pattern and each of Neurology is reported. Output is directed to the screen. Platform: |
Size: 37888 |
Author:张伟华 |
Hits:
Description: C语言路由距离向量路由算法演示程序，采用TC2.0的图形方式编程模式，主要演示路由算法-C language routing Distance Vector routing algorithm demo program using the graphical TC2.0 programming model, the main demonstration of routing algorithm Platform: |
Size: 43008 |
Author:刘军 |
Hits:
Description: 利用距离向量算法更新路由表。
该程序的多个实例（进程或线程）可以以运行在一台机器
一个实例代表一个路由器(结点)。
实例之间利用UDP交换路由表。
能够打印出邻居列表和输出路由表！(c语言实现)-The use of distance vector algorithm to update the routing table. Multiple instances of the program (process or thread) can be run on a machine on behalf of an example of a router (node). Examples of exchange between the use of UDP routing table. Be able to print out a list of neighbors and output routing table! (c language) Platform: |
Size: 31744 |
Author:冷冰 |
Hits:
Description: 8数码问题的Java求解，采用A*算法。数据结构采用的Vector<int[]>。输出为"no solution"或一系列表示求解过程的字符串。
某些30步的测试样例需要半分钟左右，但是绝对是正确解~~万望您能不吝点滴时间耐心等待……orz thnx~~
我用的启发函数计算了现在的网格距离目标网格还有多远。
具体算法是，将每一格中的数字的坐标与其应该在的坐标的差加到一起，得到这个最终值h(x)
也就是Manhattan_Distance
源码使用方法：建立Java Project后，分别建立三个同名的.java文件，将源码分别复制过去然后编译运行即可。-a source code that solves the 8 puzzle problem. it uses A-star algorithm, and a major data structure of Vector<int[]>. The output of the program would be "no solution" or a series of strings representing the moves during the solution.
Well, some samples need to be proceeded for around 30 seconds, but the program per se is indeed correct and will ultimately generate the shortest solution. so if u encounter such occasion plz jst wait for a while tho~~~ thnx~!!
the heuristic function, say h(x), in this source code is the sum of the Mahattan Distance of each block from its destination block.
How to use: build a Java Project, and create three .java files with the same names in the .zip file accordingly, and copy the source from the .zip file and just compile and run~~!
have fun thnx~! Platform: |
Size: 669696 |
Author:Siegfried |
Hits:
Description: 三维绘图程序.这是一个项目时使用到的"三维空间向量/点"类及相关函数,使用它们可以定义一个空间向量/点,实现向量的平移,缩放和旋转等,使用相关函数还可以实现两向量的叉乘,得到一个向量的绝对长度,将一个向量单位化,得到一个三点决定的平面的垂直向量(经过单位化),得到空间中两点的距离,得到两向量的点积,得到两向量的夹角等操作,为方便用户的使用,每个函数都有详细的注释,希望对大家有所用处.-Three-dimensional drawing program. This is a project to use to the " three-dimensional space vector/point" category and related functions, use them to define a space vector/point to achieve the translation vector, scaling and rotation, etc. can also be achieved using the correlation function 2 vector cross multiplication, to get a vector of the absolute length of a vector unit received a three-point decision to the vertical plane of the vector (after unit-based), get the distance between two points in space, to be two vector dot product, to be the angle between two vectors such operations, the use of user-friendly, each function has a detailed comment, hope you all have a use. Platform: |
Size: 7286784 |
Author:318 |
Hits:
Description: gvf snake 邊緣檢測範例(包含範例圖)-1. Introduction and Installation Instructions
----------------------------------------------
Welcome to the Gradient Vector Flow (GVF) Active Contour Toolbox. The
Matlab*.m files in this software distribution implement our GVF snake,
the original (Kass, Witkin, and Terzopoulos) snake, the balloon snake,
and the distance snake. These programs were designed, written and tested
by Chenyang Xu and Jerry Prince.
To install this software, simply unzip the file into an empty directory,
making sure to ask your unzipper program to restore the directory
structure of the zipped files. In this documentation, we will assume
that you have unzipped the files into C:\GVF.
2. Documentation
----------------
We have included two research papers that describe GVF. You can find
these in C:\GVF\papers.
Brief descriptions of the software modules can be found in this file
below. For more detail, you should run Matlab, add the path
C:\GVF\snake, and type "help function-name". F Platform: |
Size: 1561600 |
Author:Jason Wang |
Hits:
Description: 该程序实现了计算机网络的距离矢量算法的模拟，还可动态改变节点间的距离-The program realization of a computer network simulation of the distance vector algorithm, but also dynamically change the distance between nodes Platform: |
Size: 2243584 |
Author:zsc |
Hits:
Description: 这个程序实现网络层距离向量算法和udp协议，使用socket编程，可以在linux上运行。内含Makefile、可执行文件、源代码、README。-This program network layer distance vector algorithm and udp protocols, the use of socket programming, you can run on linux. Contains Makefile, executable files, source code, README. Platform: |
Size: 9216 |
Author:jack shaw |
Hits:
Description: 目标和雷达的仿真程序，可以设置目标位置向量、速度、目标散射截面积、距离门限等等，计入高斯噪声，经过混频和傅里叶变化后再显示其距离和多普勒二维图形。-Target and radar simulation program can be set to the target position vector, velocity, target scattering cross-sectional area, the distance threshold, etc., included in the Gaussian noise, and then after mixing and Fourier transform show its range and Doppler two-dimensionalgraphics. Platform: |
Size: 3072 |
Author:周严 |
Hits:
Description: 这是一个模仿路由算法的java程序。
实现关于路由器的简单功能。
实现距离矢量路由算法。
所实现的路由器模拟Internet上的IP路由器。它能确定网络的最短路由，并在这些利用上传输分组
实现功能简介
1) 编写一个称为“Router”的程序
2) 利用距离向量算法更新路由表
3) 该程序的多个实例（进程或线程）可以以运行在一台机器
4) 实例之间利用UDP交换路由表
5) 假设结点与其邻居结点的都为距离为1。
6) 为了指明实例及其邻居，程序启动时必须能接收以下参数：
7) router ID, myport, port1, port2, port3…
8) 程序必须能处理以下命令：
a) N－打印活动的邻居列表。
b) T－输出路由表。
c) 0，1，… 9－发送分组
9) 关于时间定时
a) 每个路由器每2秒钟发出它们的路由表
b) 每个路由器根据收到的路由表更新它们自己的路由表
c) 路由器必须具备检测邻居是否活动的能力。如果路由器在6秒钟没有收到邻居发来的更新，则认为邻居不可达
10) 关于拓扑结构
a) 路由器必须具备路由器故障和恢复的能力
b) 这里假设链路不会出现故障，分组不会丢失和出错
c) 如果路由器在给定时间内未运行，表示路由器故障。如果重启运行，则认为路由器故障恢复
d)当然，假设通信是双向的
-This is a parody routing algorithm java program.
Achieve a simple function on the router.
Implement distance vector routing algorithm.
Internet router simulation achieved the IP router. It can determine the shortest route network, and in these transmission packet utilization
Achieve Features
A) preparation of a group called "Router" program
2) the use of distance vector algorithm updates the routing table
3) multiple instances of the program (processes or threads) can be run on a single machine
4) between instances using UDP exchange routing table
5) Assuming that node and its neighbor nodes are distance of 1.
6) In order to specify the instance and its neighbors, the program must be able to start receiving the following parameters:
7) router ID, myport, port1, port2, port3 ...
8) program must be able to deal with the following command:
a) N-printing activities neighbor list.
b) T-output routing table.
c) 0,1, ... 9- to send the packet
9) About Time Timing
a) given eve Platform: |
Size: 73728 |
Author:张天扬 |
Hits:
Description: 距离矢量路由算法sp2的c语言实现，用VC++做的一个模拟程序，供学习交流。-Distance Vector routing algorithm sp2 c language, using VC++ to do a simulation program for learning exchanges. Platform: |
Size: 262144 |
Author:李力 |
Hits:
Search - distance vector program