Search Results for "order"
Sort By:
Showing 29 open source projects for "order"
View related business solutions-
Compliant and Reliable File Transfers Backed by Top Security CertificationsStop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
-
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
1
Armadillo
fast C++ library for linear algebra & scientific computing
* Fast C++ library for linear algebra (matrix maths) and scientific computing * Easy to use functions and syntax, deliberately similar to Matlab / Octave * Uses template meta-programming techniques to increase efficiency * Provides user-friendly wrappers for OpenBLAS, Intel MKL, LAPACK, ATLAS, ARPACK, SuperLU and FFTW libraries * Useful for machine learning, pattern recognition, signal processing, bioinformatics, statistics, finance, etc. * Downloads:... -
2
Binarytree
Python library for studying Binary Trees
Binarytree is Python library that lets you generate, visualize, inspect and manipulate binary trees. Skip the tedious work of setting up test data, and dive straight into practicing algorithms. Heaps and BSTs (binary search trees) are also supported. Binarytree supports another representation which is more compact but without the indexing properties. Traverse trees using different algorithms. -
3
Supervised Reptile
Code for the paper "On First-Order Meta-Learning Algorithms"
The supervised-reptile repository contains code associated with the paper “On First-Order Meta-Learning Algorithms”, which introduces Reptile, a meta-learning algorithm for learning model parameter initializations that adapt quickly to new tasks. The implementation here is aimed at supervised few-shot learning settings (e.g. Omniglot, Mini-ImageNet), not reinforcement learning, and includes scripts to run training and evaluation for few-shot classification. -
4
Coach
Enables easy experimentation with state of the art algorithms
Coach is a python framework that models the interaction between an agent and an environment in a modular way. With Coach, it is possible to model an agent by combining various building blocks, and training the agent on multiple environments. The available environments allow testing the agent in different fields such as robotics, autonomous driving, games and more. It exposes a set of easy-to-use APIs for experimenting with new RL algorithms and allows simple integration of new environments... -
Stop Cyber Threats with VM-Series Next-Gen Firewall on AzureGain 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.
-
5
mssolutions
Makes magic squares.
These programs make magic squares and rectangles using "Constraint-Based Local Search". (For non-square rectangles, input the order as two numbers.) There are 3 similar programs: CompleteSquare, CompleteSquareSteps, and MagicSquares. Given an input square with some cell values between 1 and NxN specified, (and other cell values 0), CompleteSquare attempts to complete a magic square by placing the remaining values. The square type can be input as semimagic, magic, or associative. ... -
6
SODLS
Self-orthogonal diagonal Latin squares.
Makes self-orthogonal diagonal Latin squares, SODLS, for all valid orders, (that is, not order 2, 3, or 6). Input is an order, (one number), or an order range, (two numbers separated by white space). Output files are in folder SODLS[_n]. Each file contains a SODLS followed by a magic square. The magic square, M, is made from the order N SODLS, Q, and its transpose, as: M[row][col] = N x Q[row][col] + Q[col][row] + 1 See http://budshaw.ca/SODLS.html http://budshaw.ca/addenda/SODLSmethods.html http://budshaw.ca/addenda/SODLSnotes.html http://budshaw.ca/Download.html#sodls -
7
LEAN
Lean algorithmic trading engine by QuantConnect
Automated accounting for splits, dividends, and corporate events like delistings and mergers. Avoid selection bias with dynamically generated assets. Create and select asset universes on proprietary data and indicators. Automatically track portfolio performance, profit and loss, and holdings across multiple asset classes and margin models in the same strategy. Trigger regular functions to occur at desired times, during market hours, on certain days of the week, or at specific times of day.... -
8
TOL
Total Order Labeling for Reachability Queries on Large Dynamic Graphs
This is the code used in the following paper: Andy Diwen Zhu, Wenqing Lin, Sibo Wang, and Xiaokui Xiao. Reachability queries on large dynamic graphs: a total order approach. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data (SIGMOD '14). Please cite the paper if you choose to use the code. -
9
ArpON
ARP handler inspection
ArpON (ARP handler inspection) is a Host-based solution that make the ARP standardized protocol secure in order to avoid the Man In The Middle (MITM) attack through the ARP spoofing, ARP cache poisoning or ARP poison routing attack. -
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
10
HeaDDaCHe
Hashed dynamic determinants for convex hulls
Description: We propose and implement in C++ the hashed dynamic determinants scheme. This consists of efficient implementations of dynamic determinant algorithms and a hash table that stores intermediate results (matrices and determinants) in order to be used in subsequent steps of the algorithm. Related papers: V.Fisikopoulos, L.Peñaranda. Faster Geometric Algorithms via Dynamic Determinant Computation. In Algorithms – ESA 2012, Lecture Notes in Computer Science Volume 7501, 2012, pp 443-454. -
11
High-order HMM in Matlab
Implementation of duration high-order hidden Markov model in Matlab.
Implementation of duration high-order hidden Markov model (DHO-HMM) in Matlab with application in speech recognition. -
12
intzip
Fast compression of integer sets.
...Compression means that a suitable list of integers can be encoded to a (whenever possible) shorter list of the same integer format. An arbitrary set of integers (i.e., a collection of unique numbers where the order does not matter) may be transformed into suitable input data by way of translation and sorting. The main focus of the algorithm is to encode structural characteristics of a given list, such as coherent intervals and repeated distances. Therefore, the quality of compression depends on diversity rather than size. In most cases, IntZip is able to achieve much better compression results than general compression algorithms on such data sets. -
13
PetriOpti
Petri network optimization with Martinez-Silva algorithm
A simply application in order to demonstrate Martinez-Silva optimization algorithm on Petri networks. -
14
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
...The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large) -
15
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...
-
16
20 SkipList containers for C++ that work with STL. Combines set/map functionality with random access in logn time. One container is a multilist where you can order the same elements in a variety of different ways simultaneously.
-
17
T3S Tool
Learning Stochastic Discrete Event Systems
Stochastic discrete event system analysis and verification are essential in order to ensure reliability in such systems. However, models that cannot be constructed with an hand-made process need to be learned. Thus, the SDES toolbox proposes an automated solution that is embedded in Matlab to learning and analisis generalized semi-Markov processes. -
18
Regexp testing tool allows to apply group of regexps to huge arrays of data (millions or so) in order to investigate search or search/replacement possibilities of regexp group.
-
19
OnuriS (Open soURce wImax Simulator) is a simulation platform designed for WiMAX in order to analyze network performances and develop particular allocators for better bandwidth allocation strategies that could greatly improve the overall system.
-
20
This sofware is designed to help different chess clubs to set up their own rating system. It uses USCF approximation formulas for rating calculations. Working example at newarkcc.vfutbole.ru
-
21
FunctionalJ is a library which makes it easy to use functional programming patterns in Java, such as representing functions as objects, partial function application, higher-order functions, mapping, folding, and more.
-
22
Learn how to programm in c++ This project includes example Programms of Algorithm and Datastructure. Three students of Htwg Konstanz will release regularly example Programms in order that other people can learn c++. The first sources will be about search
-
23
Let P be a 2D point expressed in a plane area defined by four 2D points A,B,C,D. The aim of our C++ class is to express the coordinates of P in order to match when A,B,C,D is rectified as a rectangle. A demo application shows the use of the C++ class.
-
24
natural sort / order of arrays, sorts integer, string and mixed arrays - also strings with numbers included will be ordered naturaly, natsort and natcasesort for javascript
-
25
OpenDiscreteDynamicProgrammingTemplate : founds optimal constrainted parameters of a discrete controls with second order optimization template replacing Hessian with directional derivatives and backpropagation for digital filter(as neural network)
