Dynamic Family Tree

  •        0

Dynamic Family Tree




comments powered by Disqus

Related Projects


ImageMagick is a software suite to create, edit, and compose bitmap images. It can read, convert and write images in a variety of formats (over 100) including DPX, EXR, GIF, JPEG, JPEG-2000, PDF, PhotoCD, PNG, Postscript, SVG, and TIFF. Use ImageMagick to translate, flip, mirror, rotate, scale, shear and transform images, adjust image colors, apply various special effects, or draw text, lines, polygons, ellipses and Bézier curves.


PyMOlyze is a graphical program to analyze the results of quantum chemistry (HF/DFT) calculations. Features include various population analyses, fragment analysis, monitoring structures during an optimization, and a simple, but powerful, XYZ editor.


An all-electron full-potential linearised augmented-planewave (FP-LAPW) code. Designed to be as developer friendly as possible so that new developments in the field of density functional theory (DFT) can be added quickly and reliably.

The ab initio Spinor Project

The ab initio Spinor Project is a scientifc code project based on density functional theory (DFT) within the ab initio pseudopotential frame work. The code implements the fundamental Kohn-Sham functions in form of two-component spinors, hence allowing to

Fmobsounder - simple university project to manipulate sound etc in FMOD

simple university project to manipulate sound etc in FMOD

Lmfff - force field fitting and simple molecular dynamics code

Utilities that help fitting force field parameters to structure-energy data and also testing the fitted parameters by a built in MD simulations.


This program is intended as an educational tool to explain the concept of Discrete Fourier Transform (DFT). It uses the Fast Fourier Transform to calculate the DFT of a given arbitrary time domain signal and plots it graphically.


snd2fftw is a small tool that reads samples from audio file (WAV for example) and makes DFT on them.

Jwave - Java implementation of a discrete fourier transform (DFT), a fast wavelet transform (FWT), a

JWaveIntroductionJava implementation of a discrete fourier transform (DFT) algorithm, a fast wavelet transform (FWT) algorithm, and a wavelet packet transform (WPT) algorithm all in 1-D, 2-D, and 3-D. The wavelet transform algorithms are using normalized orthogonal (orthonormal) Haar, Daubechies, Coiflet, and Legendre wavelets of the multi-scale analysis. The implementation of JWave is based on the Design Patterns Builder and Strategy and - hopefully - appears user-friendly. UsageExample for 1-D