Reasoning short cuts in infinite domain constraint satisfaction: Algorithms and lower bounds for backdoors

A backdoor in a finite-domain CSP instance is a set of variables where each possible instantiation moves the instance into a polynomial-time solvable class. Backdoors have found many applications in artificial intelligence and elsewhere, and the algorithmic problem of finding such backdoors has consequently been intensively studied. Sioutis and Janhunen (KI, 2019) have proposed a generalised backdoor concept suitable for infinite-domain CSP instances over binary constraints. We generalise their concept into a large class of CSPs that allow for higher-arity constraints. We show that this kind of infinite-domain backdoors have many of the positive computational properties that finite-domain backdoors have: the associated computational problems are fixed-parameter tractable whenever the underlying constraint language is finite. On the other hand, we show that infinite languages make the problems considerably harder

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis

Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT($\cdot$) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation $R$ such that SAT($R$) can be solved at least as fast as any other NP-hard SAT($\cdot$) problem. In this paper we extend this method and show that such languages also exist for the max ones problem (MaxOnes($\Gamma$)) and the Boolean valued constraint satisfaction problem over finite-valued constraint languages (VCSP($\Delta$)). With the help of these languages we relate MaxOnes and VCSP to the exponential time hypothesis in several different ways.Comment: This is an extended version of Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis, appearing in Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science MFCS 2014 Budapest, August 25-29, 201

Crossing Paths with Hans Bodlaender:A Personal View on Cross-Composition for Sparsification Lower Bounds

On the occasion of Hans Bodlaender’s 60th birthday, I give a personal account of our history and work together on the technique of cross-composition for kernelization lower bounds. I present several simple new proofs for polynomial kernelization lower bounds using cross-composition, interlaced with personal anecdotes about my time as Hans’ PhD student at Utrecht University. Concretely, I will prove that Vertex Cover, Feedback Vertex Set, and the H-Factor problem for every graph H that has a connected component of at least three vertices, do not admit kernels of (formula presented) bits when parameterized by the number of vertices n for any (formula presented), unless (formula presented). These lower bounds are obtained by elementary gadget constructions, in particular avoiding the use of the Packing Lemma by Dell and van Melkebeek.</p

The Role of Health Systems Factors in Facilitating Access to Psychotropic Medicines: A Cross-Sectional Analysis of the WHO-AIMS in 63 Low- and Middle-Income Countries

In a cross-sectional analysis of WHO-AIMS data, Ryan McBain and colleagues investigate the associations between health system components and access to psychotropic drugs in 63 low and middle income countries

The evolution of the plastid chromosome in land plants: gene content, gene order, gene function

This review bridges functional and evolutionary aspects of plastid chromosome architecture in land plants and their putative ancestors. We provide an overview on the structure and composition of the plastid genome of land plants as well as the functions of its genes in an explicit phylogenetic and evolutionary context. We will discuss the architecture of land plant plastid chromosomes, including gene content and synteny across land plants. Moreover, we will explore the functions and roles of plastid encoded genes in metabolism and their evolutionary importance regarding gene retention and conservation. We suggest that the slow mode at which the plastome typically evolves is likely to be influenced by a combination of different molecular mechanisms. These include the organization of plastid genes in operons, the usually uniparental mode of plastid inheritance, the activity of highly effective repair mechanisms as well as the rarity of plastid fusion. Nevertheless, structurally rearranged plastomes can be found in several unrelated lineages (e.g. ferns, Pinaceae, multiple angiosperm families). Rearrangements and gene losses seem to correlate with an unusual mode of plastid transmission, abundance of repeats, or a heterotrophic lifestyle (parasites or myco-heterotrophs). While only a few functional gene gains and more frequent gene losses have been inferred for land plants, the plastid Ndh complex is one example of multiple independent gene losses and will be discussed in detail. Patterns of ndh-gene loss and functional analyses indicate that these losses are usually found in plant groups with a certain degree of heterotrophy, might rendering plastid encoded Ndh1 subunits dispensable

Percepção dos consumidores relativamente à carne de bovino: critérios de escolha a partir de grupos de discussão

Nas economias desenvolvidas, a segurança dos alimentos, o bem‑estar animal e o ambiente têm vindo a assumir relevância nas preocupações dos consumidores. Procurámos saber, através da metodologia dos grupos de discussão (focus groups) realizados em duas cidades de Portugal, Lisboa e Porto, as preocupações e perceções dos consumidores relativamente a estes atributos, os quais são essencialmente acreditados. Este conhecimento é fundamental para a aplicação posterior de métodos de preferências declaradas. Foi ainda possível obter, com base em exercícios de seleção entre carnes diferenciadas, e através de um modelo logit, intervalos de preços passíveis de serem utilizados posteriormente na definição de cenários em experiências de escolha (método de preferências declaradas) -----ABSTRACT-----In developed economies, food safety, animal welfare and the environment have become relevant consumers’ concerns. We conducted several focus groups in two Portuguese cities, Lisboa and Porto, in order to get participants perceptions and concerns for these attributes, which are essentially credence attributes. This knowledge is critical for the subsequent application of stated preference methods. It was also possible to estimate, based on exercises of selection among different meats, and through a logit model, price ranges that could be used in the definition of scenarios for choice experiments (stated preference method)info:eu-repo/semantics/publishedVersio

Computational Short Cuts in Infinite Domain Constraint Satisfaction

A backdoor in a finite-domain CSP instance is a set of variables where each possible instantiation moves the instance into a polynomial-time solvable class. Backdoors have found many applications in artificial intelligence and elsewhere, and the algorithmic problem of finding such backdoors has consequently been intensively studied. Sioutis and Janhunen have proposed a generalised backdoor concept suitable for infinite-domain CSP instances over binary constraints. We generalise their concept into a large class of CSPs that allow for higher-arity constraints. We show that this kind of infinite-domain backdoors have many of the positive computational properties that finite-domain backdoors have: the associated computational problems are fixed-parameter tractable whenever the underlying constraint language is finite. On the other hand, we show that infinite languages make the problems considerably harder: the general backdoor detection problem is W[2]-hard and fixed-parameter tractability is ruled out under standard complexity-theoretic assumptions. We demonstrate that backdoors may have suboptimal behaviour on binary constraints| this is detrimental from an AI perspective where binary constraints are predominant in, for instance, spatiotemporal applications. In response to this, we introduce sidedoors as an alternative to backdoors. The fundamental computational problems for sidedoors remain fixed-parameter tractable for finite constraint language (possibly also containing non-binary relations). Moreover, the sidedoor approach has appealing computational properties that sometimes leads to faster algorithms than the backdoor approach

Designing capacity development activities of small-scale farmers in developing countries based on discrete choice experiments

A generally accepted approach to support and increase small-scale farmers living standards in developing countries is to improve their management capacities by means of agricultural training. In this respect, capacity development is the most efficient and used method to train farmers. However, there is a lack of quantitative information about farmers preferences of those activities, which are crucial to refine capacity development activities in the future. This study employs a discrete choice experiment analysing the willingness to pay to determine the preferences of small-scale farmers for agricultural training with respect to the training method, trainer, duration, location and additional offers. The main finding is that most important for farmers are training methods including demonstration. Furthermore, farmers would like to receive additional offers during the training and would like to be trained by an trainer with an academic background. Farmers are also willing to pay for these types of training. The outcomes could provide relevant politicians and other stakeholders the opportunity to improve their training programmes and, in the end, make capacity development more efficient. Acknowledgement