[ { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/ye7v2-jnj06", "eprint_id": 103496, "eprint_status": "archive", "datestamp": "2023-08-22 04:55:19", "lastmod": "2023-10-20 16:25:59", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Taylor-S", "name": { "family": "Taylor", "given": "S." } }, { "id": "Lever-J-H", "name": { "family": "Lever", "given": "J. H." } }, { "id": "Burgess-K-D", "name": { "family": "Burgess", "given": "K. D." } }, { "id": "Stroud-Robert-M", "name": { "family": "Stroud", "given": "R. M." } }, { "id": "Brownlee-D-E", "name": { "family": "Brownlee", "given": "D. E." } }, { "id": "Nittler-Larry-R", "name": { "family": "Nittler", "given": "L. R." }, "orcid": "0000-0002-5292-6089" }, { "id": "Bardyn-A", "name": { "family": "Bardyn", "given": "A." } }, { "id": "Alexander-C-M-O'D", "name": { "family": "Alexander", "given": "C. M. O'D." } }, { "id": "Farley-K-A", "name": { "family": "Farley", "given": "K. A." }, "orcid": "0000-0002-7846-7546" }, { "id": "Treffkorn-Jonathan", "name": { "family": "Treffkorn", "given": "J." } }, { "id": "Messenger-S", "name": { "family": "Messenger", "given": "S." } }, { "id": "Wozniakiewicz-P-J", "name": { "family": "Wozniakiewicz", "given": "P. J." } } ] }, "title": "Sampling interplanetary dust from Antarctic air", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2020 The Meteoritical Society. \n\nIssue Online: 15 July 2020; Version of Record online: 27 May 2020; Manuscript accepted: 24 March 2020; Manuscript revised: 23 March 2020; Manuscript received: 30 December 2019. \n\nWe thank Dr. Jeff Grossman, NASA's Emerging Worlds program manager, for funding this project and for added support provided by Dr. Scott Borg, NSF's Antarctic Program manager. We thank our research associates Adam West (2017), Ta\u2010Lee Shue (2018), and Sheryl Seagraves (2019) who conscientiously monitored the operation of the collector and changed out the filters. Many people at South Pole helped to make this project a reality but a special thanks to Leah Street, our NSF science support coordinator and to Dan McCreight, our NSF logistics coordinator. We also thank our students Amanda Pinson and Summer Christenson from Dartmouth College and David Bour, an NRL SEAP student intern. Lastly, we thank Dr. Hope Ishii and an anonymous reviewer who provided comments that improved the paper. The authors have no conflict of interests that could affect the results presented in this paper.\n\n
Published - maps.13483.pdf
Supplemental Material - maps13483-sup-0001-appendixs1.docx
Supplemental Material - maps13483-sup-0002-appendixs2.pdf
Supplemental Material - maps13483-sup-0003-appendixs3-a.pdf
Supplemental Material - maps13483-sup-0004-appendixs4.pdf
", "abstract": "We built a collector to filter interplanetary dust particles (IDPs) larger than 5 \u03bcm from the clean air at the Amundsen Scott South Pole station. Our sampling strategy used long duration, continuous dry filtering of near\u2010surface air in place of short duration, high\u2010speed impact collection on flags flown in the stratosphere. We filtered ~10\u2077 m\u00b3 of clean Antarctic air through 20 cm diameter, 3 \u00b5m filters coupled to a suction blower of modest power consumption (5\u20136 kW). Our collector ran continuously for 2 years and yielded 41 filters for analyses. Based on stratospheric concentrations, we predicted that each month's collection would provide 300\u2013900 IDPs for analysis. We identified 19 extraterrestrial (ET) particles on the 66 cm\u00b2 of filter examined, which represented ~0.5% of the exposed filter surfaces. The 11 ET particles larger than 5 \u00b5m yield about a fifth of the expected flux based on >5 \u00b5m stratospheric ET particle flux. Of the 19 ET particles identified, four were chondritic porous IDPs, seven were FeNiS beads, two were FeNi grains, and six were chondritic material with FeNiS components. Most were <10 \u00b5m in diameter and none were cluster particles. Additionally, a carbon\u2010rich candidate particle was found to have a small \u00b9\u2075N isotopic enrichment, supporting an ET origin. Many other candidate grains, including chondritic glasses and C\u2010rich particles with Mg and Si and FeS grains, require further analysis to determine if they are ET. The vast majority of exposed filter surfaces remain to be examined.", "date": "2020-05", "date_type": "published", "publication": "Meteoritics and Planetary Science", "volume": "55", "number": "5", "publisher": "Meteoritical Society", "pagerange": "1128-1145", "id_number": "CaltechAUTHORS:20200527-131917889", "issn": "1086-9379", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200527-131917889", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NASA", "grant_number": "15\u2010EW15\u20102\u2010009" }, { "agency": "NSF" } ] }, "local_group": { "items": [ { "id": "Division-of-Geological-and-Planetary-Sciences" } ] }, "doi": "10.1111/maps.13483", "primary_object": { "basename": "maps.13483.pdf", "url": "https://authors.library.caltech.edu/records/ye7v2-jnj06/files/maps.13483.pdf" }, "related_objects": [ { "basename": "maps13483-sup-0001-appendixs1.docx", "url": "https://authors.library.caltech.edu/records/ye7v2-jnj06/files/maps13483-sup-0001-appendixs1.docx" }, { "basename": "maps13483-sup-0002-appendixs2.pdf", "url": "https://authors.library.caltech.edu/records/ye7v2-jnj06/files/maps13483-sup-0002-appendixs2.pdf" }, { "basename": "maps13483-sup-0003-appendixs3-a.pdf", "url": "https://authors.library.caltech.edu/records/ye7v2-jnj06/files/maps13483-sup-0003-appendixs3-a.pdf" }, { "basename": "maps13483-sup-0004-appendixs4.pdf", "url": "https://authors.library.caltech.edu/records/ye7v2-jnj06/files/maps13483-sup-0004-appendixs4.pdf" } ], "resource_type": "article", "pub_year": "2020", "author_list": "Taylor, S.; Lever, J. H.; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/sgkpj-8cm43", "eprint_id": 80375, "eprint_status": "archive", "datestamp": "2023-08-21 21:21:54", "lastmod": "2023-10-17 15:57:39", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Sarah" } }, { "id": "Kim-Taehwan", "name": { "family": "Kim", "given": "Taehwan" } }, { "id": "Yue-Yisong", "name": { "family": "Yue", "given": "Yisong" }, "orcid": "0000-0001-9127-1989" }, { "id": "Mahler-M", "name": { "family": "Mahler", "given": "Moshe" } }, { "id": "Krahe-J", "name": { "family": "Krahe", "given": "James" } }, { "id": "Garcia-Rodriguez-A", "name": { "family": "Garcia Rodriguez", "given": "Anastasio" } }, { "id": "Hodgins-J", "name": { "family": "Hodgins", "given": "Jessica" } }, { "id": "Matthews-I", "name": { "family": "Matthews", "given": "Iain" } } ] }, "title": "A deep learning approach for generalized speech animation", "ispublished": "pub", "full_text_status": "public", "keywords": "Computing methodologies\u2192Neural networks; Procedural animation; Motion processing; Real-time simulation; Visual analytics; Speech Animation; Machine Learning", "note": "\u00a9 2017 Copyright held by the owner/author(s). Publication rights licensed to ACM. \n\nWe owe great thanks to our always accommodating and professional actor, Ken Bolden. Barry-John Theobald and Ausdang Thangthai contributed their HMM synthesis implementation. Scott Jones at Lucasilm and Hao Li at USC generously provided facial rigs. Thanks to the diverse members of Disney Research Pittsburgh who recorded foreign language speech examples. The work was supported by EPSRC grant EP/M014053/1.\n\nPublished - a93-taylor.pdf
", "abstract": "We introduce a simple and effective deep learning approach to automatically generate natural looking speech animation that synchronizes to input speech. Our approach uses a sliding window predictor that learns arbitrary nonlinear mappings from phoneme label input sequences to mouth movements in a way that accurately captures natural motion and visual coarticulation effects. Our deep learning approach enjoys several attractive properties: it runs in real-time, requires minimal parameter tuning, generalizes well to novel input speech sequences, is easily edited to create stylized and emotional speech, and is compatible with existing animation retargeting approaches. One important focus of our work is to develop an effective approach for speech animation that can be easily integrated into existing production pipelines. We provide a detailed description of our end-to-end approach, including machine learning design decisions. Generalized speech animation results are demonstrated over a wide range of animation clips on a variety of characters and voices, including singing and foreign language input. Our approach can also generate on-demand speech animation in real-time from user speech input.", "date": "2017-07", "date_type": "published", "publication": "ACM Transactions on Graphics", "volume": "36", "number": "4", "publisher": "Association for Computing Machinery", "pagerange": "Art. 93", "id_number": "CaltechAUTHORS:20170814-143407341", "issn": "0730-0301", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170814-143407341", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Engineering and Physical Sciences Research Council (EPSRC)", "grant_number": "EP/M014053/1" } ] }, "doi": "10.1145/3072959.3073699", "primary_object": { "basename": "a93-taylor.pdf", "url": "https://authors.library.caltech.edu/records/sgkpj-8cm43/files/a93-taylor.pdf" }, "resource_type": "article", "pub_year": "2017", "author_list": "Taylor, Sarah; Kim, Taehwan; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/mya2z-jvs14", "eprint_id": 68567, "eprint_status": "archive", "datestamp": "2023-08-20 07:47:51", "lastmod": "2023-10-19 22:18:46", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Romano-J-D", "name": { "family": "Romano", "given": "J. D." } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } }, { "id": "Cornish-N-J", "name": { "family": "Cornish", "given": "Neil J." } }, { "id": "Gair-J-R", "name": { "family": "Gair", "given": "Jonathan R." } }, { "id": "Mingarelli-C-M-F", "name": { "family": "Mingarelli", "given": "C. M. F." }, "orcid": "0000-0002-4307-1322" }, { "id": "van-Haasteren-R", "name": { "family": "van Haasteren", "given": "R." }, "orcid": "0000-0002-6428-2620" } ] }, "title": "Phase-coherent mapping of gravitational-wave backgrounds using ground-based laser interferometers", "ispublished": "pub", "full_text_status": "public", "note": "Published 18 August 2015.\n\nJ. D. R. acknowledges support from National Science\nFoundation Awards No. PHY-1205585 and No. CREST\nHRD-1242090. This research was in part supported by\nS. T.'s appointment to the NASA Postdoctoral Program at\nthe Jet Propulsion Laboratory, administered by Oak Ridge\nAssociated Universities through a contract with NASA.\nN. J. C. acknowledges support from National Science\nFoundation Award No. PHY-1306702 and the\nNANOGrav Physics Frontier Center, Award No. NSF\nPFC-1430284. J. G.'s work is supported by the Royal\nSociety. C. M. F. M.'s work is supported by a Marie\nCurie International Outgoing Fellowship within the 7th\nEuropean Community Framework Programme. R. v. H.\nacknowledges support by NASA through Einstein\nFellowship Grant No. PF3-140116. J. D. R. thanks Malik\nRakhmanov for useful discussions regarding pseudoinverse\ncalculations when the system of equations is underdetermined.\nThis research has made use of PYTHON and its\nstandard libraries: NUMPY and MATPLOTLIB. We have also\nmade use of MEALPIX (MATLAB implementation of HEALPix\n[28]), developed by the GWAstro Research Group and\navailable from http://gwastro.psu.edu. This work was\nperformed using the Darwin Supercomputer of the\nUniversity of Cambridge High Performance Computing\nService (http://www.hpc.cam.ac.uk/), provided by Dell Inc.\nusing Strategic Research Infrastructure Funding from the\nHigher Education Funding Council for England and\nfunding from the Science and Technology Facilities\nCouncil. This paper has been assigned LIGO DCC\nNo. LIGO-P1500065.\n\nPublished - PhysRevD.92.042003.pdf
Submitted - 2015-37.pdf
", "abstract": "We extend the formalisms developed in Gair et al. [1] and Cornish and van Haasteren [2] to create\nmaps of gravitational-wave backgrounds using a network of ground-based laser interferometers. We\nshow that in contrast to pulsar timing arrays, which are insensitive to half of the gravitational-wave\nsky (the curl modes), a network of ground-based interferometers is sensitive to both the gradient\nand curl components of the background. The spatial separation of a network of interferometers,\nor of a single interferometer at di erent times during its rotational and orbital motion around the\nSun, allows for recovery of both components. We derive expressions for the response functions of a\nlaser interferometer in the small-antenna limit, and use these expressions to calculate the overlap\nreduction function for a pair of interferometers. We also construct maximum-likelihood estimates of\nthe + and -polarization modes of the gravitational-wave sky in terms of the response matrix for a\nnetwork of ground-based interferometers, evaluated at discrete times during Earth's rotational and\norbital motion around the Sun. We demonstrate the feasibility of this approach for some simple\nsimulated backgrounds (a single point source and spatially-extended distributions having only grad\nor curl components), calculating maximum-likelihood sky maps and uncertainty maps based on\nthe (pseudo)inverse of the response matrix. The distinction between this approach and standard\nmethods for mapping gravitational-wave power is also discussed", "date": "2015-08-18", "date_type": "published", "publication": "Physical Review D", "volume": "92", "number": "4", "publisher": "American Physical Society", "pagerange": "Art. No. 042003", "id_number": "CaltechAUTHORS:20160622-090020070", "issn": "2470-0010", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160622-090020070", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "PHY-1205585" }, { "agency": "NSF", "grant_number": "CREST HRD-1242090" }, { "agency": "NSF", "grant_number": "PHY-1306702" }, { "agency": "NSF", "grant_number": "PFC-1430284" }, { "agency": "Royal Society" }, { "agency": "Marie Curie International Outgoing Fellowship" }, { "agency": "NASA Einstein Fellowship", "grant_number": "PF3-140116" } ] }, "other_numbering_system": { "items": [ { "id": "LIGO-P1500065", "name": "LIGO DCC" } ] }, "local_group": { "items": [ { "id": "Space-Radiation-Laboratory" }, { "id": "TAPIR" } ] }, "doi": "10.48550/arXiv.1505.07179", "primary_object": { "basename": "2015-37.pdf", "url": "https://authors.library.caltech.edu/records/mya2z-jvs14/files/2015-37.pdf" }, "related_objects": [ { "basename": "PhysRevD.92.042003.pdf", "url": "https://authors.library.caltech.edu/records/mya2z-jvs14/files/PhysRevD.92.042003.pdf" } ], "resource_type": "article", "pub_year": "2015", "author_list": "Romano, J. D.; Taylor, Stephen; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/cab15-rpz34", "eprint_id": 60579, "eprint_status": "archive", "datestamp": "2023-08-22 16:07:19", "lastmod": "2023-10-24 16:41:34", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Kim-Taehwan", "name": { "family": "Kim", "given": "Taehwan" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Sarah" } }, { "id": "Yue-Yisong", "name": { "family": "Yue", "given": "Yisong" }, "orcid": "0000-0001-9127-1989" }, { "id": "Matthews-I", "name": { "family": "Matthews", "given": "Iain" } } ] }, "title": "A Decision Tree Framework for Spatiotemporal Sequence Prediction", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Decision Trees; Sequence Prediction", "note": "\u00a9 2015 ACM.", "abstract": "We study the problem of learning to predict a spatiotemporal output sequence given an input sequence. In contrast to conventional sequence prediction problems such as part-of-speech tagging (where output sequences are selected using a relatively small set of discrete labels), our goal is to predict sequences that lie within a high-dimensional continuous output space. We present a decision tree framework for learning an accurate non-parametric spatiotemporal sequence predictor. Our approach enjoys several attractive properties, including ease of training, fast performance at test time, and the ability to robustly tolerate corrupted training data using a novel latent variable approach. We evaluate on several datasets, and demonstrate substantial improvements over existing decision tree based sequence learning frameworks such as SEARN and DAgger.", "date": "2015-08", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "577-586", "id_number": "CaltechAUTHORS:20150928-132143651", "isbn": "978-1-4503-3664-2", "book_title": "Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150928-132143651", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/2783258.2783356", "resource_type": "book_section", "pub_year": "2015", "author_list": "Kim, Taehwan; Taylor, Sarah; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/d86bj-e7t49", "eprint_id": 52393, "eprint_status": "archive", "datestamp": "2023-08-20 03:21:48", "lastmod": "2023-10-18 19:49:15", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Gair-J-R", "name": { "family": "Gair", "given": "Jonathan R." } }, { "id": "Romano-J-D", "name": { "family": "Romano", "given": "Joseph D." } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } }, { "id": "Mingarelli-C-M-F", "name": { "family": "Mingarelli", "given": "Chiara M. F." }, "orcid": "0000-0002-4307-1322" } ] }, "title": "Mapping gravitational-wave backgrounds using methods from CMB analysis: Application to pulsar timing arrays", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2014 American Physical Society.\n\nPublished 1 October 2014; received 17 June 2014.\n\nJ. G.'s work is supported by the Royal Society. J. D. R.\nacknowledges support from NSF Grants No. PHY-1205585\nand CREST No. HRD-1242090. S. R. T. acknowledges the\nsupport of the STFC and the RAS. C.M. F.M. acknowledges\nthe support of the RAS, Universitas 21 and a Marie\nCurie International Outgoing Fellowship within the 7th\nEuropean Community Framework Programme. We thank\nSanjit Mitra for initial discussions, and Bruce Allen and\nChiara Caprini for many e-mail exchanges regarding\nmodels for correlated backgrounds. C. M. F. M. thanks\nGary Hinshaw for pointing her to Ref. [40], and J. D. R.\nthanks Graham Woan for useful feedback regarding an\nearlier draft of the paper. The authors also thank the\nanonymous referee for useful comments on the manuscript.\nThis research has made use of Python and its standard\nlibraries: numpy and matplotlib. We have also made use of\nMEALPix (a Matlab implementation of HEALPix [68]),\ndeveloped by the GWAstro Research Group and available\nfrom http://gwastro.psu.edu. This work was performed\nusing the Darwin Supercomputer of the University of\nCambridge High Performance Computing Service (http://www.hpc.cam.ac.uk/), provided by Dell Inc. using\nStrategic Research Infrastructure Funding from the\nHigher Education Funding Council for England and funding\nfrom the Science and Technology Facilities Council.\n\nPublished - PhysRevD.90.082001.pdf
Submitted - 1406.4664v2.pdf
", "abstract": "We describe an alternative approach to the analysis of gravitational-wave backgrounds, based on the formalism used to characterize the polarization of the cosmic microwave background. In contrast to standard analyses, this approach makes no assumptions about the nature of the background and so has the potential to reveal much more about the physical processes that generated it. An arbitrary background can be decomposed into modes whose angular dependence on the sky is given by gradients and curls of spherical harmonics. We derive the pulsar timing overlap reduction functions for the individual modes, which are given by simple combinations of spherical harmonics evaluated at the pulsar locations. We show how these can be used to recover the components of an arbitrary background, giving explicit results for both isotropic and anisotropic uncorrelated backgrounds. We also find that the response of a pulsar timing array to curl modes is identically zero, so half of the gravitational-wave sky will never be observed using pulsar timing, no matter how many pulsars are included in the array. An isotropic, unpolarized and uncorrelated background can be accurately represented using only three modes, and so a search of this type will be only slightly more complicated than the standard cross-correlation search using the Hellings and Downs overlap reduction function. However, by measuring the components of individual modes of the background and checking for consistency with isotropy, this approach has the potential to reveal much more information. Each individual mode on its own describes a background that is correlated between different points on the sky. A measurement of the components that indicates the presence of correlations in the background on large angular scales would suggest startling new physics.", "date": "2014-10-15", "date_type": "published", "publication": "Physical Review D", "volume": "90", "number": "8", "publisher": "American Physical Society", "pagerange": "Art. No. 082001", "id_number": "CaltechAUTHORS:20141204-113552353", "issn": "2470-0010", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20141204-113552353", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Royal Society" }, { "agency": "NSF", "grant_number": "PHY-1205585" }, { "agency": "CREST", "grant_number": "HRD-1242090" }, { "agency": "Science and Technology Facilities Council (STFC)" }, { "agency": "RAS" }, { "agency": "Universitas 21" }, { "agency": "Marie Curie International Outgoing Fellowship" }, { "agency": "Higher Education Funding Council for England" } ] }, "other_numbering_system": { "items": [ { "id": "2014-16", "name": "Space Radiation Laboratory" } ] }, "doi": "10.1103/PhysRevD.90.082001", "primary_object": { "basename": "1406.4664v2.pdf", "url": "https://authors.library.caltech.edu/records/d86bj-e7t49/files/1406.4664v2.pdf" }, "related_objects": [ { "basename": "PhysRevD.90.082001.pdf", "url": "https://authors.library.caltech.edu/records/d86bj-e7t49/files/PhysRevD.90.082001.pdf" } ], "resource_type": "article", "pub_year": "2014", "author_list": "Gair, Jonathan R.; Romano, Joseph D.; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/satvk-2tx50", "eprint_id": 31620, "eprint_status": "archive", "datestamp": "2023-08-19 10:29:18", "lastmod": "2023-10-17 18:43:34", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Susan" } }, { "id": "Matrajt-G", "name": { "family": "Matrajt", "given": "Graciela" } }, { "id": "Guan-Yunbin", "name": { "family": "Guan", "given": "Yunbin" }, "orcid": "0000-0002-7636-3735" } ] }, "title": "Fine-grained precursors dominate the micrometeorite flux", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2011 The Meteoritical Society. \n\nIssue published online: 26 April 2012; Article first published online: 2 November 2011; Received 15 May 2011; revision accepted 22 September 2011. \n\nThe authors thank Dave Joswiak and Dr. Hope Ishii for reviewing this article and providing many helpful suggestions. Dr. Gregory Herzog is thanked for the many helpful discussions on this work. We thank NSF (Dr. Julie Palais, program manager) for funding the collection of micrometeorites from the SPWW and NASA (Dr. David Lindstrom, program manager) for funding the analysis of the 2000 collection. The authors also thank Sarah E. Wengert and other Women in Science Project students at Dartmouth College for imaging hundreds of these micrometeorites and Dr. Charles Daghlian for comentoring these students. \n\nEditorial Handling\u2013\u2013Dr. Donald Brownlee\n\nPublished - Taylor2012p18162Meteorit_Planet_Sci.pdf
", "abstract": "We optically classified 5682 micrometeorites (MMs) from the 2000 South Pole collection into textural classes, imaged 2458 of these MMs with a scanning electron microscope, and made 200 elemental and eight isotopic measurements on those with unusual textures or relict phases. As textures provide information on both degree of heating and composition of MMs, we developed textural sequences that illustrate how fine-grained, coarse-grained, and single mineral MMs change with increased heating. We used this information to determine the percentage of matrix dominated to mineral dominated precursor materials (precursors) that produced the MMs. We find that at least 75% of the MMs in the collection derived from fine-grained precursors with compositions similar to CI and CM meteorites and consistent with dynamical models that indicate 85% of the mass influx of small particles to Earth comes from Jupiter family comets. A lower limit for ordinary chondrites is estimated at 2\u20138% based on MMs that contain Na-bearing plagioclase relicts. Less than 1% of the MMs have achondritic compositions, CAI components, or recognizable chondrules. Single mineral MMs often have magnetite zones around their peripheries. We measured their isotopic compositions to determine if the magnetite zones demarcate the volume affected by atmospheric exchange during entry heating. Because we see little gradient in isotopic composition in the olivines, we conclude that the magnetites are a visual marker that allows us to select and analyze areas not affected by atmospheric exchange. Similar magnetite zones are seen in some olivine and pyroxene relict grains contained within MMs.", "date": "2012-04", "date_type": "published", "publication": "Meteoritics and Planetary Science", "volume": "47", "number": "4", "publisher": "Meteoritical Society", "pagerange": "550-564", "id_number": "CaltechAUTHORS:20120523-143303420", "issn": "1086-9379", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120523-143303420", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF" } ] }, "doi": "10.1111/j.1945-5100.2011.01292.x", "primary_object": { "basename": "Taylor2012p18162Meteorit_Planet_Sci.pdf", "url": "https://authors.library.caltech.edu/records/satvk-2tx50/files/Taylor2012p18162Meteorit_Planet_Sci.pdf" }, "resource_type": "article", "pub_year": "2012", "author_list": "Taylor, Susan; Matrajt, Graciela; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/5n7eg-e4d27", "eprint_id": 18532, "eprint_status": "archive", "datestamp": "2023-08-19 02:33:19", "lastmod": "2023-10-20 16:29:31", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lund-K", "name": { "family": "Lund", "given": "Kyle" } }, { "id": "Manzo-A-J", "name": { "family": "Manzo", "given": "Anthony J." } }, { "id": "Dabby-N", "name": { "family": "Dabby", "given": "Nadine" } }, { "id": "Michelotti-N", "name": { "family": "Michelotti", "given": "Nicole" } }, { "id": "Johnson-Buck-A", "name": { "family": "Johnson-Buck", "given": "Alexander" } }, { "id": "Nangreave-J", "name": { "family": "Nangreave", "given": "Jeanette" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Steven" } }, { "id": "Pei-Renjjun", "name": { "family": "Pei", "given": "Renjun" } }, { "id": "Stojanovic-M-N", "name": { "family": "Stojanovic", "given": "Milan N." } }, { "id": "Walter-N-G", "name": { "family": "Walter", "given": "Nils G." } }, { "id": "Winfree-E", "name": { "family": "Winfree", "given": "Erik" }, "orcid": "0000-0002-5899-7523" }, { "id": "Yan-Hao", "name": { "family": "Yan", "given": "Hao" } } ] }, "title": "Molecular robots guided by prescriptive landscapes", "ispublished": "pub", "full_text_status": "public", "keywords": "biochemistry", "note": "\u00a9 2010 Macmillan Publishers Limited. \n\nReceived 31 March 2009. Accepted 11 March 2010. \n\nThis research was supported by the US National Science Foundation (NSF) EMT and CBC grants (all authors); fellowships and grants from the Kinship Foundation (Searle), the Leukemia & Lymphoma Society, the Juvenile Diabetes Research Foundation and NSF ITR (M.N.S.); awards from the US Army Research Office, the NSF, the US Office of Naval Research, the US National Institutes of Health, the US Department of Energy and a Sloan Research Fellowship (H.Y.); an NSF Graduate Fellowship (N.D.); and Molecular Biophysics and Microfluidics in Biomedical Sciences Training Fellowships from the NIH (A.J.-B. and N.M., respectively). M.N.S. is grateful to T. E. Mitchell and M. Olah for\ninspiration, discussions and help. \n\nAuthor Contributions: AFM experiments were performed by K.L. (majority), J.N. and N.D.; analysis was performed by N.D., K.L., J.N. and S.T. and supervised by E.W. and H.Y. Fluorescence microscopy and particle tracking analysis were performed by A.J.M., N.M. and A.J.-B, supervised by N.G.W. Spiders were synthesized and purified, and their integrity was confirmed and monitored, by S.T. Surface plasmon resonance experiments were performed by R.P. Research coordination was by M.N.S. and materials transfer coordination was by S.T., J.N. and K.L. Experimental design and manuscript preparation received input from all authors.\n\nSupplemental Material - nature09012-s1.pdf
", "abstract": "Traditional robots rely for their function on computing, to store internal representations of their goals and environment and to coordinate sensing and any actuation of components required in response. Moving robotics to the single-molecule level is possible in principle, but requires facing the limited ability of individual molecules to store complex information and programs. One strategy to overcome this problem is to use systems that can obtain complex behaviour from the interaction of simple robots with their environment. A first step in this direction was the development of DNA walkers, which have developed from being non-autonomous, to being capable of directed but brief motion on one-dimensional tracks. Here we demonstrate that previously developed random walkers\u2014so-called molecular spiders that comprise a streptavidin molecule as an inert 'body' and three deoxyribozymes as catalytic 'legs'\u2014show elementary robotic behaviour when interacting with a precisely defined environment. Single-molecule microscopy observations confirm that such walkers achieve directional movement by sensing and modifying tracks of substrate molecules laid out on a two-dimensional DNA origami landscape. When using appropriately designed DNA origami, the molecular spiders autonomously carry out sequences of actions such as 'start', 'follow', 'turn' and 'stop'. We anticipate that this strategy will result in more complex robotic behaviour at the molecular level if additional control mechanisms are incorporated. One example might be interactions between multiple molecular robots leading to collective behaviour; another might be the ability to read and transform secondary cues on the DNA origami landscape as a means of implementing Turing-universal algorithmic behaviour.", "date": "2010-05-13", "date_type": "published", "publication": "Nature", "volume": "465", "number": "7295", "publisher": "Nature Publishing Group", "pagerange": "206-210", "id_number": "CaltechAUTHORS:20100602-145349454", "issn": "0028-0836", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20100602-145349454", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF" }, { "agency": "Kinship Foundation (Searle)" }, { "agency": "Leukemia & Lymphoma Society" }, { "agency": "Juvenile Diabetes Research Foundation" }, { "agency": "Army Research Office (ARO)" }, { "agency": "Office of Naval Research (ONR)" }, { "agency": "NIH Predoctoral Fellowship" }, { "agency": "Department of Energy (DOE)" }, { "agency": "Alfred P. Sloan Foundation" } ] }, "collection": "CaltechAUTHORS", "doi": "10.1038/nature09012", "primary_object": { "basename": "nature09012-s1.pdf", "url": "https://authors.library.caltech.edu/records/5n7eg-e4d27/files/nature09012-s1.pdf" }, "resource_type": "article", "pub_year": "2010", "author_list": "Lund, Kyle; Manzo, Anthony J.; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/q5vny-2px19", "eprint_id": 26871, "eprint_status": "archive", "datestamp": "2023-08-20 04:42:35", "lastmod": "2024-01-13 05:39:59", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chow-Bryan", "name": { "family": "Chow", "given": "Bryan" } }, { "id": "Fyfe-A", "name": { "family": "Fyfe", "given": "Andrew" } }, { "id": "Maskit-D", "name": { "family": "Maskit", "given": "Daniel" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } }, { "id": "Watts-J-R", "name": { "family": "Watts", "given": "Jarrell R." } }, { "id": "Zadik-Y", "name": { "family": "Zadik", "given": "Yair" } } ] }, "title": "A Development Methodology for Concurrent Programs", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 1994 California Institute of Technology. \n\nSeptember 16, 1994.\n\nThe research described in this report is sponsored primarily by the Advanced Research Projects Agency, ARPA Order number 8176, and monitored by the Office of Naval Research under contract number N00014-91-J-1986.\n\nSubmitted - 94-16.pdf
Submitted - 94-16.ps
", "abstract": "This paper describes a development methodology for the design of concurrent programs that provides a migration path from existing sequential C and FORTRAN programs. These programs may be executed immediately, without change, using the entire physical memory of a distributed memory machine or a network of ATM-coupled shared-memory multiprocessors. Subsequent program refinements may involve data and control decomposition together with explicit message passing to improve performance. Each step in the program development may utilize new hardware mechanisms supporting shared memory, segmentation and protection. The ideas presented in this paper are currently being implemented within the Multiflow compiler which is being targetted for the M-Machine. Although the examples we present use the C programming language, the concepts will also be available in FORTRAN.", "date": "2001-05-14", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:1994.cs-tr-94-16", "official_url": "https://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-16", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "funders": { "items": [ { "agency": "Advanced Research Projects Agency (ARPA)", "grant_number": "8176" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-91-J-1986" } ] }, "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/S4MW2X", "primary_object": { "basename": "94-16.pdf", "url": "https://authors.library.caltech.edu/records/q5vny-2px19/files/94-16.pdf" }, "related_objects": [ { "basename": "94-16.ps", "url": "https://authors.library.caltech.edu/records/q5vny-2px19/files/94-16.ps" } ], "resource_type": "monograph", "pub_year": "2001", "author_list": "Chow, Bryan; Fyfe, Andrew; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/rqz0m-we595", "eprint_id": 26861, "eprint_status": "archive", "datestamp": "2023-08-20 02:37:49", "lastmod": "2024-01-13 05:39:40", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Maskit-D", "name": { "family": "Maskit", "given": "Daniel" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } } ] }, "title": "Experiences in Programming the J-Machine", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 1993 California Institute of Technology \n\nApril 30, 1993. \n\nThis work owes a great debt to Mike Noakes of the Concurrent VLSI Architecture project at MIT, who has offered much patience and calm assistance in furthering our understanding\nof the intricacies of the J-Machine Architecture. We would also like to express thanks to Yair Zadik at Caltech who helped in clarifying some of our suggestions for improvement.\n\nSubmitted - 93-11.ps
Submitted - CS_TR_93_11.pdf
", "abstract": "This document summarizes experiences gained in programming the J-Machine. It is intended to provide feedback on the strengths and weaknesses of the architecture. The intent of this document is to provide useful information to system architects to assist in the design of the next generation of fine-grained multicomputers.", "date": "2001-05-14", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:1993.cs-tr-93-11", "official_url": "https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-11", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/rqz0m-we595", "primary_object": { "basename": "93-11.ps", "url": "https://authors.library.caltech.edu/records/rqz0m-we595/files/93-11.ps" }, "related_objects": [ { "basename": "CS_TR_93_11.pdf", "url": "https://authors.library.caltech.edu/records/rqz0m-we595/files/CS_TR_93_11.pdf" } ], "resource_type": "monograph", "pub_year": "2001", "author_list": "Maskit, Daniel and Taylor, Stephen" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/tj4b2-2jh12", "eprint_id": 26862, "eprint_status": "archive", "datestamp": "2023-08-20 02:37:54", "lastmod": "2024-01-13 05:39:42", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Maskit-D", "name": { "family": "Maskit", "given": "Daniel" } }, { "id": "Zadik-Y", "name": { "family": "Zadik", "given": "Yair" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } } ] }, "title": "System Tools for the J-Machine", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 1993 California Institute of Technology. \n\nApril 30, 1993. \n\nThe research described in this report is sponsored primarily by the Advanced Research Projects Agency, ARPA Order number 8176, and monitored by the Office of Naval Research under contract number N00014-91-J-1986. The first author is partially supported by an NSF Graduate Research Fellowship.\n\nSubmitted - CS-TR-93-12.pdf
", "abstract": "[No Abstract]", "date": "2001-05-14", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:1993.cs-tr-93-12", "official_url": "https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-12", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "funders": { "items": [ { "agency": "Advanced Research Projects Agency (ARPA)", "grant_number": "8176" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-91-J-1986" }, { "agency": "NSF Graduate Research Fellowship" } ] }, "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/Z9D798FW", "primary_object": { "basename": "CS-TR-93-12.pdf", "url": "https://authors.library.caltech.edu/records/tj4b2-2jh12/files/CS-TR-93-12.pdf" }, "resource_type": "monograph", "pub_year": "2001", "author_list": "Maskit, Daniel; Zadik, Yair; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/zz05v-gk145", "eprint_id": 26768, "eprint_status": "archive", "datestamp": "2023-08-20 02:14:12", "lastmod": "2023-10-24 16:33:43", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Zadik-Y", "name": { "family": "Zadik", "given": "Yair" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } } ] }, "title": "A File System for the J-Machine", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 1993 California Institute of Technology. \n\nThe research described in this report is sponsored primarily by the Advanced Research Project Agency ARPA Order number 8176, and monitored by the Office of Naval Research under contract number N00014-91-J-1986.\n\nSubmitted - 93-27.pdf
Submitted - postscript.ps
", "abstract": "[No abstract available]", "date": "2001-04-25", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:1993.cs-tr-93-27", "official_url": "https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-27", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "funders": { "items": [ { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-91-J-1986" }, { "agency": "Advanced Research Projects Agency (ARPA)", "grant_number": "8176" } ] }, "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/Z9Z03666", "primary_object": { "basename": "93-27.pdf", "url": "https://authors.library.caltech.edu/records/zz05v-gk145/files/93-27.pdf" }, "related_objects": [ { "basename": "postscript.ps", "url": "https://authors.library.caltech.edu/records/zz05v-gk145/files/postscript.ps" } ], "resource_type": "monograph", "pub_year": "2001", "author_list": "Zadik, Yair and Taylor, Stephen" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/y8qgh-6jk53", "eprint_id": 26792, "eprint_status": "archive", "datestamp": "2023-08-20 03:30:42", "lastmod": "2024-01-13 05:39:18", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Heirich-A", "name": { "family": "Heirich", "given": "Alan" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } } ] }, "title": "A Parabolic Load Balancing Method", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 1994 California Institute of Technology. \n\nThis research described in this report is sponsored primarily by the Advanced Research Projects Agency, ARPA Order number 8176, and monitored by the Office of Naval Research under contract number N00014-91-J-1986.\n\nSubmitted - postscript.pdf
Submitted - postscript.ps
", "abstract": "This paper presents a diffusive load balancing method for scalable multicomputers. In contrast to other schemes which are probably correct the method scales to large numbers of processors with no in-crease in run time. In contrast to other schemes which are scalable the method is provably correct and the paper analyzes the rate of covergence. To control aggregate cpu idle time it can be useful to balance the load to specifiable accuracy. The method achieves arbitrary accuracy by proper consideration of numerical error and stability. This paper presents the method, proves correctness, convergence and scalability, and simulates applications to generic problems in computational fluid dynamics (CFD). The applications reveal some useful properties. The method can preserve adjacency relationships among elements of an adapting computational domain. This makes it useful for partitioning unstructured computational grids in concurrent computations. The method can execute asynchronously to balance a subportion of a domain without affecting the rest of the domain. Theory and experiment show the method is efficient on the scalable multicomputers of the present and coming years. The number of floating point operations required per processor to reduce a point disturbance by 90% is 168 on a system of 512 computers and 105 on a system of 1,000,000 computers. On a typical contemporary multicomputer [19] this requires 82.5 \u00b5s wall-clock time.", "date": "2001-04-25", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:1994.cs-tr-94-13", "official_url": "https://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-13", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "funders": { "items": [ { "agency": "Advanced Research Projects Agency (ARPA)", "grant_number": "8176" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-91-J-1986" } ] }, "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/Z94T6GCQ", "primary_object": { "basename": "postscript.pdf", "url": "https://authors.library.caltech.edu/records/y8qgh-6jk53/files/postscript.pdf" }, "related_objects": [ { "basename": "postscript.ps", "url": "https://authors.library.caltech.edu/records/y8qgh-6jk53/files/postscript.ps" } ], "resource_type": "monograph", "pub_year": "2001", "author_list": "Heirich, Alan and Taylor, Stephen" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/h82rp-yh933", "eprint_id": 26775, "eprint_status": "archive", "datestamp": "2023-08-20 02:02:18", "lastmod": "2024-01-13 05:38:55", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } } ] }, "title": "Progress Report to the Advanced Research Projects Agency on the Scalable Concurrent Programming Project", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 1993 California Institute of Technology. \n\nApril 27, 1992 to March 22, 1993. \n\nThis work owes a great debt to other members of the research groups at both the California Institute or Technology and the Massachusetts Institute or Technology. In particular, Yair Zadik and Chris Ziomkowski implemented the linker, loader, archiver, and floating-point support. Dong Lin collaborated on the initial version or the compiler. Andrew Chang, Mike Noakes, and other members of the Concurrent VLSI Architecture project at MIT have provided constant assustance with low-level software and hardware.\n\nSubmitted - postscript.pdf
Submitted - postscript.ps
", "abstract": "[No abstract available]", "date": "2001-04-25", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:1993.cs-tr-93-35", "official_url": "https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-35", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/Z93J3B0X", "primary_object": { "basename": "postscript.ps", "url": "https://authors.library.caltech.edu/records/h82rp-yh933/files/postscript.ps" }, "related_objects": [ { "basename": "postscript.pdf", "url": "https://authors.library.caltech.edu/records/h82rp-yh933/files/postscript.pdf" } ], "resource_type": "monograph", "pub_year": "2001", "author_list": "Taylor, Stephen" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/9x1vv-gbb59", "eprint_id": 71324, "eprint_status": "archive", "datestamp": "2023-08-20 04:12:47", "lastmod": "2023-10-23 15:38:31", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Foster-I", "name": { "family": "Foster", "given": "Ian" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } } ] }, "title": "A Compiler Approach to Scalable Concurrent-Program Design", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Design, Languages, Monotonicity, program composition, programming abstractions, source-to-source transformations", "note": "\u00a9 1994 ACM. \n\nReceived May 1992; revised May 1993; accepted August 1993. \n\nThis research is sponsored by the Advanced Research Projects Agency, ARPA Order 8176, monitored by the Office of Naval Research under contract N00014-91-J-1986, and by the National Science Foundation under contracts NSF CCR-8809615 and ASC-9157650.", "abstract": "We describe a compilation system for the concurrent programming language Program Composition Notation (PCN). This notation provides a single-assignment programming model that permits concurrent-programming concerns such as decomposition, communication, synchronization, mapping, granularity, and load balancing to be addressed separately in a design. PCN is also extensible with programmer-defined operators, allowing common abstractions to be encapsulated and reused in different contexts. \n\nThe compilation system incorporates a concurrent-transformation system that allows abstractions to be defined through concurrent source-to-source transformations; these convert programmer-defined operators into a core notation. Run-time techniques allow the core notation to be compiled into a simple concurrent abstract machine which can be implemented in a portable fashion using a run-time library. The abstract machine provides a uniform treatment of single-assignment and mutable data structures, allowing data sharing between concurrent and sequential program segments and permitting integration of sequential C and Fortran code into concurrent programs. \n\nThis compilation system forms part of a program development toolkit that operates on a wide variety of networked workstations, multicomputers, and shared-memory multiprocessors. The toolkit has been used both to develop substantial applications and to teach introductory concurrent-programming classes, including a freshman course at Caltech.", "date": "1994-05", "date_type": "published", "publication": "ACM Transactions on Programming Languages and Systems (TOPLAS)", "volume": "16", "number": "3", "publisher": "ACM", "pagerange": "577-604", "id_number": "CaltechAUTHORS:20161020-135051459", "issn": "0164-0925", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161020-135051459", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Advanced Research Projects Agency (ARPA)", "grant_number": "8176" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-91-J-1986" }, { "agency": "NSF", "grant_number": "CCR-8809615" }, { "agency": "NSF", "grant_number": "ASC-9157650" } ] }, "doi": "10.1145/177492.177612", "resource_type": "article", "pub_year": "1994", "author_list": "Foster, Ian and Taylor, Stephen" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/j6w33-z1591", "eprint_id": 26765, "eprint_status": "archive", "datestamp": "2023-08-20 02:01:58", "lastmod": "2024-01-13 05:38:38", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Heirich-A", "name": { "family": "Heirich", "given": "Alan" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } } ] }, "title": "A Parabolic Theory of Load Balance", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 1993 California Institute of Technology. \n\nThe research described in this report is sponsored primarily by Lite Defense Advanced research Projects Agency, DARPA Order number 8176, and monitored by the Office of Naval Research under contract number N00014-91-J-1986.\n\nSubmitted - cstr93.pdf
Submitted - postscript.ps
", "abstract": "We derive analytical results for a dynamic load balancing algorithm modeled by the heat equation ut = V2u. The model is appropriate for quickly diffusing disturbances in a local region of a computational domain without affecting other parts of the domain. The algorithm is useful for problems in computational fluid dynamics which involve moving boundaries and adaptive grids implemented on mesh connected multicomputers. The algorithm preserves task locality and uses only local communication. Resulting load distributions approximate time asymptotic solutions of the heat equation. As a consequence it is possible to predict both the rate of convergence and the quality of the final load distribution. These predictions suggest that a typical imbalance on a multicomputer with over a million processors can be reduced by one order of magnitude after 105 arithmetic operations at each processor. For large n the time complexity to reduce the expected imbalance is effectively independent of n.", "date": "1993", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:1993.cs-tr-93-25", "official_url": "https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-25", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "funders": { "items": [ { "agency": "Defense Advanced Research Projects Agency (DARPA)", "grant_number": "8176" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-91-J-1986" } ] }, "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/Z91R6NJD", "primary_object": { "basename": "postscript.ps", "url": "https://authors.library.caltech.edu/records/j6w33-z1591/files/postscript.ps" }, "related_objects": [ { "basename": "cstr93.pdf", "url": "https://authors.library.caltech.edu/records/j6w33-z1591/files/cstr93.pdf" } ], "resource_type": "monograph", "pub_year": "1993", "author_list": "Heirich, Alan and Taylor, Stephen" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/zexrd-y1267", "eprint_id": 27090, "eprint_status": "archive", "datestamp": "2023-08-20 00:43:17", "lastmod": "2023-12-22 19:29:55", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Foster-I", "name": { "family": "Foster", "given": "Ian" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } } ] }, "title": "A compiler approach to scalable concurrent program design", "ispublished": "unpub", "full_text_status": "public", "note": "This research is sponsored by the Defense Advanced Research Projects Agency, DARPA Order 8176, monitored by the Office of Naval Research under contract N00014-91-J-1986, and by the National Science Foundation under Contract NSF CCR-8809615.", "abstract": "The programmer's most powerful tool for controlling complexity in program design is abstraction. We seek to use abstraction in the design of concurrent programs, so as to\nseparate design decisions concerned with decomposition, communication, synchronization, mapping, granularity, and load balancing. This paper describes programming and compiler techniques intended to facilitate this design strategy. The programming techniques are based on a core programming notation with two important properties: the ability to separate concurrent programming concerns, and extensibility with reusable programmer-defined\nabstractions. The compiler techniques are based on a simple transformation system together with a set of compilation transformations and portable run-time support. The\ntransformation system allows programmer-defined abstractions to be defined as source-to-source transformations that convert abstractions into the core notation. The same\ntransformation system is used to apply compilation transformations that incrementally transform the core notation toward an abstract concurrent machine. This machine can be implemented on a variety of concurrent architectures using simple run-time support.\n\nThe transformation, compilation, and run-time system techniques have been implemented and are incorporated in a public-domain program development toolkit. This\ntoolkit operates on a wide variety of networked workstations, multicomputers, and shared-memory\nmultiprocessors. It includes a program transformer, concurrent compiler, syntax checker, debugger, performance analyzer, and execution animator. A variety of substantial\napplications have been developed using the toolkit, in areas such as climate modeling and fluid dynamics.", "date": "1992", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:1992.cs-tr-92-07", "official_url": "https://resolver.caltech.edu/CaltechCSTR:1992.cs-tr-92-07", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/zexrd-y1267", "primary_object": { "basename": "CS-TR-92-07.pdf", "url": "https://authors.library.caltech.edu/records/zexrd-y1267/files/CS-TR-92-07.pdf" }, "resource_type": "monograph", "pub_year": "1992", "author_list": "Foster, Ian and Taylor, Stephen" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/0e4b6-23093", "eprint_id": 78865, "eprint_status": "archive", "datestamp": "2023-08-20 00:51:30", "lastmod": "2024-01-13 20:32:04", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } } ] }, "title": "Program Composition Notation", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 1992 Elsevier B.V.", "abstract": "Program Composition Notation (PCN) is a notation for composing programs. The programs that are composed may be expressed in base languages, such as Fortran, Lisp, or Strand or in PCN itself. The PCN research effort has a narrow focus. The chapter explains the program composition operators. The traditional method of constructing programs is by sequential composition. The chapter presents the evaluation the thesis that other forms of program composition are helpful, and that programmers should be able to define their own composition operators for program composition. A goal of an effort is to identify proof rules for the composition operators, and to evaluate their efficacy in reasoning about programs. A unifying framework has been proposed for developing numeric, symbolic, and reactive programs. The focus is to develop programs by stepwise refinement, starting with programs with simpler proofs and refining them if they are not adequately efficient. PCN is an outgrowth of UNITY and Strand. It has the basic data types: boolean, integer, single and double precision floating point number, character, and string. The initial value of a variable of a basic data type is arbitrary. The chapter also explores that a PCN has a data type called synch, for synchronization. The initial value of a synch variable is a special symbol, \u03c6 that indicates that the variable is undefined. Programmers have the obligation of proving that a synch variable is assigned at most one value. Given such a proof, a synch variable is both undefined (\u03c6), or it is defined and its definition remains unchanged. A synch variable can be assigned a value of any type.", "date": "1992", "date_type": "published", "publisher": "Elsevier", "place_of_pub": "Amsterdam", "pagerange": "263-295", "id_number": "CaltechAUTHORS:20170707-135456200", "isbn": "978-0-444-88135-9", "book_title": "A Comparative Study of Parallel Programming Languages: the Salishan Problems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170707-135456200", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "contributors": { "items": [ { "id": "Feo-J-T", "name": { "family": "Feo", "given": "J. T." } } ] }, "doi": "10.1016/B978-0-444-88135-9.50012-7", "resource_type": "book_section", "pub_year": "1992", "author_list": "Chandy, K. Mani and Taylor, Stephen" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/0779e-dms14", "eprint_id": 26726, "eprint_status": "archive", "datestamp": "2023-08-19 22:23:23", "lastmod": "2023-12-22 19:24:00", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } } ] }, "title": "A Primer for Program Composition Notation", "ispublished": "unpub", "full_text_status": "public", "abstract": "This primer describes a notation for program composition. Program composition is putting programs together to get larger ones. PCN (Program Composition Notation) is a programming language that allows programmers to compose programs so that composed programs execute efficiently on uniprocessors, distributed-memory multicomputers or shared-memory multiprocessors. (Revised December 12, 1990)", "date": "1990-01-01", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:1990.cs-tr-90-10", "official_url": "https://resolver.caltech.edu/CaltechCSTR:1990.cs-tr-90-10", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/0779e-dms14", "primary_object": { "basename": "CS-TR-90-10.pdf", "url": "https://authors.library.caltech.edu/records/0779e-dms14/files/CS-TR-90-10.pdf" }, "resource_type": "monograph", "pub_year": "1990", "author_list": "Chandy, K. Mani and Taylor, Stephen" }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/wemek-2ns55", "eprint_id": 26722, "eprint_status": "archive", "datestamp": "2023-08-19 22:22:42", "lastmod": "2023-12-22 19:23:52", "type": "monograph", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } }, { "id": "Kesselman-C", "name": { "family": "Kesselman", "given": "Carl" } }, { "id": "Foster-I", "name": { "family": "Foster", "given": "Ian" } } ] }, "title": "The Program Composition Project", "ispublished": "unpub", "full_text_status": "public", "abstract": "No abstract available.", "date": "1990-01-01", "date_type": "published", "publisher": "California Institute of Technology", "id_number": "CaltechCSTR:1990.cs-tr-90-03", "official_url": "https://resolver.caltech.edu/CaltechCSTR:1990.cs-tr-90-03", "rights": "You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.", "local_group": { "items": [ { "id": "Computer-Science-Technical-Reports" } ] }, "doi": "10.7907/wemek-2ns55", "primary_object": { "basename": "postscript.pdf", "url": "https://authors.library.caltech.edu/records/wemek-2ns55/files/postscript.pdf" }, "related_objects": [ { "basename": "postscript.ps", "url": "https://authors.library.caltech.edu/records/wemek-2ns55/files/postscript.ps" } ], "resource_type": "monograph", "pub_year": "1990", "author_list": "Chandy, K. Mani; Taylor, Stephen; et el." }, { "id": "https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/xebwc-4yq65", "eprint_id": 69785, "eprint_status": "archive", "datestamp": "2023-08-19 21:59:17", "lastmod": "2023-10-20 20:36:44", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Taylor-S", "name": { "family": "Taylor", "given": "Stephen" } } ] }, "title": "The Composition of Concurrent Programs", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 1989 ACM. \n\nThis work was supported in part by JTFPMO grant coordinated by JPL and by DARPA, order numer 6202, monitored by ONR, N0001487-K-0745.", "abstract": "This paper describes a notation for concurrent programs\ncalled PCN for Program Composition Notation. The\nnotation is being implemented at Caltech on multicomputers\n(a network of computers that communicate by\nsending and receiving messages). A fragment of this\nnotation has been implemented on a data-parallel computer\n- the Connection Machine - by Rajive Bagrodia\nat UCLA. PCN is an outgrowth of research on UNITY\n(1) and Strand (2). The central ideas underlying PCN\naxe discussed next.", "date": "1989-11", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "557-561", "id_number": "CaltechAUTHORS:20160819-105930876", "isbn": "0-89791-341-8", "book_title": "Supercomputing '89 Proceedings of the 1989 ACM/IEEE conference on Supercomputing", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160819-105930876", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Joint Tactical Fusion Program Management Office (JTFPMO)" }, { "agency": "Defense Advanced Research Projects Agency (DARPA)", "grant_number": "6202" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N0001487-K-0745" } ] }, "doi": "10.1145/76263.76325", "resource_type": "book_section", "pub_year": "1989", "author_list": "Chandy, K. Mani and Taylor, Stephen" } ]