4,789 research outputs found
Service-oriented models for audiovisual content storage
No full textWhat are the important topics to understand if involved with storage services to hold digital audiovisual content? This report takes a look at how content is created and moves into and out of storage; the storage service value networks and architectures found now and expected in the future; what sort of data transfer is expected to and from an audiovisual archive; what transfer protocols to use; and a summary of security and interface issues
Message from Amy Compton-Phillips, M.D., and Jeff Kaas of Kaas Tailored.
No full textThanks to an outpouring of support, a local manufacturer - Kaas Tailored has stepped up to help us mass-produce surgical masks and face shields, with other manufacturers joining the cause next week. As a result, we do not need volunteers to pick up sewing kits at our Renton campus today. But your willingness to help means so much us.
We are truly grateful and will share other ways you can get involved soon. To learn more about how we’re partnering with the business community, watch this message from our chief clinical officer Amy Compton-Phillips, M.D., and Jeff Kaas of Kaas Tailored
Letter from Hubert Phillips to American Civil Liberties Union of Northern California, August 4, 1942
No full textLetter from Hubert Phillips to American Civil Liberties Union of Northern California, enclosing checks for $57 from F. C. Kellogg, Arthur E. Geschke, Claus Bertelsen, and Hubert Phillips. The letter states that the checks represent "the contributions of about twenty-five people made at a dinner held here recently to consider the phases of the status of citizens of Japanese ancestry and is to be applied specifically to helping prosecute the case of Miss Mitsuye Endo. Mr. F. C. Kellogg of the Fowler High School faculty was the author of the idea and deserves the credit for raising the enclosed contribution."The ACLU-Northern California case file records contain legal documents and correspondence pertaining to the case Ex parte Mitsuye Endo (1944), in which the United States Supreme court unanimously ruled that the federal government could not indefinitely detain United States citizens who were loyal to the government. Files include documents related to the Gordon Hirabayashi Supreme Court case Hirabayashi v. United States
Louise Phillips scrapbooks
No full textTwo scrapbooks compiled by Louise Phillips, a University of Maryland Alumna. She graduated with a Bachelor's of Science in Early Childhood Education in 1960 and with an Med. in Curriculum and Instruction in 1991. Phillips was a Montgomery County public school teacher and is the author of children's books. In 1986 she made a documentary about her teaching experiences. The scrapbooks include statements of her philosophy on teaching, vacation photographs, and correspondence. Also included are her two books, The Bald Eagle's Flying Shadow: A Fourth of July Celebration and The First Snowflake of Winter
Jeff Barnes, age 12, in Phillips Head shows the old way of dring squid in wet weather
No full textNewBuilding a better dried squid. Jeff Barnes, age 12, in Phillips Head shows the old way of dring squid in wet weather
Bob and Burton Shields, Lorraine and Graham Phillips, Doc and Yvonne Murphrey and Barbara and Jeff Batts
No full textBob and Burton Shields, Lorraine and Graham Phillips, Doc and Yvonne Murphrey and Barbara and Jeff Batts at Hawaii Kai in New York
Front Matter, Table of Contents, Preface, Conference Organization
No full textFront Matter, Table of Contents, Preface, Conference Organizatio
LIPIcs, Volume 293, SoCG 2024, Complete Volume
No full textLIPIcs, Volume 293, SoCG 2024, Complete Volum
Independent Range Sampling, Revisited Again
No full textWe revisit the range sampling problem: the input is a set of points where each point is associated with a real-valued weight. The goal is to store them in a structure such that given a query range and an integer k, we can extract k independent random samples from the points inside the query range, where the probability of sampling a point is proportional to its weight.
This line of work was initiated in 2014 by Hu, Qiao, and Tao and it was later followed up by Afshani and Wei. The first line of work mostly studied unweighted but dynamic version of the problem in one dimension whereas the second result considered the static weighted problem in one dimension as well as the unweighted problem in 3D for halfspace queries.
We offer three main results and some interesting insights that were missed by the previous work: We show that it is possible to build efficient data structures for range sampling queries if we allow the query time to hold in expectation (the first result), or obtain efficient worst-case query bounds by allowing the sampling probability to be approximately proportional to the weight (the second result). The third result is a conditional lower bound that shows essentially one of the previous two concessions is needed. For instance, for the 3D range sampling queries, the first two results give efficient data structures with near-linear space and polylogarithmic query time whereas the lower bound shows with near-linear space the worst-case query time must be close to n^{2/3}, ignoring polylogarithmic factors. Up to our knowledge, this is the first such major gap between the expected and worst-case query time of a range searching problem
Approximate Maximum Halfspace Discrepancy
No full textConsider the geometric range space (X, H_d) where X ⊂ ℝ^d and H_d is the set of ranges defined by d-dimensional halfspaces. In this setting we consider that X is the disjoint union of a red and blue set. For each halfspace h ∈ H_d define a function Φ(h) that measures the "difference" between the fraction of red and fraction of blue points which fall in the range h. In this context the maximum discrepancy problem is to find the h^* = arg max_{h ∈ (X, H_d)} Φ(h). We aim to instead find an ĥ such that Φ(h^*) - Φ(ĥ) ≤ ε. This is the central problem in linear classification for machine learning, in spatial scan statistics for spatial anomaly detection, and shows up in many other areas. We provide a solution for this problem in O(|X| + (1/ε^d) log⁴ (1/ε)) time, for constant d, which improves polynomially over the previous best solutions. For d = 2 we show that this is nearly tight through conditional lower bounds. For different classes of Φ we can either provide a Ω(|X|^{3/2 - o(1)}) time lower bound for the exact solution with a reduction to APSP, or an Ω(|X| + 1/ε^{2-o(1)}) lower bound for the approximate solution with a reduction to 3Sum.
A key technical result is a ε-approximate halfspace range counting data structure of size O(1/ε^d) with O(log (1/ε)) query time, which we can build in O(|X| + (1/ε^d) log⁴ (1/ε)) time
- …
