نتایج جستجو برای: frobenius series method fsm

تعداد نتایج: 1928370  

1998
Noppanunt Utamaphethai John Paul Shen

We validate speculative and out-of-order execution microarchitecture using an ATPG-like methodology. The validation methodology uses FSM models derived from microarchitecture speciications. Complete transition tours are generated from the FSM models to obtain a high-level test sequence. Small assembly sequences associated with each FSM transition are used to translate FSM testing sequences into...

1999
Chien-Nan Jimmy Liu Jing-Yang Jou

ion Until now, simulation is still the primary approach for the functional verification of RTL circuit descriptions written in HDL. The FSM coverage test can find all bugs in a FSM design. However, it is impractical for large designs because of the state explosion problem. In this paper, we modify the higher level FSM models used in other applications to replace the FSM model in the FSM coverag...

2000
Pengyu Hong Thomas S. Huang Matthew Turk

This paper proposes an approach to 2D gesture recognition that models each gesture as a Finite State Machine (FSM) in spatial-temporal space. The model construction works in a semi-automatic way. The structure of the model is first manually decided based on the observation of the spatial topology of the data. The model is refined iteratively between two stages: data segmentation and model train...

1992
Marek A. Perkowski William Zhao Douglas V. Hall

A generalization of the classical state minimization of a Finite State Machine FSM is described The FSM is minimized here in two dimensions numbers of both input symbols and internal states are mini mized in an iterative sequence of input minimizatio and state minimization procedures For each machine in the sequence of FSMs created by the algorithm an equivalent FSM is found that attempts to mi...

2007
E. Athanasopoulou C. N. Hadjicostis

This paper focuses on testing sequential circuits using a simple form of signature analysis as a compaction technique. More specifically, the paper describes a systematic methodology for calculating the probability of aliasing when a randomly generated test input vector sequence is applied to a given finite state machine (FSM) and the final FSM output is used to verify the functionality of the ...

2006
Rebecca Allen Anna Vignoles

The Centre for the Economics of Education is an independent research centre funded by the Department for Education and Skills. The views expressed in this work are those of the author and do not reflect the views of the DfES. All errors and omissions remain the authors. Executive Summary The paper aims to make a methodological contribution to the education segregation literature, providing a cr...

Journal: :DIAJAR Jurnal Pendidikan dan Pembelajaran 2022

The purpose of this research is to develop a product was called Forecasting System Multi-Model (FSM) determine the best method in forecasting system by constructing several methods form Graphical User Interface (GUI) Matlab. It done all indicator accuration find mathematical model time series data certain period. In simulation phase, used Human Development Index (HDI) Bali Province 2010 - 2017 ...

2000
FERNANDO TORRES F. TORRES

1. Linear series on curves 1.1. Terminology and notation 1.2. Morphisms from linear series; Castelnuovo’s genus bound 1.3. Linear series from morphisms 1.4. Relation between linear series and morphisms 1.5. Hermitian invariants; Weierstrass semigroups I 2. Weierstrass point theory 2.1. Hasse derivatives 2.2. Order sequence; Ramification divisor 2.3. D-Weierstrass points 2.4. D-osculating spaces...

2011
Sagarmoy Dutta Piyush P Kurur

In this paper, we study cyclic stabiliser codes over Fp of length dividing p + 1 for some positive integer t. We call these t-Frobenius codes or just Frobenius codes for short. We give methods to construct them and show that they have efficient decoding algorithms. An important subclass of stabiliser codes are the linear stabiliser codes. For linear Frobenius codes we have stronger results: We ...

Journal: :J. UCS 2017
Monika Kapus-Kolar

In the optimization of test sets for black-box conformance testing of objects specified and modelled as a finite state machine (FSM), a popular transformation is that under a certain precondition, a tail of a test is removed and appended to some other test. We propose a weaker precondition under which the transformation remains fault-coverage-preserving. Along with a weaker precondition, we pro...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید