This prj demonstrates how to use the SROM memory classes for the Dallas DS80C400. This example uses the memcpy function to copy a function in the SROM memory class (which is located in CODE memory) to von Neumann mapped XDATA (starting at 0x110000) for execution.
AppWizard has created this SEEDDEC2XXX application for you. This application
not only demonstrates the basics of using the Microsoft Foundation classes
but is also a starting point for writing your application.
This paper studies the problem of categorical data clustering,
especially for transactional data characterized by high
dimensionality and large volume. starting from a heuristic method
of increasing the height-to-width ratio of the cluster histogram, we
develop a novel algorithm – CLOPE, which is very fast and
scalable, while being quite effective. We demonstrate the
performance of our algorithm on two real world
The application wizard has created this UCMSGIP application for
you. This application not only demonstrates the basics of using the Microsoft
Foundation Classes but is also a starting point for writing your application.
Base64算法，This application
not only demonstrates the basics of using the Microsoft Foundation classes
but is also a starting point for writing your application
股票源碼The application wizard has created this SCDemo application for
you. This application not only demonstrates the basics of using the Microsoft
Foundation Classes but is also a starting point for writing your application.
bulk endpoint endless source/sink firmware.
EP2OUT will always accept a bulk OUT
EP4OUT will always accept a bulk OUT
EP6IN will always return a 512 byte packet. The packet contains an
incrementing byte starting at 0x02. Since EP6 always returns a 512
byte packet, this endpoint should never be accessed except with a
high-speed host controller.
EP8IN will continuously return the packet most recently written to
EP4OUT
This a naive implementation of BOOTP/TFTPBOOT, the protocols
to use to bootstrap a computer through a TCP/IP network.
The goal was to design a small footprint implementation
to allow the code to be integrated into a monitor program
stored in a ROM/FLASH, the footprint is about 7 KBytes
for the test program.
This code has not been yet tested in many environment.
It should be seen at your starting point to integrate
the network boot function to your board.
Ink Blotting
One method for escaping from a maze is via ‘ink-blotting’. In this method your starting square
is marked with the number ‘1’. All free, valid squares north, south, east and west around the
number ‘1‘ are marked with a number ‘2’. In the next step, all free, valid squares around the two
are marked with a ‘3’ and the process is repeated iteratively until :
The exit is found (a free square other than the starting position is reached on the very edge
of the maze), or,
No more free squares are available, and hence no exit is possible.
這是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 )
