Each exploration in this book is a mixture of text and interactive exercises. The exercises are unlike anything you鈥檝e seen in other books. Instead of multiple choice, fill-in-the-blank, or simple Q&A exercises, lessons are interactive explorations of key C++ features.
標簽： exercises exploration interactive mixture
上傳時間： 2017-05-14
上傳用戶：whenfly
As a programming language, C is rather like Pascal or Fortran.. Values are stored in variables. Programs are structured by defining and calling functions. Program flow is controlled using loops, if statements and function calls. Input and output can be directed to the terminal or to files. Related data can be stored together in arrays or structures.
標簽： programming variables language Fortran
上傳時間： 2017-05-18
上傳用戶：hongmo
This is a Switch simulation... with 4 types of switches... and also we have average simulation time over these 4 switches 1. No Queue 2. Input Queue 3. Input Queue with iterative 4. Output QUeue
標簽： simulation switches average Switch
上傳時間： 2017-05-20
上傳用戶：徐孺
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
上傳用戶：變形金剛
) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
標簽： code Compression huffman provide
上傳時間： 2017-05-30
上傳用戶：yuchunhai1990
In the last decade the processing of polygonal meshes has emerged as an active and very productive research area. This can basically be attributed to two developments: Modern geometry acquisition devices, like laser scanners and MRT, easily produce raw polygonal meshes of ever growing complexity Downstream applications like analysis tools (medical imaging), computer aided manufacturing, or numerical simulations all require high quality polygonal meshes as input. The need to bridge the gap between raw triangle soup data and high-quality polygon meshes has driven the research on ecient data structures and algorithms that directly operate on polygonal meshes rather than on a (most often not feasible) intermediate CAD representation.
標簽： processing productive the polygonal
上傳時間： 2017-06-03
上傳用戶：TF2015
一個sms格式的PPC端短信備份的還原工具。原備份軟件BkGenuis包含在rar文件內。 PPC上有個綠色的單獨的短信備份還原工具，備份的格式是sms，但是還原是直接還原至手機短信中，在PC端不可以直接閱讀。故編寫了這個java程序來實現sms格式的解碼。輸入是input.sms。輸出是txt文本格式。
上傳時間： 2013-12-19
上傳用戶：小碼農lz
This is program with source code to convert ascii text files to the maxicode barcode standard. The input file consists of two columns. The first column represents a code and the second column is a string enclosed in quotes. The codes for the first column are as follows: PM, SM, CC, MO, SC, and PC.
標簽： maxicode standard barcode convert
上傳時間： 2017-06-07
上傳用戶：ardager
This program implements a PIC-based fuzzy inference engine for the Fudge fuzzy development system from Motorola. It works by taking the output from Fudge for the 68HC11 processor, and converting it to a MPASM compatible assembler file using the convert batch file. This file can then be incorporated with fuzzy.asm to create a fuzzy inference engine. Tool chain ---------- FUDGE -> Fuzzy Rules -> MC68HC11.ASM -> CONVERT.BAT -> RULES.ASM -> MPASM FUZZY.ASM -> INTEL HEX Fuzzy input registers --------------------- current_ins 1..8 x 8-bit raw inputs Fuzzy inference function ------------------------ FuzzyEngine Fuzzy output registers ---------------------- cog_outs 1..8 x 8-bit raw outputs
標簽： fuzzy development implements PIC-based
上傳時間： 2014-01-18
上傳用戶：caozhizhi
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
