P

project

VotePeer Android app casting votes on-chain on Bitcoin Cash. Censorship resistant blockchain voting. Website

The python-native Latina Conservatory version of the SMS (Spectral Modeling Synthesis) tools developed by Xavier Serra in his Phd thesis in 1989.

a pure python library to convert MIDI files in csound scores

This is an automatic README markdown filler to quickly fill up README.md lessons with contents. Natively written in ruby.

No Fuss Computing's Operations Jobs and data

Template repository for an initial project's super project repository.

mo2tex is a pure ruby Monte Ore to LaTeX table combiner.

tmd* is a simple tendency mask designer.

Proyecto con raspberry pi pico para tener un gadget monitorizando el clima del entorno en tiempo real

This project focuses on extracting and visualizing stock data using Python libraries such as yfinance for historical stock prices and web scraping techniques to gather company revenue data. It provides a comprehensive analysis by plotting both stock prices and revenues over time for companies like Tesla and GameStop.

This project predicts house prices using machine learning models based on the King County House Sales dataset. It explores Simple Linear, Multiple Linear, Polynomial, and Ridge Regression models, comparing their performance in terms of accuracy. The best model identified is Polynomial Regression, achieving an R² score of 0.75.

Change features for a number of projects or all projects in specified groups.

Advanced and minimalistic operating system. See GitHub project README.md files

This Python script merges all PDF files in the current directory into a single PDF file named "merged.pdf" using the PyPDF2 library. It iterates through the PDF files, appends their content to a PdfWriter object, writes the merged content to a new file, and then closes the PdfWriter object.

The Python script utilizes the win32com library to interact with the Windows Speech API (SAPI), prompting the user to input text to be spoken aloud. It continuously speaks the input text using the default system text-to-speech engine until the user inputs "-1" to terminate the program.

The aim of N-Queens Problem is to place N queens on an N x N chessboard, in a way so that no queen is in conflict with the others.

This Python code employs the Depth-First Search (DFS) algorithm to find a path from "Arad" to "Bucharest" in the Romania map. It uses a priority queue, backtracking, and a graph representation. The DFS path is printed at the end. Skills demonstrated include graph traversal, priority queue usage, and DFS algorithm implementation.

The code uses backtracking to solve the Constraint Satisfaction Problem (CSP) of map coloring. It checks if assigning colors to regions follows the constraint that no adjacent regions have the same color. The skills involved include algorithm design for backtracking, recursion, and solving CSP problems. The implementation uses Python.

Implementation of UCS on Romania to find shortest distance from Arad to Bucharest based on best-first search algorithm. It uses a dictionary that stores current city mapped to (parent city, current best distance), and frontier is a priority queue to process nodes containing (node id, current city, priority value).

This repo is for the final project of DAW, "Focus Monitor" with Ganglia Monitoring and Nagios Core.