Search Results for "ns2 code with algorithm" - Page 7
Sort By:
Showing 320 open source projects for "ns2 code with algorithm"
View related business solutions-
Grafana: The open and composable observability platformGrafana is the open source analytics & monitoring solution for every database.
-
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.
-
1
GenCodeGenerator
C++ class to generate biologically plausible genetic codes
The "GeneticCode" C++ class is designed to generate versions of the genetic code subject to the requirements of the three major models of the genetic code origin and evolution (about these models see, e.g., Koonin & Novozhilov, 2009, IUBMB Life). This class was written specifically to perform statistical test for the paper Makukov & shCherbak (2017), but it might be used for a wider class of studies related to the genetic code. -
2
Illustrated Algorithms
Interactive algorithm visualizations
Inspired by Grokking Algorithms and python-execution-trace, this project aims to reveal the mechanics behind algorithms via interactive visualizations of their execution. Visual representations of variables and operations augment the control flow, alongside actual source code. You can fast forward and rewind the execution to closely observe how an algorithm works. The same code that is displayed next to the illustration is also decorated using babel-plugin-trace-execution and executed to record the context at every step. Literally the same source file. Going back and forth between function execution (and call stack when algorithm uses recursion) is effortless. ... -
3
DES-Rotem
DES attempt to crack code with 3 rounds
This Java project is an attempt to crack the key in a DES encryption algorithm. The plaintext and the cyphertext are known. The purpose is to crack the 64-bit key with 3 rounds instead of 16. This project checks all 2^64 possible keys. Therefore, it takes a long time to find the correct key. -
4
node2vec
Learn continuous vector embeddings for nodes in a graph using biased R
The node2vec project provides an implementation of the node2vec algorithm, a scalable feature learning method for networks. The algorithm is designed to learn continuous vector representations of nodes in a graph by simulating biased random walks and applying skip-gram models from natural language processing. These embeddings capture community structure as well as structural equivalence, enabling machine learning on graphs for tasks such as classification, clustering, and link prediction. ... -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
adapter trimmer
We implement a very simple approach. Each read is searched for the jun
...Each read is searched for the junction adapter (CTGTCTCTTATACACATCT) and its reverse complement (AGATGTGTATAAGAGACAG) based on Hamming distance, the entire junction being CTGTCTCTTATACACATCT+AGATGTGTATAAGAGACAG. If a match to either side of the junction is found then the entire 38bp juncton is clipped. This means the algorithm can tolerate an indel error in one of the sides of the junction, but not both. Optionally Smith-Waterman alignment can be turned on with -w which resolves this issue, although the code is less tested. eg. this will be caught: CTGTCTCT-TA-TACACATCTAGATGTGTATAAGAGACAG but not this: CTGTCTCT-TA-TACACATCTAGATGT-GTATAAGAGACAG -
6
MSU's Sparse Fourier Repository
The Home of DMSFT, AAFFT, GFFT, and MSFFT.
...MSFFT, implemented by David Lawlor and Bosu Choi. This code is fast, but is not terribly easy to use. The algorithm is robust to some noise, but requires a lot of parameter tuning. Enjoy at your own risk :), Mark Iwen -
7
Algorithms in Python
Data Structures and Algorithms in Python
Algorithms in Python is a collection of algorithm and data structure implementations (primarily in Python) meant to serve as both learning material and reference code for engineers. It includes code for graph algorithms, heap data structures, stacks, queues, and more — each implemented cleanly so learners can trace logic and adapt for their problems. The repository is particularly useful for people preparing for competitive programming, job interviews, or building a foundational understanding of algorithmic patterns. ... -
8
iLib
The most comprehensive library of Javascript i18n classes available
Note: development has been moved over to github! Please see https://github.com/iLib-js/iLib "I18N" means way more than just translation. Other libraries claim to be an i18n solution when translation and string formatting is really all they offer. Yes, iLib has classes that do translation too, but there is also much, much more. From date formatting to name parsing to phone number handling to collation, iLib has classes that do it. And, it has the ability to support thousands of possible... -
9
tracking.js
A modern approach for Computer Vision on the web
The tracking.js library brings different computer vision algorithms and techniques into the browser environment. By using modern HTML5 specifications, we enable you to do real-time color tracking, face detection and much more, all that with a lightweight core (~7 KB) and intuitive interface. To get started, download the project. This project includes all of the tracking.js examples, source code dependencies you'll need to get started. Unzip the project somewhere on your local drive. The... -
Comet Backup - Fast, Secure Backup Software for MSPsComet is a flexible backup platform, giving you total control over your backup environment and storage destinations.
-
10
INTEGRATE: Calling gene fusions with exact fusion junctions and genomic breakpoints by combining RNA-Seq and WGS data. To download source code, reference manual and test case, please go to 'Files'. Also refer to 'Wiki' for details.
-
11
Density-ratio based clustering
Discovering clusters with varying densities
This site provides the source code of two approaches for density-ratio based clustering, used for discovering clusters with varying densities. One approach is to modify a density-based clustering algorithm to do density-ratio based clustering by using its density estimator to compute density-ratio. The other approach involves rescaling the given dataset only. An existing density-based clustering algorithm, which is applied to the rescaled dataset, can find all clusters with varying densities that would otherwise impossible had the same algorithm been applied to the unscaled dataset. ... -
12
MicroGP
A multi-purpose extensible self-adaptive evolutionary algorithm
MicroGP (µGP, ugp) is a versatile optimizer able to outperform both human experts and conventional heuristics in finding the optimal solution of hard problems. It is an evolutionary algorithm since it mimics some principles of the Neo-Darwinian paradigm. ⚠️ A new version is available on https://github.com/squillero/microgp4 -
13
This package implements the algorithm bagging markov random field method with c++ together with Java interface. http://nar.oxfordjournals.org/content/41/2/e42.long Cytoscape App: BMRF-Net-CytoscapeV1.0.tar.gz https://sourceforge.net/projects/bmrfcjava/files/BMRF-Net%20Package/BMRF-Net-CytoscapeV1.0.tar.gz/download Source code and standalone version: BMRF-Net-standalone.tar.gz https://sourceforge.net/projects/bmrfcjava/files/BMRF-Net%20Package/BMRF-Net-standaloneV1.1.tar.gz/download BMRF-Net-standalone V1.1: fix issues in analyzing large scale network
-
14
Attitude Estimator
A C++ implementation of a nonlinear 3D IMU fusion algorithm.
...Great emphasis has been placed on having a very efficient, yet totally numerically and algorithmically robust implementation of the filter. The code size has also been kept to a minimum, and has been extremely well-commented. The programmatic interface has also been made as easy as possible. Please refer to the extensive documentation of the library for more information on its capabilities and usage caveats. -
15
theoEA_Code
genetic algorithm for optimizing planar optical antennas
-
16
Simulink based simulation program for manuscript IJARS-D-16-00221. The simulation is to verify the proposed algorithm and generate codes for experiments via Real-time workshop
-
17
smartblob
tiny code, html webcam game or plug brain in each blob, java server
...I'm planning a huge multiplayer world, some blobs played by people holding a bendable loop game controller (tape a 1 meter cut of thick extension cord into a loop) in front of webcam and bend it to bend your blob on screen, and other blobs controlled by AI. This is a game for general AI research in a fun way people can do together. The physics and vision algorithm is half working in version 0.3.0. The gameplay is better experienced in 0.2 which is controlled with the mouse so you dont have enough freedom of movement compared to webcam. This small file contains its own source code including occamserver, a tiny general java server I built which I'll adjust to allow http streaming connections to stay open for faster ajax than a new web call each time. ... -
18
ooPorter
A Porter stemming or stemmer algorithm coded in ooRexx
This is an ooRexx line-by-line port from Ansi-C to ooRexx of the stemming routine published by Martin Porter 1980. The original source code from Porter has been commented out and emulated by the corresponding (oo)Rexx code as far as possible. This is not an example of good or fast (oo)Rexx programming, it is merely a demonstration of the Porter stemming routine ported to ooRexx, use and modify as necessary. Input to the program is a textfile with words to be stemmed, one per line.... -
19
CCKDM
Concern Mining
This is a tool for concern mining which uses a KDM model as input and the output is the same model with annotated concerns. It uses a Concern Library and a modified String Clustering K-means algorithm with Levenshtein metric to cluster the strings. -
20
Steepest-descent-like search algorithm
Heuristic search to find 21-variable PW type functions with NL>1047552
(by S. Kavut and S. Maitra) 1) The file "pw21_nlac.zip" contains the source code which computes the nonlinearity and absolute indicator of 21-variable PW type functions obtained from the 4 solutions in Table 1 of our paper (available at http://eprint.iacr.org/2015/1036). See comments in "pw21_nlac.cpp" in the zipped file for details. 2) Steepest-descent-like iterative search algorithm used in the same paper is implemented using the files in "sdl_algo.zip" which are briefly described as follows: "stp_ineq_pw21.cpp": Main file containing the source code (see comments therein for details). ... -
21
PortOpt
A portfolio-optimizer using Markowitz(1952) mean-variance model
PortOpt [Portfolio Optimizer] is a C++ program (with Python binding) implementing the Markowitz(1952) mean-variance model with agent's linear indifference curves toward risk in order to find the optimal assets portfolio under risk. You have to provide PortOpt (in text files or - if you use the api - using your own code) the variance/covariance matrix of the assets, their average returns and the agent risk preference. It returns the vector of assets' shares that composes the optimal portfolio. In order to minimise the variance it internally uses QuadProg++, a library that implement the algorithm of Goldfarb and Idnani for the solution of a (convex) Quadratic Programming problem by means of an active-set dual method. ... -
22
classify-20-NG-with-4-ML-Algo
Problem involves classifying 20000 messages into different 20 classes
...Each of these algorithms has its peculiar data format; the specific format and how to reconstruct the entire dataset are illustrated in other sections below. Out of all the methods, SVM using the Libsvm [1] produced the most accurate and optimized result for its classification accuracy for the 20 classes. All the algorithm implementation was written Matlab. Download the code and Report here. -
23
Scaffold_Builder
Combining de novo and reference-guided assembly with Scaffold_builder
Scaffold_builder is software to order contigs generated by draft sequencing along a reference sequence. Gaps are filled with N's and small overlaps are aligned with Needleman–Wunsch algorithm and the consensus created with IUPAC codes. Scaffold_builder can help in the assembly and annotation of genomes by revealing what is missing and allowing targeted sequencing to close those gaps. (c) Silva GG, Dutilh BE, Matthews TD, Elkins K, Schmieder R, Dinsdale EA, Edwards RA. Please cite: "Combining de novo and reference-guided assembly with Scaffold_builder", Source Code for Biology and Medicine 2013. -
24
SHLOC Multiplayer BackGammon
simple backgammon to be played over the net
Some Hundred Lines of Code Multiplayer Backgammon Simple Backgammon-Game to be played over the network. Incorporates an algorithm to roll the dice in a way that can not be cheated -
25
AMBER10_Brownian_Dynamics
Designed for coarse-grained protein association simulations
Based on source code of SANDER from AMBER10, Cheung group (https://mynsm.uh.edu/wiki/projects/cheunggroup/) from University of Houston has been continuously making efforts for molecular simulations of coarse-grained protein models. The code is now released for promoting research in protein-protein association simulations. The code includes additional Hamiltonian terms for the coarse-grained model (as described in http://www.pnas.org/content/110/51/20545.abstract) and uses the algorithm developed by Northup-Allison-Mccammon. ...
