2,192 research outputs found
Recurrence in Hemingway and Cézanne
No full textInfluence study exploring the presence of Cézanne in Hemingway’s work. Berman addresses motifs such as curving roads, which both the author and the painter employ to show the movement from known to unknown. Draws on passages from Hemingway’s fiction, particularly “The Three-Day Blow,” “The Battler,” and The Sun Also Rises, and an interview with Cézanne to conclude that while the artists rely on recasting empirical images to construct meaning, both acknowledge the ultimate inability of art to fully depict reality
Parsing Science - p-Hacking Business
No full textWhether intentionally or unintentionally, could the manipulation of statistics in marketing research be costing companies millions? In episode 43, Ron Berman from the University of Pennsylvania's Wharton School of Business discusses in his research article "p-Hacking and False Discovery in A/B Testing," co-authored with Leonid Pekelis, Aisling Scott, and Christophe Van den Bulte, and published July 18, 2018 on SSRN.https://www.parsingscience.org/2019/02/19/berman/</div
Supplemental Material, DS_10.1177_0022243719861923 - A Tale of Two Twitterspheres: Political Microblogging During and After the 2016 Primary and Presidential Debates
No full textSupplemental Material, DS_10.1177_0022243719861923 for A Tale of Two Twitterspheres: Political Microblogging During and After the 2016 Primary and Presidential Debates by Ron Berman, Shiri Melumad, Colman Humphrey and Robert Meyer in Journal of Marketing Research</p
Oral history interview with Ron Wallace
No full textRon Wallace, author and instructor, talks about growing up in Durant, Oklahoma, and having a father on the police force. He recalls his college days and earning a degree in English. He explains how he developed a love of poetry initially and how he began writing poetry. Wallace also shares stories of his grandparents and reads a few of his favorite poems. He has been a Oklahoma Book Award finalist several times.The Deep Roots: Oklahoma Authors Collection is a series of interviews with authors who discuss their lives, work, and creative processes
Best-Selling Author Ron Rash to Visit GWU
No full textGardner-Webb University alumnus and best-selling author Ron Rash is set to visit GWU as he gains worldwide attention for “Serena,” his novel that was adapted into a feature film set to premiere next month. Rash will visit the campus Oct. 3 to give the keynote address at the Appalachian Writers Association’s annual awards banquet, part of the Southern Appalachian Culture Series conference hosted at Gardner-Webb. The 1976 GWU alum, also currently the John Parris Distinguished Professor of Appalachian Studies at Western Carolina University, will discuss Appalachian writing and read from some of his works.
WGWG: Catch Up with Ron Rashhttps://digitalcommons.gardner-webb.edu/gardner-webb-newscenter-archive/2320/thumbnail.jp
Friends of the Greenwood Library Presents Ron Smith
No full textVirginia Poet Laureate Ron Smith spoke and read at Longwood University April 14, 2015 in celebration of National Poetry Month.
Smith, a longtime professor and celebrated poet, is currently writer-in-residence at St. Christopher’s School in Richmond. He is the author of Running Again in Hollywood Cemetery, Moon Road and Its Ghostly Workshop. He will speak and read from his poetry on April 14 at 7 p.m. in the Greenwood Library atrium. The event is free and open to the public.
I’m excited to bring Ron Smith, poet laureate of the Commonwealth, to speak at Longwood during National Poetry Month, said Suzy Szasz Palmer, dean of Greenwood Library. Virginia is rich in its history but also in its depth of literary writers. Fiction and nonfiction typically garner more public attention, but it’s vitally important to celebrate the role of poetry in our culture. Virginia’s poet laureates serve for two-year terms, and Mr. Smith is the third poet laureate we’ve hosted since I came to Longwood in July 2011, thanks to the Friends of the Greenwood Library.
Many of Smith’s poems center on his time in college at the University of Richmond, where he played football on the Tangerine Bowl championship team. He also holds a master’s degree from VCU
Chimeric molecules between keratinocyte growth factor and basic fibroblast growth factor define domains that confer receptor binding specificities
No full textBasic fibroblast growth factor (FGF) and keratinocyte growth factor (KGF) are structurally related fibroblast growth factors, yet they exhibit distinct receptor binding specificity. Basic FGF binds with high affinity to FGFR1, FGFR2, and FGFR4, whereas KGF does not interact with these receptors and can only bind an isoform of FGFR2 known as the KGFR. Basic GFG binds KGFR but with lower affinity than KGF. In order to identify domains that confer this specificity, four reciprocal chimeras were generated between the two growth factors and were analyzed for receptor recognition and biological activity. The chimeras are designated BK1 (bFGF1-54:KGF91-194), BK2 (bFGF1-74:KGF111-194), KB1 (KGF31-90:bFGF55-155), and KB2 (KGF31-110:bFGF75-155). The two BK chimera similarly interacted with FGFR1 and FGFR4 but differed from each other with respect to KGFR recognition. BK1 displayed a slightly better affinity for KGFR than BK2 and induced a higher level of DNA synthesis in keratinocytes compared with bFGF and BK2. A neutralizing monoclonal antibody directed against bFGF specifically neutralized the biological activity of the BK chimeras. The reciprocal chimeras, KB1 and KB2, exhibited KGF-like receptor binding and activation properties. However, KB2 displayed higher affinity for KGFR and was significantly more potent mitogen that KB1. Altogether, our results suggest that the amino-terminal part of KGF and bFGF plays an important role in determining their receptor binding specificity. In addition, the results point to the contribution of a segment from the middle part of KGF (residues 91-110) for recognition and activation of the KGFR, as the two chimeras containing these residues (BK1 and KB2) displayed an enhanced interaction with the KGFR
Famous Author and Gardner-Webb Alumnus Ron Rash to Make Television Appearance
No full textAward-winning author and Boiling Springs, N.C., native, Ron Rash will be featured during the season premiere of “North Carolina Bookwatch” on UNC-TV (public television) this Friday, July 6 at 9:30 p.m. The show will spotlight Rash’s latest novel, “The Cove.” This marks the third appearance for Rash on the program, where he’s previously spoke about his books “Serena” and “One Foot in Eden.”https://digitalcommons.gardner-webb.edu/gardner-webb-newscenter-archive/2837/thumbnail.jp
Zero-Knowledge Proofs of Proximity
No full textInteractive proofs of proximity (IPPs) are interactive proofs in which the verifier runs in time sub-linear in the input length. Since the verifier cannot even read the entire input, following the property testing literature, we only require that the verifier reject inputs that are far from the language (and, as usual, accept inputs that are in the language).
In this work, we initiate the study of zero-knowledge proofs of proximity (ZKPP). A ZKPP convinces a sub-linear time verifier that the input is close to the language (similarly to an IPP) while simultaneously guaranteeing a natural zero-knowledge property. Specifically, the verifier learns nothing beyond (1) the fact that the input is in the language, and (2) what it could additionally infer by reading a few bits of the input.
Our main focus is the setting of statistical zero-knowledge where we show that the following hold unconditionally (where N denotes the input length):
- Statistical ZKPPs can be sub-exponentially more efficient than property testers (or even non-interactive IPPs): We show a natural property which has a statistical ZKPP with a polylog(N) time verifier, but requires Omega(sqrt(N)) queries (and hence also runtime) for every property tester.
- Statistical ZKPPs can be sub-exponentially less efficient than IPPs: We show a property which has an IPP with a polylog(N) time verifier, but cannot have a statistical ZKPP with even an N^(o(1)) time verifier.
- Statistical ZKPPs for some graph-based properties such as promise versions of expansion and bipartiteness, in the bounded degree graph model, with polylog(N) time verifiers exist.
Lastly, we also consider the computational setting where we show that:
- Assuming the existence of one-way functions, every language computable either in (logspace uniform) NC or in SC, has a computational ZKPP with a (roughly) sqrt(N) time verifier.
- Assuming the existence of collision-resistant hash functions, every language in NP has a statistical zero-knowledge argument of proximity with a polylog(N) time verifier
- …
