Free million musician challenge 0.821 software for linux

CodeInvaders Challenge project is a Java-based, real-time programming game based on the Eclipse platform.

CodeInvaders Challenge is a Java™-based, real-time programming game based on the Eclipse platform. It uses the Eclipse platform and a simple API that allows users unfamiliar with Java to easily compete while they learn the language.

CodeInvaders Challenge gives users the opportunity to pit their Java programming skills against other players in a battle of space conquest. Each player writes a Java class that represents and controls a spaceship. Each ship (class) is placed in a simulated battle along with ships from other players.

The game puts up to six spaceships together in a match and places each of them in a random location with the same amount of energy. The spaceship class allows each player to control his ships thrusters and weapons. The ship can move around to collect energy, attack opponents, and bring energy back to its home planet. Points are awarded for different actions, and the player with the most points wins.

When used in a tournament, CodeInvaders Challenge allows direct, real-time competition between teams. Each player can submit his intermediate solutions and test against the submitted ships from other players. This competition allows each player to learn from the strategies of other players and modify his ship appropriately. After the final submission from each player, the final winner can be found by running a tournament consisting of several rounds and eliminations.

HPC Challenge is a high performance benchmark suite. The HPC Challenge consists of basically 7 benchmarks:
1. HPL - the Linpack TPP benchmark which measures the floating point rate of execution for solving a linear system of equations.
2. DGEMM - measures the floating point rate of execution of double precision real matrix-matrix multiplication.
3. STREAM - a simple synthetic benchmark program that measures sustainable memory bandwidth (in GB/s) and the corresponding computation rate for simple vector kernel.
4. PTRANS (parallel matrix transpose) - exercises the communications where pairs of processors communicate with each other simultaneously. It is a useful test of the total communications capacity of the network.
5. RandomAccess - measures the rate of integer random updates of memory (GUPS).
6. FFTE - measures the floating point rate of execution of double precision complex one-dimensional Discrete Fourier Transform (DFT).
7. Communication bandwidth and latency - a set of tests to measure latency and bandwidth of a number of simultaneous communication patterns; based on b_eff (effective bandwidth benchmark).
Compiling:
The first step is to create a configuration file that reflects characteristics of your machine. The configuration file should be created in the hpl directory. This directory contains instructions (the files README and INSTALL) on how to create the configuration file. The directory hpl/setup contains many examples of configuration files. A good approach is to copy one of them to the hpl directory and if it doesnt work then change it. This file is reused by all the components of the HPC Challange suite.
When configuration is done, a file should exist in the hpl directory whose name starts with Make. and ends with the name for the system used for tests. For example, if the name of the system is Unix, the file should be named Make.Unix.
To build the benchmark executable (for the system named Unix) type: make arch=Unix. This command should be run in the top directory (not in the hpl directory). It will look in the hpl directory for the configuration file and use it to build the benchmark executable.
Configuration:
The HPC Challange is driven by a short input file named hpccinf.txt that is almost the same as the input file for HPL (customarily called HPL.dat). Refer to the file hpl/www/tuning.html for details about the input file for HPL. A sample input file is included with the HPC Challange distribution.
The differences between HPL input file and HPC Challange input file can be summarized as follows:
- Lines 3 and 4 are ignored. The output always goes to the file named hpccoutf.txt.
- There are additional lines (starting with line 33) that may (but do not have to) be used to customize the HPC Challenge benchmark. They are described below.
The additional lines in the HPC Challenge input file (compared to the HPL input file) are:
Lines 33 and 34 describe additional matrix sizes to be used for running the PTRANS benchmark (one of the components of the HPC Challange benchmark).
- Lines 35 and 36 describe additional blocking factors to be used for running PTRANS benchmark.
Just for completeness, here is the list of lines of the HPC Challanges input file with brief descriptions of their meaning:
- Line 1: ignored
- Line 2: ignored
- Line 3: ignored
- Line 4: ignored
- Line 5: number of matrix sizes for HPL (and PTRANS)
- Line 6: matrix sizes for HPL (and PTRANS)
- Line 7: number of blocking factors for HPL (and PTRANS)
- Line 8: blocking factors for HPL (and PTRANS)
- Line 9: type of process ordering for HPL
- Line 10: number of process grids for HPL (and PTRANS)
- Line 11: numbers of process rows of each process grid for HPL (and
PTRANS)
- Line 12: numbers of process columns of each process grid for HPL
(and PTRANS)
- Line 13: threshold value not to be exceeded by scaled residual for
HPL (and PTRANS)
- Line 14: number of panel factorization methods for HPL
- Line 15: panel factorization methods for HPL
- Line 16: number of recursive stopping criteria for HPL
- Line 17: recursive stopping criteria for HPL
- Line 18: number of recursion panel counts for HPL
- Line 19: recursion panel counts for HPL
- Line 20: number of recursive panel factorization methods for HPL
- Line 21: recursive panel factorization methods for HPL
- Line 22: number of broadcast methods for HPL
- Line 23: broadcast methods for HPL
- Line 24: number of look-ahead depths for HPL
- Line 25: look-ahead depths for HPL
- Line 26: swap methods for HPL
- Line 27: swapping threshold for HPL
- Line 28: form of L1 for HPL
- Line 29: form of U for HPL
- Line 30: value that specifies whether equilibration should be used
by HPL
- Line 31: memory alignment for HPL
- Line 32: ignored
- Line 33: number of additional problem sizes for PTRANS
- Line 34: additional problem sizes for PTRANS
- Line 35: number of additional blocking factors for PTRANS
- Line 36: additional blocking factors for PTRANS
Enhancements:
- This version contains many bugfixes, major features, and minor enhancements, many of which were contributed by users.
- The major focus of this release was to improve accuracy of the reported performance results and ensure scalability of the code on the largest supercomputer installations with hundreds of thousands of computational cores.

Block Rage will be a falling blocks game with detailed graphics and animated plasmatic backgrounds.
You will be able to challenge your friend in a 2-player hotseat mode! It is strongly inspired by a superb DOS classic.
At present, the game is fully playable, but theres no real graphics nor sounds and absolutely no music.
Enhancements:
- New tile graphics
- Enhanced 2-player screen
- Improved sound module
- Fixed caps lock handling
- Sets window caption
- Other fixes

Mirage is a fast and simple GTK+ image viewer. Mirage project supports a variety of image formats (png, jpg, xpm, gif, bmp, tiff, and many others). Mirage provides zooming and rotating capabilities, as well as displaying transparency as a checkerboard.

Because it depends only on PyGTK, Mirage is ideal for users who wish to keep their computers lean while still having a clean image viewer.

Mirage was written because of what I perceive to be a lack of a simple and lightweight GTK+ image viewer available. A secondary reason was my desire to learn python and the GTK+ toolkit, of which I am very fond. Its been a struggle and a challenge at times, but a fun one at that.

KMidimon is a MIDI monitor for Linux using ALSA sequencer, with KDE user interface.
At some point, almost every serious MIDI musician needs to monitor a MIDI data stream,
perhaps to diagnose a malfunctioning piece of equipment or to examine the contents of a MIDI sequence during playback.
Main features:
- Easy to use KDE graphic user interface
- Based on ALSA sequencer. Provides one input port to be connected to other programs and devices using the usual external tools (aconnect, kaconnect, QJackCtl...)
- Customizable event filters and sequencer parameters
- Supports all MIDI messages, including System Exclusive, and some ALSA messages
- Saves to a text file the recorded event list
- GPL licensed
Enhancements:
- Show/hide columns via Preferences dialog and a context menu
- Option for translating universal sysex messages
- Format sysex with 2 hex digits per byte
- Option for using fixed font
- Redesigned Preferences dialog, available even when recording.
- Internationalization updates
- Spanish translation updated
- New antialiased icons
- RPM files available for Mandriva 10.2

Pogo Sticker contributed in the Assembly2005 event and placed 3rd in the game development competition. Pogo Sticker game is designed and programmed by Jetro Lauha, with most of level design and graphics coming from Sara Kapli, Antti Tiihonen and Joona Poikonen. Pogo Sticker also won the MindTrek 2005 casual game competition.

Use mouse to navigate menus and play the game. You can press pause button or ESC to pause the game. If you press ESC while game is paused, it will return to main menu.

Take the challenge and try to gain green, yellow and finally red lollipop in each level! And if you can do even better, youll find a super one for each level, knowing you have beaten the score of game developers themselves.