Welcome![Sign In][Sign Up]
Location:
Search - DT-D

Search list

[Other resourceshellsort111

Description: 附有本人超级详细解释(看不懂的面壁十天!) 一、 实际问题: 希尔排序(Shell Sort)是插入排序的一种。因D.L.Shell于1959年提出而得名。它又称“缩小增量分类法”,在时间效率上比插入、比较、冒泡等排序算法有了较大改进。能对无序序列按一定规律进行排序。 二、数学模型: 先取一个小于n的整数d1作为第一个增量,把文件的全部记录分成d1个组。所有距离为dl的倍数的记录放在同一个组中。先在各组内进行直接插人排序;然后,取第二个增量d2<d1重复上述的分组和排序,直至所取的增量dt=1(dt<dt-l<…<d2<d1),即所有记录放在同一组中进行直接插入排序为止。该方法实质上是一种分组插入方法。 三、算法设计: 1、将相隔某个增量dlta[k]的元素构成一个子序列。在排序过程中,逐次减小这个增量,最后当h减到1时,进行一次插入排序,排序就完成。增量序列一般采用:dlta[k]=2t-k+1-1,其中t为排序趟数,1≤k≤t≤[log2 (n+1)],其中n为待排序序列的长度。按增量序列dlta[0..t-1]。 2、按增量dlta[k](1≤k≤t≤[log2 (n+1)])进行一趟希尔插入排序。 3、在主函数中控制程序执行流程。 4、时间复杂度:1≤k≤t≤[log2 (n+1)]时为O(n3/2)。 -with super detailed explanation (not read the Wall for 10 days!) A practical question : Sort Hill (Shell Sort) is inserted into a sort. By D. L. Shell made in 1959 and named after. It is also known as the "narrow incremental method" in the time-efficient than inserted, such as sorting algorithms and bubbling there has been a big improvement. The disorder can sequence by law must rank. Two mathematical models : first getting a less than n integers d1 as an increment. all documents should be recorded into d1 groups. All distance dl in multiples of record on the same group. In the first group for direct insertion sorting; Then, take a second increment d2
Platform: | Size: 19421 | Author: 乐乐 | Hits:

[Other resourceztwd

Description: 电力系统在台稳定计算式电力系统不正常运行方式的一种计算。它的任务是已知电力系统某一正常运行状态和受到某种扰动,计算电力系统所有发电机能否同步运行 1运行说明: 请输入初始功率S0,形如a+bi 请输入无限大系统母线电压V0 请输入系统等值电抗矩阵B 矩阵B有以下元素组成的行矩阵 1正常运行时的系统直轴等值电抗Xd 2故障运行时的系统直轴等值电抗X d 3故障切除后的系统直轴等值电抗 请输入惯性时间常数Tj 请输入时段数N 请输入哪个时段发生故障Ni 请输入每时段间隔的时间dt-power system stability in the Taiwan Power computing system is not the normal operating mode of calculation. Its mission is a known power system uptime status and be subject to some disturbance, computing power system all synchronous generator can run an operation Note : Please enter the initial power S0, shaped like a bi Please enter the infinite system bus voltage V0 Please enter the system equivalent reactance matrix B matrix B group has the following elements the line matrix into a normal operation of the system straight axis equivalent reactance Xd two fault systems running straight axis equivalent reactance X d 3 after resection of the fault system straight axis equivalent reactance Please enter the inertial time constant Tj Please enter the number of hours which N Please enter a tim
Platform: | Size: 1107 | Author: 魏鹏 | Hits:

[OtherMoNiJiaYouZhanDuiLie

Description: 模拟加油站队列 某汽车加油站有两台油泵,每台油泵为一辆汽车加油需d分钟(浮点型),现已知此加油站来车率为1/q分钟(q整型),现用计算机模拟此加油站的工作方式,假设模拟时间长度为longtime(整型)分钟,并用步长法模拟,取采样时间间隔为dt(浮点型)分钟。经典的队列问题,可供初学者熟悉队列的操作 运行后输入d,q,longtime,dt(用空格隔开)即可
Platform: | Size: 1148 | Author: XY Z | Hits:

[AlgorithmMAIN 3-DIMENSIONAL CFD-PROGRAM

Description:

 

#//u(i,j)        x方向的速度u;或者θ方向速度
#//u(i,j)        y方向的速度v;或者径向速度ur'h\K
#//pc(i,j)       压力修正 p'[OS
#//p(i,j)        压力p-=5-+
#//p(i,j)        密度ρBk
#//p(i,j)        扩散系数γQ"G48E
#//t(i,j)        温度Tn7/bKr
#//ake(i,j)        湍流脉动能量k971E
#//dis(i,j)      动能的耗散率ε4
 
//amut(i,j)     湍动扩散系数+
//gen(i,j)      湍流能量的生成率S
//f(i,jnf)     不同的φ变量M
//lsolve(nf)   1,求解变量f(i,j,nf)  8
//lprint(nf)   1,打印变量f(i,j,nf)   ~f
//lblk(nf)     1,对变量f(i,j,nf)应用块修正b5|{@U
//mode         选择坐标系的变量. 目前只支持mode=1.
mode=1 直角坐标系(x~y)BMI
mode=2 圆柱坐标系(r~z)^pg>)
mode=3 极坐标(r~θ)   Z^r[LE
solve子程序中求解变量f(i,j,nf)的重复扫描次数 b
变量fi,j,nf)的字符性标题 |L;
 
//xl    计算区域在x方向上的宽度)?
//yl    计算区域在y方向上的宽度@ob
//l1     x方向上主控制体的网格数。也是x方向上压力节点位置的最后一个i值。
//m1   y方向上主控制体的网格数。也是y方向上压力节点位置的最后一个j值。
//dt           时间步长 △t
//第三部分网格设定的变量
//x(i)        节点位置的x
//xu(i)       主控制容积在x方向的界面位置,即速度u(i,j)所在位置
//xdif(i)     差值 x(i)-x(i-1)
 //xcv(i)      主控制容积在x方向上的宽度
//xcvs(i)     速度u(i,j)的控制容积在x方向上的宽度
//y(j)        节点位置的y
//yv(j)       主控制容积在y方向的界面位置,即速度v(i,j)所在位置
//ydif(j)     差值 y(j)-x(j-1)
//ycv(j)      主控制容积在y方向上的宽度
//ycvs(j)     速度v(i,j)的控制容积在y方向上的宽度
////r(i,j)      主网络节点的半径r
////rmn(j)      在速度v(i,j)所在处的半径r之值
////sx (j)      主网格节点位置y(j)x方向上的标尺因子
//sxmn(j)     在界面位置yv(j)x方向的尺度因子
       //上面四个变量应用于非直角坐标系的情况
//xcvi(i,j)   xcv(i) 中与u(i,j)的控制容积相覆盖的部分
//xcvi(i,j)   xcv(i) 中与u(i+1,j)的控制容积相覆盖的部分
//ycvr(j)     主控制容积垂直于x方向的面的面积
//ycvrs(j)    速度v(i,j)的控制容积垂直于x方向的面的面积
//arx(j)      x方向相垂直的控制容积的面积
//arxj(j)     arx(j)中与速度v(i,j)的控制容积相覆盖的部分
//arxjp(j)    arx(j)中与速度v(i,j+1)的控制容积相覆盖的部分
//arxjarjxp实际上对应于x方向上的ycviycvip
 
//第四部分差分方程系数设定的变量
//con(i,j)    离散方程中的常数项b,在子程序gamsor中又作为存储sc的单元
//aip(i,j)    系数ae
//aim(i,j)    系数aw
//ajp(i,j)    系数an
//ajm(i,j)    系数as
//ap(i,j)     系数ap,在在子程序gamsor中又作为存储sp的单元
//flow         穿过控制容积界面的质量流率
//diff         扩散传导性 D
//acof         DIFLOW子程序计算的量,它给出了对流与扩散作用的联合影响
 
//第五部分求解差分方程过程中的变量求解
//du(i,j)     影响u(i,j)de
//dv(i,j)     影响v(i,j)dn
//pv(j)       用于计算主网络节点i,j上的质量流率的ρvr的插值因子:计算式如下: //fvp(j)      说明同上
//fx(i)       用于计算主控制容积界面(即速度u(i,j)所在处)的密度
 
//            rhom的插值因子,计算式如下:
 
//fxm(i)      说明同上
//pt(i)pt(j) tdma中的转换系数(消元过程中)l
//qt(i)qt(j) tdma中的转换系数(消元过程中)
//第六部分 index变量
int nf;               //nf           标明不同φ变量的下标值
int nfmax;         //nfmax        设有存储单元的nf的最大值
int np;              //(nfmax)      p(i,j)实际为f(i,j,nfmax)
int nrho;           //(nfmax+1)    rho(i,j)实际为f(i,j,nfmax)
int ngam;         //(nfmax+2)    gam(i,j)实际为f(i,j,nfmax+2)n
int l2;              //l2           (l1-1)
int l3;              //l3           (l1-2)
int m2;           //m2           (m1-1)
int m3;           //m3           (m1-2) 2
int ist;                    //ist          i的第一个内节点值`
int jst;                    //jst          j的第一个内节点值
int iter;                   //iter         不稳态问题的步进计数
int last;                   //last         用户所规定的最大迭代计数
int iter1;             //iter1        一个时间点求解setup2( )的迭代次数
double time;              //time         不稳态问题中的时间t
int ipref;              //ipref        压力参考结点的i
int jpref;                //jpref        压力参考结点的j=/
 
//第七部分其它变量
double rhocon;           //rhocon       密度为常数的问题中的ρ
int lstop;                 //lstop        =1时,停止计算
double  smax;            //smax         p'方程中的质源的最大值

double  ssum;            //ssum         p'方程中的质源的代数和


Platform: | Size: 11439 | Author: tanglincn | Hits:

[OAOA协同

Description: <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head id="ctl00_Head1"><title> 协同办公系统 </title><link rel="Stylesheet" type="text/css" href="CSS/master.css" /> <link rel="Stylesheet" type="text/css" href="CSS/sitecooperateCss.css" /> <style type="text/css"> .Task_Default_Grid { border:0} .Task_Default_Grid tr td { height:25px; line-height:25px; color:#0173BC; border:0; color:#6E6F71} .Task_Default_Grid tr td a { color:#0073BC} .Task_Default_Title { height:25px; line-height:25px; border-bottom:1px solid #999; color:#333333; font-weight:bold } .Task_Default_Head { height:25px; line-height:25px; text-align:left; font-weight:lighter; } .Task_Default_Head th { text-align:left; border:0;} #Content_right tr td { vertical-align:top} .mobanul { list-style:none; list-style-type:none; margin:0; padding:0} .mobanul li { height:26px; line-height:26px;} .mobanul li a { color:#0073BC} </style> <script type="text/javascript"> var w1 = screen.width; var w2 = w1 - 30; var h1 = screen.height; var h2 = 650; var t1 = (h1 - h2) / 3; //var appearence = 'dependent:yes;menubar:no;resizable:no;status:no;toolbar:no;titlebar:no;left:5;top:50;dialogWidth:'+w2+'px; dialogHeight:602px'; var appearence = 'dependent:yes;menubar:no;resizable:no;status:no;toolbar:no;titlebar:no;dialogWidth:990px; dialogHeight:652px'; function openexamin(id) { var url = 'Task_Examin1.aspx?ID=' + id + '&dt=20111116110724'; window.showModalDialog(url, 'none', appearence); window.location.reload(); } function opengoexamin(id) { var url ='go_examin.aspx?ID=' + id + '&dt=20111116110724'; window.showModalDialog(url, "tasknew", appearence); window.location.reload(); } function openexaminview(id) { var url = 'Go_Examin1.aspx?ID=' + id; window.showModalDialog(url, "goexamin1", appearence); window.location.reload(); } function openexamindaiban(id) { var url = 'Task_Examin1.aspx?daiban=1&ID=' + id + '&dt=20111116110724'; window.showModalDialog(url, 'none', appearence); window.location.reload(); } function openexamindaiban1(id, tasktype,url) { if (tasktype == 'OA') { var url1 = 'Task_Examin1.aspx?daiban=1&ID=' + id + '&dt=20111116110724'; window.showModalDialog(url1, 'none', appearence); window.location.reload(); } else if (tasktype == 'HR') { window.open(url.replace('{', '=').replace('{', '=').replace('{', '=').replace('{', '=').replace('{', '=').replace('{', '=').replace('{', '=')); } else if (tasktype == 'ERP待办') { window.open("http://10.0.3.100:8000/"+url); } else { window.open(url.replace('{', '=').replace('{', '=').replace('{', '=').replace('{', '=').replace('{', '=').replace('{', '=').replace('{', '=').replace('}', '&').replace('}', '&').replace('|', '&').replace('|', '&').replace('|}', '&').replace('|', '&').replace('|', '&').replace('|', '&').replace('*', '/').replace('*', '/').replace('*', '/').replace('*', '/').replace('*', '/')); // window.open(url.replace(new RegExp('|', 'g'), '=')); } } function GetTasksWait() { document.getElementById('ajaxwait').innerHTML = "<img src='/_layouts/images/loading.gif' align=absmiddle style='margin:20px' /><span style='color:#666'>正在加载待办事项,请稍等</span>"; AjaxService.GetWaitTasks("panr", GetGetWaitTasks); } function GetGetWaitTasks(res) { document.getElementById('ajaxwait').innerHTML = res; //window.alert(res); } function TaskNew(templetid) { var url = "task_new1.aspx?templetid="+templetid; var w1 = screen.width; var w2 = w1 - 30; var h1 = screen.height; var h2 = 650; var t1 = (h1 - h2) / 3; var appearence = 'dependent=yes,menubar=no,resizable=no,status=no,toolbar=no,titlebar=no,left=5,top=50,width=965px,height=620px'; var openWindow = window.open(url, "tasknew", appearence); openWindow.focus(); } </script> </head> <body> <form name="aspnetForm" method="post" action="thinkanydefault.aspx" id="aspnetForm"> <div> <input type="hidden" name="__EVENTTARGET" id="__EVENTTARGET" value="" /> <input type="hidden" name="__EVENTARGUMENT" id="__EVENTARGUMENT" value="" /> <input type="hidden" name="__VIEWSTATE" id="__VIEWSTATE" value="/wEPDwUJMTk4NTM3MDU4D2QWAmYPZBYCAgMPZBYCAgEPZBYCAgEPPCsADQEADxYEHgtfIURhdGFCb3VuZGceC18hSXRlbUNvdW50ZmRkGAEFI2N0bDAwJENvbnRlbnRQbGFjZUhvbGRlcjEkZ3JpZFRyYWRlDzwrAAoBCGZkgVPWq+n+ib9NI98bYSPgOP6wYjA=" /> </div> <script type="text/javascript"> //<![CDATA[ var theForm = document.forms['aspnetForm']; if (!theForm) { theForm = document.aspnetForm; } function __doPostBack(eventTarget, eventArgument) { if (!theForm.onsubmit || (theForm.onsubmit() != false)) { theForm.__EVENTTARGET.value = eventTarget; theForm.__EVENTARGUMENT.value = eventArgument; theForm.submit(); } } //]]> </script> <script src="/WebResource.axd?d=YUjlm6ycKfnreIke4GK3XQ2&amp;t=633802920069218315" type="text/javascript"></script> <script src="/ScriptResource.axd?d=z3KJcVLT9ijw1U1WP3pQFkrXumDsg6wUOC-1ek6Qo_XZeAuKvPuCDOgdKKFxxdmnnoXJFiMaKmNKva15-BdwOk_xeIPnLbrAuAMPt7xuJyY1&amp;t=ffffffffec2d9970" type="text/javascript"></script> <script src="/ScriptResource.axd?d=z3KJcVLT9ijw1U1WP3pQFkrXumDsg6wUOC-1ek6Qo_XZeAuKvPuCDOgdKKFxxdmnNTUAczOieuXP3zVeTLUjHd_cyvM_8TdB3KcMk-B-U6vUhv5N_CQBxFd9ZErk2oN20&amp;t=ffffffffec2d9970" type="text/javascript"></script> <script src="AjaxService.asmx/js" type="text/javascript"></script> <div id="Content_right" style="background-image:none; padding:5px; padding-left:0px; padding-right:0px"> <script type="text/javascript"> //<![CDATA[ Sys.WebForms.PageRequestManager._initialize('ctl00$ContentPlaceHolder1$ScriptManagerAjax', document.getElementById('aspnetForm')); Sys.WebForms.PageRequestManager.getInstance()._updateControls([], [], [], 90); //]]> </script> <table style="width:100%"> <tr> <td style="padding-left:10px;"> <span style="float:left">&nbsp;待办事项</span><br /><hr style="height:0px; color:#fff; border-top:1px solid #EBEBEB;" /></td> <td style="padding-left:10px;"> <span style="float:left">&nbsp;跟踪事项</span><br /><hr style="height:0px; color:#fff; border-top:1px solid #EBEBEB;" /></td> </tr> <tr> <td style=" padding-top:0; width:49%; padding-left: 10px; padding-right: 10px; padding-bottom: 10px;" rowspan="4" id="ajaxwait"> </td> <td style=" padding:10px; padding-top:0;height:145px;"> <div> </div> </td> </tr> <tr> <td style=" padding:10px; padding-top:0; text-align:right"> <a href="OATaskTrades.aspx" style='color:#0171BD'>[更多...]</a></td> </tr> <tr> <td style="padding-left:10px;"> &nbsp;我的模板<br /><hr style="height:0px; color:#fff; border-top:1px solid #EBEBEB;" /></td> </tr> <tr> <td style=" padding:10px; padding-top:0;"> <table cellpadding=0 cellspacing=0 style="width:100%;height:145px;"><tr><td style="width:50%"> <ul class="mobanul"></ul> </td><td> <ul class="mobanul"></ul> </td></tr></table> </td> </tr> <tr> <td style=" padding:10px; padding-top:0; width:49%; text-align:right"> <a href="Task_Wait.aspx" style='color:#0171BD'>[更多OA待办...]</a></td> <td style=" padding:10px; padding-top:0; text-align:right"> <a href='PersonalTempletsSetup.aspx' style='color:#0171BD'>[更多...]</a><a href='PersonalTempletsSetup.aspx' style='color:#0171BD'>[模板配置]</a></td> </tr> </table> <script type="text/javascript"> GetTasksWait(); </script> </div> <script type="text/javascript"> //<![CDATA[ Sys.Application.initialize(); //]]> </script> </form> </body> </html>
Platform: | Size: 8895 | Author: niyang2005@126.comni | Hits:

[SCM9200send

Description: DTMF编码芯片HT9200的51接口程序。输入参数R2表示发送数据个数,输入数据与发送数据与DTMF码的关系:00H-0 01H-1 02H-2 03H-3 04H-4 05H-5 06H-6 07H-7 08H-8 09H-9 0AH-A 0BH-B 0CH-C 0DH-D 0EH-* 0FH-#。详细说明参考文件内-DTMF encoder chip HT9200 51 interface program. R2 said input parameters to send data distribution, data entry and send data with the DTMF code : 00H-0 01H- 02H-2 Mr- 3 in the 04H-4 05H-5 06H-6 07H-7 08H-8 7-9 0AH-A 0BH- 0CH B-C 0DH-D 0EH-* 0FH-#. Detailed information paper
Platform: | Size: 1024 | Author: 许赞龙 | Hits:

[Data structsshellsort111

Description: 附有本人超级详细解释(看不懂的面壁十天!) 一、 实际问题: 希尔排序(Shell Sort)是插入排序的一种。因D.L.Shell于1959年提出而得名。它又称“缩小增量分类法”,在时间效率上比插入、比较、冒泡等排序算法有了较大改进。能对无序序列按一定规律进行排序。 二、数学模型: 先取一个小于n的整数d1作为第一个增量,把文件的全部记录分成d1个组。所有距离为dl的倍数的记录放在同一个组中。先在各组内进行直接插人排序;然后,取第二个增量d2<d1重复上述的分组和排序,直至所取的增量dt=1(dt<dt-l<…<d2<d1),即所有记录放在同一组中进行直接插入排序为止。该方法实质上是一种分组插入方法。 三、算法设计: 1、将相隔某个增量dlta[k]的元素构成一个子序列。在排序过程中,逐次减小这个增量,最后当h减到1时,进行一次插入排序,排序就完成。增量序列一般采用:dlta[k]=2t-k+1-1,其中t为排序趟数,1≤k≤t≤[log2 (n+1)],其中n为待排序序列的长度。按增量序列dlta[0..t-1]。 2、按增量dlta[k](1≤k≤t≤[log2 (n+1)])进行一趟希尔插入排序。 3、在主函数中控制程序执行流程。 4、时间复杂度:1≤k≤t≤[log2 (n+1)]时为O(n3/2)。 -with super detailed explanation (not read the Wall for 10 days!) A practical question : Sort Hill (Shell Sort) is inserted into a sort. By D. L. Shell made in 1959 and named after. It is also known as the "narrow incremental method" in the time-efficient than inserted, such as sorting algorithms and bubbling there has been a big improvement. The disorder can sequence by law must rank. Two mathematical models : first getting a less than n integers d1 as an increment. all documents should be recorded into d1 groups. All distance dl in multiples of record on the same group. In the first group for direct insertion sorting; Then, take a second increment d2
Platform: | Size: 19456 | Author: 乐乐 | Hits:

[Algorithmztwd

Description: 电力系统在台稳定计算式电力系统不正常运行方式的一种计算。它的任务是已知电力系统某一正常运行状态和受到某种扰动,计算电力系统所有发电机能否同步运行 1运行说明: 请输入初始功率S0,形如a+bi 请输入无限大系统母线电压V0 请输入系统等值电抗矩阵B 矩阵B有以下元素组成的行矩阵 1正常运行时的系统直轴等值电抗Xd 2故障运行时的系统直轴等值电抗X d 3故障切除后的系统直轴等值电抗 请输入惯性时间常数Tj 请输入时段数N 请输入哪个时段发生故障Ni 请输入每时段间隔的时间dt-power system stability in the Taiwan Power computing system is not the normal operating mode of calculation. Its mission is a known power system uptime status and be subject to some disturbance, computing power system all synchronous generator can run an operation Note : Please enter the initial power S0, shaped like a bi Please enter the infinite system bus voltage V0 Please enter the system equivalent reactance matrix B matrix B group has the following elements the line matrix into a normal operation of the system straight axis equivalent reactance Xd two fault systems running straight axis equivalent reactance X d 3 after resection of the fault system straight axis equivalent reactance Please enter the inertial time constant Tj Please enter the number of hours which N Please enter a tim
Platform: | Size: 1024 | Author: 魏鹏 | Hits:

[Internet-Networkdelphi_demo

Description: DSC(Data Service Center)是用于接收DTU数据和向DTU发送数据的服务软件,和DTU之间通讯使用开发包动态库gprs_dll.dll,该文件包括和DTU通讯所需要的全部API函数,包括服务的启动、数据发送、数据接收、关闭服务等,DSC实际上是架构在gprs_dll.dll所提供的功能之上的数据处理软件,其所需要完成的功能如下: 1、 调用API启动服务和停止服务; 2、 调用API接收数据和向DTU发送数据,并且对数据作进一步处理; 3、 调用API轮询DTU用户列表,如果需要可作进一步处理,包括用户认证等; 4、 调用API对DTU进行远程配置 -DSC (Data Service Center) is used to receive data and to the DTU DT U send data services software, and communications between the DTU use development kits gprs_dll.dll DLL, the documents include communications and DTU need all API function, including the launch, data sending, receiving data, the closure of services, DSC is actually in gprs_dll.dll framework provided by the above functions of data processing software, they need to complete the following functions : 1, API calls to stop and restart services; 2. API call and receive data to the DTU send data, as well as data for further processing; 3. Call API Polling DTU user list, if necessary, for further processing, including user authentication; 4. Calling the API for remote configuration DTU
Platform: | Size: 321536 | Author: aspdotnet | Hits:

[OtherMoNiJiaYouZhanDuiLie

Description: 模拟加油站队列 某汽车加油站有两台油泵,每台油泵为一辆汽车加油需d分钟(浮点型),现已知此加油站来车率为1/q分钟(q整型),现用计算机模拟此加油站的工作方式,假设模拟时间长度为longtime(整型)分钟,并用步长法模拟,取采样时间间隔为dt(浮点型)分钟。经典的队列问题,可供初学者熟悉队列的操作 运行后输入d,q,longtime,dt(用空格隔开)即可-Simulation of an automobile gas station gas station queue has two pumps, each pump for a vehicle refueling takes d minutes (floating-point type), now known that this gas station to car rate of 1/q min (q integer), Computer simulation is used in this work stations, assuming that the length of time for the simulation of longtime (integer) minutes, and step-size simulation, check the sampling time interval dt (floating-point type) minutes. Queue classic problem for beginners familiar with the operation of the queue to run after the input d, q, longtime, dt (separated by spaces) can
Platform: | Size: 1024 | Author: XY Z | Hits:

[OtherGA__MATLAB

Description: 探讨了在 Mh T I AB环境中实现遗传算法仿真 的方法 , 并 以一个 简单的求函数最值的问 题作为遗传算法的应用实铡, 说明遗传算法的全局寻优性及用 M AI I AB实现仿真的可行性。-A me f l ~dt o r e Aa z e g e me f i e t I 皿 i n MKI I AB i s d ~- u s s e d.A ha e t i o ~o p t h r f i z a f i o n p r o b l e m i s p r e s e n t e d t o d l m: l o ml r a t et h e 龉 l y Ⅱ 面 me t h o d 翘 we l l翘 d e m咖曲越i t h e g l o b a l。 n 】 i 越d 衄 f i mc f ima l i t y g e n e t i c~ a g o- r i t h m
Platform: | Size: 97280 | Author: 阿铁 | Hits:

[OtherDT

Description: 实时接收VC++程序Debug和Release下的自定义调试输出,可以极大的方便程序的调试. 用法(以CTestMFCApp为例): 在TestMFCApp的stdafx.h中加入#include "dt_2005.h" 在.cpp需要输出调试信息的代码行加入 DT("hello,year d",2009) DW("This is a warning msg") DE("error") 用DT.exe来接收输出的信息 DT用来输出一般信息, DW用来输出警告信息,以粉红色文字显示 DE用来输出错误信息,以红色文字显示 在DT.exe中会显示文件名和行号.-Receive real-time VC++ program under Debug and Release custom debug output, you can greatly facilitate the process of debugging. Usage (as an example to CTestMFCApp): In stdafx.h add TestMFCApp the# include " dt_2005.h" in. cpp need to output debugging information by adding lines of code DT ( " hello, year d" , 2009) DW ( " This is a warning msg" ) DE ( " error" ) with DT.exe information to receive the output DT general information to the output, DW used to output a warning message to show pink text DE to output error message in red text will appear in the show DT.exe file name and line number.
Platform: | Size: 101376 | Author: xwp | Hits:

[Special Effectsdtcwpt

Description: 2-band discrete wavelet transform (DWT) Dual-Tree Complex Wavelet Packet-The 2-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be ‘optimal’ for a given signal. The discrete wavelet packet transform (DWPT) provides a dictionary of bases over which one can search for an optimal representation (without constraining the analysis to an octave-band one) for the signal at hand. However, it is well known that both the DWT and the DWPT are shift-varying. Also, when these transforms are extended to 2-D and higher dimensions using tensor products, they do not provide a geometrically oriented analysis. The dual-tree complex wavelet transform (DT-CWT), introduced by Kingsbury, is approximately shift-invariant and provides directional analysis in 2-D and higher dimensions. In this paper, we propose a method to implement a dual-tree complex wavelet packet transform (DTCWPT), extending the DT-CWT as the DWPT extends the DWT. To find the best complex wavelet packet frame for a given signal, w
Platform: | Size: 4096 | Author: 王方 | Hits:

[Communication-Mobilefskgenerator1

Description: Cross – Correlation of the Two FSK Signals. FREQUENCY SHIFT KEYING - ERROR PROBABILITY: The Probability of error of an FSK system depends on the separation of “distance” d, between two (or more) signals The probability of error is minimum when the distance of separation is maximum i.e larger the d, smaller is the P.E. The distance d is given by: d = (1 -  ) / 2 where  = (1 / E) 0 T s0(t) s1(t) dt. The integral is the cross-correlation function over the period 0 to T.  is restricted to values between +1 and –1. -Cross – Correlation of the Two FSK Signals. FREQUENCY SHIFT KEYING - ERROR PROBABILITY: The Probability of error of an FSK system depends on the separation of “distance” d, between two (or more) signals The probability of error is minimum when the distance of separation is maximum i.e larger the d, smaller is the P.E. The distance d is given by: d = (1-  )/2 where  = (1/E) 0 T s0(t) s1(t) dt. The integral is the cross-correlation function over the period 0 to T.  is restricted to values between+1 and –1.
Platform: | Size: 6144 | Author: patatas | Hits:

[Waveletdt-dwt_D

Description: 双树复数小波变换的Matlab程序的D部分,全部解压到同一个文件夹下后可直接调用函数-Dual-Tree Complex Wavelet Transform Matlab for the D part of the procedure, all extract to the same folder can be a direct call function
Platform: | Size: 13312 | Author: suxiaoyuan | Hits:

[OtherNoise

Description: 在电子系统设计中,为了少走弯路和节省时间,应充分考虑并满足抗干扰性 的要求,避免在设计完成后再去进行抗干扰的补救措施。形成干扰的基本要素有三个: (1)干扰源,指产生干扰的元件、设备或信号,用数学语言描述如下:du/dt, di/dt大的地方就是干扰源。如:雷电、继电器、可控硅、电机、高频时钟等都可 能成为干扰源。 (2)传播路径,指干扰从干扰源传播到敏感器件的通路或媒介。典型的干扰传 播路径是通过导线的传导和空间的辐射。 (3)敏感器件,指容易被干扰的对象。如:A/D、D/A变换器,单片机,数字IC, 弱信号放大器等。 -Fingerprint sensor chip FCD4B14 with 8' 280 = 2240 pixels, pixel size of 50 μm' 50 μm = 500dpi pixel clock up to 2MHz, 1780frame/s. This article describes the structure of the chip, principle and application features.
Platform: | Size: 5120 | Author: simon | Hits:

[matlabForcedPendulum

Description: This simulink model simulates the damped driven pendulum, showing it s chaotic motion. theta = angle of pendulum omega = (d/dt)theta = angular velocity Gamma(t) = gcos(phi) = Force omega_d = (d/dt) phi Gamma(t) = (d/dt)omega + omega/Q + sin(theta) Play with the initial conditions (omega_0, theta_0, phi_0 = omega(t=0), theta(t=0), phi(t=0)) and the system parameters (g, Q, omega_d) and the solver parameters/method. Chaos can be seen for Q=2, omega_d=w/3. The program outputs to Matlab time, theta(time) & omega(time). Plot the phase space via: plot(mod(theta+pi, 2*pi)-pi, omega, . ) Plot the Poincare sections using: t_P = (0:2*pi/omega_d:max(time)) plot(mod(spline(time, theta+pi, t_P), 2*pi)-pi, spline(time, omega, t_P), . ) System is described in: "Fractal basin boundaries and intermittency in the driven damped pendulum" E. G. Gwinn and R. M. Westervelt PRA 33(6):4143 (1986) -This simulink model simulates the damped driven pendulum, showing it s chaotic motion. theta = angle of pendulum omega = (d/dt)theta = angular velocity Gamma(t) = gcos(phi) = Force omega_d = (d/dt) phi Gamma(t) = (d/dt)omega+ omega/Q+ sin(theta) Play with the initial conditions (omega_0, theta_0, phi_0 = omega(t=0), theta(t=0), phi(t=0)) and the system parameters (g, Q, omega_d) and the solver parameters/method. Chaos can be seen for Q=2, omega_d=w/3. The program outputs to Matlab time, theta(time) & omega(time). Plot the phase space via: plot(mod(theta+pi, 2*pi)-pi, omega, . ) Plot the Poincare sections using: t_P = (0:2*pi/omega_d:max(time)) plot(mod(spline(time, theta+pi, t_P), 2*pi)-pi, spline(time, omega, t_P), . ) System is described in: "Fractal basin boundaries and intermittency in the driven damped pendulum" E. G. Gwinn and R. M. Westervelt PRA 33(6):4143 (1986)
Platform: | Size: 8192 | Author: Mike Gao | Hits:

[Windows DevelopDT_1.02C

Description: dT source code :D great-games
Platform: | Size: 69632 | Author: ezequiel | Hits:

[matlabNew-Text-Document-(2)

Description: he form of the Burgers equation considered here is: du du d^2 u -- + u * -- = nu * ----- dt dx dx^2 for -1.0 < x < +1.0, and 0.0 < t. Initial conditions are u(x,0) = - sin(pi*x). Boundary conditions are u(-1,t) = u(+1,t) = 0. The viscosity parameter nu is taken to be 0.01 / pi, although this is not essential. The authors note an integral representation for the solution u(x,t), and present a better version of the formula that is amenable to approximation using Hermite quadrature. This program library does little more than evaluate the exact solution at a user-specified set of points, using the quadrature rule. Internally, the order of this quadrature rule is set to 8, but the user can easily modify this value if greater accuracy is desired. -he form of the Burgers equation considered here is: du du d^2 u -- + u * -- = nu * ----- dt dx dx^2 for -1.0 < x < +1.0, and 0.0 < t. Initial conditions are u(x,0) = - sin(pi*x). Boundary conditions are u(-1,t) = u(+1,t) = 0. The viscosity parameter nu is taken to be 0.01 / pi, although this is not essential. The authors note an integral representation for the solution u(x,t), and present a better version of the formula that is amenable to approximation using Hermite quadrature. This program library does little more than evaluate the exact solution at a user-specified set of points, using the quadrature rule. Internally, the order of this quadrature rule is set to 8, but the user can easily modify this value if greater accuracy is desired.
Platform: | Size: 1024 | Author: alicethe | Hits:

[3D GraphicDT-method

Description: 基于数字距离变换的三D模型骨架提取算法在获得三维模型体素表示的基础上,通过比较模型体素及其26连通域体素到模型轮廓的最小欧 式距离,提出了一种利用骨架体素26连通域的对称性进行三维模型骨架体素提取的算法·整个算法只需遍 历一次体数据集即可自动完成模型骨架的提取过程.实验表明,该算法具有较高的效率和精度 -Three-D model of stock price based on the digital distance transform algorithm
Platform: | Size: 70656 | Author: 万雅娟 | Hits:
« 12 »

CodeBus www.codebus.net