[ { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/kynwc-csv02", "doi": "10.7907/h314-4x51", "_Key": "kynwc-csv02", "date": "2023-08-07", "type": "teaching_resource", "title": "Data Departure Checklist", "rights": "The checklist is made available under a Creative Commons Attribution-NonCommercial 4.0 International license.", "lastmod": "2023-10-20 21:48:35", "abstract": "The Data Departure Checklist (DDC) helps research teams and individuals plan for when a team member is leaving a project, lab, team, or institution. By providing a series of prompts for the departing personnel (DP) and a project administrator (PA) to review and check off, use of the DDC encourages successful planning for transition and will, ideally, prevent data loss or misunderstandings about data ownership and use or future reuse. The DDC can also be used in the event of an unexpected departure of a team member in order to transfer documents prior to the DP's ID expiration and machines being wiped, and to prompt others to confirm that access to data storage and all relevant physical or digital locations has been removed. This document is intended to facilitate conversations between the DP and the primary investigator and/or the institution in order to provide customizable standardized guidance to facilitate transitions. It should serve only as a supplement to any legal or contractual obligations between the individual and the institution.", "creators": { "items": [ { "id": "Goben-Abigail", "name": { "given": "Abigail", "family": "Goben" }, "orcid": "0000-0002-6520-3648" }, { "id": "Briney-Kristin-A", "name": { "given": "Kristin A.", "family": "Briney" }, "orcid": "0000-0003-1802-0184" } ] }, "date_type": "published", "datestamp": "2023-08-20 16:58:08", "id_number": "CaltechAUTHORS:20230807-174313004", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230807-174313004", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/v1x74-4ae86", "doi": "10.7907/syk7-3z92", "_Key": "v1x74-4ae86", "date": "2023-06-27", "note": "
Presentation - 2023-06-26_PostDocLaunch.pdf
Presentation - 2023-06-26_PostDocLaunch.pptx
", "type": "teaching_resource", "title": "Leveling Up Data Management", "rights": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "lastmod": "2023-10-23 21:39:35", "abstract": "It is a truth universally acknowledged that a researcher in possession of data must be in want of better data management. Good data management means spending less time searching for old data files, always remembering the details of each experiment (because you wrote them down), and never losing your work even if your hard drive crashes. This talk highlights several fundamental data management practices that you can integrate into your research processes that will make it easier to find, use, and manage your data years into the future.", "creators": { "items": [ { "id": "Briney-Kristin-A", "name": { "given": "Kristin A.", "family": "Briney" }, "orcid": "0000-0003-1802-0184" } ] }, "date_type": "published", "datestamp": "2023-09-15 07:51:38", "id_number": "CaltechAUTHORS:20230626-213815212", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230626-213815212", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/txnef-46v83", "doi": "10.7907/4q49-hm72", "_Key": "txnef-46v83", "date": "2023-02-24", "note": "EPSRC Summer School on Modal Decompositions in Fluid Mechanics, University of Cambridge, 5-8 August 2019.\n\nAccepted Version - Resolvent-applications_McKeon.pdf
", "type": "teaching_resource", "title": "Applications of resolvent analysis in fluid mechanics", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2023-10-25 14:42:37", "abstract": "These notes are intended to provide a description of some aspects of applications of resolvent analysis in fluid mechanics. They are targeted at students beginning research in this or related area, with the goal of providing a bridge between the generic linear algebra of textbooks and the archival journal articles implementing these techniques. \n\nWith regards to mathematical techniques, a working understanding of fundamental concepts of linear algebra, and in particular the singular value decomposition, as well a familiarity with the goals underlying modal analysis are assumed. Requiring more background in fluid mechanics, the reader will already be familiar with the formulation of resolvent analysis from the Navier-Stokes equations. These notes outline approaches to gaining insight into the characteristics of fluid system by viewing the governing equations in terms of linear dynamics driven by endogenous (nonlinear) or exogenous forcing. Such systems may exhibit laminar or turbulent behavior, may be forced or unforced, and may perhaps be under the influence of control actuation. \n\nPhysical interpretation of resolvent modes, the importance of mode weights and techniques for data reconstruction, and the incorporation of control into the analysis are covered.", "creators": { "items": [ { "id": "McKeon-B-J", "name": { "given": "Beverley", "family": "McKeon" }, "orcid": "0000-0003-4220-1583" } ] }, "date_type": "published", "datestamp": "2023-08-19 16:50:00", "id_number": "CaltechAUTHORS:20230224-222303039", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230224-222303039", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/dxcn3-4dk21", "doi": "10.7907/0ycw-e631", "_Key": "dxcn3-4dk21", "date": "2022-12-15", "note": "Updated - NIH-DMSP_Guidance.pdf
", "type": "teaching_resource", "title": "Caltech NIH Data Management and Sharing Plan (DMSP) Guidance", "rights": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "lastmod": "2023-10-24 23:20:04", "abstract": "Caltech-specific guidance on creating an NIH Data Management and Sharing Plan (DMSP). The handout covers: writing a DMSP, choosing a data repository, sharing large data, data types that require special consideration, and further resources. The guidance includes links to many Caltech and NIH resources.", "creators": { "items": [ { "id": "Briney-Kristin-A", "name": { "given": "Kristin A.", "family": "Briney" }, "orcid": "0000-0003-1802-0184" }, { "id": "Morrell-Thomas-E", "name": { "given": "Thomas", "family": "Morrell" }, "orcid": "0000-0001-9266-5146" } ] }, "date_type": "published", "datestamp": "2023-08-20 08:50:06", "id_number": "CaltechAUTHORS:20221215-230526515", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20221215-230526515", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/gk5ks-5rf19", "doi": "10.7907/rt4k-2d76", "_Key": "gk5ks-5rf19", "date": "2022-11-22", "type": "teaching_resource", "title": "Research Data Documentation Methods", "rights": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "lastmod": "2023-10-24 22:43:19", "abstract": "This handout summarizes a range of documentation methods for research data, including: laboratory notebook, e-lab notebook, README.txt, template, data dictionary, codebook, metadata schema, standard, and taxonomy. The handout describes when to apply each documentation type and what information the method covers. \n\nThank you to Megan O'Donnell (ORCID: 0000-0002-4632-6642) for her valuable feedback.", "creators": { "items": [ { "id": "Briney-Kristin-A", "name": { "given": "Kristin A.", "family": "Briney" }, "orcid": "0000-0003-1802-0184" } ] }, "date_type": "published", "datestamp": "2023-08-20 06:23:04", "id_number": "CaltechAUTHORS:20221121-220219246", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20221121-220219246", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/9pm6f-czj79", "doi": "10.7907/x2g2-v221", "_Key": "9pm6f-czj79", "date": "2022-11-18", "note": "Accepted Version - DMSP_Example.pdf
", "type": "teaching_resource", "title": "Caltech Example Data Management and Sharing Plan", "rights": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "lastmod": "2023-10-20 21:48:58", "abstract": "The example data management plan describes data management for a microscopy project and uses the general NIH template. Always refer to the specific guidance for your grant proposal and ICO when writing a data management plan, as requirements differ.", "creators": { "items": [ { "id": "Briney-Kristin-A", "name": { "given": "Kristin A.", "family": "Briney" }, "orcid": "0000-0003-1802-0184" }, { "id": "Morrell-Thomas-E", "name": { "given": "Thomas", "family": "Morrell" }, "orcid": "0000-0001-9266-5146" } ] }, "date_type": "published", "datestamp": "2023-09-05 23:54:14", "id_number": "CaltechAUTHORS:20221117-232247069", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20221117-232247069", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/wq7jj-dgk04", "_Key": "wq7jj-dgk04", "date": "2022-06-03", "note": "Submitted - Ch_226_Final_Paper.pdf
", "type": "teaching_resource", "title": "Notes on two-photon microscopy", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2023-10-24 15:17:09", "abstract": "Two-photon microscopy allows for the imaging of both fixed and live tissues orders of magnitude deeper than what is possible with standard widefield microscopy techniques and does so at higher resolutions than those conventional techniques. There are numerous structures that were previously unable to be imaged in live specimens until the development of two-photon microscopy due to their depth in the tissue. While confocal microscopy can also image deeper into tissues than conventional widefield techniques, the penetration depth is still insufficient for many biological structures of interest. Before the development of two-photon microscopy, the primary methods for imaging such structures were tissue sectioning and scaling, i.e. making the tissues transparent via soaking in chemical solvents. Both of these methods are incompatible with living samples, and while they can also achieve two-photon-like resolutions, they cannot visualize any dynamics. Two-photon microscopy exploits the nonlinearity of its namesake effect, and by only exciting near the waist of the beam in the imaging plane, is able to achieve millimeter-depth imaging in tissues at higher resolutions.", "creators": { "items": [ { "id": "Yoshida-Shawn-R", "name": { "given": "Shawn", "family": "Yoshida" }, "orcid": "0000-0002-0866-2741" } ] }, "date_type": "published", "datestamp": "2023-08-20 07:47:01", "id_number": "CaltechAUTHORS:20220603-000125134", "publisher": "Caltech Library", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220603-000125134", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/8bty3-2cx10", "doi": "10.7907/geda-h205", "_Key": "8bty3-2cx10", "date": "2022-04-13", "note": "© 2020 Joel A. Tropp. \n\nTypeset on December 19, 2018.\n\nAccepted Version - acm204-f18-lectures-convex-LN.pdf
", "type": "teaching_resource", "title": "ACM 204: Lectures on Convex Geometry", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2024-01-15 21:26:06", "abstract": "ACM 204, Winter 2019", "creators": { "items": [ { "id": "Tropp-J-A", "name": { "given": "Joel A.", "family": "Tropp" }, "orcid": "0000-0003-1024-1791" } ] }, "date_type": "published", "datestamp": "2023-08-19 14:39:46", "id_number": "CaltechAUTHORS:20220412-220319430", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220412-220319430", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/5nab2-9rw31", "doi": "10.7907/m421-yb89", "_Key": "5nab2-9rw31", "date": "2022-04-13", "note": "© 2022 Joel A. Tropp. \n\nTypeset on August 22, 2022. \n\nThese notes were transcribed by students taking the course in Winter 2022. They are Eray Atay, Jag Boddapati, Edoardo Calvello, Ruizhi Cao, Anthony (Chi-Fang) Chen, Nicolas Christianson, Matthieu Darcy, Rohit Dilip, Ethan Epperly, Salvador Gomez, Taylan Kargin, Eitan Levin, Elvira Moreno, Nicholas Nelson, Roy (Yixuan) Wang, and Jing Yu. Without their care and attention, we would not have such an excellent record.\n\nAccepted Version - acm204-w22-matrix-analysis-sm.pdf
", "type": "teaching_resource", "title": "ACM 204: Matrix Analysis", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2024-01-15 21:26:12", "abstract": "These lecture notes document ACM 204 as taught in Winter 2022, and they are primarily intended as a reference for students who have taken the class. The notes are prepared by student scribes with feedback from the instructor. The notes have been edited by the instructor to try to correct his own failures of presentation. All remaining errors and omissions are the fault of the instructor. \n\nPlease be aware that these notes reflect material presented in a classroom, rather than a formal scholarly publication. In some places, the notes may lack appropriate citations to the literature. There is no claim that the arrangement or presentation of the material is primarily due to the instructor. \n\nThe notes also contain the projects of students who wished to share their work. They received feedback and made revisions, but the projects have not been edited. They represent the students' individual work.", "creators": { "items": [ { "id": "Tropp-J-A", "name": { "given": "Joel A.", "family": "Tropp" }, "orcid": "0000-0003-1024-1791" } ] }, "date_type": "published", "datestamp": "2023-08-20 07:08:46", "id_number": "CaltechAUTHORS:20220412-221559139", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220412-221559139", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/871kb-raq54", "doi": "10.7907/mxr0-c422", "_Key": "871kb-raq54", "date": "2022-04-13", "note": "© 2021 Joel A. Tropp. \n\nTypeset on April 14, 2022. \n\nThese notes have been transcribed from the lectures by the participants in the course: Chi-Fang Chen, Yifan Chen, Anushri Dixit, Ethan Epperly, Hamed Hamze, Hsin-Yuan Huang, Taylan Kargin, Eitan Levin, Jack Li, Serena Liu, Riley Murray, Nicholas H. Nelson, Joe Slote, Roy Wang, Jing Yu, Kevin Yu, Ziyun Zhang. Many thanks are due for their care and diligence. All remaining errors are the fault of the instructor.\n\nUpdated - Tro21-Probability-High-LN-corr.pdf
", "type": "teaching_resource", "title": "ACM 217: Probability in High Dimensions", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2024-01-15 21:26:10", "abstract": "ACM 217 is a second-year graduate course on high-dimensional probability, designed for students in computing and mathematical sciences. We discuss phenomena that emerge from probability models with many degrees of freedom, tools for working with these models, and a selection of applications to computational mathematics. \n\nThe Winter 2021 edition of ACM 217 is the fourth instantiation of a class that initially focused on concentration inequalities and that has expanded to include other topics in high-dimensional probability. This year, the course was more mathematical than some previous editions, with less attention to tools and applications. This slant may not serve applied students well, and it is likely that future versions of the course will strike a different balance between theory and practice. \n\nThese lecture notes document ACM 217 as it was taught in Winter 2021. The notes are being transcribed by the students as part of their coursework, and they are edited lightly by the instructor. They are intended as a record for the students who have taken the course. Other readers should beware that this course is neither refined nor especially coherent. There is no warranty about correctness. Furthermore, these notes have been prepared using many sources and without appropriate scholarly citations.", "creators": { "items": [ { "id": "Tropp-J-A", "name": { "given": "Joel A.", "family": "Tropp" }, "orcid": "0000-0003-1024-1791" } ] }, "date_type": "published", "datestamp": "2023-08-20 02:08:10", "id_number": "CaltechAUTHORS:20220412-221302767", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220412-221302767", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/xq646-3wr88", "doi": "10.7907/my9r-p178", "_Key": "xq646-3wr88", "date": "2022-04-13", "note": "© 2019 Richard J. Keung.\n\nAccepted Version - acm270-s19-tensors-LN.pdf
", "type": "teaching_resource", "title": "ACM 270: Quantum and classical information processing with tensors", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2024-01-15 21:26:08", "abstract": "[no abstract]", "creators": { "items": [ { "id": "Kueng-Richard-J", "name": { "given": "Richard", "family": "Kueng" }, "orcid": "0000-0002-8291-648X" } ] }, "date_type": "published", "datestamp": "2023-08-19 16:09:42", "id_number": "CaltechAUTHORS:20220412-220843410", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220412-220843410", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/0na16-j0x38", "doi": "10.7907/nwsv-df59", "_Key": "0na16-j0x38", "date": "2021-04-21", "note": "© 2020 Joel A. Tropp. \n\nTypeset on April 21, 2021. \n\nThe Winter 2020 edition of ACM 204 is the first instantiation of a course on randomized matrix computations. At a high level, the course is organized along the same lines as the survey [MT20]. In contrast to the survey, the course contains full proofs of the major results. Some parts of the class are modeled on the short course [Tro19]; the material on sparse Cholesky has been omitted from these notes because it has been carefully documented in the existing notes. \n\nThe course notes were transcribed from the lectures by the students as part of their coursework, so they reflect the actual content of the course. The notes have been closely edited by Dr. Richard Kueng, with additional light editing by the instructor. \n\nThere is no warranty about the correctness of these notes. Furthermore, material is not necessarily accompanied by appropriate citations to the literature. \n\nThese notes were prepared with the assistance of students and postdocs who participated in the course: Dmitry Burov, Po-Chih Chen, Yifan Chen, Nikola Kovachki, Riley Murray, Richard Kueng, Zongyi Li, Chung-Yi Lin, Fariborz Salehi, Jiace Sun, Oguzhan Teke, Jing Yu, Shumao Zhang, and Ziyun Zhang. Richard Kueng prepared the complete set of notes from the individual lectures. Many thanks are due to them for their care and diligence. All remaining errors are the fault of the instructor.\n\nAccepted Version - Tro20-Randomized-Algorithms-LN.pdf
", "type": "teaching_resource", "title": "ACM 204: Randomized Algorithms for Matrix Computations", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2024-01-15 21:22:43", "abstract": "ACM 204 is a graduate course on randomized algorithms for matrix computations. It was taught for the first time in Winter 2020. \n\nThe course begins with Monte Carlo algorithms for trace estimation. This is a relatively simple setting that allows us to explore how randomness can be used for matrix computations. We continue with a discussion of the randomized power method and the Lanczos method for estimating the largest eigenvalue of a symmetric matrix. For these algorithms, the randomized starting point regularizes the trajectory of the iterations. The Lanczos iteration and randomized trace estimation fuse together in the stochastic Lanczos quadrature method for estimating the trace of a matrix function. \n\nThen we turn to Monte Carlo sampling methods for matrix approximation. This approach is justified by the matrix Bernstein inequality, a powerful tool for matrix approximation. As a simple example, we develop sampling methods for approximate matrix multiplication. \n\nIn the next part of the course, we study random linear embeddings. These are random matrices that can reduce the dimension of a dataset while approximately preserving its geometry. First, we treat Gaussian embeddings in detail, and then we discuss structured embeddings that can be implemented using fewer computational resources. Afterward, we describe several ways to use random embeddings to solve\nover-determined least-squares problems. \n\nWe continue with a detailed treatment of the randomized SVD algorithm, the most widely used technique from this area. We give a complete a priori analysis with detailed error bounds. Then we show how to modify this algorithm for the streaming setting, where the matrix is presented as a sequence of linear updates. Last, we show how to develop an effective algorithm for selecting influential columns and rows from a matrix to obtain skeleton or CUR factorizations. \n\nThe next section of the course studies kernel matrices that arise in high-dimensional data analysis. We discuss positive-definite kernels and outline the computational issues associated with solving linear algebra problems involving kernels. We introduce random feature approximations and Nyström approximations based on randomized sampling. This area is still not fully developed. \n\nThe last part of the course gives a complete presentation of the sparse Cholesky algorithm of Kyng & Sachdeva [KS16], including a full proof of correctness.", "creators": { "items": [ { "id": "Tropp-J-A", "name": { "given": "Joel A.", "family": "Tropp" }, "orcid": "0000-0003-1024-1791" } ] }, "date_type": "published", "datestamp": "2023-08-19 20:24:51", "id_number": "CaltechAUTHORS:20210421-101607288", "publisher": "California Institute of Technology", "ispublished": "unpub", "contributors": { "items": [ { "id": "Keung-Richard", "name": { "given": "Richard", "family": "Keung" } } ] }, "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210421-101607288", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/6s4e6-b2j60", "_Key": "6s4e6-b2j60", "date": "2020-09-24", "note": "\"Spring term, Academic Year 1990-1991\" t.p.\n\nPresentation - AE107_SR-71_Case_Study_1-50.pdf
Presentation - AE107_SR-71_Case_Study_121-320.pdf
Presentation - AE107_SR-71_Case_Study_321-450.pdf
Presentation - AE107_SR-71_Case_Study_451-567.pdf
Presentation - AE107_SR-71_Case_Study_51-120.pdf
", "type": "teaching_resource", "title": "Course AE107 case studies in engineering: the SR-71 Blackbird", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2023-10-20 22:04:20", "abstract": "Presented by Lockheed Advanced Development Company and the Graduate Aeronautical Laboratories, California Institute of Technology ; program directors, David Urie, Hans Hornung ; teaching assistant, Patrick Germain. \n\nThe \"Blackbird\" design was an evolution that took place in a very short period of time but had such advanced technology that it has not been surpassed 25 years later!", "creators": { "items": [ { "id": "Urie-D", "name": { "given": "David", "family": "Urie" } }, { "id": "Hornung-H-G", "name": { "given": "Hans G.", "family": "Hornung" }, "orcid": "0000-0002-4903-8419" }, { "id": "Germain-P", "name": { "given": "Patrick", "family": "Germain" } } ] }, "date_type": "published", "datestamp": "2023-08-19 23:54:43", "id_number": "CaltechAUTHORS:20200924-091927731", "publisher": "Caltech Library", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200924-091927731", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/w34ak-fyd29", "_Key": "w34ak-fyd29", "date": "2020-07-08", "note": "Submitted - 2020-07-07-ORCID_General.pdf
", "type": "teaching_resource", "title": "ORCID iD Handout", "rights": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "lastmod": "2023-10-23 21:30:56", "abstract": "A quick handout with information about ORCID iDs", "creators": { "items": [ { "id": "Briney-Kristin-A", "name": { "given": "Kristin A.", "family": "Briney" }, "orcid": "0000-0003-1802-0184" }, { "id": "Morrell-Thomas-E", "name": { "given": "Thomas", "family": "Morrell" }, "orcid": "0000-0001-9266-5146" }, { "id": "Painter-J-A", "name": { "given": "Joy A.", "family": "Painter" }, "orcid": "0000-0003-4159-2412" }, { "id": "Wrublewski-D-T", "name": { "given": "Donna T.", "family": "Wrublewski" }, "orcid": "0000-0003-0248-0813" } ] }, "date_type": "published", "datestamp": "2023-09-15 06:44:08", "id_number": "CaltechAUTHORS:20200707-162905337", "publisher": "Caltech Library", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200707-162905337", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/g9zez-snk70", "doi": "10.7907/m79a-gw54", "_Key": "g9zez-snk70", "date": "2020-06-03", "note": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "type": "teaching_resource", "title": "Caltech Example Data Management Plan", "rights": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "lastmod": "2023-10-20 16:33:19", "abstract": "The example data management plan describes data management for a microscopy project and uses general NSF template. Always refer to the specific guidance for your grant proposal when writing a data management plan, as requirements differ.", "creators": { "items": [ { "id": "Briney-Kristin-A", "name": { "given": "Kristin A.", "family": "Briney" }, "orcid": "0000-0003-1802-0184" }, { "id": "Morrell-Thomas-E", "name": { "given": "Thomas", "family": "Morrell" }, "orcid": "0000-0001-9266-5146" } ] }, "date_type": "published", "datestamp": "2023-08-19 21:37:42", "id_number": "CaltechAUTHORS:20200602-160816067", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200602-160816067", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/sryb5-5vz57", "doi": "10.7907/rksd-4x31", "_Key": "sryb5-5vz57", "date": "2020-06-03", "note": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "type": "teaching_resource", "title": "Data Management Plan (DMP) Checklist", "rights": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "lastmod": "2023-10-20 22:50:16", "abstract": "The DMP checklist is based on the general NSF grant template and specifies content that should be in each section of the DMP. Two versions of the checklist are available: a Caltech Library branded version and a generic editable version. Always refer to the specific guidance for your grant proposal when writing a data management plan, as requirements differ.", "creators": { "items": [ { "id": "Briney-Kristin-A", "name": { "given": "Kristin A.", "family": "Briney" }, "orcid": "0000-0003-1802-0184" } ] }, "date_type": "published", "datestamp": "2023-08-19 21:37:38", "id_number": "CaltechAUTHORS:20200602-160221941", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200602-160221941", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/mmnpf-cez11", "doi": "10.7907/894q-zr22", "_Key": "mmnpf-cez11", "date": "2020-06-02", "note": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.\n\nSubmitted - FileNamingConventionWorksheet_Caltech.pdf
Submitted - FileNamingConventionWorksheet_Generic.docx
", "type": "teaching_resource", "title": "File Naming Convention Worksheet", "rights": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "lastmod": "2023-10-20 16:32:22", "abstract": "This worksheet walks researchers through the process of creating a file naming convention for a group of files. This process includes: choosing metadata, encoding and ordering the metadata, adding version information, and properly formatting the file names. Two versions of the worksheet are available: a Caltech Library branded version and a generic editable version.", "creators": { "items": [ { "id": "Briney-Kristin-A", "name": { "given": "Kristin A.", "family": "Briney" }, "orcid": "0000-0003-1802-0184" } ] }, "date_type": "published", "datestamp": "2023-08-19 21:37:30", "id_number": "CaltechAUTHORS:20200601-161923247", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200601-161923247", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/q0q23-ndm97", "doi": "10.22002/D1.1440", "_Key": "q0q23-ndm97", "date": "2020-05-19", "note": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.\n\nOther - DataViz101_Activities.docx
Presentation - DataViz101_Slides.pdf
Presentation - DataViz101_Slides.pptx
", "type": "teaching_resource", "title": "Data Visualization 101", "rights": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "lastmod": "2023-10-20 15:54:50", "abstract": "This workshop covers how to choose the right chart type for your data and how good design choices will make your chart easier to understand. The workshop focuses on visualization best practices, independent of any specific visualization software, and consists of lecture and hands on activities.", "creators": { "items": [ { "id": "Briney-Kristin-A", "name": { "given": "Kristin A.", "family": "Briney" }, "orcid": "0000-0003-1802-0184" } ] }, "date_type": "published", "datestamp": "2023-08-19 21:13:11", "id_number": "CaltechAUTHORS:20200519-101809774", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200519-101809774", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/yr0y9-z4q70", "doi": "10.7907/yjph-sa32", "_Key": "yr0y9-z4q70", "date": "2020-05-19", "note": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "type": "teaching_resource", "title": "Project Close-Out Checklist for Research Data", "rights": "This work is available under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.", "lastmod": "2023-10-20 15:55:45", "abstract": "The close-out checklist describes a range of activities for helping ensure that research data are properly managed at the end of a project or at researcher departure. Activities include: making stewardship decisions, preparing files for archiving, sharing data, and setting aside important files in a \"FINAL\" folder. Two versions of the checklist are available: a Caltech Library branded version and a generic editable version.", "creators": { "items": [ { "id": "Briney-Kristin-A", "name": { "given": "Kristin A.", "family": "Briney" }, "orcid": "0000-0003-1802-0184" } ] }, "date_type": "published", "datestamp": "2023-08-19 21:13:18", "id_number": "CaltechAUTHORS:20200519-142758925", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200519-142758925", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/0k976-qs588", "doi": "10.7907/Z93B5X4F", "_Key": "0k976-qs588", "date": "2020-03-09", "note": "This lesson was piloted at the First CODATA-RDA Research Data Science Summer School, 1-12 August, ICTP, Trieste.\n\nPublished - 20160808_Overleaf_Hammersley.pdf
", "type": "teaching_resource", "title": "Collaborative Writing and Publishing with LaTeX: An AuthorCarpentry Lesson", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2023-10-23 21:18:44", "abstract": "This lesson covers creating scientific papers in LaTeX and Reference Lists in BibTeX, using the online Overleaf platform. Specific skills demonstrated include linking to graphics created in R; citing references in bibliographic management tools such as Mendeley; and synchronizing an online writing project with GitHub.", "creators": { "items": [ { "id": "Hammersely-John", "name": { "given": "John", "family": "Hammersley" } } ] }, "date_type": "published", "datestamp": "2023-09-15 05:31:40", "id_number": "CaltechAUTHORS:20160926-061721755", "publisher": "Caltech Library", "ispublished": "unpub", "contributors": { "items": [ { "id": "Clement-G-P", "name": { "given": "Gail P.", "family": "Clement" } } ] }, "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160926-061721755", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/skbvq-06g16", "doi": "10.7907/nbx6-vm05", "_Key": "skbvq-06g16", "date": "2019-07-15", "note": "© 2019 Joel A. Tropp. \n\nShort course at École Normale Supérieure, Paris, July 2019.\n\nTypeset on July 15, 2019. Typeset on February 23, 2021. \n\nThe summer school \"High-dimensional probability and algorithms\" was funded by Université PSL and CNRS. I would like to thank the organizers, Claire Boyer, Djalil Chafaï, and Joseph Lehec, for an engaging week. Additional funding for my research and this course was provided by ONR Awards N00014-17-12146 and N00014-18-12363.\n\nAccepted Version - Tro19-Matrix-Concentration-LN-corr.pdf
", "type": "teaching_resource", "title": "Matrix Concentration & Computational Linear Algebra", "funders": { "items": [ { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-17-12146" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-18-12363" }, { "agency": "Université PSL" }, { "agency": "Centre National de la Recherche Scientifique (CNRS)" } ] }, "lastmod": "2024-02-27 18:55:33", "abstract": "These lecture notes were written to support the short course\nMatrix Concentration & Computational Linear Algebra delivered by the author at École Normale Supérieure in Paris from 1–5 July 2019 as part of the summer school \"High-dimensional probability and algorithms.\" The aim of this course is to present some practical computational applications of matrix concentration.", "creators": { "items": [ { "id": "Tropp-J-A", "name": { "given": "Joel A.", "family": "Tropp" }, "orcid": "0000-0003-1024-1791" } ] }, "date_type": "published", "datestamp": "2023-08-19 16:46:47", "id_number": "CaltechAUTHORS:20190715-125341188", "publisher": "California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190715-125341188", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/38ac2-za747", "doi": "10.48550/arXiv.1810.06191", "_Key": "38ac2-za747", "date": "2019-04-04", "note": "These notes were developed out of Caltech course ACM 159 in Fall 2017. The notes were created in latex by the students in the class, based on lectures presented by the instructor Andrew Stuart, and on input from the course TA Armeen Taeb. The individuals responsible for the notes listed in alphabetic order are: Blancquart, Paul; Cai, Karena; Chen, Jiajie; Cheng, Richard; Cheng, Rui; Feldstein, Jonathan; Huang, De; Idíni, Benjamin; Kovachki, Nikola; Lee, Marcus; Levy, Gabriel; Li, Liuchi; Muir, Jack; Ren, Cindy; Seylabi, Elnaz, Schäfer, Florian; Singhal, Vipul; Stephenson, Oliver; Song, Yichuan; Su, Yu; Teke, Oguzhan; Williams, Ethan; Wray, Parker; Zhan, Eric; Zhang, Shumao; Xiao, Fangzhou. Furthermore, the following students have added content beyond the class materials: Parker Wray – the Overview, Jiajie Chen – alternative proof of Theorem 1.10 and proof idea for Theorem 14.3, Fangzhou Xiao – numerical simulation of prior, likelihood & posterior, Elnaz Seylabi & Fangzhou Xiao – catching typographical errors in a draft of these notes, Cindy Ren – numerical simulations to enhance understanding of importance sampling in Examples 6.2 and 6.5, Cindy Ren & De Huang – improving the constants in Theorem 6.3 regarding the approximation error of importance sampling, Richard Cheng & Florian Schäfer – illustrations to enhance understanding of the coupling argument used to study convergence of MCMC algorithms by presenting the finite state-space case, and Ethan Williams & Jack Muir – numerical simulations and illustrations of Ensemble Kalman Filter and Extended Kalman Filter. In addition to the students who developed the notes, we would also like to Tapio Helin (Helsinki) who used the notes in his own course and provided very helpful feedback on an early draft. \n\nThe work of AS has been funded by the EPSRC (UK), ERC (Europe) and by AFOSR, ARL, NIH, NSF and ONR (USA). This funded research has helped to shape the presentation of the material here and is gratefully acknowledged. \n\nWarning: These are rough notes, far from being perfected. They are likely to contain mathematical errors, incomplete bibliographical information, inconsistencies in notation and typographical errors. We hope that the notes are nonetheless useful. Please contact Armeen Taeb at ataeb@caltech.edu with any feedback from typos, through mathematical errors and bibliographical omissions, to comments on the structural organization of the material.\n\nDraft - 1810.06191.pdf
", "type": "teaching_resource", "title": "Data Assimilation and Inverse Problems", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Engineering and Physical Sciences Research Council (EPSRC)" }, { "agency": "European Research Council (ERC)" }, { "agency": "Air Force Office of Scientific Research (AFOSR)" }, { "agency": "Army Research Laboratory" }, { "agency": "NIH" }, { "agency": "NSF" }, { "agency": "Office of Naval Research (ONR)" } ] }, "lastmod": "2023-10-20 17:58:53", "abstract": "These notes are designed with the aim of providing a clear and concise introduction to the subjects of Inverse Problems and Data Assimilation, and their inter-relations, together with citations to some relevant literature in this area. The first half of the notes is dedicated to studying the Bayesian framework for inverse problems. Techniques such as importance sampling and Markov Chain Monte Carlo (MCMC) methods are introduced; these methods have the desirable property that in the limit of an infinite number of samples they reproduce the full posterior distribution. Since it is often computationally intensive to implement these methods, especially in high dimensional problems, approximate techniques such as approximating the posterior by a Dirac or a Gaussian distribution are discussed. The second half of the notes cover data assimilation. This refers to a particular class of inverse problems in which the unknown parameter is the initial condition of a dynamical system, and in the stochastic dynamics case the subsequent states of the system, and the data comprises partial and noisy observations of that (possibly stochastic) dynamical system. We will also demonstrate that methods developed in data assimilation may be employed to study generic inverse problems, by introducing an artificial time to generate a sequence of probability measures interpolating from the prior to the posterior.", "creators": { "items": [ { "id": "Stuart-A-M", "name": { "given": "Andrew", "family": "Stuart" } }, { "id": "Taeb-A", "name": { "given": "Armeen", "family": "Taeb" }, "orcid": "0000-0002-5647-3160" } ] }, "date_type": "published", "datestamp": "2023-08-19 11:59:40", "id_number": "CaltechAUTHORS:20190404-111038658", "publisher": "arXiv", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190404-111038658", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/pp04a-k3d74", "_Key": "pp04a-k3d74", "date": "2017-03-27", "note": "c1962, W. A. J. Luxemburg.\nSecond corrected edition, March 1964.\n\nThe second edition differs little from the first edition. Some errors are corrected, section 4 of Chapter II was newly written and section 6 was added to Chapter 6. For the metamathematical background of Robinson's theory we refer the reader to: Abraham Robinson, Introduction to Model Theory and the Metamathematics of Algebra, Studies in Logic and the Foundations of Mathematics,\nAmsterdam 1963.\n\nPresentation - NON-STANDARD_ANALYSIS-ROBINSONS_THEORY_OF_INFINITESIMALS-1962.pdf
", "type": "teaching_resource", "title": "Non-Standard Analysis: Lectures on A. Robinson's Theory of Infinitesimals and Infinitely Large Numbers", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2023-10-25 15:02:39", "abstract": "The present lecture notes have grown from a series of three lectures which were given by the author at the California Institute of Technology in December 1961. The purpose of these lectures was to give a discussion of A. Robinson's theory of infinitesimals and infinitely large numbers which had just appeared in print under the title \"Non-Standard Analysis\".\nThe title \"Non-Standard Analysis\" refers to the fact that this theory is an interpretation of analysis in a non-standard model of the arithmetic of the real numbers.", "creators": { "items": [ { "id": "Luxemburg-W-A-J", "name": { "given": "W. A. J.", "family": "Luxemburg" } } ] }, "date_type": "published", "datestamp": "2023-08-19 05:16:18", "id_number": "CaltechAUTHORS:20170327-135729832", "publisher": "Mathematics Department. California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170327-135729832", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/k4m2c-khm74", "_Key": "k4m2c-khm74", "date": "2017-03-27", "note": "Presentation - Luxemburg_WAJ_1960.pdf
", "type": "teaching_resource", "title": "Notes on the Theory of Integration : Ma 108", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2023-10-25 15:02:32", "abstract": "Course description from Caltech Catalog (1960/61):\n\nMa 108 abc. Advanced Calculus. 12 units (4-0-8); three terms. Prerequisite: Ma 2. In this course, a sequel to Ma 2, more advanced techniques and applications of calculus are treated. Point set topology is the point of departure for the theory of convergence,\nand applications are made to implicit functions, partial differentiation, infinite series and infinite products of real and complex numbers. Other topics treated include: uniform convergence of sequences of functions; functions defined by integrals; Fourier series and integrals; analytic functions of a complex variable.", "creators": { "items": [ { "id": "Luxemburg-W-A-J", "name": { "given": "W. A. J.", "family": "Luxemburg" } } ] }, "date_type": "published", "datestamp": "2023-08-19 03:26:43", "id_number": "CaltechAUTHORS:20170327-135159965", "publisher": "Mathematics Department. California Institute of Technology", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170327-135159965", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/93hwr-83669", "_Key": "93hwr-83669", "date": "2017-02-09", "note": "Submitted - TeachWeek_Demo_-_Learner_Handout_-_PRINTED_-_Google_Docs.pdf
Supplemental Material - nobel_prize.csv
", "type": "teaching_resource", "title": "Teaching 21st Century Knowledge Management Skills: A Carpentry Approach to Open Data, Software, and Publication", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "lastmod": "2023-10-23 21:19:30", "abstract": "Today's researchers are challenged to master an ever-expanding and interlinked set of information and publishing skills in the rapidly evolving scholarly web. An emerging approach, called carpentry, teaches researchers at all career stages best practices and efficient tools for handling, sharing, publishing, and providing fair attribution for research outputs of all types: data, software, and papers. The ultimate aim of software, data and author carpentry is to support more open, transparent, and reusable research to advance and strengthen science in the digital era. \n\nThis workshop will introduce you to principles of carpentry, teach you a carpentry module on examining, cleaning, and clustering data of interest to Caltech, and facilitate a debriefing discussion about the hands-on, technology-enabled, open-source and collaborative teaching methods you will have experienced in the demo.", "creators": { "items": [ { "id": "Clement-G-P", "name": { "given": "Gail", "family": "Peretsman-Clement" }, "orcid": "0000-0001-5494-4806" }, { "id": "Wrublewski-D-T", "name": { "given": "Donna", "family": "Wrublewski" }, "orcid": "0000-0003-0248-0813" } ] }, "date_type": "published", "datestamp": "2023-09-15 05:36:16", "id_number": "CaltechAUTHORS:20170208-151128031", "publisher": "Caltech Library", "ispublished": "unpub", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170208-151128031", "eprint_status": "archive", "full_text_status": "public", "metadata_visibility": "show" } ]