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.
<h3>Revamping the Titler Tool</h3> <p><strong>What does the titler tool do?</strong> : The titler tool is used to create clips containing text and images, which can be composited over videos.</p> <p><strong>The problem</strong>: The titler tool renders XML using an MLT module which uses QGraphicsView. QGraphicsView is considered deprecated. Moreover, adding features to the current back end is difficult and is known to be buggy.</p> <p><strong>The solution</strong>: Rewrite the tool's backend using QML and QQuickRenderControl by implementing a new QML MLT module which can render QML frames, and to also create a basic titler which can render basic QML templates.</p> <p><strong>Why QML?</strong>: QML, in general, allows creating powerful animations with ease and flexibility which means new features can be added to the titler.</p>
<p>This project will improve the CDT for eclipse by using cquery or clangd language server for getting source code analysis of a C++ project.</p>
<p>The current implementation of grep in mercurial is quite counter-intuitive and not what most people would expect it to do. For example one of the most common things people want to do with grep is grep the current directory, but only files under hg control. But this is not the default behaviour of grep as of now.</p> <p>There are other issues with the --all flag which reports irrelevant revisions in the output. This project aims at fixing these issues with the grep.</p> <p><strong>Goals of the project:</strong></p> <ul> <li>grep command by default should only search for the files tracked by the current working directory</li> <li>If passed a revision like: hg grep -r then it should search on the files tracked by the revision sets passed</li> <li>Introduce a --diff option to hg grep which does exactly what hg grep --all do right now</li> <li>Deprecating the --all flag in favour of --diff.</li> <li>Fixing <a href="https://bz.mercurial-scm.org/show_bug.cgi?id=3885" target="_blank">https://bz.mercurial-scm.org/show_bug.cgi?id=3885</a> and other similar issues marked duplicate of this</li> <li>Documentation of all the above tasks</li> </ul>
<p>This project will be executed in two phases. First phase is sharing feedback about uploaded photos in the form of number of images used in Wikipedia/Wikivoyage/etc articles, images edited by someone else, images that have been featured or received some award, barnstars and thanks received. Along with it add necessary gamification to ensure user participation doesn't dwindle. Second phase is based on improving user knowledge on the copyrights of the image uploaded. In case the, number of images reverted is greater than the threshold percentage, then a warning is popped up along with a suggestion to take the quiz. Before the quiz, the tutorial is also shown before quiz.</p>
<p>This is a proposal to work on the project that adds the Google Blockly editor to XWiki and will facilitate users who're inexperienced at coding to do so with ease using the Blockly toolkit.</p> <ul> <li>I plan to introduce custom tools for object variables like doc, content etc which in turn have dropdown menus and textfields for getting and setting the attributes and methods</li> <li>These blocks will then generate the code, that the user had to write on his own earlier</li> </ul>
<p>Rook is an open source orchestrator for distributed storage systems running in kubernetes, currently in alpha state and has focused initially on orchestrating Ceph on top of Kubernetes. There is no option for Network File System (NFS) yet. This project aims to add NFS as another storage backend.</p>
<p>The LTE and Wi-Fi Coexistence module has been quite popular with ns-3 users. But currently, it is detached from the upstream ns-3-dev and missing improvements that has been implemented on the upstream. It is also created to implement TR 36.889 test scenarios, making it difficult to customize for other cases.</p> <p>The goal will be successfully merging the existing works to ns-3-dev, improving the flexibility of scenario deployment, and improving usability in terms of getting more useful data out of the simulations.</p>
<p>Testing is crucial to the development of any software and MDAnalysis currently uses nose to test their code. Unfortunately, nose is no longer under active development so the community has decided to shift over to pytest. Another problem is the performance of the current testsuite in terms of execution time. Currently the TravisCI build takes around 45 minutes (50 min. being the cap). This causes builds to fail because they are terminated on exceeding the maximum execution time. The objective of this project is to implement this shift in a way that existing development work is not affected and to improve performance of the existing test cases and to make it more maintainable in general.</p>
<p>A lot of Medical Imaging data used and shared today is formatted using the DICOM standard. It can be collected and rendered into a Descriptive Data Structure which can be rendered into HTML through the use of POSDA, however this software is coded in Perl run on a server back-end. This makes the program not portable, slow, and dependent on the up-time of the server it is hosted on. Therefore the goal of this project is to design and release a portable, stand-alone program coded in JavaScript able to mirror what POSDA does and interpret and display DICOM IOD tables on any device with a browser as well as add new features such as new rendering parameters and make UI more usable and responsive.</p>
<p>This project aims to get the current AMD IOMMU patches merged into Qemu as well as introduce interrupt remapping support to the current AMD IOMMU implementation. Interrupt remapping is a feature implemented on Intel and AMD iommus that allows interrupts from peripheral devices to be intercepted, validated and posted to the specific CPU cores based on the information stored in the in the relevant data structures programmed by System Software.</p>
<p>Journal Rethink is to enhance Journal such that students could use it as a platform to do their project-work. The project includes adding extensions like the Shared mini-Journal to the Journal which can be used as a platform for working on the project-based school activities by students.</p>
Modern sandboxed applications (like Flatpaks) rely on XDG Desktop Portals for essential OS integration, such as screen sharing, opening files, or sending notifications. Tiling window managers often lack a complete and well-maintained xdg-desktop-portal backend, leaving users with a broken experience for many applications. This project will create a working xdg-desktop-portal backend for the Regolith desktop environment. Regolith is a productivity-focused Ubuntu-based desktop environment that combines tiling window managers (Sway, i3) with GNOME components for system management and GUI features. By using xdg-desktop-portal-luminous as a foundation, this project will deliver native portal implementations for complex features like Background and Clipboard, closing a major functionality gap. A key focus of this project is also on upstream contributions. The work will involve implementing the missing Usb portal in the xdg-desktop-portal-gtk backend and helping define and implement a new ScreenCast API version with audio support. This upstream work will directly benefit the entire Linux desktop ecosystem by providing a standard, secure way to capture application audio, a critical feature for apps like Discord and OBS Studio.
Problem: Drupal users frequently struggle to find specific information across site content, configuration, and documentation because traditional keyword search fails to understand user intent or context. Solution: Develop a decoupled Retrieval-Augmented Generation (RAG) AI assistant. The system will use a Python/FastAPI backend to manage vector embeddings (via databases like Milvus, Pinecone, or ChromaDB) and integrate with a custom Drupal module. This allows users to ask plain-English questions and receive accurate, permission-aware answers grounded in the site's actual data. Deliverables: A Python-based embedding and query API, a custom Drupal module (`ai_knowledge_assistant`) with indexing hooks, an admin configuration interface for managing AI/provider settings, and user-facing chat interfaces (a knowledge block and a dedicated page) that include source citations.
This project is about bringing back the drone-cat-mouse chase exercise in the new RoboticsAcademy architecture. Right now this exercise does not work with Gazebo Harmonic and Aerostack2 which is what all the current drone exercises use. My plan is to set up a Gazebo Harmonic world with two drones — a cat drone that the user programs and a mouse drone that flies autonomously following a 3D pattern. Each drone will have its own full Aerostack2 stack. The mouse drone will run its flight pattern directly through Aerostack2 without HAL.py since its behavior is predefined. The user programs only the cat drone through HAL.py to chase the mouse. Deliverables include the complete Gazebo Harmonic world, dual-drone Aerostack2 setup, the exercise integrated into RoboticsAcademy with the RADI container, documentation, and a reference solution.
The goal of this project is to explore implementing a list-like datatype with enhanced performance. Immutable linked lists are a core datatype in functional programming languages, proving particularly useful in concurrent programs due to the immutability. The most common operations programmers use on an immutable list include random access, sequential accesses, appending, and copy/writes. Unfortunately, sequential access requires a pointer dereference for each node meaning O(n) time which can significantly impact performance. Iteration is necessary for the most popular functions including fold and map and because the datatype is immutable, many changes one may want to make to a list, excluding operations like prepending or removing an element from the head, require allocating a new list which takes O(n) time. This project will design and implement a new immutable linked list datatype with improved performance for the most common operations by leveraging memory/cache locality and mechanical sympathy to improve performance in concurrent programs within the Typelevel ecosystem. The new datatype implements a generalization of the traditional linked list, one where each node contains a constant number of elements rather than one. These nodes, which we call blocks, each contain an array and a pointer to the next block. Deliverables: -Outline direction and priorities for the new datatype based on existing alternatives and how to best integrate in to the greater Typelevel ecosystem (improve performance in concurrent programs by integrating it in to other datatypes ex. Typelevel fs2's Channel) -Research and design the new datatype -Implement the interface for the new datatype -Benchmark and compare theoretical asymptotic bounds against existing immutable linked list-like data structures -Proper documentation and tests
I propose the implementation of the Pathfinder algorithm for variational inference in PyMC. The Pathfinder algorithm is a recent advancement in the field of approximate Bayesian inference, offering a scalable and efficient approach for approximating posterior distributions. Integrating this algorithm into PyMC, a popular probabilistic programming library, would provide users with a powerful tool for conducting Bayesian inference on complex models. The Pathfinder algorithm's ability to handle high-dimensional parameter spaces and large datasets makes it particularly well-suited for applications where traditional Markov chain Monte Carlo methods may be computationally expensive or impractical. This addition to PyMC would enhance its capabilities, making it more versatile and accessible for a broader range of Bayesian modeling scenarios.
We developed the first algorithm selector, Btor2-Select, for the word-level hardware model-checking problem described in the Btor2 language. Given a Btor2 instance, Btor2-Select selects and applies the expected best verifier(s) from a pool of hardware and software tools. These decisions are based on various machine learning (ML) models, trained upon historical performance data, mapping from instance features to algorithm selections. We proposed two embeddings for Btor2 instances: bag of keywords and bit-width aggregation. Two traditional algorithm-selection ML models, i.e., empirical hardness model and pairwise classifiers, were implemented in Btor2-Select. More importantly, we developed a novel algorithm selection and scheduling framework based on deep reinforcement learning (RL). This RL framework allows for adaptive algorithm selection throughout the solving process, leveraging dynamic information such as previous attempts and elapsed time. Upon evaluation, the adaptive algorithm selector outperformed the best non-portfolio solver (SBS) by 24.4%. Moreover, it closed 6.69% more SBS-VBS gaps than the best non-adaptive algorithm-selection method, a common performance indicator for algorithm selectors. All the codes, experiments, and data can be found at: https://gitlab.com/sosy-lab/software/btor2-select.
This project aims to address the lack of a modern, platform-agnostic graphics library for Fortran by designing and implementing a graphics canvas API along with basic graphics classes and multiple backend implementations. The plan involves creating tools for 2D graphics primitives such as points, lines, and brushes, as well as designing an abstract graphics canvas API. This API will provide a unified interface for interacting with various backend implementations.
The quest for new physics has encompassed and intrigued physicists for decades. At CERN LHC, high-energy proton-proton collisions can create new, unstable particles, which then further decay to produce sprays of outgoing particles. These ”collision events” act as a bases to identify events involving novel, uncharted physical processes (Higgs Boson, 2012). The topology of these events is governed by the underlying particle production mechanism. A momentum conserving spray of particles - called Jets, is an event topology governed by Quantum Chormodynamics (QCD). A collision event contains multiple such jets, a core task of data analytics at CERN experiments revolves around the task of jet-tagging. The Machine Learning Revolution, propelled by dedicated and streamlined Neural Computation has revolutionized this field of tying particle jets to their originator particle. Over time the analytical, QCD-driven approaches for tagging have been replaced by deep-learning based approaches. Using different input representations of particle jets - particularly images, sequences, trees, sets and graphs, most notably deep neural networks (DNNs) - CNNs, RNNs etc. have been used to build new jet-tagging algorithms automatically from simulated samples (from Pythia and Delphes) and even real data. Through this GSoC cohort, I propose a novel scheme to achieve the task of jet-tagging by exploiting the most naturally sound, robust representation scheme - that of unordered structures of constituent particles of a jet, and methods to act upon them - namely through Graph Neural Networks (GNNs) that utilize attention-based/hypergraph methods to account for long-distance correlations. After viewing a jet as a Particle Cloud, we utilize a plethora of novel schemes and also a customized Neural Architecture to achieve learning over the dataset of Particle Jets. We also work robustly at the inference level, extracting meaningful measures of optimality and correctness of the used approach.
The goal of this GSOC program is to solve the problem of upgrading/downgrading JSON Schema between all the dialects using language agnostic rules so that any implementation in the future can modify and use rules accordingly. The rules are meant to be declaratively stated in JSON files and format, making them simple to comprehend and apply in any programming language. Existing alter schema project supports upgrades from draft 04 to 2020-12 drafts and does not cover all the edge cases; this limitation will be taken up in GSoC revamp to implement both upgrades and downgrades between draft 0 and 2020-12 including openAPI schema too.
This project aims to enhance EvalAI's functionalities by automating large worker deployments in AWS, adding relevant features for efficient challenge management and also writing a robust and efficient test suite. The focus of the project is: To automate large worker deployment processes on EvalAI using AWS EC2 instances, reducing infrastructure running costs. Make challenge management seamless and less reliant on the admins reducing the dependency of challenge hosts on EvalAI admins. To make EvalAI more reliable and error-free by incorporating tests for different frontend and backend components. Having robust tests prevents making code-breaking changes to the codebase. This task will include adding unit tests for the API suite, prediction upload evaluation workers, code upload evaluation workers (on EKS), and integration tests for end-to-end testing of all components.
Currently, the static analyzer offers little dedicated support for C++. Even when projecting the most straightforward valid C test cases to C++, the checkers output incorrect diagnostics, either by their absence or imprecision. The issues this project aims to tackle are all prerequisites to further extensions of C++ support. The aim of this project is to enable the analyzer to self-analyze itself.
For an example like: template<class T> struct Foo { using type = T; }; using Bar = int; Foo<Bar>::type baz; In clang, baz’s type will not desugar to Bar, as the member access in Foo<Bar>::type will go directly for the canonical type of the template instantiation. This will cause any diagnostics printed from this type to miss this information. If there were an attribute attached to the Bar typedef, such as alignment, this would be lost on the baz declaration. In this proposal, we want to lift this restriction by implementing the missing functionality in clang.
TCAM is used to search contents stored in memory. Although it is faster compared to SRAM it has disadvantages including increased size, higher energy consumption, and reduced efficiency. The major goal of this project is to emulate a novel approach for TCAM functionality by emulating it with SRAM blocks generated using OpenRAM that will help with optimal resource efficiency. This will allow us to use the high-speed of the TCAM architecture by using SRAM cells which are cheap and power-efficient. My goal with this project is to design a python based compiler environment that will help in achieving such capability.