An official website of the United States government
I am deeply humbled and honored to receive the American Society for Cell Biology (ASCB) Prize for Excellence in Inclusivity. Thank you to the ASCB for recognizing the contributions of faculty to inclusion and diversity in STEM and the importance of this for the advancement of science. Thank you to the Howard Hughes Medical Institute (HHMI) for your generous support of inclusivity. The prize money will be used to fund outreach activities aimed at increasing inclusion in science and to create research opportunities for students from underrepresented groups in the sciences. In this essay, I share bits of my life’s story that I hope will resonate with a broad audience, especially students from underrepresented groups in STEM, and that drive my passion for inclusion and diversity. I provide points of consideration for students to enhance their preparation for science careers and for faculty to improve the current landscape of inclusion and diversity in STEM.
more »
« less
Selection of Hyperspectral Endmember Extraction Algorithm for Tumor Delineation in Animal Models
Advanced algorithms used in geospatial imaging were adopted for biomedical application to analyze hyperspectral datasets. To demonstrate the effectiveness, endmember extractions method was applied for delineating tumors in animal models of cancer.
more »
« less
- Award ID(s):
- 1827656
- PAR ID:
- 10283610
- Date Published:
- Journal Name:
- Biophotonics Congress 2021 OSA Technical Digest (Optical Society of America, 2021), paper OF2E.2
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Modern operating systems allow user-space applications to submit code for kernel execution through the use of in-kernel domain specific languages (DSLs). Applications use these DSLs to customize system policies and add new functionality. For performance, the kernel executes them via just-in-time (JIT) compilation. The correctness of these JITs is crucial for the security of the kernel: bugs in in-kernel JITs have led to numerous critical issues and patches. This paper presents JitSynth, the first tool for synthesizing verified JITs for in-kernel DSLs. JitSynth takes as input interpreters for the source DSL and the target instruction set architecture. Given these interpreters, and a mapping from source to target states, JitSynth synthesizes a verified JIT compiler from the source to the target. Our key idea is to formulate this synthesis problem as one of synthesizing a per-instruction compiler for abstract register machines. Our core technical contribution is a new compiler metasketch that enables JitSynth to efficiently explore the resulting synthesis search space. To evaluate JitSynth, we use it to synthesize a JIT from eBPF to RISC-V and compare to a recently developed Linux JIT. The synthesized JIT avoids all known bugs in the Linux JIT, with an average slowdown of 1.82x in the performance of the generated code. We also use JitSynth to synthesize JITs for two additional source-target pairs. The results show that JitSynth offers a promising new way to develop verified JITs for in-kernel DSLs.more » « less
-
null (Ed.)In answer to calls for research about professional change, this study addressed the question: What is involved in college science faculty readiness for change in instructional practice? The setting was a professional development experience in oceanography/marine science and paleoclimatology among 32 faculty from 2- and 4-year colleges. Ten of the 32 participated in interviews, and all provided survey responses and documents used in the study. Cycles of inductive analysis generated three example case stories to illustrate a new model for exploring faculty readiness for change in teaching. The model blends results from the health sciences on readiness for behavioral change with research on the personal, external, professional, and consequence domains of a professional change environment. The blended model attends to how an instructor draws on the domains to (a) see an instructional challenge as requiring intentional action to be resolved; (b) notice new significance (for the instructor) in some aspect of instructional practice; (c) feel able to manage instructional stressors/challenges; (d) have commitment to initiate/sustain change; and (e) perceive adequate support in undertaking change. Profiles of instructional readiness for change are represented by composite cases named Lee, Pat, and Chris. In the case of Lee, factor (c) drove change efforts; for Pat, factors (a) and (b) were in the forefront; and for Chris it was factors (d) and (e). The three cases are valuable both as sketches of the blended model in use and as touchstones for future research and development related to postsecondary faculty professional learning.more » « less
-
The purpose of this proceeding is to share a validity argument for the Problem-solving Measure for grade 5 (PSM5). The PSM5 is one test in the PSM series, which is designed for grades 3-8. PSMs are intended to measure students’ problem-solving performance related to the Common Core State Standards for Mathematics (i.e., content and practices). In addition to sharing validity evidence connected to the PSM5, we discuss implications for its use in current research and practice.more » « less
-
null (Ed.)Constraint satisfaction problems (CSP's) and data stream models are two powerful abstractions to capture a wide variety of problems arising in different domains of computer science. Developments in the two communities have mostly occurred independently and with little interaction between them. In this work, we seek to investigate whether bridging the seeming communication gap between the two communities may pave the way to richer fundamental insights. To this end, we focus on two foundational problems: model counting for CSP's and computation of zeroth frequency moments $$(F_0)$$ for data streams. Our investigations lead us to observe striking similarity in the core techniques employed in the algorithmic frameworks that have evolved separately for model counting and $$F_0$$ computation. We design a recipe for translation of algorithms developed for $$F_0$$ estimation to that of model counting, resulting in new algorithms for model counting. We then observe that algorithms in the context of distributed streaming can be transformed to distributed algorithms for model counting. We next turn our attention to viewing streaming from the lens of counting and show that framing $$F_0$$ estimation as a special case of DNF counting allows us to obtain a general recipe for a rich class of streaming problems, which had been subjected to case-specific analysis in prior works. In particular, our view yields a state-of-the art algorithm for multidimensional range efficient $$F_0$$ estimation with a simpler analysis.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- The DOI is not currently available.
