AHP toolbox
AHPCALC Perform a complete AHP calculation.
AHPHIER One-step hierarchical assembly of AHP weighting vector.
AHPREORDER Internal reordering function called by AHPCALC.
AHPVECTOR Calculate the AHP ranking or weighting vector from an
AHP reciproal matrix.
AHPMAKEMAT Turn a vector of comparisons into an AHP reciprocal matrix.
Copyright (C) 2001 Michael J. Scott
this manual for pc3000 mrtool! special repair harddisk for maxtor!but i need software pc3000 mrtool!you won look site : http://space.doit.com.cn/viewthread-45664.html
base implementaion of the protein (starting from the amino acid sequence) feature extractor used in "L. Nanni and A. Lumini, An ensemble of Support Vector Machines for predicting virulent proteins, Expert Systems With Applications, vol.36, no.4, pp.7458-7462, May 2009. "
Abstract—We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space.
ESRIMapObjectsLT 2 and MicrosoftVisual Basic6 to build an application that uses maps.
Display a map with multiple layers.
Control panning and zooming.
Create a toolbar control.
Base the display of map layers on scale.
Perform spatial and logical queries.
Display features with thematic renderers.
Add vector data and images to a map programmatically.
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000.
Output:
The output is a single line for each case, with the corresponding minimum size cut.
Example:
Input:
7 11
1 2 3
1 4 3
2 3 4
3 1 3
3 4 1
3 5 2
4 6 6
4 5 2
5 2 1
5 7 1
6 7 9
Output:
5
Aodv for NS-2. A mobile ad-hoc network (MANET) is a kind of wireless ad-hoc network, and is a self-configuring
network of mobile routers connected wirelessly. MANET may operate in a standalone fashion, or may
be connected to the larger Internet. Many routing protocols have been developed for MANETs over
the past few years. This project evaluated three specific MANET routing protocols which are Ad-hoc
On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET Ondemand
routing protocol (DYMO) to better understand the major characteristics of these routing
protocols. Different performance aspects were investigated in this project including packet delivery
ratio, routing overhead, throughput and average end-to-end delay.
