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.
CGAL is a collaborative effort of several sites in Europe and Israel. The goal is to make the most important of the solutions and methods developed in computational geometry available to users in industry and academia in a C++ library.
This set of simulation files performs a computational complexity performance comparison of the two methods mentioned in the paper. The source is ANSI-C compliant, hence any C-compiler can be used to compile the source code. It has been tested using Visual Studio.net C++ and TI code composer studio C compiler for the TMS320C6701. Note that the performance comparison may be different for different platforms.
ReBEL is a Matlabtoolkit of functions and scripts, designed to
facilitate sequential Bayesian inference (estimation) in general state
space models. This software consolidates research on new methods for
recursive Bayesian estimation and Kalman filtering by Rudolph van der
Merwe and Eric A. Wan. The code is developed and maintained by Rudolph
van der Merwe at the OGI School of Science & Engineering at OHSU
(Oregon Health & Science University).
Learning Kernel Classifiers: Theory and Algorithms, Introduction This chapter introduces the general problem of machine learning and how it relates to statistical inference. 1.1 The Learning Problem and (Statistical) Inference It was only a few years after the introduction of the first computer that one of man’s greatest dreams seemed to be realizable—artificial intelligence. Bearing in mind that in the early days the most powerful computers had much less computational power than a cell phone today, it comes as no surprise that much theoretical research on the potential of machines’ capabilities to learn took place at this time. This becomes a computational problem as soon as the dataset gets larger than a few hundred examples.
Abstract—Mobile devices performing video coding and
streaming over wireless and pervasive communication networks
are limited in energy supply. To prolong the operational lifetime of
these devices, an embedded video encoding system should be able
to adjust its computational complexity and energy consumption
as demanded by the situation and its environment.
D-S.Kim, Y.S.Lee, W.H.Kwon, and H.S.Park, "Maximum Allowable Delay Bounds in Networked Control Systems", Control Engineering Practice (Elsvier Science) (Simulation Example - Matlab Code), PP.1301-1313, Vol.11, Issue 11, December, 2003
monte carlo 仿真英文電子書(shū)
AGuidetoMonteCarloSimulationsinStatisticalPhysics,Second EditionThis new and updated deals with all aspects of Monte Carlo simulation ofcomplexphysicalsystemsencounteredincondensed-matterphysicsandsta-tistical mechanics as well as in related ?elds, for example polymer science,lattice gauge theory and protein folding
The Standard Template Library, or STL, is a C++ library of container classes, algorithms, and iterators it provides many of the basic algorithms and data structures of computer science
Swarm intelligence is an innovative computational way to solving hard problems.
This discipline is inspired by the behavior of social insects such as fish
schools and bird flocks and colonies of ants, termites, bees and wasps. In general,
this is done by mimicking the behavior of the biological creatures within
their swarms and colonies.
