欧美涩涩网站,欧美人体视频,日本久久伊人

dot-matrix

Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two

Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.

標簽： branch-and-strategy Salesperson Traveling solution

上傳時間： 2013-12-29

上傳用戶：璇珠官人
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

上傳用戶：變形金剛
The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT alg

The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.

標簽： iterations performs Bailey number

上傳時間： 2014-01-05

上傳用戶：libenshu01
This section describes the development and extension of a basic power flow program in Matlab. To th

This section describes the development and extension of a basic power flow program in Matlab. To the extent feasible, complex vector operations are used, even for the calculation of the Jacobian matrix .

標簽： development describes extension section

上傳時間： 2017-07-01

上傳用戶：caiiicc
一個合同管理系統的源代碼

一個合同管理系統的源代碼，采用Dot Net開發，源碼文件包含數據庫文件及建模文件，感興趣的可以研究。

標簽： 合同管理系統源代碼

上傳時間： 2013-12-22

上傳用戶：lmeeworm
AHP toolbox AHPCALC Perform a complete AHP calculation. AHPHIER One-step hierarchic

AHP toolbox AHPCALC Perform a complete AHP calculation. AHPHIER One-step hierarchical assembly of AHP weighting vector. AHPREORDER Internal reordering function called by AHPCALC. AHPVECTOR Calculate the AHP ranking or weighting vector from an AHP reciproal matrix. AHPMAKEMAT Turn a vector of comparisons into an AHP reciprocal matrix. Copyright (C) 2001 Michael J. Scott

標簽： calculation hierarchic AHP One-step

上傳時間： 2013-11-28

上傳用戶：PresidentHuang
list of matlab m-files on matlab 7.0. learning , support vector machine and some utility routines :

list of matlab m-files on matlab 7.0. learning , support vector machine and some utility routines : autocorrelation, linearly scale randomize the row order of a matrix

標簽： matlab learning routines m-files

上傳時間： 2017-07-24

上傳用戶：evil
Two scripts are included here. 1. convsys.m - combines the state space representation of two syst

Two scripts are included here. 1. convsys.m - combines the state space representation of two systems connected in series. [Ao,Bo,Co,Do]=convsys(A1,B1,C1,D1,A2,B2,C2,D2) This algorithm gives the convolution of two state space representations | A1 B1 | | A2 B2 | u ==> | | ==> | | ==> y | C1 D1 | | C2 D2 | The algorithm also accepts state space objects as inputs and gives out a state space object as output. 2. sysfeedbk.m [Ao,Bo,Co,Do]=convsys(A1,B1,C1,D1,A2,B2,C2,D2) Gives the closed loop state space representation for two systems connected with negative feedback in the following manner. | A1 B1 | u ==> | | ==> y + o | C1 D1 | | - | | | | A2 B2 | | |= | |= | | C2 D2 | The zip file also contains checkcompatibility.m , which checks the compatibility of matrix dimensions in the system and cleanss.m which can be used to clean a state space representation.

標簽： representation included combines scripts

上傳時間： 2017-07-25

上傳用戶：semi1981
Because WDM networks are circuit switched loss networks blocking may occur because of lack of resour

Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many paths use the same links. This toolbox answers the question how different paths with different loads influence on each other and what is the blocking on each of the defined path. Toolbox is capable of computing blocking for three different WDM network types: with no wavelength conversion, with full wavelength conversion and with limited range wavelength conversion. It is worth noting that case for full conversion can be usefull for any circuit switched network without additional constraints (i.e. wavelength continuity constraint in WDM), for example telephone network. Toolbox contains also scripts for defining network structures (random networks, user defined networks) and traffic matrixes. Three graph algorithms for shortest path computation are also in this toolbox (they are used for traffic matrix creation).

標簽： networks blocking switched Because

上傳時間： 2017-07-28

上傳用戶：zhangzhenyu
sba, a C/C++ package for generic sparse bundle adjustment is almost invariably used as the last step

sba, a C/C++ package for generic sparse bundle adjustment is almost invariably used as the last step of every feature-based multiple view reconstruction vision algorithm to obtain optimal 3D structure and motion (i.e. camera matrix) parameter estimates. Provided with initial estimates, BA simultaneously refines motion and structure by minimizing the reprojection error between the observed and predicted image points.

標簽： adjustment invariably package generic

上傳時間： 2013-12-18

上傳用戶：xsnjzljj