Mixed Integer Linear Programming For Exact Finite-Horizon Planning In Decentralized Pomdps

We consider the problem of finding an n-agent joint-policy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity (NEXP-hard in n >= 2). In this paper, we propose a new mathematical programming approach for the problem. Our approach is based on two ideas: First, we represent each agent's policy in the sequence-form and not in the tree-form, thereby obtaining a very compact representation of the set of joint-policies. Second, using this compact representation, we solve this problem as an instance of combinatorial optimization for which we formulate a mixed integer linear program (MILP). The optimal solution of the MILP directly yields an optimal joint-policy for the Dec-Pomdp. Computational experience shows that formulating and solving the MILP requires significantly less time to solve benchmark Dec-Pomdp problems than existing algorithms. For example, the multi-agent tiger problem for horizon 4 is solved in 72 secs with the MILP whereas existing algorithms require several hours to solve it

Computational characterization and prediction of metal-organic framework properties

In this introductory review, we give an overview of the computational chemistry methods commonly used in the field of metal-organic frameworks (MOFs), to describe or predict the structures themselves and characterize their various properties, either at the quantum chemical level or through classical molecular simulation. We discuss the methods for the prediction of crystal structures, geometrical properties and large-scale screening of hypothetical MOFs, as well as their thermal and mechanical properties. A separate section deals with the simulation of adsorption of fluids and fluid mixtures in MOFs

Computing the Equilibria of Bimatrix Games using Dominance Heuristics

We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structures of the graph (in particular elementary cycles) and the set of the Nash equilibria of the game. We show that finding the set of elementary cycles of the graph permits the computation of the set of equilibria. For games whose graphs have a sparse adjacency matrix, this serves as a good heuristic for computing the set of equilibria. The heuristic also allows the discarding of sections of the support space that do not yield any equilibrium, thus serving as a useful pre-processing step for algorithms that compute the equilibria through support enumeration

The Information Content of Implied Probabilities to Detect Structural Change

This paper proposes Pearson-type statistics based on implies probabilities to detect structural change. The class of generalized empirical likelihood estimators (see Smith (1997)) assigns a set of probabilities to each observation such that moment conditions are satisfied. These restricted probabilities are called implied probabilities. Implied probabilities may also be constructed for the standard GMM (see Back and Brown (1993)). The proposed test statistics for structural change are based on the information content in these implied probabilities. We consider cases of structural change with unknown breakpoint which can occur in the parameters of interest or in the overidentifying restrictions used to estimate these parameters. The test statistics considered here have good size and power properties.Generalized empirical likelihood, generalized method of moments, parameter instability, structural change

Non-Symmetric Hall-Littlewood Polynomials

Using the action of the Yang-Baxter elements of the Hecke algebra on polynomials, we define two bases of polynomials in n variables. The Hall-Littlewood polynomials are a subfamily of one of them. For q=0, these bases specialize into the two families of classical Key polynomials (i.e. Demazure characters for type A). We give a scalar product for which the two bases are adjoint of each other.Comment: Dedicated to Adriano Garsi

On the reduction of a random basis

For $g < n$, let $b\_1,...,b\_{n-g}$ be $n - g$ independent vectors in $\mathbb{R}^n$ with a common distribution invariant by rotation. Considering these vectors as a basis for the Euclidean lattice they generate, the aim of this paper is to provide asymptotic results when $n\to +\infty$ concerning the property that such a random basis is reduced in the sense of {\sc Lenstra, Lenstra & Lov\'asz}. The proof passes by the study of the process $(r\_{g+1}^{(n)},r\_{g+2}^{(n)},...,r\_{n-1}^{(n)})$ where $r\_j^{(n)}$ is the ratio of lengths of two consecutive vectors $b^*\_{n-j+1}$ and $b^*\_{n-j}$ built from $(b\_1,...,b\_{n-g})$ by the Gram--Schmidt orthogonalization procedure, which we believe to be interesting in its own. We show that, as $n\to+\infty$, the process $(r\_j^{(n)}-1)\_j$ tends in distribution in some sense to an explicit process $({\mathcal R}\_j -1)\_j$; some properties of this latter are provided

Graph Based Reduction of Program Verification Conditions

Increasing the automaticity of proofs in deductive verification of C programs is a challenging task. When applied to industrial C programs known heuristics to generate simpler verification conditions are not efficient enough. This is mainly due to their size and a high number of irrelevant hypotheses. This work presents a strategy to reduce program verification conditions by selecting their relevant hypotheses. The relevance of a hypothesis is determined by the combination of a syntactic analysis and two graph traversals. The first graph is labeled by constants and the second one by the predicates in the axioms. The approach is applied on a benchmark arising in industrial program verification

Polyimide (PI) films by chemical vapor deposition (CVD): Novel design, experiments and characterization

Polyimide (PI) has been deposited by chemical vapor deposition (CVD) under vacuum over the past 20 years. In the early nineties, studies, experiences and characterization were mostly studied as depositions from the co-evaporation of the dianhydride and diamine monomers. Later on, several studies about its different applications due to its interesting mechanical and electrical properties enhanced its development. Nowadays, not many researches around PI deposition are being carried. This paper presents a PI film deposition research project with an original CVD process design. The deposition is performed under ambient conditions (atmospheric pressure) through a gas flux vector. Design of apparatus, deposition conditions and preliminary characterizations (IR, SEM and surface analyses) are discussed

VR-PMS: a new approach for performance measurement and management of industrial systems

A new performance measurement and management framework based on value and risk is proposed. The proposed framework is applied to the modelling and evaluation of the a priori performance evaluation of manufacturing processes and to deciding on their alternatives. For this reason, it consistently integrates concepts relevant to objectives, activity, and risk in a single framework comprising a conceptual value/risk model, and it conceptualises the idea of value- and risk based performance management in a process context. In addition, a methodological framework is developed to provide guidelines for the decision-makers or performance evaluators of the processes. To facilitate the performance measurement and management process, this latter framework is organized in four phases: context establishment, performance modelling, performance assessment, and decision-making. Each phase of the framework is then instrumented with state of-the-art quantitative analysis tools and methods. For process design and evaluation, the deliverable of the value- and risk-based performance measurement and management system (VR-PMS) is a set of ranked solutions (i.e. alternative business processes) evaluated against the developed value and risk indicators. The proposed VR-PMS is illustrated with a case study from discrete parts manufacturing but is indeed applicable to a wide range of processes or systems