Search Results for "contiki version 3"
Sort By:
Showing 155 open source projects for "contiki version 3"
View related business solutions-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
Find Hidden Risks in Windows Task SchedulerWindows Task Scheduler might be hiding critical failures. Download the free JAMS diagnostic tool to uncover problems before they impact production—get a color-coded risk report with clear remediation steps in minutes.
-
1
C++ Library of Abstract Algebra concepts and arithmetic algorithms defined in terms of these concepts, using Instigate Generic Programming Methodology. Based on this library we plan to develop Linear Algebra and Optimization concepts and algorithms.
-
2
YACS (Yet Another Constraint Solver) is a Java library and an object-oriented framework for constraint solvers. It supports propagating and solving of constraint satisfaction problems with finite and infinite domains (discrete values and real intervals).
-
3
SolTrack
A free, fast and accurate routine to compute the position of the Sun
...SolTrack has been developed by Marc van der Sluys, Paul van Kan and Jurgen Reintjes, of the Lectorate of Sustainable Energy at the HAN University of Applied Sciences in Arnhem, The Netherlands. The code is based on the astronomical Fortran library libTheSky and can be used, modified and distributed under the conditions of version 3 of the GNU Public Licence. -
4
PWSLIB3
Password Safe encrypted databases, Java library
Java module to create, read and write Password Safe V3 encrypted databases. The package is a mature offspring from project JPasswords and can be used with Java 1.8. There is an API document available. -
Atera all-in-one platform IT management software with AI agentsAtera’s AI agents don’t just assist, they act. From detection to resolution, they handle incidents and requests instantly, taking your IT management from automated to autonomous.
-
5
libIdentity
Generate pseudo unique int64 identifiers
A simple library to generate pseudo unique long (int64) identifiers. Collisions are expected, they are usually under 0.20%. -
6
TOTimer
Time-Out-Timer for single threaded environement
Serve timeouts by calling a service-function periodically and an independent time-source (toticker). If you need a timer and like to try this one, please write your experiences to me in brief! And may be suggestions, of course. 10ms tick time should be possible. May be less. DO NOT USE Version less 0.1.1 - it is definatly buggy! Easy to control timers via Handle, eg auto create&start a timer via totimer_setTimeout function. Optionally use Callback-Functions if timeout... -
7
D-List
An extensive list subsystem, written in C
D-List is an extensive, production quality, and robust list management subsystem written in C that can be used as a shared library or compiled directly into your project. D-List provides access to 3 classes of lists, and allows extensive manipulation and customization of these lists. D-List lists can also be easily incorporated as primitives into larger treed, or nested data management systems. D-List implements a comprehensive set of linked list primitives that provides multiple forms of... -
8
mapska
The Murder Accountability Project's Serial Killer Algorithm
...dl=1 For information on this algorithm and the Murder Accountability Project please visit: www.murderdata.org. Algorithm: Copyright (c) 2010, 2016 and 2017 - Murder Accountability Project. License: GNU General Public License (GPL) version 3. -
9
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... -
Reach Your Audience with Rise Vision, the #1 Cloud Digital Signage Software SolutionRise Vision is the #1 digital signage company, offering easy-to-use cloud digital signage software compatible with any player across multiple screens. Forget about static displays. Save time and boost sales with 500+ customizable content templates for your screens. If you ever need help, get free training and exceptionally fast support.
-
10
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
11
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/ . -
12
Programmer's library for random numbers. Also random number generator testing code. Intended for simulation, games and "Monte-Carlo" algorithms.
-
13
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,... -
14
Dopamine
Framework for prototyping of reinforcement learning algorithms
Dopamine is a research framework for fast prototyping of reinforcement learning algorithms. It aims to fill the need for a small, easily grokked codebase in which users can freely experiment with wild ideas (speculative research). This first version focuses on supporting the state-of-the-art, single-GPU Rainbow agent (Hessel et al., 2018) applied to Atari 2600 game-playing (Bellemare et al., 2013). Specifically, our Rainbow agent implements the three components identified as most important by Hessel et al., n-step Bellman updates, prioritized experience replay, and distributional reinforcement learning. ... -
15
leet
Leet is CCEx's software application for on-the-fly encryption (OTFE).
The name leet stands for "Linux exquisite encryption tool", it will be a software application for on-the-fly encryption, similar in its functionality to TrueCrypt. The goal of leet however is to be simpler and as user friendly as possible, making encryption and securing of information accessible to anybody, even those who don't necessarily have any prior knowledge of data securing, algorithms and encryption. However it's not targeted at this group of users only, part of the ambition of... -
16
Latin Square Toolbox
Generates Latin squares and counts their transversals
The Latin Square Toolbox contains software tools for efficiently generating Latin squares and counting their transversals with various user-configurable options. This open source release aims to help educate folks on Latin squares and their important applications to cryptography. This version contains three tools: 0. Latin Square Generator (LSG) 1. Latin Square Transversal Counter (LSTC) 2. Latin Square Property Checker (LSPC) -
17
Javascript Clipper
Boolean operations and offsetting library in Javascript
The Javascript Clipper library performs clipping and offsetting for both lines and polygons. All four boolean clipping operations are supported - intersection, union, difference and exclusive-or. Polygons can be of any shape including self-intersecting polygons. Javascript Clipper is a port of Angus Johnson's Clipper library: https://sourceforge.net/projects/polyclipping LIVE DEMO: http://jsclipper.sourceforge.net/6.4.2.2/main_demo.html LIVE DEMO... -
18
Logi (Local Observations to Global Integration) transforms several local coordinate systems (composed of polar measurements) into a global spatial uniform network with respect to the Guide to the Expression of Uncertainty in Measurement (GUM).
-
19
Primes
Calculate primes by using extremely fast sorting
This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for... -
20
New Terrain and 3D Map System
a very lightweight advanced terrain-rendering and 3D map rendering sys
A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion not... -
21
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,... -
22
Ginors Sort
sorting algorithm for binary keys
in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] } -
23
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration,... -
24
A set of software tools useful for building, testing, and exercising web services (and other interfaces) for the travel industry which comply with the specifications of the Open Travel Alliance (OTA). This project is initiated by members of the OTA.
-
25
C++, Matlab and Python library for Hidden-state Conditional Random Fields. Implements 3 algorithms: LDCRF, HCRF and CRF. For Windows and Linux, 32- and 64-bits. Optimized for multi-threading. Works with sparse or dense input features.
