Find open source projects actively accepting contributors. Search repositories, filter by program milestones, difficulty tags, or tech stack.
Use our Orbit AI Matcher to find out! Get instant matching scores based on your developer skills, preferred frameworks, and contribution experience.
Convert your selected open-source project into a winning GSoC, LFX, or Outreachy application using Proposal Studio.
Strong gravitational lensing is a promising probe of the substructure of dark matter to better understand its underlying nature. Deep learning methods have the potential to accurately identify images containing substructure, and differentiate WIMP particle dark matter from other well-motivated models, including axions and axion-like particles, cold dark matter etc. Gravitational lensing data is often collected at low resolution due to limitations of the instruments or observing conditions. Image super-resolution techniques can be used to enhance the resolution of these images with machine learning, allowing for more precise measurements of the lensing effects and a better understanding of the distribution of matter in the lensing system. This can improve our understanding of the mass distribution of the lensing galaxy and its environment, as well as the properties of the background source being lensed. This project will focus on the development of deep learning-based image super-resolution techniques to enhance the resolution of gravitational lensing data. Furthermore, we will also investigate leveraging the super-resolution models for other strong lensing tasks such as regression and lens finding.
The Red Hen Anonymizer is a software that uses deep learning and signal processing techniques to anonymize audio-visual data. The proposed project aims to expand the software’s capabilities by adding two new features for visual data anonymization, namely Level Wise Anonymization and Anonymization using StarGANv2. Additionally, the project proposes to add a new feature for audio data anonymization, namely Anonymization According to the Anonymized Face, while retaining the existing features. The new algorithms are based on deep learning and require GPU power for training. The objective is to create a versatile and robust software, with a user-friendly interface. The final deliverable will be a complete anonymization engine integrated into a web application, providing users with a convenient one-click anonymization options that meets their specific needs.
The goal of this project is to improve the user experience of search functionality provided by Documenter.jl by building an intelligent search system that will enable users to easily and quickly find the information they need. The system will use various pre-processing techniques and search algorithms to provide accurate search results and suggestions for related content.
xeus-clang-REPL is a C++ kernel for Jupyter notebooks using clang-REPL as its C++ Interpreter. Cppyy is an automatic, run-time, Python-C++ bindings generator, for calling C++ from Python and Python from C++. Allowing C++ and Python to talk between themselves in a Jupyter notebook will allow users to switch between Python and C++ at will. This means that data analysts can set up their analysis in Python while running the actual analysis in C++. Thus reducing the time to write and debug their analysis pipeline. Initial support of cross talk between the two kernels has been implemented but this only supports passing primitive data types. This project aims to use Cppyy to extend this to support classes and functions.
This proposal entails revamping the existing Processing error message system so that it resembles the P5.js Friendly Error System (FES). The problem is that the current error messages are often vague and not easily understood by beginners. I plan to remedy this by ensuring each error message four components: the original error generated by the JVM, an identification of the problem an explanation of the problem and when possible, a solution to the error. The error messages should convey the severity of the error and in beginner friendly language, explain the cause of the error. The error message should also provide links to relevant documentation to contextualize the issues and also include the original JVM message. Time permitting, additional features such as translation into other languages, a log of previous errors and a button to accept user feedback.
The main goal for this project is to improve the speed of STARDIS, a Python library that generates synthetic spectra for stars. An easy way to accomplish this quickly is to add Numba JIT compilation. Because this can be accomplished so rapidly, a next goal would be to reimplement parts of STARDIS with C/C++ or Cython extensions. This project proposal therefore consists of four implementation phases, the first pair using Numba and the second pair using C/C++ or Cython extensions, with each pair consisting of a CUDA and a Non-CUDA implementation. I intend to make these improvements incrementally and systematically. I will also benchmark the performance before and after each time I reimplement portions of the STARDIS codebase to both understand how much speed was gained and prioritize what to focus on in each next step.
The aim of this project is to develop an add-on for the OWASP ZAP that enables the import of Postman collections into ZAP. Currently, ZAP supports importing API definitions in OpenAPI and GraphQL formats, but lacks support for Postman collections. This add-on will allow security testers and developers to easily import Postman collections into OWASP ZAP and use its powerful security testing capabilities to identify potential vulnerabilities in their APIs. Additionally, it will include automation support and spidering functionality. This will increase the scope of testing and help ensure the security of APIs developed using Postman.
Problem description: In Apache Doris, dictionary encoding is performed during data writing and compaction. Dictionary encoding will be implemented on string data types by default. The dictionary size of a column for one segment is 1M at most. The dictionary encoding technology accelerates strings during queries. The plans for this problem: 1. Use automated coding methods to improve efficiency 2. Optimize dictionary memory Deliverables: Some PRs for query layer dictionary memory optimization. Some PRs for storage layer coding method optimization. Monitoring items for storage layer memory. Proper documentation and tests for the above-mentioned components.
This project aims to implement point cloud compression algorithm in OpenCV. This project intends to adopt octree as the data structure carrying point cloud. Then, octree is encoded by a variety of coding methods. The encoded result is the compressed point cloud data. deliverables: A point cloud compression algorithm with optional precision support. The relevant functions in the algorithm adhere to the OpenCV code style. A clear explanation document and emample will be provided.
I propose to create a semantic multimodal search engine for collections of transcribed and aligned videos using state-of-the-art artificial intelligence models of different types, including NLP (Large Language Models) for text generation and capturing the semantics of transcriptions, as well as image description models to understand what is being seen in the video. Only focusing on the transcribed text does not help much, considering the context, what is being shown in the video will be helpful. The search engine will list down the most closest matches to the user query containing the metadata like link to the video, video-id, timestamp, text.
The aim is to reimplement the Sugarizer Core architecture using Vue.js components, in order to update and improve the current implementation that relies on Enyo.js, a deprecated web framework. By utilizing Sugarizer Vue.js components, we can ensure that Sugarizer remains a modern and efficient tool for its users. The proposed project involves a comprehensive redesign of the Sugarizer Core UI, which includes developing new Vue.js components and integrating them with the existing Sugarizer codebase. The new components will be designed to improve the user experience, increase efficiency, and enhance the functionality of the app.
Implement member management and implementation of the news feed to include different types of posts that can be used for Photo-intensive, and article-based content. Also, Implement the feature like Caching, Report Feature, multi-reaction, pinned posts, editing posts, deleting posts, and notifications, Hastags to filter posts, and Repost feature to endorse a post, Notification to all org member, if time allows ill also implement uploading a profile photo.
Matplotlib is a popular data visualization library that is used in multiple academic and industrial projects. LaTeX is a common tool for formatting mathematical symbols in most technical plots. Matplotlib supports mathematical typesetting through the ‘mathtext’ module. This LaTeX framework enables mathematical symbols, math fonts, and font encodings to fine-tune the usability of math texts inside a data plot. This project focuses on improving mathtext by examining the known/reported issues within the existing framework, expanding support for new Math-LaTeX-based features, and incorporating robust testing to track down unobserved issues. The overarching goal of this project is to improve the functionality and usability of mathtext for a wide spectrum of use cases.
The existing Keras Database [1] presently features just four functional tutorials for 3D datasets, the latest of which dates back to the summer of 2021. To address this gap, I am proposing an innovative new tutorial for this project that draws on one of the most significant papers in 3D shape reconstruction from 2022: "Learning to Generate 3D Shapes from a Single Example" [2]. The paper proposes a model capable of generating new shapes from a solitary reference 3D shape, presenting a promising new avenue for exploration in this field.
CCExtractor is a widely used application, but some of its code still has issues, and some still exists as part of C code. This project aims to improve CCExtractor by making code-level improvements, fixing existing bugs, and rewriting many of its codes into Rust. By doing so, CCExtractor would become faster and have safe and predictable code.
Protoplanetary disks are birthplaces of planetary systems. Newly forming planets inside a protoplanetary disk interact with gas and dust in the disks and as a result of these interactions various substructures (gaps, rings, azimuthally asymmetric emissions, spirals) form in the disk's dust density distributions. While with current instruments, we can not directly observe these young planets, we can image the protoplanetary disks at very high angular resolutions and can study the morphology of substructures. This project aims to develop an ML model that can predict the presence of forming protoplanets and their properties from the images of protoplanetary disks.
Currently the wasm-emscripten port of VLC (Vlc.js) does not support compilation with shared module. This project enables shared module loading for vlc.js, while finding and mitigating the limitations from underlying tools like Emscripten, Libtool and VLC itself to achieve it.
SQLancer randomly generates test cases consisting of potentially hundreds or thousands of SQL statements. In order to efficiently identify bugs in these statements, automatic reduction is needed to systematically remove the bug inducing statements until a minimal bug-triggering test case is derived. To improve the efficiency and effectiveness of SQLancer for bug detection and resolution in various DBMSs, I propose to undertake the following tasks: 1. Implement delta-debugging algorithms for statement reduction in SQLancer to improve efficiency and speed. 2. Define parser-tree transforms to simplify SQL statements. Since SQL syntax varies among DBMSs, generic parser-tree transforms that can be applied across multiple DBMSs will be implemented, such as removing expression nodes or removing certain clauses from the statement. 3. Generalize statement reduction to additional DBMSs by adding bug reproducers to them. The deliverables for this project include: 1. A delta-debugging algorithm that can reduce the bug-inducing statement. 2. Generic parser-tree transforms that simplify SQL statements. 3. Support of statement reduction for more DBMSs.
The "NWB File Compatibility Testing and Summary Generation via Docker" project aims to streamline the process of testing NWB (Neurodata Without Borders) files for compatibility through the utilization of Docker containers. NWB files are commonly used to store neuroscientific data, and ensuring their compatibility with various software environments is crucial (NWB Explorer in particular). By employing Docker, the project facilitates consistent and reproducible testing across environments under observation. The project also involves the automated generation of summary files, which provide concise insights into the compatibility status of NWB files. This endeavor ultimately enhances the efficiency of assessing file compatibility while promoting standardized practices within the neuroscientific community.
LibreOffice is a large and complex office software and has an extensive CI system to ensure that new patches do not introduce bugs. A lot of unit tests are run in Jenkins when contributers submit their patches to gerrit. It usually takes hours to run all the tests across different platforms, especially in rush hours. Therefore, a better test selection method is needed to reduce the load in testing while maintaining a high software quality. Recently, machine learning is used to predict whether a patch can pass a given test. This can greatly reduce the testing load because we can skip the tests that is very likely to pass when a patch is submitted. Although feature engineering isn't trivial, transformers have been proved useful in feature extraction under similar problem settings. Therefore, I propose that we can implement a machine learning based test selection method to select tests to run in the CI chain to reduce testing load.
Streamlining the OFEP process for enhancing community engagement through automation scripts by doing almost everything they can, from creating proposals by asking questions to users to making the process interactive to assigning and reminding reviewers through Github and Slack. This also involves automating their publishing of the accepted/declined ideas to a newly made website. This would involve me constantly taking feedback from the community to enhance the overall process of contributing the best ideas, hence fostering faster long-term growth of the overall project.
Multi-backend framework support of GradSLAM in Ivy by implementing missing PyTorch APIs: Brief Implementation Plan: 1.) Developing support of a basic low-level API of GradSLAM (which is independent of other GradSLAM APIs) in Ivy frontend and backend (by implementing missing PyTorch APIs), along with its corresponding ivy tests. E.g., gradslam.geometry 2.) Follow a similar implementation strategy for other independent APIs (gradslam.config) or high-level APIs dependent on gradslam.geometry (Eg: gradslam.datasets, gradslam.structures, gradslam.slam, gradslam.odometry) 3.) Develop test script same as in official gradslam repo for all APIs. 4.) Create a tutorial (a jupyter notebook similar to official gradslam notebooks as here) for running GradSLAM using Ivy. 5.) Lastly, showcase better runtime performance of GradSLAM using JAX as the backend framework. Deliverables: -> Multi-backend framework (PyTorch, NumPy, JAX, Tensorflow) support for GradSLAM
MCS uses interepreted execution to calculate SQL expressions results. Here is an example of a SQL expression 'table1.col1 + FLOOR(table2.col1)'. Given that table1.col1 is DECIMAL and table2.col1 is DOUBLE there is a number of conditions that drives the calculation of this relatively simple example in runtime. Given that SQL types and expression tree are known before the query begins it is possible to replace interpretation with JIT to produce specialized compiled bytecode that is: small has no or almost no branches optimized for the specific platform it is run at This is a research mostly project which goal is to produce a set of microbenchmarks that: leverages any JIT compiler available, e.g. LLVM, MIR demonstrates a negative and positive effects of using JIT
FluxML is a deep learning stack built in 100% Julia code, which aims to provide high-speed and light-weight abstraction of GPU, auto-differentiation and deep learning model composites. This project will introduce a specific benchmarking system to adapt to the current requirements of the FluxML community. The system includes GitHub Actions workflows that are triggered by specific events, a FluxML-specific benchmarking tool and a repository for benchmarking code.