Location:
Search - no neighbor
Search list
Description: 八邻域均值算法与中值算法的比较，加高斯噪声滤波进行比较-Eight-neighbor algorithm with the mean value of the comparison algorithm, plus Gaussian noise filter comparison
Platform: |
Size: 29696 |
Author: Vincent |
Hits:
Description: 核子空间样本选择方法的核最近邻凸包分类器，不需要账号就可以下载-Nuclear space sample selection methods nuclear convex hull nearest neighbor classifier, no account can download
Platform: |
Size: 275456 |
Author: majian |
Hits:
Description: 模拟哲学家进餐的同步问题，实现一个既没有两邻座同时吃饭，又没有人饿死（永远拿不到一双筷子）的算法-Simulation of synchronous dining philosophers problem, the realization of a neighbor at the same time do not have two meals, and no one starved to death (never get a pair of chopsticks) algorithm
Platform: |
Size: 1010688 |
Author: 梁先生 |
Hits:
Description: 移植uip-1.0到Atmega32
1）把 uip-1.0 的所有文件加入到工程，包括 uip 目录的文件（除uip-split.c）、unix 目录的文件、lib 目录的文件；
2）修改 uip/uip-neighbor.c 文件的
void uip_neighbor_add(uip_ipaddr_t ipaddr, struct uip_neighbor_addr *addr)
函数，一般注释掉 printf 语句即可，或者改为你自己的串口格式化打印实现。
3）uip 目录里的源文件除 uipopt.h 外一般都无需修改；uipopt.h 包含了 uip-conf.h ，所以大部分修改可以在
uip-conf.h 里进行。
uip-conf.h 里加入如下定义，可以减少编译的警告：
#define notdef 0
#define UIP_CONF_IPV6 0
#define UIP_ARCH_ADD32 0
#define UIP_ARCH_CHKSUM 0
#define UIP_NEIGHBOR_CONF_ADDRTYPE 0
4）移植工作主要是 定时器中断程序 与 网络驱动 的编写-1) to the uip-1.0 added to the works of all documents, including documents uip directory (except uip-split.c), unix file directories, lib directories of documents
2) Revise the uip/uip-neighbor.c documents
void uip_neighbor_add (uip_ipaddr_t ipaddr, struct uip_neighbor_addr* addr)
Function printf statements generally can be commented out or changed to your own print serial format to achieve.
3) uip the source file directory in addition to uipopt.h generally no need to change things uipopt.h contains uip-conf.h, most modifications can be
uip-conf.h conducted.
uip-conf.h to add the following definition, can reduce the compiler warning:
# define notdef 0
# define UIP_CONF_IPV6 0
# define UIP_ARCH_ADD32 0
# define UIP_ARCH_CHKSUM 0
# define UIP_NEIGHBOR_CONF_ADDRTYPE 0
4) transplantation is a timer interrupt work process with the preparation of a network drive
Platform: |
Size: 420864 |
Author: yuangaoping |
Hits:
Description: Intranet chat tool, just run and see your neighbor, no need login
Platform: |
Size: 429056 |
Author: Tim |
Hits:
Description: 使用二分法对样本集进行剪辑，剪辑法的思想，就是将样本集分成训练集与考试集， 利用训练集样本对考试集的样本进行分类（使用近邻法），如果考试集中某个样本分类错误的话，将这个样本删除。在该函数中，使用最近邻法，只进行一次剪辑（遍历完考试集中的样本以后退出）。还有一种重复剪辑法（适用于样本比较多的情况），把样本随机分为多个样本集，将相邻的两个样本前一个作为考试集，后一个作为训练集，调用二分剪辑。所有的样本子集剪辑完毕以后，在递归调用，直到没有样本被剪辑掉,没得讲，重复剪辑的效果肯定好一些。
-The sample sets using the dichotomy of the clips, editing law idea is to sample set into training set and test set, using the training set samples to the test set of samples (using the nearest neighbor algorithm), if the examination focused on a sample of classification error then delete this sample. In the function, use the nearest neighbor method, only once clips (focused on a sample of traversal finished after the exit exam). There is also a repeat clip method (samples are more applicable to the case), the samples were randomly divided into multiple sample set, the two adjacent samples of the former one as a test set, the latter one as a training set, call the two sub-clips. All the samples were a subset of the clips after they have finished, in the recursive call, until there are no samples were clip out, did not have to say that the effect of repeated clips definitely better.
Platform: |
Size: 1024 |
Author: shihao |
Hits:
Description: 1、 对地址为X的相邻的路由器发来的RIP报文，先修改此报文中的所有项目；把“下一跳”字段中地址都改为X，并把所有距离都加1。
2、 对修改后的报文的每一个项目，进行以下步骤：若原路由器没有该目的网络，就直接加在路由表中；不然，再看下一跳路由器地址，若是X，则用收到的项目替换原来的；若下一跳地址不同，，收到的项目的距离小于原来的距离，则替换，否则什么都不用做。
3、 若3分钟没有收到相邻路由器的更新路由表，则把此相邻路由器记为不可达的路由器，即把距离设为16
4、 返回
-In 1, the address for the X neighbor routers send RIP message, to modify this message in all project " the next hop address" field is changed to X, and put all distances are plus 1.
2, on the modified message to every project, the following steps: if the router is not the destination network, just add in the routing table otherwise, go on to the next hop router address, if X, using the received the item to replace the original if the next-hop address different,, received project a distance less than the original distance, it is replaced, or do nothing.
3, if 3 minutes received no neighboring routers to update the routing table, while the adjacent router recorded as unreachable router, namely the distance was set to 16
4, return
Platform: |
Size: 1024 |
Author: 独家记忆 |
Hits:
Description: 未知节点可能因为没有邻居锚节点而无法定位，使用matlab进行仿真开发的定位代码-Nodes may be unknown because no neighbor anchor node can not locate matlab simulation development positioning code
Platform: |
Size: 9145344 |
Author: wuenln |
Hits:
Description: WSN 质心定位算法 Centorid Algorithm
加经典参考文献
A: 如果接受节点接收到的包数目与发送节点发送的包数目的比值大于CM_threshold,则这两个节点视为邻居节点
未知节点利用邻居锚节点进行定位，没有邻居锚节点的未知节点无法定位。
B:
如果接受节点接收到的包数目与发送节点发送的包数目的比值大于CM_threshold,则这两个节点视为邻居节点
未知节点一旦被定位就充当起锚节点的功能，向周围邻居发送自己的估计坐标信息
未知节点把已经定位的未知节点与锚节点同等对待
C:
如果接受节点接收到的包数目与发送节点发送的包数目的比值大于CM_threshold,则这两个节点视为邻居节点
有邻居锚节点的未知节点只利用邻居锚节点进行定位，没有邻居锚节点的未知节点才利用已经定位了的邻居未知节点进行定位。-WSN centroid localization algorithm Centorid Algorithm
A: If you accept the received packet node number and the number of packets sent by the sending node ratio greater than CM_threshold, then these two nodes as neighbors
Unknown node using the neighbor anchor nodes to locate, no neighbors anchor nodes and unknown nodes can not be located.
B:
If you accept the received packet node number and the number of packets sent by the sending node ratio greater than CM_threshold, then these two nodes as neighbors
Unknown nodes are positioned on as soon as the function of anchor nodes to send their neighbors estimated coordinate information
Unknown unknown node to node already positioned anchor nodes treated equally
C:
If you accept the received packet node number and the number of packets sent by the sending node ratio greater than CM_threshold, then these two nodes as neighbors
Of the unknown neighbor anchor node the neighbor nodes are only positioned anchor nodes,
Platform: |
Size: 438272 |
Author: liangzhongfa |
Hits:
Description: 游戏规则如下：1. 给定单元的邻居是与它在垂直，水平或对角上相界的8个单元。2. 如果1个单元为活的，但没有邻居单元是活的，或者仅有一个邻居单元是活的，则在下一代，此单元
会因为孤独而死亡。
3. 如果1个单元周围有2个或者3个邻居单元为生，则该单元在下一代也是活的。4. 如果1个单元是死的，则在下一代，如果它刚好有3个邻居单元是活的，则此单元变成活的。
所有其它死的单元在下一代仍然是死的。
-Rules of the game are as follows: (1) a given cell and its neighbors are in a vertical, horizontal or diagonal photogenic sector 8 units. 2 If a cell is alive, but no neighbor cell is alive, or just a neighbor cell is alive, then in the next generation, this unit
Because of loneliness and death.
3 If there are two or three neighbors living units surrounding a unit, the unit is also alive in the next generation. 4 If a cell is dead, then in the next generation, if it happens to have three neighboring cells are alive, this unit becomes alive.
Rules of the game are as follows: (1) a given cell and its neighbors are in a vertical, horizontal or diagonal photogenic sector 8 units. 2 If a cell is alive, but no neighbor cell is alive, or just a neighbor cell is alive, then in the next generation, this unit
Because of loneliness and death.
3 If there are two or three neighbor
Platform: |
Size: 1024 |
Author: 李的根 |
Hits:
Description: 灵感来源于《选择你的冒险历程》系列图书，本代码采用《吸血鬼邻居》的故事情节，在读完一段文字后，用数字选择你下一步的方向，这样故事的情节会在你自己的掌控下进行。还是没有gui，偶尔玩玩也是很有意思的，当时花了很长时间处理数据。-Inspired by choose your adventure series of books, this code is the use of vampire neighbor, the story, after reading a text, choose your next digital direction, so that the story line will be under your own control get on. Still no gui, occasionally play is also very interesting, then took a long time to process data.
Platform: |
Size: 21504 |
Author: zjuuuu |
Hits:
Description: Computation and routing in Mobile Ad hoc
Network (MANET) is strongly co-related with power
resource. Recent trend is to minimize the power
consumption and maximize the computation without
hampering the quality of service in MANET. To increase
durability, battery resource of a node that has more power
than its neighbor nodes could be used for routing and
computation. In this paper a power aware routing scheme
based on AODV protocol is pr
esented. The protocol focuses
on increasing network lifetime by taking into
account
residual capacity of the nodes wi
th respect to its neighbors,
its internal load as well as
no. of message transfers. The
protocol finds durable routes having nodes with more
residual energ
Platform: |
Size: 477184 |
Author: NIRDESH |
Hits:
Description: 基于matlab GUI界面设计,算法优化非常好，几乎没有循环，包括最小二乘法、SVM、神经网络、1_k近邻法。- Based on matlab GUI interface design, Algorithm optimization is very good, almost no circulation, Including the least squares method, the SVM, neural networks, 1 _k neighbor method.
Platform: |
Size: 5120 |
Author: hiesaisun |
Hits:
Description: 脉冲响应的相关分析算法并检验，包括最小二乘法、SVM、神经网络、1_k近邻法,算法优化非常好，几乎没有循环。- Related impulse response analysis algorithm and inspection, Including the least squares method, the SVM, neural networks, 1 _k neighbor method, Algorithm optimization is very good, almost no circulation.
Platform: |
Size: 6144 |
Author: 赵凡安 |
Hits:
Description: 汽车课设货车Matlab驱动力图程序，算法优化非常好，几乎没有循环，包括最小二乘法、SVM、神经网络、1_k近邻法。- Car class-based truck driver trying to Matlab program, Algorithm optimization is very good, almost no circulation, Including the least squares method, the SVM, neural networks, 1 _k neighbor method.
Platform: |
Size: 18432 |
Author: 丁雄国 |
Hits:
Description: 为了降低算法的时间复杂度，Vincent Blondel等人提出了另一种层次性贪心算法（BGLL算法）。该算法包括两个阶段，这两个阶段重复迭代运行，直到网络社区划分的模块度不再增长。第一阶段合并社区，算法将每个节点当作一个社区，基于模块度增量最大化标准决定哪些邻居社区应该被合并。经过一轮扫描后开始第二阶段，算法将第一阶段发现的所有的社区重新看作节点，构建新的网络，在新的网络上迭代的进行第一阶段。当模块度不再增长时，得到网络的社区近似最优划分。
算法的基本步骤如下：
1）.初始化，将每个节点划分在不同的社区中。
2）.逐一选择各个节点，根据公式计算将它划分到它的邻居社区中得到的模块度增益。如果最大增益大于0，则将它划分到对应的邻居社区；否则，保持归属于原社区。
3）.重复步骤2，直到节点的社区不再发生变化。
4）.构建新图。新图中的点代表上一阶段产生的不同社区，边的权重为两个社区中所有节点对的边权重之和。重复步骤2，直到获得最大的模块度值。(In order to reduce the time complexity of the algorithm, Vincent Blondel et al. Proposed another hierarchical greedy algorithm (BGLL algorithm). The algorithm consists of two phases, which are repeated iteratively until the network community is divided by no longer growing. The first phase merges the community, and the algorithm treats each node as a community, based on the modularity maximization criteria, which neighbor communities should be merged. After the second phase of the scan, the algorithm will re-see all the communities found in the first stage as nodes, build new networks, and carry out the first phase on the new network. When the degree of the module is no longer increased, the optimal neighborhood of the community is obtained.)
Platform: |
Size: 33792 |
Author: qljiang0203
|
Hits:
Description: 规则：
% (1)正在燃烧的树变成空格位；
% (2)如果绿树格位的最近邻居中有一个树在燃烧，则它变成正在燃烧的树；
% (3)在空格位，树以概率p生长；
% (4)在最近的邻居中没有正在燃烧的树的情况下树在每一时步以概率f(闪
% 电)变为正在燃烧的树。
% 参考文献:
% 祝玉学，赵学龙译，<<物理系统的元胞自动机模拟>>, p23(Rule:
% (1) the burning trees turn into spaces;
% (2) if the nearest neighbor sites in the trees have a tree in the burning, it becomes a burning tree;
% (3) in spaces, and trees grow in probability p;
% (4) in the nearest neighbor, there is no burning tree in the case of the tree at each step, with probability f (flashing)
% electricity) into a burning tree.
% references:
% Zhu Yuxue, translated by Zhao Xuelong, the "physical simulation system of cellular automaton, p23)
Platform: |
Size: 1024 |
Author: 马铃薯的
|
Hits:
Description: 分别采用有边缘和无边缘两类图像作为样本库，使用用Hu不变矩对图像进行特征提取，并使用K近邻分类法进行分类和识别。(Two types of images with edges and no edges are used as the sample library, the images are extracted using Hu invariant moments, and the images are classified and identified by K nearest neighbor classification.)
Platform: |
Size: 2048 |
Author: 陆荏嘉
|
Hits: