LVQ學(xué)習(xí)矢量化算法源程序
This directory contains code implementing the Learning vector quantization
network. Source code may be found in LVQ.CPP. Sample training data is found
in LVQ1.PAT. Sample test data is found in LVQTEST1.TST and LVQTEST2.TST. The
LVQ program accepts input consisting of vectors and calculates the LVQ
network weights. If a test set is SPECIFIED, the winning neuron (class) for
each neuron is identified and the Euclidean distance between the pattern and
each neuron is reported. Output is directed to the screen.
a3load is 8051 firmware that can be used for uploading or downloading
to EZ-USB RAM (internal or external). It implements the vendor specific
command bRequest = 0xA3. The address to download/upload to/from is
SPECIFIED in the wValue field of the SETUP packet and the length of
the transfer in the wLength field. The actual upload/download data
is transferred during the DATA stage of the SETUP transfer. This firmware
will function on all EZ-USB chips (EZ-USB, EZ-USB FX, FX2, FX2LP, FX1).
This program is using Genetic Algorithm to solve the Travlling
Salesman Problem. It gives the best path route within a SPECIFIED
time.
usage: java Evolver <seconds> <city file> <config file>
Author: Liu Yang
xletview, for UNIX file and directory names are case sensitive. The path to the project CVSROOT must be SPECIFIED using lowercase characters (i.e. /cvsroot/xletview)
PCI-to-PCI Bridge Architecture Specification Revision 1.1
This specification establishes the requirements that a PCI-to-PCI bridge must meet to be compliant to this specification and the PCI Local Bus Specification. In addition, the requirements for optional extensions are SPECIFIED. This specification does not describe the implementation details of any particular requirement or optional feature of a PCI-to-PCI bridge, nor is it a goal of this specification to describe any particular PCI-to-PCI bridge implementation. However, some recommendations are provided for some implementation-specific features that can be provided by a PCI-to-PCI bridge.
The code, images and designs for this book are released under a Creative Commons Attribution-NonCommercial-ShareAlike 2.5 License.
http://creativecommons.org/licenses/by-nc-sa/2.5/
You are free:
* to copy, distribute, display, and perform the work
* to make derivative works
Under the following conditions:
*Attribution. You must attribute the work in the manner SPECIFIED by the author or licensor.
*Noncommercial. You may not use this work for commercial purposes.
*Share Alike. If you alter, transform, or build upon this work, you may distribute the resulting work only under a license identical to this one.
*For any reuse or distribution, you must make clear to others the license terms of this work.
*Any of these conditions can be waived if you get permission from the copyright holder.
CONTACT ME
Please address any questions to info@andybudd.com.
NXP示例編碼集,Software that is described herein is for illustrative purposes only which
provides customers with programming information regarding the products.
This software is supplied "AS IS" without any warranties. NXP Semiconductors
assumes no responsibility or liability for the use of the software, conveys no
license or title under any patent, copyright, or mask work right to the
product. NXP Semiconductors reserves the right to make changes in the
software without notification. NXP Semiconductors also make no representation
or warranty that such application will be suitable for the SPECIFIED use without
further testing or modification.
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be SPECIFIED in any order, so long as the parameter pairs are SPECIFIED as a parameter , value
