نتایج جستجو برای: cover test
تعداد نتایج: 914815 فیلتر نتایج به سال:
Given a tree and a set of paths in the tree, the problem of finding a minimum number of paths from the given path set to cover all the vertices in the tree is investigated in the paper. To distinguish from the classical path cover problem, such an optimization problem is referred to as vertex covering by paths. The problem and its edge variant, edge covering by paths, find applications in machi...
Embedded content addressable memories (CAMs) are important components in many system chips. In this paper two efficient March-like test algorithms are proposed. In addition to typical RAM faults, they also cover CAMspecific comparison faults. The first algorithm requires 9N Read/Write operations and 2(N + W ) Compare operations to cover comparison and RAM faults (but does not fully cover the in...
This paper describes a new approach to testing that uses combinatorial designs to generate tests that cover the pairwise, triple, or n-way combinations of a system’s test parameters. These are the parameters that determine the system’s test scenarios. Examples are system configuration parameters, user inputs and other external events. We implemented this new method in the AETG system. The AETG ...
I propose a cover song detection system based on multiple feature streams, feature normalization, and supervised classification. The system performs well not only when prior knowledge of the number of covers in a database is given, but also when a reference/test track pair is given without prior knowledge of the structure of the database. On the “covers80” test set, the proposed cover song dete...
Ternary content addressable memory (TCAM) is one key component in high-performance networking applications. An asymmetric TCAM cell consists of a binary content addressable memory (BCAM) bit and a mask bit. In this paper, we analyze comparison faults of the asymmetric TCAM cell based on BCAM comparison faults. Then march-like test algorithms T are proposed to cover the comparison faults of the ...
Eco-cover is ecological mulch and its application is an eco-friendly and low-cost method to improve soil environment and prevention of unwanted plants. The aim of this study was to investigate the effects of eco-cover on unwanted plants, Vetiver grass (Chrysopogon zizanioides) growth and soil Properties. For this purpose, two series of rectangular plot (with and without eco-cover), in three rep...
In this paper, we present the macro stress test with a credit risk approach for banking system of Iran during the period 2004Q1-2019Q4. The goal is to evaluate the vulnerability of the banking system through credit risk to the country economic shocks. In this regard, the developed method of Wilson (1997) Credit Portfolio View model including macroeconomic variables and default rate has been use...
Background and Aims: Most children get a lot of anxiety while they visit a dentist. The most important factor in the child's fear at the beginning of treatment is the syringe and needle. Ways to cope with this anxiety include behavioural control techniques such as mental regeneration, distraction, and induction. The purpose of this study was to compare the pain and anxiety in children when usin...
We propose a high-level fault model, the coupling fault (CF) model, that aims to cover both functional and timing faults in an integrated way. The basic properties of CFs and the corresponding tests are analyzed, focusing on their relationship with other fault models and their test requirements. A test generation program COTEGE for CFs is presented. Experiments with COTEGE are described which s...
Semantic relatedness is a special form of linguistic distance between words. Evaluating semantic relatedness measures is usually performed by comparison with human judgments. Previous test datasets had been created analytically and were limited in size. We propose a corpus-based system for automatically creating test datasets.1 Experiments with human subjects show that the resulting datasets co...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید