Search Results for "permutations"
Sort By:
Showing 37 open source projects for "permutations"
View related business solutions-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
Combinatorics.jl
A combinatorics library for Julia
A combinatorics library for Julia, focusing mostly (as of now) on enumerative combinatorics and permutations. As overflows are expected even for low values, most of the functions always return BigInt, and are marked as such. -
2
dnstwist
Detects phishing and lookalike domains using DNS fuzzing techniques
dnstwist is an open source cybersecurity tool designed to identify malicious or suspicious domain names that imitate legitimate websites. It works by generating a large set of domain name permutations based on a target domain and analyzing whether any of those variants are actively registered or used. These permutations simulate common techniques used in phishing attacks, typosquatting, and brand impersonation campaigns. Security teams can use the tool to discover potential threats where attackers attempt to deceive users with lookalike domains. dnstwist also helps detect phishing activity by comparing web page content and visual similarity between domains using fuzzy hashing and perceptual hashing techniques. ... -
3
Nemo.jl
Julia bindings for various mathematical libraries (including flint2)
Nemo is a computer algebra package for the Julia programming language. It aims to cover commutative algebra, number theory and group theory. Julia bindings for various mathematical libraries (including flint2) -
4
AbstractAlgebra.jl
Generic abstract algebra functionality in pure Julia
AbstractAlgebra is a pure Julia package for computational abstract algebra. It grew out of the Nemo project and provides all of the abstract types and generic implementations that Nemo relies on. It was originally developed by William Hart, Tommy Hofmann, Fredrik Johansson and Claus Fieker with contributions from others. Current maintainers are Claus Fieker, Tommy Hofmann and Max Horn. -
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
5
Tullio.jl
Tullio is a very flexible einsum macro
Tullio is a very flexible einsum macro. It understands many array operations written in index notation -- not just matrix multiplication and permutations, but also convolutions, stencils, scatter/gather, and broadcasting. Used by itself the macro writes ordinary nested loops much like Einsum.@einsum. One difference is that it can parse more expressions, and infer ranges for their indices. Another is that it will use multi-threading (via Threads.@spawn) and recursive tiling, on large enough arrays. -
6
ChainForge
An open-source visual programming environment
...Instead of relying on isolated prompt experimentation, it introduces a dataflow-based interface that allows users to create complex prompt pipelines and evaluate them across different models, parameters, and datasets simultaneously. The platform enables rapid experimentation by generating permutations of prompts and inputs, making it possible to test hundreds of variations in parallel and analyze performance trends more effectively. It also includes evaluation nodes that allow developers to define scoring functions, enabling automated benchmarking of outputs based on custom criteria such as accuracy, formatting, or relevance. -
7
Platformatic
Platformatic Open Source monorepo
...Historically, API developers have had to repetitively build infrastructure to satisfy foundational requirements, like authentication, authorization, caching, and connection to databases, and have had to manage microservices with technologies such as service mesh or centralized registries. This work is time consuming, undifferentiated, and painstakingly complex. With growing demands of SaaS applications, the amount of API permutations has grown exponentially and has become a development bottleneck. This has led large organizations to create dedicated platform API engineering teams to help teams deliver on business demands. Our goal is to make API development simple: we aim is to remove all friction from the day-to-day of backend developers. Platformatic is a series of Open Source tools to build APIs. -
8
ArgoSBX
Xiaobai built his own agent artifact
...The tool supports a wide range of protocols and configurations, including TLS-based and Reality-based connections, enabling users to tailor their setup to different network conditions. One of its defining features is the ability to integrate CDN-based routing and WARP combinations, offering numerous configuration permutations to optimize performance and bypass restrictions. The script is built for minimal interaction, allowing users to deploy complex setups with a single command while still retaining deep customization options. -
9
kubectl-aliases
Programmatically generated handy kubectl aliases
...It ships a prebuilt .kubectl_aliases file for Bash/Zsh, plus variants for Fish and Nushell, which you drop into your home directory and source from your shell config. The aliases are programmatically generated from permutations of common verbs, resources, flags, and options, so you get short forms like kgpo for kubectl get pod and more complex ones that include namespaces, label selectors, and output formats. This dramatically speeds up interactive Kubernetes workflows, especially when you spend a lot of time inspecting pods, services, deployments, and logs. ... -
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
10
APSampler
APSampler is a tool that finds multifactorial association patterns
APSampler is a tool that allows multi-locus and multi-level association analysis of genotypic and phenotypic data. The goal is to find the allelic sets (patterns) that are associated with phenotype. Once a set of pattern is found, we validate it by permutations to avoid overfitting. The project also includes SF+FLINT framework to check whether the parts of found patterns are in epistatic interaction.. -
11
Disposition
Program to generate permutations and combinations
C Library designed to generate in sequence permutations or combinations (possible orderings or subsets) of objects, with or without repetition. To demonstrate the use of the library, a command-line program (disp) and a GTK graphical version (GDisp) are provided too, useful to teach combinatorics. -
12
...It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, permutations, heaps and interval heaps. GDSL is free software distributed under the terms of the GNU General Public License.
-
13
rufascube
Unique 3D slider puzzle that looks like a rubics cube.
This is NOT another Rubic's Cube. It's a much simpler slider puzzle that is incrementally solvable. A 3x3x3 arrangement of cubelets with the center one missing allows sliding permutations. After a randomization, the goal is to restore the cube to its original configuration based on color and alphabetic hints. Written in Ada and compiles on Windows, OS-X or GNU/Linux. Nice laptop controls and support for Mac Retina displays. Requires OpenGL v3.3, and on Macs a recent version of OS-X. Now with mouse wheel zoom (2-finger swipe on MacBooks). ... -
14
Statistics101 - Resampling Statistics
Use simulation to perform statistical analyses.
Statistics101 is an Integrated Development Environment (IDE) that uses a simple, powerful language called “Resampling Stats” to develop Monte Carlo programs to analyze and solve statistical problems. The original Resampling Stats language and computer program were developed by Dr. Julian Simon (https://www.juliansimon.com/) and Peter Bruce (https://www.scientificamerican.com/author/peter-bruce/) as a new way to teach Statistics to social science students. Of course, social science students... -
15
Accelerate
Embedded language for high-performance array computations
Data.Array.Accelerate defines an embedded language of array computations for high-performance computing in Haskell. Computations on multi-dimensional, regular arrays are expressed in the form of parameterized collective operations (such as maps, reductions, and permutations). These computations are online-compiled and executed on a range of architectures. Accelerate is a free, general-purpose, open-source library that simplifies the process of developing software that targets massively parallel architectures including multicore CPUs and GPUs. Embedded in the advanced functional programming language Haskell, Accelerate programs are declarative, statically-typed, pure, functional, and ready to exploit all of the performance of modern parallel hardware. ... -
16
DNSGen
Intelligent DNS permutation tool for subdomain discovery
...It analyzes existing domain names and generates numerous intelligent variations that may represent valid subdomains within an organization’s infrastructure. These generated permutations help identify hidden or unlisted services that may not appear in standard DNS queries or public records. DNSGen applies multiple permutation techniques to create realistic domain combinations based on modern infrastructure naming patterns, including cloud environments, DevOps tools, and microservice architectures. It can also extract meaningful keywords from existing domain names and incorporate them into newly generated permutations. ... -
17
-
18
JavaGimmicks
Utility classes, APIs and tools for Java
A set of helper and utility classes, APIs and tools for the Java Programming Language. For more details - pleas visit the project homepage. -
19
Permutation Drops
Calculates Number of drops in a given permutation
...A drop is calculated by comparing a position in the array of values with the position to it's right. If it is less then a drop is added to the bucket for that position. This is calculated over all of the possible permutations for an array. The number of elements in the array are input by the user. The output is output to a file and is late analyzed. -
20
TOVAL: Toms Java Library
Library with classes for common programming issues.
...It includes utils for arrays, lists, sets and collections for convenient handling and modification, but also support for mathematic definitions concerning logic (clauses + resolution) together with some algorithms for permutations, powersets and resolution. Additionally it contains a number of types for multisets, matrices with object keys and much more. -
21
We consider a problem of finding maximum weight subgraphs (MWS) that satisfy hard constraints in a weighted graph. The constraints specify the graph nodes that must belong to the solution as well as mutual exclusions of graph nodes, i.e., pairs of nodes that cannot belong to the same solution. Our main contribution is a novel inference approach for solving this problem in a sequential monte carlo (SMC) sampling framework. Usually in an SMC framework there is a natural ordering of the states...
-
22
Crunch is a wordlist generator where you can specify a standard character set or a character set you specify. crunch can generate all possible combinations and permutations.
-
23
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
-
24
md5Crack
MD5 Hash Cracker
A lightweight MD5 hash cracker that uses permutations and will generate every possible string until the hash is cracked. -
25
C++ Permutation, Combination, MultiCombination .... recursively.... impress people... this was a Homework assignment from hell.... http://en.wikipedia.org/wiki/Permutations http://en.wikipedia.org/wiki/Combination
