Location:
Search - time of arrival
Search list
Description: 短进程优先算法，主要考虑完成时间短优先原则。如考虑到达时间，还需下载者自己加强。-short process priority algorithm, the main consideration to complete a short time priority principle. If a time of arrival, may also need to download strengthen themselves.
Platform: |
Size: 30346 |
Author: 巫丙亮 |
Hits:
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:
Description: diaodu1完成基本模块框架
diaodu2完成了先进先出，和输出显示模块。
diaodu2-1准备将FCFS的到达时间按从小到大排列进行实现。未果
diaodu3完成了SJF，优化了输出精度
diaodu4基本完成了RR但是有一个小bug，
diaodu5完成了RR
diaodu6优化了一些输入输出，但是发现RR等于4时正确，大于或小于4都有问题。算法出现问题
diaodu7解决了RR的问题。程序基本完成
diaodu8优化了代码，并完善了RR输出时间轴表示的代码，和main函数中输入操作命令转换为大写字母的比较方式。-diaodu1 completed basic module framework diaodu2 completed the first-in first-out. and output module. Diaodu2-1 ready to FCFS queue by the time of arrival from small to large to achieve alignment. Diaodu3 unsuccessful completion of the SJF, Optimizing the output accuracy diaodu4 basically completed the RR However, there is a small bug, diaodu5 RR diaodu6 completed the optimization of input and output, But RR was found to 4:00 correct, or less than 4 had problems. Diaodu7 algorithm to solve problems of the RR. Diaodu8 completed basic procedures to optimize the code, and improve the time frame indicated RR output code, and the main function entry orders converted to uppercase the comparative approach.
Platform: |
Size: 10728 |
Author: billdong |
Hits:
Description: 停车场是一条可以停放n辆车的狭窄通道，且只有一个大门汽车停放安到达时间的先后依次由北向南排列（大门在最南端，最先到达的第一辆车停在最北端）若停车场已经停满n辆车，后来的汽车在便道上等候，一旦有车开走，排在便道上的第一辆车可以开入；当停车场的某辆车要离开时，停在他后面的车要先后退为他让路，等它开出后其他车在按照原次序开入车场，每两停在车场的车要安时间长短缴费。
要求：以栈模拟停车场，以队列车场外的便道，按照从终端输入的数据序列进行模拟管理。每一组数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码、以及到达或离去的时刻。对每一组数据进行操作后的信息为：若是车辆到达，则输出汽车在停车场的内或便道上的位置：若是车辆离去则输出汽车在停车场内的停留时间和应缴纳的费用（在便道上的停留时间不收费）。栈以顺序结构实现，队列以链表结构实现。
-parking can be a n vehicles parked in a narrow channel. and only one door car parked on the time of arrival has followed from north to south with (the southernmost tip of the door, the first to reach No. 1 car was parked in the most northern end of the project) if the car park has been full of parked cars n, and later in the car on the sidewalk waiting Once a car drive away, on the sidewalk on the first one into the car; When parking a car to leave, He stopped at the first car behind the back of his crazy, it has come out after the other vehicles in the original order into the garage, Every two parked cars in the parking lots to pay security duration. Requirements : Stack simulated car parks, to train teams outside the sidewalk, according to the input from the terminal sequence simulation
Platform: |
Size: 3207 |
Author: 牛纪超 |
Hits:
Description: 程序开始运行时选择调度算法，创建进程时输入进程所需服务时间以及到达时间。
根据当前所设定调度算法，连续调度所有进程，并计算每个进程的周转时间和带权周转时间、所有进程的平均周转时间和平均带权周转时间。
调度时应适当输出调度过程中各进程状态队列的变化情况以及进程的已执行时间、还需服务时间（针对时间片轮转算法）。-Routine is executed choice when scheduling algorithm, create process input process required service time and time of arrival.
According to the current set scheduling algorithm, continuous scheduling all processes, and calculating each process cycle time and weighted turnover time, all process of the average turnover time and average weighted turnover time.
Scheduling should appropriate output in the process of scheduling the process status queue changes and process already execution time, still need to service time (according to time slice rotary algorithm).
Platform: |
Size: 4096 |
Author: 若瓷 |
Hits:
Description: 短进程优先算法，主要考虑完成时间短优先原则。如考虑到达时间，还需下载者自己加强。-short process priority algorithm, the main consideration to complete a short time priority principle. If a time of arrival, may also need to download strengthen themselves.
Platform: |
Size: 29696 |
Author: 巫丙亮 |
Hits:
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:
Description: 一个模拟泊松随机过程的小程序。可以计算系统平均等待时间，和平均对列长度。系统参数如 到来速率及离开速率均可在头文件里修改。另外通过修改头文件factorK可以将到来序列的概率分布改为Erlang分布。-a simulated Poisson random process of small programs. System can calculate the average waiting time, and the average length of the list. The system parameters such as the rate of arrival and departure rates can be found in the first document changes. Through the first revised document will come factorK sequence probability distribution instead Erlang distribution.
Platform: |
Size: 261120 |
Author: 小婷 |
Hits:
Description: 电话计费器程序/*信号定义：
clk： 时钟信号，本例中其频率值为1Hz；
decide： 电话局反馈回来的信号，代表话务种类，“01”表示市话，“10”表示
长话，“11”表示特话；
dispmoney： 用来显示卡内余额，其单位为角，这里假定能显示的最大数额为50 元
（500 角）；
disptime： 显示本次通话的时长；
write,read： 当write 信号下降沿到来时写卡，当话卡插入，read 信号变高时读卡；
warn： 余额过少时的告警信号。本例中，当打市话时，余额少于3 角，打长
话时，余额少于6 角，即会产生告警信号；
cut： 当告警时间过长时自动切断通话信号。 */-telephone billing for procedures/* signal definition : clk : clock signal, which in this case, their frequency of 1Hz; decide : Telephone Bureau feedback signal, then the Treasury representative types, "01" Urban said, "10" The point said, "11" expressed special words; dispmoney : to show the card balance, the unit of angle, Here are supposed to show the maximum amount of 50 billion yuan (500 angle); disptime : The calls show the length; write, read : When the write signal arrival of the down time to write cards, When the card insert, read signal change high Reader; warn : Fees balance of the alarm signal. In this example, when fighting City words, the balance is less than 30 cents, playing The point, the balance is less than 60 cents, would produce warning
Platform: |
Size: 1024 |
Author: slam |
Hits:
Description: diaodu1完成基本模块框架
diaodu2完成了先进先出，和输出显示模块。
diaodu2-1准备将FCFS的到达时间按从小到大排列进行实现。未果
diaodu3完成了SJF，优化了输出精度
diaodu4基本完成了RR但是有一个小bug，
diaodu5完成了RR
diaodu6优化了一些输入输出，但是发现RR等于4时正确，大于或小于4都有问题。算法出现问题
diaodu7解决了RR的问题。程序基本完成
diaodu8优化了代码，并完善了RR输出时间轴表示的代码，和main函数中输入操作命令转换为大写字母的比较方式。-diaodu1 completed basic module framework diaodu2 completed the first-in first-out. and output module. Diaodu2-1 ready to FCFS queue by the time of arrival from small to large to achieve alignment. Diaodu3 unsuccessful completion of the SJF, Optimizing the output accuracy diaodu4 basically completed the RR However, there is a small bug, diaodu5 RR diaodu6 completed the optimization of input and output, But RR was found to 4:00 correct, or less than 4 had problems. Diaodu7 algorithm to solve problems of the RR. Diaodu8 completed basic procedures to optimize the code, and improve the time frame indicated RR output code, and the main function entry orders converted to uppercase the comparative approach.
Platform: |
Size: 10240 |
Author: billdong |
Hits:
Description: 停车场是一条可以停放n辆车的狭窄通道，且只有一个大门汽车停放安到达时间的先后依次由北向南排列（大门在最南端，最先到达的第一辆车停在最北端）若停车场已经停满n辆车，后来的汽车在便道上等候，一旦有车开走，排在便道上的第一辆车可以开入；当停车场的某辆车要离开时，停在他后面的车要先后退为他让路，等它开出后其他车在按照原次序开入车场，每两停在车场的车要安时间长短缴费。
要求：以栈模拟停车场，以队列车场外的便道，按照从终端输入的数据序列进行模拟管理。每一组数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码、以及到达或离去的时刻。对每一组数据进行操作后的信息为：若是车辆到达，则输出汽车在停车场的内或便道上的位置：若是车辆离去则输出汽车在停车场内的停留时间和应缴纳的费用（在便道上的停留时间不收费）。栈以顺序结构实现，队列以链表结构实现。
-parking can be a n vehicles parked in a narrow channel. and only one door car parked on the time of arrival has followed from north to south with (the southernmost tip of the door, the first to reach No. 1 car was parked in the most northern end of the project) if the car park has been full of parked cars n, and later in the car on the sidewalk waiting Once a car drive away, on the sidewalk on the first one into the car; When parking a car to leave, He stopped at the first car behind the back of his crazy, it has come out after the other vehicles in the original order into the garage, Every two parked cars in the parking lots to pay security duration. Requirements : Stack simulated car parks, to train teams outside the sidewalk, according to the input from the terminal sequence simulation
Platform: |
Size: 3072 |
Author: 牛纪超 |
Hits:
Description: 模拟银行服务，根据客户到达时间不同，以及为客户服务时间不同。可以模拟窗口最佳情况。使得窗口的服务效率高，而且顾客等待时间不是很长。-Simulation of banking services, according to the customer a different time of arrival, as well as customer service at different times. The best of circumstances can simulate a window. Makes high-efficiency windows, and customers waiting time is not very long.
Platform: |
Size: 5120 |
Author: 朱敏辉 |
Hits:
Description: 这是关于NLOS 环境下基于到达时间差（TDOA）的定位算法 的一篇文献.-This is based on NLOS environment arrival time difference (TDOA) positioning algorithm for a literature.
Platform: |
Size: 1115136 |
Author: 展琳琳 |
Hits:
Description: 波达方向（DOA）估计的基本问题就是确定同时处在空间某一区域内多个感兴趣的信号的空间位置（即多个信号到达阵列参考阵元的方向角）。最早的也是最经典的超分辨DOA估计方法是著名的MUSIC方法.本研究报告给出改进music的实现步骤-Direction of Arrival (DOA) estimates the basic problem is to define the space at the same time in more than interested in a particular region of the spatial location of the signal (ie, multiple signals arrive at the array element reference to the direction of angle). The earliest and most classic super-resolution DOA estimation method is well-known MUSIC method. The present study is given to improve the realization of music steps
Platform: |
Size: 9216 |
Author: 张洪欣 |
Hits:
Description: Time Difference of Arrival
Platform: |
Size: 11264 |
Author: zerox |
Hits:
Description: Time Domain Method for Calculating Difference on Arrival of Sound.
Platform: |
Size: 1024 |
Author: eeiitb |
Hits:
Description: 蜂窝网络抑制非视距定位算法研究.详细介绍了几种基本的定位方法：圆周定位法（TOA, Time Of Arrival）、双曲线定位法（TDOA, Time Different Of Arrival）、角度测量值定位法（AOA, Angle Of Arrival）和混合定位法，并对这些方法进行了比较。
-Cellular networks inhibit non-line-location algorithms. Details the positioning of several basic methods: Circle location algorithm (TOA, Time Of Arrival), hyperbolic positioning method (TDOA, Time Different Of Arrival), the angle measurement positioning method ( AOA, Angle Of Arrival) and mixed-orientation law, and these methods were compared.
Platform: |
Size: 28672 |
Author: gudeyi |
Hits:
Description: Estimating the positions of sensor nodes is a fundamental and
crucial problem in ad hoc wireless sensor networks (WSNs).
In this paper, an accurate node localization method for WSNs
is devised based on the weighted least squares technique with
the use of time-of-arrival measurements. Computer simulations
are included to evaluate the performance of the proposed
approach by comparing with the classical multidimensional
scaling method and Cram´ er-Rao lower bound.
Platform: |
Size: 518144 |
Author: pravin jadhav |
Hits:
Description: 产生幅值和到达时间随机，脉冲间隔为0.0001的脉冲信号，模拟脉冲噪声-Generate random amplitude and arrival time, pulse interval of 0.0001 to the pulse signal, analog pulse noise
Platform: |
Size: 1024 |
Author: 王德莲 |
Hits:
Description: POSITIONING USING TIME-DIFFERENCE OF ARRIVAL MEASUREMENTS
Platform: |
Size: 190464 |
Author: ali |
Hits:
« 12
3
4
5
6
7
8
9
10
...
17
»