Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Mikaela Cashman

dblp:183/8267 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
3since 2021 · last 2022
0000-0003-0620-7830ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 4 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 77% Graph learning · 23%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › exploration › intrinsic motivation
curiosity-driven exploration
0.612022
Spatial Graph Attention and Curiosity-driven Policy for Antiviral Drug Discovery · ICLR 2022
Bioinformatics and computational biology › drug discovery
antiviral drug discovery
0.612022
Spatial Graph Attention and Curiosity-driven Policy for Antiviral Drug Discovery · ICLR 2022
Software maintenance and evolution › software variability
configuration options
0.312018
Navigating the maze: the impact of configurability in bioinformatics software · ASE 2018

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 1.1graph attention network · 1.1empirical study · 0.7
YearPublicationVenuePosition
2022 Spatial Graph Attention and Curiosity-driven Policy for Antiviral Drug Discovery
Nicholas Choma, Andrew Deru Chen, Mikaela Cashman, Érica T. Prates, Verónica G. Vergara Larrea, Manesh Shah, Austin Clyde, Thomas S. Brettin, Bert de Jong, Martha S. Head, Rick L. Stevens, Peter Nugent, Daniel A. Jacobson, James B. Brown
ICLR4
2021 Reusability First: Toward FAIR Workflows
abstract
The FAIR principles of open science (Findable, Accessible, Interoperable, and Reusable) have had transformative effects on modern large-scale computational science. In particular, they have encouraged more open access to and use of data, an important consideration as collaboration among teams of researchers accelerates and the use of workflows by those teams to solve problems increases. How best to apply the FAIR principles to workflows themselves, and software more generally, is not yet well understood. We argue that the software engineering concept of technical debt management provides a useful guide for application of those principles to workflows, and in particular that it implies reusability should be considered as ‘first among equals’. Moreover, our approach recognizes a continuum of reusability where we can make explicit and selectable the tradeoffs required in workflows for both their users and developers.To this end, we propose a new abstraction approach for reusable workflows, with demonstrations for both synthetic workloads and real-world computational biology workflows. Through application of novel systems and tools that are based on this abstraction, these experimental workflows are refactored to rightsize the granularity of workflow components to efficiently fill the gap between end-user simplicity and general customizability. Our work makes it easier to selectively reason about and automate the connections between trade-offs across user and developer concerns when exposing degrees of freedom for reuse. Additionally, by exposing fine-grained reusability abstractions we enable performance optimizations, as we demonstrate on both institutional-scale and leadership-class HPC resources.
Matthew Wolf, Jeremy Logan, Kshitij Mehta, Daniel A. Jacobson, Mikaela Cashman, Angelica M. Walker, Greg Eisenhauer, Patrick M. Widener, Ashley Cliff
CLUSTER5
2021 An empirical investigation of organic software product lines
abstract
Abstract Software product line engineering is a best practice for managing reuse in families of software systems that is increasingly being applied to novel and emerging domains. In this work we investigate the use of software product line engineering in one of these new domains, synthetic biology. In synthetic biology living organisms are programmed to perform new functions or improve existing functions. These programs are designed and constructed using small building blocks made out of DNA. We conjecture that there are families of products that consist of common and variable DNA parts, and we can leverage product line engineering to help synthetic biologists build, evolve, and reuse DNA parts. In this paper we perform an investigation of domain engineering that leverages an open-source repository of more than 45,000 reusable DNA parts. We show the feasibility of these new types of product line models by identifying features and related artifacts in up to 93.5% of products, and that there is indeed both commonality and variability. We then construct feature models for four commonly engineered functions leading to product lines ranging from 10 to 7.5 × 1020 products. In a case study we demonstrate how we can use the feature models to help guide new experimentation in aspects of application engineering. Finally, in an empirical study we demonstrate the effectiveness and efficiency of automated reverse engineering on both complete and incomplete sets of products. In the process of these studies, we highlight key challenges and uncovered limitations of existing SPL techniques and tools which provide a roadmap for making SPL engineering applicable to new and emerging domains.
Mikaela Cashman, Justin W. Firestone, Myra B. Cohen, Thammasak Thianniwet
Empir. Softw. Eng.1
2020 Using a Genetic Algorithm to Optimize Configurations in a Data-Driven Application
Urjoshi Sinha, Mikaela Cashman, Myra B. Cohen
SSBSE2
2018 Navigating the maze: the impact of configurability in bioinformatics software
abstract
The bioinformatics software domain contains thousands of applications for automating tasks such as the pairwise alignment of DNA sequences, building and reasoning about metabolic models or simulating growth of an organism. Its end users range from sophisticated developers to those with little computational experience. In response to their needs, developers provide many options to customize the way their algorithms are tuned. Yet there is little or no automated help for the user in determining the consequences or impact of the options they choose. In this paper we describe our experience working with configurable bioinformatics tools. We find limited documentation and help for combining and selecting options along with variation in both functionality and performance. We also find previously undetected faults. We summarize our findings with a set of lessons learned, and present a roadmap for creating automated techniques to interact with bioinformatics software. We believe these will generalize to other types of scientific software.
Mikaela Cashman, Myra B. Cohen, Priya Ranjan, Robert W. Cottingham
ASE1
2016 Test case prioritization of build acceptance tests for an enterprise cloud application: An industrial case study
Hema Srikanth, Mikaela Cashman, Myra B. Cohen
J. Syst. Softw.2