Although the validation step can appear crucial in the case of clustering adopting fuzzy approaches, the problem of the partition validity obtained by those adopting the hard ones was not tackled. To cure this problem, we propose in this paper fuzzy-hard mapping processes of clustering while benefitting from those adopting the fuzzy case. These mapping processes concern: (1) local and global cl...

In this paper, we study the immunity of bankruptcy rules to manipulation via merging or splitting agents’ claims. We focus on the TAL-family of bankruptcy rules (MorenoTernero & Villar, 2006), a one-parameter family encompassing three classical rules: the Talmud (T ) rule, the constrained equal-awards (A) rule and the constrained equal-losses (L) rule. We show that all rules within the TAL-fami...

A problem in learning latent class models (also known as naive Bayes models with a hidden class variable) is that local maximum parameters are often found. This leads not only to suboptimal parameters, but also to a wrong number of classes (components) for a hidden variable. The standard solution of having many random starting points for the EM algorithm is often too expensive computationally. ...

In history based parametric CAD modeling systems, persistent identification of the topological entities after design modification is mandatory to keep the design intent by recording model creation history and modification history. Persistent identification of geometric and topological entities is necessary in the product design phase as well as in the re-evaluation stage. For the identification...

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...

Allocation rules for cooperative games can be manipulated by coalitions merging into single players, or, conversely, players splitting into a number of smaller units. This paper collects some (im)possibility results on mergingand splitting-proofness of (core) allocation rules for cooperative games with side-payments. JEL classification: C71, D23, D71.

Two-dimensional Euler equations have been solved on an unstructured grid. An upwind finite volume scheme, based on Roe's flux difference splitting method, is used to discretize the equations. Using advancing front method, an initial Delaunay triangulation has been made. The adaptation procedure involves mesh enrichment coarsening in regions of flow with high low gradients of flow properties, ac...

This paper presents a meshless element-free Galerkin method coupled with the radial basis functions (RBFs)-based level set algorithm for topology optimization. The approach provides structural response and corresponding sensitivities at nodal/grid points, solution of RBFs-based formulation updates geometry accordingly. Thus, this unique novel allows optimization problems using single discretiza...