SA Encryption and Decryption using Matlab The program set contains thirteen files listed below. errormeg.fig errormsg.m helpmsg.fig helpmsg.m inputmsg.fig inputmsg.m mesgcut.m pro2.fig pro2.m rsacore.m readme.txt screenshot.gif In Order to run the program please call pro2.m under Matlab 6.0 Environment. System Requirement Matlab version 6.0 and if necessary, Maple version 6.0 on any platform PentiumII 300 MHz or equivalent.
标签： Encryption Decryption contains thirteen
上传时间： 2017-04-06
上传用户：dreamboy36
1. It is located in the root directory - SecurityBuilderDemo.exe. Leave password box blank and click on Security button in Order to Add/Remove users and set user rights. Once you entered Security dialog you may select your Supervisor password. 2. Click OK when finished configuring users. Don t forget to disable some features in Order to see what happens with GUI elements - menus, and buttons.
标签： SecurityBuilderDemo directory password located
上传时间： 2014-01-23
上传用户：chongcongying
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in Order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for Ordering.
标签： fault-tolerant algorithms redundant underlyin
上传时间： 2013-12-18
上传用户：jkhjkh1982
Fortran 90 versions of all the Numerical Recipes routines appear in the following Chapters B1 through B20, numbered in correspondence with Chapters 1 through 20 in Volume 1. Within each chapter, the routines appear in the same Order as in Volume 1, but not broken out separately by section number within Volume 1鈥檚 chapters. There are commentaries accompanying many of the routines, generally following the printed listing of the routine to which they apply. These are of two kinds: issues related to parallelizing the algorithm in question, and issues related to the Fortran 90 implementation. To distinguish between these two, rather different, kind
标签： Numerical following the Chapters
上传时间： 2017-04-12
上传用户：6546544
The files adi_ssl_init.h and adi_ssl_init.c are used to define the functions adi_ssl_Init() and 慳di_ssl_Terminate()?which initialize and terminate all the Blackfin System Services in the appropriate Order, for a particular EZ-Kit, depending on the Blackfin processor used.
标签： adi_ssl_init adi_ssl_Init functions define
上传时间： 2014-01-21
上传用户：sammi
C280x C/C++ Header Files and Peripheral Examples The DSP28xx C/C++ peripheral header files and example projects files facilitate writing C/C++ Code for the TI鈥檚 28xx MCUs. The code can be used as a learning tool or as the basis for a development platform depending on the current needs of the user. We suggest that you immediately download these header files in Order for an easier transition to understanding the 28xx peripherals.
标签： Peripheral peripheral and Examples
上传时间： 2014-01-24
上传用户：fandeshun
Matlab script for solution to the driven cavity problem on a staggered grid using a divergence formulation and second-Order Runge-Kutta time integration.
标签： divergence staggered solution problem
上传时间： 2017-05-14
上传用户：lingzhichao
C in A Nutshell Learning a language--any language--involves a process wherein you learn to rely less and less on instruction and more increasingly on the aspects of the language you ve mastered. Whether you re learning French, Java, or C, at some point you ll set aside the tutorial and attempt to converse on your own. It s not necessary to know every subtle facet of French in Order to speak it well, especially if there s a good dictionary available. Likewise, C programmers don t need to memorize every detail of C in Order to write good programs. What they need instead is a reliable, comprehensive reference that they can keep nearby. C in a Nutshell is that reference.
标签： language Nutshell Learning involves
上传时间： 2013-12-25
上传用户：王者A
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
Normally a list view is updated by a user directly by selecting a list view item and then editing or deleting it. New items are usually added at the bottom of the list. This works fine since the user knows which items have been changed or deleted and where the new items will pop up. A drawback of it is that, if the list is sorted, then new items will not be displayed in a sorted way, instead they will be listed in the Order of being created.
标签： list view selecting Normally
上传时间： 2017-07-02
上传用户：Pzj
