=== FORTRAN HELP ===
Object-Oriented Programming in Fortran 2003 
http://www.pgroup.com/lit/articles/insider/v3n1a3.htm

   module myModule
    implicit none
    
    type myType
     integer :: n	
     real, dimension (:, :), allocatable :: Rs 
    contains
     procedure :: myMethod
    end type subSystem
    
    type (myType) :: myInstance
    
    contains 
     
     subroutine myMethod ( this, myVar)
      class (subSystem) :: this
      real :: myVar
      integer i
      allocate (this%Rs(3,this%n))
      do i = 1, this%n
       this%Rs(:,i) = myVar
      end do
     end subroutine myMethod
     
    end module glob_vars
    
    call myInstance%myMethod(myVar)


== NOTES ==

{{:prokop:mousemole.zip|}}

 == stranka s knihovnama FZU ==

  *http://sigma.nkp.cz/F/

  *http://www.fzu.cz/casopisy-on-line

 xmgrace http://plasma-gate.weizmann.ac.il/Xmgr/doc/fonts.html

== Graphics ==

Python and C++ based rendering system with good quailty, Radiance and so 
http://www.lightflowtech.com/

CG ethusiast with tutorials good demos and code
http://www.iquilezles.org/




=== TEMP ===
Claky podivat se

Classification of chemical bonds based on topological analysis of electron localization functions
http://www.nature.com/nature/journal/v371/n6499/pdf/371683a0.pdf.

Claudio Gonzales - examples + MetropilisSampling accelerated Budhabort 
http://www.openprocessing.org/portal/?userID=1636

== MonteCarlo Metropolis Samplig ==
Matropolis-Hasting sampling 
http://iopscience.iop.org/0295-5075/76/3/353/fulltext?ejredirect=.iopscience

Geometry interpretation of Metropolis-Hasting 
http://www.jstor.org/stable/3182774?seq=2

courese of Monte Carlo methods: http://people.cs.ubc.ca/~arnaud/CS535D_2007.html

low-discrepancy sequences http://parallel.bas.bg/~emanouil/sequences.html
low-discrepany sequences 2 http://www.puc-rio.br/marco.ind/quasi_mc.html

== Simplecti integrators ==
PSEUDO–HIGH-ORDER SYMPLECTIC INTEGRATORS
http://www.iop.org/EJ/article/1538-3881/119/1/425/990231.text.html

[[wiki test]]


=== Brain Storm ===

[[derivative free optimization]] - Poznamky k algoritmum nevyzadujicim sily (gradienty)

[[Maximum metadynamics]] - Metadynamics which use maximum instead of sum of gaussians. Easier to tune.

[[Border Search a Minima hopping]]

[[Border Search Implementace ve Fireballu]]

[[Kvadraticka Evoluce]]

[[Discrete MetaDynamics]]

[[Uphill damped MD]]

[[BrainSorm]]

=== OTHER ===

[[Wiki Playground]]