Location:
Search - M/M/S/K
Search list
Description: MATLAB编写的一种模式识别里的重要的模糊聚类方法K-means算法的matlab程序.-MATLAB prepare a Pattern Recognition's important Fuzzy clustering methods K-means algorithm Matlab procedures.
Platform: |
Size: 55082 |
Author: zs |
Hits:
Description: 本程序利用奇异值分解对3通道彩色图像进行压缩分解，具体步骤如下：
压缩过程：
1. 选取子图像大小K值，把图像分解成M×M个子图像，IMG(s),s=1,2,…, M2，其中M=N/K，原始图像IMG大小为N×N。
2. 计算这M2个子图像的平均值average，对每幅子图像减去均值图像得到新图像。
3. 计算相关矩阵R，其元素定义为 。
4. 计算R的特征值与特征向量，计算每幅子图像与最大特征向量的内积，便得到编码，即压缩后的图像。
Platform: |
Size: 335193 |
Author: wangweiming |
Hits:
Description: Digital Signature Algorithm (DSA)是Schnorr和ElGamal签名算法的变种，被美国NIST作为DSS(DigitalSignature Standard)。算法中应用了下述参数：
p：L bits长的素数。L是64的倍数，范围是512到1024；
q：p - 1的160bits的素因子；
g：g = h^((p-1)/q) mod p，h满足h < p - 1, h^((p-1)/q) mod p > 1；
x：x < q，x为私钥 ；
y：y = g^x mod p ，( p, q, g, y )为公钥；
H( x )：One-Way Hash函数。DSS中选用SHA( Secure Hash Algorithm )。
p, q, g可由一组用户共享，但在实际应用中，使用公共模数可能会带来一定的威胁。签名及验证协议如下：
1. P产生随机数k，k < q；
2. P计算 r = ( g^k mod p ) mod q
s = ( k^(-1) (H(m) + xr)) mod q
签名结果是( m, r, s )。
3. 验证时计算 w = s^(-1)mod q
u1 = ( H( m ) * w ) mod q
u2 = ( r * w ) mod q
v = (( g^u1 * y^u2 ) mod p ) mod q
若v = r，则认为签名有效。
DSA是基于整数有限域离散对数难题的，其安全性与RSA相比差不多。DSA的一个重要特点是两个素数公开，这样，当使用别人的p和q时，即使不知道私钥，你也能确认它们是否是随机产生的，还是作了手脚。RSA算法却作不到。
Platform: |
Size: 136954 |
Author: wildkaede |
Hits:
Description: 系统资源(r1…rm),共有m类，每类数目为r1…rm。随机产生进程Pi(id,s(j,k)，t),0<=i<=n,0<=j<=m,0<=k<=dt为总运行时间，在运行过程中，会随即申请新的资源。描述进程运行状态。-system resources (r1 ... rm), a total of m category, the number of each type of r1 ... rm. The process of randomly generated Pi (id, s (j, k), t), 0 <= i <= n, 0 <= j <= m, 0 <= k <= dt of the total running time, in the course of operation, we will immediately Shen Requests for new resources. Describe the process of running the state.
Platform: |
Size: 749771 |
Author: 雨后阳光 |
Hits:
Description: 小鼠迷宫问题« 问题描述：小鼠a 与小鼠b身处一个m×m的迷宫中，如图所示。每一个方格表示迷宫中的一个房间。这m×n个房间中有一些房间是封闭的，不允许任何人进入。在迷宫中任何位置均可沿上，下，左，右4个方向进入未封闭的房间。小鼠a位于迷宫的(p，q)方格中，它必须找出一条通向小鼠b 所在的(r，s)方格的路。请帮助小鼠a找出一条通向小鼠b的道路。« 编程任务：对于给定的小鼠的迷宫，编程计算小鼠a 通向小鼠b的道路。« 数据输入：由文件input.txt 给出输入数据。第一行有2 个正整数m，k，分别表示迷宫的行数和封闭的房间数。接下来的k行中，每行2 个正整数，表示被封闭的房间所在的行号和列号。最后的2 行，每行也有2 个正整数，分别表示小鼠a 所处的方格(p，q)和小鼠b 所处的方格(r，s)。« 结果输出:将计算出的小鼠a 通向小鼠b 的道路输出到文件output.txt。输出文件的每行2 个正整数，表示道路行号和列号，从终点向起点方向列出。如果小鼠a 无法通向小鼠b 则输出“No Solution!”-mice problem laquo maze; Problem description : mouse with a live mouse b m 1 m maze of dummies. Each expressed a box maze of a room. This m n rooms there were some rooms are closed, did not allow anyone to enter. The maze can be any location along the upper and lower, right and left four entered no closed rooms. Mice in a maze of (p, q) box, it must find a leading mice where the b (r, s) box at the road. Please help find a mouse a mouse b leading to the road. Laquo; Programming tasks : to the mice in a maze of programming leading to a calculation mice mice b roads. Laquo; Data input : from the document input.txt given input data. The first trip had two positive integers m, k, respectively, said the number of rows maze and closed several rooms. Next k OK, OK every two positive integers, h
Platform: |
Size: 1682 |
Author: 林天 |
Hits:
Description: #include #include #define M 20 #define N 3 int mm[M]={0,0,0,2,3,1,0,4,2,3,2,1,0,3,2,2,1,3,0,1}; int nn[N]; int number; void Xunhuan(void); void FIFO(void); void Best(void); void LRU(void); int main() { char ss[1]; int i,j, *p=nn; int c, k=0; for(i=0;i
Platform: |
Size: 2853 |
Author: lipman1987 |
Hits:
Description: 系统资源(r1…rm),共有m类，每类数目为r1…rm。随机产生进程Pi(id,s(j,k)，t),0<=i<=n,0<=j<=m,0<=k<=dt为总运行时间，在运行过程中，会随即申请新的资源。描述进程运行状态。-system resources (r1 ... rm), a total of m category, the number of each type of r1 ... rm. The process of randomly generated Pi (id, s (j, k), t), 0 <= i <= n, 0 <= j <= m, 0 <= k <= dt of the total running time, in the course of operation, we will immediately Shen Requests for new resources. Describe the process of running the state.
Platform: |
Size: 749568 |
Author: 雨后阳光 |
Hits:
Description: MATLAB编写的一种模式识别里的重要的模糊聚类方法K-means算法的matlab程序.-MATLAB prepare a Pattern Recognition's important Fuzzy clustering methods K-means algorithm Matlab procedures.
Platform: |
Size: 55296 |
Author: zs |
Hits:
Description: 简单的 Discrete Event Simulator
M/M/K/K queue
含Readme。 可在此基础上开发复杂的仿真程序
请用 tar -xzvf sim.tar.gz 解压
-simple Discrete Event Simulator M/K/K queu e-readme. In this complex development on the basis of the simulation program please use the tar-xzvf sim.tar.gz extract
Platform: |
Size: 31744 |
Author: digitalkai |
Hits:
Description: 本程序利用奇异值分解对3通道彩色图像进行压缩分解，具体步骤如下：
压缩过程：
1. 选取子图像大小K值，把图像分解成M×M个子图像，IMG(s),s=1,2,…, M2，其中M=N/K，原始图像IMG大小为N×N。
2. 计算这M2个子图像的平均值average，对每幅子图像减去均值图像得到新图像。
3. 计算相关矩阵R，其元素定义为 。
4. 计算R的特征值与特征向量，计算每幅子图像与最大特征向量的内积，便得到编码，即压缩后的图像。
-This procedure using singular value decomposition of 3-channel color image compression decomposition, concrete steps are as follows: compression process: 1. Select the sub-image size K value, the image is decomposed into M × M sub-image, IMG (s), s = 1, 2, ..., M2, in which M = N/K, the original image IMG size N × N. 2. M2 calculate the average of sub-image average, for each sub-image minus the new images mean images. 3. Calculation of correlation matrix R, defined as its elements. 4. Calculation of the characteristics of R value and eigenvector calculated each sub-image with the largest eigenvector of the inner product, they will have to code, that is, the compressed images.
Platform: |
Size: 334848 |
Author: wangweiming |
Hits:
Description: 设计一个M/M/S/k排队系统模型，用C++进行仿真，计算一个新的服务请求在各个状态k下的阻塞率，绘制出到达率-阻塞率曲线(matlab)，并将理论值与仿真值进行比较。
M/M/S/k模型为服务请求到达间隔时间服从泊松分布、服务时间服从指数分布、系统有S个服务器、系统容量为k（有限个）的排队系统。如果一个服务请求到达排队系统时，系统内已有k个服务请求，那么这个服务请求就会被拒绝（即不为该服务请求安排服务器，也不会将其排入系统队列）。由于系统容量为k，有S个服务器，所以系统队列的长度为k-S。-The design of a M/M/S/k queuing system model, with C++ for simulation, calculation of a new service request in every state under the blocking rate k, the arrival rate of drawing- blocking probability curve (matlab), and the theoretical value and simulation values.
M/M/S/k model for the service request arrival time to obey Poisson distribution, exponential distribution of service time, the system has S servers, the system capacity of k (finite) of the queuing system. If a service request arrival queuing system, the system has k service request, then the service request will be rejected (that is, do not arrange for the service request server, nor will its queue into the system). Since the system capacity for the k, there are S servers, so the length of the queue system kS.
Platform: |
Size: 112640 |
Author: 张三 |
Hits:
Description: 《Exploiting force feedback in pilot training and control of an underwater
robotics vehicle: an implementation in LabVIEW》
Xunzhang Wang Seet, G.G.L. Lau, M.W.S. Low, E. Tan, K.C.
OCEANS 2000 MTS/IEEE Conference and Exhibition
Volume 3, 11-14 Sept. 2000 Page(s):2037 - 2042 vol.3
Digital Object Identifier 10.1109/OCEANS.2000.882239
-《Exploiting force feedback in pilot training and control of an underwater
robotics vehicle: an implementation in LabVIEW》
Xunzhang Wang Seet, G.G.L. Lau, M.W.S. Low, E. Tan, K.C.
OCEANS 2000 MTS/IEEE Conference and Exhibition
Volume 3, 11-14 Sept. 2000 Page(s):2037- 2042 vol.3
Digital Object Identifier 10.1109/OCEANS.2000.882239
Platform: |
Size: 743424 |
Author: boyang |
Hits:
Description: 该程序试图考察一组数据服从哪种分布（正态，指数或双边指数），并利用K-S检验对各种分布作了检验。-The program attempts to examine a set of data subject to which distribution (normal, exponential or bilateral index), and use KS test has been tested in a variety of distributions.
Platform: |
Size: 261120 |
Author: 姚益武 |
Hits:
Description: 功能：计算最短路径的长度和最短路径
*方法：
*1,记n个城市为1，2，…，n. 对于给定的集合S等于{2,3,...n}和k属于S。
*2,记C(S,k)是由城市1出发，遍历S中每个城市恰好一次，最后终止在城市k的最优费用.
*3,当S中只有一个元素k时，C(S，k)= d(1,k)
* 当S中有多于一个元素时,C(S，k)等于任意一个属于S-k集合的子集m，C(s-k,m)+d(m,k)中最小的一个，
*4,这一方程的求解要求对一切给定大小的集合S及S中的每个可能的元素k，计算 C(S，k）的值
*5,当S等于{2,3,...n}时，如果C(S，k)的值对k属于S都已经通过计算得到，则最优环游的最小费用为
C(S,k)+d(k,1)中最小的一个。
*PS:C(S,k)用struct path结构来表示set = S, current = K, cost = C(S,K)
-Function: Calculate the shortest path length and the shortest path
Platform: |
Size: 2048 |
Author: tangyang |
Hits:
Description: 峰值抵消算法的基本思想是：在OFDM信号上叠加一个由一系列加权参考函数组成的峰值抵消信号，通过抵消函数的选取以及权值计算，使得抵消信号尽可能消除超过门限的信号幅值。常见的参考函数分为脉冲函数和其他窗函数两类。- T. May, H. Rohling. Reducing the peak-to-average power ratio in OFDM radio transmission systems. IEEE Vehicular Technology Conference (VTC), May 1998, Ottawa Canada, 3: 2474-2478
A. Geert Arnout, van N. Richard D., de W. Arnout Hendrik. Transmission system and method employing peak cancellation to reduce the peak-to-avrage power ratio. US Patent 6175551, Issued on January 16, 2001
S. K. Cha, M. H. Park, S. G. LEE, et al. A new PAPR reduction technique for OFDM systems using advanced peak windowing method. IEEE Trans. Consum. Electron., 2008, 54(2): 405-410
G. G. Chen, R. Ansari, Y. W. Yao. Improved peak windowing for PAPR reduction in OFDM. IEEE Vehicular Technology Conference, Apr. 2009, Barcelona, Spain
H. Kuo, S.W. Cheung. Optimization of windowing and peak-windowing techniques for WCDMA systems. IEEE International Conference on Acoustics, Speech and Signal Processing, May 2006, Toulouse France, 4: IV313-IV316
O. Vä ä nä nen, J. Vankka, K. Halonen. Simpl
Platform: |
Size: 2681856 |
Author: daidaohan |
Hits:
Description: m序列产生子函数
gold序列产生子函数
自相关函数和互相关函数计算子函数
调用子函数[s,k,pn]=m(c,b0)产生第二条m序列-function [Rm]=Rm(golda,goldb) 自相关函数和互相关函数计算子函数
N=11
n=2^N-1
Rm(1)=sum(golda.*goldb)/n
for k=1:n-1
Rm(k+1)=sum(golda.*circshift(goldb,[0,k]))/n
end
Rm
Platform: |
Size: 1024 |
Author: SD |
Hits:
Description: 关于排队模型的matlab仿真，里面有M/M/s/k模型的仿真讲解和全部代码，可以供大家学习。-Queuing model simulation on matlab
Platform: |
Size: 2048 |
Author: 朱世翔 |
Hits:
Description: This code plots the receiver operating characteristics (ROC) curve for Rayleigh channel. The formulas for the probability of detection and the probability of false alarm are taken the following paper:
Digham, F.F. Alouini, M.-S. Simon, Marvin K., On the Energy Detection of Unknown Signals Over Fading Channels, Communications, IEEE Transactions on , vol.55, no.1, pp.21,24, Jan. 2007.-This code plots the receiver operating characteristics (ROC) curve for Rayleigh channel. The formulas for the probability of detection and the probability of false alarm are taken the following paper:
Digham, F.F. Alouini, M.-S. Simon, Marvin K., On the Energy Detection of Unknown Signals Over Fading Channels, Communications, IEEE Transactions on , vol.55, no.1, pp.21,24, Jan. 2007.
Platform: |
Size: 2048 |
Author: micky |
Hits:
Description: 蜡烛图剩余时间，直接在MT4平台显示出来。非常方便外汇交易者注意收盘时间。
储存路径：MT4\MQL4\Indicators-//+ +
//| b-clock.mq4 |
//| Core time code by Nick Bilak |
//| http://metatrader.50webs.com/ beluck[at]gmail.com |
//| modified by adoleh2000 and dwt5 |
//+ +
#property copyright Copyright ?2005, Nick Bilak
#property link http://metatrader.50webs.com/
#property indicator_chart_window
// buffers
double s1[]
//+ +
//| Custom indicator initialization function |
//+ +
int init()
{
}
return(0)
//+ +
//| Custom indicator iteration function |
//+ +
int start()
{
double i
int m,s,k
m=Time[0]+Period()*60-CurTime()
i=m/60.0
s=m
Platform: |
Size: 1024 |
Author: chenxiao |
Hits:
Description: 以下排隊系統性能
– M/M/1 v.s. M/M/2
– M/M/1/k v.s. M/M/2/k
– M/M/m/m -The following queuing system- M/M/1 vs M/M/2- M/M/1/k vs M/M/2/k- M/M/m/m
Platform: |
Size: 2552832 |
Author: 張瑀征 |
Hits: