LSVMK Langrangian Support Vector Machine algorithm LSVMK solves a support vector machine problem using an iterative algorithm inspired by an augmented Lagrangian formulation.
標簽： LSVMK Langrangian algorithm Support
上傳時間： 2016-04-28
上傳用戶：tfyt
This standard describes a keyed-hash message authentication code (HMAC), a mechanism for message authentication using cryptographic hash functions. HMAC can be used with any iterative Approved cryptographic hash function, in combination with a shared secret key. The cryptographic strength of HMAC depends on the properties of the underlying hash function. The HMAC specification in this standard is a generalization of Internet RFC 2104, HMAC, Keyed-Hashing for Message Authentication, and ANSI X9.71, Keyed Hash Message Authentication Code.
標簽： message authentication keyed-hash describes
上傳時間： 2014-01-07
上傳用戶：鳳臨西北
迭代自適應Simpson，Lobatto積分 In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm. We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (e.g. quad, quadv, and quadl). Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf.
上傳時間： 2014-10-25
上傳用戶：xc216
Generating Fractals with SSE/SSE2 You probably have heard about fractals before. They are beautiful pictures such as the one shown above. Any fractal can be described using iterative formulas. So you can generate a fractal by evaluating these formulas and finding the color of each pixel. That is a large computational task, and drawing a fractal needs a fast CPU and a carefully optimized program.
標簽： Generating SSE beautiful Fractals
上傳時間： 2016-11-03
上傳用戶：小鵬
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.
標簽： nonsymmetric solution SuperLU general
上傳時間： 2017-02-20
上傳用戶：lepoke
observable distribution grid are investigated. A distribution grid is observable if the state of the grid can be fully determined. For the simulations, the modified 34-bus IEEE test feeder is used. The measurements needed for the state estimation are generated by the ladder iterative technique. Two methods for the state estimation are analyzed: Weighted Least Squares and Extended Kalman Filter. Both estimators try to find the most probable state based on the available measurements. The result is that the Kalman filter mostly needs less iterations and calculation time. The disadvantage of the Kalman filter is that it needs some foreknowlegde about the state.
標簽： distribution observable grid investigated
上傳時間： 2014-12-08
上傳用戶：ls530720646
本人根據opencores.org上的cordic算法改寫的可配置位寬的cordic算法，并且在原始的級聯型的基礎上編寫的循環(iterative)型的cordic,可通過generic配置。帶一個不可綜合和可綜合的testbench(for altera)。稍微改動可應用于xilinx fpga
上傳時間： 2017-04-10
上傳用戶：ljt101007
This is a Switch simulation... with 4 types of switches... and also we have average simulation time over these 4 switches 1. No Queue 2. Input Queue 3. Input Queue with iterative 4. Output QUeue
標簽： simulation switches average Switch
上傳時間： 2017-05-20
上傳用戶：徐孺
program to solve a finite difference discretization of Helmholtz equation : (d2/dx2)u + (d2/dy2)u - alpha u = f using Jacobi iterative method. COMMENTS: OpenMP version 3: 1 PR outside the iteration loop, 4 Barriers Directives are used in this code to achieve paralleism. All do loops are parallized with default static scheduling.
標簽： discretization difference Helmholtz equation
上傳時間： 2014-01-11
上傳用戶：bruce5996
VHDL implementation of the twofish cipher for 128,192 and 256 bit keys. The implementation is in library-like form All needed components up to, including the round/key schedule circuits are implemented, giving the flexibility to be combined in different architectures (iterative, rolled out/pipelined etc). Manual in English is included with more details about how to use the components and/or how to optimize some of them. All testbenches are provided (tables, variable key/text, ECB/CBC monte carlo) for 128, 192 and 256 bit key sizes, along with their respective vector files.
標簽： implementation twofish cipher VHDL
上傳時間： 2017-06-25
上傳用戶：王小奇
