-
The present work, Advanced Process Engineering Control, is intended to be the
continuation of the authors? Basic Process Engineering Control published by
DeGruyter in 2014. It presents the Main and conventional type control loops in process
industries. Titles containing the concept of process engineering were deliberately
chosen to suggest the inclusion, within the same approach, of processes other than
the traditional ones. These come from outside the traditional fields of chemistry and
petrochemistry: the sphere of pharmaceuticals, wastewater management, water puri-
fication, water reserve management, construction material industry, food processing,
household or automotive industries.
標簽：
Advanced_Process_Engineering_Cont
rol
上傳時間：
2020-06-10
上傳用戶：shancjb
-
The basic topic of this book is solving problems from system and control theory using
convex optimization. We show that a wide variety of problems arising in system
and control theory can be reduced to a handful of standard convex and quasiconvex
optimization problems that involve matrix inequalities. For a few special cases there
are “analytic solutions” to these problems, but our Main point is that they can be
solved numerically in all cases. These standard problems can be solved in polynomial-
time (by, e.g., the ellipsoid algorithm of Shor, Nemirovskii, and Yudin), and so are
tractable, at least in a theoretical sense. Recently developed interior-point methods
for these standard problems have been found to be extremely efficient in practice.
Therefore, we consider the original problems from system and control theory as solved.
標簽：
Linear_Matrix_Inequalities_in_Sys
tem
上傳時間：
2020-06-10
上傳用戶：shancjb
-
The Main aim of this book is to present a unified, systematic description of
basic and advanced problems, methods and algorithms of the modern con-
trol theory considered as a foundation for the design of computer control
and management systems. The scope of the book differs considerably from
the topics of classical traditional control theory Mainly oriented to the
needs of automatic control of technical devices and technological proc-
esses. Taking into account a variety of new applications, the book presents
a compact and uniform description containing traditional analysis and op-
timization problems for control systems as well as control problems with
non-probabilistic models of uncertainty, problems of learning, intelligent,
knowledge-based and operation systems – important for applications in the
control of manufacturing processes, in the project management and in the
control of computer systems.
標簽：
Modern_Control_Theory
上傳時間：
2020-06-10
上傳用戶：shancjb
-
The idea of writing this book arose from the need to investigate the Main principles of
modern power electronic control strategies, using fuzzy logic and neural networks, for
research and teaching. Primarily, the book aims to be a quick learning guide for
postgraduate/undergraduate students or design engineers interested in learning the
fundamentals of modern control of drives and power systems in conjunction with the
powerful design methodology based on VHDL.
標簽：
Neural_and_Fuzzy_Logic_Control
上傳時間：
2020-06-10
上傳用戶：shancjb
-
Human Factors and Systems Interaction aims to address the Main issues of concern
within systems interface with a particular emphasis on the system lifecycle
development and implementation of interfaces and the general implications of
virtual, augmented and mixed reality with respect to human and technology
interaction. Human Factors and Systems Interaction is, in the first instance, affected
by the forces shaping the nature offuture computing and systems development
標簽：
Interactions
Advances
Factors
System
Human
and
in
上傳時間：
2020-06-10
上傳用戶：shancjb
-
Artificial Intelligence (AI) has undoubtedly been one of the most important buz-
zwords over the past years. The goal in AI is to design algorithms that transform com-
puters into “intelligent” agents. By intelligence here we do not necessarily mean an
extraordinary level of smartness shown by superhuman; it rather often involves very
basic problems that humans solve very frequently in their day-to-day life. This can
be as simple as recognizing faces in an image, driving a car, playing a board game, or
reading (and understanding) an article in a newspaper. The intelligent behaviour ex-
hibited by humans when “reading” is one of the Main goals for a subfield of AI called
Natural Language Processing (NLP). Natural language 1 is one of the most complex
tools used by humans for a wide range of reasons, for instance to communicate with
others, to express thoughts, feelings and ideas, to ask questions, or to give instruc-
tions. Therefore, it is crucial for computers to possess the ability to use the same tool
in order to effectively interact with humans.
標簽：
Embeddings
Processing
Language
Natural
in
上傳時間：
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 二叉樹子系統(tǒng)");
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---------求葉子數(shù) ");
printf("\n\t\t 6---------求結(jié)點數(shù) ");
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請按先序序列輸入二叉樹的結(jié)點:\n");
printf("\n\t\t說明：輸入結(jié)點（‘0’代表后繼結(jié)點為空）后按回車。\n");
printf("\n\t\t請輸入根結(jié)點:");
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個結(jié)點。\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】鍵繼續(xù)，按任意鍵返回主菜單！\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結(jié)點的左子結(jié)點:",t->data);
t->lchild=CreateTree();
printf("\n\t\t請輸入%c結(jié)點的右子結(jié)點:",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;
}
}
標簽：
二叉樹
子系統(tǒng)
上傳時間：
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請輸入稀疏矩陣的行數(shù)，列數(shù)和非零元素個數(shù)（用逗號隔開）:");
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 稀疏矩陣的三元組系統(tǒng) ");
printf("\n\t\t*********************************");
printf("\n\t\t 1------------創(chuàng)建 ");
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");
}
}
標簽：
數(shù)組
子系統(tǒng)
上傳時間：
2020-06-11
上傳用戶：ccccy
-
#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
-
)Armature
windings of the electric motor for NO.2 deck cargo winch found low insulation.
Windings re-winded,painted and baked dry.
(2) NO.1 Main
air compressor failed to build up pressure.The machine disassembled, cleaned
and inspected. The discharge valve plate found broken. The valve palte renewed
and running trials tested after being reassembled.
標簽：
答案
上傳時間：
2020-07-14
上傳用戶：
