We consider multi-threaded programs with an unbounded number of threads executing a finite-state, non-recursive procedure. Safety properties of such programs can be checked via reduction to the coverability problem for wellstructured transition systems (WSTS). In this paper, we present a novel, sound and complete yet empirically much improved solution to this problem. The key idea to achieve a ...

The issues of waste generation in batch process plants differ in many aspects from those in continuous plants. Despite the smaller-scale of processing, complexities from discontinuities and run-to-run variations make waste minimization in batch plants more challenging. In this paper, we introduce an integrated qualitative-quantitative methodology and decision support system, called Batch-ENVOPE...

A common method to compute sparse solutions in compressed sensing is based on `minimization. In this paper we consider `-minimization for arbitrary 0 < p ≤ 1. More precisely, we prove stability estimates for solutions of the analysis formulation of the `minimization problem for 0 < p ≤ 1 from noisy measurements. Furthermore, our focus lies in arbitrary frames that are not necessarily tight or P...

Abstract:  In this study, the change in the crystalline structure of gas hydrate was predicted for ternary mixture of methane-ethane-water. For this purpose, the tangent plane distance (TPD) minimization method was used. First, the calculations were performed for the binary mixtures of methane-water and ethane-water as the gas and liquid phases. The results show that for a binary mixture of th...

This study presents a new evolutionary network minimization (ENM) algorithm. Neurocontroller minimization is beneficial for finding small parsimonious networks that permit a better understanding of their workings. The ENM algorithm is specifically geared to an evolutionary agents setup, as it does not require any explicit supervised training error, and is very easily incorporated in current evo...

In [3] it was demonstrated for the first time that crossing minimization of bipartite graphs can be used to perform unsupervised clustering. In this paper, we will present the detailed analysis of the bipartite graph model used to perform unsupervised clustering as in [1, 2, 3]. We will also discuss the effect of data discretization, followed by simulation results demonstrating the noise immuni...

This paper presents a discussion of the collinearity problem in regression and discriminant analysis. The paper describes reasons why the collinearity is a problem for the prediction ability and classification ability of the classical methods. The discussion is based on established formulae for prediction errors. Special emphasis is put on differences and similarities between regression and cla...

This paper presents a multi-objective and multi-service location-allocation model with capacity planning to design a healthcare facilities network through considering a referral system. Therefore, a mixed integer nonlinear programming (MINLP) model containing two objective functions is proposed. The first objective function is  relates to minimization of total opening cost, minimization of tota...

[1] J.-L. Guermond and B. Popov, Linear advection with ill-posed boundary conditions via L1-minimization, Numerical Analysis and Modeling 4 (2007), 39–47. [2] J.-L. Guermond and B. Popov, L1-minimization methods for Hamilton-Jacobi equations: the one-dimensional case, submitted. [3] J.-L. Guermond and B. Popov, L1-approximation of stationary Hamilton-Jacobi equations, submitted. [4] J.-L. Guerm...