虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

state-of-the-art

  • IEEE Std 1180-1990. IEEE Standard Specifications for the Implementations of 8x8 Inverse Discrete Cos

    IEEE Std 1180-1990. IEEE Standard Specifications for the Implementations of 8x8 Inverse Discrete Cosine Transform, specifies the numerical characteristics of the 8x8 inverse discrete cosine transform (IDCT) for use in visual telephony and similar applications where the 8x8 IDCT results are used in a reconstruction loop. The specifications ensure the compatibility between different implementations of the IDCT.

    标签: IEEE Implementations Specifications Discrete

    上传时间: 2016-01-31

    上传用户:guanliya

  • This ECMA Standard specifies the form and establishes the interpretation of programs written in the

    This ECMA Standard specifies the form and establishes the interpretation of programs written in the C# programming language. It specifies The representation of C# programs The syntax and constraints of the C# language The semantic rules for interpreting C# programs The restrictions and limits imposed by a conforming implementation of C#.

    标签: the interpretation establishes specifies

    上传时间: 2013-12-18

    上传用户:chenjjer

  • CHAPT07CHAPT07.CPP 16-Bit test program for the Fossil class CHAPT07CHAPT07.EXE 16-Bit executable of

    CHAPT07\CHAPT07.CPP 16-Bit test program for the Fossil class CHAPT07\CHAPT07.EXE 16-Bit executable of the test program. CHAPT07\CHAPT07.MAK A makefile for Borland or Microsoft C++ CHAPT07\BIOSPORT.CPP A copy of the file from Chapter 6 CHAPT07\BIOSPORT.H A copy of the file from Chapter 6

    标签: CHAPT 07 executable Bit

    上传时间: 2013-12-09

    上传用户:ruixue198909

  • FSK信号鉴频的程序.This program implements the function of finding out the largest and the second largest va

    FSK信号鉴频的程序.This program implements the function of finding out the largest and the second largest values of the sequence of "in_buffer[10]"

    标签: largest the implements function

    上传时间: 2016-02-05

    上传用户:youth25

  • How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters S

    How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.

    标签: the decision clusters Cluster

    上传时间: 2013-12-21

    上传用户:gxmm

  • this procedure is a game of basketball or subsystems time, the competition will record the entire ti

    this procedure is a game of basketball or subsystems time, the competition will record the entire time, and can amend the Competition time suspended contest time, the two can be set at any time during the competition process of the match, the two teams exchanged scores midfielder position, Competition can end report issued directives

    标签: competition basketball subsystems procedure

    上传时间: 2016-02-14

    上传用户:cuibaigao

  • The algorm of viterbi. You talk to your friend three days in a row and discover that on the first da

    The algorm of viterbi. You talk to your friend three days in a row and discover that on the first day he went for a walk, on the second day he went shopping, and on the third day he cleaned his apartment. You have two questions: What is the overall probability of this sequence of observations? And what is the most likely sequence of rainy/sunny days that would explain these observations? The first question is answered by the forward algorithm the second question is answered by the Viterbi algorithm. These two algorithms are structurally so similar (in fact, they are both instances of the same abstract algorithm) that they can be implemented in a single function:

    标签: discover viterbi algorm friend

    上传时间: 2016-02-16

    上传用户:xc216

  • μC/OS-II Goals Probably the most important goal of μC/OS-II was to make it backward compatible with

    μC/OS-II Goals Probably the most important goal of μC/OS-II was to make it backward compatible with μC/OS (at least from an application’s standpoint). A μC/OS port might need to be modified to work with μC/OS-II but at least, the application code should require only minor changes (if any). Also, because μC/OS-II is based on the same core as μC/OS, it is just as reliable. I added conditional compilation to allow you to further reduce the amount of RAM (i.e. data space) needed by μC/OS-II. This is especially useful when you have resource limited products. I also added the feature described in the previous section and cleaned up the code. Where the book is concerned, I wanted to clarify some of the concepts described in the first edition and provide additional explanations about how μC/OS-II works. I had numerous requests about doing a chapter on how to port μC/OS and thus, such a chapter has been included in this book for μC/OS-II.

    标签: OS-II compatible important Probably

    上传时间: 2013-12-02

    上传用户:jkhjkh1982

  • OFDM Signal generation and decoding using 16-QAM .64QAM as the modulation technique. This type of OF

    OFDM Signal generation and decoding using 16-QAM .64QAM as the modulation technique. This type of OFDM is particularly useful for WiMAX and other Wireless and Multimedia Standards. Just run the Model and with different SNRs in the AWGN Channel Block observe the performance of the OFDM.

    标签: generation modulation QAM technique

    上传时间: 2014-01-10

    上传用户:lps11188

  • /*SPI规范:Data is always clocked into the device on the rising edge of SCK a-*/ /* nd clocked out of

    /*SPI规范:Data is always clocked into the device on the rising edge of SCK a-*/ /* nd clocked out of the device on the falling edge of SCK.All instruction-*/ /* s,addresses and data are transferred with the most significant bit(MSB) */ /* first.

    标签: clocked the always device

    上传时间: 2016-02-19

    上传用户:远远ssad