{
"printrequests": [
{
"label": "",
"key": "",
"redi": "",
"typeid": "_wpg",
"mode": 2,
"format": false
},
{
"label": "Description",
"key": "Full_description",
"redi": "",
"typeid": "_txt",
"mode": 1,
"format": ""
},
{
"label": "Homepage",
"key": "Homepage_URL",
"redi": "",
"typeid": "_uri",
"mode": 1,
"format": ""
},
{
"label": "License",
"key": "License",
"redi": "",
"typeid": "_wpg",
"mode": 1,
"format": ""
},
{
"label": "Is GNU",
"key": "Is_GNU",
"redi": "",
"typeid": "_boo",
"mode": 1,
"format": "[[File:Heckert_gnu.tiny.png]],"
}
],
"results": {
"GPS": {
"printouts": {
"Description": [
"[[Category:Candidates for deletion]] This is a candidate for deletion: Links broken. No links to page. Email to maintainer broken. [[User:Poppy-one|Poppy-one]] ([[User talk:Poppy-one|talk]]) 12:14, 31 July 2018 (EDT)\n\nGravitational Particle Simulator uses numerical methods to simulate the behaviour of particles that obey the gravitational laws of motion. The numerical method used to approximate the differential equations is a 4th order Runge Kutta method. Home page is in Italian only, but the README and the comments in the code are in English."
],
"Homepage": [
"http://www.olografix.org/xenon/"
],
"License": [
{
"fulltext": "License:GPLv2",
"fullurl": "https://directory2p.fsf.org/wiki/License:GPLv2",
"namespace": 502,
"exists": "1",
"displaytitle": ""
}
],
"Is GNU": [
"f"
]
},
"fulltext": "GPS",
"fullurl": "https://directory2p.fsf.org/wiki/GPS",
"namespace": 0,
"exists": "1",
"displaytitle": ""
},
"Gnome Flow": {
"printouts": {
"Description": [
"Gnome Flow calculates and visualizes simple steady-state fluid flows. It uses the relaxation method, and can calculate flows past symmetric objects. Steady-state means it calculates the flow at a given time and that the physical parameters are constant in time."
],
"Homepage": [
"https://web.archive.org/web/20120626061656/http://vp7.dk:80/gflow/"
],
"License": [
{
"fulltext": "License:GPLv2",
"fullurl": "https://directory2p.fsf.org/wiki/License:GPLv2",
"namespace": 502,
"exists": "1",
"displaytitle": ""
}
],
"Is GNU": [
"f"
]
},
"fulltext": "Gnome Flow",
"fullurl": "https://directory2p.fsf.org/wiki/Gnome_Flow",
"namespace": 0,
"exists": "1",
"displaytitle": ""
},
"Goptical": {
"printouts": {
"Description": [
"Goptical is a C++ optical design and simulation library. It provides model classes for optical components, surfaces and materials. It enables building optical systems by creating and placing various optical components in a 3d space and simulates light propagation through the system. Classical optical design analysis tools can be used on optical systems."
],
"Homepage": [
"https://www.gnu.org/software/goptical/"
],
"License": [
{
"fulltext": "License:GPLv3orlater",
"fullurl": "https://directory2p.fsf.org/wiki/License:GPLv3orlater",
"namespace": 502,
"exists": "1",
"displaytitle": ""
}
],
"Is GNU": [
"t"
]
},
"fulltext": "Goptical",
"fullurl": "https://directory2p.fsf.org/wiki/Goptical",
"namespace": 0,
"exists": "1",
"displaytitle": ""
},
"Gpiv": {
"printouts": {
"Description": [
"'Gpiv' is a graphic user interface for analyzing images obtained from a fluid flow that has been seeded with tracer particles by the so-called Particle Image Velocimetry technique (PIV). It is meant to have a quick overview of the parameters of all piv processes, easily changing them, running the processes and visualizing their results interactively."
],
"Homepage": [
"http://gpiv.sourceforge.net/gpiv_home.html"
],
"License": [
{
"fulltext": "License:GPLv2orlater",
"fullurl": "https://directory2p.fsf.org/wiki/License:GPLv2orlater",
"namespace": 502,
"exists": "1",
"displaytitle": ""
}
],
"Is GNU": [
"f"
]
},
"fulltext": "Gpiv",
"fullurl": "https://directory2p.fsf.org/wiki/Gpiv",
"namespace": 0,
"exists": "1",
"displaytitle": ""
},
"Gpivtools": {
"printouts": {
"Description": [
"Gpiv-tools is a package that contains command-line driven programs for the so-called (Digital) Particle Image Velocimetry technique (PIV). The programs perform image evaluation, resulting into a velocity field of the flow, validation programs and post-processing programs to manipulate the data or to extract information from the data (statistics, derivatives). There are some additional programs and scripts for data and image format conversions, chain-processing, batch-processing and for generating graphical output. Though the command-line driven tools are mainly intended for non-graphic processing, its outputs may be visualized in a graphical way by displaying with the aid of gnuplot."
],
"Homepage": [
"http://gpivtools.sourceforge.net/"
],
"License": [
{
"fulltext": "License:GPLv2orlater",
"fullurl": "https://directory2p.fsf.org/wiki/License:GPLv2orlater",
"namespace": 502,
"exists": "1",
"displaytitle": ""
}
],
"Is GNU": [
"f"
]
},
"fulltext": "Gpivtools",
"fullurl": "https://directory2p.fsf.org/wiki/Gpivtools",
"namespace": 0,
"exists": "1",
"displaytitle": ""
},
"INFOTOPO": {
"printouts": {
"Description": [
"Programs for Information Topology Data Analysis Information Topology is a program written in Python (compatible with Python 3.4.x), with a graphic interface built using TKinter [1], plots drawn using Matplotlib [2], calculations made using NumPy [3], and scaffold representations drawn using NetworkX [4]. It computes all the results on information presented in the study [5], that is all the usual information functions: entropy, joint entropy between k random variables (Hk), mutual informations between k random variables (Ik), conditional entropies and mutual informations and provides their cohomological (and homotopy) visualisation in the form of information landscapes and information paths together with an approximation of the minimum information energy complex [5]. It is applicable on any set of empirical data that is data with several trials-repetitions-essays (parameter m), and also allows to compute the undersampling regime, the degree k above which the sample size m is to small to provide good estimations of the information functions [5]. The computational exploration is restricted to the simplicial sublattice of random variable (all the subsets of k=n random variables) and has hence a complexity in O(2^n). In this simplicial setting we can exhaustively estimate information functions on the simplicial information structure, that is joint-entropy Hk and mutual-informations Ik at all degrees k=