python3-habluetooth

High availability Bluetooth

Python interface for managing Bluetooth devices with high availability features, designed to support robust wireless communication set ups. Facilitates reliable connectivity and efficient handling of multiple devices, making it suitable for applications like home automation where consistent device availability is crucial.

libwxbase3.2-1

wxBase library (runtime) - non-GUI support classes of wxWidgets toolkit

wxBase is a collection of C++ classes providing basic data structures (strings, lists, arrays), powerful wxDateTime class for date manipulations, portable wrappers around many OS-specific functions allowing the same program to work for all supported platforms, wxThread class for writing multithreaded programs, and much more.

libost-base2.5

Open-Source Computational Structural Biology Framework

OpenStructure aims to provide an open-source, modular, flexible, molecular modelling and visualization environment. It is targeted at interested method developers in the field of structural bioinformatics.

libpolymake4.12

Tool for algorithmic discrete geometry -- library package

Polymake started out as a tool for the algorithmic treatment of convex polyhedra. By now it also deals with finite simplicial complexes, tight spans of finite metric spaces, polyhedral surfaces, and other discrete mathematical objects.

wesnoth-1.18-utbs

"Under the Burning Suns" official campaign for Wesnoth (branch 1.18)

This package contains the "Under the Burning Suns" campaign for Wesnoth: "In the distant future a small band of elves struggles to survive amidst the ruins of fallen empires. Lead your people out of the desert on an epic journey to find a new home." (Expert level, 10 scenarios.)

liblrs2

package to enumerate vertices and extreme rays (shared libraries)

A convex polyhedron is the set of points satisfying a finite family of linear inequalities. The study of the vertices and extreme rays of such systems is important and useful in e.g. mathematics and optimization. In a dual interpretation, finding the vertices of a (bounded) polyhedron is equivalent to finding the convex hull (bounding inequalities) of an (arbitrary dimensional) set of points. Lrs (lexicographic reverse search) has two important features that can be very important for certain applications: it works in exact arithmetic, and it consumes memory proportional to the input, no matter how large the output is.