SPLASH is a c++ class library that implements many of the Perl constructs and data types, including extensive regex regular expression pattern matching. For those not familiar with Perl, it is an excellent scripting language by Larry Wall and is available for most platforms. This Class library provides List, String, Regular Expression, and text manipulation handling capabilities based on those provided in Perl
The Hopfield model is a distributed model of an associative memory. Neurons are pixels and can take the values of -1 (off) or +1 (on). The network has stored a certain number of pixel patterns. During a retrieval phase, the network is started with some initial configuration and the network dynamics evolves towards the stored pattern which is closest to the initial configuration.
matlab矩陣處理例程。A matrix processor, Matx_Proc() is developed which can be used
to process and edit matrices and state space models, and perform
various kind of matrix analysis in a visible way.
A Java Framework for connecting to and exchanging data from GPS units to J2ME Mobile Devices. Serial and Bluetooth connections to GPS devices. Support for NMEA-0183 GPS Standard. An Observer-Design Pattern makes the library extendable. Based on GPSlib4j.
By Tom Christiansen and Nathan Torkington
ISBN 1-56592-243-3
First Edition, published August 1998.
(See the catalog page for this book.)
Search the text of Perl Cookbook.
Table of Contents
Copyright Page
Foreword
Preface
Chapter 1: Strings
Chapter 2: Numbers
Chapter 3: Dates and Times
Chapter 4: Arrays
Chapter 5: Hashes
Chapter 6: Pattern Matching
Chapter 7: File Access
Chapter 8: File Contents
Chapter 9: Directories
Chapter 10: Subroutines
Chapter 11: References and Records
Chapter 12: Packages, Libraries, and Modules
Chapter 13: Classes, Objects, and Ties
Chapter 14: Database Access
Chapter 15: User Interfaces
Chapter 16: Process Management and Communication
Chapter 17: Sockets
Chapter 18: Internet Services
Chapter 19: CGI Programming
Chapter 20: Web Automation
Index
Colophon
Implemented BFS, DFS and A*
To compile this project, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here is the format of the input file:
The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm.
The second line of input file shoud be an integer m indicate the number of connections for the map.
Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist.
The following input are for A*
The following line contains two chars indicate the source and destination city for A* algorithm.
Then there is an integer h indicate the number of heuristic.
The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
The concept of sustainable development has received growing recognition, but it is a new
idea for many business executives. For most, the concept remains abstract and
theoretical.
Protecting an organization’s capital base is a well-accepted business principle. Yet
organizations do not generally recognize
The concept of sustainable development has received growing recognition, but it is a new
idea for many business executives. For most, the concept remains abstract and
theoretical.
Protecting an organization’s capital base is a well-accepted business principle. Yet
organizations do not generally recognize
