Program helping you to remember the ROUTE.
It cab be ROUTE from conference room to coffee-room, it can be tourist trip, it can be pathway in labyrinth. during first traversal you make notes in you phone, specifying direction of movement and target of each step. Phone remembers how much time each steps takes. Then you can just inspect information about this trip and check duration of each stage and the whole trip. You can also replay it in forward and backward direction. So if somebody show you the shortest way to coffee machine, you can easily find the way back and can repeat this trip in future.
Abstract: This tutorial discusses proper printed-circuit board (PCB) grounding for mixed-signal designs. Formost applications a simple method without cuts in the ground plane allows for successful PCB layouts withthis kind of IC. We begin this document with the basics: where the current flows. Later, we describe how toplace components and ROUTE signal traces to minimize problems with crosstalk. Finally, we move on toconsider power supply-currents and end by discussing how to extend what we have learned to circuits withmultiple mixed-signal ICs.
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
EFI（Extensible Firmware Interface)是下一代BIOS，正逐步取代BIOS成為計算機的FIRMWARE標準。它是 Intel 為全新類型的 PC 固件的體系結構、接口和服務提出的建議標準。其主要目的是為了提供一組在 OS 加載之前（啟動前）在所有平臺上一致的、正確指定的啟動環境.EFI的國際標準組織是UEFI。
efinetworktools.zip:是EFI平臺下的網絡工具套件，包含了dhcpclient、ping、which、ifconfig、ROUTE等一系列網絡命令的源碼
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel ROUTE has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases.
