Free octopus tddft 2.1.0 software for linux

octopus project is a program aimed at the ab initio virtual experimentation on a hopefully ever increasing range of systems types.
Electrons are describe quantum-mechanically within the Density-Functional Theory (DFT), in its time-dependent form (TDDFT) when doing simulations in time. Nuclei are described classically as point particles.
Electron-nucleus interaction is described within the Pseudopotential approximation.
Enhancements:
- The complex executable is gone, and all the work is done by the normal (a.k.a. real) executable.
- The type of the wavefunctions is selected automatically according to the input file.
- Dynamical polarizabities are calculated using linear response theory.
- Basic support for full potential all electron species.
- The texinfo documentation has been obsoleted and replaced by an online wiki based documentation.

CPAINT short from Cross-Platform Asynchronous INterface Toolkit is a true AJAX (Asynchronous JavaScript+XML) and JSRS (JavaScript Remote Scripting) implementation.
CPAINT provides you the code required to implement AJAX and JSRS on the back-end, while the returned data is manipulated, formatted, and displayed on the front-end in JavaScript.
This allows you to build web applications that can provide nearly real-time feedback to the user, including nearly real-time data updates.
Main features:
- Supports multiple scripting languages
- Unified JavaScript file for all functions
- Supports both Remote Scripting and XML
- Supports both local & remote functions
- Single or multiple XMLHTTP objects
- Returns backend data as text or as a JavaScript XML/DOM document object
- Can support both POST & GET requests
- Backend proxy functions for accessing remote functions and data
- Tested with all major browsers
- Distributed under the GNU GPL & LGPL

socklog cooperates with the runit package to create a small and secure replacement for syslogd. socklog supports system logging through Unix domain sockets (/dev/log) and UDP sockets (0.0.0.0:514) with the help of runits runsvdir, runsv, and svlogd.
socklog provides a different network logging concept, and also does log event notification. svlogd has built in log file rotation based on file size, so there is no need for any cron jobs to rotate the logs. socklog is secure, small and reliable.
Enhancements:
- With this version, the socklog-conf program creates the socklog service directories in /etc/sv/ instead of /etc/socklog/, and names them socklog-unix, socklog-klog, etc.
- Additionally, it creates a ./check script in the socklog-unix service directory, which is utilized by runits sv program when starting or checking the service.

Music Applet is a small, simple GNOME panel applet that lets you control Rhythmboxs playback from a panel.
Advantages that this applet has over using the icon Rhythmbox puts in the notification area include:
- One-click access to the main operations needed during playback, without needing to use a context menu.
- Display of the current playing time without requiring a mouse-over.
- Display of the current songs album in the song information.
Music Applet currently supports the following music players:
- Banshee
- Rhythmbox
Music Applet is the successor to Rhythmbox Applet.

Pidgin, previously known as Gaim, is a multi-protocol instant messaging client for Linux, BSD, MacOS X, and Windows. Pidgin messenger is compatible with AIM and ICQ (Oscar protocol), MSN Messenger, Yahoo!, IRC, Jabber, SILC, Gadu-Gadu, GroupWise Messenger, and Zephyr networks.
Pidgin users can log in to multiple accounts on multiple IM networks simultaneously. This means that you can be chatting with friends on AOL Instant Messenger, talking to a friend on Yahoo Messenger, and sitting in an IRC channel all at the same time.
Pidgin supports many features of the various networks, such as file transfer, away messages, typing notification, and MSN window closing notification. It also goes beyond that and provides many unique features.
A few popular features are Buddy Pounces, which give the ability to notify you, send a message, play a sound, or run a program when a specific buddy goes away, signs online, or returns from idle; and plugins, consisting of text replacement, a buddy ticker, extended message notification, iconify on away, spell checking, tabbed conversations, and more.
Pidgin runs on a number of platforms, including Windows, Linux, and Qtopia (Sharp Zaurus and iPaq).
Pidgin integrates well with GNOME 2 and KDE 3.1s system tray, as well as Windowss own system tray. This allows you to work with Pidgin without requiring the buddy list window to be up at all times.
Pidgin is under constant development, and releases are usually frequent. The latest news regarding Pidgin can be found on the news page.
Enhancements:
- libpurple:
- Core changes to allow UIs to use second-granularity for scheduling. Pidgin and Finch, which use the glib event loop, were changed to use g_timeout_add_seconds() on glib >= 2.14 when possible. This allows glib to better group our longer timers to increase power efficiency. (Arjan van de Ven with Intel Corporation)
- No longer linkifies screennames containing @ signs in join/part notifications in chats
- With the HTML logger, images in conversations are now saved. NOTE: Saved images are not yet displayed when loading logs.
- Added support for QIP logs to the Log Reader plugin (Michael Shkutkov)
Pidgin:
- Ensure only one copy of Pidgin is running with a given configuration directory. The net effect of this is that trying to start Pidgin a second time will raise the buddy list. (Gabriel Schulhof)
- Undo capability in the conversation window
- The formatting toolbar has been reorganized to be more concise.
- A new status area has been added to the top of conversations to provide additional detail about the buddy, including buddy icon, protocol and status message.
- Show idle times in the buddy list as days, hours, seconds
Finch:
- Theres support for workspaces now (details in the manpage)
- Theres a new custom window manager, Irssi
- Some improvements for tab-completion, tooltip and the password entries
- Some bugs regarding search results fixed
- A new DBus-script to create a docklet for finch
- Support for showing empty groups in the buddy list (Eric Polino)

FOX Calculator is a desktop calculator written in FOX.
The FOX Calculator is a simple desktop calculator geared toward the programmer.
It supports not only a full complement scientific functions, but also common operations that programmers need, such as bitwise operations, bitwise shifting, and base-2 logarithm and exponents, and numeric conversion between hexadecimal, octal, binary, and decimal.
It implements correct operator precedences, and features a constant memory which permanently stores its value even if you exit the calculator and restart it later.
Main features:
- + Addition
- - Substraction
- * Multiplication
- / Floating point division
- AND Bit-wise logical and
- OR Bit-wise logical or
- XOR Bit-wise logical exclusive or
- NOT Bit-wise logical not
- SHL Bit-wise shift left
- SHR Bit-wise shift right
- SAR Bit-wise signed shift right (hit the "inv" button first)
- mod Integer modulo
- div Integer division (hit the "inv" button first
- sin Sine
- cos Cosine
- tan Tangent
- asin Inverse sine or arc sine (hit the "inv" button first)
- acos Inverse cosine
- atan Inverse tangent
- sinh Hyperbolic sine (hit the "hyp" button first)
- cosh Hyperbolic cosine
- tanh Hyperbolic tangent
- asinh Inverse hyperbolic sine (hit the "hyp" and "inv"buttons first)
- acosh Inverse hyperbolic cosine
- atanh Inverse hyperbolic tangent
- log Base 10 logarithm
- ln Natural logarithm
- 2log Base 2 logarithm
- x! Factorial
- nPr Permutations
- nCr Combinations
- sqrt Square root
- x^y X raised to the power y
- 1/x Reciprocal
- 10^x Base 10 exponentiation (hit the "inv" button first)
- e^x Exponentiation
- 2^x Base 2 exponentiation
- x^1/y X raised to the power 1/y
- x^2 X squared

Evocosm is a C++ Framework for Evolutionary Computing library.
Evocosm is a set of classes that abstract the fundamental components of an evolutionary algorithm. Ill list the components here with a bit of introduction; you can review the details of the classes by downloading the code archives or by reviewing the online documentation (see the menu at the articles beginning for code and documentation links.)
All class documentation was generated from source code comments using doxygen. These docs have not been thoroughly proofread, so they may contain a few typos and minor errors. Self-publishing has taught me the value of a good proofreader.
Evolutionary algorithms come in a variety of shapes and flavors, but at their core, they all share certain characteristics: populations that reproduce and mutate through a series of generations, producing future generations based on some measure of fitness. An amazing variety of algorithms can be built on that general framework, which leads me to construct a set of core classes as the basis for future applications.
The classes include:
Random Numbers
Evocosm relies on the code in The Twisted Road to to Randomness for random number generation. The Mersenne Twister algorithm is particularly well-suited to evolutionary algorithms, based on its long period, granularity, "randomness", and speed. As of the 2.1.0 release of libevocosm, the mtprng class resides in libcoyote, and not libevocosm as it did earlier. This means that any program using libevocosm must also link against libcoyote.
Validation
To validate function arguments, Evocosm uses the code I describe in Beyond Assert; this code is part of libcoyote. Any program using libevocosm must also link against libcoyote.
Floating- Point Chromosomes
Evcosom supports the crossover and mutation of IEEE-754 floating-point numbers, using an algorithm I invented in the mid-1990s. This topic is covered in detail here.
Roulette Wheels
The roulette_wheel class implements the concept of a "software roulette wheel" for Evocosm. This is a tool for natural selection, wherein the fitness of an organism determines the width of its "slot" on an imaginary roulette wheel.
Organisms
Think of an "organism" as an answer to a problem posed by a fitness landscape; "genes" define its behavior and an associated fitness value is assigned by an evocosm during testing. Evocosm provides the freedom to define organisms as almost anything: bit strings, floating-point numbers, finite state machines, LISP programs, or external robots controlled via radio waves. In A Complexity of Options, I used an Evocosm-derived GA to determine the gcc options that produce the faster code.
Fitness Landscapes
A "fitness landscape" defines the environment where organisms "live" or a problem that they are tested against. The landscape is intimately tied to the nature of the organism; think of an organism as a potential solution to a problem implemented by the landscape. A floating-point organism, for example, could be tested by a fitness landscape that represents a function to be maximized. Or, an organism describing the shape of wing could be tested by a landscape that simulates a wind tunnel.
Evocosms
The evocosm class binds a population of organisms to a set of objects that define the rules of survival and reproduction. An evocosm will have one or more populations, which will evolve against population-unique and shared (common) fitness landscapes; breeding is controlled by a set of class objects from the following classes.
Fitness Scaling
As a population converges on an "answer", the difference between fitness values often becomes very small; this prevents the best solutions from having a significant advantage in reproduction. Fitness scaling solves this problem by adjusting the fitness values to the advantage of the most-fit chromosomes. Evocosm includes a variety of fitness scaling algorithms.
Migration
A migrator removes individuals (via "emigration") from a population of organisms, transferring them to another population (via "immigration"). The only concrete implementation of this interface is random_pool_migrator, which defines a specific number of organisms that may migrate from each population to another. When creating a random_pool_migrator, specify the number of organisms that can migrate from each population. Migration is, of course, meaningless in any application that has only one population.
Selecting Survivors
A selector decides which organisms survive from one generation to the next. Some evolutionary algorithms will not use a selector; other will. In general, it is effective to keep the "best" organisms from one generation to the next, so that good genes do not become lost at random. This is, of course, an improvement on nature, where being "the best" doesnt guarantee survival.
Reproduction
In most cases, a reproducer generates new organisms using parents selected (by fitness) from an existing population. In some singular (and probably rare) cases, a reproducer might generate new, random organisms in order to keep diversity high. Reproduction techniques can include crossover and asexual, sexual and (my favorite) try-sexual models.
Mutation Operators
A mutator applies mutations (random, usually small changes) to a set of organisms. Mutation is highly dependent on the type of organism. In traditional genetic algorithms, a mutation flips one or more bits in an integer (i.e., chromosome). Evolving a path for the Traveling Salesman Problem involves complex mutations that maintain valid permutations of destination points; in the case of floating-point numbers, Ive provided utilities for mutating and crossing IEC-60559 (IEEE- 754) float and double types.
Enhancements:
- Minor bugfixes, code cleanups, and changes to pseudo-random number generators.
- Now includes Visual Studio 2005 projects along with GNU build files.

Vultures is an isometric graphics interface to NetHack and SlashEM.

Vultures is a fork of the now dead "Falcons Eye" project.

An isometric graphics interface to NetHack. The interface was called "Falcons Eye", because the viewpoint resembles a "birds eye view".

This fork of the original "Falcons Eye" is called "Vultures Eye". "Vultures Claw" is the same interface, but for SlashEM