该模型采用滞环控制技术，通过将逆变器输出电流与理想参考电流比较后，得到理想的输出电流波形。跟踪效果较好。
标签： matlab
上传时间： 2020-05-13
上传用户：CCTV
We review the current applications of photonic technologies to Smart Cities. Inspired by the future needs of Smart Cities, we then propose potential applications of advanced photonic technologies. We find that photonics already has a major impact on Smart Cities, in terms of smart lighting, sensing, and communication technologies. We further find that advanced photonic technologies could lead to vastly improved infrastructure, such as smart water‐supply systems. We conclude by proposing directions for future research that will have the greatest impact on realizing Smart City initiatives.
上传时间： 2020-05-26
上传用户：shancjb
This book is an entry-level text on the technology of telecommunications. It has been crafted with the newcomer in mind. The eighteen chapters of text have been prepared for high-school graduates who understand algebra, logarithms, and basic electrical prin- ciples such as Ohm’s law. However, many users require support in these areas so Appen- dices A and B review the essentials of electricity and mathematics through logarithms.
标签： Telecommunications Fundamentals 1st of ed
上传时间： 2020-05-27
上传用户：shancjb
This book is an entry-level text on the technology of telecommunications. It has been crafted with the newcomer in mind. The twenty-one chapters of text have been prepared for high-school graduates who understand algebra, logarithms, and the basic principles of electricity such as Ohm’s law. However, it is appreciated that many readers require support in these areas. Appendices A and B review the essentials of electricity and mathematics up through logarithms. This material was placed in the appendices so as not to distract from the main theme, the technology of telecommunication systems. Another topic that many in the industry find difficult is the use of decibels and derived units. Appendix C provides the reader a basic understanding of decibels and their applications. The only mathematics necessary is an understanding of the powers of ten
标签： Telecommunications Fundamentals 2nd of ed
上传时间： 2020-05-27
上传用户：shancjb
Your Cisco Networking Academy Course Booklet is designed as a study resource you can easily read, high- light, and review on the go, wherever the Internet is not available or practical: ■ The text is extracted directly, word-for-word, from the online course so you can highlight important points and take notes in the “Your Chapter Notes” section. ■ Headings with the exact page correlations provide a quick reference to the online course for your class- room discussions and exam preparation. ■ An icon system directs you to the online curriculum to take full advantage of the images, labs, Packet Tracer activities, and dynamic Flash-based activities embedded within the Networking Academy online course interface.
标签： Switching Wireless LAN and
上传时间： 2020-05-27
上传用户：shancjb
Part I provides a compact survey on classical stochastic geometry models. The basic models defined in this part will be used and extended throughout the whole monograph, and in particular to SINR based models. Note however that these classical stochastic models can be used in a variety of contexts which go far beyond the modeling of wireless networks. Chapter 1 reviews the definition and basic properties of Poisson point processes in Euclidean space. We review key operations on Poisson point processes (thinning, superposition, displacement) as well as key formulas like Campbell’s formula. Chapter 2 is focused on properties of the spatial shot-noise process: its continuity properties, its Laplace transform, its moments etc. Both additive and max shot-noise processes are studied. Chapter 3 bears on coverage processes, and in particular on the Boolean model. Its basic coverage characteristics are reviewed. We also give a brief account of its percolation properties. Chapter 4 studies random tessellations; the main focus is on Poisson–Voronoi tessellations and cells. We also discuss various random objects associated with bivariate point processes such as the set of points of the first point process that fall in a Voronoi cell w.r.t. the second point process.
标签： Stochastic Geometry Networks Wireless Volume and
上传时间： 2020-06-01
上传用户：shancjb
stract With global drivers such as better energy consumption, energy efficiency and reduction of greenhouse gases, CO 2 emission reduction has become key in every layer of the value chain. Power Electronics has definitely a role to play in these thrilling challenges. From converters down to compound semiconductors, innovation is leading to breakthrough technologies. Wide BandGap, Power Module Packaging, growth of Electric Vehicle market will game change the overall power electronic industry and supply chain. In this presentation we will review power electronics trends, from technologies to markets.
标签： Electronics Materials Power WBG for
上传时间： 2020-06-07
上传用户：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
