https://mbdevpl.github.io/Personal website/portfolio/blog of Mateusz Bysiek.enSat, 03 Jun 2017 15:19:26 GMTNikola (getnikola.com)http://blogs.law.harvard.edu/tech/rsshttps://mbdevpl.github.io/intro/Mateusz Bysiek<div><p>My name is Mateusz Bysiek. I was born in Warsaw, capital of Poland, now I live in Japan where I study computing sciences.</p> <p><a href="https://mbdevpl.github.io/intro/">Read more…</a> (1 min remaining to read)</p></div>CC-BY-SA 4.0https://mbdevpl.github.io/intro/Sat, 03 Jun 2017 03:00:00 GMThttps://mbdevpl.github.io/cv/Mateusz Bysiek<p><a href="https://mbdevpl.github.io/cv/">Read more…</a> (6 min remaining to read)</p>CC-BY-SA 4.0https://mbdevpl.github.io/cv/Thu, 01 Jun 2017 03:00:00 GMThttps://mbdevpl.github.io/posts/mbdevpl-github-io/Mateusz Bysiek<div><p>Hello world!</p> <p><a href="https://mbdevpl.github.io/posts/mbdevpl-github-io/">Read more…</a> (1 min remaining to read)</p></div>Apache 2.0CC-BY-SA 4.0CSSHTMLopen sourcePythonwebhttps://mbdevpl.github.io/posts/mbdevpl-github-io/Sun, 14 May 2017 06:33:21 GMThttps://mbdevpl.github.io/posts/typed-astunparse/Mateusz Bysiek<div><p>The <em>typed-astunparse</em> Python package is to <em>typed-ast</em> as <em>astunparse</em> is to <em>ast</em>. In 10 words: it enables unparsing of Python 3 AST with type comments.</p> <p><a href="https://mbdevpl.github.io/posts/typed-astunparse/">Read more…</a> (1 min remaining to read)</p></div>Apache 2.0open sourcePythonhttps://mbdevpl.github.io/posts/typed-astunparse/Thu, 16 Jun 2016 09:13:00 GMThttps://mbdevpl.github.io/posts/smoothie/Mateusz Bysiek<div><p>Smoothie is a static fluid flow (or heat transfer, if you prefer) simulator, which uses the finite element method. The core of the computational part of the application is done in C++, user interface is made in Qt, while visualization is done in OpenGL.</p> <p><a href="https://mbdevpl.github.io/posts/smoothie/">Read more…</a> (1 min remaining to read)</p></div>C++GNU GPL 3.0LaTeXopen sourceOpenGLQthttps://mbdevpl.github.io/posts/smoothie/Thu, 23 Jan 2014 18:20:00 GMThttps://mbdevpl.github.io/posts/abstract-opencl/Mateusz Bysiek<div><p>A unified OpenCL abstraction layer for C++ and C#. Work in progress.</p> <p><a href="https://mbdevpl.github.io/posts/abstract-opencl/">Read more…</a> (1 min remaining to read)</p></div>.NETC++CsharpLinuxOpenCLQtWindowshttps://mbdevpl.github.io/posts/abstract-opencl/Thu, 04 Jul 2013 08:01:00 GMThttps://mbdevpl.github.io/posts/distprime/Mateusz Bysiek<div><p>Open-source application for distributed discovery of prime numbers. The application is capable of looking up numbers from 2 to 263-1 - per project requirements.</p> <p><a href="https://mbdevpl.github.io/posts/distprime/">Read more…</a> (1 min remaining to read)</p></div>CGNU GPL 3.0Linuxopen sourcehttps://mbdevpl.github.io/posts/distprime/Sun, 16 Jun 2013 14:21:00 GMThttps://mbdevpl.github.io/posts/phinite/Mateusz Bysiek<div><p>Phinite is a windows desktop application that implements an approximate solution to a language theory problem. The task was to create a deterministic finite-state machine that is equivalent to a given regular expression.</p> <p><a href="https://mbdevpl.github.io/posts/phinite/">Read more…</a> (1 min remaining to read)</p></div>.NETCsharpGNU GPL 3.0LaTeXopen sourceWindowsWPFXAMLhttps://mbdevpl.github.io/posts/phinite/Sat, 25 May 2013 17:28:00 GMThttps://mbdevpl.github.io/posts/apriori-all-lib/Mateusz Bysiek<div><p>Apriori and Apriori All are algorithms used for sequence mining, a type of data mining that is very commonly used in a shopping environment. When you see a list of products titled "users who bought this also bought that" or if you see that an alcohol section in a shop is next to snacks section, chances are that sequence mining is behind that.</p> <p><a href="https://mbdevpl.github.io/posts/apriori-all-lib/">Read more…</a> (1 min remaining to read)</p></div>.NETCsharpGNU GPL 3.0open sourceOpenCLWindowshttps://mbdevpl.github.io/posts/apriori-all-lib/Mon, 21 Jan 2013 16:13:00 GMThttps://mbdevpl.github.io/posts/vador/Mateusz Bysiek<div><p>A 3-person team project that we did for Algorithms &amp; Complexity course during our Bachelor studies. The project introduced the problem starting with a rectangular board filled with domino pieces, and defined certain rules for removing them. The task was to design and implement an algorithm that removes (in accordance with rules) as many domino pieces as possible from the board as quickly as possible. Hence the name VaDoR, from VAnishing DOmino pRoblem.</p> <p><a href="https://mbdevpl.github.io/posts/vador/">Read more…</a> (1 min remaining to read)</p></div>C++GNU GPL 3.0open sourceQthttps://mbdevpl.github.io/posts/vador/Wed, 21 Nov 2012 20:40:00 GMT