skip to main content
Explore Scholarly Publications and Datasets in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 3

Search for: All records

Creators/Authors contains: "Saule, Erik"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ( , IEEE International Parallel and Distributed Processing Symposium (IPDPS))
    Free, publicly-accessible full text available May 22, 2023
  2. ; ; ( , 2021 IEEE 28th International Conference on High Performance Computing, Data and Analytics Workshop (HiPCW))
    Free, publicly-accessible full text available December 1, 2022
  3. ; ( , Proceedings of the ICPP Workshops on)
    Free, publicly-accessible full text available August 18, 2022
  4. ; ; ; ; ; ( , Journal of parallel and distributed computing)
    Free, publicly-accessible full text available October 1, 2022
  5. ; ; ; ; ; ( , Journal of Parallel and Distributed Computing)
    Full Text Available 
  6. ; ; ; ; ; ( , Proceedings of the 52nd ACM Technical Symposium on Computer Science Education)
    Full Text Available 
  7. ; ; ; ; ( , BioData Mining)
    Abstract The use of graph theory models is widespread in biological pathway analyses as it is often desired to evaluate the position of genes and proteins in their interaction networks of the biological systems. In this article, we argue that the common standard graph centrality measures do not sufficiently capture the informative topological organizations of the pathways, and thus, limit the biological inference. While key pathway elements may appear both upstream and downstream in pathways, standard directed graph centralities attribute significant topological importance to the upstream elements and evaluate the downstream elements as having no importance.We present a directed graphmore »framework, Source/Sink Centrality (SSC), to address the limitations of standard models. SSC separately measures the importance of a node in the upstream and the downstream of a pathway, as a sender and a receiver of biological signals, and combines the two terms for evaluating the centrality. To validate SSC, we evaluate the topological position of known human cancer genes and mouse lethal genes in their respective KEGG annotated pathways and show that SSC-derived centralities provide an effective framework for associating higher positional importance to the genes with higher importance from a priori knowledge. While the presented work challenges some of the modeling assumptions in the common pathway analyses, it provides a straight-forward methodology to extend the existing models. The SSC extensions can result in more informative topological description of pathways, and thus, more informative biological inference.« less
    Full Text Available 
  8. ; ; ; ; ; ; ( , CCSC CP)
    Early programming courses, such as CS1, are an important time to capture the interest of the students while imparting important technical knowledge. Yet many CS1 sections use contrived assignments and activities that tend to make students uninterested and doubt the usefulness of the content. We demonstrate that one can make an interesting CS1 experience for students by coupling interesting datasets with visual representations and interactive applications. Our approach enables teaching an engaging early programming course without changing the content of that course. This approach relies on the BRIDGES system that has been under development for the past 5 years; BRIDGESmore »provides easy access to datasets and interactive applications. The assignments we present are all scaffolded to be directly integrated into most early programming courses to make routine topics more compelling and exciting.« less
    Accepted Manuscript Full Text Available
  9. ; ; ( , SIGCSE '20: Proceedings of the 51st ACM Technical Symposium on Computer Science Education)
    This workshop provides instructors with a hands-on introduction to BRIDGES, a software infrastructure for programming assignments in early computer science courses, including introductory programming (CS1, CS2), data structures, and algorithm analysis. BRIDGES provides capabilities for creating more engaging programming assignments, including: (1) a simplified API for accessing real-world data sets, including from social networks; scientific, government, and civic organizations; and movie, music, and literature collections; (2) interesting visualizations of the data, (3) an easy to use API that supports creation of games that leverage real-world data, and, (4) algorithm benchmarking. Workshop attendees will engage in hands-on experience with BRIDGES withmore »multiple datasets and will have the opportunity to discuss how BRIDGES can be used in their own courses.« less
    Full Text Available 
  10. ; ; ; ; ; ; ( , CCSC NE)
    Computer Science students in algorithm courses often drop out and feel that what they are learning is disconnected from real life programming. Instructors, on the other hand, feel that algorithmic content is foundational for the long term development of students. The disconnect seems to stem from students not perceiving the importance of algorithmic paradigms, and how they impact performance in applications. We present the point of view that by solving real-world problems where algorithmic paradigms and complexity matter, students will become more engaged with the course and appreciate its importance. Our approach relies on a lean educational framework that providesmore »simplified access to real life datasets and benchmarking features. The assignments we present are all scaffolded, and easily integrated into most algorithms courses. Feedback from using some of the assignments in various courses is presented to argue for the validity of the approach.« less
    Accepted Manuscript Full Text Available