131,429 research outputs found
Underwater sound puluse generator
No full textThesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.Includes bibliographical references (leaves 52-53).by Jayson D. Strayer.M.Eng
Lectotypification of Timonius pachyphyllus Merr. (Rubiaceae, Guettardeae)
No full textChavez, Jayson G., Alejandro, Grecebio Jonathan D., Meve, Ulrich (2017): Lectotypification of Timonius pachyphyllus Merr. (Rubiaceae, Guettardeae). Adansonia 39 (2): 145-148, DOI: 10.5252/a2017n2a
A Walk Around Beirut (2024-10-31)
No full textThursday, October 31, 12:00 (Noon); KAM Library 4th Floor RotundaPresented by Dr. Jayson Iwen, Professor and Chair, Department of Writing, Language and Literature, University of Wisconsin, Superior (UWS). Dr. Iwen taught at The American University of Beirut from 2002 to 2006. He will lead the audience on a photographic walking tour of contemporary Beirut.Royal D. Alworth, Jr. Institute for International StudiesIwen, Jayson; University of Minnesota Duluth. Royal D. Alworth, Jr. Institute for International Studies. (2024). A Walk Around Beirut (2024-10-31). Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/272143
FIG. 1 in Lectotypification of Timonius pachyphyllus Merr. (Rubiaceae, Guettardeae)
No full textFIG. 1. — Lectotype of Timonius pachyphyllus Merr., Ramos sub BS 40794 (P03906974).Published as part of Chavez, Jayson G., Alejandro, Grecebio Jonathan D. & Meve, Ulrich, 2017, Lectotypification of Timonius pachyphyllus Merr. (Rubiaceae, Guettardeae), pp. 145-148 in Adansonia 39 (2) on page 147, DOI: 10.5252/a2017n2a5, http://zenodo.org/record/459915
FIGURE 3. A-E. Aeschynanthus rejieae illustration. A in Aeschynanthus rejieae (Gesneriaceae), a new species of lipstick vine from Tawi- Tawi, Philippines
No full textFIGURE 3. A-E. Aeschynanthus rejieae illustration. A. Habit with details of leaf indumentum. B. Inflorescence. C. Calyx tube longitudinal section with pistil. D. Corolla (split ventrally). E. Front view showing details of the corolla lobes and stamens. Illustrated by Jayson Mansibang.Published as part of Olimpos, Shiella Mae B. & Mansibang, Jayson A., 2021, Aeschynanthus rejieae (Gesneriaceae), a new species of lipstick vine from Tawi- Tawi, Philippines, pp. 83-90 in Phytotaxa 487 (1) on page 87, DOI: 10.11646/phytotaxa.487.1.7, http://zenodo.org/record/542313
Recursed Is Not Recursive: A Jarring Result
No full textRecursed is a 2D puzzle platform video game featuring "treasure chests" that, when jumped into, instantiate a room that can later be exited (similar to function calls), optionally generating a "jar" that returns back to that room (similar to continuations). We prove that Recursed is RE-complete and thus undecidable (not recursive) by a reduction from the Post Correspondence Problem. Our reduction is "practical": the reduction from PCP results in fully playable levels that abide by all constraints governing levels (including the 15 × 20 room size) designed for the main game. Our reduction is also "efficient": a Turing machine can be simulated by a Recursed level whose size is linear in the encoding size of the Turing machine and whose solution length is polynomial in the running time of the Turing machine
MeSH term explosion and author rank improve expert recommendations
No full textInformation overload is an often-cited phenomenon that reduces the productivity, efficiency and efficacy of scientists. One challenge for scientists is to find appropriate collaborators in their research. The literature describes various solutions to the problem of expertise location, but most current approaches do not appear to be very suitable for expert recommendations in biomedical research. In this study, we present the development and initial evaluation of a vector space model-based algorithm to calculate researcher similarity using four inputs: 1) MeSH terms of publications; 2) MeSH terms and author rank; 3) exploded MeSH terms; and 4) exploded MeSH terms and author rank. We developed and evaluated the algorithm using a data set of 17,525 authors and their 22,542 papers. On average, our algorithms correctly predicted 2.5 of the top 5/10 coauthors of individual scientists. Exploded MeSH and author rank outperformed all other algorithms in accuracy, followed closely by MeSH and author rank. Our results show that the accuracy of MeSH term-based matching can be enhanced with other metadata such as author rank
A framework for proving the computational intractability of motion planning problems
No full textThesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020Cataloged from student-submitted PDF of thesis.Includes bibliographical references (pages 235-240).This thesis develops a framework for proving computational complexity results about motion planning problems. The model captures reactive environments with local interaction. We introduce a motion planning problem involving one or more agents that move around a connection graph and through "gadgets" which are stateful parts of the environment whose state and traversability can change only in response to traversals of the agent within the gadget. The model includes variants for 0-player, 1-player, 2-player, and team imperfect information games. This thesis considers various classes of gadgets and give both algorithms and hardness results ranging from NL-completeness to Undecidability. Full dichotomies are obtained for some classes including the natural class of gadgets which can be traversed a bounded number of times. For 1-player this gives a separation between containment in NL versus NP-completeness, for 2-player a separation between containment in P and PSPACE-completeness, and for team imperfect information games a separation between containment in P and NEXPTIME-completeness. Our model builds on and generalizes several other proof techniques for motion planning problems and games. This thesis also provides examples of how this new framework can simplify many of those old results, as well as applying to many new hardness results for video games and variants of block pushing puzzles. New hardness results include PSPACE-hardness for Trainyard, Sokobond, The Legend of Zelda: Breath of the Wild, The Legend of Zelda: The Minish Cap, The Legend of Zelda: Oracle of Seasons, Captain Toad: Treasure Tracker, Super Mario Oddsey, Super Mario Galaxy 1 and 2, Super Mario Sunshine, and Super Mario 64.by Jayson Lynch.Ph. D.Ph.D. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Scienc
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
"Closing the R&D Gap, Evaluating the Sources of R&D Spending"
No full textBoth spending and tax policies have been implemented in the United States with the goal of stimulating private sector research and development (R&D). Karier questions whether current R&D policy, especially the research and experimentation tax credit, can contribute to closing the gap between nondefense expenditures on R&D in the United States and such expenditures in other countries, such as Japan and Germany. He also explores possible changes to our current R&D policy to make it more effective.
- …
