• Goldberg's conjecture is true for random multigraphs 

  Haxell, Penny; Krivelevich, Michael; Kronenberg, Gal (Elsevier, 2019-09)

  In the 70s, Goldberg, and independently Seymour, conjectured that for any multigraph G, the chromatic index χ′(G) satisfies χ′(G) ≤ max{∆(G)+1,⌈ρ(G)⌉}, where ρ(G) = max\{\frac {e(G[S])}{\lfloor|S|/2\rfloor} \mid S\subseteq ...

• A Stability Theorem for Matchings in Tripartite 3-Graphs 

  Haxell, Penny; Narins, Lothar (Cambridge University Press, 2018-04-02)

  It follows from known results that every regular tripartite hypergraph of positive degree, with n vertices in each class, has matching number at least n/2. This bound is best possible, and the extremal configuration is ...

• The Philosophy of Behavioral Biology 

  Reydon, Thomas; Plaisance, Kathryn S. (Springer, 2012)

  This volume offers a broad overview of central issues in the philosophy of behavioral biology, addressing philosophical issues that arise from the most recent scientific findings in biological research on behavior. It thus ...

• Show me the numbers: a quantitative portrait of the attitudes, experiences, and values of philosophers of science regarding broadly engaged work 

  Plaisance, Kathryn S.; Graham, Alexander V.; McLevey, John; Michaud, Jay (Springer, 2019-09-23)

  Philosophers of science are increasingly arguing for the importance of doing scientifically- and socially-engaged work, suggesting that we need to reduce barriers to extra-disciplinary engagement and broaden our impact. ...

• Which classes of structures are both pseudo-elementary and definable by an infinitary sentence? 

  Boney, Will; Csima, Barbara F.; Day, Nancy A.; Harrison-Trainor, Matthew (2019-03-21)

  When classes of structures are not first-order definable, we might still try to find a nice description. There are two common ways for doing this. One is to expand the language, leading to notions of pseudo-elementary ...

• A Pluralistic Approach to Interactional Expertise 

  Plaisance, Kathryn S.; Kennedy, Eric B. (Elsevier, 2014-09)

  The concept of interactional expertise – characterized by sociologists Harry Collins and Robert Evans as the ability to speak the language of a discipline without the corresponding ability to practice – can serve as a ...

• Understanding “What Could Be”: A Call for ‘Experimental Behavioral Genetics’ 

  Burt, S. Alexandra; Plaisance, Kathryn; Hambrick, David Z. (Springer, 2018-08-13)

  Behavioral genetic (BG) research has yielded many important discoveries about the origins of human behavior, but offers little insight into how we might improve outcomes. We posit that this gap in our knowledge base stems ...

• Late-lumping backstepping control of partial differential equations 

  Auriol, Jean; Morris, Kirsten A.; Di Meglio, Florent (Elsevier, 2019-02)

  We consider in this paper three different partial differential equations (PDEs) that can be exponentially stabilized using backstepping controllers. For implementation, a finite-dimensional controller is generally needed. ...

• Representing Behavioural Models with Rich Control Structures in SMT-LIB 

  Day, Nancy A.; Vakili, Amirhossein (University of Waterloo, 2015-09-01)

  We motivate and present a proposal for how to represent extended finite state machine behavioural models with rich hierarchical states and compositional control structures (e.g., the Statecharts family) in SMT-LIB. Our ...

• DASH: Declarative Modelling with Control State Hierarchy (Preliminary Version) 

  Serna, Jose; Day, Nancy A.; Esmaeilsabzali, Shahram (University of Waterloo, 2018)

  We present a new language, called DASH, for describing formal behavioural models. DASH combines common modelling constructs to describe abstractly both data and control in an integrated manner. DASH uses the Alloy language ...

• Astra Version 1.0: Evaluating Translations from Alloy to SMT-LIB 

  Abbassi, Ali; Day, Nancy A.; Rayside, Derek (2019-06-13)

  We present a variety of translation options for converting Alloy to SMT-LIB via Alloy’s Kodkod interface. Our translations, which are implemented in a library that we call Astra, are based on converting the set and relational ...

• Finite Model Finding Using the Logic of Equality with Uninterpreted Functions 

  Vakili, Amirhossein; Day, Nancy A. (Springer, 2016)

  The problem of finite model finding, finding a satisfying model for a set of first-order logic formulas for a finite scope, is an important step in many verification techniques. In MACE-style solvers, the problem is mapped ...

• Reconstructing quantum molecular rotor ground states 

  De Vlugt, Isaac J. S.; Iouchtchenko, Dmitri; Merali, Ejaaz; Roy, Pierre-Nicholas; Melko, Roger (Physical Review B, 2020-07-06)

  Nanomolecular assemblies of C60 can be synthesized to enclose dipolar molecules. The low-temperature states of such endofullerenes are described by quantum mechanical rotors, which are candidates for quantum information ...

• Representing hierarchical state machine models in SMT-LIB 

  Day, Nancy A.; Vakili, Amirhossein (ACM, 2016-05)

  We motivate and present a proposal for how to represent the syntax of behavioural models written in extended finite-state machine languages with hierarchical states (e.g., the Statecharts family) in SMT-LIB. By including ...

• Ramsey-nice families of graphs 

  Aharoni, Ron; Alon, Noga; Amir, Michal; Haxell, Penny; Hefetz, Dan; Jiang, Zilin; Kronenberg, Gal; Naor, Alon (Elsevier, 2018-08)

  For a finite family $\cF$ of fixed graphs let $R_k(\cF)$ be the smallest integer $n$ for which every $k$-coloring of the edges of the complete graph $K_n$ yields a monochromatic copy of some $F\in\cF$. We say that $\cF$ ...

• Edge coloring multigraphs without small dense subsets 

  Haxell, P.E.; Kierstead, H.A. (Elsevier, 2015-12-06)

  One consequence of a long-standing conjecture of Goldberg and Seymour about the chromatic index of multigraphs would be the following statement. Suppose $G$ is a multigraph with maximum degree $\Delta$, such that no vertex ...

• A note on intersecting hypergraphs with large cover number 

  Haxell, P.E.; Scott, A.D. (The Electronic Journal of Combinatorics, 2017-08-11)

  We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r−4 for all but finitely many r. This answers a question of Abu-Khazneh, Barát, Pokrovskiy and Szabó, and shows that a ...

• DASH: A New Language for Declarative Behavioural Requirements with Control State Hierarchy 

  Serna, Jose; Day, Nancy A.; Farheen, Sabria (IEEE, 2017-09-04)

  We present DASH, a new language for describing formal behavioural models of requirements. DASH combines the ability to write abstract, declarative transitions (as in Z or Alloy) with a labelled control state hierarchy (as ...

• An expanded shale δ98Mo record permits recurrent shallow marine oxygenation during the Neoarchean 

  Ostrander, Chadlin; Kendall, Brian; Olson, Stephanie; Lyons, Timothy; Gordon, Gwyneth; Romaniello, Stephen; Zheng, Wang; Reinhard, Christopher; Roy, Moutusi; Anbar, Ariel (Elsevier, 2020-01-20)

  Multiple attempts have been made using the ancient shale record to track the molybdenum isotope composition (δ98Mo) of seawater during the final two-hundred million years of the Archean Eon (2.7 to 2.5 billion-years-ago, ...

• Multiple negative molybdenum isotope excursions in the Doushantuo Formation (South China) fingerprint complex redox-related processes in the Ediacaran Nanhua Basin 

  Ostrander, Chadlin; Swapan, Sahoo; Kendall, Brian; Jiang, Ganqing; Planavsky, Noah; Lyons, Timothy; Nielsen, Sune; Owens, Jeremy; Gordon, Gwyneth; Romaniello, Stephen; Anbar, Ariel (Elsevier, 2019-09-15)

  The Ediacaran Doushantuo Formation offers one of the most complete and extensively studied records of end- Neoproterozoic biotic and environmental change. Here, we report multiple coeval negative molybdenum (Mo) ...

View more