136,565 research outputs found
Letter Written by Mrs. M. Goldberg to the Bryant College Service Club Dated May 11, 1943
No full text[Transcription begins] May 11, 1943 Hartford, Connecticut
Bryant Service Club Bryant College
Dear Sirs:
Enclose[d] please find check for your wonderful work to carry on. I really think the idea is splendid. Jerome’s address is as follows:
Pvt. Jerome K. Goldberg 11111403 Co. f. 1st Ord. Tr’g Reg’t. Aberdeen Proving Ground Maryland.
Hoping for a[n] early peace. Very Truly Yours, Mrs. M. Goldberg
P.S. Jerry has a sweet tooth. [Transcription ends
Robert N. Goldberg
No full textROBERT N. GOLDBERG
NBS/NIST: 1969-2008
INDUCTED: 2016
B: 11 December 1943, Stamford, Connecticut
EDUCATION:
The Johns Hopkins University, BS (Chemistry), 1965 Carnegie-Mellon University, PhD (Physical Chemistry), 1969 Postdoctoral fellowship, Mellon Institute and the University of Pittsburgh, 1968-1969
CITATION:
For pioneering research in microcalorimetry in conjunction with extensive studies on the thermodynamics of enzyme-catalyzed reactions of great significance to both biotechnology and fundamental biochemistry, and for assembling the world's largest bio-thermodynamic database, i.e. the Thermodynamics of Enzyme-catalyzed Reactions Database.
POSITIONS HELD AT NBS/NIST:
Research Scientist, Biochemical Science Division, Chemical Science and Technology Laboratory (CSTL), 1969-2002 Group Leader, Bioprocess Measurements, Biochemical Science Division, CSTL, 2002-2004
Acting Chief, Biochemical Science Division, CSTL, 2005-2006
Team Leader, Biospectroscopy Group, Biochemical Science Division, CSTL, 2006
Group Leader, Biospectroscopy, Biochemical Science Division, CSTL, 2007-2008
Scientist Emeritus, Biosystems and Biomaterials Division, Material Measurement Laboratory, 2008-present
HONORS:
Fellow, American Institute of Chemists
Phi Lambda Upsilon
Sigma Xi
NIST Measurement Services Award (1995)
Honorary Fellow, Center for Advanced Research and Biotechnology
MEMBERSHIPS:
ASTM International
BioPax
Calorimetry Conference
IUPAC Commissions: Chemical Thermodynamics and Commission on Biophysical Chemistry (Vice-Chair) Editorial Advisory Board, Handbook of Chemistry and Physics
Guest Editor, Journal of Physical Chemistry Band Journal of Chemical Thermodynamics
PUBLICATIONS:
More than 150 publications including:
Goldberg, R.N., "Thermodynamics of Hexokinase Catalyzed Reactions," Biophys. Chem. 3, 192-205 (1975) Tewari, Y.B. and Goldberg, R.N., "Thermodynamics of the Conversion of Aqueous Glucose to Fructose," J. Solution
Chem. 13, 523-547 (1984)
Goldberg, R.N. and Tewari, Y.B., "Thermodynamic and Transport Properties of Carbohydrates and their
Monophosphates: the Pentoses and Hexoses," J. Phys. Chem. Ref Data 18, 809-880 (1989)
Rekharsky, M.V., Goldberg, R.N., Schwarz, F.P., Tewari, Y.B., Ross, P.D., Yamashoji, Y., and Inoue, Y.,
"Thermodynamic and Nuclear Magnetic Resonance Study of the Interactions of α- and β-Cyclodextrin with Model
Substances: Phenethylamine, Ephedrines, and Related Substances," J. Am. Chem. Soc. 117, 8830-8840 (1995) Akers D.L. and Goldberg, R.N., "BioEqCalc: A Package for Performing Equilibrium Calculations on Biochemical
Reactions," Mathematica Journal 8, 86-113 (2001)
Goldberg, R.N., Schliesser, J., Mittal, A., Decker, S.R., Santos, A.F.L.O.M., Freitas, V.L.S., Urbas, A., Lang, B.E., Heiss, C., Ribeiro da Silva, M.D.M.C., Woodfield, B.F., Katahira, R., Wang, W., and Johnson, D.K.,
"A Thermodynamic Investigation of the Cellulose Allomorphs: Cellulose(Am), Cellulose lβ(Cr), Cellulose ll(Cr), and Cellulose IIl(Cr)", J. Chem. Thermodyn. 81, 184-226 (2015
Sample-Based Proofs of Proximity
No full textSuppose we have random sampling access to a huge object, such as a graph or a database. Namely, we can observe the values of random locations in the object, say random records in the database or random edges in the graph. We cannot, however, query locations of our choice. Can we verify complex properties of the object using only this restricted sampling access?
In this work, we initiate the study of sample-based proof systems, where the verifier is extremely constrained; Given an input, the verifier can only obtain samples of uniformly random and i.i.d. locations in the input string, together with the values at those locations. The goal is verifying complex properties in sublinear time, using only this restricted access. Following the literature on Property Testing and on Interactive Proofs of Proximity (IPPs), we seek proof systems where the verifier accepts every input that has the property, and with high probability rejects every input that is far from the property.
We study both interactive and non-interactive sample-based proof systems, showing:
- On the positive side, our main result is that rich families of properties / languages have sub-linear sample-based interactive proofs of proximity (SIPPs). We show that every language in NC has a SIPP, where the sample and communication complexities, as well as the verifier’s running time, are Õ(√n), and with polylog(n) communication rounds. We also show that every language that can be computed in polynomial-time and bounded-polynomial space has a SIPP, where the sample and communication complexities of the protocol, as well as the verifier’s running time are roughly √n, and with a constant number of rounds.
This is achieved by constructing a reduction protocol from SIPPs to IPPs. With the aid of an untrusted prover, this reduction enables a restricted, sample-based verifier to simulate an execution of a (query-based) IPP, even though it cannot query the input. Applying the reduction to known query-based IPPs yields SIPPs for the families described above.
- We show that every language with an adequate (query-based) property tester has a 1-round SIPP with constant sample complexity and logarithmic communication complexity. One such language is equality testing, for which we give an explicit and simple SIPP.
- On the negative side, we show that interaction can be essential: we prove that there is no non-interactive sample-based proof of proximity for equality testing.
- Finally, we prove that private coins can dramatically increase the power of SIPPs. We show a strong separation between the power of public-coin SIPPs and private-coin SIPPs for Equality Testing
Frugality Ratios and Improved Truthful Mechanisms for Vertex Cover
No full textIn set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay as little as possible. Examples of this setting include shortest-path auctions and vertex-cover auctions. Recently, Karlin, Kempe and Tamir introduced a new definition of frugality ratio for this problem. Informally, the "frugality ratio" is the ratio of the total payment of a mechanism to a desired payment bound. The ratio captures the extent to which the mechanism overpays, relative to perceived fair cost in a truthful auction. In this paper, we propose a new truthful polynomial-time auction for the vertex cover problem and bound its frugality ratio. We show that the solution quality is with a constant factor of optimal and the frugality ratio is within a constant factor of the best possible worst-case bound; this is the first auction for this problem to have these properties. Moreover, we show how to transform any truthful auction into a frugal one while preserving the approximation ratio. Also, we consider two natural modifications of the definition of Karlin et al., and we analyse the properties of the resulting payment bounds, such as monotonicity, computational hardness, and robustness with respect to the draw-resolution rule. We study the relationships between the different payment bounds, both for general set systems and for specific set-system auctions, such as path auctions and vertex-cover auctions. We use these new definitions in the proof of our main result for vertex-cover auctions via a bootstrapping technique, which may be of independent interest
О (n+1)-тканях многомерных поверхностей
No full text[Goldberg V.; Goldberg Vladislav V.; Голдберг В.; Гольдберг В. В.]Russian. Bulgarian, English summar
Feedback Numbers of Goldberg Snark, Twisted Goldberg Snarks and Related Graphs
No full textA subset of vertices of a graph G is called a feedback vertex set of G if its removal results in an acyclic subgraph. The minimum cardinality of a feedback vertex set is called the feedback number. In this paper, we determine the exact values of the feedback numbers of the Goldberg snarks Gn and its related graphs Gn*, Twisted Goldberg Snarks TGn and its related graphs TGn*. Let f(n) denote the feedback numbers of these graphs, we prove that f(n)=2n+1, for n≥3
Feedback Numbers of Goldberg Snark, Twisted Goldberg Snarks and Related Graphs
No full textA subset of vertices of a graph G is called a feedback vertex set of G if its removal results in an acyclic subgraph. The minimum cardinality of a feedback vertex set is called the feedback number. In this paper, we determine the exact values of the feedback numbers of the Goldberg snarks Gn and its related graphs Gn*, Twisted Goldberg Snarks TGn and its related graphs TGn*. Let f(n) denote the feedback numbers of these graphs, we prove that f(n)=2n+1, for n≥3
NYT Columnist Michelle Goldberg on Republican Misogynists, and Walter J. Ong's Thought
No full textSee the above abstract.In my 2,443-word review essay "NYT Columnist Michelle Goldberg on Republican Misogynists, and Walter J. Ong's Thought," I comment on the liberal NYT columnist Michelle Goldberg's column titled "Repibican Women Suddenly Realize They're Surrounded by Misogynists" in The New Yorks (dated December 9, 2025). I succinctly highlight my life and work with special attention to my controversial OEN articles in 2024 and 2025. I also succintly highlight my former teacher Walrer J. Ong's work. In my 2,443-word review essay, I refer to 13 of my OEN articles in 2024 and 2025. I mention Ong by name 12 times and Donald Trump by name 19 times.N/AFarrell, Thomas. (2025). NYT Columnist Michelle Goldberg on Republican Misogynists, and Walter J. Ong's Thought. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/277651
Recommended from our members
Minimum Cost Flows in Graphs with Unit Capacities
No full textWe consider the minimum cost flow problem on graphs with unit capacities and its special cases. In previous studies, special purpose algorithms exploiting the fact that capacities are one have been developed.
In contrast, for maximum flow with unit capacities, the best bounds are proven for slight modifications of classical blocking flow and push-relabel algorithms.
In this paper we show that the classical cost scaling algorithms of Goldberg and Tarjan (for general integer capacities) applied to a problem with unit capacities achieve or improve the best known bounds.
For weighted bipartite matching we establish a bound of O(\sqrt{rm}\log C) on a slight variation of this algorithm. Here r is the size of the smaller side of the bipartite graph, m is the number of edges, and C is the largest absolute value of an arc-cost. This simplifies a result of [Duan et al. 2011] and improves the bound, answering an open question of [Tarjan and Ramshaw 2012]. For graphs with unit vertex capacities we establish a novel O(\sqrt{n}m\log(nC)) bound. We also give the first cycle canceling algorithm for minimum cost flow with unit capacities. The algorithm naturally generalizes the single source shortest path algorithm of [Goldberg 1995]
- …
