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.
<p>ChemClipse is program for processing mass spectra and chromatograms. Chromatography and mass spectrometry techniques are widely used tools for life sciences, forensics as well as for quality control issues. ChemClipse is based on the Eclipse Rich Client Platform (RCP). ChemClipse offers tools for PCA (principal component analysis). PCA is statistical method used for reducing the number of variables and to find dependent groups of samples. Chromatograms which are processed by PCA can be easily compared then.</p> <p>Tools which are already included in ChemClipse program offer the following functionality for the data evaluation via PCA: loading of data from ocb files,processing of those data and visualization of results</p> <p>Results can be displayed in a peak intensity table editor, two-dimensional plot or a chart which compares error residues.</p> <p>My main goal is to make this process more user friendly, intuitively and to add new ways to display results. I also want to improve a stability and performance.</p>
<p>A changepoint is typically defined as a point in time where the distribution of a data-stream changes in a distinct manner, for example, typically one may look for changepoints in mean, and/or variance. Usually, this is performed in an unsupervised setting where we have no labelled examples of true changepoints. However, in practice, we usually have examples of periods of time where we know no changes should be present, or conversely where changes are expected to exist. When and where such information is available, we can potentially use this to aid our judgement of how to set complexity penalties in the changepoint estimation task, and thus, decide on an appropriate number of changepoints, a task which currently requires time-consuming parameter tuning by domain experts.</p> <p>In this particular project, we seek a simple visualization interface to support, i) human labeling of the data with the aid of several complementary measures on the data-stream such as as mean, trends, min, max, variance, etc. and ii) interactive exploration of the result space suggested by a changepoint detection algorithm. Eventually, any visualization will help communicating the data and respective decisions.</p>
In today's world sequential recommendation systems are used in various domains-- from life sciences to e-commerce and business. For example, within biology and ecology, recommendation systems help track a species behavior by suggesting research on migration patterns, and within e-commerce these systems are used to better a user's online experience. As such, recommendation systems are vital to systems today and is a important field of research. Despite widespread use, traditional sequential recommendation systems face limitations. They primarily on historical user interactions to predict future preferences however struggle to capture contextual dependencies and adapting to dynamic user behaviors. Similarly, existing models predefined embeddings which restrict the ability to adapt and generalize. As such these problems lead to reduced recommendation accuracy, typically for example in cold-start users. As such, the LLMSeqRec proposal will lead to a more personalized recommendation by interpreting and augmenting sequences with semantic context. Through this, LLMSeqRec can make up for the traditional difficulties-- making more accurate and adaptable recommendations personalized for each user.
<p>In Comparative Genomics we compare an unknown gene with some other known genes, for better inference of biological properties of that unknown gene. Identification of Gene Orthology Relation is the most important task of Comparative Genomics, as they tend to preserve similar molecular and biological functions. Thus if we can establish orthology relationships between two genes, we can obtain valuable evolutionary history of the two genes. However, with advanced sequencing depth and expansion in transcriptome data, genes are no longer the proper units for interrogation in functional conservation, evolutionary events, and expressional patterns, especially in the field of alternative splicing. As the accumulation of transcriptomic data, alternative splicing is taken into account in the assignments of gene orthologs and the orthology is suggested to be further considered at transcript level. Whether gene or transcript orthology, exons are the basic units that represent the whole gene structure; however, there is not much reported study on how to build exon level orthology in a whole genome scale. Therefore, it is essential to establish a transcription oriented gene orthology algorithm.</p>
<p>A number of geometric algorithms, such as the triangulation of a point set, employ geometric predicates (implemented as strategies in Boost.Geometry). One example for such a predicate is the 2d orientation test, which, given three points p1, p2, p3, determines whether p3 lies on the left or right side of the line segment that goes through p1 and p2.</p> <p>Using floating-point arithmetics to answer that question can lead to incorrect and ultimately inconsistent results that may cause the algorithm that employs the predicate to produce nonsensical results or crash entirely for certain inputs.</p> <p>Using algorithms for exact floating-point arithmetics combined with some considerations regarding forward error analysis, a complicated method can be implemented that evaluates such predicates robustly and only adaptively increases the precision if necessary to avoid expensive high precision computations whenever possible.</p> <p>I propose a general, automated approach that generates such robust, adaptive predicates from arbitrary arithmetic expressions.</p>
<p>Coreboot is a firmware that aims at replacing the initialisation process performed by the BIOS or UEFI firmware at each boot of the computer system that it’s installed on. In order to achieve this, Coreboot has to understand and support the underlying hardware that it is running on, adding a new motherboard can be quite an error-prone and tedious process that can even take up to several months of work if none or just a few of the device’s components are already supported. One of the tools used to make this process easier is SerialICE, a system software debugger that allows the developer to log and intercept the vendor’s BIOS accesses to the hardware and sends the information through a serial or EHCI debug port.</p> <p>This project idea aims at reducing the time and frustration of this process through:</p> <ul> <li>Improving the workflow of adding a new device thanks to a better integration of SerialICE in the developer’s workflow.</li> <li>Allowing access to a recovery and update of the firmware without an OS environment with the use of a flashrom payload.</li> </ul>
This project aims to improve the integration between ROS 2 and Gazebo by addressing two key challenges: manual bridge configuration and limited support for scalable multi-robot simulation. Currently, users must manually define topic mappings when using ros_gz_bridge, which becomes error-prone and difficult to maintain in dynamic or large-scale environments. In addition, multi-robot simulation requires modifying SDF/URDF files to avoid topic conflicts, making it hard to reuse robot models. To solve these issues, this project proposes a unified communication layer that introduces (1) dynamic bridge discovery to automatically detect and connect compatible ROS 2 and Gazebo topics. (2) a standardized namespacing mechanism for Gazebo plugins to enable seamless multi-robot deployment without modifying robot descriptions. The expected outcome is a robust and scalable framework that reduces configuration overhead, improves interoperability between ROS 2 and Gazebo, and allows developers to launch multiple robots with minimal effort.
<p>End-to-end encryption (E2EE) has been gaining relevance during the last years due to the increasing privacy concerns of users. Encrypting communications between the client and the server using SSL is not enough to protect users privacy, since data can be read in plaintext in the server, which is not trustworthy.</p> <p>It is trickier to perform E2EE into SwellRT documents than it is to perform it into simple chat messages. SwellRT use operational transformations (OTs) to coordinate the insertion and deletion of characters in its documents, so instead of encrypting the entire document, we need to encrypt each operation and still guarantee that the server has enough information to coordinate the document editioning. Fortunately, it is a field that has been researched for many years and we have some studies that have successfully implemented E2EE in Google Docs. We can take their insights to encrypt SwellRT OTs.</p> <p>The project has two parts. First, we need to encrypt and decrypt successfully SwellRT OTs, using a symmetric key. Then, we need to communicate those symmetric keys among users, and here is where we need public key cryptography.</p>
Problem: In Apache RocketMQ 5.x POP orderly consumption, when a PushConsumer's ReceiveMessage response is lost due to network issues, the client generates a new attemptId for the next pull. However, the Broker blocks this new request because it still holds the original attemptId as active until its invisibleTime expires, causing consumption stalling. Solution: 1. Enhance client-side logic (ProcessQueueImpl) to add an application-level timer for each ReceiveMessage request 2. If timer expires without receiving response or definitive gRPC error: • Client assumes response was lost • Reuses original attemptId (instead of generating new one) for retry 3. Leverages Broker's existing capability to handle reentrant requests with same attemptId Deliverables: • Modified Java client code (rocketmq-clients-java) • Comprehensive tests (unit & integration) • Updated documentation if needed • Pull Requests to relevant RocketMQ repos Key benefit: Prevents consumption stalls by ensuring retries use same attemptId when responses are lost.
Markdown provides a great ability to format messages and write structured documents using plain text format. Zulip uses two different markdown processors: for the backend, it is Python-Markdown and for the frontend, it is marked.js. While the backend markdown processor is highly extensible but the current frontend markdown processor doesn’t allow the same. Moreover, it is not upgradeable because of the Zulip customisations. The goals of this project are: Refactor the frontend-markdown processor with CommonMark parser. Make the same extensible for Zulip’s custom features like @-mentions. I’ll take the reference from commonmark.js to write the CommonMark parser for our frontend-markdown processor. And to make it extensible, I'll use the upstream marked.js. In parallel to this, I’ll focus on works in the markdown area. Integrating them with the Zulip will help to increase the overall users’ experience. The list of them are: Add support for link shortener Re-enable backslash escape inline pattern Add support for online mentions Add support for importing avatar from GitHub on account creation
<p>I propose to develop an Android App for Science Experiments with PSLab. Due to the growing influence of smartphones, the requirement of an Android counterpart for PSLab is needed. As per the current development status, the device communicates with the app using an OTG Cable using I2C communication. PSLab has an already existing desktop counterpart and the features like oscilloscope, get data of the various sensors on the board etc. and I wish to integrate most of the features in the app along with some better feature suggestions. The project would require initial development of communication libraries followed by implementation of the proposed features and their rigorous testing. An entire development model needs to be developed which would the writing main code, tests to check validity in certain cases, paying attention to the aesthetics/looks of the app etc. The proposed features would require extensive understanding of communication protocols, using APIs in apps, development of tests & making good UI designs. The proposed project has been divided to development & testing phases with time bound schedules for the same.</p>
Apache NuttX, while offering a Unix-like RTOS environment, currently lacks support for the vast ecosystem of X11-based graphical applications. This limits its usability in embedded GUI scenarios. This project addresses the gap by porting NanoX (also known as Microwindows), a compact X11-compatible server, to NuttX. The port will adapt NanoX’s client-server communication from Unix sockets to NuttX’s message-queue model, and rework the Nano-X server backend to run on top of NuttX’s NX/NXTK window system instead of accessing the framebuffer directly. It will also integrate NuttX’s input subsystem for mouse, keyboard, and touch support while preserving Nano-X/NX11 compatibility. The result will be a Nano-X/NX11 compatibility layer on NuttX that can run applications such as FLTK with minimal changes. Time permitting, I'll also port of FLTK 1.3 and the Dillo web browser to demonstrate real-world application capability.
<p>While experienced IRC users have no problem getting used to Polari, the growing number of new users that are not familiar with IRC clients demands an improved and fast initial setup so that user retention is favored and a new room blank state, in order to add a more friendly look to the current blank state.</p> <p>A better initial experience would definitely help new users, but what about regular ones that are already used to Polari? Since this project aims towards improving the overall user experience for both new and accustomed users, contextual popups, enhanced nickname tab-completion, favorite users section contained in the user list and the clever filtering of their status messages would definitely prove to be valuable assets for the future versions of Polari.</p> <p>With the help of Florian Muellner and Bastian Ilso, whom will aid me as mentors in the process of developing these ideas, I plan on adding user-friendly features that would enhance the user onboarding capabilities of Polari, making it easier for people to use our application.</p>
<p>JDart is a tool for performing concolic execution on a Java program. The aim of concolic execution is to explore additional behavior in the program by generating input values which will result in a different path being taken through a program (or method). The result of concolic execution is a constraints tree, i.e., a tree with its inner nodes reflecting the decisions that were made during the execution of the program. The nodes on the trees are labeled as: OK if the method was regularly exited, ERROR if there was an exception, or DONT_KNOW if no valuation could be generated for the respective path.</p> <p>Currently, the constraints tree is represented only as a plain text file which makes identifying the nodes and the statuses of leaves extremely hard in such a simplistic representation. To provide a better user experience, I will develop a web interface to visualize the constraints trees generated by JDart. At a very basic level, a user will have an intuitive overview on the whole generated trees. At a later stage, I will enable interactive operations on the web interface, e.g. letting user select on which part of a tree JDart should focus on.</p>
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.
This project aims to extend AsyncAPI suite of community maintained, production ready templates by developing and maintaining a new Java + Quarkus template for generating asynchronous applications using AsyncAPI’s generator repository. Quarkus, a Kubernetes-native Java stack , is an ideal framework for building modern event-driven microservices. This project aims to simplify the development of asynchronous services in Java by generating code and documentation for developers looking to use EDAs in a cloud-native application. Furthermore, this template will be one of the first templates developed inside the AsyncAPI’s generator repository. Allowing developers to test changes locally in the generator repository, making the development easier and reducing the number of workarounds in the template codes. This project will start the improved way of developing and maintaining templates for the AsyncAPI initiative. Key deliverables include: dynamic code generation from AsyncAPI specs using the React engine with integrated WebSocket support, extensions support for Kafka protocol, and a Kubernetes CRD integration.
<p>Dart is a recent programming language. Originally proposed by a team at Google in 2010, its main purposes were to be a flexible, but structured language for the web. Its syntax was (and still is) very close to other languages (namely Java or C#) which makes it easy for newcomers to start using Dart.</p> <p>Nowadays there is a new main purpose for the language: Flutter. A project that has been unveiled in 2015 and that utilizes Dart as its programming language. Currently developers use the project to deliver native cross platform mobile apps to both iOS and Android. In the future there will be other compile targets such as the web, or desktop applications.</p> <p>The Dart toolkits still contain Dart2JS, a tool that can be used to transpile Dart code to Javascript code. The transpiled Javascript will run in any browser similar to Typescript.</p> <p>The Eclipse IDE was once heavily used for Android development. But with the addition of a dedicated IDE for Android development (Android Studio) Eclipse is no longer the preferred choice for Android development as the tooling did not receive updates anymore.</p>
Orchestrating and tracking the steps and cross-party messages of business collaborations is a key blockchain/distributed ledger technology use case. Several tools have emerged to support blockchain-orchestrated BPM (business process management); an important subset of these takes models of the cooperation, usually captured in the Business Process and Notation (BPMN) language and generate a process manager smart contract from the model. Most of the existing tools target Solidity, and all of them store the business process state in the clear, in the smart contract. This can be problematic even for Hyperledger Fabric – if the process state is not to be seen by the whole consortium, we must resort to the confidentiality toolbox of Fabric (multiple channels, private data collections, etc.). We argue that this is not absolutely necessary. Our prototype implementation already supports Hyperledger Fabric to some extent (originally, we focused primarily on Solidity/EVM). Specifically, we have an implementation of the crucial element, the commitment manager and proof checker chaincode. However, proper support for Fabric needs a number of further improvements – as contributions to our open-source solution, and this is the topic of this mentorship.
The KDE Community will benefit greatly from a native Qt Quick/Kirigami virtual machine manager. Currently, KDE users must use GTK-based VMMs such as virt-manager or GNOME Boxes. Karton, the KDE Virtual Machine Manager, will be able to better integrate with Plasma and can align with the goals of KDE. This project will use the libvirt API rather than the QEMU CLI, which abstracts away some of the low-level implementation details and potentially allow for the app to be cross-platform. A custom graphical viewer will need to be implemented using the SPICE protocol. Registering mouse and keyboard input callbacks should also allow users to interact with virtual machines. Virtual machines created with Karton should be fully customizable through libvirt's domain XML file format. Karton should also have the feature to create snapshots in order to load previous and save states of the virtual machine. Overall, the ultimate goal is to create a polished virtual machine manager that is able to replace our available alternatives.
<p>Optimization of complex systems is one of the biggest challenges in engineering. A system can be considered complex when its consisted of more sub-systems and when nonlinear interactions between its various design parameters and sub-systems are present. Optimizing such systems can be a challenge for human designers who can neither directly identify optimal design points nor manualy investigate a large design space to identify optimal solutions. In order to tackle this problem, algorithmic optimization approaches are required. Genetic algorithms can successfully navigate a large and nonlinear design space but their performance is highly dependent on the selection of various hyper-parameters. At its current form the optimization problem is concerned with the design of an electric propulsion unit for small satellites. This project aims in the development of visualization tools that will aid in better understanding such complex optimization processes. By developing visualization tools for the optimization process and the sub-systems' characteristics the algorithm's performance can be further enhanced and new insights that can prove valuable for human designers can be identified.</p>
<p>Writing and maintaining software is challenging. Software is complex and keeping it bug-free remains an unsolved problem. Debian Stretch, the next Debian stable release, comprises 850 million lines of software source code. Code written in the C programming language accounts for 41% of the lines, which is more than in any other programming language. Debile, Debian’s package analysis platform, so far includes the CppCheck, Clang Static Analyzer, and Coccinelle tools for packages with C, C++, and Objective-C code. However, all of the tools perform static analyses, which can result in false positives. Too many reported false positives hinder adoption of the tools. To address this issue, I propose to integrate the KLEE tool into Debile. KLEE performs dynamic analysis on C programs and reports only true positives, i.e. real bugs. It does so by systematically exploring as many as possible execution paths in a given program. Errors that KLEE reports exist only along feasible execution paths, i.e. they correspond to real bugs in the program.</p>
Currently, Apache Fineract's integration testing suite relies heavily on low-level RestAssured API calls, which results in verbose and fragile tests burdened by raw HTTP boilerplate. As the codebase continues to scale, maintaining this infrastructure significantly bottlenecks developer velocity and complicates code reviews. This project will modernize the testing suite by migrating these tests to the type-safe, higher-level fineract-client-feign SDK. By enforcing this pattern, the project will instantly reduce boilerplate, guarantee compile-time type safety, and standardize how future integration tests are authored. The core deliverables for this initiative include: * Migrating 75 core common and utility helpers to invoke the API using fineract-client. * Converting 275+ standalone integration tests across every domain to use the new SDK-backed helpers. * Completely removing the RestAssured dependency from the integration-tests build configuration. * Creating comprehensive developer documentation outlining the SDK-first approach and authentication patterns for future contributors.
<p>I propose the addition of Greek language in spacy.io and the implementation of an extra feature of sentiment analysis for the Greek language. On the subject of the integration of Greek language to the spacy.io platform, I suggest the following metrics for the evaluation of the project: First of all, we should ensure that the model of Greek language passes successfully the language-independent "tokenizer sanity" tests provided by spacy.io . A second metric could be the performance of the model in language specific tests. Last but not least, we could evaluate the model in real world data offered by Official Greek Government's Gazette (FEK-ΦΕΚ) for named entities extraction and document categorization as mentioned in the ideas list of GFOSS for GSOC 2018. With respect to sentiment analysis, I would like to implement a binary classifier that, given a piece of text in Greek language, can computationally identify and categorize the opinions expressed and more specifically to determine whether the writer's attitude towards the topic is positive or negative. The classifier will also return a polarity score which will serve as a measure of confidence of the classifier for its’ decision.</p>
<h3>Current State</h3> <p>Users are required to manually open untrusted files through a right-click dialog each time they want to access them in a Disposable Virtual Machine. This not only places a high amount of responsibility on the user, it also poses a security risk if they accidentally open the file locally, calling for a shutdown of the Virtual Machine in order to eliminate any potential damage caused by the file's execution.</p> <h3>The Proposal</h3> <p>In this proposal a more convenient and less error-prone method of opening untrusted files is presented. By allowing the user to mark a folder, file or file type as untrusted, the need for a user to constantly keep themselves in check is eliminated, and unnecessary actions that must be frequently repeated during the course of working with sensitive or semi-trusted data are discarded.</p> <p>These features and implementations are discussed in detail along with possible future developments should there be excess time towards the end of the event. The proposal concludes with a complete timeline as well as a description of myself, my community experience and various methods of keeping in contact.</p>