This paper describes algorithms for generating shapes of side actions to minimize a customizable injection molding cost function. Given a set of undercut facets on a polyhedral part and the main mold opening directions, our approach works in the following manner. First, we compute candidate retraction space for every undercut facet. This space represents the set of candidate translation vectors...

This master thesis, builds on the contributions by Ejsing et al. (2012) and Dubecq et al. (2013) to shed light on the credit and liquidity risk components of sovereign bond yields. Four countries have been studied: France, the Netherlands, Germany and Spain. The task has been faced by considering several state-space models, all of them connected by the idea that the differences in the yields be...

An automatic monitoring and intervention algorithm that permits the supervision of very general aspects in an univariate linear gaussian state space model is proposed. The algorithm makes use of a model comparison and selection approach within a Bayesian framework. In addition, this algorithm incorporates the possibility of eliminating earlier interventions when subsequent evidence against them...

This paper discusses a planner of the semantics of utterances, whose essential design is an epistemic theorem prover. The planner was designed for the purpose of planning communicative actions, whose effects are famously unknowable and unobservable by the doer/speaker, and depend on the beliefs of and inferences made by the recipient/hearer. The fully implemented model can achieve goals that do...

Increasing interest has been devoted to Planning as Heuristic Search over the years. Intense research has focused on deriving accurate heuristics in polynomial computational time for domain-independent planning. This paper reports on an extensive survey and analysis of research work related to heuristic derivation techniques for state space search planning, as well as other planning paradigms. ...

This paper proposes a domain independent heuristic for state space planning, which is based on action evaluation. The heuristic obtains estimates for the cost of applying each action of the domain by performing a forward search in a relaxed version of the initial problem. The estimates for the actions are then utilized in a backward search on the original problem. The heuristic, which has been ...

The impossibility theorem of Dekel, Lipman and Rustichini [8] has been thought to demonstrate that standard state-space models cannot be used to represent unawareness. We first show that Dekel, Lipman and Rustichini do not establish this claim. We then distinguish three notions of awareness, and argue that although one of them may not be adequately modeled using standard state spaces, there is ...

The paper presents realization theory of discrete-time linear switched systems (abbreviated by DTLSSs). We present necessary and sufficient conditions for an input-output map to admit a discrete-time linear switched state-space realization. In addition, we present a characterization of minimality of discrete-time linear switched systems in terms of reachability and observability. Further, we pr...

This paper is intended to be a continuation of Habets and van Schuppen [2004] and Habets et al. [2006], which address the control problem for piecewise-affine systems on an arbitrary polytope or a family of these. Our work deals with the underlying combinatorics of the underlying discrete system. Motivated by Forman [1998], on the triangulated state space we define a combinatorial vector field,...