资源列表
110
- 判断文件夹内的图片文件的最大图片的宽与高-Folder to determine the image file of the largest picture width and high
bragg
- 解决bragg光栅结构中脉冲传输问题 采用split step fourier方法-Bragg grating to resolve the structure of the problem in pulse transmission method using split step fourier
fft
- 傅里叶变换（FFT）的C++/C原码。 设置参数isign=+1为正变换，设置参数isign=-1为反变换。-Fourier Transform (FFT) of the C++/C source. Setting parameters isign =+1 for the transformation, setting parameters isign =- 1 for the inverse transform.
InteractivePeakfinder
- find the peak of a pulse
dataconvertor
- Qt下的文件操作代码，涵盖文件操作的大部分内容-qt
shutdownAtTime
- 设定系统定时关机。到达设定时间后，系统还会弹出DOS窗口询问是否关机。 通过这个小程序可以提醒工作过分刻苦的同志们要注意休息啊！-Set the system off at a certen time. When approach the time, the system will pop-up a DOS window asked if shutdown or not. Through this small program, hardworking comrades can be remi
AES
- AES 供能包~很多東西收集~參考看看唷-AES for a lot of things could package ~ take a look at the collection of reference唷~!!
gar2rnx_win_4_9_01
- After getting the raw data (mainly pseudoranges and carrier phase) from our unit we have to postprocess it to see if they really make sense. I have written a simple program GAR2RNX (a GARmin TO RiNeX translator) that generates RINEX2 compliant files
gar2rnxw
- After getting the raw data (mainly pseudoranges and carrier phase) from our unit we have to postprocess it to see if they really make sense. I have written a simple program GAR2RNX (a GARmin TO RiNeX translator) that generates RINEX2 compliant files
addition1
- Using the equations for partitioning a list of numbers into m partitions that are added separately show that the optimum value for m to give the minimum parallel execution time is when , where there are n processors. (Clue: Differentiate the parallel
addition2
- 3 implementations of adding numbers, using separate send ( ) s and recv ( ) s, using a broadcast routine with separate recv ( ) s to return partial results, and using scatter and reduce routines. Write parallel programs for all 3 implementations, ins
addition3
- divide and conquer method of assigning one processor to each node in a tree for adding numbers (Lecture 6 Chapter 4 section 4.1.2) in terms of communication, computation, overall parallel execution time, speedup, and efficiency.