中文
相关论文

相关论文: Complete Test Sets And Their Approximations

200 篇论文

The problem of estimating the proportion of satisfiable instances of a given CSP (constraint satisfaction problem) can be tackled through weighting. It consists in putting onto each solution a non-negative real value based on its…

离散数学 · 计算机科学 2015-03-17 Yacine Boufkhad , Thomas Hugel

Codeword stabilized (CWS) codes are a general class of quantum codes that includes stabilizer codes and many families of non-additive codes with good parameters. For such a non-additive code correcting all t-qubit errors, we propose an…

量子物理 · 物理学 2013-05-29 Yunfan Li , Ilya Dumer , Leonid P. Pryadko

We formulate and analyze a stochastic threshold group testing problem motivated by biological applications. Here a set of $n$ items contains a subset of $d \ll n$ defective items. Subsets (pools) of the $n$ items are tested -- the test…

信息论 · 计算机科学 2013-04-25 Chun Lam Chan , Sheng Cai , Mayank Bakshi , Sidharth Jaggi , Venkatesh Saligrama

Completeness is a desirable property of test suites. Roughly, completeness guarantees that a non-equivalent implementation under test will always be identified. Several approaches proposed sufficient, and sometimes also necessary,…

软件工程 · 计算机科学 2015-08-13 Adilson Luiz Bonifacio , Arnaldo Vieira Moura

For typical first-order logical theories, satisfying assignments have a straightforward finite representation that can directly serve as a certificate that a given assignment satisfies the given formula. For non-linear real arithmetic…

计算机科学中的逻辑 · 计算机科学 2025-03-07 Enrico Lipparini , Stefan Ratschan

We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are "symmetric" while the outputs are drawn from a…

信息论 · 计算机科学 2011-08-16 Amin Emad , Jun Shen , Olgica Milenkovic

Motivated by the Model-Based Design process for Cyber-Physical Systems, we consider issues in conformance testing of systems. Conformance is a quantitative notion of similarity between the output trajectories of systems, which considers…

系统与控制 · 计算机科学 2015-11-19 Houssam Abbas , Georgios Fainekos

A {\it pure significance test} (PST) tests a simple null hypothesis $H_f:Y\sim f$ {\it without specifying an alternative hypothesis} by rejecting $H_f$ for {\it small} values of $f(Y)$. When the sample space supports a proper uniform pmf…

统计理论 · 数学 2024-04-23 Michael D. Perlman

In group testing, the task is to identify defective items by testing groups of them together using as few tests as possible. We consider the setting where each item is defective with a constant probability $\alpha$, independent of all other…

离散数学 · 计算机科学 2024-11-15 Lukas Hintze , Lena Krieg , Olga Scheftelowitsch , Haodong Zhu

A simple test is proposed for examining the correctness of a given completely specified response function against unspecified general alternatives in the context of univariate regression. The usual diagnostic tools based on residuals plots…

统计方法学 · 统计学 2010-04-27 Jean-Baptiste Aubin , Samuela Leoni-Aubin

Assessing the stability of a multiple testing procedure under dependence is important but very challenging. Even for multiple testing which among a set of Normal random variables have mean zero, which we refer to as the "Normal means…

统计理论 · 数学 2020-03-06 Xiongzhi Chen , Rebecca W. Doerge

This note considers checking satisfiability of sets of propositional clauses (SAT instances). It shows that "unipolar sets" of clauses (containing no positive or no negative clauses) provide an "early sign" of satisfiability of SAT…

计算机科学中的逻辑 · 计算机科学 2016-12-16 Eliezer L. Lozinskii

The steady-state approximation (hereafter abbreviated as SSA) consists in setting $dy/dt=0$, where $y$ denotes the concentration of a short-lived intermediate subject to first-order decay with a rate constant $k$. The sole reason for…

综合物理 · 物理学 2017-05-26 K. Razi Naqvi

We consider sets $\Gamma(n,s,k)$ of narrow clauses expressing that no definition of a size $s$ circuit with $n$ inputs is refutable in resolution R in $k$ steps. We show that every CNF shortly refutable in Extended R, ER, can be easily…

逻辑 · 数学 2016-06-28 Jan Krajicek

A new method based on the rejection sampling for finding statistical tests is proposed. This method is conceptually intuitive, easy to implement, and applicable for arbitrary dimension. To illustrate its potential applicability, three…

统计方法学 · 统计学 2026-03-11 Markku Kuismin

Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be determined by performing a test, which incurs some cost. The…

数据结构与算法 · 计算机科学 2023-08-22 Rohan Ghuge , Anupam Gupta , Viswanath Nagarajan

We investigate the possibility that the conformal and conformal thin sandwich (CTS) methods can be used to parameterize the set of solutions of the vacuum Einstein constraint equations. To this end we develop a model problem obtained by…

广义相对论与量子宇宙学 · 物理学 2011-03-02 David Maxwell

Many scientific-software projects test their codes inadequately, or not at all. Despite its well-known benefits, adopting routine testing is often not easy. Development teams may have doubts about establishing effective test procedures,…

软件工程 · 计算机科学 2014-11-11 Paul Madden , Eduardo G. Valente

Software testing is an essential part of the software lifecycle and requires a substantial amount of time and effort. It has been estimated that software developers spend close to 50% of their time on testing the code they write. For these…

软件工程 · 计算机科学 2020-02-20 Cody Watson , Michele Tufano , Kevin Moran , Gabriele Bavota , Denys Poshyvanyk

We consider nonadaptive group testing with Bernoulli tests, where each item is placed in each test independently with some fixed probability. We give a tight threshold on the maximum number of tests required to find the defective set under…

信息论 · 计算机科学 2017-11-16 Matthew Aldridge