Free pick up lines software for linux

Kreski-Lines is a collection of icons for Gnome theme.

Greenlines provides a login manager theme.

Greenlines is a set of lines drawn with SVG, and a minimalistic login manager in the upper right corner.

Some of the code is based upon Pirates of Gnome, I may fix up the code later on, because some of it is not that well thought through. Suggestions are welcome.

Elfelli is a tool to simulate and visualize electric flux lines around arbitrary positioned, electrically charged bodies.
The project is able to export PNG files of the current canvas. Elfelli is written in C++ and uses gtkmm.
Compiling:
To compile Elfelli, you need SCons. In many distributions you will also need the development package of gtkmm (in Debian this is libgtkmm-2.4-dev).
Compiling itself is very simple:
$ scons
Installation:
To install Elfelli, simply type:
$ scons install
By default, it is installed in /usr/local. If you want to change that prefix, alter the install command to:
$ scons install prefix=/install/prefix
Enhancements:
- Its now possible to save and load the current scene as well as changing a bodys charge.

Approximator Line is an application which allows to synthesize approximation function of one argument. Both coordinates of known points or mathematical expression can be used as input data.
The application uses evolutionary algorithm which allows to find more optimal results. The enhanced evolutionary algorithm allows to avoid long-time hitting to local maximum.
In few hours the application can evaluate milliards of combinations with using of reasonable number of input data points and on contemporary computer. Approximator Line uses multithreading that can help to utilize maximum computation power.
Approximator Lines primary goal is to search of function, which value, most come nearer to the initial data. The preference is given the smallest functions. The weight of this preference is established in options of synthesis.
Search of function is made by the next way:
The random mathematical variant is under construction. Its fitness to the data is calculated. Further the variant is copied and changes. Fitness of the changed variant is calculated. If it is more, the new variant becomes base. It is simplified.
Key parameter of the found function is fitness of its set goal. Fitness is expressed in percentage. Its value depends on a way of the assignment of fitness of a point (it is established in parameters of synthesis). The program uses two basic such as fitness:
General fitness
Calculates on the general points.
Additional fitness
Calculates on general and additional points. It is used for more exact definition of fitness. It also is used for avoidance of a finding of such functions which correspond to the basic points, but in an interval between them strongly differ.
Additional fitness is used for a finding of the most corresponding functions at smaller amount of computing expenses as it calculates only if the basic fitness more than at the previous variant. Besides each of the mentioned above fitness can be normal or effective.
Normal fitness
Fitness in view of amount of elements of expression.
Effective fitness
Fitness without taking into account amount of elements of expression.
In the list of results normal additional conformity and effective additional conformity is accordingly displayed.
By search of the most suitable variant, or in other words synthesis cancelation constant subexprassions is made also.
Synthesis is based on use of random numbers. Functions making expression, operators variables and numbers get out randomly. The application is optimized on speed. So synthesized function in memory represents a tree of mathematical objects. Values of function are calculates by the most effective way. The mutation also is made above a tree of objects.
Usage:
- Determine the form of the input data (coordinates or expression).
- Choose points of your graph. Synthesis will be estimated on them.
- Enter coordinates of points (use autonumbering for simplification of input) or expression.
- Determine a range of value of function, amount of the basic points, amount of additional points.
- Open parameters of synthesis and adjust if it is necessary.
- Save the project.
- Press Start of synthesis.
- Pass to results and see on them.
- Leave the application working on long time.
- Periodically check results. When the application will find, in your opinion, suitable function, press Stop and save results.

Nerdy Lines theme is based on the Kreski Lines icon theme. The main problem was that the original theme was not scalable. And also incomplete.
That gave my desktop an incomplete look. So I decided to fix that. The result is that they were redrawn from scratch in SVG-format.
Installation:
Untar archive to ~/.icons
-or-
drag and drop to the gnome theme manager and it will automatically install
Enhancements:
- Getting my desktop icons done (part III)

MaVerick is a project to produce a free open source Multivalue Database Management System.
MaVerick is intended to provide a flexible and readily extendable implementation suitable for use in a new century.
The MaVerick project was started in 1999 on the comp.databases.pick newsgroup by a collection of multivalue users.
MultiValue databases have been around for about 30 years, starting off with The Pick Operating System. Youve probably heard of relational databases, well, MultiValue databases can be relational, but their method of storing data is much more flexible than the 2 dimensional table you normally associate with relational databases, i.e., you can store multiple fields within a field. On top of which, they are extremely fast in operation.
Enhancements:
- Multiple improvements were made to the basic compiler, the query language, the runtime, and the file system.