keil C51 v6.12 完全解密版的安装说明 安装方法是先将V6.12安装程序用复制到某个目录下，如复制到D:\keilC51 然后执行D:\keilC51\setup\setup.exe 安装程序，选择安装Eval Version版进 行安装。 注册码：K199U-20071-12A9U 当出现Please insert the add-on disk的提示画面，可按next按钮（不用 插入软盘）。 安装好之后就可以使用，没有代码大小的限制，这是完全版，比 Eval版增 加浮点库等内容。
标签： keilC51v612
上传时间： 2015-07-17
上传用户：f29876
老牌MP3录制工具。 Introduction ============ MP3 Sound Recorder(MP3 Recorder) is a program that can record mp3 from any available sound source directly without costing any other disk space. With a simple and intuitionistic interface, you can record your sound easily and quickly.
标签： MP3录制工具
上传时间： 2015-10-19
上传用户：dumpsoft
/** * 用于在逻辑和界面间传输数据的bean * @version 1.0 */ public class DataBean { private int first = -1; private int second = -1; public int getFirst() { return first; } public int getSecond() { return second; } public void setFirst(int firt) { this.first = firt; } public void setSecond(int second) { this.second = second; } /** * 将1,2次均置为初始状态
上传时间： 2015-11-07
上传用户：dddhhhwww
可以自定义和继承 /// <summary> /// 设计器支持所需的方法 - 不要 /// 使用代码编辑器修改此方法的内容。 /// </summary> private void InitializeComponent() { this.components = new System.ComponentModel.Container(); this.AutoScaleMode = System.Windows.Forms.AutoScaleMode.Font; this.Text = "Form1"; }
上传时间： 2016-08-15
上传用户：baobao9437
/*import java.util.Scanner; //主类 public class student122 { //主方法 public static void main(String[] args){ //定义7个元素的字符数组 String[] st = new String[7]; inputSt(st); //调用输入方法 calculateSt(st); //调用计算方法 outputSt(st); //调用输出方法 } //其他方法 //输入方法 private static void inputSt(String st[]){ System.out.println("输入学生的信息："); System.out.println("学号 姓名 成绩1，2，3"); //创建键盘输入类 Scanner ss = new Scanner(System.in); for(int i=0; i<5; i++){ st[i] = ss.next(); //键盘输入1个字符串 } } //计算方法 private static void calculateSt(String[] st){ int sum = 0; //总分赋初值 int ave = 0; //平均分赋初值 for(int i=2;i<5;i++) { /计总分，字符变换成整数后进行计算 sum += Integer.parseInt(st[i]); } ave = sum/3; //计算平均分 //整数变换成字符后保存到数组里 st[5] = String.valueOf(sum); st[6] = String.valueOf(ave); } //输出方法 private static void outputSt(String[] st){ System.out.print("学号 姓名 "); //不换行 System.out.print("成绩1 成绩2 成绩3 "); System.out.println("总分 平均分");//换行 //输出学生信息 for(int i=0; i<7; i++){ //按格式输出，小于6个字符，补充空格 System.out.printf("%6s", st[i]); } System.out.println(); //输出换行 } }*/ import java.util.Scanner; public class student122 { public static void main(String[] args) { // TODO 自动生成的方法存根 String[][] st = new String[3][8]; inputSt(st); calculateSt(st); outputSt(st); } //输入方法 private static void inputSt(String st[][]) { System.out.println("输入学生信息："); System.out.println("班级 学号 姓名 成绩：数学 物理 化学"); //创建键盘输入类 Scanner ss = new Scanner(System.in); for(int j = 0; j < 3; j++) { for(int i = 0; i < 6; i++) { st[j][i] = ss.next(); } } } //输出方法 private static void outputSt(String st[][]) { System.out.println("序号 班级 学号 姓名 成绩：数学 物理 化学 总分 平均分"); //输出学生信息 for(int j = 0; j < 3; j++) { System.out.print(j+1 + ":"); for(int i = 0; i < 8; i++) { System.out.printf("%6s", st[j][i]); } System.out.println(); } } //计算方法 private static void calculateSt(String[][] st) { int sum1 = 0; int sum2 = 0; int sum3 = 0; int ave1 = 0; int ave2 = 0; int ave3 = 0; for(int i = 3; i < 6; i++) { sum1 += Integer.parseInt(st[0][i]); } ave1 = sum1/3; for(int i = 3; i < 6; i++) { sum2 += Integer.parseInt(st[1][i]); } ave2 = sum2/3; for(int i = 3; i < 6; i++) { sum3 += Integer.parseInt(st[2][i]); } ave3 = sum3/3; st[0][6] = String.valueOf(sum1); st[1][6] = String.valueOf(sum2); st[2][6] = String.valueOf(sum3); st[0][7] = String.valueOf(ave1); st[1][7] = String.valueOf(ave2); st[2][7] = String.valueOf(ave3); } }
上传时间： 2017-03-17
上传用户：simple
#include "iostream" using namespace std; class Matrix { private: double** A; //矩阵A double *b; //向量b public: int size; Matrix(int ); ~Matrix(); friend double* Dooli(Matrix& ); void Input(); void Disp(); }; Matrix::Matrix(int x) { size=x; //为向量b分配空间并初始化为0 b=new double [x]; for(int j=0;j<x;j++) b[j]=0; //为向量A分配空间并初始化为0 A=new double* [x]; for(int i=0;i<x;i++) A[i]=new double [x]; for(int m=0;m<x;m++) for(int n=0;n<x;n++) A[m][n]=0; } Matrix::~Matrix() { cout<<"正在析构中~~~~"<<endl; delete b; for(int i=0;i<size;i++) delete A[i]; delete A; } void Matrix::Disp() { for(int i=0;i<size;i++) { for(int j=0;j<size;j++) cout<<A[i][j]<<" "; cout<<endl; } } void Matrix::Input() { cout<<"请输入A:"<<endl; for(int i=0;i<size;i++) for(int j=0;j<size;j++){ cout<<"第"<<i+1<<"行"<<"第"<<j+1<<"列:"<<endl; cin>>A[i][j]; } cout<<"请输入b:"<<endl; for(int j=0;j<size;j++){ cout<<"第"<<j+1<<"个:"<<endl; cin>>b[j]; } } double* Dooli(Matrix& A) { double *Xn=new double [A.size]; Matrix L(A.size),U(A.size); //分别求得U，L的第一行与第一列 for(int i=0;i<A.size;i++) U.A[0][i]=A.A[0][i]; for(int j=1;j<A.size;j++) L.A[j][0]=A.A[j][0]/U.A[0][0]; //分别求得U，L的第r行，第r列 double temp1=0,temp2=0; for(int r=1;r<A.size;r++){ //U for(int i=r;i<A.size;i++){ for(int k=0;k<r-1;k++) temp1=temp1+L.A[r][k]*U.A[k][i]; U.A[r][i]=A.A[r][i]-temp1; } //L for(int i=r+1;i<A.size;i++){ for(int k=0;k<r-1;k++) temp2=temp2+L.A[i][k]*U.A[k][r]; L.A[i][r]=(A.A[i][r]-temp2)/U.A[r][r]; } } cout<<"计算U得:"<<endl; U.Disp(); cout<<"计算L的:"<<endl; L.Disp(); double *Y=new double [A.size]; Y[0]=A.b[0]; for(int i=1;i<A.size;i++ ){ double temp3=0; for(int k=0;k<i-1;k++) temp3=temp3+L.A[i][k]*Y[k]; Y[i]=A.b[i]-temp3; } Xn[A.size-1]=Y[A.size-1]/U.A[A.size-1][A.size-1]; for(int i=A.size-1;i>=0;i--){ double temp4=0; for(int k=i+1;k<A.size;k++) temp4=temp4+U.A[i][k]*Xn[k]; Xn[i]=(Y[i]-temp4)/U.A[i][i]; } return Xn; } int main() { Matrix B(4); B.Input(); double *X; X=Dooli(B); cout<<"~~~~解得:"<<endl; for(int i=0;i<B.size;i++) cout<<"X["<<i<<"]:"<<X[i]<<" "; cout<<endl<<"呵呵呵呵呵"; return 0; }
标签： 道理特分解法
上传时间： 2018-05-20
上传用户：Aa123456789
keil C51 v6.12 完全解密版的安装说明 安装方法是先将V6.12安装程序复制到某个目录下，如复制到D:\keilC51 然后执行D:\keilC51\setup\setup.exe 安装程序，选择安装Eval Version版进 行安装。 注册码：K199U-20071-12A9U 当出现Please insert the add-on disk的提示画面，可按next按钮（不用 插入软盘）。 安装好之后就可以使用，没有代码大小的限制，这是完全版，比 Eval版增 加浮点库等内容。
上传时间： 2020-03-20
上传用户：mimeme
For nearly a hundred years telecommunications provided mainly voice services and very low speed data (telegraph and telex). With the advent of the Internet, several data services became mainstream in telecommunications; to the point that voice is becoming an accessory to IP-centric data networks. Today, high-speed data services are already part of our daily lives at work and at home (web surfing, e-mail, virtual private networks, VoIP, virtual meetings, chats...). The demand for high-speed data services will grow even more with the increasing number of people telecommuting.
上传时间： 2020-05-27
上传用户：shancjb
The ever-increasing demand for private and sensitive data transmission over wireless net- works has made security a crucial concern in the current and future large-scale, dynamic, and heterogeneous wireless communication systems. To address this challenge, computer scientists and engineers have tried hard to continuously come up with improved crypto- graphic algorithms. But typically we do not need to wait too long to find an efficient way to crack these algorithms. With the rapid progress of computational devices, the current cryptographic methods are already becoming more unreliable. In recent years, wireless re- searchers have sought a new security paradigm termed physical layer security. Unlike the traditional cryptographic approach which ignores the effect of the wireless medium, physi- cal layer security exploits the important characteristics of wireless channel, such as fading, interference, and noise, for improving the communication security against eavesdropping attacks. This new security paradigm is expected to complement and significantly increase the overall communication security of future wireless networks.
标签： Communications Physical Security Wireless Layer in
上传时间： 2020-05-31
上传用户：shancjb
Changes in telecommunications are impacting all types of user group, which include business users, traveling users, small and home offices, and residential users. The acceptance rate of telecom- munications and information services is accelerating significantly. Voice services needed approximately 50 years to reach a very high teledensity; television needed just 15 years to change the culture and lives of many families; the Internet and its related services have been penetrating and changing business practices and private com- munications over the last 2 to 3 years.
标签： Telecommunications Handbook The
上传时间： 2020-06-01
上传用户：shancjb
