Software for design and tuninig of SISO and MIMO contol systems
標簽： and Software tuninig systems
上傳時間： 2013-12-08
上傳用戶：源碼3
The tar file contains the following files: ptfsf.c: heart of the perfect TFSF code ptfsf.h: header file for same ptfsf-demo.c: FDTD code which demonstrates use of perfect TFSF code. Essentially this program used to generate results shown in the paper ptfsf-file-maker.c: code to generate an incident-field file using the "perfect" incident fields ptfsf-demo-file.c: FDTD code which uses the perfect incident fields stored in a file fdtdgen.h: defines macros used in much of my code Makefile: simple make-file to compile programs Also include are some simple script files to run the programs with reasonable values. The code assumes a two-dimensional computational domain with TMz polarization (i.e., non-zero field Ez, Hx, and Hy). The program is currently written so that the incident field always strikes the lower-left corner of the total-field region first. (If you want a different corner, that should be a fairly simple tweak to the code, but for now you ll have to make that tweak yourself.)
標簽： ptfsf following the contains
上傳時間： 2013-11-28
上傳用戶：風之驕子
This a very simple Yee algorithm 3D FDTD code in C implementing the free space form of Maxwell s equations on a Cartesian grid. There are no internal materials or geometry. The code as delivered simulates an idealized rectangular waveguide by treating the interior of the mesh as free space/air and enforcing PEC (Perfect Electric Conductor) conditions on the faces of the mesh.
標簽： implementing algorithm Maxwell simple
上傳時間： 2015-05-14
上傳用戶：水中浮云
ANNUAL REPORT TO CONGRESS The Military Power of the People’s Republic of China 2005
標簽： CONGRESS Military Republic ANNUAL
上傳時間： 2013-12-27
上傳用戶：zhengzg
Ion Team Lord Of The Rings Demo 模擬指環(huán)王的3D游戲 VS.NET編譯 里面提供高級渲染算法
上傳時間： 2014-09-09
上傳用戶：zq70996813
ARM下 Implement matrix multiplication of 2 square matrices, with data read from an input file and printed both to the console and to an output file. • Assume a file with correct data (no garbage, characters, etc.). • you must check and provide appropriate execution for 2 extra cases, namely when the matrix size given is either “0” , or when the size is greater than the maximum handled of “5” . In these 2 cases you must implement the following behaviour: o If size = 0, then print a message “Size = 0 is unacceptable” and continue by reading the next size for the next 2 matrices (if not end of file). o If size >5, then print two messages: “Size is too big - unacceptable”. Then read and discard the next (size2 ) integers and continue by reading the next size for the next 2 matrices (if not end of file).
標簽： multiplication Implement matrices matrix
上傳時間： 2014-08-30
上傳用戶：dsgkjgkjg
A collection of math routines including 8-bit, 16-bit, 32-bit signed and unsigned addition, subtraction, multiplication, and division. Very nice code library with heavy in-line documentation! Been looking for multi-byte divide? Here it is.
標簽： bit collection including addition
上傳時間： 2015-05-17
上傳用戶：cursor
The Art Of C++ 此書的源碼，經典！里面，實現(xiàn)了個建議的MiniC++的代碼，值得一提的是，此MiniC++是解釋性的
上傳時間： 2015-05-17
上傳用戶：xiaoxiang
This sample demonstrates the use of the projection objects ProjCoordSys and GeoCoordSys, and the CoordinateSystem property of the MapLayer object and Map control. This application is intended to teach about the different world projections and there uses.
標簽： the ProjCoordSys demonstrates GeoCoordSys
上傳時間： 2015-05-17
上傳用戶：363186
Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
標簽： available libraries Although nearly
上傳時間： 2014-01-22
上傳用戶：zhoujunzhen
