Search Results for "ns2 code with algorithm" - Page 5
Sort By:
Showing 236 open source projects for "ns2 code with algorithm"
View related business solutions-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
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
PREESM provides a complete framework for fast prototyping. It generates a simulation and an optimized multiprocessor code from graph descriptions of algorithm and architecture. Please visit the project homepage at http://preesm.sourceforge.net.
-
2
ECO
Matlab implementation of the ECO tracker
ECO (Efficient Convolution Operators for Tracking) is a high-performance object tracking algorithm developed by Martin Danelljan and collaborators. It is based on discriminative correlation filters and designed to handle appearance changes, occlusions, and scale variations in visual object tracking tasks. The code provides a MATLAB implementation of the ECO and ECO-HC (high-speed) variants and was one of the top performers on multiple visual tracking benchmarks. -
3
JILRuntime/JewelScript
An object-oriented script language to embed in any application
A general purpose, object-oriented script language that compiles into code for a register based virtual machine. The language is quite similar to object-oriented high-level languages like Java and C#. The library is entirely self-sufficient and ANSI C compliant. It's main purpose is to be embedded in any application to allow automation of that application through scripting. An integrated C++ binding code generator allows you to create bindings for your application's classes in seconds... -
4
Dwifft!
Dwifft is a small Swift library
... useful, and the other thing is a very concretely useful thing based off the first thing. It can help you build a substantially better user experience if you have table/collection views with dynamic content in your app. There is some non-trivial index math inside of this diff algorithm that is easy to screw up. Dwifft has 100% test coverage on all of its core algorithms. -
Test your software product anywhere in the worldGlobal App Testing is a managed pool of freelancers used by Google, Meta, Microsoft, and other world-beating software companies.
-
5
ipytracer
Algorithm Visualizer for IPython/Jupyter Notebook
Algorithm Visualizer for IPython/Jupyter Notebook. If you use the display(TracerObject) code from where you want to see, you can use it without any special modification. -
6
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... -
7
JView is a command line client for MyWebProject SOAP Web Service. Usage: param 1: endpoint, param 2: remote folder, param 3: algorithm, param 4: modeParam, param 5: userName, param 6: password, param 7: outputFile Example: java -jar JView2.jar http://davidesestili.ddns.net:8080/MyWebProjectLogin/services/GenerateAndDownloadHashWSLogin /home/dsestili82/ SHA-512 no-subfolders davide davide /home/davide/Scaricati/mozilla.sha512 (Currently unavailable) Source code available on https...
-
8
Machine Learning:Perceptron
Minimal version of the perceptron algorithm.Coded the simpler way.
A minimal version of the perceptron algorithm is implemented in C#. Coded for ease of understanding the referred to algorithm. Enter your info-press the learn button-then type in new info which the program will try and recognnise. There are some typos in the text displayed-but the code is correct. -
9
GenCodeGenerator
C++ class to generate biologically plausible genetic codes
... genetic codes, with the reqirement of block structure, and, optionally, with the assumption of stereochemical or biosynthetic models (to impose the assumption of the adaptive model, simply filter the codes using the error_cost() function). See Appendix in Makukov & shCherbak (2017) for the description of the algorithm. The code requires Qt 5. To compile the provided example, run 'qmake' to produce the Makefile, and then run 'make' to compile the executable file. License: Public Domain. -
Picsart Enterprise Background Removal API for Stunning eCommerce VisualsWith our Remove Background API tool, you can access the transformative capabilities of automation , which will allow you to turn any photo asset into compelling product imagery. With elevated visuals quality on your digital platforms, you can captivate your audience, and therefore achieve higher engagement and sales.
-
10
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. -
11
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 package... -
12
adapter trimmer
We implement a very simple approach. Each read is searched for the jun
We implement a very simple approach. 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... -
13
MSU's Sparse Fourier Repository
The Home of DMSFT, AAFFT, GFFT, and MSFFT.
... efficiently. It is much slower than it should be. 3.) GFFT, implemented by Ben Segal and Mark Iwen. This code is less easy to use, and also not terribly efficient. But, the *algorithm* itself is significantly simpler and has "essentially no parameters". 4.) 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 -
14
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... -
15
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.
-
16
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... -
17
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 -
18
theoEA_Code
genetic algorithm for optimizing planar optical antennas
-
19
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
-
20
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...
-
21
Attitude Estimator
A C++ implementation of a nonlinear 3D IMU fusion algorithm.
Attitude Estimator is a generic platform-independent C++ library that implements an IMU sensor fusion algorithm. Up to 3-axis gyroscope, accelerometer and magnetometer data can be processed into a full 3D quaternion orientation estimate, with the use of a nonlinear Passive Complementary Filter. The library is targeted at robotic applications, but is by no means limited to this. Features of the estimator include gyro bias estimation, transient quick learning, multiple estimation algorithms... -
22
smartblob
tiny code, html webcam game or plug brain in each blob, java server
... 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. The reshaping and bouncing physics is by springs. -
23
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. Output... -
24
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... -
25
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...
