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.
This project proposal aims to implement a cluster of priority features in zulip/zulip related to the settings system and write API documentation for various endpoints.
NeuroML and PyNN are open, simulation independent formats that are used to convert large scale network models. Network models incorporating realistic connectivity such as network structure, cell or synapse properties are being widely used to understand information processing in cortical structures. Moreover, making the models available on Open source brain repository along with documentation will enable the computational neuroscientists community to test them across multiple simulator implementations. The major goals of the project are - 1. Verify, improve and test the original model code in NetPyNE locally 2. Convert the published network model involving channels, cells, connectivity developed in a simulator specific format to NeuroML 3. Document and illustrate the baseline expected behaviour of the model and sharing them across Open Source Brain repositories
This project will focus on implementing a number of high priority features for Zulip web app. This includes addition of new features, improving user experience, refactoring some methods and fixing minor bugs.
The current method used for finding edge disjoint spanning trees in directed graphs (digraphs) relies on mixed integer linear programming and it may fail on some instances. The goal of this project is to implement a combinatorial solution as presented in H.N. Gabow's A Matroid Approach to Finding Edge Connectivity and Packing Arborescences. The final deliverable will be an optimized implementation of this algorithm as well as docstrings and doctests that conform to SageMath's Conventions and Guidelines.
<p>To increase the interoperability of the Galaxy Platform with GA4GH Cloud-compliant solutions, the goal of this project is to add support for the TES to the Galaxy and Pulsar. The runner would be implemented in Galaxy, would be able to convert the job requirements from Galaxy to the job script for TES, and would stage the job on TES remotely and actively manage the sent job until its completion. This would allow Galaxy to distribute the jobs across the TES computational Network. According to the TES specification, the Pulsar REST interface could be modified to bring standardization across the services.</p>
<p>For this project, I would like to implement 3D Barycentric Coordinates for Convex Polyhedra with Triangular Faces, which is one of the ideas for this year GSoC. The goal of this project is to extend the CGAL package 2D Generalized Barycentric Coordinates to 3D space, to achieve this, it is necessary to implement several coordinate types, which include coordinates for tetrahedra, 3D Wachspress, mean value, and discrete harmonic coordinates.</p>
<p>The goal of this project is to offer a faithful rewrite of <a href="https://github.com/tabatkins/bikeshed" target="_blank">bikeshed</a>, a tool used for generating many standards, in <a href="https://www.rust-lang.org/" target="_blank">Rust</a>.</p>
<p>This project aims to develop a Kubernetes Operator for XRootD, along with its related documentation, in order to ease and fully automate deployment and management of XRootD clusters. This Operator targets the whole field of existing infrastructure where XRootD can run: development workstations, continuous integration platforms, bare-metal clusters in academic datacenters, and also public cloud platforms.</p>
<p>LibRoadrunner is a high performance SBML based simulator that uses LLVM to generate very efficient runtime code. This enables LibRoadrunner to simulate models on par with compiled C/C++ code. By combining Libroadrunner with standard optimization algorithms it is possible to use Libroadrunner to fit models to data. At present this is done by writing code to link the standard Python optimizer available via scipy with Libroadrunner. Although this works, it is inefficient and for large models, it is not practical. In this project, we would like to develop a C/C++ based differential evolution plugin that can be used directly by Libroadrunner (after integrating it with RRPlugins) without having to go via Python. This would enable us to provide high performance optimization capabilities.</p>
<p>Differentiable Programming is a programming paradigm in which we can differentiate through the program itself. It allows us to exploit the knowledge already embedded in a problem and use existing deep learning techniques to it. This project aims to develop a Ray Tracer in Julia and interface it with Flux/Zygote for Automatic Differentiation support. Also we shall demonstrate the use of this Ray Tracer in downstream Reinforcement Learning Tasks.</p>
<p>Machine Translation is one of the most essential tasks of Natural Language Processing where a lot of research has been done. There are various metrics that are available to evaluate the quality of translation but most are obtained by computing the similarity between an MT hypothesis and a reference translation based on character N-grams or word N-grams. Using the data generated from the annotation of the TED Talk in two or more languages, as well as the relations between frames given in the Berkeley FrameNet Data Release 1.7, our task for this project is to build an automated metric system for machine translation, which is intended to measure the frame distance between sentence pairs in two languages. In this proposal, the task has been modelled as a regression task of predicting accuracy scores. The frames evoked and the related frame network has been used as pivotal features of the model.</p>
<p>Radare is a useful framework for reverse engineering. It has debugger interface and disassembler and visualizer. To analyze programs more efficiently, it needs a decompiler. Radare has its own decompiler ‘radeco’. Some of its analysis are developed, but it is not still implement pseudo C backend. In this proposal, I will describe a plan to make radeco generate pseudo C Code.</p>
<p>This project is about improving Krita overal perfomance by introducing lock-free hash table for storing tiles and improving locks described in proposal.</p>
<p>Eclipse Vert.x is a toolkit for the Java Virtual Machine enabling the implementation of reactive, highly concurrent, polyglot applications. The goal of this project is to implement a lightweight, extensible administration console for Vert.x applications that can be easily mounted as a Vert.x-Web subrouter, and serve as an example for developers wishing to implement complex, real-time applications using the SockJS bridge. A Prometheus-based metrics implementation that ships without an additional Dropwizard dependency would also be released as a separate project in order to benefit users with existing monitoring setups.</p>
<p>Testings of JavaScript application sometimes include modification of their own environment, such as global/native objects extensions and DOM manipulations. To avoid undesirable side effects, they have to be executed in a clean environment as much as possible.</p> <p>Since Intern JavaScript testing framework doesn't have this as the core feature yet, users have to manually reset or sandbox everything they care. The aim of this proposal is to solve this issue by implementing “sandbox interface” to Intern core API and make users get rid of the difficulties.</p> <p>The timeline of this proposal includes the following:</p> <ul> <li>Make friends with Intern's codebase</li> <li>Investigate and discuss with my mentors how this feature will be implemented</li> <li>Write actual codes</li> <li>Fix bugs</li> <li>Test and document everything I implemented</li> </ul>
<p>The Mifos Android Client is currently in version 2. Recently, significant new enhancements including refactoring, implementation of material design, offline, surveys, and new functionalities have been implemented taking it from Version 1 to Version 2. Now the app is still under development and this project aims at releasing the version 3. This will add exciting new features and significant enhancements.</p>
<p>During the project the current model construction will be analysed in regard to performance(i.e. reachability of multiple initial states, scalability and comprehensiveness(adding support for other types of models, i.e. PTAs). Depending on the analysis, it is decided which changes in the current approach enhance the functionality/ performance/ scalability and together with the supervisor a feature list can be defined. Then the implementation of the features is conducted and additionally efficient transformation to a sparse model and full import/export of the explicit model is implemented.</p>
<p>Collect Passive DNS data from various sources; display, correlate and analyze them.</p>
<p>Our current format handling is brittle, requiring transfer rules to explicitly deal with blanks, and some times inevitably outputting them in the wrong order. This project is to do blank-handling automatically, by treating some blanks as "glued to words" (e.g. italics, emphasis), and others as paragraph-level blanks.</p>
The Goal of this project is to add the functionality to import and export OpenTimelineIO (.otio) files in Blender. OpenTimelineIO is an open-source interchange format and C++ API that represents an editorial cut as a structured, JSON-serialized object graph carrying precise cut information, media references, markers, transitions, and effects across non-linear editors (NLEs). With the ability to import and export .otio files in Blender, the artists would be able to work using different softwares on the same timeline keeping Blender in their production pipeline.
Stochastic simulation is essential in computational biology and infectious disease modelling, but existing methods require a trade-off between accuracy and computational efficiency. While exact stochastic simulation captures dynamics in small populations, it scales poorly, whereas deterministic ODE models are efficient but fail to capture stochastic effects. The Jump-Switch-Flow (JSF) framework addresses this by dynamically switching between stochastic simulation and deterministic ODE integration based on population size. However, despite a mature Python implementation, R remains the dominant language in epidemiology and biostatistics, creating a significant accessibility gap. This project will develop rjsf, an R package that provides user-friendly functions for running the Python `jsf` library directly within R workflows via reticulate. Key deliverables include a core simulation function, S7-based result objects, diagnostic and visualisation tools, a comprehensive test suite, and a detailed vignette, with the goal of CRAN submission. As a stretch goal, the project will explore incorporating additional intermediate stochastic simulation methods to further enhance flexibility and performance. The resulting package will enable researchers and scientists to seamlessly integrate hybrid stochastic-deterministic simulation into their existing R-based modelling workflows.
This project aims to develop a Julia module for simulating and optimizing Bell distillation circuits, addressing the challenge of selecting efficient entanglement purification strategies under varying noise and resource constraints. I will first construct a structured database of Bell distillation circuits with associated performance metrics. I will then design an optimization algorithm that selects the most suitable circuit based on inputs such as target fidelity, error rates, and resource availability. The project will include a simulation framework for evaluating circuit performance under configurable noise models. Deliverables include the circuit database, simulation tools, optimization algorithm, and a well-documented, user-friendly Julia product that integrates with existing quantum simulation workflows. This tool will enable researchers to systematically explore and deploy optimal distillation strategies, improving efficiency and accelerating experimentation in quantum computing.
This proposal aims to implement a functional cloud storage integration for VLC Media Player using libcloudstorage Although the open merge request (!7526) introduces basic components such as service discovery and access modules, testing shows that the integration is not usable due to issues in authentication flow, threading, and state handling. For example, authentication cannot be triggered properly from the UI due to preparsing constraints, and token persistence issues lead to repeated login attempts. This project focuses on completing and correcting the integration so that users can reliably browse and access cloud storage within VLC. The work includes restructuring the authentication flow to work correctly with VLC’s threading model, fixing token storage and session handling, and ensuring proper navigation after login. In addition, necessary updates will be made in libcloudstorage to address outdated API usage and improve compatibility with current cloud providers. Testing will be included to validate authentication, directory access, and overall integration stability. By the end of the project, users will be able to log in once, browse their cloud directories, and stream media files directly within VLC.
This project brings two new algorithms from the Boost Graph Library into pgRouting: planar face traversal and k-core decomposition. pgr_planarFaces extracts enclosed city block regions from planar street networks using Boyer-Myrvold planarity testing and BGL planar_face_traversal. The output integrates with PostGIS ST_MakePolygon to build polygon geometries directly from road topology. pgr_coreNumbers computes k-core decomposition using the Batagelj-Zaversnik algorithm, assigning each vertex a core number representing its connectivity level. Core 1 vertices are dead-end streets, core 2 are corridors, and core 3+ form the dense urban grid. Together they create a pipeline: pgr_coreNumbers prunes dead-ends before pgr_planarFaces extracts clean faces. Both run in O(V+E) linear time. If time allows, pgr_isKuratowskiSubgraph will extract the exact K5 or K3,3 subdivision causing non-planarity, completing the planar diagnostic toolkit. pgr_isPlanar is included as a standalone companion function.