Search Results for "clip-4-win"
Sort By:
Showing 410 open source projects for "clip-4-win"
View related business solutions-
With the world of work changed forever, it’s essential to manage your workplace and assets together to effectively create a high-performing environment. The Eptura experience combines the power of workplace management software with asset management, enabling you to effectively operate your building and facilitate hybrid work.
-
When it comes to cybersecurity, what your clients don’t know can really hurt them. And believe it or not, keep them safe starts with asking questions. With ConnectWise Identify Assessment, get access to risk assessment backed by the NIST Cybersecurity Framework to uncover risks across your client’s entire business, not just their networks. With a clearly defined, easy-to-read risk report in hand, you can start having meaningful security conversations that can get you on the path of keeping your clients protected from every angle. Choose from two assessment levels to cover every client’s need, from the Essentials to cover the basics to our Comprehensive Assessment to dive deeper to uncover additional risks. Our intuitive heat map shows you your client’s overall risk level and priority to address risks based on probability and financial impact. Each report includes remediation recommendations to help you create a revenue-generating action plan.
-
1
AlphaZero.jl
A generic, simple and fast implementation of Deepmind's AlphaZero
...++) and optimized for highly distributed computing environments. This makes them hardly accessible for students, researchers and hackers. Many simple Python implementations can be found on Github, but none of them is able to beat a reasonable baseline on games such as Othello or Connect Four. As an illustration, the benchmark in the README of the most popular of them only features a random baseline, along with a greedy baseline that does not appear to be significantly stronger. -
2
xxHash
Extremely fast non-cryptographic hash algorithm
xxHash is an extremely fast non-cryptographic hash algorithm, working at RAM speed limit. It is proposed in four flavors (XXH32, XXH64, XXH3_64bits and XXH3_128bits). The latest variant, XXH3, offers improved performance across the board, especially on small data. It successfully completes the SMHasher test suite which evaluates collision, dispersion and randomness qualities of hash functions. Code is highly portable, and hashes are identical across all platforms (little / big endian... -
3
FATE
An industrial grade federated learning framework
FATE (Federated AI Technology Enabler) is the world's first industrial grade federated learning open source framework to enable enterprises and institutions to collaborate on data while protecting data security and privacy. It implements secure computation protocols based on homomorphic encryption and multi-party computation (MPC). Supporting various federated learning scenarios, FATE now provides a host of federated learning algorithms, including logistic regression, tree-based algorithms,... -
4
FileVerifier++ is a Windows utility for calculating hashes using a number of algorithms including CRC32, MD5, SHA-1, SHA-256/224/384/512, WHIRLPOOL, and RIPEMD-128/160/256/320. Supported hash file formats include MD5SUM .MD5, SFV, BSD CKSUM, and others.
-
The platform is known for delivering a great user experience, while incorporating all the essential tools companies need to support efficient training and learning.
-
5
JUtilClasses
Java programmer's aid in useful methods and classes
Util-Classes is a collection of Java classes for programming support in service for building applications. It covers a wide range of topics from simple small routines over Collection classes to larger utilities addressing IO-management, GUI topics and data safety. -
6
Control logic
Realtime PC-based control and simulator of control systems
Control logic Java package is a set of Java classes aimed at: - Implementation of a real-time PC-based control - Simulation of control systems Setting up a control system involves working with so-called triggers. See project Wiki for detailed information and examples. -
7
PANDA
A comprehensive and flexible quantification tool for proteomics data
PANDA is a comprehensive and flexib tool for quantitative proteomics data analysis, which is developed based on our solid foundations in quantitative proteomics for years. Several novelties have been implemented in it. First, we implement the advantage algorithms of LFQuant (Proteomics 2012, 12, (23-24), 3475-84) and SILVER (Bioinformatics 2014, 30, (4), 586-7) into PANDA. Second, we consider the state-of-art concept of quantification reliability in this quantitative workflow. On the levels... -
8
Sudoku Maker is a generator for Sudoku number puzzles. It uses a genetic algorithm internally, so it can serve as an introduction to genetic algorithms. The generated Sudokus are usually very hard to solve -- good for getting rid of a Sudoku addiction.
-
9
UoMASM
A C++ Active Shape Model Library from the University of Manchester
A library and associated tools for building and searching with Active Shape Models (ASM). It builds on the VXL computer vision libraries. Includes a GUI tool to search new images with the ASM. Depends on: VXL, Qt (Version 4), UoMqVXL -
With Tractivity's stakeholder management platform comes clarity from one system. Read more to find out how our cloud-based platform can help your stakeholder engagement and consultation projects. If improved stakeholder consultations and outcomes matter to your organisation, then we're here to help you engage, manage and deliver compelling insights and improved outcomes across your entire stakeholder landscape. When you engage with Tractivity you get access to the most up to date, relevant and practical tools to deliver impactful communications all from one system. Run successful engagement projects from start to finish with all the tools in one system. Our cloud-based platform helps you continually monitor your entire stakeholder landscape bringing the clarity you need. Our platform is designed to help you engage and capture every interaction. Tractivity gives you the tools to be creative, engaging, and to communicate your success.
-
10
Elite Planet Browser
Browse through the planets of the Elite game on various Z80 machines
First of all: this program is totally useless. But those of you who know and love the classic computer game "Elite" will maybe like it. The "Elite Planet Browser" is a little program for various classic Z80-based computers, written in C using the z88dk compiler (www.z88dk.org). It allows you to browse through the planet data of the Elite game on many old Z80-based computers. When the original game came out in 1984, many people wondered how it is possible to have detailed data of so... -
11
ringBufU
Ring-Buffer library in C, includes support of multithreading
A Ring-Buffer instance could be used with element types - char - long - long long - void* . Focus is on a hardened SW structure with buffer-instance-pointer check (not very fast but more secure). Some features are globally choosable on compile-time (e.g. switch multithread support off completely to have faster access). Note: User Interface is for Test and Tutor Code only. -
12
Build & Lexigraphical Permutations
Documentation of two types of permutation algorithms
... of characters long without running out of memory. This project has 4 download files (1 pdf that documents the algorithms, and 3 Excel files, each for a different algorithm) The downloadable Excel files are the programming files because I code in VBA. You will need to enable macros to run the algorithms. You can view the VBA code of each algorithm from the developer module house inside Microsoft Excel. The lexigraphical algorithm is faster because it supports multi-threading. -
13
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.
-
14
This project hosts a library and tools for sharing simulation experiments encoded using SED-ML.
-
15
java-string-similarity
Implementation of various string similarity and distance algorithms
... below. The "cost" column gives an estimation of the computational cost to compute the similarity between two strings of length m and n respectively. If the alphabet is finite, it is possible to use the method of four russians (Arlazarov et al. "On economic construction of the transitive closure of a directed graph", 1970) to speedup computation. This was published by Masek in 1980 ("A Faster Algorithm Computing String Edit Distances"). -
16
Fun4Me
A package for functional annotation for metagenomes
This package includes a few programs for rapid functional annotation for metagenomic sequences, including, 1) Gene prediction by FragGeneScan; 2) Similarity search by RAPSearch2; 3) Functional annotation in GO (Gene Ontology) and EC (Enzyme Commission) based on similarity search results; 4) From EC to metabolic pathway reconstruction by MinPath. Inputs: Just sequencing reads (or assemblies) Outputs: Protein-coding genes (or gene fragments); similarity search; functional annotations... -
17
Jojos Binary Diff
Binary Diff and Undiff Utility
JDIFF is a program that outputs the differences between two binary files, either in binary format or in human readable format (detailed or summarized) and then allows to reconstruct the second file from the first one and the diff-file. -
18
lzhw
LZHW Windows command line lossless compression tool for tabular files
LZHW Command Line Lossless Compression Tool is a Windows command line tool used to compress and decompress files from and to any form, csv, excel etc without any dependencies or installations. Using an optimized algorithm (LZHW) developed from Lempel-Ziv, Huffman and LZ-Welch algorithms. The tool can work in parallel and most of its code is written in Cython, so it is pretty fast. It is based on python lzhw library. Full tool documentation can be found at:... -
19
C-squares
Concise spatial query and representation system (c-squares)
C-squares is an easily implemented method for storage, querying and display of spatial data locations, based on a hierarchical, grid-based representation of the Earth' surface. Source code for encoding, decoding, mapping, etc. is provided via this site. Additional support is available by contacting the system developer, Tony.Rees@marinespecies.org; see also the c-squares home page at http://www.cmar.csiro.au/csquares/ . -
20
PMCGPU
Parallel simulators for Membrane Computing on the GPU
Membrane Computing is a new research area (within Natural Computing) that aims to provide computing devices abstracted from the functioning and structure of living cells. These devices are called P systems. The objective of this project (PMCGPU) is to bring together all the researchers working on the development of parallel simulators for P systems, specially those using the GPU (e.g. CUDA, OpenCL, etc). Other parallel platforms are also welcome (multicore and manycore, FPGAs,... -
21
This is a recursive C++ source code of the Fast Fourier Transform algorithm allowing parallelization. Also a performance test and its results on my computer are provided. The Performance test suggest to use 4 threads for parallelization. With this one can beat the implementation in "Numerical Recipes in C++" for large signals with more than 2^16 / 2^17 / 2^18 samples depending on the hardware and software.
-
22
Physhun is a Java framework for building and executing finite state machines in J2SE and J2EE environments. State models are defined as collections of Spring beans, and do not use proprietary modeling languages. The framework is simple and flexible.
-
23
FastFlow: programming multi-core
Pattern-based multi/many-core parallel programming framework
... multi-core. FastFlow works on x86, x86_64, PPC, ARM, and Linux, Mac and Win XP/7. From Jan 1, 2018 code development migrated on GitHub at https://github.com/fastflow/fastflow -
24
bps
A B-tree based associative array library.
B-tree with a twist pointer set. The ordered set approaches the speed of the fastest unordered, hash table based sets, while using several times less memory. -
25
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as...