Search Results for "sparse"

...The following wiping methods are supported: Gutmann-like, random, Schneier, DoD. Additionally, WipeFreeSpace can finalize wiping the filesystem by writing blocks of zeros, which is friendly for sparse files, virtual systems and other places where zeroed-out space is not physically allocated. See the project homepage https://wipefreespace.sourceforge.io and the project Wiki in the menu above. To prevent clear-text data from being left on the drive in the first place, you can use LibSecRm (https://libsecrm.sourceforge.io), which wipes the data on-the-fly.

Weka wrapper for the SGM toolkit for text classification and modeling. Provides Sparse Generative Models for scalable and accurate text classification and modeling for use in high-speed and large-scale text mining. Has lower time complexity of classification than comparable software due to inference based on sparse model representation and use of an inverted index. The provided .zip file is in the Weka package format, giving access to text classification.

...I found a way to normalize 1d wavefunction amplitude so this hack and its random heat vibrations are still unitary, even while microphone vibrating adds energy to part of 1d string of position and speed scalar arrays. The sparse part is, while the arrays are perfectly dense and linear, time is sparse when some springs vibrate with a larger multiplier of position subtracted from speed. In other words, this hack is a quanta level discontinuous field but in theory may be continuous as change in natural resonance frequency (what part of the "guitar string" would vibrate as if nothing acted on it) These few kilobytes of java code, many versions of CochleaSim.java and JSoundCard0.5 as an easily replaced dependency that reads microphone and writes to speakers as numbers ranging -1 to 1 44100 times per second, which is where SparseDoppler hooks in its array, microphone at one end and speakers hear the sum of the whole string.

The Universal Java Matrix Package (UJMP) is an open source Java library which provides sparse and dense matrix classes, as well as a large number of calculations for linear algebra such as matrix multiplication or matrix inverse. Operations such as mean, correlation, standard deviation, replacement of missing values or the calculation of mutual information are supported, too. The Universal Java Matrix Package provides various visualization methods, import and export filters for a large number of file formats, and even the possibility to link to JDBC databases. ...

...All those operations can be done millions of times per second regardless of size because the AVL forest reuses existing branches recursively. Theres a scalar (originally for copy/pasting subranges of sounds) and a bit Java package. Sparse n dimensional matrix.

...The library includes a singly linked (cons/cddr style) list/stack, an integer trie based indexed list, a 2-3 tree based random access indexed list, a 2-3 tree based map, a hash trie based map, and hash and tree based sets, and sparse arrays. All collections provide immutable Cursor as well as standard Iterator classes for looping through all elements. A utility class provides functional style algorithmic processing of Cursors including foldLeft, foldRight, collect, select, and reject. The 2-3 tree and integer trie classes are optimized for performance and can be used alongside java.util Collections when immutability is needed for safe data sharing.

The TextProcessor Java package is a text processing toolkit, which provides some frequently used text processing functions such as stemming, removing stop-words, generating a term vocabulary, and calculating the term-doc frequency matrix. Basic topic mining models such as LDA and sparse NMF are also supported. The package can also generate feature files from a given text dataset with LDA and LIBSVM format for posterior procedures such as classification or clustering. The toolkit is also being extended for more advanced text analysis tasks based on natural language processing techniques.

SPARSE: A Symptom-based Antipattern Retrieval Knowledge-based System Using Semantic Web Technologies

The JSparse Matrix Package, developed by Philipp Geigenmüller during an internship at the prudsys AG in Chemnitz, Germany, is an extension of the well-known Java Matrix Package (JAMA) and allows the use of sparse matrices and related algorithms.

CSparseJ is a Java port of CSparse: a Concise Sparse matrix package.

JMatrixView is aJava/Swing matrix viewer. It works with Colt matrix implementation. It features dynamically tunable row/column resolution and has been designed for sparse matrix.

An ANN design/implementation focused to work with optimally with NEAT (http://www.cs.utexas.edu/users/kstanley/neat.html). Semiann uses a sparse matrix to fill out the nodes, connections, weights, biases and activation functions for an ANN.