126,331 research outputs found
Ruth B. Greenbaum talks about her association with the Friends of Kresge Art Museum on the campus of Michigan State University
Gift of the MSU Faculty Emeriti Association.Ruth B. Greenbaum talks about her association with the Friends of Kresge Art Museum on the campus of Michigan State University. Greenbaum recounts her family life, education, marriage and coming to East Lansing in 1969 with her husband Dr. David Greenbaum, who took a position in the College of Human Medicine. Greenbaum talks about her own work as a pediatric nurse and explains how she became involved with Kresge after her retirement. She describes her docent training and community outreach programs run by the museum. Greenbaum is interviewed by retired MSU Professor Pauline Adams for the Michigan State University Faculty Emeriti Association Oral History Project
Letter from J. B. McIntosh to E. S. Parker with bond, 1869
Enclosed corrected bond and license of Messrs. Greenbaum & Co. Traders at Hoopa Valley
The Jewish child's Memo Books
Standard Books of Religious Knowledge. Author: Rabbi I. Greenbaum. Book 1 (green) - 2nd edition, 2nd IMP., 23 b/w ills. + cover ill. Book 2 (Orange) - 2nd edition, 32 b/w ills. + cover ill. Book 3 (light blue) 16 b/w ills. (incl. map) + cover ill. Book 4 (red) 13 b/w ills. (incl. map) + cover ill. Book 5 (beige) - 1962, 17 b/w ills. + cover ill. Publisher: J.C.M.B. Publications. ; 24 pp. (each). w. box. a-eDigital imagedigitize
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Dispelling the Myths Behind First-author Citation Counts
We conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Innovation through radical circles: Insights from organizational transformation of a middle school
Letter from J. Greenbaum to E. S. Parker, 1870
Enclosed vouchers of Dr. G. B. Higginbotham, late surgeon at Hoopa Valley Indian Reservation
Computations and Analysis with Non-normal Matrices
Thesis (Ph.D.)--University of Washington, 2025The goal of this dissertation is to introduce some new iterative methods for solving problems involving non-Hermitian matrices and to add to our understanding of the convergence of these algorithms when applied to highly non-normal matrices. In the first part, the Arnoldi-OR algorithm [23] is introduced. Given an n by n matrix A and a rational function N (z)/D(z), where D(A) is nonsingular, this algorithm finds the approximations x_k, k = 1, 2, . . ., from successive Krylov subspaces, span{b, Ab, . . . , A^(k−1)b}, that minimize the 2-norm of the residual, ∥D(A)x_k −N(A)b∥_2 . Convergence of the Arnoldi-OR algorithm can be bounded based on the eigenvalues of A and the condition number of the best-conditioned matrix of eigenvectors, assuming that A is diagonalizable. This may be a large overestimate, however, if the best-conditioned matrix of eigenvectors is still very ill-conditioned. Starting in Chapter 4, the second part of this dissertation explores bounds on the norm of a function of A that can be applied when A is highly non-normal; i.e., either A is not diagonalizable or it is diagonalizable but the eigenvalues are very ill-conditioned. These bounds involve the ∞-norm of the function, not just on the eigenvalues of A, but on a larger set in the complex plane containing the eigenvalues. In the second part of the dissertation, we expand on some known results from Crouzeix and Palencia (2017) and Crouzeix and Greenbaum(2019) about K-spectral sets—sets Ω ⊂ C satisfying ∥f(A)∥ 2 ≤ K sup z∈Ω |f (z)| for all functions f analytic in Ω, (i.e. functions that can be arbitrarily well-approximated on Ω by rational functions with no poles in Ω). This work is described in Greenbaum and Wellen (2025). Here, we use it to give alternative bounds on the 2-norm of the residual in the Arnoldi-OR algorithm. We also consider a different way of solving non-Hermitian linear systems, which is to convert the problem to a Hermitian one, in Section 2.2. If one can find Hermitian positive definite matrices M and Y such that A = M −1 Y, then one can solve Ax = b using the conjugate gradient method (CG) applied to the system Yx = Mb with M as a preconditioner. We apply this technique to a problem involving the graph Laplacian that is of interest to Sandia National Laboratory, where I worked with Richard Lehoucq over the summer of 2023
sj-docx-1-jom-10.1177_01492063231153135 - Supplemental material for The Construct of Bottom-Line Mentality: Where We’ve Been and Where We’re Going
Supplemental material, sj-docx-1-jom-10.1177_01492063231153135 for The Construct of Bottom-Line Mentality: Where We’ve Been and Where We’re Going by Rebecca L. Greenbaum, Mary B. Mawritz and Nazifa N. Zaman in Journal of Management</p
Two new siloxanic proton conducting membranes - Part II. Proton conductivity mechanism and NMR study
The synthesis and structural characterization of two types of membranes with formulas {Si(CH3)3O[Si(CH3)HO]21.26–[Si(CH3)((CH2)3–SO3H)O]1.8-[Si(CH3)((CH2)3Si(CH3)2O-)-O]14-Si(CH3)3}n (A) and {Si(CH3)3O[Si(CH3)HO]21.26-[Si(CH3)((CH2)3SO3H)O]1.8-[Si(CH3)((CH2)3(Si(CH3)2O-)w)-O]v[Si(CH3)((CH2)3Si(CH3)2O-)-O]14−vSi(CH3)3}n (B), (w = 20.31), were previously proposed.
The ac electrical response of A and B was fully characterized in the 40 Hz–2 MHz frequency region by studying the impedance spectra in the medium and low frequency regions by equivalent circuits and complex dielectric spectra at high frequency in terms of dielectric relaxation modes. Results demonstrated that A and B conduct ionically by means of a proton exchange event which occurs via a vehicular mechanism between neighboring water clusters formed by water molecules aggregated around each sulfonic acid group of the siloxane side chains. The proton conductivities at 115°C of ca. 1.9 × 10−3 and 1.8 × 10−4 S/cm−1 of fully hydrated membranes A and B, respectively, classify these silicone networks as good proton conductors.
Membrane B was chosen for a closer investigation using NMR spectroscopy. Solid state 29Si MAS NMR experiments gave further insight about the three-dimensional structure. Proton diffusion measurements provided some encouraging results about proton dynamics of this membrane signaling the great potential of siloxanic based proton conductors
- …
