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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Karen Rudie

dblp:23/2503 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0002-8675-334XORCID · verified

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

Software engineering, systems software and programming languages · 3Applied, interdisciplinary, general and emerging computing · 2Artificial intelligence and machine learning · 1 · 1 since 2021Security and privacy · 1Theory of computation · 1 · 1 first-author

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
Language models and text generation · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%
Software engineering, system software, and programming languages
1 paper
Concurrent programming · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
pre-trained language model
0.812024
Collaboration or Corporate Capture? Quantifying NLP's Reliance on Industry Artifacts and Contributions · ACL (1) 2024
Computational social science and digital humanities
science of science
0.212024
Collaboration or Corporate Capture? Quantifying NLP's Reliance on Industry Artifacts and Contributions · ACL (1) 2024
Concurrent programming
concurrency control
0.112008
Generation of concurrency control code using discrete-event systems theory · SIGSOFT FSE 2008

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

survey · 1.5citation analysis · 1.5supervisory control · 0.1discrete-event systems theory · 0.1
YearPublicationVenuePosition
2024 Collaboration or Corporate Capture? Quantifying NLP's Reliance on Industry Artifacts and Contributions
abstract
Impressive performance of pre-trained models has garnered public attention and made news headlines in recent years.Almost always, these models are produced by or in collaboration with industry.Using them is critical for competing on natural language processing (NLP) benchmarks and correspondingly to stay relevant in NLP research.We surveyed 100 papers published at EMNLP 2022 to determine the degree to which researchers rely on industry models, other artifacts, and contributions to publish in prestigious NLP venues and found that the ratio of their citation is at least three times greater than what would be expected.Our work serves as a scaffold to enable future researchers to more accurately address whether: 1) Collaboration with industry is still collaboration in the absence of an alternative or 2) if NLP inquiry has been captured by the motivations and research direction of private corporations.
Will Aitken, Mohamed Abdalla 0001, Karen Rudie, Catherine Stinson
ACL (1)3
2019 Optimal Information Release for Mixed Opacity in Discrete-Event Systems
abstract
Opacity is a property of a system that captures whether certain event sequences (or certain states) are indistinguishable from other event sequences (or states) in the system. Opacity is used in analyzing privacy, secrecy, and other aspects of systems modeled by discrete-event systems. In this paper, we introduce the concept of minimal information release policies for non-opacity and the concept of mixed opacity. Mixed opacity policies are introduced as a holistic approach for solving problems that involve a combination of releasing information to make some objectives of the system opaque while making some other objectives non-opaque. We present a set of algorithms for information release under a mixed opacity policy. These algorithms compute policies in a system such that two given sublanguages are opaque, and at the same time, two other sublanguages in the same system are non-opaque. The application of mixed opacity is demonstrated on the Dining Cryptographers Problem.
Behnam Behinaein, Feng Lin 0001, Karen Rudie
IEEE Trans Autom. Sci. Eng.3
2018 Petri Net Siphon Analysis and Graph Theoretic Measures for Identifying Combination Therapies in Cancer
abstract
Epidermal Growth Factor Receptor (EGFR) signaling to the Ras-MAPK pathway is implicated in the development and progression of cancer and is a major focus of targeted combination therapies. Physiochemical models have been used for identifying and testing the signal-inhibiting potential of targeted therapies, however, their application to larger multi-pathway networks is limited by the availability of experimentally-determined rate and concentration parameters. An alternate strategy for identifying and evaluating drug-targetable nodes is proposed. A physiochemical model of EGFR-Ras-MAPK signaling is implemented and calibrated to experimental data. Essential topological features of the model are converted into a Petri net and nodes that behave as siphons-a structural property of Petri nets-are identified. Siphons represent potential drug-targets since they are unrecoverable if their values fall below a threshold. Centrality measures are then used to prioritize siphons identified as candidate drug-targets. Single and multiple drug-target combinations are identified which correspond to clinically relevant drug targets and exhibit inhibition synergy in physiochemical simulations of EGF-induced EGFR-Ras-MAPK signaling. Taken together, these studies suggest that siphons and centrality analyses are a promising computational strategy to identify and rank drug-targetable nodes in larger networks as they do not require knowledge of the dynamics of the system, but rely solely on topology.
Behnam Behinaein, Karen Rudie, Waheed Sangrar
IEEE ACM Trans. Comput. Biol. Bioinform.2
2015 A Model for Industrial Real-Time Systems
Md Tawhid Bin Waez, Andrzej Wasowski, Jürgen Dingel, Karen Rudie
VMCAI4
2014 Concurrency control generation for dynamic threads using discrete-event systems
Anthony Auer, Jürgen Dingel, Karen Rudie
Sci. Comput. Program.3
2010 A Summary of Some Discrete-Event System Control Problems
Karen Rudie
CIAA1
2008 Towards Incorporating Discrete-Event Systems in Secure Software Development
abstract
When designers and developers create software they often overlook issues related to security. Ideally, protection of the program from illegal usage would be considered at each stage of this program's life cycle. The proposition put forward here is to augment intrusion detection systems (IDSs) and employ them as a tool to support secure software development. Many state-based intrusion detection methods share structural and behavioural similarities with the set of processes known as discrete-event systems (DESs). A common structure for modelling DESs is the deterministic finite-state automaton. There exist several compatible anomaly detection techniques which construct finite- state machine models of normal behaviour through the decomposition of associated data (e.g., system calls, HTTP requests) into sequences of events. This paper proposes the application of decentralized DES theory to formally analyze and enhance these approaches to anomaly detection with misuse prevention. Models of misuse attacks are generated in the same manner as the legal usage representation, then augmented and integrated into the program model to prevent the execution of malicious sequences. The technique described herein simultaneously uses anomaly and misuse approaches to prevent and disable attacks before their completion.
Sarah-Jane Whittaker, Mohammad Zulkernine, Karen Rudie
ARES3
2008 Generation of concurrency control code using discrete-event systems theory
abstract
The development of controls for the execution of concurrent code is non-trivial. We show how existing discrete-event system (DES) theory can be successfully applied to this problem. From code without concurrency controls and a specification of desired behaviours, concurrency control code is generated. By applying rigorously proven DES theory, we guarantee that the control scheme is nonblocking (and thus free of both deadlock and livelock) and minimally restrictive. Some conflicts between specifications and source can be automatically resolved without introducing new specifications. Moreover, the approach is independent of specific programming or specification languages. Two examples using Java are presented to illustrate the approach. Additional applicable DES results are discussed as future work.
Christopher Dragert, Jürgen Dingel, Karen Rudie
SIGSOFT FSE3