虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

friend

  • slam进阶学习

    slam进阶学习,这个是第四课,老外做的,很完善的东西,对于同时定位与地图创建的friend有很大的帮助

    标签: slam 进阶

    上传时间: 2013-12-24

    上传用户:yepeng139

  • slam进阶学习

    slam进阶学习,老外做的,很完善的东西,对于同时定位与地图创建的friend有很大的帮助(第一课)

    标签: slam 进阶

    上传时间: 2014-11-21

    上传用户:ouyangtongze

  • slam进阶学习

    slam进阶学习,老外做的,很完善的东西,对于同时定位与地图创建的friend有很大的帮助(第二课)

    标签: slam 进阶

    上传时间: 2016-06-05

    上传用户:lunshaomo

  • 复数运算#include<iostream.h> class Complex { public: Complex( double r =0, double i =0 ) C

    复数运算#include<iostream.h> class Complex { public: Complex( double r =0, double i =0 ) Complex(int a) { Real = a Image = 0 } void print() const friend Complex operator+ ( const Complex & c1, const Complex & c2 ) friend Complex operator- ( const Complex & c1, const Complex & c2 ) friend Complex operator- ( const Complex & c ) private: double Real, Image }

    标签: Complex double iostream include

    上传时间: 2016-06-30

    上传用户:wang5829

  • Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2

    Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2.one approach to improving security was to encrypt multiple letters 3.the Playfair Cipher is an example 4.invented by Charles Wheatstone in 1854,but named after his friend Baron Playfair Playfair Key Matrix 1.a 5X5 matrix of letters based on a keyword 2.fill in letters of keyword (sans duplicates) 3.fill rest of matrix with other letters Encrypting and Decrypting -plaintext is encrypted two letters at a time 1. if a pair is a repeated letter, insert filler like X’ 2. if both letters fall in the same row, replace each with letter to right (wrapping back to start from end) 3. if both letters fall in the same column, replace each with the letter below it (again wrapping to top from bottom) 4. otherwise each letter is replaced by the letter in the same row and in the column of the other letter of the pair

    标签: monoalphabetic Playfair provides security

    上传时间: 2017-05-25

    上传用户:变形金刚

  • 道理特分解法

    #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

  • Tcl_and_The_Tk_Toolkit

    This manuscript is a partial draft of a book to be published in early 1994 by AddisonWesley (ISBN 0-201-63337-X). Addison-Wesley has given me permission to make drafts of the book available to the Tcl community to help meet the need for introductory documentation on Tcl and Tk until the book becomes available. Please observe the restrictions set forth in the copyright notice above: you’re welcome to make a copy for yourself or a friend but any sort of large-scale reproduction or reproduction for profit requires advance permission from Addison-Wesley

    标签: Toolkit

    上传时间: 2020-07-05

    上传用户:

  • 一款实用的电磁炉源码供给懂得单片机c语言的朋友参...

    说明:  一款实用的电磁炉源码!供给懂得单片机c语言的朋友参考!(A useful source Cooker! Supply Singlechip know c language reference friend!)

    标签: 单片机

    上传时间: 2022-05-27

    上传用户: