The paper confirms testcases of USB Host Controller based on OHCI 1.0. Then we constitute the verification strategy and finish the verification by use of PCI BFM and SoC verification platform.

An SOC/ASIC solution is presented for H.264/AVC decoder. Based on the implemented circuit,the verification strategy for this design scheme is analyzed in particular.

Since the process of calculating the fixedpoint of the logic program does not always terminate, we propose an effective verification strategy: verifying the security property every k1 iterative steps of calculating the fixedpoint .

GA-SVM was tested on two far different datasets from machine learning repository. Compared with the standard SVM with cross validation strategy, the simulation results indicate the superiority of GA-SVM on the dataset with unbalanced classes. GA-SVM can gain higher classification accurate and faster learning speed, and work well with faster learning speed on the perfectly constructed dataset.

To check the effectiveness of the system detection logic, model checking strategy enables us to build dynamic spaces tree from initial configuration to terminative configuration which is used to analyze packets of ARP attack.

This paper designs a new protocol. The current used "after validation policy" is replaced by a new policy named "before validation policy" in this new design based on PMI platform, which stressed that "before validation policy" gives PMI platform the advantage in terms of function and efficiency.

We were able to formulate a general verification strategy prior to clone sequencing.

We present an assume-guarantee style modular verification strategy which separates the verification of the controller behavior from the verification of the conformance to its interface.

The concurrency controller design pattern enables a modular verification strategy by decoupling the behaviors of the concurrency controllers from the behaviors of the threads that use them using interfaces specified as finite state machines.

Progress in boundary condition development is presented, and a benchmarking and verification strategy is described.

Finally, a template curve-based face verification strategy is utilized to verify whether a face is in the candidate skin region.

The second part uses a cross-validation strategy to identify the best neural network model.

A broad initial validation strategy including known groups and convergent validity assessments produced results that will inform and focus future efforts.

An initial validation strategy using both known-groups and concurrent validity produced promising evidence of the construct validity of both measures.

Results indicate that this validation strategy can discriminate between valid and invalid vectors remarkably well over a range of parameter settings.

It allows a traceable validation strategy using modular objects which encapsulate documentation, analytical data and processing logic.

As members of this group, we have implemented an OCSP validation infrastructure for the Globus Toolkit 4, composed of the CertiVeR Validation Service and our Open GRid Ocsp (OGRO) client library, which introduced the Grid Validation Policy.

The acceptable TSAs are specified in the Signature Validation Policy.

The concept of output coordination about period-stationary Markov policies and their measurement method were provided in this paper and it was described that the use of the unlinear return-function will improve the output coordination of policies. There are a lot of examples, tables and figures as evidence and some suggestions for use in practice.

To verify the correctness of the RTL(register transfer level) result got from the high level synthesis, an algorithm of DFG(data flow graph) invert extracting is designed and realized in this paper. Four sections are included in this algorithm: analyze FSM(finite state machine) dynamically and obtain control signal; search the active component for current states of FSM and convert the operate note of DFG from the structure of data path; analyze the relationship between the notes of DFG, separate the variables...

To verify the correctness of the RTL(register transfer level) result got from the high level synthesis, an algorithm of DFG(data flow graph) invert extracting is designed and realized in this paper. Four sections are included in this algorithm: analyze FSM(finite state machine) dynamically and obtain control signal; search the active component for current states of FSM and convert the operate note of DFG from the structure of data path; analyze the relationship between the notes of DFG, separate the variables sharing the same register.

Fig.1 summarizes state of art of model precision of simulation system. Fig.2 outlines all foreseen errors influencing model precision. We use eq.(4), which is well known, in conjunction with Fig.3, which is proposed by us, to achieve what we deem to be a satisfactory separation of errors. This separation function is that part of Fig.4 enclosed within dashed lines. Fig.4 shows the specific optimal time history matching method which is proposed by us. Then in a time sequence comparison with actual system test...

Fig.1 summarizes state of art of model precision of simulation system. Fig.2 outlines all foreseen errors influencing model precision. We use eq.(4), which is well known, in conjunction with Fig.3, which is proposed by us, to achieve what we deem to be a satisfactory separation of errors. This separation function is that part of Fig.4 enclosed within dashed lines. Fig.4 shows the specific optimal time history matching method which is proposed by us. Then in a time sequence comparison with actual system test data, we make successive adjustments to reduce each dominant error at a time until the best possible system precision is achieved. Fig.5 shows big differences between measured velocities and predicted ones when separation technique is not used (Fig.4 without the part enclosed within dashed lines). Fig.6 shows good agreement between measured velocities and predicted ones when our specific optimal time history matching method is used (Fig.4).