430 research outputs found
BABY BOOM target genes provide diverse entry points into cell proliferation and cell growth pathways
Ectopic expression of the Brassica napus BABY BOOM (BBM) AP2/ERF transcription factor is sufficient to induce spontaneous cell proliferation leading primarily to somatic embryogenesis, but also to organogenesis and callus formation. We used DNA microarray analysis in combination with a post-translationally regulated BBM:GR protein and cycloheximide to identify target genes that are directly activated by BBM expression in Arabidopsis seedlings. We show that BBM activated the expression of a largely uncharacterized set of genes encoding proteins with potential roles in transcription, cellular signaling, cell wall biosynthesis and targeted protein turnover. A number of the target genes have been shown to be expressed in meristems or to be involved in cell wall modifications associated with dividing/growing cells. One of the BBM target genes encodes an ADF/cofilin protein, ACTIN DEPOLYMERIZING FACTOR9 (ADF9). The consequences of BBM:GR activation on the actin cytoskeleton were followed using the GFP:FIMBRIN ACTIN BINDING DOMAIN2 (GFP:FABD) actin marker. Dexamethasone-mediated BBM:GR activation induced dramatic changes in actin organization resulting in the formation of dense actin networks with high turnover rates, a phenotype that is consistent with cells that are rapidly undergoing cytoplasmic reorganization. Together the data suggest that the BBM transcription factor activates a complex network of developmental pathways associated with cell proliferation and growth
Priority-Based Human Resource Allocation in Business Processes
In Business Process Management Systems, human resource management typically covers two steps: resource assignment at design time and resource allocation at run time. Although concepts like rolebased assignment often yield several potential performers for an activity, there is a lack of mechanisms for prioritizing them, e.g., according to their skills or current workload. in this paper, we address this research gap. More specifically, we introduce an approach to define resource preferences grounded on a validated, generic user preference model initially developed for semantic web services. Furthermore, we show an implementation of the approach demonstrating its feasibility. Keywords: preference modeling, preference resolution, priority-based allocation, priority ranking, RAL, resource allocation, SOUP
Interpreting an action from what we perceive and what we expect
International audienceIn update logic as studied by Baltag, Moss, Solecki and van Benthem, little attention is paid to the interpretation of an action by an agent, which is just assumed to depend on the situation. This is actually a complex issue that nevertheless complies to some logical dynamics. In this paper, we tackle this topic. We also deal with actions that change propositional facts of the situation. In parallel, we propose a formalism to accurately represent an agent's epistemic state based on hyperreal numbers. In that respect, we use infinitesimals to express what would surprise the agents (and by how much) by contradicting their beliefs. We also use a subjective probability to model the notion of belief. It turns out that our probabilistic update mechanism satisfies the AGM postulates of belief revision
Human–agent collaboration for disaster response
In the aftermath of major disasters, first responders are typically overwhelmed with large numbers of, spatially distributed, search and rescue tasks, each with their own requirements. Moreover, responders have to operate in highly uncertain and dynamic environments where new tasks may appear and hazards may be spreading across the disaster space. Hence, rescue missions may need to be re-planned as new information comes in, tasks are completed, or new hazards are discovered. Finding an optimal allocation of resources to complete all the tasks is a major computational challenge. In this paper, we use decision theoretic techniques to solve the task allocation problem posed by emergency response planning and then deploy our solution as part of an agent-based planning tool in real-world field trials. By so doing, we are able to study the interactional issues that arise when humans are guided by an agent. Specifically, we develop an algorithm, based on a multi-agent Markov decision process representation of the task allocation problem and show that it outperforms standard baseline solutions. We then integrate the algorithm into a planning agent that responds to requests for tasks from participants in a mixed-reality location-based game, called AtomicOrchid, that simulates disaster response settings in the real-world. We then run a number of trials of our planning agent and compare it against a purely human driven system. Our analysis of these trials show that human commanders adapt to the planning agent by taking on a more supervisory role and that, by providing humans with the flexibility of requesting plans from the agent, allows them to perform more tasks more efficiently than using purely human interactions to allocate tasks. We also discuss how such flexibility could lead to poor performance if left unchecked
A Boolean Extension of KLM-Style Conditional Reasoning
Propositional KLM-style defeasible reasoning involves extending propositional logic with a new logical connective that can express defeasible (or conditional) implications, with semantics given by ordered structures known as ranked interpretations. KLM-style defeasi- ble entailment is referred to as rational whenever the defeasible entail- ment relation under consideration generates a set of defeasible implica- tions all satisfying a set of rationality postulates known as the KLM postulates. In a recent paper Booth et al. proposed PTL, a logic that is more expressive than the core KLM logic. They proved an impossibility result, showing that defeasible entailment for PTL fails to satisfy a set of rationality postulates similar in spirit to the KLM postulates. Their interpretation of the impossibility result is that defeasible entailment for PTL need not be unique. In this paper we continue the line of research in which the expressivity of the core KLM logic is extended. We present the logic Boolean KLM (BKLM) in which we allow for disjunctions, conjunctions, and negations, but not nesting, of defeasible implications. Our contribution is twofold. Firstly, we show (perhaps surprisingly) that BKLM is more expressive than PTL. Our proof is based on the fact that BKLM can characterise all single ranked interpretations, whereas PTL cannot. Secondly, given that the PTL impossibility result also applies to BKLM, we adapt the different forms of PTL entailment proposed by Booth et al. to apply to BKLM
The interaction of representations and planning objectives for decision-theoretic planning tasks
Programme evaluation training for health professionals in francophone Africa: process, competence acquisition and use
This is an Open Access article distributed under the terms of the Creative Commons Attribution Licens
Optimal control as a graphical model inference problem
We reformulate a class of non-linear stochastic optimal control problems
introduced by Todorov (2007) as a Kullback-Leibler (KL) minimization problem.
As a result, the optimal control computation reduces to an inference
computation and approximate inference methods can be applied to efficiently
compute approximate optimal controls. We show how this KL control theory
contains the path integral control method as a special case. We provide an
example of a block stacking task and a multi-agent cooperative game where we
demonstrate how approximate inference can be successfully applied to instances
that are too complex for exact computation. We discuss the relation of the KL
control approach to other inference approaches to control.Comment: 26 pages, 12 Figures; Machine Learning Journal (2012
- …