Plug in Electric Vehicles (PEVs) use energy storages usually in the form of battery banks that are designed to be recharged using utility grid power. One category of PEVs are Electric Vehicles (EVs) without an Internal-Combustion (IC) engine where the energy stored in the battery bank is the only source of power to drive the vehicle. These are also referred to as Battery Electric Vehicles (BEVs). The second category of PEVs, which is more commercialized than the EVs, is the Plug in Hybrid Electric Vehicles (PHEVs) where the role of energy storage is to supplement the power produced by the IC engine.
标签： Electric Vehicles Smart Grids in
上传时间： 2020-06-07
上传用户：shancjb
For many years prior to the 1970s, engineers designed and built switch mode power supplies (SMPSs) using methods based largely on intuitive and exper- imentally derived techniques. In general, these power supplies were able to achieve their primary goal of high-efficiency power conversion; unfortu- nately, due to the lack of adequate theoretical analysis techniques, many of these power supplies only marginally met their desired performance require- ments. In many cases, they were considered to be unreliable.
标签： Supplies Switch Power Mode
上传时间： 2020-06-07
上传用户：shancjb
RFID (radio-frequency identification) is the use of a wireless non-contact system that uses radio-frequencyelectromagnetic fields to transfer datafrom a tag attached to an object, for the purposes of automatic identification and tracking [38]. The basic technologies for RFID have been around for a long time. Its root can be traced back to an espionage device designed in 1945 by Leon Theremin of the Soviet Union,whichretransmittedincidentradiowaves modulatedwith audioinformation. After decades of development, RFID systems have gain more and more attention from both the research community and the industry.
标签： Infrastructure RFID as an
上传时间： 2020-06-08
上传用户：shancjb
The purpose of this book is to help anyone involved in small-scale geophys- ical surveys. It is not a textbook in the traditional sense, in that it is designed for use in the field and concerns itself with practical matters – with the- ory taking second place. Where theory determines field practice, it is stated, not developed or justified. For example, no attempt is made to explain why four-electrode resistivity works where two-electrode surveys do not.
标签： Field_Geophysics
上传时间： 2020-06-09
上传用户：shancjb
Many applications have required the positioning accuracy of a Global Navigation Satellite System (GNSS). Some applications exist in environments that attenuate GNSS signals, and, consequently, the received GNSS signals become very weak. Examplesofsuchapplicationsarewirelessdevicepositioning,positioninginsensor networks that detect natural disasters, and orbit determination of geostationary and high earth orbit (HEO) satellites. Conventional GNSS receivers are not designed to work with weak signals. This book presents novel GNSS receiver algorithms that are designed to work with very weak signals.
标签： Receivers Signals GNSS Weak for
上传时间： 2020-06-09
上传用户：shancjb
Control Systems Engineering is an exciting and challenging field and is a multidisciplinary subject. This book is designed and organized around the concepts of control systems engineering using MATLAB, as they have been developed in the frequency and time domain for an introductory undergraduate or graduate course in control systems for engineer- ing students of all disciplines.
上传时间： 2020-06-10
上传用户：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
上传用户：流水一方
