The problem of extending a given LOTOS speciication P to a new given version R through the addition of a component X to be developed by scratch can be formulated in terms of an equation on LOTOS terms. The algorithmic solution of such an equation is a technical problem that has not been solved in a completely satisfactorily manner till now. In this paper we present an algorithm for the solution...

Traditionally, project scheduling and material planning have been treated independently. In this research, a mixed integer programming model is presented to integrate project scheduling and materials ordering problems. The goal is to minimize the total material holding and ordering costs. In addition, an efficient metaheuristic algorithm is proposed to solve the model. The proposed algorithm is...

We present a new algorithm that constructs a fill-reducing ordering for a special class of saddle point matrices: the F -matrices. This class contains the matrix occurring after discretization of the Stokes equation on a C-grid. The commonly used approach is to construct a fill-reducing ordering for the whole matrix and then change the ordering such that it becomes feasible. We propose to compu...

A number of techniques have been developed to effectively extract and generalize planning knowledge based on expert demonstration. In this paper we consider a complementary approach to learning in which we may execute experiments designed to test hypothesized planning knowledge. In particular, we describe an algorithm that automatically generates experiments to test assertions about plan-step o...

An Approximate Minimum Degree ordering algorithm (AMD) for preordering a symmetric sparse matrix prior to numerical factorization is presented. We use techniques based on the quotient graph for matrix factorization that allow us to obtain computationally cheap bounds for the minimum degree. We show that these bounds are often equal to the actual degree. The resulting algorithm is typically much...

Assembly sequence planning (ASP) aims to find an optimal sequence to assemble a product. We propose here to use the ordering genetic algorithms (OGA) to solve this problem. The approach is based on three main ideas. Firstly, the identification of the subassemblies in the sequence is done by keeping trace of the components membership to a set of parts all along the sequence. Secondly, precedence...

The quantum anomalous Hall (QAH) effect has been recently discovered in an experiment using a thin-film topological insulator with ferromagnetic ordering and strong spin-orbit coupling. Here we investigate the spin degree of freedom of a QAH insulator and uncover the fundamental phenomenon that the edge states exhibit a topologically stable spin texture in the boundary when a chiral-like symmet...

One goal of natural language generation is to produce coherent text that presents information in a logical order. In this paper, we show that topological fields, which model high-level clausal structure, are an important component of local coherence in German. First, we show in a sentence ordering experiment that topological field information improves the entity grid model of Barzilay and Lapat...