Open Source Linux Mathematics Software - Page 100

OSlash is a c++ framework for developing decentralized cloud computing services. It includes a programming environment and virtual machine for assembling networks of processing nodes coordinate their operations through message passing.

The project OSMLE (Open Scientific Mathematical Learning Environment) has great promise to benefit various scientific fields of study by producing results from known formula's at the speed and accuracy of a PC.

Overture is a framework for solving partial differential equations (PDEs) in complex, possibly moving geometry. Overture uses overlapping grids to represent the geometry. The software includes grid generation capabilities, PDE solvers for fluids, solids, and fluid-structure interactions (FSI) as well as electromagnetics.

Oxtor's math draw is a program for drawing graphs mathematicians, starting with the mathematical function,it is written in Java,supported oper is:+-*/()^root log sin cos tan asin acos atan ln. Constant: e and P e = the basis of natural logarithms P = PI

Transformation from MathML (presentation markup) to SVG using XSLT 2.0

parFE is fully-parallel high-performance finite element code targeted to the modeling of trabecular bones in humans. It employs scalable multigrid solvers for efficient solutions on massively parallel computers.

PariGUIde is a GUI for Pari-GP, a math.-programm, that is generally oriented above number theory and driven by very efficient algorithms. The mission of pariGUIde is to simplify the use of Pari-GP, and promote the the joy in mathematical experimenting.

Simple pushdown calculator written in C++.

Real-time data visualization. Graphically view your data as it's being generated. Peakster is a very intuitive GUI written entirely in Python, which monitors data at regular intervals and uses gnuplot to render 2D, 3D and superimposed plots.

Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity in practical situations significantly.

Framework: Project for Evolutionary Predator Prey Algorithms, used to implement an evolutionary scheme based on the developement by van Laumanns. Implement testproblems, special behaviours, environments, and other yet not known features.

The pf2html project adds functionality to LATEX2HTML such that LATEX documents written with pf.sty can be viewed in a web browser up to the desired level of detail for each branch of a structured proof.

phcfM is an R package for modelling anthropogenic deforestation. It was named after the REDD+ pilot-project 'programme holistique de conservation des forêts à Madagascar'. phcfM includes two main functions: (i) demography(), to model the population growth with time in a hierarchical Bayesian framework using population census data and Gaussian linear mixed models and (ii) deforestation(), to model the deforestation process in a hierarchical Bayesian framework using land-cover change data and Binomial logistic regression models with variable time-intervals between land-cover observations. The two functions use embedded Gibbs samplers written in C++ with the Scythe statistical library to reduce computational time.

The aim of this project is to produce a software that will content two modules : - the first one will allow to conduct simulations of social behavior, - the second one will be able to produce philosophical considerations. The version version will be i

phpFinancials aims to become a full featured function library for PHP to provide finance industry related methods.

a library which i hope to write to compute high precision aerodynamic and electrodynamic equations

Its strange how the "sorted pointers" normalizing makes just about any random function, as long as it connects the inputs to the outputs on some path, vibrate as some nonlinear shape of wave. This could be used as a game interface for evolvable musical instruments or fluid puzzle games. Physicsmata is similar in effect to SmoothLife but simpler and pure Java. The cellular automata API takes a function to run at each point. Its parameters are sums of screen brightness (n color dimensions are optional) at concentric circles around each point, efficiently costing only the perimeter of those circles (instead of the area) because of the tree of squares. You can create any function, or to get started try the visual function editor where each click changes if a column is sine/sigmoid/half/double/exp/etc or which of the 0, 1, or 2 columns to the left are its params. Every click changes the patterns of waves seen on the left, which run that function you visually built at each point.

THIS PROJECT MIGRATED TO GITHUB https://github.com/cosmo-guffa/play-svg A great thanks to SF.net for hosting up until now... it's nothing personal, this just isn't the right tool for the job ;) Project description: pLAySVG is a python library for the development and manipulation of SVG vector graphics through scripting. pLAySVG makes it easy to create graphics based on geometric relationships. It's intended for educational and artistic use.

implementation of an optimized poisson solver on cell processor

Maximum packing densities for individual, polydisperse (diameter), ellipitic platelets and stacks of them (max 5 platelets per stack implemented). Size fractionating for stacks (platelets with diameters below a cut-off diameter remain as individual platelets all others assemble in stacks) can be included. Considers only hard interactions and assumes spherical exclusion volumes.

Application for polynomial roots calculation. The application does the job by supposing the roots of the derivative function are known. This way, we can delimit the range where each possible root is in, and by applying Bolzano's theorem, we can find the zeroes. It is not a very eficient way, as we must calculate al the derivatives of the polinomial, implying very high numbers (n!), that make the needed precision increase, making the computational complexity for high-degree polinomials poor. But I have been able to make it work with a 40-degree polynomial, with two very proximal zeroes arround x=1000. It needs a precision of arround 60 digits. The problem comes with very-high degree polynomials. The higher is the degree, the faster the execution time increases. But for common examples, the application does the job well. You will find more about it at this web site: https://www.frojasg1.com:8443/downloads_web/web/html/raicesDePolinomios.html?origin=sourceforge

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 network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. In general, emphasis is given in improving the efficiency of the algorithms in shared-memory models via java threads, since multi-core machines are so wide-spread today.

O jogo consiste no seguinte: Monty Hall (o apresentador) apresentava 3 portas aos concorrentes, sabendo que atrás de uma delas está um carro (prémio bom) e que as outras têm prêmios de pouco valor. Na 1ª etapa o concorrente escolhe uma porta (que ainda não é aberta); De seguida Monty abre uma das outras duas portas que o concorrente não escolheu, sabendo à partida que o carro não se encontra aí; Agora com duas portas apenas para escolher — pois uma delas já se viu, na 2ª etapa, que não tinha o prêmio — e sabendo que o carro está atrás de uma delas, o concorrente tem que se decidir se permanece com a porta que escolheu no início do jogo e abre-a ou se muda para a outra porta que ainda está fechada para então a abrir. Qual é a estratégia mais lógica? Ficar com a porta escolhida inicialmente ou mudar de porta? Com qual das duas portas ainda fechadas o concorrente tem mais probabilidades de ganhar? Por quê?

A spreadsheet/matlab-like tool for numerical programming with python.

It a basic Maths program to help children to count.