This text surrounds the development of the electric power SCADA system exactly, aiming at the present condition of the our country electric power charged barbed wire net currently, according to the oneself at the e- lectric power protect the profession after the electricity in seven years of development, design and adjust to try the experience on the scene from following severals carry on the treatise:Is the emergence to the system of SC- ADA and developments to introduce first Carry on the introduction elucidation to applied present condition and the development foregrounds of various terminal equipments communication agreement(rules invite) the next in order Then is the elucidation to the windows the bottom according to the mfc the plait distance environment an- d VC++6.0 plait distance softwares Carry on the more detailed treatise to the realization of the procedure struct- ure frame and the source code again End is the applied case example give examples.
encode.v The encoder
syndrome.v Syndrome generator in decoder
berlekamp.v Berlekamp algorithm in decoder
chien-search.v Chien search and Forney algorithm in decoder
decode.v The top module of the decoder
inverse.v Computes multiplication inverse of an Galois field element
test-bench.v The test fixture, and some brief notes on using the modules.
data-rom.v A simple data source for testing
run For those intelligence-challenged who can t run verilog
LGPL The license
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.
This paper addresses the issues relating to the
enforcement of robust stability when implementing the Adaptive
Inverse Control (AIC) scheme. In this scheme, an adaptive
FIR filter is added to a closed-loop system in order to
reduce the output error caused by external disturbances,
enhancing the performance achieved by linear time-invariant
controllers alone.
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
Two functions, num2bin and bin2num are provided. num2bin takes a double and converts it to a binary string representation. bin2num is its inverse operation. It can be used in a numerical analysis course when floating point arithmetic is discussed.
A system simulation environment in Matlab/Simulink of RFID is constructed in this paper.
Special attention is emphasized on the analog/RF circuit.Negative effects are concerned in the system
model,such as phase noise of the local oscillator,TX-RX coupling,reflection of the environment,
AWGN noise,DC offset,I/Q mismatch,etc.Performance of the whole system can be evaluated by
changing the coding method,parameters of building blocks,and operation distance.Finally,some
simulation results are presented in this paper.
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Dijkstra算法求最短路徑(C#版) using System
using System.Collections
using System.Text
namespace Greedy
{
class Marx
{
private int[] distance
private int row
private ArrayList ways = new ArrayList()
public Marx(int n,params int[] d)
{
this.row = n
distance = new int[row * row]
for (int i = 0 i < row * row i++)
{
this.distance[i] = d[i]
