167,302 research outputs found
[Report to Chief J. E. Curry, by an unknown author #1]
No full textReport to Chief J. E. Curry, by an unknown author. The report contains a list of officers who gave depositions to the United States Attorney
[Report to Chief J. E. Curry, by an unknown author #2]
No full textReport to Chief J. E. Curry, by an unknown author. The report contains a list of officers who gave depositions to the United States Attorney
Uniform Bounds on Product Sylvester-Gallai Configurations
No full textIn this work, we explore a non-linear extension of the classical Sylvester-Gallai configuration. Let be an algebraically closed field of characteristic zero, and let ℱ = {F_1, …, F_m} ⊂ [x_1, …, x_N] denote a collection of irreducible homogeneous polynomials of degree at most d, where each F_i is not a scalar multiple of any other F_j for i ≠ j. We define ℱ to be a product Sylvester-Gallai configuration if, for any two distinct polynomials F_i, F_j ∈ ℱ, the following condition is satisfied: ∏_{k≠i, j} F_k ∈ rad (F_i, F_j) .
We prove that product Sylvester-Gallai configurations are inherently low dimensional. Specifically, we show that there exists a function λ : ℕ → ℕ, independent of , N, and m, such that any product Sylvester-Gallai configuration must satisfy: dim(span_(ℱ)) ≤ λ(d).
This result generalizes the main theorems from (Shpilka 2019, Peleg and Shpilka 2020, Oliveira and Sengupta 2023), and gets us one step closer to a full derandomization of the polynomial identity testing problem for the class of depth 4 circuits with bounded top and bottom fan-in
Graph Reconstruction from Random Subgraphs
No full textWe consider the problem of reconstructing a graph G in two natural sampling models: 1) each sample corresponds to a random induced subgraph and 2) for a fixed adjacency matrix A_G for G, each sample corresponds to a random principal submatrix (i.e., a submatrix formed by deleting the same set of rows and columns) of A_G. We refer to these models as the "unordered" and "ordered" models respectively. The two models are motivated by work on the reconstruction conjecture in combinatorics and trace reconstruction in theoretical computer science. Despite the superficial similarities between the models, we show that the sample complexity of reconstruction can be exponentially different. Our main results are as follows:
- In the unordered model, we show that almost all graphs can be reconstructed with Θ(p^{-2} log n) samples if each node is included in the random subgraph with any constant probability p; this is optimal. We show our upper bound extends to smaller values of p as well. In contrast, for arbitrary graphs, we show that exp(Ω(n)) samples are required for reconstruction even for 2-regular graphs. One of the key technical steps in the first result is showing that, with high probability, any subgraph isomorphism in a random graph has at most O(log n) non-fixed points.
- In the ordered model, we show that any graph with constant arboricity or degeneracy (i.e., every induced subgraph has constant average degree) can be reconstructed with exp(Õ(n^{1/3})) samples and that arbitrary graphs can be reconstructed with exp(Õ(n^{1/2})) samples. The results about almost all graphs in the first model carry over to the second. One of the key technical steps in the first result is showing that reconstruction of low degeneracy graphs can be reduced to learning a small number of moments of sets of the form {i-j: j < i,(i,j) ∈ E} and {j-i: i < j,(i,j) ∈ E} where G = ([n],E) is the unknown graph
Murder on the mountain: author talk with Peter J. Wosh
No full textAuthor talk by Peter J. Wosh on May 5th, 2022, on his book, "Murder on the Mountain: crime, passion, and punishment in gilded age New Jersey.
Mr. Melvin J. Collier, RWWL AUC, June 2011
No full textThis video is a conversation with Mr. Melvin J. Collier. Mr. Collier talks about his book, "From Mississippi to Africa: A Journey of Discovery". Daniel Le, AUC Woodruff Library, is the interviewer
A Tripartite Post-Recession Rebalancing
No full textIn this latest Advance & Rutgers Report, entitled “A Tripartite Post-Recession Rebalancing,” Dean James W. Hughes and Professor Joseph J. Seneca deliver an incisive assessment of the current market conditions and obstacles in the path of our economic recovery. They offer a statistical cautionary tale that the private and public sector need to hear and acknowledge in order for the economy to make continued progress.This report was published as Issue Paper Number 7, November 2011, in Advance & Rutgers Report
Evidence for the decay B0→J/ψω and measurement of the relative branching fractions of meson decays to J/ψη and J/ψη′
No full textFirst evidence of the B 0 → J / ψ ω decay is found and the B s 0 → J / ψ η and B s 0 → J / ψ η ′ decays are studied using a dataset corresponding to an integrated luminosity of 1.0 fb -1 collected by the LHCb experiment in proton-proton collisions at a centre-of-mass energy of sqrt(s) = 7 TeV. The branching fractions of these decays are measured relative to that of the B 0 → J / ψ ρ 0 decay:frac(B (B 0 → J / ψ ω), B (B 0 → J / ψ ρ 0)) = 0.89 ± 0.19 (stat) - 0.13 + 0.07 (syst),frac(B (B s 0 → J / ψ η), B (B 0 → J / ψ ρ 0)) = 14.0 ± 1.2 (stat) - 1.5 + 1.1 (syst) - 1.0 + 1.1 (frac(f d, f s)),frac(B (B s 0 → J / ψ η ′), B (B 0 → J / ψ ρ 0)) = 12.7 ± 1.1 (stat) - 1.3 + 0.5 (syst) - 0.9 + 1.0 (frac(f d, f s)), where the last uncertainty is due to the knowledge of f d / f s, the ratio of b-quark hadronization factors that accounts for the different production rate of B 0 and B s 0 mesons. The ratio of the branching fractions of B s 0 → J / ψ η ′ and B s 0 → J / ψ η decays is measured to befrac(B (B s 0 → J / ψ η ′), B (B s 0 → J / ψ η)) = 0.90 ± 0.09 (stat) - 0.02 + 0.06 (syst)
Vortex imaging: new information gain from tracking cardiac energy loss
No full textEditorial on the manuscript: Stugaard M, Koriyama H, Katsuki K, Masuda K, Asanuma T, Takeda Yet al. Energy loss in the left ventricle obtained by vector flow mapping as a new quantitative measure of severity of aortic regurgitation. a combined experimental and clinical study. EurHeart J, Cardiovasc Imag 2015; (same issue)
The vanishing author in computer-generated works: a critical analysis of recent Australian case law
No full textAbstract
The use of software is ubiquitous in the creation of many copyright works, yet the requirement in copyright law that every work have a human author who engages in independent intellectual effort means that its use may prevent copyright subsistence. Several recent Australian cases have refocused attention on authorship as an essential criterion of copyright subsistence, and these cases suggest that much computer-produced output may be authorless and thus lack copyright protection. This article, the first in a two-part series, analyses how each case deals with the question of authorship of computer-produced works and why the use of software diminishes copyright protection for a significant number of computer-generated works. The article critiques the application of conventional notions of human authorship developed in the pre-computer age to modern productions and suggests alternative approaches to authorship that satisfy both the major objectives of copyright policy and the need to adapt to the computer age. The article argues that, without a broader judicial approach to authorship of computer-generated works, Parliament must remedy the lacuna in protection for these ‘authorless’ works. Possible solutions for reform are suggested. In a forthcoming article, the author comprehensively examines those reform proposals
- …
