409 research outputs found
Testing Linear-Invariant Non-Linear Properties
We consider the task of testing properties of Boolean functions that are
invariant under linear transformations of the Boolean cube. Previous work in
property testing, including the linearity test and the test for Reed-Muller
codes, has mostly focused on such tasks for linear properties. The one
exception is a test due to Green for "triangle freeness": a function
f:\cube^{n}\to\cube satisfies this property if do not all
equal 1, for any pair x,y\in\cube^{n}.
Here we extend this test to a more systematic study of testing for
linear-invariant non-linear properties. We consider properties that are
described by a single forbidden pattern (and its linear transformations), i.e.,
a property is given by points v_{1},...,v_{k}\in\cube^{k} and
f:\cube^{n}\to\cube satisfies the property that if for all linear maps
L:\cube^{k}\to\cube^{n} it is the case that do
not all equal 1. We show that this property is testable if the underlying
matroid specified by is a graphic matroid. This extends
Green's result to an infinite class of new properties.
Our techniques extend those of Green and in particular we establish a link
between the notion of "1-complexity linear systems" of Green and Tao, and
graphic matroids, to derive the results.Comment: This is the full version; conference version appeared in the
proceedings of STACS 200
A study of patent thickets
Report analysing whether entry of UK enterprises into patenting in a technology area is affected by patent thickets in the technology area
Sublinear Algorithms for Approximating String Compressibility
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and a variant of Lempel-Ziv (LZ77), and present sublinear algorithms for approximating compressibility with respect to both schemes. We also give several lower bounds that show that our algorithms for both schemes cannot be improved significantly.
Our investigation of LZ77 yields results whose interest goes beyond the initial questions we set out to study. In particular, we prove combinatorial structural lemmas that relate the compressibility of a string with respect to LZ77 to the number of distinct short substrings contained in it (its ℓth subword complexity , for small ℓ). In addition, we show that approximating the compressibility with respect to LZ77 is related to approximating the support size of a distribution.National Science Foundation (U.S.) (Award CCF-1065125)National Science Foundation (U.S.) (Award CCF-0728645)Marie Curie International Reintegration Grant PIRG03-GA-2008-231077Israel Science Foundation (Grant 1147/09)Israel Science Foundation (Grant 1675/09
Recommended from our members
Is There a Market for Organic Search Engine Results and Can Their Manipulation Give Rise to Antitrust Liability?
Recommended from our members
Trial Courts: An Economic Perspective
This article describes economic research on models of legal disputes. Concepts such as rational choice and static equilibrium are often used inaccurately in the noneconomic research presented in this issue. This article critiques the longitudinal studies, illustrating a number of problems of conceptualization and data analysis. Finally, the authors consider normative models of dispute resolution and the evolution and effects of judge-made law.</p
Recommended from our members
An Economic Model of Legal Discovery
Presents an economic analysis of legal discovery in the United States. Purposes of discovery; Discussion on discovery abuse and fair resolution of disputes; Policy recommendations.</p
Extended Thromboprophylaxis with Betrixaban in Acutely Ill Medical Patients
Background
Patients with acute medical illnesses are at prolonged risk for venous thrombosis. However, the appropriate duration of thromboprophylaxis remains unknown.
Methods
Patients who were hospitalized for acute medical illnesses were randomly assigned to receive subcutaneous enoxaparin (at a dose of 40 mg once daily) for 10±4 days plus oral betrixaban placebo for 35 to 42 days or subcutaneous enoxaparin placebo for 10±4 days plus oral betrixaban (at a dose of 80 mg once daily) for 35 to 42 days. We performed sequential analyses in three prespecified, progressively inclusive cohorts: patients with an elevated d-dimer level (cohort 1), patients with an elevated d-dimer level or an age of at least 75 years (cohort 2), and all the enrolled patients (overall population cohort). The statistical analysis plan specified that if the between-group difference in any analysis in this sequence was not significant, the other analyses would be considered exploratory. The primary efficacy outcome was a composite of asymptomatic proximal deep-vein thrombosis and symptomatic venous thromboembolism. The principal safety outcome was major bleeding.
Results
A total of 7513 patients underwent randomization. In cohort 1, the primary efficacy outcome occurred in 6.9% of patients receiving betrixaban and 8.5% receiving enoxaparin (relative risk in the betrixaban group, 0.81; 95% confidence interval [CI], 0.65 to 1.00; P=0.054). The rates were 5.6% and 7.1%, respectively (relative risk, 0.80; 95% CI, 0.66 to 0.98; P=0.03) in cohort 2 and 5.3% and 7.0% (relative risk, 0.76; 95% CI, 0.63 to 0.92; P=0.006) in the overall population. (The last two analyses were considered to be exploratory owing to the result in cohort 1.) In the overall population, major bleeding occurred in 0.7% of the betrixaban group and 0.6% of the enoxaparin group (relative risk, 1.19; 95% CI, 0.67 to 2.12; P=0.55).
Conclusions
Among acutely ill medical patients with an elevated d-dimer level, there was no significant difference between extended-duration betrixaban and a standard regimen of enoxaparin in the prespecified primary efficacy outcome. However, prespecified exploratory analyses provided evidence suggesting a benefit for betrixaban in the two larger cohorts. (Funded by Portola Pharmaceuticals; APEX ClinicalTrials.gov number, NCT01583218. opens in new tab.
- …
