Behavioral models are used in games and computer graphics for realistic simulation of massive crowds. In this paper, we present a GPU based implementation of Reynolds [1987] algorithm for simulating flocks of birds and propose an extension to consider environment self occlusion. We performed several experiments and the results showed that the proposed approach runs up to three times faster than the original algorithm when simulating high density crowds, without compromising significantly the original crowd behavior.
标签： Behavioral simulation realistic computer
上传时间： 2017-09-08
上传用户：hanli8870
波信号发生及测量表（10~90Hz，步长5Hz） P23输出、P32输入；前两位显示输出频率，后两位显示输入的测量值 UP键增加设定频率值，DOWN键减少频率设定值
上传时间： 2014-01-07
上传用户：wab1981
C programming is a craft that takes years to perfect. A reasonably sharp person can learn the basics of C quite quickly. But it takes much longer to master the nuances of the language and to write enough programs, and enough different programs, to become an expert. In natural language terms, this is the difference between being able to order a cup of coffee in Paris, and (on the Metro) being able to tell anative Parisienne where to get off. This book is an advanced text on the ANSI C programming language. It is intended for people who are already writing C programs, and who want to quickly pick up some of the insights and techniques of experts.
标签： programming reasonably perfect basics
上传时间： 2013-12-20
上传用户：ls530720646
一个实现全程跟踪服务的物流管理系统。采用PHP+mysql开发，附带所有源程序及数据表。-A follow-up services to achieve the whole system of logistics management. Developed using PHP+ mysql, with all source code and data in table form.
标签： php+mysql物流配送网
上传时间： 2015-06-11
上传用户：liumangxiao
Collection of key-value pairs. TDictionary represents a generic collection of key-value pairs. This class provides a mapping from a collection of keys to a collection of values. When you create a TDictionary object, you can specify various combinations of initial capacity, equality operation, and initial content. You can add a key that is associated with a corresponding value with the Add or AddOrSetValue methods. You can remove entries with Remove or Clear, which removes all key-value pairs. Adding or removing a key-value pair and looking up a key are efficient, close to O(1), because keys are hashed. A key must not be nil (though a value may be nil) and there must be an equality comparison operation for keys. You can test for the presence or keys and values with the TryGetValue, ContainsKey and ContainsValue methods. The Items property lists all Count dictionary entries. You can also set and get values by indexing the Items property. Setting the value this way overwrites any existing value. The class TObjectDictionary inherits from TDictionary and provides an automatic mechanism for freeing objects removed from dictionary entries.
标签： Delphi 泛型
上传时间： 2015-07-01
上传用户：mirage
VIP+ is support software for YAMAHA RCX series robot controllers. In addition to the functions of the previously released "VIP Windows" software, VIP+ includes an easy-to-use GUI (graphical user interface). VIP+ also allows control by 2 or more controllers or access to a controller from 2 or more clients via Ethernet connection. ● With VIP+ you can: • Do offline editing of all data used on robot controllers • Operate and monitor robots connected to robot controllers • Do online editing of all data used with robot controllers • Back up and restore robot controller data ● Functions and features newly added to VIP+: • Ethernet connection to controllers • Supports data input in spreadsheet software format • Seamless backup and restoring of controller information such as point data • Syntax coloring • Data transfer between the online controller and an offline document by drag & drop • Executes online commands using a terminal window • Controller tree and document tree functions similar to Windows Explorer
标签： 雅马哈 VIPplus
上传时间： 2015-11-18
上传用户：anncol
msp430The LDC1312 and LDC1314 are 2- and 4-channel, 1• Easy-to-use – minimal configuration required 12-bit inductance to digital converters (LDCs) for • Measure up to 4 sensors with one IC inductive sensing solutions. With multiple channels • Multiple channels support environmental and and support for remote sensing, the LDC1312 and aging compensation LDC1314 enable the performance and reliability benefits of inductive sensing to be realized at minimal• Multi-channel remote sensing provides lowest cost and power. The products are easy to use, onlysystem cost requiring that the sensor frequency be within 1 kHz • Pin-compatible medium and high-resolution and 10 MHz to begin sensing. The wide 1 kHz to 10 options MHz sensor frequency range also enables use of very small PCB coils, further reducing sensing– LDC1312/4: 2/4-ch 12-bit LDC solution cost and size.– LDC1612/4: 2/4-ch 28
上传时间： 2016-07-22
上传用户：tongmoonsky
12V or Adjustable, High-Efficiency,Low IQ, Step-Up DC-DC Controller
上传时间： 2016-10-20
上传用户：oyjwle
ansible是目前比较流行的集群管理运维工具，本书介绍的其基础知识，全英文。
上传时间： 2018-02-05
上传用户：子非木哉
function [alpha,N,U]=youxianchafen2(r1,r2,up,under,num,deta) %[alpha,N,U]=youxianchafen2(a,r1,r2,up,under,num,deta) %该函数用有限差分法求解有两种介质的正方形区域的二维拉普拉斯方程的数值解 %函数返回迭代因子、迭代次数以及迭代完成后所求区域内网格节点处的值 %a为正方形求解区域的边长 %r1,r2分别表示两种介质的电导率 %up,under分别为上下边界值 %num表示将区域每边的网格剖分个数 %deta为迭代过程中所允许的相对误差限 n=num+1; %每边节点数 U(n,n)=0; %节点处数值矩阵 N=0; %迭代次数初值 alpha=2/(1+sin(pi/num));%超松弛迭代因子 k=r1/r2; %两介质电导率之比 U(1,1:n)=up; %求解区域上边界第一类边界条件 U(n,1:n)=under; %求解区域下边界第一类边界条件 U(2:num,1)=0;U(2:num,n)=0; for i=2:num U(i,2:num)=up-(up-under)/num*(i-1);%采用线性赋值对上下边界之间的节点赋迭代初值 end G=1; while G>0 %迭代条件：不满足相对误差限要求的节点数目G不为零 Un=U; %完成第n次迭代后所有节点处的值 G=0; %每完成一次迭代将不满足相对误差限要求的节点数目归零 for j=1:n for i=2:num U1=U(i,j); %第n次迭代时网格节点处的值 if j==1 %第n+1次迭代左边界第二类边界条件 U(i,j)=1/4*(2*U(i,j+1)+U(i-1,j)+U(i+1,j)); end if (j>1)&&(j U2=1/4*(U(i,j+1)+ U(i-1,j)+ U(i,j-1)+ U(i+1,j)); U(i,j)=U1+alpha*(U2-U1); %引入超松弛迭代因子后的网格节点处的值 end if i==n+1-j %第n+1次迭代两介质分界面（与网格对角线重合）第二类边界条件 U(i,j)=1/4*(2/(1+k)*(U(i,j+1)+U(i+1,j))+2*k/(1+k)*(U(i-1,j)+U(i,j-1))); end if j==n %第n+1次迭代右边界第二类边界条件 U(i,n)=1/4*(2*U(i,j-1)+U(i-1,j)+U(i+1,j)); end end end N=N+1 %显示迭代次数 Un1=U; %完成第n+1次迭代后所有节点处的值 err=abs((Un1-Un)./Un1);%第n+1次迭代与第n次迭代所有节点值的相对误差 err(1,1:n)=0; %上边界节点相对误差置零 err(n,1:n)=0; %下边界节点相对误差置零 G=sum(sum(err>deta))%显示每次迭代后不满足相对误差限要求的节点数目G end
标签： 有限差分
上传时间： 2018-07-13
上传用户：Kemin
