1 citations
- University of British ColumbiaCA3 papers
- High Energy Accelerator Research OrganizationJP2 papers
- Kyoto UniversityJP2 papers
- McGill UniversityCA2 papers
- Nagoya UniversityJP2 papers
- North Carolina State UniversityUS2 papers
- Oak Ridge National LaboratoryUS2 papers
- Simon Fraser UniversityCA2 papers
- The University of OsakaJP2 papers
- Universidad Nacional Autónoma de MéxicoMX2 papers
- University of ManitobaCA2 papers
- University of Northern British ColumbiaCA2 papers
15 papers
Inductive Inference of Cellular Automata
Martin Kutrib, Ian McQuillan, Priscilla Raucci +1
Inductive inference of one- and two-way cellular automata (CA) is considered. This involves inferring a CA that is compatible with a finite amount of available data. In this paper,…
A Unified Model for Cross-Domain Clone Detection via Model Merging
Palash R. Roy, Banani Roy, Kevin A. Schneider +1
The growing diversity of code clone types, from syntactic copies to cross-language semantic clones to AI-generated duplicates, has created a fragmentation crisis in clone detection…
MergeSE: Post-Hoc Model Merging for Software Engineering Tasks Without Retraining
Palash R. Roy, Banani Roy, Kevin A. Schneider +1
Fine-tuned code models often behave as domain specialists and can degrade sharply under distribution shift: in our clone-detection setting, a model trained on same-language clones…
One-step decellularization of porcine uterine tissue for developing alginate-decellularized uterine ECM hydrogel for uterine tissue engineering
Abbas Fazel Anvari Yazdi, Kobra Tahermanesh, Maryam Ejlali +6
Decellularized uterine extracellular matrix (dUECM) is promising for uterine tissue engineering because of its inherent bioactivity and structural complexity. However, transforming…
A QUBO Formulation for Nowhere-Zero -Flows
Ali Lotfi, Adam Carter, Mohammad Meysami +4
We consider the encoding of graph problems as Quadratic Unconstrained Binary Optimization (QUBO) problems, which are solvable by either quantum or classical annealers. Yet, the cla…
Language Acceptors with a Pushdown: Characterizations and Complexity
Oscar H. Ibarra, Ian McQuillan
We study one-way nondeterministic pushdown automata (NPDA), optionally with reversal-bounded counters. Finite-turn pushdown automata are pushdown automata with a bound on the numbe…