Easy Code Sample - Research Projects

This site is collection of programs developed in a different time united by the idea to show simple way of programming something that looks complicated up front. Here is the list of topics:

  1. Job Interview Club. List of tricky programmer's job interview questions.
  2. Static Arithmetic Coding. Provides theoretical explanation of arithmetic coding and several fast encoders capable of managing large alphabets.
  3. Adaptive Arithmetic Coding. Shows several solutions and theoretical explanation for adaptive coding, where each symbol is encoded differently depending on preceding context.
  4. Asymmetric Numeral Systems. New algorithm for the entropy coding implemented without multiplication and division by only logical operations.
  5. Patented Image Compression. Clear explanation of one patent for image compression along with program sample.
  6. C# worker thread and GUI. Shows how to access GUI from worker thread in C#. Elementary example for students.
  7. iROLZ data archiver. The example of data archiver. The program about 600 lines long capable to compress data with ratio and performance near popular archivers: bzip2, WinRAR, BALZ, 7zip.
  8. Non-Huffman tree. Example or usage binary near optimal tree with special advantage. It provides extremely fast update and can be used in adaptive entropy coding.
  9. Binary Coder. Explanation of binary arithmetic coder along with programming sample.
  10. Matrix factorization. Computationally effective procedure for matrix factorization, which supports cases with not all elements known and even cases of multiple given values for particular elements.
  11. Browser Link Interceptor. The tool that effectively captures and collects all links published in browser.
  12. Link Sorter. The tool that resorts the links in search engine result according to semantic proximity for the given large text fragment.
  13. Semantic Search Art. Comparison analysis of eleven text clustering algorithms which are used in different semantic search engines.
  14. Restricted Boltzmann Machines. Elementary explanation of contrastive divergence algorithm.
  15. Urysohn operator. Identification of dynamic systems modelled by Urysohn operator.
  16. Urysohn adaptive filter. New algorithm of adaptive filtering.
  17. Nonlinear adaptive filtering. Nonlinear adaptive filtering from the perspective of artificial intelligence.
  18. Kolmogorov-Arnold Model. Identification of Kolmogorov-Arnold representation.
  19. Generalized Additive Models. Identification of Generalized Additive Models.
  20. AI models accuracy test. Accuracy test for Kolmogorov-Arnold models and comparison to different neural networks.
  21. Divisive Data Resorting. Accounting for aleatoric uncertainty in AI models.
Main menu