object-based image analysis framework
Wienert S, Heim D, Kotani M, Lindequist B, Stenzinger A, Ishii M, Hufnagl P, Beil M, Dietel M, Denkert C, Klauschen F. CognitionMaster: an object-based image analysis framework. Diagn Pathol 2013, 8:34
Java toolkit for discrete Image and Signal processing.
JMathStudio is a Java based digital image and signal processing toolkit/library. It is simple to use, portable, light (~300 Kb), extendable and free. JMathStudio provides a developer with many of the advanced and basic discrete image and signal processing utilities ( 500+ useful operations/transforms). This is a standalone toolkit with no dependencies other than the JDK/JRE 1.5 or higher. JMathStudio support an entire image/signal processing pipeline right from the loading of the data (external image, audio, raw data) to data processing, data visualization (display and plot) and saving of the data (as external image, audio, raw data). Author: Bhavya Ajani (email@example.com) Android compatible JMathStudio is available @ https://sourceforge.net/projects/jmathstudio-android/
Schematic pseudocode editor for education. The algorithms may contain structures such as If..Then, If..Then..Else, For..Do, While..Do, etc.
Toolboxes for parameter continuation and bifurcation analysis.
Development platform and toolboxes for constrained parameter continuation, e.g., bifurcation analysis of dynamical systems. This material is based upon work partially supported by the National Science Foundation under Grant No. 1016467 and the Danish research council (FTP) under the project number 0602-00753B. Any opinions, findings, and conclusions or recommendations expressed on this site are those of the authors and do not necessarily reflect the views of the National Science Foundation or other funding sources. In the most recent release, documentation and tutorials are available for the following toolboxes: * ep : continuation and bifurcations of equilibrium points * coll : continuation of constrained collections of trajectory segments, including multi-segment boundary-value problems * po : continuation and bifurcations of periodic orbits in smooth and hybrid systems * recipes : collection of examples from the book Recipes for Continuation
The utility for quickest manipulations with difficult data.
This is Java library for working with overlapping trees both as with plain memory and as with hierarchical structure, with quick access to any levels and branches of tree (<page><...><section><line><word>tooLongWordForCurrentLi</line></page><page><line>neAndSectionTwoPages</word></line></section><...></page> (incorrect in classic XML)). There supported the cross-references (from="@leftPanel#template" target="$template"); cursors;copying and removing of parts; functionality to index and search data; convenient factory of dynamic generation of values and parts of data; simple variables and any objects as values and as unnamed data for manipulating. Every object of this container is an child of any numbers of trees and has dynamic address. The utility is not demanding to resources, requires no extraneous libraries and can be deployed in a small memory. It can run on mobile devices. Do not use linear algorithms, the speed is only slightly dependent on the size of data.
The project CIF now created with new philosophy of JPM (Joint Project Module) with SDK style. Now simply include CIF.h and use all of functions, macros and classes. BTS (Basic Text Support) Library Used in TOM (Text Object Module). TOM for now with CAnsiString , CAnsiStringLite And Text namespace. CAnsiString created with more functionality then typical string and text classes. EVS (Enhanced Visual Support) provide COpenFileDialog And CSaveFileDialog. JCM (Joint Core Module) used as base in project. Properly support for a class available TPT (Template Properly Type) and VTM (Value Type Macro). BTS,EVS,JCM,TOM,TPT,VTM are parts of project CIF. CIF5SDK used in project Bytes Counter. Project Core Information Foundation (CIF) is created by Muhammad Arshad Latti.
MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. For more information, see http://mlpack.org
Another encryption algorithm
Pambaf is a new encryption algorithm for users or developers with extremely high demands for security.
Petri network optimization with Martinez-Silva algorithm
A simply application in order to demonstrate Martinez-Silva optimization algorithm on Petri networks.
mathSuite Speed & Matrix Stream Processor
This program is fundamentally a short-sized version of my mathSuite program: https://sourceforge.net/projects/mathsuite/ It includes all the functionalities of MSCenv (mathSuite Calculus Environment), such as inline variables and functions (mainly thanks to ExprEval), which you can use to perform expensive complex computations and store their results into runtime variables. You can perform also every Linear Algebra Operations included in mathSuite with new optimizations.
This library allows you to generate a random number
This library allows you to generate a random number in the specified range from 0 to n, without using the built-in function Math.random (), and gets a random number from the processing time of polymorphic mathematical calculations, which depends on the current physical parameters of the CPU, RAM, and t .P. The resulting sequence corresponds to a discrete uniform distribution and is close to natural random sequences in terms of statistical randomness tests (LFSR, Approximate Entropy, DIEHARD Test).
Self-orthogonal diagonal Latin squares.
Makes self-orthogonal diagonal Latin squares, SODLS, for all valid orders, (that is, not order 2, 3, or 6). Input is an order, (one number), or an order range, (two numbers separated by white space). Output files are in folder SODLS[_n]. Each file contains a SODLS followed by a magic square. The magic square, M, is made from the order N SODLS, Q, and its transpose, as: M[row][col] = N x Q[row][col] + Q[col][row] + 1 See http://budshaw.ca/SODLS.html http://budshaw.ca/addenda/SODLSmethods.html http://budshaw.ca/addenda/SODLSnotes.html http://budshaw.ca/Download.html#sodls
SAP ABAP CL_SALV_TABLE class with editable fields
Hi everybody! I've developed a local SAP ABAP class capable of setting any field of a CL_SALV_TABLE object ready for input. I named it LCL_SALV_BUDDY. To use it go to the FILES tab and download the LCL_SALV_BUDDY README.TXT file with instructions, the LCL_SALV_BUDDY.TXT file with the class source code and file LCL_SALV_BUDDY EXAMPLE.TXT containing a working example using for an ALV FULLSCREEN using double clicks. Any questions or help email me at firstname.lastname@example.org. Enjoy! Lino
Library of solvers for work in Science, Engineering & Education
1) Portable library of solvers for work in Science, Engineering & Education. 2) Only Windows port is available. 3) Library Contents: High Precision Computation, Numerical Calculus, Complex Analysis, Geometry, Linear Algebra, Special Functions, Differential Equations, Transformations, Optimization & Interpolation, Distributions, ... (2,022 functions in v18.02 package) 4) Special: Knowledge of any programming language is not required
[frozen] A library for computing cycles in graphs or in Java code.
[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). Requires Java 5 or later.
Fast and more random implementations of java.util.Random.
Jafaran (Java Fast Random) provides fast, and for some more random, implementations of java.util.Random, with additional nextXXX() methods, and methods to retrieve and restore state. The names of implementations contain "Conc" (for concurrent) if they are thread-safe and non-blocking, or "Seq" (for sequential) if they are not thread-safe. Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided implementations. Requires Java 5 or later. Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm.
command line sort utility
Moved to GitHub https://github.com/fedups A command-line utility to sort files. Funnel is a sort utility to sort files, large and small. It efficiently handles fixed length records and variable length records. Funnel easily handles ascii (readable) data and binary data. There are many more features in Funnel. It is easy to use and very fast. All documentation is on the Wiki.
Open source library for processing arrays and matrices
AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over matrices, etc. - please see at the site. Almost all classes and methods are thoroughly documented via JavaDoc (you may read full JavaDoc at the site).
2D physics engine and simulation
Makes magic squares.
These programs make magic squares and rectangles using "Constraint-Based Local Search". (For non-square rectangles, input the order as two numbers.) There are 3 similar programs: CompleteSquare, CompleteSquareSteps, and MagicSquares. Given an input square with some cell values between 1 and NxN specified, (and other cell values 0), CompleteSquare attempts to complete a magic square by placing the remaining values. The square type can be input as semimagic, magic, or associative. For successful solutions, CompleteSquareSteps shows the steps of the search. The number exchanges at each step and the intermediate squares are written to files. MagicSquares does not require an input file. MagicSquares (only) also supports concentric and pandiagonal. (Pandiagonal succeeds only for small orders.) See: http://budshaw.ca/Download.html#complete http://budshaw.ca/Download.html#magics http://budshaw.ca/addenda/downloadNotes.html#completenotes
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 released yet) 3. Seme as point 2.. Multithread terrain-rendering, roads on it, and vehicles to go around. The most important part is terrain-rendering. The Algorithm at the heart of it features my first and second theorem abut polygonal surface approximation. It took something like 2 years to develop it. It's technically a view-dependent, continuous dynamic level-of-detail rendering algorithm. Main features are simplicity and documentation. Does easily a 4k x 4k terrain, but also much more.
E-w0rm : is a powerfull shell with handy features like : file manager , password change , database manager , bind shell , remote shell , remote upload , edit , chmod , delete , make , autoroot , php code execution , server command execution , process manager ... You can also change theme ! And " E-w0rm " brought to you by : Epic Hackers S.C Scan : https://goo.gl/718BkD
Sistema de votação por sms
Software experimental para realização de pequenas eleições ( menos de 3.456.000 votos por dia) através de votação por sms. utilizando a tecnologia GSM através de celulares ou modens GSM. Pode ser utilizado também para pesquisas sobre a opnião pública, promoções realizadas pela mídia etc. Velocidade média de recepção de votos: 40 sms/s Velocidade média de envio da confirmação do voto: 1 sms/s.