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.) I have attempted to provide copious comments in the code and hope that a knowledgeable C programmer can quickly map the approach as described in the paper to what is in the program.
標(biāo)簽： two-dimensional computational polarization non-zero
上傳時(shí)間： 2013-12-13
上傳用戶(hù)：cylnpy
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.)
標(biāo)簽： ptfsf following the contains
上傳時(shí)間： 2013-11-28
上傳用戶(hù)：風(fēng)之驕子
Avalon_VGA，-- This design provides an interface to the Alcahest VGA daughter card. -- The design comprises of an 8-bit VGA driver with Avalon bus interfaces. There are a total of -- three Avalon interfaces.
標(biāo)簽： Avalon_VGA
上傳時(shí)間： 2015-07-07
上傳用戶(hù)：kikye
NetWar是一個(gè)實(shí)時(shí)策略游戲，類(lèi)似于Command & Conquer, Starcraft, 和total Annihilation。這個(gè)游戲只提供了多人模式，LAN上支持最多12人同時(shí)游戲。是用Java開(kāi)發(fā)的。
上傳時(shí)間： 2014-01-02
上傳用戶(hù)：a6697238
Input The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contains N, and the second line contains N integers giving the time for each people to cross the river. Each case is preceded by a blank line. There won t be more than 1000 people and nobody takes more than 100 seconds to cross. Output For each test case, print a line containing the total number of seconds required for all the N people to cross the river. Sample Input 1 4 1 2 5 10 Sample Output 17
標(biāo)簽： the contains integer number
上傳時(shí)間： 2015-10-27
上傳用戶(hù)：plsee
This user’s manual describes SAMSUNG s S3C2440A 16/32-bit RISC microprocessor. SAMSUNG’s S3C2440A is designed to provide hand-held devices and general applications with low-power, and high-performance microcontroller solution in small die size. To reduce total system cost, the S3C2440A includes the following components.
標(biāo)簽： S3C2440A SAMSUNG microprocessor describes
上傳時(shí)間： 2013-12-19
上傳用戶(hù)：nanxia
This user’s manual describes SAMSUNG s S3C2440A 16/32-bit RISC microprocessor. SAMSUNG’s S3C2440A is designed to provide hand-held devices and general applications with low-power, and high-performance microcontroller solution in small die size. To reduce total system cost, the S3C2440A includes the following components.
標(biāo)簽： S3C2440A SAMSUNG microprocessor describes
上傳時(shí)間： 2013-12-25
上傳用戶(hù)：weixiao99
SAMSUNG’s S3C2440A is designed to provide hand-held devices and general applications with low-power, and high-performance microcontroller solution in small die size. To reduce total system cost, the S3C2440A includes the following components.
標(biāo)簽： applications hand-held low-power S3C2440A
上傳時(shí)間： 2013-12-18
上傳用戶(hù)：zhenyushaw
Matrix Pencil Method（矩陣束） 和MUSIC 算法的比較，只需要簡(jiǎn)單的運(yùn)行total即可。
標(biāo)簽： Matrix Pencil Method MUSIC
上傳時(shí)間： 2014-01-21
上傳用戶(hù)：1159797854
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標(biāo)簽： represented integers group items
上傳時(shí)間： 2016-01-17
上傳用戶(hù)：jeffery
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
