Welcome![Sign In][Sign Up]
Location:
Search - M/M/S

Search list

[Other resourcenearpiont

Description: 最接近点对问题是求二维坐标中的点对问题,该算法是为了将平面上点集S线性分割为大小大致相等的2个子集S1和S2,我们选取一垂直线l:x=m来作为分割直线。其中m为S中各点x坐标的中位数。由此将S分割为S1={p∈S|px≤m}和S2={p∈S|px>m}。从而使S1和S2分别位于直线l的左侧和右侧,且S=S1∪S2 。由于m是S中各点x坐标值的中位数,因此S1和S2中的点数大致相等。 递归地在S1和S2上解最接近点对问题,我们分别得到S1和S2中的最小距离δ1和δ2。现设δ=min(δ1,δ1)。若S的最接近点对(p,q)之间的距离d(p,q)<δ则p和q必分属于S1和S2。不妨设p∈S1,q∈S2。那么p和q距直线l的距离均小于δ。因此,我们若用P1和P2分别表示直线l的左边和右边的宽为δ的2个垂直长条,则p∈S1,q∈S2。 -closest point to the problem is for two-dimensional coordinates of the point of the problem, the algorithm is to be planar point set on the S linear divided roughly equal to the size of two sub-sets of S1 and S2, we selected a vertical line l : x = m as a separate line. Where m for S x coordinates of the points of the median. This will be divided into S S1 = (p S | px m) and (p = S2 S | pxgt; M). So that S1 and S2 are located in the linear l left and right, and S = S1 S2. M is due to S x coordinates of the points of the median value, S1 and S2 2186 roughly equal. Recursive in S1 and S2 the nearest point on the solution of the problem, we won the S1 and S2 the minimum distance between 1 and 2. The existing = min (1, 1). If S is the closest point of (p, q) the distance between d (p, q)
Platform: | Size: 15666 | Author: 黄波 | Hits:

[Other resourcequeue_emulator

Description: 这是一个基于M/M/S类型的排队论仿真程序。M/M/S表示到达时间为负指数分布,服务时间为负指数分布,服务设备数量为S个的排队系统。 (1)到达模式:严格意义上讲是一个接着一个到达,而且到达时间间隔服从参数为mean_arr的负指数分布; (2)服务模式:服务台的数量为server_num,且每个服务台服务一个顾客的服务时间服从参数为mean_serv的负指数分布; (3)排队规则:满足先进先服务,服务快的先离开的规则。 -This is a based on the M / M / S types of queuing theory simulation program. M / M / S said time of arrival of the negative exponential distribution and service time for the negative exponential distribution, service equipment for the number of S-queuing system. (1) mode of arrival : a strict sense is a one followed arrived, but the inter-arrival time parameters mean_arr obey the negative exponential distribution; (2) mode : The number of help desk server_num. with each help desk services a customer service parameters mean_serv obey the negative exponential distribution; (3) queuing rules : first meet advanced services, the first to leave fast rules.
Platform: | Size: 3705 | Author: 丘春辉 | Hits:

[Other resources.h.e

Description: 运动会分数统计 v1.0 一、实验描述 参加运动会有n个学校,学校编号为1……n。比赛分成m个男子项目和w个女子项目。项目编号为男子1……m,女子m+1……m+w。不同的项目取前五名或前三名积分 取前五名的积分分别为:7、5-Games Statistics v1.0 a fraction experiment described in a n Games, the school No. 1 ... n. Competition is divided into men item m and w-woman project. Item No. 1 man ... m, a woman m m w .... Different items from the top five or top three, top five score for the score were : 7,5
Platform: | Size: 1233576 | Author: 路明辉 | Hits:

[OtherM

Description: M值曲线即控制理论中的补灵敏度系数模的最大值。本例模型为:y=w+s
Platform: | Size: 7956 | Author: 李小丽 | Hits:

[Other resource排队论mm1

Description: 排队论中的一个仿真程序,主要是用于仿真M/M/1、M/D/1模型。输入排队模型相关参量,返回计算结果。-It s a simulation in queueing, mainly using in simulating M/M/1 and M/D/1 module. Input the parameter about the module and return the result.
Platform: | Size: 21283 | Author: 肖煜 | Hits:

[Documentss-function函数编写

Description: 在MATLAB中编写s-function函数方法,支持C++语言,M语言等
Platform: | Size: 755995 | Author: 419296842@qq.com | Hits:

[Algorithm排队论mm1

Description: 排队论中的一个仿真程序,主要是用于仿真M/M/1、M/D/1模型。输入排队模型相关参量,返回计算结果。-It s a simulation in queueing, mainly using in simulating M/M/1 and M/D/1 module. Input the parameter about the module and return the result.
Platform: | Size: 231424 | Author: 肖煜 | Hits:

[matlabqueue_emulator

Description: 这是一个基于M/M/S类型的排队论仿真程序。M/M/S表示到达时间为负指数分布,服务时间为负指数分布,服务设备数量为S个的排队系统。 (1)到达模式:严格意义上讲是一个接着一个到达,而且到达时间间隔服从参数为mean_arr的负指数分布; (2)服务模式:服务台的数量为server_num,且每个服务台服务一个顾客的服务时间服从参数为mean_serv的负指数分布; (3)排队规则:满足先进先服务,服务快的先离开的规则。 -This is a based on the M/M/S types of queuing theory simulation program. M/M/S said time of arrival of the negative exponential distribution and service time for the negative exponential distribution, service equipment for the number of S-queuing system. (1) mode of arrival : a strict sense is a one followed arrived, but the inter-arrival time parameters mean_arr obey the negative exponential distribution; (2) mode : The number of help desk server_num. with each help desk services a customer service parameters mean_serv obey the negative exponential distribution; (3) queuing rules : first meet advanced services, the first to leave fast rules.
Platform: | Size: 3072 | Author: 丘春辉 | Hits:

[Program doc_B_UWB

Description: 基于simulink的uwb仿真 uwb.mdl: UWB model - open this to begin. uwb_lib.mdl: Library blocks for UWB model. uwb_init.m: Initialization called before model is loaded. uwb_settings: Sets up structure containing system parameters ( uwb in workspace). uwb_imr.m: Initializes UWB channel impulse response. uwb_sv_*.m: Four M-files used to generate channel impulse responses (MAT files).-based on Simulink simulation of UWB uwb.mdl : UWB model-open this to begin. uwb_lib.mdl : Library blocks for UWB model. uwb_init.m : Initialization called before model is loaded. uwb_settings : Sets up structure containing system parameter s (UWB in workspace). uwb_imr.m : Initializes UWB channel impulse response. UWB _sv_*. m : Four M-files used to generate channel impulse r esponses (MAT files).
Platform: | Size: 48128 | Author: 案件评 | Hits:

[Documentssim.tar

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:

[matlabMYMM1

Description: M/M/1单服务台排队系统仿真(用事件调度法实现离散事件系统仿真) 顾客到达模到达时间间隔和顾客服务时间均服从负指数分布,单服务台系统,按照单队排队,按FIFO方式服务。考察服务n个顾客(n=1000,2000,3000,5000)后的顾客平均队长及平均排队等待时间。-M/M/1 single-server queuing system simulation (using Event Scheduling Method Discrete Event Simulation System) to customers Da-mo arrival time interval and customer service time are negative exponential distribution, single-desk system, in accordance with the single-team queue, by FIFO mode services. N inspection services customers (n = 1000,2000,3000. 5000) the average customer captain, and the average queue time.
Platform: | Size: 1024 | Author: 麦麦 | Hits:

[Windows Developshiyan1

Description: M/M/1单服务台或M/M/S(n)排队系统仿真 (用事件调度法实现离散事件系统仿真) -M/M/1 single desk or M/M/S (n) Queuing System Simulation (Event Scheduling Method using Discrete Event System Simulation)
Platform: | Size: 81920 | Author: 布布 | Hits:

[MPIqueue

Description: M/M/1 模型,主要用来求解单对单服务台的模型,过程比较简介,适合任何分布-M/M/1 model, mainly used to solve the one-on-one help desk model, the process is relatively brief, suitable for any distribution
Platform: | Size: 3072 | Author: | Hits:

[matlabmyMM1

Description: 刚写的Matlab下的M/M/1排队的仿真代码,加了完整的注释-Just write the M/M/1 queue under Matlab simulation code, plus a complete Notes
Platform: | Size: 1024 | Author: 阿哲 | Hits:

[matlab2

Description: M/M/m排队系统性能仿真代码matlab function r=randexp(lambda) r = -lambda*log(rand) -M/M/m queuing system performance simulation code matlab function r = randexp (lambda) r =-lambda* log (rand)
Platform: | Size: 2048 | Author: jacky | Hits:

[Fax programsimulation

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:

[source in ebooksanserver_lab1

Description: M/M/1 queue simulation
Platform: | Size: 2048 | Author: Sanketh Datla | Hits:

[Other1

Description: 任务:参加运动会有n个学校,学校编号为1……n。比赛分成m个男子项目,和w个女子项目。项目编号为男子1……m,女子m+1……m+w。不同的项目取前五名或前三名积分;取前五名的积分分别为:7、5、3、2、1,前三名的积分分别为:5、3、2;哪些取前五名或前三名由学生自己设定。(m<=20,n<=20) 功能要求: 1)可以输入各个项目的前三名或前五名的成绩; 2)能统计各学校总分, 3)可以按学校编号或名称、学校总分、男女团体总分排序输出; 4)可以按学校编号查询学校某个项目的情况;可以按项目编号查询取得前三或前五名的学校。 5)数据存入文件并能随时查询 6)规定:输入数据形式和范围:可以输入学校的名称,运动项目的名称 -Tasks: participate in the Games has n school, the school numbered 1 ... ... n. Competition is divided into m-men s and women s events w months. Item number for the men s 1 ... ... m, women, m+1 ... ... m+ w. Different projects to take the top five or top three points to take the top five points are as follows: 7,5,3,2,1, the top three points are as follows: 5,3,2 which take five name or the top three set up by the students themselves. (M <= 20, n <= 20) Functional requirements: 1) can enter the top three or top five of each item of the performance 2) The total score can be statistics of schools, 3) can be number or name of the school, the school total score, total score for men and women groups to sort out 4) can check the school by school number of an item can be achieved in the first three or item number check the top five schools. 5) data into a file and be denied access to 6) provides that: the input data format and scope: You can enter the school name, t
Platform: | Size: 19456 | Author: eric cui | Hits:

[VC/MFCVisualC60

Description: 本 书 是 美 国 微 软 出 版 社 授 权 的 M i c r o s o f t V i s u a l S t u d i o 系列中文版图书之 一, 它是V i s u a l C + + 6 . 0 程序员的实用参考书。全书共分成六个部分: 第一部分 介绍D e v e l o p e r S t u d i o 和A p p W i z a r d 的基础知识; 第二部分介绍文本、图形和对 话框编辑器; 第三部分是编程指南, 展示了如何使用C l a s sW i z a r d 和G a l l e r y 来 加速编程开发工作, 创建自己的组件; 第四部分介绍A c t i v e X 控件及其使用, 说 明如何用M F C 或A T L 来写A c t i v e X 控件; 第五部分讨论调试器的各种能力, 程 序优化的各种选项及原因, 如何定制V i s u a l C + + , 如何编制宏和附加实用程序; 第六部分提供A S C I I 字符和A N S I 字符的标准表格, 并简要描述C l a s sW i z a r d 支 持的M F C 类和V B S c r i p t。 书 中 讨 论 的 许 多 主 题 均 以 范 例 程 序 进 行 说 明 , 所 有 范 例 程 序 的 项 目 文 件 都 在配套光盘上。本书是从事V i s u a l C + + 6 . 0 应用与开发的所有技术人员极好的工 具书, 同时也是大专院校相关专业的师生的自学、教学参考用书。-U.S. Microsoft Press book is an authorized M icrosoft V isual S tudio series of Chinese books First, it is the V isual C++ 6. 0 Programmers practical reference book. The book is divided into six parts: Part I Description D eveloper S tudio and A pp W izard the basics second part text, graphics and Dialog editor third part is the programming guide shows how to use C las sW izard and G allery to Accelerated development program, create your own components the fourth section describes the A ctive X control their use, said Out how to use MFC or ATL to write A ctive X controls fifth section discusses the debugger capabilities, process Ordinal optimization and the reasons for the various options and how to customize the V isual C++, how to prepare macros and additional utility Part VI provides ASCII characters and ANSI characters in the standard form, and a brief description of C las sW izard support Support of M F C class and V B S c r i p t. Many of the topics discuss
Platform: | Size: 10812416 | Author: zzg | Hits:

[matlabbanfangcha.m

Description: matlab的.m文件,对影像计算不同方向的经验半方差,检测某区域的空间异质性-matlab' s. m files, image computing experience of semi-variance in different directions to detect spatial heterogeneity of a region
Platform: | Size: 1024 | Author: | Hits:
« 12 3 4 5 6 7 8 9 10 ... 50 »

CodeBus www.codebus.net