Location:
Search - network density
Search list
Description: 输入信号五个基于瞬时信息的特征：零中心归一化瞬时幅度功率谱密度的最大值,零中心归一化瞬时幅度绝对值的标准偏差，零中心非弱信号段瞬时相位非线性分量绝对值标准偏差，零中心非弱信号段瞬时相位非线性分量标准偏差，零中心归一化的非弱信号段瞬时频率绝对值的标准偏差，得到识别出的信号类别，本例为2PSK, 4PSK, GMSK, OQPSK, pi/4DQSK中的一个，还可以看Art网络的扩展性。-input signal instantaneous information on five characteristics : In the center is one of the instantaneous rate of the power spectral density of the maximum, is a center to the absolute value of the instantaneous rate of the standard deviation, Non-zero weak signal instantaneous phase of the nonlinear component absolute standard deviation, Non-zero weak signal instantaneous phase of the nonlinear component standard deviation, In the center is one of the non-weak signal of the absolute value of the instantaneous frequency standard deviation, the identification of signal type, The cases of two PSK, 4PSK, GMSK, OQPSK, pi/4DQSK of one, Art can be viewed network scalability.
Platform: |
Size: 3521 |
Author: 谢灵心 |
Hits:
Description: 输入信号五个基于瞬时信息的特征：零中心归一化瞬时幅度功率谱密度的最大值,零中心归一化瞬时幅度绝对值的标准偏差，零中心非弱信号段瞬时相位非线性分量绝对值标准偏差，零中心非弱信号段瞬时相位非线性分量标准偏差，零中心归一化的非弱信号段瞬时频率绝对值的标准偏差，得到识别出的信号类别，本例为2PSK, 4PSK, GMSK, OQPSK, pi/4DQSK中的一个，还可以看Art网络的扩展性。-input signal instantaneous information on five characteristics : In the center is one of the instantaneous rate of the power spectral density of the maximum, is a center to the absolute value of the instantaneous rate of the standard deviation, Non-zero weak signal instantaneous phase of the nonlinear component absolute standard deviation, Non-zero weak signal instantaneous phase of the nonlinear component standard deviation, In the center is one of the non-weak signal of the absolute value of the instantaneous frequency standard deviation, the identification of signal type, The cases of two PSK, 4PSK, GMSK, OQPSK, pi/4DQSK of one, Art can be viewed network scalability.
Platform: |
Size: 3072 |
Author: 谢灵心 |
Hits:
Description: 现有的几个网络拓扑随机发生器，其实很难生成理想的网络拓扑结构，其主要原因在于很难控制节点的疏密和间距。我们提出来的这个改进算法，在随机抛撒节点的时候使用了K均值聚类，由本算法作为网络拓扑发生器，网络节点分布均匀且疏密得当，边的分布也比较均衡-The few existing random network topology generator, is in fact very difficult to generate the desired network topology, the main reason it is difficult to control the node density and spacing. We put forward the improved algorithm, throw in random nodes when using the K-means clustering, by the algorithm as a network topology generator, network nodes and spacing evenly distributed properly, the edge of a more balanced distribution of
Platform: |
Size: 2048 |
Author: ben |
Hits:
Description: dv-hop的定位算法，已知网络中几个锚节点就可以计算出网络中其他点的坐标，但这种算法有时由于网络密度的稀疏，可能误差会有一些-dv-hop positioning algorithm, known to the network a few anchor nodes on the network can calculate the coordinates of other points, but this algorithm is sometimes due to the sparse network density may be some errors
Platform: |
Size: 568320 |
Author: zouzou |
Hits:
Description: 本程序是一个网络查询交互的典型程序
程序中用到的方法非常适用于各种类似于网页数据查询的程序实现
只要您掌握了本程序的源码内容,相信对于其他类似的网密度交互查询您已经不会在感到陌生
程序基于VS2005.net,您不需要做任何改动就可以直接编译成可执行文件.
我在程序中对每个部分的源码都做了详细的注释,您只要稍微有一些编程就可以看懂本代码
关于作者:
作者:cc.Dragon
毕业于河北农业大学2003级信息科学与技术学院电子信息科学与技术系0301
主页:http://www.cppblog.com/viskerwong,欢迎您常来坐坐
2009年2月13日
PS:目前程序的迅雷搜索功能暂时失效,原因是迅雷的HTML源码发生变动,您只要重新看一下狗狗搜索的HTML源码就可以让这个功能重新生效,由于本人时间精力有限,所以没有在更新这部分内容,请见谅.-This procedure is a typical cross-network query process
Procedures used in the method is very applicable to a variety of data query page is similar to the procedures realize
As long as you keep track of the source code of the program content, and I believe that other similar interactive network density query you have will not be unfamiliar with
Procedures based on VS2005.net, you do not need to make any changes can be directly compiled into an executable file.
I am in the procedure for each part of the source have to do a detailed explanatory notes, you just have some little programming can understand this code
About the author:
Author: cc.Dragon
Graduated from the Hebei Agricultural University, 2003 College of Information Science and Technology of Electronic Information Science and Technology 0301
Home: http://www.cppblog.com/viskerwong, welcome you to sit often
February 13, 2009
PS: At present, the procedure search function Xunlei temporary failure, the reasons ar
Platform: |
Size: 198656 |
Author: ViskerWong |
Hits:
Description: Performance Comparison of Two On-Demand Routing Protocols Depends on Traffic Density by Using UWB-IR as Pyhisical and MAC Layer at Outdoor Peer to Peer Sensor Network
Platform: |
Size: 1156096 |
Author: murat |
Hits:
Description: 附件中是一些ArcGIS Engine代码的集合,主要是一些比较常见的GIS功能的实现方法,作者用C#+AE都实现了,可能包括基本GIS地图操作,空间分析,几何或交通网络分析等,内容还不错,可以让不太懂的人学习一下,也可以让比较懂的人借鉴一下。
具体成果有:（1）开发了一些常规的GIS基本功能，如放大、缩小、全屏、查询、查找、量测、鹰眼等；（2）开发了一些常用的空间分析功能，如距离计算、密度分析、栅格插值、表面分析、象素统计、数据转换等。（3）网络分析功能，如计算最临近服务设施。（4）几何网络设施分析，如水管和阀门关停、上朔追踪、剖面分析等-Attached is a collection of some ArcGIS, main Engine code is some common method to realize the function of GIS, the authors use c#+ AE is realized, which may include basic GIS spatial analysis, operation, map or network traffic analysis geometry, content is good, can let the person don t understand, also can let the person is to understand the reference.
Specific results are as follows: (1) the development of GIS basic function of some conventional, such as amplifier, narrow, screen, query, search, measurement, and an eagle s eye, etc. (2) developing some common features, such as the space analysis, calculation and analysis of distance, the density of grid interpolation surface analysis, and statistical data, convert, and pixels. (3) network analysis function, such as the most near service facilities. (4) geometric network facilities, such as pipe and analysis on the valve shut, new track, profile analysis, etc
Platform: |
Size: 181248 |
Author: dajiang |
Hits:
Description: Kruskal s algorithm implementation for generating minimum spanning tree.
Random network is generated. Then MST is generated using kruskals and then density gradient applied.
Platform: |
Size: 3072 |
Author: SHASHIKIRAN D |
Hits:
Description: A major issue with ad-hoc networks is energy consumption since nodes
are usually mobile and battery-operated. In this project we compared the
performance of ad-hoc routing protocols in a network where each participating
mobile node has a given battery life and will shut-down when a threshold is
reached. We studied two routing protocols, Dynamic Source Routing (DSR), and
Destination-Sequenced Distance-Vector Routing (DSDV), by comparing the node
termination rate as well as the over-all goodput of the network. From the
simulations we observed that in high node density, DSR performs better than
DSDV. The performance gap can be decreased by smaller number of nodes in the
network or more path loss and shadowing variance.
Platform: |
Size: 44032 |
Author: zipzap |
Hits:
Description: 改进的Salama网络拓扑随机生成算法通用Matlab程序，在随机抛撒节点的时候使用了K均值聚类，网络节点分布均匀且疏密得当，边的分布也比较均衡。-Improved algorithm for randomly generated network topology Salama General Matlab program, when the nodes in the random throw using K means clustering, the network node density distribution and appropriate, a more balanced distribution of the edge.
Platform: |
Size: 5120 |
Author: 成龙 |
Hits:
Description: 利用公 交线路路 口作 为顶 点，简化 了传统算 法对复 杂 网络拓扑 图的计 算；同时，利 用乘客 出行
偏好 ．引入 线 网密度来评 价乘客的 出行 方便程度 ，并提 出了一种最短路 径快速搜 索算法．实验证明 ，与传
统算法相比 ，该算法明显提 高了路径搜 索效率． -Intersection as the peak use of bus lines, simplified the traditional algorithm is the calculation of complex network topology same time, the use of passenger travel preferences. The introduction of line density to evaluate the convenience of passengers, travel, and proposed a shortest path fast search algorithm. Experimental results show that compared with traditional algorithm, the algorithm is efficient for path search efficiency.
Platform: |
Size: 159744 |
Author: 昱程 |
Hits:
Description: 复杂网络研究与建模
总起来说这是一个关于矩阵的运算，用到了c语言里面的东西，实现一个矩阵的逆运算和矩阵的转置等，最终实现的是一个初始节点为4个节点的有向图，随即扩展为一个10000*10000的巨型矩阵，得到该有向图的图形，
与计算机图形学类似，该程序是在构建了一个算法后，用MATLAB实现了一个无标度网络的图形中的各个节点的概率密度，并根据各个节点的概率密度绘出该图
-将中文译成英语
And modeling complex networks
Collectively this is a computation on the matrix, use the stuff inside c language to realize the inverse of a matrix and a matrix, etc., and ultimately is an initial node to four nodes directed graph, then Expands to a huge matrix 10000* 10000, by the digraphs graphics,
And similar computer graphics, the program is built upon an algorithm, using MATLAB to achieve a scale-free network each node in the graph the probability density and probability density according to each node in the graph drawn
Platform: |
Size: 1024 |
Author: ymtian |
Hits:
Description: 在本次实验中，分为「移动节点无线区网」及「固定节点无线区网」两种环境来探讨。我调整MAC协议(共(2种)、路由协议(共2种)、网络拓扑(共5种)、节点数目(共3种)、节点密度(共1种)、传输距离(共1种)，因此固定节点实验的结果有2*2*5*(3)=60种。由于节点密度、传输距离该二项参数之变动与网络拓扑的维持造成很大的冲突，所以对于节点密度的影响，时间上只来得及作线状拓扑上的节点密度分析，其它种拓扑的密度皆不改变。而全部的传输距离只采用250m的设定，传输距离的设定见下文-In this experiment, divided into "mobile node wireless area networks"and the "fixed node in the wireless area network " to discuss the two environments. I adjusted the MAC protocol (a total of (2 species), routing protocols (2 species), the network topology (5 species), the number of nodes (3 species), the node density (total 1 species), distance (total 1 species) Therefore, the experimental results of fixed nodes, 2* 2* 5* (3) = 60. Since the node density, transmission range of the two parameters change in the maintenance of the network topology caused great conflict, so the impact of node density , the time just in time for the linear topology of the node density analysis, neither the density of other types of topology change. and all of the transmission distance of 250m using only the setting, the setting distance below
聆聽以拼音方式閱讀
Platform: |
Size: 2048 |
Author: james |
Hits:
Description: algorithms for building the network of an delyable-set, using maximum density subgraph algorithms and ISAP
Platform: |
Size: 292864 |
Author: Douvc |
Hits:
Description: 本文提出了一种节点密度和剩余能量传感器网络加权分群算法，该分群算法优化了群首
选择，均衡了网络节点的能量消耗，延长了网络的生命周期-This paper proposes a residual energy of sensor nodes in the network density and weighted clustering algorithm, the clustering algorithm to optimize the group' s first choice, balancing the energy consumption of network nodes to extend the network life cycle
Platform: |
Size: 284672 |
Author: 吴田 |
Hits:
Description: 基于车流密度的车载网路由协议的具体设计过程及实现-Based on vehicle traffic density by a specific network protocol design and implementation process
Platform: |
Size: 3523584 |
Author: 向日葵 |
Hits:
Description: Mining trajectory data has been gaining significant interest in recent years. However, existing approaches to trajectory
clustering are mainly based on density and Euclidean distance measures. We argue that when the utility of spatial clustering of
mobile object trajectories is targeted at road-network aware location-based applications, density and Euclidean distance are no
longer the effective measures. This is because traffic flows in a road network and the flow-based density characterization become
important factors for finding interesting trajectory clusters.
Platform: |
Size: 2274304 |
Author: ShAzZ |
Hits:
Description: 社会网络分析中的密度估计方法，发表在sigmod2014上的深度文章，有具体算法和实验评价-Social network analysis density estimation method was published in sigmod2014 good text, be able to estimate the social networks of small groups and core.
Platform: |
Size: 1107968 |
Author: michael |
Hits:
Description: In this dissertation, there are four main aspects included: energy reservation on
MAC layer, secure improvement for DoS attacks on MAC layer, query processing with
uncertainty for sensor systems, and throughput maximization on MAC layer
for ultra wideband communication systems.
In energy reservation, we proposed asynchronous MAC (A-MAC) protocol and
asynchronous schedule-based MAC (ASMAC) protocol. A-MAC and ASMAC proto-
cols are attractive due to their suitabilities for multihop networks and capabilities of
removing accumulative clock-drifts without any network synchronization. Moreover, we
build a traffic-strength- and network-density-based model to adjust essential algorithm
parameters adaptively-In this dissertation, there are four main aspects included: energy reservation on
MAC layer, secure improvement for DoS attacks on MAC layer, query processing with
uncertainty for sensor systems, and throughput maximization on MAC layer
for ultra wideband communication systems.
In energy reservation, we proposed asynchronous MAC (A-MAC) protocol and
asynchronous schedule-based MAC (ASMAC) protocol. A-MAC and ASMAC proto-
cols are attractive due to their suitabilities for multihop networks and capabilities of
removing accumulative clock-drifts without any network synchronization. Moreover, we
build a traffic-strength- and network-density-based model to adjust essential algorithm
parameters adaptively
Platform: |
Size: 692224 |
Author: amir |
Hits:
Description: 利用Matlab生成二维随机裂隙，控制裂隙密度、倾向、迹长分布函数、均值、标准差(Using MATLAB to generate two-dimensional stochastic fractures and control the density, tendency, trace length distribution function, mean and standard deviation of fractures)
Platform: |
Size: 711680 |
Author: 洗头用潘婷 |
Hits: