-
ABC_FDTD_Die(T) Implements simulation of a Gaussian Pulse
over T time steps. ABC are for free space. If boundaries are in
the Dielectric medium then the ABC fail. Dielectric medium begin and
end can be specified with the code
標簽：
ABC_FDTD_Die
Implements
simulation
Gaussian
上傳時間：
2013-12-22
上傳用戶：caiiicc
-
ABC_FDTD_Die(T) Implements simulation of a Gaussian Pulse
over T time steps. ABC are for free space. If boundaries are in
the Dielectric medium then the ABC fail. Dielectric medium begin and
end can be specified with the code
標簽：
ABC_FDTD_Die
Implements
simulation
Gaussian
上傳時間：
2014-07-27
上傳用戶：LIKE
-
粒子效果演示(附代碼)
利用C++所提供的一些標準容器很容易實現粒子效果.
簡單的說就是,將粒子數據寫在一個類里面,有一個粒子源,不停地生成粒子,然后放入一個stl::list中(push_back()方法), 然后在一個循環中遍例粒子鏈表,并渲染粒子,粒子的參數并不斷更新,如果粒子的ALPHA值小于0,即不可見了,即代表粒子已經死亡, 即從list中刪去(erase()方法), 銷毀死去的粒子很重要, 如果搞忘了這一步, 你的內存很快就會被吃掉干凈了.
第一個版本是用交錯平面畫的粒子.
第二個版本是用Point Spirit(點精靈)畫的粒子,
可以看看效果上面的區別
SPACE - 暫停粒子源發射粒子
LINK中忘記去掉cg.lib cgGL.lib 了, 此程序不需要CG, 如果要編譯請去掉.
標簽：
list
push
stl
代碼
上傳時間：
2013-12-15
上傳用戶：jing911003
-
A "code-what"? Unless you have spent some time working in the area of reverse engineering, chances are you have not heard of the term "codecave" before. If you have heard of it, you might not have read a clear definition of it or quite understand what it is or why it is useful. I have even asked seasoned assembly programmers about the term before and most of them had not heard of it. If it is new to you, do not worry, you are not the only one. It is a term that is scarcely used and is only useful in a reverse engineering context. Furthermore, is it "codecave" or "code cave"? I am not quite sure, but I will try my best to refer to it consistently as a "codecave". A space may sneak in there from time to time
標簽：
engineering
code-what
chances
reverse
上傳時間：
2014-01-17
上傳用戶：hn891122
-
The basic principle using the branchand-
bound strategy to solve the traveling
salesperson optimization problem (TSP)
consists of two parts.
There is a way to split the solution space.
There is a way to predict a lower bound for a
class of solutions.
There is also a way to find an upper bound of
an optimal solution.
If the lower bound of a solution exceeds this
upper bound, this solution cannot be optimal.
Thus, we should terminate the branching
associated with this solution.
標簽：
salesperson
principle
branchand
the
上傳時間：
2017-02-19
上傳用戶：comua
-
documentation for optimal filtering toolbox for mathematical software
package Matlab. The methods in the toolbox include Kalman filter, extended Kalman filter
and unscented Kalman filter for discrete time state space models. Also included in the toolbox
are the Rauch-Tung-Striebel and Forward-Backward smoother counter-parts for each filter, which
can be used to smooth the previous state estimates, after obtaining new measurements. The usage
and function of each method are illustrated with five demonstrations problems.
1
標簽：
documentation
mathematical
for
filtering
上傳時間：
2014-01-20
上傳用戶：changeboy
-
documentation for optimal filtering toolbox for mathematical software
package Matlab. The methods in the toolbox include Kalman filter, extended Kalman filter
and unscented Kalman filter for discrete time state space models. Also included in the toolbox
are the Rauch-Tung-Striebel and Forward-Backward smoother counter-parts for each filter, which
can be used to smooth the previous state estimates, after obtaining new measurements. The usage
and function of each method are illustrated with five demonstrations problems.
1
標簽：
documentation
mathematical
for
filtering
上傳時間：
2013-12-10
上傳用戶：zxc23456789
-
cordic methods describe essentially the same algorithm that with suitably chosen inputs can be used to calculate a whole range of scientific functions including sin, cos, tan, arctan, arcsin, arccos, sinh, cosh, tanh, arctanh, log, exp, square root and even multiply and divide.
the method dates back to volder [1959], and due to its versatility and compactness, it made possible the microcoding of the hp35 pocket scientific calculator in 1972.
here is some code to illustrate the techniques. ive split the methods into three parts linear, circular and hyperbolic. in the hp35 microcode these would be unified into one function (for space reasons). because the linear mode can perform multiply and divide, you only need add/subtract and shift to complete the implementation.
you can select in the code whether to do the multiples and divides also by cordic means. other multiplies and divides are all powers of 2 (these dont count). to eliminate these too, would involve ieee hackery.
標簽：
essentially
algorithm
describe
suitably
上傳時間：
2017-03-02
上傳用戶：litianchu
-
In computer vision, sets of data acquired by sampling the same scene or object at different times, or from different perspectives, will be in different coordinate systems. Image registration is the process of transforming the different sets of data into one coordinate system. Registration is necessary in order to be able to compare or integrate the data obtained from different measurements. Image registration is the process of transforming the different sets of data into one coordinate system. To be precise it involves finding transformations that relate spatial information conveyed in one image to that in another or in physical space. Image registration is performed on a series of at least two images, where one of these images is the reference image to which all the others will be registered. The other images are referred to as target images.
標簽：
different
computer
acquired
sampling
上傳時間：
2013-12-28
上傳用戶：來茴
-
SQL中的單記錄函數
1.ASCII
返回與指定的字符對應的十進制數
SQL> select ascii( A ) A,ascii( a ) a,ascii( 0 ) zero,ascii( ) space from dual
A A ZERO SPACE
--------- --------- --------- ---------
65 97 48 32
2.CHR
給出整數,返回對應的字符
SQL> select chr(54740) zhao,chr(65) chr65 from dual
ZH C
-- -
標簽：
ascii
SQL
select
ASCII
上傳時間：
2017-04-14
上傳用戶：330402686
