We propose a fast shape decomposition method for granular microstructures using a 3-D approach based on medial axis. We define a two-step algorithm: the first step relies on a notion of digital flow to obtain a preliminary over-decomposition from medial balls. During a second step, we use geometric criteria to obtain a relevant and precise volumetric decomposition. We apply our algorithm to 3-D...

This work aims at understanding the structure of process algebras via holonomy decomposition. In that connection, the work studies the skeleton of the transformation semigroup which is obtained from the natural transition relation between the processes of process algebra, and observes that it is of height one.

Crossword puzzle solving is a classic constraint satisfaction problem, but, when solving a real puzzle, the mapping from clues to variable domains is not perfectly crisp. At best, clues induce a probability distribution over viable targets, which must somehow be respected along with the constraints of the puzzle. Motivated by this type of problem, we provide a formal model of constraint satisfa...

Using new household survey data for 1995 and 2002, we investigate the size of China’s urban-rural income gap, the gap’s contribution to overall inequality in China, and the factors underlying the gap. Our analysis improves on past estimates by using a fuller measure of income, adjusting for spatial price differences and including migrants. Our methods include inequality decomposition by populat...

Crossword puzzle solving is a classic constraint satisfaction problem, but, when solving a real puzzle, the mapping from clues to variable domains is not perfectly crisp. At best, clues induce a probability distribution over viable targets, which must somehow be respected along with the constraints of the puzzle. Motivated by this type of problem, we describe a formal model of constraint satisf...

In this paper we investigate the behavior of mutation-based evolutionary algorithms on highly symmetric binary constraint satisfaction problems. With empirical methods we study why and when these algorithms perform better under the stepwise adaptive weighting of penalties (SAWing) than under the standard penalty function. We observe that SAWing has little effect when the local optima of the sym...

New iterative methods for solving systems of linear inequalities are presented. Each step in these methods consists of finding the orthogonat projection of the current point onto a hyperplane corresponding to a surrogate constraint which is constructed through a positive combination of a group of violated constraints. Both sequential and parallel-implementations are discussed.

Establishing the absence of deadlocks is important in many applications of formal methods. The use of model checking for finding deadlocks in formal models is limited because in many industrial applications the state space is either infinite or much too large to be explored exhaustively. In this paper we propose a constraint-based approach to finding deadlocks employing the ProB constraint solv...

in this paper, downlink resource allocation for a sparse code multiple access (scma) based heterogeneous  cellular networks (hcn) is investigated. the main aim of this paper is to obtain joint power allocation and codebook assignment to achieve the least total system transmit power. in this regard, the proposed objective function is formulated as total transmit power subject to users minimum ra...