Showing 24 open source projects for "b-link"

View related business solutions
  • $300 Free Credits for Your Google Cloud Projects Icon
    $300 Free Credits for Your Google Cloud Projects

    Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

    Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
    Start Free Trial
  • Stop Cyber Threats with VM-Series Next-Gen Firewall on Azure Icon
    Stop Cyber Threats with VM-Series Next-Gen Firewall on Azure

    Native application identity and user-based security for your Azure cloud

    Gain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
    Get a free trial
  • 1
    Delaunator

    Delaunator

    Fast JavaScript library for Delaunay triangulation of 2D points

    ...After constructing a delaunay = Delaunator.from(points) object, it will have a triangles array and a halfedges array, both indexed by half-edge id. What’s a half-edge? A triangle edge may be shared with another triangle. Instead of thinking about each edge A↔︎B, we will use two half-edges A→B and B→A. Having two half-edges is the key to everything this library provides. It will also be useful to have some helper functions to go from one half-edge to the next and previous half-edges in the same triangle. We can draw all the triangle edges without constructing the triangles themselves.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 2
    Interpolations.jl

    Interpolations.jl

    Fast, continuous interpolation of discrete datasets in Julia

    This package implements a variety of interpolation schemes for the Julia language. It has the goals of ease of use, broad algorithmic support, and exceptional performance. Currently, this package supports B-splines and irregular grids. The API has been designed with the intent to support more options. Initial support for Lanczos interpolation was recently added. Pull requests are more than welcome! It should be noted that the API may continue to evolve over time.
    Downloads: 4 This Week
    Last Update:
    See Project
  • 3

    PythagorasTheoremGeneralizer

    Pythagoras Theorem Generalizer

    An attempt to discover new kinds of Fractals by generalizing Pythagoras's Theorem into higher dimensions and negative numbers. Pythagoras Theorem when a < 0.0 and b >= 0.0 : c^2 = a^2 + b^2 * (((a*a + b*b)^0.5 - b)^2.0/(b - (a*a + b*b)^0.5)^2.0) c^2 = a^2 + b^2 * (((a*a + b*b)^0.5 - b)^2.0/(b - (a*a + b*b)^0.5)^2.0) * 1.0 c^2 = a^2 + b^2 * (((a*a + b*b)^0.5 - b)^2.0/(b - (a*a + b*b)^0.5)^2.0) * (-1.0 / -1.0) c^2 = a^2 + b^2 * (((((a*a + b*b)^0.5)*i - b*i)^2.0)/(b*i - (((a*a + b*b)^0.5)^2.0)*i)) Pythagoras's Theorem with negative numbers : For a < 0 and b >= 0 : c^2 = a^2 + b^2 * (((((a*a + b*b)^0.5)*i - b*i)^2.0)/(b*i - (((a*a + b*b)^0.5)^2.0)*i)) for a >= 0 and b < 0 : c^2 = b^2 + a^2 * (((((a*a + b*b)^0.5)*i - a*i)^2.0)/(a*i - (((a*a + b*b)^0.5)^2.0)*i)) for a < 0 and b < 0 : c^2 = a^2 + b^2 for a >= 0 and b >= 0 : c^2 = a^2 + b^2 There is Pythagoras's Theorem on Complex Plane numbers.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    bincmp is intended as a cross-platform, tiny and fast binary comparer of two files. it is much faster than "fc /b", for example. bincmp2 is more powerful, but currently windows-only.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Get Started Free
  • 5
    VR Paged List for C# and more

    VR Paged List for C# and more

    VR Paged List for C# and more

    a collection of Vincent Radio {Adrix.NT} C# sources & build projects includes - Paged Lists & Iterators Library for C# - Multi Dimensional Array Library for C# - MDArray List Manager Library for C# - Adjacency (List | Matrix) Direct Graph Libs for C# - Range Check functions - VRMosaic (WinForms) - with Auto Resolver also includes - Source Files - Visual Studio Build Projects - Test Applics have fun adrixnt@hotmail.it
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    VR Paged List GXS for C++ and more ...

    VR Paged List GXS for C++ and more ...

    Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT

    Vincent Radio {Adrix.NT} presents Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT} also contains - Little Docs about Paged Lists (docx, pdf) - VR Basic Common Utils Sources (Array List ...) - VR Generic Multi Dim Array Class - VR Generic MDArray List Mgr Class - VR Generic Adjacency (List | Matrix) Direct Graph Classes - VR List Interface with STL Support with some nice implementations (ArrayList, Paged-LIst) - Env Var Notes for sources for C++...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    DSP Lab

    DSP Lab

    Digital Signal Processing Simulation

    DSP Lab is a digital signal processing simulation application created to simulate and visualize process of sampling and filtering analog signal using DSP system. This application is created to provide as a tool for educator and student to visualize and understand DSP system. Source code is available at https://payhip.com/b/9mPY
    Downloads: 1 This Week
    Last Update:
    See Project
  • 8
    Creates an index to DBF files using a B+ Tree; Cria um indice para um arquivo DBF usando uma arvore B+; Implementação em C; Baseada em Arquivo;
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    CognitionMaster

    CognitionMaster

    object-based image analysis framework

    Wienert S, Heim D, Kotani M, Lindequist B, Stenzinger A, Ishii M, Hufnagl P, Beil M, Dietel M, Denkert C, Klauschen F. CognitionMaster: an object-based image analysis framework. Diagn Pathol 2013, 8:34
    Downloads: 18 This Week
    Last Update:
    See Project
  • Secure File Transfer for Windows with Cerberus by Redwood Icon
    Secure File Transfer for Windows with Cerberus by Redwood

    Protect and share files over FTP/S, SFTP, HTTPS and SCP with the #1 rated Windows file transfer server.

    Cerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
    Try for Free
  • 10
    ...Citation: Yadav et al. (2014), Quantitative scoring of differential drug sensitivity for individually optimized anticancer therapies. Scientific Reports 4, 5193; DOI:10.1038/srep05193 Please visit the link below for details
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    TER implements the CCSDS Recommendation for Image Data Compression (CCSDS 122.0-B-1). TER also adds new features to the Recommendation. TER is designed and programmed with the aim to provide a good basis to test and develop the CCSDS Recommendation.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 12

    bs

    A B-tree based sequence library.

    BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13
    ...This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY. In case you use the package in your work, we do appreciate a citation to the publications below. Citation: Yadav B, Peddinti G, Pemovska T, Khan SA, Szwajda A, Tang J, Wennerberg K and Aittokallio T. From drug response profiling to target addiction scoring in cancer cell models. (Submitted)
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    SourceAFIS

    SourceAFIS

    Fingerprint recognition library (.NET port)

    ...It can compare two fingerprints 1:1 or search a large database for matching fingerprint. It takes raw fingerprint images on input and produces matching score on output. Click the website link above for more info.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15

    Linking AnalyzerTask for iQser GIN

    niPRO AnalyzerTask to calculate link popularity

    AnalyzerTask to calculate the link popularity (SIN LP) for ContentObjects integrated into the iQser GinServer. Developed by niPRO-Project.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    IHC Profiler

    IHC Profiler

    A plugin for the quantitative analysis of Immunohistochemistry samples

    ...-x-x-x-x-x-x-x- Full Publication and Citation: Varghese F, Bukhari AB, Malhotra R, De A (2014) IHC Profiler: An Open Source Plugin for the Quantitative Evaluation and Automated Scoring of Immunohistochemistry Images of Human Tissue Samples. PLoS ONE 9(5): e96801. doi:10.1371/journal.pone.0096801 Link: http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0096801 -x-x-x-x-x-x-x- Your feedback would be highly appreciated. Please rate so we can work on improving it further. Thank you!
    Leader badge
    Downloads: 121 This Week
    Last Update:
    See Project
  • 17
    A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of the new tree sub-category, there can be others. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity in practical situations significantly.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    Data Structure & Algorithm Library(DSAL)
    The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    This project has moved. Please follow the WWW link below.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    Plantra-Trajectory Planning is a software to rebuild surfaces from cloud points, featuring shaded 3D visualization and path planning for robotics paths. It uses Voronoi diagram, Cyrus-Beck clipping, Delaunay triangulation and B-Splines.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22
    A Java implementation of a cubic B-spline curve smoothing function. Allows an arbitary number of points with a variable number of dimensions to have a cubic B-spline curve "fitted". Useful in finance for analysing bond or swap yield and discount curves.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23
    brCluster is a class library, written in java, that implements generic clustering algorithms carefully designed to allow its aplication in any kind of data. The algorithms implemented are K-means and Hierarchical Clustering (Simple and Complete Link).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24

    Taupical

    TALLA AUTOMÁTICA DE PIES PARA AJUSTE DE CALZADO

    ...Memoria final del proyecto, en el que se incluirá: a. Descripción de la tecnología utilizada y, en el caso de que no coincida con la establecida en la memoria preliminar, justificar el cambio. b. Descripción de los costes computacionales y requisitos tecnológicos. c. Manual de usuario del programa desarrollado. FASES 1. Entrega de la memoria preliminar (límite: 24 de febrero) (1 punto). 2. Entrega del ejecutable (4 puntos) y de la memoria final (3 puntos) (límite: 23 de mayo). 3. Presentación del trabajo (2 puntos) (28 de mayo).
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
Auth0 Logo