Search Results for "permutations"
Sort By:
Showing 43 open source projects for "permutations"
View related business solutions-
Boost application security and continuity with SKUDONET ADC, our Open Source Load Balancer, that maximizes IT infrastructure flexibility. Additionally, save up to $470 K per incident with AI and SKUDONET solutions, further enhancing your organization’s risk management and cost-efficiency strategies.
-
Choose from a complete set of software solutions across EHSQ that address all aspects of top performing Environmental, Health and Safety, and Quality management programs.
-
1
Build & Lexigraphical Permutations
Documentation of two types of permutation algorithms
This project provides documentation on two different approaches to permutations. Permutations can be generated by building them or by transposing characters between different character positions. My project addresses the efficiency between CPU speed and memory usage for generating unique permutations from input source texts that have repeated characters. The challenge is to create an efficient algorithm that can have the capacity to permutate sources texts that are hundreds and thousands... -
2
Swift Algorithms
Commonly used sequence and collection algorithms for Swift
... package’s initial set of sequence and collection operations, you can cycle over a collection’s elements, find combinations and permutations, create a random sample, and more. One inclusion is a pair of chunked methods, each of which break a collection into consecutive subsequences. One version tests adjacent elements to find the breaking point between chunks, you can use it to quickly separate an array into ascending runs. -
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. -
Google Cloud’s AI-powered APIs help you translate documents, websites, apps, audio files, videos, and more at scale with best-in-class quality and enterprise-grade control and security.
-
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... -
6
Platformatic
Platformatic Open Source monorepo
... 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. -
7
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.. -
8
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... -
9
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... -
Venn is a secure workspace for remote work that isolates and protects work from any personal use on the same computer. Work lives in a secure local enclave that is company controlled, where all data is encrypted and access is managed. Within the enclave – visually indicated by the Blue Border around these applications – business activity is walled off from anything that happens on the personal side. As a result, work and personal uses can now safely coexist on the same computer.
-
10
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. -
11
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. -
12
-
13
hopin
list all permutations of a list of given numbers
PermutationCounter (VB.NET with ActiveX) - Lists all permutations of a list of given numbers. -
14
Permutation Drops
Calculates Number of drops in a given permutation
This will output the drops for a set array of values. This was used as part of my Son's Math Capstone Project. 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. -
15
The friendly GWAS SNP enrichment tool
Tests for enrichment of GWAS SNPs in epigenetic datasets
... annotations are then supplied as bed files. The program will go through a directory of bed files e.g. all of the encode ChIP-seq datasets. Enrichment is checked against random samples from all the SNPs. The output is a tab delimited text file with the number of target loci hit, the mean number of background loci hit, the fold enrichment and a P value derived from the number of background permutations that hit as many or more loci as the test SNPs, divided by the number of permutations. -
16
Nifty - C - wordlist
a C over ASCII permutations wordlist program
This C program makes permutations over the ASCII table with theoretically over 100 characters in the start string. It can loop over the whole printable ASCII table or permute over a start and end string. It has an option for only printing at an input line and an end line. -
17
OptimAutoCor
Optimize autocorrelation function for natural number series
These programs are used to find best permutations of natural nubers series, which have minimal maximum of autocorrelation function. -
18
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...
-
19
TOVAL: Toms Java Library
Library with classes for common programming issues.
TOVAL comprises a set of java 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. -
20
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.
-
21
Quasi- Scientific Calculator for symbian^3
-
22
Disposition
Program to generate permutations and combinations
C Library designed to generate in sequence permutations or combinations (possible orderings or subsets) of a number of objects, with or without repetition. A command-line program that uses the library is provided too, useful to teach combinatorics. -
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
... heuristics to provide an improved approximated solution. Our approach outperforms other algorithms on small sized permutations. Our algorithm keeps the good performance on longer permutations.