238 research outputs found
Empirical risk minimization and uniform convergence for probabilistically observed and quantum measurement hypothesis classes
No full textAbram Chasins Collection
No full textA pianist, composer, pedagogue, musical director, and music writer, Abram Chasins was an active performer throughout his career. He gave many solo recitals, concerts with leading orchestras, and piano duets with his wife, Constance Keene, throughout the United States. Chasins also was a lecturer at the Curtis Institute of Music, Musician-in-Residence at the University of Southern California, and an active adjudicator. In addition, Chasins composed many pieces, including two piano concertos and numerous piano transcriptions. Chasins also was a musical director for radio stations NBC and WQXR and wrote numerous books, including one on "Speaking of Pianists". The collection consists of 28.00 Linear Feet of concert programs, reviews, correspondence, photographs, advertisements, articles, published and unpublished scores, recordings, scrapbooks, photographs, artwork, and other miscellaneous documents related to Chasins career as a performer, author, musical director, composer, and lecturer, and his relationships with his close colleagues, including Josef Hofmann, Hendrick Wilhelm Van Loon, and his wife, Constance Keene
ahgreen
No full text<p>The LICENSE for the Source Code is generally GPL-2+ or GPL-2 compatible.</p>
<p>For DATA creativecommons.org/licenses/by/4.0 The LICENSE for the Data is CC-BY 4.0 please attribute Abram Hindle using the following instructions:</p>
<p>To properly attribute Abram Hindle on as per the requirements of CC-BY 4.0, citation to the MSR Data Track paper or Abram Hindle’s Green Mining paper are fine:</p>
<p>@inproceedings{hindle2012green, title={Green mining: A methodology of relating software change to power consumption}, author={Hindle, Abram}, booktitle={Mining Software Repositories (MSR), 2012 9th IEEE Working Conference on}, pages={78--87}, year={2012}, organization={IEEE} }</p>
"Tevye the Milkman" at the Esquire Theatre, Grand Theatre
No full textDigital imageDigital finding aid
"Tevye the Milkman" at the Esquire Theatre, Grand Theatre
No full textDigital imageDigital finding aid
"Tevye the Milkman" at the Esquire Theatre, Grand Theatre
No full textDigital imageDigital finding aid
Profile of master carpenter Norm Abram, 54, star of television\u27s This Old House
No full textProfile of master carpenter Norm Abram, 54, star of television\u27s This Old House. In an interview in question-and-answer format, Abram discusses recent boating excursions in Maine waters, his admiration for Maine\u27s older wooden structures and his love of Shaker furniture. Abram is the author of eight books and hosts New Yankee Workshop on PBS
Profiles of Patricia Tries
Get PDFDigital trees are data structures that represent sets of strings according to their shared prefix structure. In the most fundamental of such trees, a trie, each string in the set is represented by a sequence of edges, each representing a single letter of the string, starting at the root of the tree and ending at a leaf, the parent edge of which corresponds to the last letter of the longest prefix that the string shares with any other string in the set. A PATRICIA trie is a trie in which each non-branching path is compressed into a single edge. The external profile B n,k, defined to be the number of leaves at level k of a PATRICIA trie on n strings, is an important summarizing\u27\u27 parameter, in terms of which several other parameters of interest can be formulated. Here we derive precise asymptotics for the expected value and variance of Bn,k , as well as a central limit theorem with error bound on the characteristic function, for PATRICIA tries on n infinite binary strings generated by a memoryless source with bias p \u3e 1/2 for k ∼ α\log n with α ∈ (1/log(1/q) + ε, 1/log(1/ p) – ε) for any fixed ε \u3e 0 . In this range, E[Bn,k] = Θ(Var[Bn,k ]) , and both are of the form Θ(n β(α)/√log n), where the Θ hides bounded, periodic functions of log n whose Fourier series we explicitly determine. The compression property leads to extra terms in the Poisson functional equations for the profile which are not seen in tries or digital search trees, resulting in Mellin transforms which are only implicitly given in terms of the moments of Bm,j for various m and j . Thus, the proofs require information about the profile outside the main range of interest. We then extend our results to the boundaries of the central region, allowing analyses of the typical height and fillup level, both of which exhibit a surprising phase transition with respect to p . Our derivations rely on analytic techniques, including Mellin transforms, analytic de-Poissonization, the saddle point method, and careful bounding of complex functions
- …
