Unzip this file into a writeable directory.
You should end up with a "Geocode" project, as well as Bitmaps and TestData directories.
This sample geocodes single-match zip codes, entered by the user, or a batch-match of a table of zips (and other info) against a point shapefile.
The point data shapefile consists of 41859 point features from 1996 GDT data, in decimal degrees. The table of zips that can be used in the batch match consists of 38 records, entitled "few_zips.dbf".
More specifcs are found at the top of each form and are provided throughout the code.
MantisChess -- A Chinese Chess Program
Copyright (C) Chen Chengtao, China
This program is free software you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation either version 2
of the License, or (at your option) any later version.
用win32匯編編寫的類木馬的東西，運行后在機子上打開23端口，用telnet登陸，可以運行下列命令：
open filename - open the file or program
msg message - place message plainly over screen
box message - show within a messagebox
cdopen - to open CDROM drive door
cdclose - to close CDROM drive door
bye - terminate connection, handles one user at a time
kill - terminate sparczerver
Overview
Provides a way to store very large collections of email addresses (100,000+ addresses) and efficiently check whether a specific address is contained in a collection. The collection can be created programmatically, or through a pluggable persistence mechanism.
Functionality
Maintains large collections of email addresses.
Efficiently checks whether an address is in the collection or not.
New users and old of optimization in MATLAB will find useful tips and tricks in this document, as well as examples one can use as templates for their own problems.
Use this tool by editing the file optimtips.m, then execute blocks of code in cell mode from the editor, or best, publish the file to HTML. Copy and paste also works of course.
Some readers may find this tool valuable if only for the function pleas - a partitioned least squares solver based on lsqnonlin.
This is a work in progress, as I fully expect to add new topics as I think of them or as suggestions are made. Suggestions for topics I ve missed are welcome, as are corrections of my probable numerous errors. The topics currently covered are listed below
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.
