這是linux下的進化計算的源代碼。
=== === === === === === === === === === === =====
check latest news at http://eodev.sourceforge.net/
=======================================================================
Welcome to EO, the Evolving Objects library.
The latest news about EO can be found on the sourceforge repository at
http://eodev.sourceforge.net/
In case of any problem, please e-mail us at
eodev-help@lists.sourceforge.net, eodev@egroups.com
To get started, take a look at the tutorial, starting with
./tutorial/html/eoTutorial.html
The easiest way to start programming a new genome with all EO
evolution engines handy is to create a new standalone EO project from
the tutorial/Templates/ directory. Read Lesson 5 of the tutorial for
an introduction )
How the K-mean Cluster work
Step 1. Begin with a decision the value of k = number of clusters
Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following:
Take the first k training sample as single-element clusters
Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster.
Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample.
Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.
Session 1: common and useful built-in Mathematica functions variable assignment and function definition
the Front End and the Kernel Notebooks.
Session 2: organisation of data in Mathematica lists and expressions simple programming functions
nesting.
Session 3: the opportunity to develop your proficiency as a Mathematica user through work on an extended
problem Case Studies Mathematica resources on the Internet.
The line echo canceller (LEC) is designed to provide the maximum attainable transparent voice quality for
de-echoing of a PSTN or POTS connection in voice-over-LAN systems with internal delays, or on a codec end of a telecom switch,基于TI 54X/55X平臺
Parking Lot Simulation：
Parking lot attendants often park cars bumper-to-bumper, several cars deep. This maximizes the number of cars they can fit into a parking lot at the expense of complicating the process of retrieving someone s car when they want to leave. Consider the case of a person wanting to leave the parking lot but their car is parked in the back of a row of cars. In this case, all the cars parked in front of this person s car must be temporarily moved to allow this person to leave.
The preferred technique places the new YAMON in the opposite Flash
bank (the Db1200 boards have two Flash banks), and then changes switch
S11 to swap the Flash banks in the memory map to allow the other Flash
bank to become the boot bank. This technique is the safest and
preferred method since it preserves the existing YAMON
The market for miniature computer programming is exploding. C++ Footprint and Performance Optimization supplies programmers the knowledge they need to write code for the increasing number of hand-held devices, wearable computers, and intelligent appliances.
This book gives readers valuable knowledge and programming techniques that are not currently part of traditional programming training.
In the world of C++ programming, all other things being equal, programs that are smaller and faster are better.
C++ Footprint and Performance Optimization contains case studies and sample code to give readers concrete examples and proven solutions to problems that don t have cut and paste solutions.
