Search Results for "bounds"
Sort By:
Showing 40 open source projects for "bounds"
View related business solutions-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
99.99% Uptime for MySQL and PostgreSQL on Google CloudCloud SQL Enterprise Plus gives you a 99.99% availability SLA with near-zero downtime maintenance—typically under 10 seconds. Get 2x better read/write performance, intelligent data caching, and 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server with built-in vector search for gen AI apps. New customers get $300 in free credit.
-
1
Bounds on Interbay Buckling
Bounds on the effect of initial geometric imperfections
An Excel spreadsheet compares the following four bounds on the yield onset pressure due to Interbay imperfections in thin-wall monocoque and ring-stiffened cylindrical pressure vessels: • Bodner-Berks method [1] • Galletly-Bart method [2] • Gordon’s simply supported method [3] • Gordon’s clamped end method [3] Because the first two methods are based on Donnell's equation of equilibrium, they are applicable only for shallow shells—that is for relatively short thin-wall cylinders whose critical buckling mode shapes are characterized by a large number of circumferential lobes. ... -
2
BayesianOptimization
A Python implementation of global optimization with gaussian processes
...This technique is especially useful for hyperparameter tuning in machine learning, where evaluating the objective function is costly. The library provides an easy-to-use API for defining bounds and optimizing over parameter spaces using probabilistic models like Gaussian Processes. -
3
Angular Components
Material Design components for Angular
...Straightforward APIs with consistent cross platform behaviour. Provide tools that help developers build their own custom components with common interaction patterns. Customizable within the bounds of the Material Design specification. Built by the Angular team to integrate seamlessly with Angular. Start from scratch or drop into your existing applications. In Angular Material, you create a color configuration by composing multiple palettes. Angular Material theme styles are generated statically at build-time so that your app doesn't have to spend cycles generating theme styles when bootstrapping. -
4
Wuffs
Wrangling Untrusted File Formats Safely
Wuffs is a memory-safe, zero-dependency library and domain-specific language for writing high-performance image codecs and related parsers. Instead of trusting ad-hoc C, Wuffs code is compiled to C with strong bounds, integer, and state checks inserted by construction, aiming to eliminate whole classes of security bugs without a heavy runtime. The design prioritizes predictable performance: decoders avoid dynamic allocation by default, return explicit “short read” signals, and run well in streaming or sandbox-free environments. The project ships battle-tested, CPU-friendly implementations for common image/container formats and bit-twiddly primitives like Huffman and checksum routines. ... -
Cut Cloud Costs with Google Compute EngineSave on compute costs with Compute Engine. Reduce your batch jobs and workload bill 60-91% with Spot VMs. Compute Engine's committed use offers customers up to 70% savings through sustained use discounts. Plus, you get one free e2-micro VM monthly and $300 credit to start.
-
5
EAGO.jl
A development environment for robust and global optimization
...Most operators supported by modern automatic differentiation (AD) packages (e.g., +, sin, cosh) are supported by EAGO and a number of utilities for sanitizing native Julia code and generating relaxations on a wide variety of user-defined functions have been included. Currently, EAGO supports problems that have a priori variable bounds defined and have differentiable constraints. -
6
Cave Story MD
A fan port of Cave Story for the Sega Mega Drive
This is a rewrite/port of the popular freeware game Cave Story for Sega Mega Drive/Genesis. It should work on any console or emulator. The main story is "finished", only little things and bugfixes remain. A fan port of Cave Story for the Sega Mega Drive. -
7
Tulip.jl
Interior-point solver in pure Julia
Tulip is an open-source interior-point solver for linear optimization, written in pure Julia. It implements the homogeneous primal-dual interior-point algorithm with multiple centrality corrections and therefore handles unbounded and infeasible problems. Tulip’s main feature is that its algorithmic framework is disentangled from linear algebra implementations. This allows to seamless integration of specialized routines for structured problems. -
8
plow
A high-performance HTTP benchmarking tool
...It can run for a set duration( option -d), for a fixed number of requests(option -n), or until Ctrl-C is interrupted. The implementation of real-time computing Histograms and Quantiles using stream-based algorithms inspired by Prometheus with low memory and CPU bounds. so it's almost no additional performance overhead for benchmarking. -
9
Pkl
A configuration as code language with rich validation and tooling
...Its goal is to let you write configuration logic (modules, imports, conditions, defaults) while still producing static outputs suitable for tools that expect JSON, YAML, or other formats. Configurations in Pkl are type-safe and support validation constraints (e.g. bounds, relations) so many errors can be caught before deployment. The language is embeddable, meaning it can run inside applications (Java, Swift, Go, etc.) to load configuration dynamically with the same safety guarantees. There’s also code generation support: writing Pkl modules can generate matching classes or data structures in target languages (Swift, Go, Java, Kotlin) so runtime config and statically typed code stay in sync. -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
10
Bayesian Optimization
Python implementation of global optimization with gaussian processes
...Explore the options exemplifying the balance between exploration and exploitation and how to control it. Explore the domain reduction notebook to learn more about how search can be sped up by dynamically changing parameters' bounds. -
11
SafePodCasting is a C++ library designed to provide safe and reliable type conversions between various primitive data types. It ensures that conversions are performed with proper bounds checking to prevent data loss or undefined behavior.
-
12
ntuacarlo
A open-source implementation library of optimization algorithms
ntuacarlo: library of open-source implementation of optimization algorithms for Matlab/GNU Octave The library implements matlab functions for the following optimization algorithms: Simulated Annealing Particle Swarm Optimization Monte Carlo Exhaustive search The signature of the functions follow the same as the ga() function of Matlab. All the functions support lower and upper bounds, linear and non-linear constraints, and integer variables.Octave -
13
Basic Blind Chess
Blind Chess using Taiwan rule
Blind Chess also known as "Dark Chess" (暗棋) or "Banqi" or Half Chess , is a two-player Chinese board game played on a 4x8 grid, or half of the xiangqi (Chinese Chess) board. This application is using Taiwan rule. AI is using basic minimax tree structure and some rules. Advanced algorithm such as Upper Confidence bounds applied to Trees and Monte Carlo Tree Search are NOT used. This app is single player vs computer only. For English user, Christakis Giorgios made Software Requirements Specification(pdf file), it will help anyone that downloads this application to understand basic blind chess and use it. You can download this pdf in Files->Specification folder. -
14
Dynamic Arrays and Hashes (Delphi, C++)
Very fast classes for working with Dynamic Arrays in Delphi and C++
(New version 1.04 is released) Dynamic Arrays is a set of useful very fast classes for data manipulating in memory. Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). Give it a try and let me know how... -
15
33
A project on topography and weather comparison
...Even though the answers we could get from the project might be very important, they won't be "The Answer to the Ultimate Question of Life, the Universe, and Everything", so not quite 42. But why exactly 33? Well, the founder had a project given up project of self-sustainability at house number 33. As the bounds of the topic of this project now is not quite clear or well defined, it is sort of a sentimental reference to the older project. And why a Spanish Unixname? Always English is boring. -
16
vue-grid-layout
A draggable and resizable grid, for Vue.js.
vue-grid-layout is a grid layout system, like Gridster, for Vue.js. Heavily inspired by React-Grid-Layout. Bounds checking for dragging and resizing. Widgets can be added or removed without rebuilding grid. Layout can be serialized and restored. Automatic RTL support (resizing not working with RTL on 2.2.0). For legacy browsers, like IE11, use version 2.3.12-legacy. For Vue 2.1.10 and below use version 2.1.3. For Vue 1 use version 1.0.3. Ignore drag on certain elements and allow on others. ... -
17
vim-surround
Delete/change/add parentheses/quotes/XML-tags/much more with ease
...It turns the repetitive chores of adding, changing, or deleting delimiters into short, mnemonic commands that work with normal Vim text objects. The key insight is that surroundings are structural: once Vim understands the bounds, operations become predictable and composable with your existing motions. The plugin handles common cases like quotes and parentheses as well as HTML/XML tags, making it equally useful in prose and code. Because the commands are orthogonal to movements, you can target words, sentences, or visual selections without learning new modes. ... -
18
ArgCheck.jl
Package for checking function arguments
Package for checking function arguments. @argcheck code is as fast as @assert or a hand written if. That being said it is possible to erase argchecks, much like one can erase bounds checking using @inbounds. This feature is currently experimental. It may be silently changed or removed without increasing the major ArgCheck version number. -
19
Probability Cheatsheet
A comprehensive 10-page probability cheatsheet
The probability_cheatsheet is a cheat sheet repository that summarizes key probability theory concepts, formulas, distributions, and properties in a concise format. It likely includes definitions of random variables, PMFs and PDFs, expectations, variance, common distributions (e.g. binomial, normal, Poisson, exponential), conditional probability, Bayes’ theorem, moment generating functions, and perhaps important inequalities (Markov, Chebyshev, Chernoff). The cheat sheet is intended as a... -
20
Appointment Picker
JavaScript timepicker that helps you pick appointments
...If startTime is greater than minTime a lower time can still be manually set via the keyboard. On the other hand the picker does not accept lower hours than minTime and higher than maxTime. Manually entered times outside of the defined bounds will be rejected by the picker, no extra validation is therefore needed. Entering an empty string into the input resets the time. Appointment Picker can be easily integrated into a React component. Simply import the node module and use React.createRef() to pass the DOM element when calling new AppointmentPicker. -
21
...It performs extra operations such as cache flushing before the kernel execution, and can set real-time scheduling to prevent OS interference. - Non-null data initialization, and live-out data dump. - Syntactic constructs to prevent any dead code elimination on the kernel. - Parametric loop bounds in the kernels, for general-purpose implementation. - Clear kernel marking, using pragma-based delimiters.
-
22
ParallelAccelerator.jl
ParallelAccelerator package, part of the High Performance Scripting
...With the @acc macro that ParallelAccelerator provides, users may specify parts of a program to accelerate. ParallelAccelerator compiles these parts of the program to fast native code. It automatically eliminates overheads such as array bounds checking when it is safe to do so. It also parallelizes and vectorizes many data-parallel operations. ParallelAccelerator is part of the High Performance Scripting (HPS) project at Intel Labs. -
23
OptimC
OptimC - Optimization / Unconstrained Minimization Library in ANSI C
...The algorithms implemented are Nelder-Mead,Newton Methods (Line Search and Trust Region methods), Conjugate Gradient and BFGS (regular and Limited Memory). Brent method is also available for single variable functions if the bounds are known. Update 06/09/2014 - Nonlinear Squares Implementation [Levenberg-Marquardt Method] Added. Documentation - http://code.google.com/p/optimc/ -
24
JChart2D
jchart2d is a real-time charting library written in java.
JChart2D is a easy to use component for displaying two- dimensional traces in a coordinate system written in Java. It supports real-time (animated) charting, custom trace rendering, Multithreading, viewports, automatic scaling and labels. Former UI controls (right click context menu, file menu) have been ported to the subproject jchart2d-uimenu (https://sourceforge.net/projects/jchart2d-uimenu.jchart2d.p/) for the benefit of having no dependencies to 3rd party libraries. -
25
PyclassicS
An open-source classic snake game written in Python.
An open-source classic snake game written in Python by Ericson Willians, with speed, bounds and fullscreen options.
