Punto is a tool for plotting particles. It reads particle data from a file and displays them in a window in several ways, like dots, circles, squares, and spheres. It can also plot vectorial fields. The output can be in one, two, or three dimensions. It is possible to zoom in and out, rotate in three dimensions, draw periodic images, and more. It can produce animations easily from your data files.
Regress Pro is scientific and industrial software that can be used to study experimental data coming from spectroscopic ellipsometers or reflectometers. The program has been developed mainly looking to the application of thin film measurement in semiconductor industry. The software is suitable both to determine the thickness of the layers and to determine the optical properties of dielectric materials.
Sally is a tool for mapping a set of strings to a set of vectors. This mapping is referred to as embedding and allows techniques of machine learning and data mining to be applied for the analysis of string data. It can be used with data such as text documents, DNA sequences, or log files. The vector space model or bag-of-words model is used. Strings are characterized by a set of features, where each feature is associated with one dimension of the vector space. Occurrences of the features in each string are counted. Alternatively, binary or TF-IDF values can be computed. Vectors can be output in plain text, LibSVM, or Matlab format.
Salad (short for Letter Salad) is an efficient and flexible implementation of the well-known anomaly detection method Anagram by Wang et al. (RAID 2006). Salad is based on n-gram models, that is, data is represented as all of its substrings of length n. During training these n-grams are stored in a Bloom filter. This enables the detector to represent a large number of n-grams in little memory and still being able to efficiently access the data. Salad extends Anagram by allowing various n-gram types, a 2-class version of the detector for classification, and various model analysis modes.
Harry is a small tool for comparing strings and measuring their similarity. It implements several common distance and kernel functions for strings, as well as some exotic similarity measures. For example, Harry supports the Levenshtein (edit) distance, the Jaro-Winkler distance, and the compression distance. Harry is implemented using OpenMP, so its runtime scales linearly with the number of available CPU cores. Efficient implementations and effective caching speed comparison of strings.