The minimum cost spanning tree game (mcst-game) is a well-known model within operations research games that has been widely studied in the literature. In this paper we introduce the multi-criteria version of the mcst-game as a setvalued TU-game. We prove that the extension of Bird s cost allocation rule provides dominance core elements in this game. We also give a family of core solutions that ...

In the field of bio-mechanical simulation, the complexity of the 3D models are usually high and require extensive calculations in order to apply the physics over the simulated objects, but also it requires a minimum error in the mesh displacements calculations. This makes the simulation of soft-tissue a delicate process where there is a trade off between speed and precision depending on the des...

The work presented in this paper deals with the performance analysis of the whole 3D reconstruction process of imaged objects, specifically of the set of geometric primitives describing their outline and extracted from a pair of images knowing their associated camera models. The proposed analysis focuses on error estimation for the edge detection process, the starting step for the whole reconst...

Most of the existing multiple criteria decision-making methods handle one kind of the information imperfections at the same time. Stochastic methods and fuzzy methods constitute typical examples of these methods. However, several multiple criteria modelizations include simultaneously many kinds of the information imperfections. In this work, we propose a multiple criteria aggregation procedure ...

The present work addresses channel estimation based on the Minimum Mean Square Error (MMSE) and Least Square (LS) criteria and also considers time-domain channel statistics. It presents an optimal criterion for the pilots, and corresponding optimal designs enabling complexity reductions. Using a general model for a slowly fading channel, the MMSE and LS estimators and a method for modifications...

The overall number of nearest neighbors in bounded distance decoding (BDD) algorithms is given by No;e = No + NBDD; where NBDD denotes the number of additional, noncodeword, neighbors that are generated during the (suboptimal) decoding process. We identify and enumerate the nearest neighbors associated with the original Generalized Minimum Distance (GMD) and Chase decoding algorithms. After car...

Diagnostic errors are common and costly, but difficult to detect. "Trigger" tools have promise to facilitate detection, but have not been applied specifically for inpatient diagnostic error. We performed a scoping review to collate all individual "trigger" criteria that have been developed or validated that may indicate that an inpatient diagnostic error has occurred. We searched three database...