Homepage of Hana ... HH logo


Unique visitors
2019-08-23 1
day before 5
Total 9428
Daily average 6
Days 1640
see more

   Previous Next   
August 2019
S M T W T F S
1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30 31
week number: 34

Valid HTML 4.01 Strict

Valid CSS!

Programs

SFOLD

SFOLD calculates sfermion decays in the MSSM at full one loop level. Programmed in Fortran 77, C and Mathematica. Downloadable here.

Surface generator

Run me!

It's a 3D surface generator.

Scene

Run me!

It's a 3D scene with simple objects. You can walk through the scene (and throgh the objects). I have not used any graphics library like DirectX or OpenGL. All the rasterization I did by myself. Ilumination is included, shadows not yet. The code still needs some speeding up.

Huffman Coding

Run me! source files

Huffman coding.

Hashing

Run me! source files

Collisions are treated by chaining.

Skeleton 2D

Run me! source files

We used thinning technique. The program may not create connected skeleton.

Trained Sin

Run me! source files

We train the neural network to calculate the function (1 + Sin(x))/2. We used the back propagation algoritm.
Note: When putting real number for the error, you should may use comma instead of dot.

Trained Sum

Run me! source files

The program is supposed to calculate the sum of five numbers. The sum results from training the linear function f = w0*x0 + w1*x1 + w2*x2 + w3*x3 + w4*x4 + w5. We used the iterative numerical technique called gradient descent. Please, use intergers for input parameters.

Trained Sum 2

Run me! source files

The program is supposed to calculate the sum of five numbers. The sum results from training the linear function f = w0*x0 + w1*x1 + w2*x2 + w3*x3 + w4*x4 + w5. We used the Newton method. Please, use intergers for input parameters.

Mandelbrot Set

Run me! source files

Program displays the Mandelbrot set. You can also move and zoom the view.

Subsequence

Run me! source files

This program finds the biggest subsequence from string s2 in string s1.

Example: s1 = AABACCA, s2 = ABDC, biggest subsequence = ABC

The following table should be sufficient to understand how the program works:

A A B A C C A
0 0 0 0 0 0 0 0
A 0 1 ↖ 1 ↖ 1 ← 1 ↖ 1 ← 1 ← 1 ↖
B 0 1 ↑ 1 ↑ 2 ↖ 2 ← 2 ← 2 ← 2 ←
D 0 1 ↑ 1 ↑ 2 ↑ 2 ↑ 2 ↑ 2 ↑ 2 ↑
C 0 1 ↑ 1 ↑ 2 ↑ 2 ↑ 3 ↖ 3 ↖ 3 ←

If the letters are equal the arrow points up-left, otherwise the arrow points to the bigger number (if numbers equal you can choose between up and left).

Heapsort

Run me! source files

Classic heapsort.

Moving the square

Run me! source files

When you click on the square you can drag it.

Connection to SQL

source files

You can have a look on how to connect to a database and how to retrieve data from a table in C#. The table in the source file is named 'Vendor' and has two columns: 'V_Code' and V_Name.

Serialization and C++

source files

The C++ language provides limited support for file processing. C++ supports saving only values of primitive types such as short, int, char double. In this example we show how to save and read object comprising also dynamical array.