Adrian Călăvie

Currently working on a custom Jupyter MBSE solution leveraging React, Typescript and Python. Previously worked on a desktop MBSE Solution using C++, Qt & Python.

Working on my bachelor’s degree. The areas of R&D are DSP, concurrency and real-time changes.

I was an apprentice during the Curious Minds Summer School. I took courses on modern C++ and worked on a C# project.

Took a course named ‘Neural Networks in your Hands: Tensorflow on a Mobile’. I learned the basics of AI, ML and NN.

Took a course named ‘Developing a Web App’. I learned about web apps and versioning systems.

Transilvania University of Brasov is a public institution of higher education in Braşov, Romania, which through the education it offers, through scientific research and by the number of students represents one of the major universities of Romania.

Mainly focusing on web development and modern technologies, including AWS Cloud, Java Spring, IoT, and Networking.

Transilvania University of Brasov is a public institution of higher education in Braşov, Romania, which through the education it offers, through scientific research and by the number of students represents one of the major universities of Romania.

Here I took courses about Algorithms, Data Structures, Web, Android, Cloud and Programming Paradigms. Some languages I’ve learned are C, C++, C#, Java, Kotlin and Python.

This is my first 'big' project. I cooperated with other two colleagues on making this Modern C++ app.

Mosaic++ is a tool that produces photomosaics. It offers a range of options that have an effect on the final result. It can be used for entertainment purposes or be converted to an applicable tool in fields like image processing or mesh generation.

This project helped me learn more about data plotting and QT.

A plotting project made with Qt and QCustomPlot. The purpose of the app is to generate graphs for various functions and to observe the steps taken by the algorithm in order to obtain the correct plotting.

One of the homeworks at a Graph Theory course I took required us to compute the shortest path between two points on the map of Luxembourg. We were given the input data as a massive xml file consisting of nodes and edges and our task was to translate the latitude and longitude values into pixels on the screen, to plot them and let the user choose two points on the map, the points to be chosen would be the closest to where the mouse clicks. Also, we were required to implement both Dijkstra’s and Bellman-Ford’s algorithm.

This C++ code from 2019 solves the x-puzzle problem. I wrote it in my first year at University. The algorithm uses states to verify if the current puzzle is in ‘final’ form or not. It firstly checks if the game is solvable or not based on the information on this site. If it is solvable, it searches for the best move set(the one with the lowest number of moves that reaches a ‘final’ state) using A*.