Search Results for "k-stor"
Sort By:
Showing 31 open source projects for "k-stor"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
$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
LINE Solver
Queueing Theory Algorithms
LINE is an open-source software package to analyze queueing models via analytical methods and simulation. The solver is available for Java/Kotlin, MATLAB, and Python. LINE features algorithms for the solution of open queueing systems (e.g., M/M/1, M/M/k, M/G/1, ...), open and closed queueing networks, and layered queueing networks. Additional details are available on the project website: http://line-solver.sf.net. -
2
Advanced Trigonometry Calculator
Precision Trigonometry: Advanced Calculator for Complex Math
Advanced Trigonometry Calculator is equipped with a user-friendly interface that allows for easy input of problems and instant computation. Professionals such as engineers who need to perform advanced trigonometric calculations in their work will find this tool extremely useful. ATC Online Alpha: https://advantrigoncalc.sourceforge.io/atc/ More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by... -
3
JQM Java Quine McCluskey
JQM - Java Quine McCluskey for minimization of Boolean functions.
Java Quine McCluskey (JQM) implements the Quine-McCluskey algorithm with Petrick’s Method for minimizing Boolean functions. Designed for both education and industrial application, it handles up to 16 variables and functions. Uniquely, JQM bridges the gap between theory and practice: it visualizes the solution process with generated Karnaugh Maps for students, while supporting PLC engineers by exporting results to Structured Text (ST) and Ladder Diagram (LD). The software includes a GUI for... -
4
LoopMatcher
Find sequence-specific stem-loops in FASTA and GenBank files.
LoopMatcher is a bioinformatics tool that searches for hairpin structures in cDNA / mRNA sequences (in FASTA, GenBank or Vienna format) with specific consensus sequences in the loop. It uses RNAfold to predict sequence structure and UShuffle to generate random sequences with a defined k nucleotide frequency. Also, sequences in GenBank format can be downloaded directly from NCBI using the NCBI access ID. Requirements JAVA Runtime 8. It's highly recommended to have a multicore processor to process large sequences. * Currently, this version only runs in Windows x64. -
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
5
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
6
This application allow user to predict dissolution profile of solid dispersion systems based on algorithms like symbolic regression, deep neural networks, random forests or generalized boosted models. Those techniques can be combined to create expert system. Application was created as a part of project K/DSC/004290 subsidy for young researchers from Polish Ministry of Higher Education.
-
7
DORY
For mining KASH proteins (SUN domain-interacting proteins)
...DORY is upgraded to DORY2. DORY2 required BLAST+ to run. ***Please make sure BLAST+ is installed on your computer.*** Please see the following publication for detail: Zhou X, Graumann K, Wirthmueller L, Jones JDG, Meier I (2014) Identification of unique SUN-interacting nuclear envelope proteins with diverse functions in plants. The Journal of Cell Biology 205(5):677-692. http://jcb.rupress.org/content/205/5/677.full Please see other useful tools for biology research: https://sourceforge.net/projects/cloversystem/?... -
8
KAnalyze
DNA/RNA Sequence K-mer Toolkit
KAnalyze is a Java toolkit designed to convert DNA and RNA sequences into k-mers. It is both a command line application and an API. -
9
The Virtual Math Teams (VMT) Project (vmt.mathforum.org) at the Math Forum enables K-12 math collaborative learning, professional development of educators, & group cognition research. VMT is now integrated with GeoGebra (http://www.geogebra.org/).
-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
10
Belief Reviser
Belief Revision via PS-Merge under constraints belief merging operator
Belief revision is a central topic in knowledge representation and reasoning. It consists in incorporating a new belief, changing as few as possible of the original beliefs while preserving consistency. Revision always considers new evidence as a better belief. Such new evidence is usually represented in the form of a propositional formula which must be preserved after the revision. Here, the Δps (PS-Merge) belief merging operator is extended in order to consider constraints, and ... -
11
QueueSimulator
Simulator of G/G/k queue systems used in computer networks.
QueueSimulator is a free software which aims to simulate primarily G/G/k queueing systems that are used in computer networks. But it can be used to simulate practically any stable queue system. -
12
IMPACT_S
Integrated Multiprogram Platform Analyze & Combine Tests of Selection
Maldonado E, Sunagar K, Almeida D, Vasconcelos V, Antunes A (2014) IMPACT_S: Integrated Multiprogram Platform to Analyze and Combine Tests of Selection. PLoS ONE 9(10): e96243. doi: https://doi.org/10.1371/journal.pone.0096243 -
13
NIKS
NIKS (Needle in a K-stack) - detection of mutations in NGS data
To get access to the code, please check it out with svn as described in the code section. -
14
Weka4OC GUI for Overlapping clustering
Weka4OC: Weka for Overlapping Clustering is a GUI extending WEKA
This is a GUI application for learning non disjoint groups based on Weka machine learning framework. It offers a variety of learning methods, based on k-means, able to produce overlapping clusters. The application also contains an evaluation framework that calculates several external validation measures. The application offers a visualization tool to discover overlapping groups. -
15
MSTParser
MSTParser is a non-projective dependency parser that searches for maxi
MSTParser is a non-projective dependency parser that searches for maximum spanning trees over directed graphs. Models of dependency structure are based on large-margin discriminative training methods. Projective parsing is also supported. mstparser 0.5.1 is now available via Maven Central. If you use Maven as your build tool, then you can add it as a dependency in your pom.xml file: <dependency> <groupId>net.sourceforge.mstparser</groupId> <artifactId>mstparser</artifactId> ... -
16
Niah (Statistical Disclosure Control)
Niah supports k-anonymity statistical disclosure control assessments
Niah is a simple java tool for use in statistical disclosure control risk assessments. It implements the k-anonymity model of disclosure risk for data in csv in format. This work was developed as part of a PhD project at the University of Glasgow and during an internship with the Scottish Government. -
17
ME_DSS
Microemulsion Decision Support System
This application allow user to predict microemulsion region based on algorithm consisted of artificial neural networks and random forests. Those techniques combined create Decision Support System. Application was created as a part of project K/DSC/000033 subsidy for young researchers from Polish Ministry of Higher Education. -
18
Ferox
Ferox - Sequence Alignment with Fuzzy K-mers
Ferox is a DNA sequence alignment application that uses fuzzy k-mers to quickly and accurately align sets of sequence reads against a reference genome. Ferox can also be used to align whole genomes. The seeding mechanism used by Ferox is highly configurable, allowing custom fuzzy seeds to be created declaratively in an XML configuration file. -
19
MuLaViTo
A framework for the visualization of multi-layer networks
MuLaViTo is a multi-layer visualization framework which allows to visualize relations between multiple graphs in derived applications. Moreover, it provides helpful means like k-shortest path algorithms, running algorithms in a separate thread, ... -
20
K people is a software platform capable of integrating with enterprise systems. It enables workers to improve productivity, while giving management the the means to plan and monitor activity.
-
21
This project concerns K-MADe (Kernel of Model for Activity Description environment), a tool for contributing to the incorporation of ergonomics into the interactive systems design process, through task and activity analysis.
-
22
SimulME is a Java ME (J2ME) application with Queueing calculator, Stopwatch, Monte Carlo simulation, Random Number Generator (RNG), Probability distributions, Kolmogorov-Smirnov and Chi-square tests. It works with MIDP 2.0 and CLDC 1.1 profiles.
-
23
Multi-Partite Community Detection - community detection (aka graph clustering) in k-partite k-uniform hypergraphs
-
24
An implementation of "k-Way Merging" as described in "Fundamentals of Data Structures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/
-
25
RepeatMap is a collection of time/memory efficient algorithms and data structures to enable rapid counting & querying of kmers (sequences of length k) counts in large sequences. E.g. a query could be "how many times is 'ACGTCATGGTAC' found in a genome."
