该模型采用滞环控制技术，通过将逆变器输出电流与理想参考电流比较后，得到理想的输出电流波形。跟踪效果较好。
标签： matlab
上传时间： 2020-05-13
上传用户：CCTV
LTE-Advanced becomes a truly global standard for 4G cellular communications. Relay, as one of the key technologies of LTE-Advanced, can significantly extend the coverage, and improve the system throughput. LTE-A standards and tech- nologies were described in several recent books where the limited pages for relay feature prevent the detailed explanations of the technology. In this book, we tried to provide an in-depth description of LTE-A relay development. More specifically, significant portions are spent on relay channel modeling and potential technologies during the study item phase of the development, although some of those tech- nologies, such as Type 2 cooperative relay, multi-hop relay, relay with backhaul of carrier aggregation, were not standardized in Release 10 LTE.
标签： LTE-Advanced Technology Relay
上传时间： 2020-05-27
上传用户：shancjb
When 3GPP started standardizing the IMS a few years ago, most analysts expected the number of IMS deploymentsto grow dramatically as soon the initial IMS specifications were ready (3GPP Release 5 was functionallyfrozenin the first half of 2002and completedshortly after that). While those predictions have proven to be too aggressive owing to a number of upheavals hitting the ICT (Information and Communications Technologies) sector, we are now seeing more and more commercial IMS-based service offerings in the market. At the time of writing (May 2008), there are over 30 commercial IMS networks running live traffic, addingup to over10million IMS users aroundthe world; the IMS is beingdeployedglobally. In addition, there are plenty of ongoing market activities; it is estimated that over 130 IMS contracts have been awarded to all IMS manufacturers. The number of IMS users will grow substantially as these awarded contracts are launched commercially. At the same time, the number of IMS users in presently deployed networks is steadily increasing as new services are introduced and operators running these networks migrate their non-IMS users to their IMS networks.
标签： Multimedia Subsystem The IMS 3G IP
上传时间： 2020-06-01
上传用户：shancjb
Since its release, Arduino has become more than just a development platform; it has become a culture built around the idea of open source and open hardware, and one that is reimagining computer science and education. Arduino has opened hardware development by making the starting skills easy to obtain, but retaining the complexities of real-world application. This combination makes Arduino a perfect environment for school students, seasoned developers, and designers. This is the first Arduino book to hold the title of “Pro,” and demonstrates skills and concepts that are used by developers in a more advanced setting. Going beyond projects, this book provides examples that demonstrate concepts that can be easily integrated into many different projects and provide inspiration for future ones. The focus of this book is as a transition from the intermediate to the professional.
上传时间： 2020-06-09
上传用户：shancjb
In this chapter we give a quick overview of control theory, explaining why integral feedback control works, describing PID controllers, and summariz- ing some of the currently available techniques for PID controller design. This background will serve to motivate our results on PID control, pre- sented in the subsequent chapters.
标签： Controllers Time-Delay Systems PID for
上传时间： 2020-06-10
上传用户：shancjb
#include<stdio.h> #define TREEMAX 100 typedef struct BT { char data; BT *lchild; BT *rchild; }BT; BT *CreateTree(); void Preorder(BT *T); void Postorder(BT *T); void Inorder(BT *T); void Leafnum(BT *T); void Nodenum(BT *T); int TreeDepth(BT *T); int count=0; void main() { BT *T=NULL; char ch1,ch2,a; ch1='y'; while(ch1=='y'||ch1=='y') { printf("\n"); printf("\n\t\t 二叉树子系统"); printf("\n\t\t*****************************************"); printf("\n\t\t 1---------建二叉树 "); printf("\n\t\t 2---------先序遍历 "); printf("\n\t\t 3---------中序遍历 "); printf("\n\t\t 4---------后序遍历 "); printf("\n\t\t 5---------求叶子数 "); printf("\n\t\t 6---------求结点数 "); printf("\n\t\t 7---------求树深度 "); printf("\n\t\t 0---------返 回 "); printf("\n\t\t*****************************************"); printf("\n\t\t 请选择菜单号 （0--7）"); scanf("%c",&ch2); getchar(); printf("\n"); switch(ch2) { case'1': printf("\n\t\t请按先序序列输入二叉树的结点:\n"); printf("\n\t\t说明：输入结点（‘0’代表后继结点为空）后按回车。\n"); printf("\n\t\t请输入根结点:"); T=CreateTree(); printf("\n\t\t二叉树成功建立！\n");break; case'2': printf("\n\t\t该二叉树的先序遍历序列为:"); Preorder(T);break; case'3': printf("\n\t\t该二叉树的中序遍历序列为:"); Inorder(T);break; case'4': printf("\n\t\t该二叉树的后序遍历序列为:"); Postorder(T);break; case'5': count=0;Leafnum(T); printf("\n\t\t该二叉树有%d个叶子。\n",count);break; case'6': count=0;Nodenum(T); printf("\n\t\t该二叉树总共有%d个结点。\n",count);break; case'7': printf("\n\t\t该树的深度为:%d",TreeDepth(T)); break; case'0': ch1='n';break; default: printf("\n\t\t***请注意：输入有误！***"); } if(ch2!='0') { printf("\n\n\t\t按【Enter】键继续，按任意键返回主菜单！\n"); a=getchar(); if(a!='\xA') { getchar(); ch1='n'; } } } } BT *CreateTree() { BT *t; char x; scanf("%c",&x); getchar(); if(x=='0') t=NULL; else { t=new BT; t->data=x; printf("\n\t\t请输入%c结点的左子结点:",t->data); t->lchild=CreateTree(); printf("\n\t\t请输入%c结点的右子结点:",t->data); t->rchild=CreateTree(); } return t; } void Preorder(BT *T) { if(T) { printf("%3c",T->data); Preorder(T->lchild); Preorder(T->rchild); } } void Inorder(BT *T) { if(T) { Inorder(T->lchild); printf("%3c",T->data); Inorder(T->rchild); } } void Postorder(BT *T) { if(T) { Postorder(T->lchild); Postorder(T->rchild); printf("%3c",T->data); } } void Leafnum(BT *T) { if(T) { if(T->lchild==NULL&&T->rchild==NULL) count++; Leafnum(T->lchild); Leafnum(T->rchild); } } void Nodenum(BT *T) { if(T) { count++; Nodenum(T->lchild); Nodenum(T->rchild); } } int TreeDepth(BT *T) { int ldep,rdep; if(T==NULL) return 0; else { ldep=TreeDepth(T->lchild); rdep=TreeDepth(T->rchild); if(ldep>rdep) return ldep+1; else return rdep+1; } }
上传时间： 2020-06-11
上传用户：ccccy
#include <stdio.h> #include <stdlib.h> #define SMAX 100 typedef struct SPNode { int i,j,v; }SPNode; struct sparmatrix { int rows,cols,terms; SPNode data [SMAX]; }; sparmatrix CreateSparmatrix() { sparmatrix A; printf("\n\t\t请输入稀疏矩阵的行数，列数和非零元素个数（用逗号隔开）:"); scanf("%d,%d,%d",&A.cols,&A.terms); for(int n=0;n<=A.terms-1;n++) { printf("\n\t\t输入非零元素值（格式：行号，列号，值）:"); scanf("%d,%d,%d",&A.data[n].i,&A.data[n].j,&A.data[n].v); } return A; } void ShowSparmatrix(sparmatrix A) { int k; printf("\n\t\t"); for(int x=0;x<=A.rows-1;x++) { for(int y=0;y<=A.cols-1;y++) { k=0; for(int n=0;n<=A.terms-1;n++) { if((A.data[n].i-1==x)&&(A.data[n].j-1==y)) { printf("%8d",A.data[n].v); k=1; } } if(k==0) printf("%8d",k); } printf("\n\t\t"); } } void sumsparmatrix(sparmatrix A) { SPNode *p; p=(SPNode*)malloc(sizeof(SPNode)); p->v=0; int k; k=0; printf("\n\t\t"); for(int x=0;x<=A.rows-1;x++) { for(int y=0;y<=A.cols-1;y++) { for(int n=0;n<=A.terms;n++) { if((A.data[n].i==x)&&(A.data[n].j==y)&&(x==y)) { p->v=p->v+A.data[n].v; k=1; } } } printf("\n\t\t"); } if(k==1) printf("\n\t\t对角线元素的和：:%d\n",p->v); else printf("\n\t\t对角线元素的和为：:0"); } int main() { int ch=1,choice; struct sparmatrix A; A.terms=0; while(ch) { printf("\n"); printf("\n\t\t 稀疏矩阵的三元组系统 "); printf("\n\t\t*********************************"); printf("\n\t\t 1------------创建 "); printf("\n\t\t 2------------显示 "); printf("\n\t\t 3------------求对角线元素和"); printf("\n\t\t 4------------返回 "); printf("\n\t\t*********************************"); printf("\n\t\t请选择菜单号（0-3）:"); scanf("%d",&choice); switch(choice) { case 1: A=CreateSparmatrix(); break; case 2: ShowSparmatrix(A); break; case 3: SumSparmatrix(A); break; default: system("cls"); printf("\n\t\t输入错误！请重新输入！\n"); break; } if (choice==1||choice==2||choice==3) { printf("\n\t\t"); system("pause"); system("cls"); } else system("cls"); } }
上传时间： 2020-06-11
上传用户：ccccy
具体实现功能有：播放，暂停，恢复，停止，上一曲，下一曲，音量增减，播放进度显示及拖动进度条改变歌曲播放时间位置，从本地添加歌曲，保存播放列表，删除当前，删除列表，3种循环模式包括顺序播放，单曲循环，随机播放，列表循环，默认播放模式为顺序播放。
上传时间： 2020-06-13
上传用户：流水一方
#include<iostream> using namespace std; int s=0; int prime(int x){ int i,p=1; for(i=2;i<=x/2;i++){ if(x%i==0){ p=0; break; } } if(p!=0){ cout<<x<< " "; s++; } } int main(){ for (int k=5;k<=100;k++){ prime(k); if(s%5==0) cout<<'\n'; } return 0; }
标签： C++
上传时间： 2020-06-30
上传用户：1274636550
飞机订票系统 任务：通过此系统可以实现如下功能： 录入：可以录入航班情况（数据可以存储在一个数据文件中，数据结构、具体数据自定） 查询：可以查询某个航线的情况（如，输入航班号，查询起降时间，起飞抵达城市，航班票价，票价折扣，确定航班是否满仓）；可以输入起飞抵达城市，查询飞机航班情况； 订票：（订票情况可以存在一个数据文件中，结构自己设定）可以订票，如果该航班已经无票，可以提供相关可选择航班； 退票： 可退票，退票后修改相关数据文件；客户资料有姓名，证件号，订票数量及航班情况，订单要有编号。 修改航班信息：当航班信息改变可以修改航班数据文件
标签： C语言航空订票系统课程设计
上传时间： 2020-07-04
上传用户：
