用一观测器从t=1秒开始对一个运动目标的距离进行连续地跟踪测量,假设观测的间隔为一秒钟,雷达到运动目标之间的距离为S(t)(1) 统计特性的初值为 (2)观测误差是与和均不相关的白噪声序列,并且有 (3)观测数据存放在附加的文件中(单位:m)。 要求:分析上述对象,建立系统模型,构造卡尔曼滤波器,编程计算,求: (1) 距离S(t)的最佳估计及估计误差, (2) 距离S(t-5)的最佳平滑及估计误差, (3) 距离S(t+5)的最佳预测及估计误差, (4) 对结果进行分析讨论。
上传时间: 2014-01-13
上传用户:qq21508895
计算机网络-系统方法 第三版 英文版 作 者: (美)彼德森(Peterson,L.L.) 等著 出 版 社: 机械工业出版社 出版时间: 2005-3-1 字 数: 版 次: 1 页 数: 813 印刷时间: 2005/03/01 开 本: 印 次: 纸 张: 胶版纸 I S B N : 9787111160564 包 装: 平装 所属分类: 图书 >> 计算机/网络 >> 计算机理论
上传时间: 2013-12-26
上传用户:weiwolkt
Visual 开发 希望对你们有帮助 public static int Rom(int n, int m)//双寄或双偶 { int count = 0 //第一排Y坐标上要几个 if (n < m) { for (int i = 1 i <= n i = i + 2) { count++ } } else { for (int j = 1 j <= m j = j + 2) { count++ } } return count }
上传时间: 2013-12-13
上传用户:懒龙1988
//初始化 initscr() //获得屏幕尺寸 getmaxyx(stdscr, h, w) //画背景 for(i=0 i<h i++) for(j=0 j<w j++){ mvaddch(i, j, ACS_CKBOARD) } refresh() //建立窗口 pad = newpad(80, 128) for(i=0 i<80 i++){ char line[128] sprintf(line, "This line in pad is numbered d\n", i) mvwprintw(pad, i, 0, line) } //刷新屏幕 refresh() prefresh(pad, 0, 1, 5, 10, 20, 45) for(i=0 i<50 i++){ prefresh(pad, i+1, 1, 5, 10, 20, 45) usleep(30000) } //等待按键 getch()
标签: getmaxyx initscr stdscr for
上传时间: 2014-08-30
上传用户:龙飞艇
This routine calls the glpk library to solve a LP/MIP problem. A typical LP problem has following structure: [min|max] C x s.t. Ax ["="|"<="|">="] b {x <= UB} {x >= LB} The calling syntax is: [XMIN,FMIN,STATUS,EXTRA]=glpkmex(SENSE,C,A,B,CTYPE,LB,UB,... VARTYPE,PARAM,LPSOLVER,SAVE)
标签: problem following routine library
上传时间: 2014-11-30
上传用户:changeboy
PHP 5 Advanced OOP and Design Patterns “I made up the term ‘object-oriented,’ and I can tell you I didn’t have C++ in mind.”—Alan Kay, OOPSLA ’97
标签: object-oriented and Advanced Patterns
上传时间: 2013-12-04
上传用户:zhliu007
A few years ago I became interested in first person shooter games and in particular how the world levels are created and rendered in real time. At the same time I found myself in between jobs and so I embarked on an effort to learn about 3D rendering with the goal of creating my own 3D rendering engine. Since I am a developer and not an artist I didn’t have the skills to create my own models, levels, and textures. So I decided to attempt to write a rendering engine that would render existing game levels. I mainly used information and articles I found on the web about Quake 2, Half Life, WAD and BSP files. In particular I found the Michael Abrash articles that he wrote for Dr. Dobbs magazine while working at Id to be very illuminating.
标签: interested particular shooter became
上传时间: 2013-12-13
上传用户:hanli8870
1.Describe a Θ(n lg n)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exist two elements in S whose sum is exactly x. (Implement exercise 2.3-7.)
上传时间: 2017-04-01
上传用户:糖儿水嘻嘻
1.Describe a Θ(n lg n)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exist two elements in S whose sum is exactly x. (Implement exercise 2.3-7.) #include<stdio.h> #include<stdlib.h> void merge(int arr[],int low,int mid,int high){ int i,k; int *tmp=(int*)malloc((high-low+1)*sizeof(int)); int left_low=low; int left_high=mid; int right_low=mid+1; int right_high=high; for(k=0;left_low<=left_high&&right_low<=right_high;k++) { if(arr[left_low]<=arr[right_low]){ tmp[k]=arr[left_low++]; } else{ tmp[k]=arr[right_low++]; } } if(left_low<=left_high){ for(i=left_low;i<=left_high;i++){ tmp[k++]=arr[i]; } } if(right_low<=right_high){ for(i=right_low;i<=right_high;i++) tmp[k++]=arr[i]; } for(i=0;i<high-low+1;i++) arr[low+i]=tmp[i]; } void merge_sort(int a[],int p,int r){ int q; if(p<r){ q=(p+r)/2; merge_sort(a,p,q); merge_sort(a,q+1,r); merge(a,p,q,r); } } int main(){ int a[8]={3,5,8,6,4,1,1}; int i,j; int x=10; merge_sort(a,0,6); printf("after Merging-Sort:\n"); for(i=0;i<7;i++){ printf("%d",a[i]); } printf("\n"); i=0;j=6; do{ if(a[i]+a[j]==x){ printf("exist"); break; } if(a[i]+a[j]>x) j--; if(a[i]+a[j]<x) i++; }while(i<=j); if(i>j) printf("not exist"); system("pause"); return 0; }
上传时间: 2017-04-01
上传用户:糖儿水嘻嘻
function y=lagr(x0,y0,x) %x0,y0为节点 %x是插值点 n=length(x0); m=length(x); for i=1:m z=x(i); s=0.0; for k=1:n p=1.0; for j=1:n if j~=k p=p*(z-x0(j))/(x0(k)-x0(j)); end end s=p*y0(k)+s; end y(i)=s; end
标签: lagr
上传时间: 2020-06-09
上传用户:shiyc2020