Free salvador dali the persistence of memory software for linux

Simple persistence for Java is an object/relation mapping framework for Java. It is designed to be easy to use.
There are no XML files to write, no tables to create, no IDs to generate, and no primary keys to fiddle with; just point it to the database, check the API documentation for three basic methods, and code away.
Simple persistence for Java supports transactions, has its own simple query language (very similar to SQL), and can handle object references, lists, and maps.
You may ask: Why another O/R mapping library? Well.. Ive searched the net for a suitable O/R tool for a long time now, also tried a few in live projects, but each time, at the end of the project, I had always had a few thoughts to simplify the database interaction code. Ive started with EJB around 2000. Now, I think everyone who used EJBs also at least once wondered why saveing a friggin object requires a separate server installation, the extensive knowledge of a 200+ page documentation, generating 3 classes/interfaces per object, installing stubs, rmi, and other things I dont even want to know about. Lets just skip this chapter of my life directly to my last experience with an O/R library: pbeans. This library is generally good, I can recommend it for those, who want a stable O/R mapping tool, but it was not the one for me. I found a few points I couldnt get over:
- Save and insert should be one method. I usually dont care if an object is inserted or saved phisically, as long as its saved.
- It should handle Lists and Maps. Well, "Lists should be enough for everybody", but sometimes Maps are handy too. Lists are used very often, I think it should be handled automatically.
- The query code is too difficult, and at the same time does not offer enough features.
- The code you have to write wont be "pretty". It requires classes to be parameters, at least for queries, and I cant read the query itself.
- The Id handling is not transparent.
Enhancements:
- A major scalability feature has been added: the library is now capable of working in a distributed environment, such as load-balanced Web server clusters.
- All the library nodes connected to the same database will form a self-regulating, self-organizing, failure-tolerant network to manage exclusive resources (such as locks, etc).
- The documentation and site were updated accordingly.

subPersistence is an abstract, light-weight yet flexible framework for working with O/R persistence mappers. It provides for independence of a specific O/R mapper such as Hibernate or Castor.
While you can use Hibernate or Castor (or other O/R mappers) directly, coupling your application too tightly to those can be a bad thing. subPersistence makes it easy to switch underlying O/R mappers, thereby decoupling the application layer from those.
It abstracts away differences between the mappers, while still making it possible to use their specific features if needed.
Enhancements:
- This version updates to Java 5 features such as Generics and is the first version to require Hibernate 3.

The Linux Memory Game project is a childrens (and adults) game based on the card game.
The Linux Memory Game is an X11 game using GTK+ library for children ages 3 and up. It is a lot more than the card game "Memory".
It has five skill levels, the higher ones are challenging to adults as well. Additionally, one can choose from the menu to match 2 cards or 3 cards, or match different cards.
This last "different card" mode can be a very good teaching tool for teaching languages, concepts, or association.
Main features:
- Extensible - add new images yourself without having to make changes to the program.
- Five skill levels appropriate for the youngest and the ones with the best brains.
- Can play two card matching or three card matching (more challenging!)
- Can set to match different cards. This can be used with apropriately designed pictures to teach children (or adults) words, concepts, or another language.
Enhancements:
- Fixed overflow bug in pixmaps_jump.

All System Info is a system info SuperKaramba theme. Simple english version...
It shows:
- System Info
- CPU usage
- Network Usage
- Memory Load
- HDD usage

Monkeys Memory is an implementation of the classic game of memory. Classic Game of Memory written in mono where you can play against other people (on the same computer, network game is not implemented jet) or against Computer (there is 2 type of computer player).

There is more level of game from tiny level to very big one.

Widget libraries have now been developed and used for years. In all these libraries, widget instances require computer memory. But this memory is not really required, We have implemented a widget library to prove that it is possible to use zero bytes of memory per widget.
In such a library, there is no widget reference, so widget programming is easier even in a low level language such as C. Programs are more robust because they do not use pointers, make no memory management and do not translate data between application and widget.
To set the attributes of a widget, it is not possible to use the widgets pointer so a current state is used as in OpenGL. Most classic widgets were integrated into the library, and it is possible to integrate widgets of all kinds without any problem.
This library license is the GNU GPL. Beware: it is alpha software. It works but the API is not yet stable.
Main features:
Base widgets:
- text, text_editable, int, int_editable,
- anchor,
- button, tearoff, button_with_accelerator,
- image, image_from_file,
- scrollbar2, scrollbar_vertical, scrollbar_horizontal,
- toggle (bit or int or char) with or without label. Same for radio button. Really easy to use.
Container widgets:
- window, window_drag, window_popup_right, window_popup_bottom
- anchor_box,
- box_horizontal, box_vertical, box,
- decorator,
- notebook,
- scrolledview (can contains billions of children)
- viewport
- table, table_with_width,
- void, if, popup : base system to make transient widgets. The menu are constructed with "popup"
Composite widgets:
- alert (container),
- message (container),
- filechooser,
Widget attributes:
- Choice of the focus group.
- Width: padding, border, focus
- Expand: vertical, horizontal
- Alignment: vertical, horizontal
- Font: family, size, weight, style
- Geometry: x, y, width, height
- Window auto resize
- Sensibility (to overide the value computed automaticaly)
- Debug level
Other features:
- a drag and drop working only inside the application.
- fully working text cut and paste (UTF8 or not).
- simple animation possible.
- the library runs a web server allowing to debug.
- accelerators. If a modifier key is pressed, a list of short-cut with this key is displayed in a bubble tip.
Enhancements:
- Complete rewrite of the kernel API, in order to have :
- The library can now be updated without recompiling external code

The goal of RUMT is to check the memory of a computer over a long period of time and almost-real load conditions without having to interrupt the services.

RUMT exploits the possibility of some Unix kernels to selectivly disable some memory areas while still accessing them through the /dev/mem device. The principle of RUMT is to write pseudo-random data in these disabled memory areas, and later check them. This principle and the original code for the deterministic pseudo-random generator are from David Madore.

This distribution contains another variant on the same theme: URUMT allocates a large chunk of memory, locks it in memory using the mlock(2) system call, and scans /dev/mem to find where in physical memory the allocated area is. Then it continuously runs the same tests in that memory.

URUMT can not be used to test a particular area of memory: the kernel will give it whatever physical memory it feels like. But URUMT can be restarted now and then, hopefully getting different physical memory each time.

This is perfect if you suspect you have bad bits, but do not know at all where they are. Once you have sighted the bad bits, you can use a plain RUMT to test more extensively the neighborhood.