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.
/*
* EULER S ALGORITHM 5.1
*
* TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM:
* Y = F(T,Y), A<=T<=B, Y(A) = ALPHA,
* AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B].
*
* INPUT: ENDPOINTS A,B INITIAL condition ALPHA INTEGER N.
*
* OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T.
*/
Procedure TSPSA:
begin
init-of-T { T為初始溫度}
S={1，……，n} {S為初始值}
termination=false
while termination=false
begin
for i=1 to L do
begin
generate(S′form S) { 從當前回路S產生新回路S′}
Δt:=f(S′))-f(S) {f(S)為路徑總長}
IF(Δt<0) OR (EXP(-Δt/T)>Random-of-[0,1])
S=S′
IF the-halt-condition-is-TRUE THEN
termination=true
End
T_lower
End
End
* CONSTRAINTS
* This module does not handle data which is considered out of range by the
* application(i.e. fixed constants which represent error condition)
*
* Maximum weight value must be limited to 128 to prevent an overflow
* condition during the calculation.
*
* The internal data type must be large enough to handle the calculations.
* The maximum possible internal value
* = Max Input Value * (weight - 1) + Max Input Value
* If a maximum weight of 128 is used, the internal data type should be 2
* times the size of the input data type.
- Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the disclaimer below in the documentation and/or
other materials provided with the distribution.
A huge program that consist of polling mechanism of a main controller to 32 slave in a fireman intercom environment. Including the handset condition detection, LCD controller, keypad controller, interrupt handling and ADC.
Mapack可用來做矩陣運算
Mapack is a .NET class library for basic linear algebra computations. It supports the following matrix operations and properties: Multiplication, Addition, Subtraction, Determinant, Norm1, Norm2, Frobenius Norm, Infinity Norm, Rank, condition, Trace, Cholesky, LU, QR, Single Value decomposition, Least Squares solver, Eigenproblem solver, Equation System solver. The algorithms were adapted from Mapack for COM, Lapack and the Java Matrix Package.
SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The LU factorization routines can handle non-square matrices but the triangular solves are performed only for square matrices. The matrix columns may be preordered (before factorization) either through library or user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided for improved backward stability. Routines are also provided to equilibrate the system, estimate the condition number, calculate the relative backward error, and estimate error bounds for the refined solutions.
The most straightforward approximation is the standard Gaussian approximation, where the MAI is approximated by a Gaussian random variable. This approximation is simple, however it is not accurate in general. In situations where the number of users is not large, the Gaussian approximation is not appropriate. In-depth analysis of must be applied. The Holtzman?s improved Gaussian approximation provides a better approximation to the MAI term. The approximation conditions the interference term on the operation condition of each user.
