The Experts below are selected from a list of 130197 Experts worldwide ranked by ideXlab platform
C S Karthik - One of the best experts on this subject based on the ideXlab platform.
-
toward a general direct Product Testing theorem
ACM Transactions on Computation Theory, 2020Co-Authors: Elazar Goldenberg, C S KarthikAbstract:The direct Product encoding of a string a∈ { 0,1}n on an underlying domain V⊆ (k[n]) is a function DPV(a) that gets as input a set S∈ V and outputs a restricted to S. In the direct Product Testing problem, we are given a function F:V→ { 0,1}k, and our goal is to test whether F is close to a direct Product encoding—that is, whether there exists some a∈ { 0,1}n such that on most sets S, we have F(S)eDPV(a)(S). A natural test is as follows: select a pair (S,S′)∈ V according to some underlying distribution over V× V, query F on this pair, and check for consistency on their intersection. Note that the preceding distribution may be viewed as a weighted graph over the vertex set V and is referred to as a test graph. The testability of direct Products was studied over various domains and test graphs: Dinur and Steurer (CCC’14) analyzed it when V equals the k-th slice of the Boolean hypercube and the test graph is a member of the Johnson graph family. Dinur and Kaufman (FOCS’17) analyzed it for the case where V is the set of faces of a Ramanujan complex, where in this case mVmeOk(n). In this article, we study the testability of direct Products in a general setting, addressing the question: what properties of the domain and the test graph allow one to prove a direct Product Testing theorem? Towards this goal, we introduce the notion of coordinate expansion of a test graph. Roughly speaking, a test graph is a coordinate expander if it has global and local expansion, and has certain nice intersection properties on sampling. We show that whenever the test graph has coordinate expansion, it admits a direct Product Testing theorem. Additionally, for every k and n, we provide a direct Product domain V⊆ (kn) of size n, called the sliding window domain, for which we prove direct Product testability.
-
towards a general direct Product Testing theorem
arXiv: Computational Complexity, 2019Co-Authors: Elazar Goldenberg, C S KarthikAbstract:The Direct Product encoding of a string $a\in \{0,1\}^n$ on an underlying domain $V\subseteq \binom{n}{k}$, is a function DP$_V(a)$ which gets as input a set $S\in V$ and outputs $a$ restricted to $S$. In the Direct Product Testing Problem, we are given a function $F:V\to \{0,1\}^k$, and our goal is to test whether $F$ is close to a direct Product encoding, i.e., whether there exists some $a\in \{0,1\}^n$ such that on most sets $S$, we have $F(S)=$DP$_V(a)(S)$. A natural test is as follows: select a pair $(S,S')\in V$ according to some underlying distribution over $V\times V$, query $F$ on this pair, and check for consistency on their intersection. Note that the above distribution may be viewed as a weighted graph over the vertex set $V$ and is referred to as a test graph. The testability of direct Products was studied over various specific domains and test graphs (for example see Dinur-Steurer [CCC'14]; Dinur-Kaufman [FOCS'17]). In this paper, we study the testability of direct Products in a general setting, addressing the question: what properties of the domain and the test graph allow one to prove a direct Product Testing theorem? Towards this goal we introduce the notion of coordinate expansion of a test graph. Roughly speaking a test graph is a coordinate expander if it has global and local expansion, and has certain nice intersection properties on sampling. We show that whenever the test graph has coordinate expansion then it admits a direct Product Testing theorem. Additionally, for every $k$ and $n$ we provide a direct Product domain $V\subseteq \binom{n}{k}$ of size $n$, called the Sliding Window domain for which we prove direct Product testability.
Elazar Goldenberg - One of the best experts on this subject based on the ideXlab platform.
-
toward a general direct Product Testing theorem
ACM Transactions on Computation Theory, 2020Co-Authors: Elazar Goldenberg, C S KarthikAbstract:The direct Product encoding of a string a∈ { 0,1}n on an underlying domain V⊆ (k[n]) is a function DPV(a) that gets as input a set S∈ V and outputs a restricted to S. In the direct Product Testing problem, we are given a function F:V→ { 0,1}k, and our goal is to test whether F is close to a direct Product encoding—that is, whether there exists some a∈ { 0,1}n such that on most sets S, we have F(S)eDPV(a)(S). A natural test is as follows: select a pair (S,S′)∈ V according to some underlying distribution over V× V, query F on this pair, and check for consistency on their intersection. Note that the preceding distribution may be viewed as a weighted graph over the vertex set V and is referred to as a test graph. The testability of direct Products was studied over various domains and test graphs: Dinur and Steurer (CCC’14) analyzed it when V equals the k-th slice of the Boolean hypercube and the test graph is a member of the Johnson graph family. Dinur and Kaufman (FOCS’17) analyzed it for the case where V is the set of faces of a Ramanujan complex, where in this case mVmeOk(n). In this article, we study the testability of direct Products in a general setting, addressing the question: what properties of the domain and the test graph allow one to prove a direct Product Testing theorem? Towards this goal, we introduce the notion of coordinate expansion of a test graph. Roughly speaking, a test graph is a coordinate expander if it has global and local expansion, and has certain nice intersection properties on sampling. We show that whenever the test graph has coordinate expansion, it admits a direct Product Testing theorem. Additionally, for every k and n, we provide a direct Product domain V⊆ (kn) of size n, called the sliding window domain, for which we prove direct Product testability.
-
towards a general direct Product Testing theorem
arXiv: Computational Complexity, 2019Co-Authors: Elazar Goldenberg, C S KarthikAbstract:The Direct Product encoding of a string $a\in \{0,1\}^n$ on an underlying domain $V\subseteq \binom{n}{k}$, is a function DP$_V(a)$ which gets as input a set $S\in V$ and outputs $a$ restricted to $S$. In the Direct Product Testing Problem, we are given a function $F:V\to \{0,1\}^k$, and our goal is to test whether $F$ is close to a direct Product encoding, i.e., whether there exists some $a\in \{0,1\}^n$ such that on most sets $S$, we have $F(S)=$DP$_V(a)(S)$. A natural test is as follows: select a pair $(S,S')\in V$ according to some underlying distribution over $V\times V$, query $F$ on this pair, and check for consistency on their intersection. Note that the above distribution may be viewed as a weighted graph over the vertex set $V$ and is referred to as a test graph. The testability of direct Products was studied over various specific domains and test graphs (for example see Dinur-Steurer [CCC'14]; Dinur-Kaufman [FOCS'17]). In this paper, we study the testability of direct Products in a general setting, addressing the question: what properties of the domain and the test graph allow one to prove a direct Product Testing theorem? Towards this goal we introduce the notion of coordinate expansion of a test graph. Roughly speaking a test graph is a coordinate expander if it has global and local expansion, and has certain nice intersection properties on sampling. We show that whenever the test graph has coordinate expansion then it admits a direct Product Testing theorem. Additionally, for every $k$ and $n$ we provide a direct Product domain $V\subseteq \binom{n}{k}$ of size $n$, called the Sliding Window domain for which we prove direct Product testability.
Mark J Sotir - One of the best experts on this subject based on the ideXlab platform.
-
a novel vehicle for transmission of escherichia coli o157 h7 to humans multistate outbreak of e coli o157 h7 infections associated with consumption of ready to bake commercial prepackaged cookie dough united states 2009
Clinical Infectious Diseases, 2012Co-Authors: Karen P Neil, Eija Trees, Gwen Biggerstaff, Kathryn J Macdonald, Carlota Medus, Kimberlee A Musser, Steven Stroika, Don Zink, Mark J SotirAbstract:Background Escherichia coli O157:H7 is a Shiga toxin-producing E. coli (STEC) associated with numerous foodborne outbreaks in the United States and is an important cause of bacterial gastrointestinal illness. In May 2009, we investigated a multistate outbreak of E. coli O157:H7 infections. Methods Outbreak-associated cases were identified using serotyping and molecular subtyping procedures. Traceback investigation and Product Testing were performed. A matched case-control study was conducted to identify exposures associated with illness using age-, sex-, and state-matched controls. Results Seventy-seven patients with illnesses during the period 16 March-8 July 2009 were identified from 30 states; 35 were hospitalized, 10 developed hemolytic-uremic syndrome, and none died. Sixty-six percent of patients were Conclusions This is the first reported STEC outbreak associated with consuming ready-to-bake commercial prepackaged cookie dough. Despite instructions to bake brand A cookie dough before eating, case patients consumed the Product uncooked. Manufacturers should consider formulating ready-to-bake commercial prepackaged cookie dough to be as safe as a ready-to-eat Product. More effective consumer education about the risks of eating unbaked cookie dough is needed.
Jennifer Luchavez - One of the best experts on this subject based on the ideXlab platform.
-
a review of the who malaria rapid diagnostic test Product Testing programme 2008 2018 performance procurement and policy
Malaria Journal, 2019Co-Authors: Jane Cunningham, Michelle L Gatton, Sophie Jones, John W Barnwell, Qin Cheng, Peter L Chiodini, Jeffrey Glenn, Sandra Incardona, Cara S Kosack, Jennifer LuchavezAbstract:Malaria rapid diagnostic tests (RDTs) emerged in the early 1990s into largely unregulated markets, and uncertain field performance was a major concern for the acceptance of tests for malaria case management. This, combined with the need to guide procurement decisions of UN agencies and WHO Member States, led to the creation of an independent, internationally coordinated RDT evaluation programme aiming to provide comparative performance data of commercially available RDTs. Products were assessed against Plasmodium falciparum and Plasmodium vivax samples diluted to two densities, along with malaria-negative samples from healthy individuals, and from people with immunological abnormalities or non-malarial infections. Three measures were established as indicators of performance, (i) panel detection score (PDS) determined against low density panels prepared from P. falciparum and P. vivax wild-type samples, (ii) false positive rate, and (iii) invalid rate, and minimum criteria defined. Over eight rounds of the programme, 332 Products were tested. Between Rounds 1 and 8, substantial improvements were seen in all performance measures. The number of Products meeting all criteria increased from 26.8% (11/41) in Round 1, to 79.4% (27/34) in Round 8. While Products submitted to further evaluation rounds under compulsory re-Testing did not show improvement, those voluntarily resubmitted showed significant increases in P. falciparum (p = 0.002) and P. vivax PDS (p < 0.001), with more Products meeting the criteria upon re-Testing. Through this programme, the differentiation of Products based on comparative performance, combined with policy changes has been influential in the acceptance of malaria RDTs as a case-management tool, enabling a policy of parasite-based diagnosis prior to treatment. Publication of Product Testing results has produced a transparent market allowing users and procurers to clearly identify appropriate Products for their situation, and could form a model for introduction of other, broad-scale diagnostics.
Chanseok Jeong - One of the best experts on this subject based on the ideXlab platform.
-
a high quality supplier selection model for supply chain management and iso 9001 system
Production Planning & Control, 2003Co-Authors: Museong Lee, Younghae Lee, Chanseok JeongAbstract:Supplier selection process for supply chain management (SCM) and ISO 9001 quality management system environments is considered. Determining suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions is usually complex and unstructured. This paper proposes a high-quality-supplier selection (HQSS) model to deal with supplier selection problems in supply chain management. In selecting a supplier, quality management factors are considered first, and then price, delivery, etc. Quality management factors include a quality management audit, Product Testing, engineering work force, capability index, training time, etc., based on a five-interval scale. Next, the HQSS model determines the final solution by considering factors such as price, Production lead-time, and delivery time.