Browsing Mathematics (Faculty of) by Type "Article"
Now showing items 21-40 of 321
-
Bifurcation of Bounded Solutions of Impulsive Differential Equations
(World Scientific Publishing, 2016-12-30)In this article, we examine nonautonomous bifurcation patterns in nonlinear systems of impulsive differential equations. The approach is based on Lyapunov–Schmidt reduction applied to the linearization of a particular ... -
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two
(Association for Computing Machinery, 2018-01)We consider the problem of constructing fast and small binary adder circuits. Among widely used adders, the Kogge-Stone adder is often considered the fastest, because it computes the carry bits for two n-bit numbers (where ... -
Bounded Rationality Alters The Dynamics Of Paediatric Immunization Acceptance
(Nature Publishing Group, 2015-06-02)Interactions between disease dynamics and vaccinating behavior have been explored in many coupled behavior-disease models. Cognitive effects such as risk perception, framing, and subjective probabilities of adverse events ... -
Budget-constrained optimal insurance without the nonnegativity constraint on indemnities
(Elsevier, 2019-01)In a problem of Pareto-efficient insurance contracting (bilateral risk sharing) with expected-utility preferences, Gollier (1987) relaxes the nonnegativity constraint on indemnities and argues that the existence of a ... -
Carrot Or Stick? Modelling How Landowner Behavioural Responses Can Cause Incentive-Based Forest Governance To Backfire
(Public Library of Science, 2013-10-30)Mitigating the negative impacts of declining worldwide forest cover remains a significant socio-ecological challenge, due to the dominant role of human decision-making. Here we use a Markov chain model of land-use dynamics ... -
Caterpillars in Erdős–Hajnal
(Elsevier, 2019-05)Let T be a tree such that all its vertices of degree more than two lie on one path; that is, T is a caterpillar subdivision. We prove that there exists ε > 0 such that for every graph G with |V(G)| ≥ 2 not containing T as ... -
A cell-centred finite volume method for the Poisson problem on non-graded quadtrees with second order accurate gradients
(Elsevier, 2017-02-15)This paper introduces a two-dimensional cell-centred finite volume discretization of the Poisson problem on adaptive Cartesian quadtree grids which exhibits second order accuracy in both "the solution and its gradients, ... -
Characteristics of quasistationary near-wall turbulence subjected to strong stable stratification in open-channel flows
(American Physical Society, 2020-06-05)Characteristics of near-wall turbulence at quasistationarity under strong wall cooling are studied using direct numerical simulation of open-channel flow. It is shown that if turbulence reaches quasistationarity, then the ... -
Coevolution Of Risk Perception, Sexual Behaviour, And Hiv Transmission In An Agent-Based Model
(Elsevier, 2013-11-21)Risk perception shapes individual behaviour, and is in turn shaped by the consequences of that behaviour. Here we explore this dynamics in the context of human immunodeficiency virus (HIV) spread. We construct a simplified ... -
Cohort study design for illness-death processes with disease status under intermittent observation
(Taylor & Francis, 2019-12-12)Cohort studies are routinely conducted to learn about the incidence or progression rates of chronic diseases. The illness-death model offers a natural framework for joint consideration of non-fatal events in the semi-competing ... -
Colouring perfect graphs with bounded clique number
(Elsevier, 2017-01)A graph is perfect if the chromatic number of every induced subgraph equals the size of its largest clique, and an algorithm of Grötschel, Lovász, and Schrijver [9] from 1988 finds an optimal colouring of a perfect graph ... -
Compact ideals and rigidity of representations for amenable operator algebras
(Polish Academy of Sciences, 2019)We examine rigidity phenomena for representations of amenable operator algebras which have an ideal of compact operators. We establish that a generalized version of Kadison’s conjecture on completely bounded homomorphisms ... -
Comparing malaria surveillance with periodic spraying in the presence of insecticide-resistant mosquitoes: Should we spray regularly or based on human infections?
(Elsevier, 2016-06-01)There is an urgent need for more understanding of the effects of surveillance on malaria control. Indoor residual spraying has had beneficial effects on global malaria reduction, but resistance to the insecticide poses a ... -
Competition Between Injunctive Social Norms And Conservation Priorities Gives Rise To Complex Dynamics In A Model Of Forest Growth And Opinion Dynamics
(Elsevier, 2017-11-07)Human and environmental systems are often treated as existing in isolation from one another, whereas in fact they are often two parts of a single, coupled human-environment system. Developing theoretical models of coupled ... -
A Complete Multipartite Basis for the Chromatic Symmetric Function
(Society for Industrial and Applied Mathematics, 2021-11-15)In the vector space of symmetric functions, the elements of the basis of elementary symmetric functions are (up to a factor) the chromatic symmetric functions of disjoint unions of cliques. We consider their graph complements, ... -
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph
(Society for Industrial and Applied Mathematics, 2022-08-30)For a positive integer r and graphs G and H, we denote by G+H the disjoint union of G and H and by rH the union of r mutually disjoint copies of H. Also, we say G is H-free if H is not isomorphic to an induced subgraph of ... -
Complexity Of Atoms Of Regular Languages
(World Scientific Publishing, 2013-11-01)The quotient complexity of a regular language L, which is the same as its state complexity the number of left quotients of L. An atom of a non-empty regular language L with n quotients is a non-empty intersection of the n ... -
Complexity of proper prefix-convex regular languages
(Elsevier, 2019-10-01)A language L over an alphabet Σ is prefix-convex if, for any words x,y,z ∈ Σ*, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages, which were ... -
Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages
(Institute of Informatics: University of Szeged, 2017)A language L over an alphabet E is prefix-convex if, for any words x, y, z is an element of Sigma*, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free ... -
Complexity of Suffix-Free Regular Languages
(Elsevier, 2017-11-01)We study various complexity properties of suffix-free regular languages. A sequence (Lk,Lk+1,…) of regular languages in some class, where n is the quotient complexity of Ln, is most complex if its languages Ln meet the ...